./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_label32.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_label32.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 ba084f2fa236db54388aca511060366bb6c01451f2201814c167025a30650a8b --- Real Ultimate output --- This is Ultimate 0.2.5-wip.fs.cvc5-61a6796-m [2024-10-13 23:28:02,794 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-13 23:28:02,874 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:02,879 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-13 23:28:02,880 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-13 23:28:02,910 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-13 23:28:02,910 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-13 23:28:02,911 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-13 23:28:02,911 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-13 23:28:02,911 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-13 23:28:02,912 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-13 23:28:02,912 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-13 23:28:02,914 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-13 23:28:02,917 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-13 23:28:02,918 INFO L153 SettingsManager]: * Use SBE=true [2024-10-13 23:28:02,918 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-13 23:28:02,918 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-13 23:28:02,918 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-13 23:28:02,919 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-13 23:28:02,919 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-13 23:28:02,919 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-13 23:28:02,921 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-13 23:28:02,921 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-13 23:28:02,922 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-13 23:28:02,922 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-13 23:28:02,922 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-13 23:28:02,922 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-13 23:28:02,923 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-13 23:28:02,923 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-13 23:28:02,923 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-13 23:28:02,923 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-13 23:28:02,924 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-13 23:28:02,924 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-13 23:28:02,925 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-13 23:28:02,925 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-13 23:28:02,926 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-13 23:28:02,926 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-13 23:28:02,926 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-13 23:28:02,927 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-13 23:28:02,927 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-13 23:28:02,937 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-13 23:28:02,938 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-13 23:28:02,938 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 -> ba084f2fa236db54388aca511060366bb6c01451f2201814c167025a30650a8b [2024-10-13 23:28:03,179 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-13 23:28:03,206 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-13 23:28:03,209 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-13 23:28:03,210 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-13 23:28:03,211 INFO L274 PluginConnector]: CDTParser initialized [2024-10-13 23:28:03,212 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem11_label32.c [2024-10-13 23:28:04,571 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-13 23:28:04,874 INFO L384 CDTParser]: Found 1 translation units. [2024-10-13 23:28:04,878 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem11_label32.c [2024-10-13 23:28:04,906 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c44ce9884/35ba6537725e4b75bce30967ab8acc5e/FLAG27daa975f [2024-10-13 23:28:05,155 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c44ce9884/35ba6537725e4b75bce30967ab8acc5e [2024-10-13 23:28:05,158 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-13 23:28:05,160 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-13 23:28:05,162 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-13 23:28:05,163 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-13 23:28:05,167 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-13 23:28:05,168 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 11:28:05" (1/1) ... [2024-10-13 23:28:05,171 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4fb41b83 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 11:28:05, skipping insertion in model container [2024-10-13 23:28:05,172 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 11:28:05" (1/1) ... [2024-10-13 23:28:05,231 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-13 23:28:05,441 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_label32.c[5857,5870] [2024-10-13 23:28:05,690 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-13 23:28:05,702 INFO L200 MainTranslator]: Completed pre-run [2024-10-13 23:28:05,730 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_label32.c[5857,5870] [2024-10-13 23:28:05,842 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-13 23:28:05,863 INFO L204 MainTranslator]: Completed translation [2024-10-13 23:28:05,863 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 11:28:05 WrapperNode [2024-10-13 23:28:05,864 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-13 23:28:05,865 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-13 23:28:05,865 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-13 23:28:05,866 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-13 23:28:05,872 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:05" (1/1) ... [2024-10-13 23:28:05,899 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:05" (1/1) ... [2024-10-13 23:28:05,991 INFO L138 Inliner]: procedures = 14, calls = 8, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 1000 [2024-10-13 23:28:05,992 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-13 23:28:05,993 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-13 23:28:05,994 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-13 23:28:05,994 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-13 23:28:06,005 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:05" (1/1) ... [2024-10-13 23:28:06,006 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:05" (1/1) ... [2024-10-13 23:28:06,024 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:05" (1/1) ... [2024-10-13 23:28:06,159 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:06,159 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:05" (1/1) ... [2024-10-13 23:28:06,159 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:05" (1/1) ... [2024-10-13 23:28:06,225 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:05" (1/1) ... [2024-10-13 23:28:06,234 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:05" (1/1) ... [2024-10-13 23:28:06,256 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:05" (1/1) ... [2024-10-13 23:28:06,263 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:05" (1/1) ... [2024-10-13 23:28:06,280 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-13 23:28:06,281 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-13 23:28:06,281 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-13 23:28:06,282 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-13 23:28:06,283 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 11:28:05" (1/1) ... [2024-10-13 23:28:06,289 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-13 23:28:06,300 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 23:28:06,317 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:06,320 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:06,370 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-13 23:28:06,371 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-13 23:28:06,371 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-13 23:28:06,371 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-13 23:28:06,439 INFO L238 CfgBuilder]: Building ICFG [2024-10-13 23:28:06,441 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-13 23:28:07,963 INFO L? ?]: Removed 129 outVars from TransFormulas that were not future-live. [2024-10-13 23:28:07,963 INFO L287 CfgBuilder]: Performing block encoding [2024-10-13 23:28:08,029 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-13 23:28:08,029 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-13 23:28:08,029 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 11:28:08 BoogieIcfgContainer [2024-10-13 23:28:08,029 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-13 23:28:08,033 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-13 23:28:08,033 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-13 23:28:08,036 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-13 23:28:08,036 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.10 11:28:05" (1/3) ... [2024-10-13 23:28:08,037 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@375deb24 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.10 11:28:08, skipping insertion in model container [2024-10-13 23:28:08,037 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 11:28:05" (2/3) ... [2024-10-13 23:28:08,037 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@375deb24 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.10 11:28:08, skipping insertion in model container [2024-10-13 23:28:08,038 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 11:28:08" (3/3) ... [2024-10-13 23:28:08,039 INFO L112 eAbstractionObserver]: Analyzing ICFG Problem11_label32.c [2024-10-13 23:28:08,059 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-13 23:28:08,059 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-13 23:28:08,144 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-13 23:28:08,150 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;@45f19d03, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-13 23:28:08,153 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-13 23:28:08,158 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:08,166 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2024-10-13 23:28:08,167 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 23:28:08,168 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] [2024-10-13 23:28:08,169 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 23:28:08,174 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 23:28:08,175 INFO L85 PathProgramCache]: Analyzing trace with hash -1199903927, now seen corresponding path program 1 times [2024-10-13 23:28:08,183 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 23:28:08,184 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [192590807] [2024-10-13 23:28:08,184 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 23:28:08,184 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 23:28:08,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 23:28:08,360 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:08,361 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 23:28:08,361 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [192590807] [2024-10-13 23:28:08,362 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [192590807] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 23:28:08,362 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 23:28:08,362 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-13 23:28:08,368 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [184195582] [2024-10-13 23:28:08,368 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 23:28:08,372 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-13 23:28:08,373 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 23:28:08,409 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-13 23:28:08,410 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-13 23:28:08,413 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 19.5) internal successors, (39), 2 states have internal predecessors, (39), 0 states have call successors, (0), 0 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:08,467 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 23:28:08,470 INFO L93 Difference]: Finished difference Result 441 states and 839 transitions. [2024-10-13 23:28:08,474 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-13 23:28:08,475 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 19.5) internal successors, (39), 2 states have internal predecessors, (39), 0 states have call successors, (0), 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 39 [2024-10-13 23:28:08,476 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 23:28:08,487 INFO L225 Difference]: With dead ends: 441 [2024-10-13 23:28:08,488 INFO L226 Difference]: Without dead ends: 219 [2024-10-13 23:28:08,492 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:08,497 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:08,499 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:08,516 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 219 states. [2024-10-13 23:28:08,544 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 219 to 219. [2024-10-13 23:28:08,548 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:08,553 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 219 states to 219 states and 355 transitions. [2024-10-13 23:28:08,554 INFO L78 Accepts]: Start accepts. Automaton has 219 states and 355 transitions. Word has length 39 [2024-10-13 23:28:08,555 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 23:28:08,555 INFO L471 AbstractCegarLoop]: Abstraction has 219 states and 355 transitions. [2024-10-13 23:28:08,555 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 19.5) internal successors, (39), 2 states have internal predecessors, (39), 0 states have call successors, (0), 0 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:08,555 INFO L276 IsEmpty]: Start isEmpty. Operand 219 states and 355 transitions. [2024-10-13 23:28:08,556 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2024-10-13 23:28:08,556 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 23:28:08,557 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] [2024-10-13 23:28:08,557 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-13 23:28:08,557 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 23:28:08,558 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 23:28:08,558 INFO L85 PathProgramCache]: Analyzing trace with hash 428400437, now seen corresponding path program 1 times [2024-10-13 23:28:08,558 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 23:28:08,558 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [777014755] [2024-10-13 23:28:08,559 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 23:28:08,559 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 23:28:08,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 23:28:08,757 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:08,759 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 23:28:08,759 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [777014755] [2024-10-13 23:28:08,760 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [777014755] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 23:28:08,760 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 23:28:08,760 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-13 23:28:08,760 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1582179882] [2024-10-13 23:28:08,760 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 23:28:08,761 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-13 23:28:08,761 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 23:28:08,762 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-13 23:28:08,763 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 23:28:08,763 INFO L87 Difference]: Start difference. First operand 219 states and 355 transitions. Second operand has 3 states, 3 states have (on average 13.0) internal successors, (39), 2 states have internal predecessors, (39), 0 states have call successors, (0), 0 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:09,730 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 23:28:09,730 INFO L93 Difference]: Finished difference Result 630 states and 1026 transitions. [2024-10-13 23:28:09,731 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-13 23:28:09,732 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 13.0) internal successors, (39), 2 states have internal predecessors, (39), 0 states have call successors, (0), 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 39 [2024-10-13 23:28:09,732 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 23:28:09,734 INFO L225 Difference]: With dead ends: 630 [2024-10-13 23:28:09,736 INFO L226 Difference]: Without dead ends: 412 [2024-10-13 23:28:09,737 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:09,740 INFO L432 NwaCegarLoop]: 126 mSDtfsCounter, 184 mSDsluCounter, 29 mSDsCounter, 0 mSdLazyCounter, 536 mSolverCounterSat, 98 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 184 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:09,741 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [184 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:09,743 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 412 states. [2024-10-13 23:28:09,764 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 412 to 412. [2024-10-13 23:28:09,765 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:09,766 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 412 states to 412 states and 598 transitions. [2024-10-13 23:28:09,767 INFO L78 Accepts]: Start accepts. Automaton has 412 states and 598 transitions. Word has length 39 [2024-10-13 23:28:09,767 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 23:28:09,767 INFO L471 AbstractCegarLoop]: Abstraction has 412 states and 598 transitions. [2024-10-13 23:28:09,767 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 13.0) internal successors, (39), 2 states have internal predecessors, (39), 0 states have call successors, (0), 0 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:09,768 INFO L276 IsEmpty]: Start isEmpty. Operand 412 states and 598 transitions. [2024-10-13 23:28:09,770 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2024-10-13 23:28:09,770 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 23:28:09,771 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:09,771 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-13 23:28:09,772 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 23:28:09,773 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 23:28:09,773 INFO L85 PathProgramCache]: Analyzing trace with hash 425145965, now seen corresponding path program 1 times [2024-10-13 23:28:09,773 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 23:28:09,773 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2034184981] [2024-10-13 23:28:09,774 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 23:28:09,774 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 23:28:09,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 23:28:09,975 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 37 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 23:28:09,976 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 23:28:09,976 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2034184981] [2024-10-13 23:28:09,976 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2034184981] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 23:28:09,976 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 23:28:09,976 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-13 23:28:09,977 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [712371320] [2024-10-13 23:28:09,977 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 23:28:09,977 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-13 23:28:09,977 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 23:28:09,978 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-13 23:28:09,980 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 23:28:09,980 INFO L87 Difference]: Start difference. First operand 412 states and 598 transitions. Second operand has 3 states, 3 states have (on average 35.666666666666664) internal successors, (107), 2 states have internal predecessors, (107), 0 states have call successors, (0), 0 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:10,716 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 23:28:10,716 INFO L93 Difference]: Finished difference Result 1210 states and 1762 transitions. [2024-10-13 23:28:10,720 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-13 23:28:10,721 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 35.666666666666664) internal successors, (107), 2 states have internal predecessors, (107), 0 states have call successors, (0), 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 107 [2024-10-13 23:28:10,721 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 23:28:10,724 INFO L225 Difference]: With dead ends: 1210 [2024-10-13 23:28:10,724 INFO L226 Difference]: Without dead ends: 799 [2024-10-13 23:28:10,725 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:10,726 INFO L432 NwaCegarLoop]: 99 mSDtfsCounter, 142 mSDsluCounter, 19 mSDsCounter, 0 mSdLazyCounter, 524 mSolverCounterSat, 148 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 142 SdHoareTripleChecker+Valid, 118 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:10,727 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [142 Valid, 118 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:10,728 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 799 states. [2024-10-13 23:28:10,761 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 799 to 788. [2024-10-13 23:28:10,763 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 788 states, 787 states have (on average 1.3748411689961881) internal successors, (1082), 787 states have internal predecessors, (1082), 0 states have call successors, (0), 0 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:10,768 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 788 states to 788 states and 1082 transitions. [2024-10-13 23:28:10,768 INFO L78 Accepts]: Start accepts. Automaton has 788 states and 1082 transitions. Word has length 107 [2024-10-13 23:28:10,772 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 23:28:10,772 INFO L471 AbstractCegarLoop]: Abstraction has 788 states and 1082 transitions. [2024-10-13 23:28:10,773 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 35.666666666666664) internal successors, (107), 2 states have internal predecessors, (107), 0 states have call successors, (0), 0 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:10,773 INFO L276 IsEmpty]: Start isEmpty. Operand 788 states and 1082 transitions. [2024-10-13 23:28:10,776 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2024-10-13 23:28:10,776 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 23:28:10,776 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:10,776 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-13 23:28:10,777 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 23:28:10,777 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 23:28:10,778 INFO L85 PathProgramCache]: Analyzing trace with hash 629327432, now seen corresponding path program 1 times [2024-10-13 23:28:10,778 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 23:28:10,778 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1492817552] [2024-10-13 23:28:10,778 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 23:28:10,779 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 23:28:10,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 23:28:11,159 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 37 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 23:28:11,160 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 23:28:11,160 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1492817552] [2024-10-13 23:28:11,160 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1492817552] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 23:28:11,160 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 23:28:11,160 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-13 23:28:11,161 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [941353791] [2024-10-13 23:28:11,161 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 23:28:11,161 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-13 23:28:11,161 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 23:28:11,162 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-13 23:28:11,162 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 23:28:11,162 INFO L87 Difference]: Start difference. First operand 788 states and 1082 transitions. Second operand has 3 states, 3 states have (on average 36.333333333333336) internal successors, (109), 2 states have internal predecessors, (109), 0 states have call successors, (0), 0 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:11,813 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 23:28:11,813 INFO L93 Difference]: Finished difference Result 1944 states and 2611 transitions. [2024-10-13 23:28:11,814 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-13 23:28:11,814 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 36.333333333333336) internal successors, (109), 2 states have internal predecessors, (109), 0 states have call successors, (0), 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 109 [2024-10-13 23:28:11,814 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 23:28:11,818 INFO L225 Difference]: With dead ends: 1944 [2024-10-13 23:28:11,819 INFO L226 Difference]: Without dead ends: 1157 [2024-10-13 23:28:11,820 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:11,821 INFO L432 NwaCegarLoop]: 166 mSDtfsCounter, 119 mSDsluCounter, 22 mSDsCounter, 0 mSdLazyCounter, 532 mSolverCounterSat, 37 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 119 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:11,821 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [119 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:11,823 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1157 states. [2024-10-13 23:28:11,841 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1157 to 1156. [2024-10-13 23:28:11,843 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1156 states, 1155 states have (on average 1.270995670995671) internal successors, (1468), 1155 states have internal predecessors, (1468), 0 states have call successors, (0), 0 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:11,846 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1156 states to 1156 states and 1468 transitions. [2024-10-13 23:28:11,848 INFO L78 Accepts]: Start accepts. Automaton has 1156 states and 1468 transitions. Word has length 109 [2024-10-13 23:28:11,849 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 23:28:11,850 INFO L471 AbstractCegarLoop]: Abstraction has 1156 states and 1468 transitions. [2024-10-13 23:28:11,850 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 36.333333333333336) internal successors, (109), 2 states have internal predecessors, (109), 0 states have call successors, (0), 0 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:11,850 INFO L276 IsEmpty]: Start isEmpty. Operand 1156 states and 1468 transitions. [2024-10-13 23:28:11,853 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 167 [2024-10-13 23:28:11,853 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 23:28:11,854 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:11,854 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-13 23:28:11,854 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 23:28:11,855 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 23:28:11,855 INFO L85 PathProgramCache]: Analyzing trace with hash -1157723100, now seen corresponding path program 1 times [2024-10-13 23:28:11,855 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 23:28:11,855 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1363932653] [2024-10-13 23:28:11,855 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 23:28:11,856 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 23:28:11,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 23:28:12,199 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 37 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 23:28:12,200 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 23:28:12,200 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1363932653] [2024-10-13 23:28:12,200 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1363932653] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 23:28:12,200 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 23:28:12,201 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-13 23:28:12,201 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1059687261] [2024-10-13 23:28:12,201 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 23:28:12,201 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-13 23:28:12,202 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 23:28:12,205 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-13 23:28:12,205 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 23:28:12,206 INFO L87 Difference]: Start difference. First operand 1156 states and 1468 transitions. Second operand has 3 states, 3 states have (on average 55.333333333333336) internal successors, (166), 3 states have internal predecessors, (166), 0 states have call successors, (0), 0 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:13,028 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 23:28:13,029 INFO L93 Difference]: Finished difference Result 2518 states and 3348 transitions. [2024-10-13 23:28:13,030 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-13 23:28:13,030 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 55.333333333333336) internal successors, (166), 3 states have internal predecessors, (166), 0 states have call successors, (0), 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 166 [2024-10-13 23:28:13,032 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 23:28:13,037 INFO L225 Difference]: With dead ends: 2518 [2024-10-13 23:28:13,037 INFO L226 Difference]: Without dead ends: 1547 [2024-10-13 23:28:13,039 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:13,042 INFO L432 NwaCegarLoop]: 288 mSDtfsCounter, 195 mSDsluCounter, 31 mSDsCounter, 0 mSdLazyCounter, 584 mSolverCounterSat, 51 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 195 SdHoareTripleChecker+Valid, 319 SdHoareTripleChecker+Invalid, 635 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 51 IncrementalHoareTripleChecker+Valid, 584 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-10-13 23:28:13,044 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [195 Valid, 319 Invalid, 635 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [51 Valid, 584 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-10-13 23:28:13,046 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1547 states. [2024-10-13 23:28:13,077 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1547 to 1544. [2024-10-13 23:28:13,083 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1544 states, 1543 states have (on average 1.2935839274141283) internal successors, (1996), 1543 states have internal predecessors, (1996), 0 states have call successors, (0), 0 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:13,088 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1544 states to 1544 states and 1996 transitions. [2024-10-13 23:28:13,089 INFO L78 Accepts]: Start accepts. Automaton has 1544 states and 1996 transitions. Word has length 166 [2024-10-13 23:28:13,090 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 23:28:13,090 INFO L471 AbstractCegarLoop]: Abstraction has 1544 states and 1996 transitions. [2024-10-13 23:28:13,091 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 55.333333333333336) internal successors, (166), 3 states have internal predecessors, (166), 0 states have call successors, (0), 0 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:13,092 INFO L276 IsEmpty]: Start isEmpty. Operand 1544 states and 1996 transitions. [2024-10-13 23:28:13,095 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 222 [2024-10-13 23:28:13,097 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 23:28:13,098 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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:13,098 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-10-13 23:28:13,098 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 23:28:13,098 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 23:28:13,099 INFO L85 PathProgramCache]: Analyzing trace with hash -51858748, now seen corresponding path program 1 times [2024-10-13 23:28:13,099 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 23:28:13,099 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [45794257] [2024-10-13 23:28:13,099 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 23:28:13,099 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 23:28:13,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 23:28:13,359 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 75 proven. 0 refuted. 0 times theorem prover too weak. 69 trivial. 0 not checked. [2024-10-13 23:28:13,359 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 23:28:13,360 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [45794257] [2024-10-13 23:28:13,360 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [45794257] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 23:28:13,360 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 23:28:13,362 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-13 23:28:13,362 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [24388760] [2024-10-13 23:28:13,362 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 23:28:13,362 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-13 23:28:13,363 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 23:28:13,363 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-13 23:28:13,363 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 23:28:13,363 INFO L87 Difference]: Start difference. First operand 1544 states and 1996 transitions. Second operand has 3 states, 3 states have (on average 51.0) internal successors, (153), 3 states have internal predecessors, (153), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 23:28:14,248 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 23:28:14,249 INFO L93 Difference]: Finished difference Result 3649 states and 4814 transitions. [2024-10-13 23:28:14,249 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-13 23:28:14,249 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 51.0) internal successors, (153), 3 states have internal predecessors, (153), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 221 [2024-10-13 23:28:14,251 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 23:28:14,259 INFO L225 Difference]: With dead ends: 3649 [2024-10-13 23:28:14,260 INFO L226 Difference]: Without dead ends: 2290 [2024-10-13 23:28:14,262 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:14,265 INFO L432 NwaCegarLoop]: 369 mSDtfsCounter, 157 mSDsluCounter, 20 mSDsCounter, 0 mSdLazyCounter, 597 mSolverCounterSat, 86 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 157 SdHoareTripleChecker+Valid, 389 SdHoareTripleChecker+Invalid, 683 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 86 IncrementalHoareTripleChecker+Valid, 597 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-10-13 23:28:14,266 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [157 Valid, 389 Invalid, 683 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [86 Valid, 597 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-10-13 23:28:14,268 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2290 states. [2024-10-13 23:28:14,293 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2290 to 2097. [2024-10-13 23:28:14,295 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2097 states, 2096 states have (on average 1.2676526717557253) internal successors, (2657), 2096 states have internal predecessors, (2657), 0 states have call successors, (0), 0 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:14,300 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2097 states to 2097 states and 2657 transitions. [2024-10-13 23:28:14,304 INFO L78 Accepts]: Start accepts. Automaton has 2097 states and 2657 transitions. Word has length 221 [2024-10-13 23:28:14,306 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 23:28:14,306 INFO L471 AbstractCegarLoop]: Abstraction has 2097 states and 2657 transitions. [2024-10-13 23:28:14,306 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 51.0) internal successors, (153), 3 states have internal predecessors, (153), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 23:28:14,306 INFO L276 IsEmpty]: Start isEmpty. Operand 2097 states and 2657 transitions. [2024-10-13 23:28:14,309 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 228 [2024-10-13 23:28:14,309 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 23:28:14,309 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2024-10-13 23:28:14,309 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-10-13 23:28:14,310 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 23:28:14,310 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 23:28:14,310 INFO L85 PathProgramCache]: Analyzing trace with hash 1165385045, now seen corresponding path program 1 times [2024-10-13 23:28:14,310 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 23:28:14,310 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1845116227] [2024-10-13 23:28:14,310 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 23:28:14,311 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 23:28:14,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 23:28:14,494 INFO L134 CoverageAnalysis]: Checked inductivity of 150 backedges. 75 proven. 0 refuted. 0 times theorem prover too weak. 75 trivial. 0 not checked. [2024-10-13 23:28:14,494 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 23:28:14,495 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1845116227] [2024-10-13 23:28:14,495 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1845116227] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 23:28:14,495 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 23:28:14,495 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-13 23:28:14,496 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1132152340] [2024-10-13 23:28:14,496 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 23:28:14,496 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-13 23:28:14,496 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 23:28:14,497 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-13 23:28:14,497 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 23:28:14,497 INFO L87 Difference]: Start difference. First operand 2097 states and 2657 transitions. Second operand has 3 states, 3 states have (on average 51.0) internal successors, (153), 3 states have internal predecessors, (153), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 23:28:15,305 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 23:28:15,306 INFO L93 Difference]: Finished difference Result 5850 states and 7487 transitions. [2024-10-13 23:28:15,306 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-13 23:28:15,307 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 51.0) internal successors, (153), 3 states have internal predecessors, (153), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 227 [2024-10-13 23:28:15,307 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 23:28:15,320 INFO L225 Difference]: With dead ends: 5850 [2024-10-13 23:28:15,320 INFO L226 Difference]: Without dead ends: 3754 [2024-10-13 23:28:15,323 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:15,324 INFO L432 NwaCegarLoop]: 126 mSDtfsCounter, 170 mSDsluCounter, 16 mSDsCounter, 0 mSdLazyCounter, 573 mSolverCounterSat, 101 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 170 SdHoareTripleChecker+Valid, 142 SdHoareTripleChecker+Invalid, 674 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 101 IncrementalHoareTripleChecker+Valid, 573 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-10-13 23:28:15,324 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [170 Valid, 142 Invalid, 674 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [101 Valid, 573 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-10-13 23:28:15,328 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3754 states. [2024-10-13 23:28:15,373 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3754 to 3754. [2024-10-13 23:28:15,378 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3754 states, 3753 states have (on average 1.2454036770583534) internal successors, (4674), 3753 states have internal predecessors, (4674), 0 states have call successors, (0), 0 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:15,387 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3754 states to 3754 states and 4674 transitions. [2024-10-13 23:28:15,388 INFO L78 Accepts]: Start accepts. Automaton has 3754 states and 4674 transitions. Word has length 227 [2024-10-13 23:28:15,388 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 23:28:15,388 INFO L471 AbstractCegarLoop]: Abstraction has 3754 states and 4674 transitions. [2024-10-13 23:28:15,389 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 51.0) internal successors, (153), 3 states have internal predecessors, (153), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 23:28:15,389 INFO L276 IsEmpty]: Start isEmpty. Operand 3754 states and 4674 transitions. [2024-10-13 23:28:15,393 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 259 [2024-10-13 23:28:15,393 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 23:28:15,394 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2024-10-13 23:28:15,394 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-10-13 23:28:15,394 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 23:28:15,395 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 23:28:15,395 INFO L85 PathProgramCache]: Analyzing trace with hash 1241078592, now seen corresponding path program 1 times [2024-10-13 23:28:15,395 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 23:28:15,395 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1474475551] [2024-10-13 23:28:15,395 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 23:28:15,396 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 23:28:15,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 23:28:15,644 INFO L134 CoverageAnalysis]: Checked inductivity of 171 backedges. 75 proven. 0 refuted. 0 times theorem prover too weak. 96 trivial. 0 not checked. [2024-10-13 23:28:15,645 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 23:28:15,645 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1474475551] [2024-10-13 23:28:15,645 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1474475551] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 23:28:15,645 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 23:28:15,645 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-13 23:28:15,646 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [246666629] [2024-10-13 23:28:15,646 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 23:28:15,646 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-13 23:28:15,646 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 23:28:15,647 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-13 23:28:15,647 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 23:28:15,647 INFO L87 Difference]: Start difference. First operand 3754 states and 4674 transitions. Second operand has 3 states, 3 states have (on average 54.333333333333336) internal successors, (163), 3 states have internal predecessors, (163), 0 states have call successors, (0), 0 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:16,439 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 23:28:16,439 INFO L93 Difference]: Finished difference Result 8621 states and 10848 transitions. [2024-10-13 23:28:16,472 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-13 23:28:16,472 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 54.333333333333336) internal successors, (163), 3 states have internal predecessors, (163), 0 states have call successors, (0), 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 258 [2024-10-13 23:28:16,472 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 23:28:16,487 INFO L225 Difference]: With dead ends: 8621 [2024-10-13 23:28:16,488 INFO L226 Difference]: Without dead ends: 4868 [2024-10-13 23:28:16,491 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:16,492 INFO L432 NwaCegarLoop]: 367 mSDtfsCounter, 156 mSDsluCounter, 21 mSDsCounter, 0 mSdLazyCounter, 587 mSolverCounterSat, 92 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 156 SdHoareTripleChecker+Valid, 388 SdHoareTripleChecker+Invalid, 679 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 92 IncrementalHoareTripleChecker+Valid, 587 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-10-13 23:28:16,492 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [156 Valid, 388 Invalid, 679 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [92 Valid, 587 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-10-13 23:28:16,496 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4868 states. [2024-10-13 23:28:16,547 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4868 to 4859. [2024-10-13 23:28:16,555 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4859 states, 4858 states have (on average 1.225195553725813) internal successors, (5952), 4858 states have internal predecessors, (5952), 0 states have call successors, (0), 0 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:16,565 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4859 states to 4859 states and 5952 transitions. [2024-10-13 23:28:16,565 INFO L78 Accepts]: Start accepts. Automaton has 4859 states and 5952 transitions. Word has length 258 [2024-10-13 23:28:16,566 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 23:28:16,566 INFO L471 AbstractCegarLoop]: Abstraction has 4859 states and 5952 transitions. [2024-10-13 23:28:16,566 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 54.333333333333336) internal successors, (163), 3 states have internal predecessors, (163), 0 states have call successors, (0), 0 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:16,567 INFO L276 IsEmpty]: Start isEmpty. Operand 4859 states and 5952 transitions. [2024-10-13 23:28:16,573 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 305 [2024-10-13 23:28:16,573 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 23:28:16,573 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:16,574 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-10-13 23:28:16,574 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 23:28:16,574 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 23:28:16,574 INFO L85 PathProgramCache]: Analyzing trace with hash -289621257, now seen corresponding path program 1 times [2024-10-13 23:28:16,574 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 23:28:16,575 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1913795684] [2024-10-13 23:28:16,575 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 23:28:16,575 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 23:28:16,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 23:28:16,814 INFO L134 CoverageAnalysis]: Checked inductivity of 334 backedges. 113 proven. 0 refuted. 0 times theorem prover too weak. 221 trivial. 0 not checked. [2024-10-13 23:28:16,815 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 23:28:16,815 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1913795684] [2024-10-13 23:28:16,815 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1913795684] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 23:28:16,815 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 23:28:16,816 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-13 23:28:16,816 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [66614639] [2024-10-13 23:28:16,816 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 23:28:16,816 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-13 23:28:16,816 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 23:28:16,817 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-13 23:28:16,817 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 23:28:16,818 INFO L87 Difference]: Start difference. First operand 4859 states and 5952 transitions. Second operand has 3 states, 3 states have (on average 51.333333333333336) internal successors, (154), 3 states have internal predecessors, (154), 0 states have call successors, (0), 0 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:17,615 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 23:28:17,615 INFO L93 Difference]: Finished difference Result 11004 states and 13677 transitions. [2024-10-13 23:28:17,619 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-13 23:28:17,619 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 51.333333333333336) internal successors, (154), 3 states have internal predecessors, (154), 0 states have call successors, (0), 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 304 [2024-10-13 23:28:17,620 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 23:28:17,638 INFO L225 Difference]: With dead ends: 11004 [2024-10-13 23:28:17,638 INFO L226 Difference]: Without dead ends: 6146 [2024-10-13 23:28:17,643 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:17,644 INFO L432 NwaCegarLoop]: 123 mSDtfsCounter, 183 mSDsluCounter, 26 mSDsCounter, 0 mSdLazyCounter, 498 mSolverCounterSat, 133 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 183 SdHoareTripleChecker+Valid, 149 SdHoareTripleChecker+Invalid, 631 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 133 IncrementalHoareTripleChecker+Valid, 498 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-10-13 23:28:17,644 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [183 Valid, 149 Invalid, 631 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [133 Valid, 498 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-10-13 23:28:17,649 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6146 states. [2024-10-13 23:28:17,726 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6146 to 4852. [2024-10-13 23:28:17,734 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4852 states, 4851 states have (on average 1.2249020820449392) internal successors, (5942), 4851 states have internal predecessors, (5942), 0 states have call successors, (0), 0 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:17,746 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4852 states to 4852 states and 5942 transitions. [2024-10-13 23:28:17,747 INFO L78 Accepts]: Start accepts. Automaton has 4852 states and 5942 transitions. Word has length 304 [2024-10-13 23:28:17,748 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 23:28:17,748 INFO L471 AbstractCegarLoop]: Abstraction has 4852 states and 5942 transitions. [2024-10-13 23:28:17,748 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 51.333333333333336) internal successors, (154), 3 states have internal predecessors, (154), 0 states have call successors, (0), 0 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:17,748 INFO L276 IsEmpty]: Start isEmpty. Operand 4852 states and 5942 transitions. [2024-10-13 23:28:17,758 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 324 [2024-10-13 23:28:17,759 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 23:28:17,759 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2024-10-13 23:28:17,759 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-10-13 23:28:17,760 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 23:28:17,760 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 23:28:17,760 INFO L85 PathProgramCache]: Analyzing trace with hash 171020457, now seen corresponding path program 1 times [2024-10-13 23:28:17,761 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 23:28:17,761 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1905676221] [2024-10-13 23:28:17,761 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 23:28:17,761 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 23:28:17,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 23:28:18,487 INFO L134 CoverageAnalysis]: Checked inductivity of 196 backedges. 143 proven. 53 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 23:28:18,488 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 23:28:18,488 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1905676221] [2024-10-13 23:28:18,488 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1905676221] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-13 23:28:18,488 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1085616759] [2024-10-13 23:28:18,488 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 23:28:18,489 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-13 23:28:18,489 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 23:28:18,491 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:18,492 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:18,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 23:28:18,659 INFO L255 TraceCheckSpWp]: Trace formula consists of 433 conjuncts, 13 conjuncts are in the unsatisfiable core [2024-10-13 23:28:18,682 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 23:28:20,410 INFO L134 CoverageAnalysis]: Checked inductivity of 196 backedges. 143 proven. 53 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 23:28:20,411 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-13 23:28:22,403 INFO L134 CoverageAnalysis]: Checked inductivity of 196 backedges. 143 proven. 53 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 23:28:22,403 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1085616759] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-13 23:28:22,403 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-13 23:28:22,403 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 7 [2024-10-13 23:28:22,404 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1889471474] [2024-10-13 23:28:22,404 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-13 23:28:22,405 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-13 23:28:22,405 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 23:28:22,406 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-13 23:28:22,406 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2024-10-13 23:28:22,406 INFO L87 Difference]: Start difference. First operand 4852 states and 5942 transitions. Second operand has 8 states, 8 states have (on average 73.0) internal successors, (584), 7 states have internal predecessors, (584), 0 states have call successors, (0), 0 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:24,778 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 23:28:24,778 INFO L93 Difference]: Finished difference Result 13799 states and 16836 transitions. [2024-10-13 23:28:24,778 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-10-13 23:28:24,779 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 73.0) internal successors, (584), 7 states have internal predecessors, (584), 0 states have call successors, (0), 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 323 [2024-10-13 23:28:24,779 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 23:28:24,803 INFO L225 Difference]: With dead ends: 13799 [2024-10-13 23:28:24,803 INFO L226 Difference]: Without dead ends: 8948 [2024-10-13 23:28:24,810 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 655 GetRequests, 642 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 29 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=75, Invalid=135, Unknown=0, NotChecked=0, Total=210 [2024-10-13 23:28:24,811 INFO L432 NwaCegarLoop]: 109 mSDtfsCounter, 1011 mSDsluCounter, 64 mSDsCounter, 0 mSdLazyCounter, 2322 mSolverCounterSat, 418 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1011 SdHoareTripleChecker+Valid, 173 SdHoareTripleChecker+Invalid, 2740 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 418 IncrementalHoareTripleChecker+Valid, 2322 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.2s IncrementalHoareTripleChecker+Time [2024-10-13 23:28:24,811 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1011 Valid, 173 Invalid, 2740 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [418 Valid, 2322 Invalid, 0 Unknown, 0 Unchecked, 2.2s Time] [2024-10-13 23:28:24,819 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8948 states. [2024-10-13 23:28:24,887 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8948 to 5034. [2024-10-13 23:28:24,894 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5034 states, 5033 states have (on average 1.2225312934631432) internal successors, (6153), 5033 states have internal predecessors, (6153), 0 states have call successors, (0), 0 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:24,903 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5034 states to 5034 states and 6153 transitions. [2024-10-13 23:28:24,903 INFO L78 Accepts]: Start accepts. Automaton has 5034 states and 6153 transitions. Word has length 323 [2024-10-13 23:28:24,904 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 23:28:24,904 INFO L471 AbstractCegarLoop]: Abstraction has 5034 states and 6153 transitions. [2024-10-13 23:28:24,904 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 73.0) internal successors, (584), 7 states have internal predecessors, (584), 0 states have call successors, (0), 0 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:24,904 INFO L276 IsEmpty]: Start isEmpty. Operand 5034 states and 6153 transitions. [2024-10-13 23:28:24,912 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 345 [2024-10-13 23:28:24,913 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 23:28:24,914 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2024-10-13 23:28:24,932 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-10-13 23:28:25,118 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2024-10-13 23:28:25,119 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 23:28:25,119 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 23:28:25,119 INFO L85 PathProgramCache]: Analyzing trace with hash 79230135, now seen corresponding path program 1 times [2024-10-13 23:28:25,119 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 23:28:25,120 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1727061318] [2024-10-13 23:28:25,120 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 23:28:25,120 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 23:28:25,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 23:28:25,508 INFO L134 CoverageAnalysis]: Checked inductivity of 217 backedges. 217 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 23:28:25,508 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 23:28:25,508 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1727061318] [2024-10-13 23:28:25,509 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1727061318] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 23:28:25,509 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 23:28:25,509 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-13 23:28:25,509 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [647250126] [2024-10-13 23:28:25,509 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 23:28:25,510 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-13 23:28:25,510 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 23:28:25,511 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-13 23:28:25,511 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-10-13 23:28:25,511 INFO L87 Difference]: Start difference. First operand 5034 states and 6153 transitions. Second operand has 4 states, 4 states have (on average 86.0) internal successors, (344), 4 states have internal predecessors, (344), 0 states have call successors, (0), 0 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:26,648 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 23:28:26,649 INFO L93 Difference]: Finished difference Result 13947 states and 17065 transitions. [2024-10-13 23:28:26,650 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-13 23:28:26,650 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 86.0) internal successors, (344), 4 states have internal predecessors, (344), 0 states have call successors, (0), 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 344 [2024-10-13 23:28:26,651 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 23:28:26,668 INFO L225 Difference]: With dead ends: 13947 [2024-10-13 23:28:26,668 INFO L226 Difference]: Without dead ends: 8914 [2024-10-13 23:28:26,674 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:28:26,675 INFO L432 NwaCegarLoop]: 34 mSDtfsCounter, 249 mSDsluCounter, 28 mSDsCounter, 0 mSdLazyCounter, 1100 mSolverCounterSat, 236 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 249 SdHoareTripleChecker+Valid, 62 SdHoareTripleChecker+Invalid, 1336 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 236 IncrementalHoareTripleChecker+Valid, 1100 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2024-10-13 23:28:26,675 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [249 Valid, 62 Invalid, 1336 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [236 Valid, 1100 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2024-10-13 23:28:26,681 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8914 states. [2024-10-13 23:28:26,763 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8914 to 7440. [2024-10-13 23:28:26,780 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7440 states, 7439 states have (on average 1.1923645651297217) internal successors, (8870), 7439 states have internal predecessors, (8870), 0 states have call successors, (0), 0 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:26,796 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7440 states to 7440 states and 8870 transitions. [2024-10-13 23:28:26,797 INFO L78 Accepts]: Start accepts. Automaton has 7440 states and 8870 transitions. Word has length 344 [2024-10-13 23:28:26,797 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 23:28:26,797 INFO L471 AbstractCegarLoop]: Abstraction has 7440 states and 8870 transitions. [2024-10-13 23:28:26,798 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 86.0) internal successors, (344), 4 states have internal predecessors, (344), 0 states have call successors, (0), 0 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:26,798 INFO L276 IsEmpty]: Start isEmpty. Operand 7440 states and 8870 transitions. [2024-10-13 23:28:26,815 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 419 [2024-10-13 23:28:26,815 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 23:28:26,815 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, 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, 3, 3, 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] [2024-10-13 23:28:26,815 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-10-13 23:28:26,816 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 23:28:26,816 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 23:28:26,816 INFO L85 PathProgramCache]: Analyzing trace with hash -467312380, now seen corresponding path program 1 times [2024-10-13 23:28:26,816 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 23:28:26,816 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [812977175] [2024-10-13 23:28:26,817 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 23:28:26,817 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 23:28:26,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 23:28:27,282 INFO L134 CoverageAnalysis]: Checked inductivity of 433 backedges. 329 proven. 0 refuted. 0 times theorem prover too weak. 104 trivial. 0 not checked. [2024-10-13 23:28:27,283 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 23:28:27,283 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [812977175] [2024-10-13 23:28:27,283 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [812977175] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 23:28:27,283 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 23:28:27,283 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-13 23:28:27,284 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1830482253] [2024-10-13 23:28:27,284 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 23:28:27,284 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-13 23:28:27,284 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 23:28:27,285 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-13 23:28:27,285 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-10-13 23:28:27,286 INFO L87 Difference]: Start difference. First operand 7440 states and 8870 transitions. Second operand has 4 states, 4 states have (on average 78.75) internal successors, (315), 4 states have internal predecessors, (315), 0 states have call successors, (0), 0 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:28,240 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 23:28:28,240 INFO L93 Difference]: Finished difference Result 16169 states and 19193 transitions. [2024-10-13 23:28:28,240 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-13 23:28:28,241 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 78.75) internal successors, (315), 4 states have internal predecessors, (315), 0 states have call successors, (0), 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 418 [2024-10-13 23:28:28,241 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 23:28:28,255 INFO L225 Difference]: With dead ends: 16169 [2024-10-13 23:28:28,256 INFO L226 Difference]: Without dead ends: 8730 [2024-10-13 23:28:28,263 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:28:28,264 INFO L432 NwaCegarLoop]: 33 mSDtfsCounter, 250 mSDsluCounter, 28 mSDsCounter, 0 mSdLazyCounter, 1099 mSolverCounterSat, 194 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 250 SdHoareTripleChecker+Valid, 61 SdHoareTripleChecker+Invalid, 1293 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 194 IncrementalHoareTripleChecker+Valid, 1099 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2024-10-13 23:28:28,264 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [250 Valid, 61 Invalid, 1293 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [194 Valid, 1099 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2024-10-13 23:28:28,270 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8730 states. [2024-10-13 23:28:28,344 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8730 to 7440. [2024-10-13 23:28:28,353 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7440 states, 7439 states have (on average 1.1923645651297217) internal successors, (8870), 7439 states have internal predecessors, (8870), 0 states have call successors, (0), 0 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:28,362 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7440 states to 7440 states and 8870 transitions. [2024-10-13 23:28:28,363 INFO L78 Accepts]: Start accepts. Automaton has 7440 states and 8870 transitions. Word has length 418 [2024-10-13 23:28:28,364 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 23:28:28,364 INFO L471 AbstractCegarLoop]: Abstraction has 7440 states and 8870 transitions. [2024-10-13 23:28:28,364 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 78.75) internal successors, (315), 4 states have internal predecessors, (315), 0 states have call successors, (0), 0 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:28,364 INFO L276 IsEmpty]: Start isEmpty. Operand 7440 states and 8870 transitions. [2024-10-13 23:28:28,378 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 419 [2024-10-13 23:28:28,379 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 23:28:28,380 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, 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, 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] [2024-10-13 23:28:28,380 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-10-13 23:28:28,380 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 23:28:28,381 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 23:28:28,381 INFO L85 PathProgramCache]: Analyzing trace with hash 936921815, now seen corresponding path program 1 times [2024-10-13 23:28:28,381 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 23:28:28,381 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [346961363] [2024-10-13 23:28:28,381 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 23:28:28,381 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 23:28:28,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 23:28:28,790 INFO L134 CoverageAnalysis]: Checked inductivity of 428 backedges. 390 proven. 0 refuted. 0 times theorem prover too weak. 38 trivial. 0 not checked. [2024-10-13 23:28:28,791 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 23:28:28,791 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [346961363] [2024-10-13 23:28:28,791 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [346961363] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 23:28:28,791 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 23:28:28,791 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-13 23:28:28,792 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [516114086] [2024-10-13 23:28:28,792 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 23:28:28,792 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-13 23:28:28,793 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 23:28:28,794 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-13 23:28:28,794 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 23:28:28,794 INFO L87 Difference]: Start difference. First operand 7440 states and 8870 transitions. Second operand has 3 states, 3 states have (on average 127.0) internal successors, (381), 3 states have internal predecessors, (381), 0 states have call successors, (0), 0 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:29,386 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 23:28:29,386 INFO L93 Difference]: Finished difference Result 15079 states and 17957 transitions. [2024-10-13 23:28:29,386 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-13 23:28:29,386 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 127.0) internal successors, (381), 3 states have internal predecessors, (381), 0 states have call successors, (0), 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 418 [2024-10-13 23:28:29,387 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 23:28:29,398 INFO L225 Difference]: With dead ends: 15079 [2024-10-13 23:28:29,398 INFO L226 Difference]: Without dead ends: 7640 [2024-10-13 23:28:29,406 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:29,406 INFO L432 NwaCegarLoop]: 309 mSDtfsCounter, 107 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 547 mSolverCounterSat, 94 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 107 SdHoareTripleChecker+Valid, 326 SdHoareTripleChecker+Invalid, 641 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 94 IncrementalHoareTripleChecker+Valid, 547 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-10-13 23:28:29,407 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [107 Valid, 326 Invalid, 641 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [94 Valid, 547 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-10-13 23:28:29,412 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7640 states. [2024-10-13 23:28:29,478 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7640 to 7256. [2024-10-13 23:28:29,486 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7256 states, 7255 states have (on average 1.160027567195038) internal successors, (8416), 7255 states have internal predecessors, (8416), 0 states have call successors, (0), 0 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:29,494 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7256 states to 7256 states and 8416 transitions. [2024-10-13 23:28:29,494 INFO L78 Accepts]: Start accepts. Automaton has 7256 states and 8416 transitions. Word has length 418 [2024-10-13 23:28:29,495 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 23:28:29,495 INFO L471 AbstractCegarLoop]: Abstraction has 7256 states and 8416 transitions. [2024-10-13 23:28:29,495 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 127.0) internal successors, (381), 3 states have internal predecessors, (381), 0 states have call successors, (0), 0 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:29,495 INFO L276 IsEmpty]: Start isEmpty. Operand 7256 states and 8416 transitions. [2024-10-13 23:28:29,505 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 476 [2024-10-13 23:28:29,505 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 23:28:29,505 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, 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, 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] [2024-10-13 23:28:29,506 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-10-13 23:28:29,506 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 23:28:29,506 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 23:28:29,507 INFO L85 PathProgramCache]: Analyzing trace with hash 2098641121, now seen corresponding path program 1 times [2024-10-13 23:28:29,507 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 23:28:29,507 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1811507313] [2024-10-13 23:28:29,507 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 23:28:29,507 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 23:28:29,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 23:28:29,773 INFO L134 CoverageAnalysis]: Checked inductivity of 514 backedges. 352 proven. 0 refuted. 0 times theorem prover too weak. 162 trivial. 0 not checked. [2024-10-13 23:28:29,774 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 23:28:29,774 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1811507313] [2024-10-13 23:28:29,774 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1811507313] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 23:28:29,774 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 23:28:29,774 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-13 23:28:29,774 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1478777648] [2024-10-13 23:28:29,775 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 23:28:29,775 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-13 23:28:29,775 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 23:28:29,776 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-13 23:28:29,776 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 23:28:29,776 INFO L87 Difference]: Start difference. First operand 7256 states and 8416 transitions. Second operand has 3 states, 3 states have (on average 105.0) internal successors, (315), 2 states have internal predecessors, (315), 0 states have call successors, (0), 0 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:30,136 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 23:28:30,136 INFO L93 Difference]: Finished difference Result 14131 states and 16359 transitions. [2024-10-13 23:28:30,137 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-13 23:28:30,137 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 105.0) internal successors, (315), 2 states have internal predecessors, (315), 0 states have call successors, (0), 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 475 [2024-10-13 23:28:30,138 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 23:28:30,148 INFO L225 Difference]: With dead ends: 14131 [2024-10-13 23:28:30,148 INFO L226 Difference]: Without dead ends: 6876 [2024-10-13 23:28:30,155 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:30,156 INFO L432 NwaCegarLoop]: 35 mSDtfsCounter, 179 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 301 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 179 SdHoareTripleChecker+Valid, 35 SdHoareTripleChecker+Invalid, 304 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 301 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-13 23:28:30,156 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [179 Valid, 35 Invalid, 304 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 301 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-13 23:28:30,161 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6876 states. [2024-10-13 23:28:30,219 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6876 to 6874. [2024-10-13 23:28:30,225 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6874 states, 6873 states have (on average 1.1545176778699258) internal successors, (7935), 6873 states have internal predecessors, (7935), 0 states have call successors, (0), 0 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:30,233 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6874 states to 6874 states and 7935 transitions. [2024-10-13 23:28:30,234 INFO L78 Accepts]: Start accepts. Automaton has 6874 states and 7935 transitions. Word has length 475 [2024-10-13 23:28:30,234 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 23:28:30,235 INFO L471 AbstractCegarLoop]: Abstraction has 6874 states and 7935 transitions. [2024-10-13 23:28:30,235 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 105.0) internal successors, (315), 2 states have internal predecessors, (315), 0 states have call successors, (0), 0 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:30,235 INFO L276 IsEmpty]: Start isEmpty. Operand 6874 states and 7935 transitions. [2024-10-13 23:28:30,245 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 492 [2024-10-13 23:28:30,245 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 23:28:30,246 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, 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, 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] [2024-10-13 23:28:30,246 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-10-13 23:28:30,246 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 23:28:30,246 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 23:28:30,247 INFO L85 PathProgramCache]: Analyzing trace with hash 1677979083, now seen corresponding path program 1 times [2024-10-13 23:28:30,247 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 23:28:30,247 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [756576] [2024-10-13 23:28:30,247 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 23:28:30,247 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 23:28:30,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 23:28:30,622 INFO L134 CoverageAnalysis]: Checked inductivity of 515 backedges. 391 proven. 0 refuted. 0 times theorem prover too weak. 124 trivial. 0 not checked. [2024-10-13 23:28:30,622 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 23:28:30,622 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [756576] [2024-10-13 23:28:30,623 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [756576] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 23:28:30,623 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 23:28:30,623 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-13 23:28:30,624 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1472518038] [2024-10-13 23:28:30,624 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 23:28:30,624 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-13 23:28:30,624 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 23:28:30,625 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-13 23:28:30,626 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 23:28:30,627 INFO L87 Difference]: Start difference. First operand 6874 states and 7935 transitions. Second operand has 3 states, 3 states have (on average 122.66666666666667) internal successors, (368), 3 states have internal predecessors, (368), 0 states have call successors, (0), 0 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:31,168 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 23:28:31,168 INFO L93 Difference]: Finished difference Result 12620 states and 14534 transitions. [2024-10-13 23:28:31,168 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-13 23:28:31,168 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 122.66666666666667) internal successors, (368), 3 states have internal predecessors, (368), 0 states have call successors, (0), 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 491 [2024-10-13 23:28:31,169 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 23:28:31,178 INFO L225 Difference]: With dead ends: 12620 [2024-10-13 23:28:31,179 INFO L226 Difference]: Without dead ends: 5747 [2024-10-13 23:28:31,186 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:31,187 INFO L432 NwaCegarLoop]: 104 mSDtfsCounter, 79 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 443 mSolverCounterSat, 124 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 79 SdHoareTripleChecker+Valid, 121 SdHoareTripleChecker+Invalid, 567 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 124 IncrementalHoareTripleChecker+Valid, 443 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-10-13 23:28:31,187 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [79 Valid, 121 Invalid, 567 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [124 Valid, 443 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-10-13 23:28:31,191 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5747 states. [2024-10-13 23:28:31,234 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5747 to 4827. [2024-10-13 23:28:31,241 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4827 states, 4826 states have (on average 1.1247409863240778) internal successors, (5428), 4826 states have internal predecessors, (5428), 0 states have call successors, (0), 0 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:31,246 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4827 states to 4827 states and 5428 transitions. [2024-10-13 23:28:31,247 INFO L78 Accepts]: Start accepts. Automaton has 4827 states and 5428 transitions. Word has length 491 [2024-10-13 23:28:31,248 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 23:28:31,248 INFO L471 AbstractCegarLoop]: Abstraction has 4827 states and 5428 transitions. [2024-10-13 23:28:31,248 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 122.66666666666667) internal successors, (368), 3 states have internal predecessors, (368), 0 states have call successors, (0), 0 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:31,248 INFO L276 IsEmpty]: Start isEmpty. Operand 4827 states and 5428 transitions. [2024-10-13 23:28:31,258 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 670 [2024-10-13 23:28:31,258 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 23:28:31,258 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, 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, 4, 4, 4, 4, 4, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 23:28:31,259 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-10-13 23:28:31,259 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 23:28:31,259 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 23:28:31,259 INFO L85 PathProgramCache]: Analyzing trace with hash 570196200, now seen corresponding path program 1 times [2024-10-13 23:28:31,260 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 23:28:31,260 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2045851651] [2024-10-13 23:28:31,260 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 23:28:31,260 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 23:28:31,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 23:28:31,764 INFO L134 CoverageAnalysis]: Checked inductivity of 1238 backedges. 848 proven. 0 refuted. 0 times theorem prover too weak. 390 trivial. 0 not checked. [2024-10-13 23:28:31,764 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 23:28:31,764 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2045851651] [2024-10-13 23:28:31,764 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2045851651] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 23:28:31,764 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 23:28:31,765 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-13 23:28:31,765 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1063559567] [2024-10-13 23:28:31,765 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 23:28:31,766 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-13 23:28:31,766 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 23:28:31,766 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-13 23:28:31,767 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-10-13 23:28:31,767 INFO L87 Difference]: Start difference. First operand 4827 states and 5428 transitions. Second operand has 4 states, 4 states have (on average 106.75) internal successors, (427), 3 states have internal predecessors, (427), 0 states have call successors, (0), 0 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:32,786 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 23:28:32,786 INFO L93 Difference]: Finished difference Result 14634 states and 16468 transitions. [2024-10-13 23:28:32,786 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-13 23:28:32,786 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 106.75) internal successors, (427), 3 states have internal predecessors, (427), 0 states have call successors, (0), 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 669 [2024-10-13 23:28:32,787 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 23:28:32,803 INFO L225 Difference]: With dead ends: 14634 [2024-10-13 23:28:32,804 INFO L226 Difference]: Without dead ends: 9808 [2024-10-13 23:28:32,810 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:32,811 INFO L432 NwaCegarLoop]: 24 mSDtfsCounter, 197 mSDsluCounter, 33 mSDsCounter, 0 mSdLazyCounter, 1080 mSolverCounterSat, 138 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 197 SdHoareTripleChecker+Valid, 57 SdHoareTripleChecker+Invalid, 1218 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 138 IncrementalHoareTripleChecker+Valid, 1080 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2024-10-13 23:28:32,811 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [197 Valid, 57 Invalid, 1218 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [138 Valid, 1080 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2024-10-13 23:28:32,818 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9808 states. [2024-10-13 23:28:32,900 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9808 to 9619. [2024-10-13 23:28:32,910 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9619 states, 9618 states have (on average 1.114368891661468) internal successors, (10718), 9618 states have internal predecessors, (10718), 0 states have call successors, (0), 0 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:32,921 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9619 states to 9619 states and 10718 transitions. [2024-10-13 23:28:32,922 INFO L78 Accepts]: Start accepts. Automaton has 9619 states and 10718 transitions. Word has length 669 [2024-10-13 23:28:32,922 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 23:28:32,922 INFO L471 AbstractCegarLoop]: Abstraction has 9619 states and 10718 transitions. [2024-10-13 23:28:32,923 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 106.75) internal successors, (427), 3 states have internal predecessors, (427), 0 states have call successors, (0), 0 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:32,923 INFO L276 IsEmpty]: Start isEmpty. Operand 9619 states and 10718 transitions. [2024-10-13 23:28:32,940 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 748 [2024-10-13 23:28:32,940 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 23:28:32,941 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, 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, 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, 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] [2024-10-13 23:28:32,941 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-10-13 23:28:32,941 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 23:28:32,941 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 23:28:32,942 INFO L85 PathProgramCache]: Analyzing trace with hash -1046595906, now seen corresponding path program 1 times [2024-10-13 23:28:32,942 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 23:28:32,942 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [239126475] [2024-10-13 23:28:32,942 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 23:28:32,942 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 23:28:33,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 23:28:33,409 INFO L134 CoverageAnalysis]: Checked inductivity of 1661 backedges. 987 proven. 0 refuted. 0 times theorem prover too weak. 674 trivial. 0 not checked. [2024-10-13 23:28:33,409 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 23:28:33,410 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [239126475] [2024-10-13 23:28:33,410 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [239126475] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 23:28:33,410 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 23:28:33,410 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-13 23:28:33,410 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [604035644] [2024-10-13 23:28:33,410 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 23:28:33,411 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-13 23:28:33,411 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 23:28:33,412 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-13 23:28:33,412 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 23:28:33,412 INFO L87 Difference]: Start difference. First operand 9619 states and 10718 transitions. Second operand has 3 states, 3 states have (on average 101.33333333333333) internal successors, (304), 3 states have internal predecessors, (304), 0 states have call successors, (0), 0 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:34,017 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 23:28:34,017 INFO L93 Difference]: Finished difference Result 20340 states and 22718 transitions. [2024-10-13 23:28:34,018 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-13 23:28:34,018 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 101.33333333333333) internal successors, (304), 3 states have internal predecessors, (304), 0 states have call successors, (0), 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 747 [2024-10-13 23:28:34,018 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 23:28:34,030 INFO L225 Difference]: With dead ends: 20340 [2024-10-13 23:28:34,030 INFO L226 Difference]: Without dead ends: 10169 [2024-10-13 23:28:34,039 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:34,040 INFO L432 NwaCegarLoop]: 319 mSDtfsCounter, 195 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 501 mSolverCounterSat, 90 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 195 SdHoareTripleChecker+Valid, 336 SdHoareTripleChecker+Invalid, 591 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 90 IncrementalHoareTripleChecker+Valid, 501 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-10-13 23:28:34,040 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [195 Valid, 336 Invalid, 591 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [90 Valid, 501 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-10-13 23:28:34,046 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10169 states. [2024-10-13 23:28:34,130 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10169 to 10169. [2024-10-13 23:28:34,229 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10169 states, 10168 states have (on average 1.0947088906372935) internal successors, (11131), 10168 states have internal predecessors, (11131), 0 states have call successors, (0), 0 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:34,244 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10169 states to 10169 states and 11131 transitions. [2024-10-13 23:28:34,245 INFO L78 Accepts]: Start accepts. Automaton has 10169 states and 11131 transitions. Word has length 747 [2024-10-13 23:28:34,245 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 23:28:34,246 INFO L471 AbstractCegarLoop]: Abstraction has 10169 states and 11131 transitions. [2024-10-13 23:28:34,246 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 101.33333333333333) internal successors, (304), 3 states have internal predecessors, (304), 0 states have call successors, (0), 0 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:34,246 INFO L276 IsEmpty]: Start isEmpty. Operand 10169 states and 11131 transitions. [2024-10-13 23:28:34,269 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 838 [2024-10-13 23:28:34,269 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 23:28:34,270 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, 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, 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, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 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] [2024-10-13 23:28:34,270 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-10-13 23:28:34,270 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 23:28:34,271 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 23:28:34,271 INFO L85 PathProgramCache]: Analyzing trace with hash 1539496502, now seen corresponding path program 1 times [2024-10-13 23:28:34,271 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 23:28:34,272 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1551990705] [2024-10-13 23:28:34,272 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 23:28:34,272 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 23:28:34,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 23:28:34,806 INFO L134 CoverageAnalysis]: Checked inductivity of 2009 backedges. 1453 proven. 0 refuted. 0 times theorem prover too weak. 556 trivial. 0 not checked. [2024-10-13 23:28:34,807 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 23:28:34,807 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1551990705] [2024-10-13 23:28:34,807 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1551990705] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 23:28:34,808 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 23:28:34,808 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-13 23:28:34,808 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1715248293] [2024-10-13 23:28:34,808 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 23:28:34,809 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-13 23:28:34,809 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 23:28:34,810 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-13 23:28:34,810 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 23:28:34,810 INFO L87 Difference]: Start difference. First operand 10169 states and 11131 transitions. Second operand has 3 states, 3 states have (on average 150.33333333333334) internal successors, (451), 3 states have internal predecessors, (451), 0 states have call successors, (0), 0 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:35,417 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 23:28:35,417 INFO L93 Difference]: Finished difference Result 20886 states and 22854 transitions. [2024-10-13 23:28:35,418 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-13 23:28:35,418 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 150.33333333333334) internal successors, (451), 3 states have internal predecessors, (451), 0 states have call successors, (0), 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 837 [2024-10-13 23:28:35,418 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 23:28:35,418 INFO L225 Difference]: With dead ends: 20886 [2024-10-13 23:28:35,419 INFO L226 Difference]: Without dead ends: 0 [2024-10-13 23:28:35,426 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:35,426 INFO L432 NwaCegarLoop]: 301 mSDtfsCounter, 53 mSDsluCounter, 16 mSDsCounter, 0 mSdLazyCounter, 526 mSolverCounterSat, 66 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 53 SdHoareTripleChecker+Valid, 317 SdHoareTripleChecker+Invalid, 592 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 66 IncrementalHoareTripleChecker+Valid, 526 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-10-13 23:28:35,426 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [53 Valid, 317 Invalid, 592 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [66 Valid, 526 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-10-13 23:28:35,427 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2024-10-13 23:28:35,427 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2024-10-13 23:28:35,427 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:28:35,427 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2024-10-13 23:28:35,427 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 837 [2024-10-13 23:28:35,427 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 23:28:35,427 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2024-10-13 23:28:35,428 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 150.33333333333334) internal successors, (451), 3 states have internal predecessors, (451), 0 states have call successors, (0), 0 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:35,428 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2024-10-13 23:28:35,428 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2024-10-13 23:28:35,431 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-10-13 23:28:35,431 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2024-10-13 23:28:35,434 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 23:28:35,436 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2024-10-13 23:28:37,669 INFO L165 ceAbstractionStarter]: Computing trace abstraction results [2024-10-13 23:28:37,686 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 13.10 11:28:37 BoogieIcfgContainer [2024-10-13 23:28:37,686 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-10-13 23:28:37,687 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-10-13 23:28:37,687 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-10-13 23:28:37,687 INFO L274 PluginConnector]: Witness Printer initialized [2024-10-13 23:28:37,687 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:08" (3/4) ... [2024-10-13 23:28:37,691 INFO L139 WitnessPrinter]: Generating witness for correct program [2024-10-13 23:28:37,712 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 12 nodes and edges [2024-10-13 23:28:37,713 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2024-10-13 23:28:37,715 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2024-10-13 23:28:37,716 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2024-10-13 23:28:37,879 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2024-10-13 23:28:37,879 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.yml [2024-10-13 23:28:37,879 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-10-13 23:28:37,880 INFO L158 Benchmark]: Toolchain (without parser) took 32720.22ms. Allocated memory was 184.5MB in the beginning and 868.2MB in the end (delta: 683.7MB). Free memory was 126.0MB in the beginning and 757.6MB in the end (delta: -631.6MB). Peak memory consumption was 53.8MB. Max. memory is 16.1GB. [2024-10-13 23:28:37,880 INFO L158 Benchmark]: CDTParser took 0.20ms. Allocated memory is still 184.5MB. Free memory is still 149.4MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-13 23:28:37,881 INFO L158 Benchmark]: CACSL2BoogieTranslator took 701.54ms. Allocated memory is still 184.5MB. Free memory was 126.0MB in the beginning and 79.9MB in the end (delta: 46.2MB). Peak memory consumption was 46.1MB. Max. memory is 16.1GB. [2024-10-13 23:28:37,881 INFO L158 Benchmark]: Boogie Procedure Inliner took 127.68ms. Allocated memory is still 184.5MB. Free memory was 79.9MB in the beginning and 62.3MB in the end (delta: 17.6MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. [2024-10-13 23:28:37,881 INFO L158 Benchmark]: Boogie Preprocessor took 287.16ms. Allocated memory was 184.5MB in the beginning and 302.0MB in the end (delta: 117.4MB). Free memory was 62.3MB in the beginning and 247.2MB in the end (delta: -185.0MB). Peak memory consumption was 38.8MB. Max. memory is 16.1GB. [2024-10-13 23:28:37,881 INFO L158 Benchmark]: RCFGBuilder took 1748.20ms. Allocated memory is still 302.0MB. Free memory was 247.2MB in the beginning and 192.8MB in the end (delta: 54.4MB). Peak memory consumption was 125.8MB. Max. memory is 16.1GB. [2024-10-13 23:28:37,882 INFO L158 Benchmark]: TraceAbstraction took 29653.34ms. Allocated memory was 302.0MB in the beginning and 868.2MB in the end (delta: 566.2MB). Free memory was 192.8MB in the beginning and 774.4MB in the end (delta: -581.6MB). Peak memory consumption was 500.8MB. Max. memory is 16.1GB. [2024-10-13 23:28:37,882 INFO L158 Benchmark]: Witness Printer took 192.85ms. Allocated memory is still 868.2MB. Free memory was 774.4MB in the beginning and 757.6MB in the end (delta: 16.8MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2024-10-13 23:28:37,887 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.20ms. Allocated memory is still 184.5MB. Free memory is still 149.4MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 701.54ms. Allocated memory is still 184.5MB. Free memory was 126.0MB in the beginning and 79.9MB in the end (delta: 46.2MB). Peak memory consumption was 46.1MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 127.68ms. Allocated memory is still 184.5MB. Free memory was 79.9MB in the beginning and 62.3MB in the end (delta: 17.6MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. * Boogie Preprocessor took 287.16ms. Allocated memory was 184.5MB in the beginning and 302.0MB in the end (delta: 117.4MB). Free memory was 62.3MB in the beginning and 247.2MB in the end (delta: -185.0MB). Peak memory consumption was 38.8MB. Max. memory is 16.1GB. * RCFGBuilder took 1748.20ms. Allocated memory is still 302.0MB. Free memory was 247.2MB in the beginning and 192.8MB in the end (delta: 54.4MB). Peak memory consumption was 125.8MB. Max. memory is 16.1GB. * TraceAbstraction took 29653.34ms. Allocated memory was 302.0MB in the beginning and 868.2MB in the end (delta: 566.2MB). Free memory was 192.8MB in the beginning and 774.4MB in the end (delta: -581.6MB). Peak memory consumption was 500.8MB. Max. memory is 16.1GB. * Witness Printer took 192.85ms. Allocated memory is still 868.2MB. Free memory was 774.4MB in the beginning and 757.6MB 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: 136]: 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: 27.3s, OverallIterations: 18, TraceHistogramMax: 7, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.2s, AutomataDifference: 15.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 3626 SdHoareTripleChecker+Valid, 13.7s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 3626 mSDsluCounter, 3691 SdHoareTripleChecker+Invalid, 11.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 404 mSDsCounter, 2109 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 12352 IncrementalHoareTripleChecker+Invalid, 14461 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 2109 mSolverCounterUnsat, 3287 mSDtfsCounter, 12352 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 703 GetRequests, 671 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 29 ImplicationChecksByTransitivity, 0.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=10169occurred in iteration=17, InterpolantAutomatonStates: 68, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 1.3s AutomataMinimizationTime, 18 MinimizatonAttempts, 9684 StatesRemovedByMinimization, 13 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 0.7s SatisfiabilityAnalysisTime, 8.7s InterpolantComputationTime, 6515 NumberOfCodeBlocks, 6515 NumberOfCodeBlocksAsserted, 19 NumberOfCheckSat, 6818 ConstructedInterpolants, 0 QuantifiedInterpolants, 20700 SizeOfPredicates, 8 NumberOfNonLiveVariables, 433 ConjunctsInSsa, 13 ConjunctsInUnsatCore, 20 InterpolantComputations, 17 PerfectInterpolantSequences, 8354/8513 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 <= 10) && (a29 <= 599999)) && (a3 == 1)) && (a4 == 1)) && (a8 == 15)) || ((((a25 == 11) && (a29 <= 599998)) && (a4 == 1)) && (a8 == 15))) || ((((a25 == 12) && (a4 == 0)) && (a29 <= 599998)) && (a8 == 15))) || ((((a25 == 13) && (a29 <= 245)) && (a4 == 1)) && (a8 == 15))) || ((((((a25 == 13) && (a4 == 0)) && (((long long) a29 + 22) <= 0)) && (a23 <= 138)) && (a8 == 15)) && (0 <= ((long long) a23 + 42)))) || ((((((a25 == 13) && (307 <= a23)) || ((a25 == 13) && (a3 == 1))) && (a29 <= 599998)) && (a4 == 1)) && (a8 == 15))) || (((((a25 == 11) && (a29 <= 599999)) && (a3 == 1)) && (a4 == 1)) && (a8 == 15))) || ((((((a25 <= 10) && (a3 == 1)) && (a23 <= 138)) && (a4 == 1)) && (a8 == 15)) && (0 <= ((long long) a23 + 42)))) || ((((a25 <= 10) && (a29 <= 599998)) && (a4 == 1)) && (a8 == 15))) || (((((a4 == 0) && (a25 == 11)) && (a29 <= 599998)) && (a23 <= 312)) && (a8 == 15))) || ((((a4 == 0) && (((long long) a29 + 22) <= 0)) && (a25 <= 10)) && (a8 == 15))) || (((((((long long) a29 + 21) <= 0) && (a25 == 12)) && (a3 == 1)) && (a4 == 1)) && (a8 == 15))) || ((((a25 == 12) && (((long long) a29 + 22) <= 0)) && (a4 == 1)) && (a8 == 15))) || (((((a4 == 0) && (a25 <= 10)) && (a29 <= 245)) && (a23 <= 138)) && (a8 == 15))) || ((((((a25 == 12) && (307 <= a23)) && (a29 <= 599998)) && (a3 == 1)) && (a4 == 1)) && (a8 == 15))) || (((((((long long) a23 + 43) <= 0) && (a4 == 0)) && (a25 <= 10)) && (a29 <= 599998)) && (a8 == 15))) RESULT: Ultimate proved your program to be correct! [2024-10-13 23:28:37,918 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