./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/Problem03_label56.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version a046e57d 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/Problem03_label56.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 bac94640e4b1ca65f803532eef7d71e2867b8956b5651dd4d9133fab907f3070 --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.dk.eval-mul-div-a046e57-m [2024-10-12 15:21:02,146 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-12 15:21:02,205 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-10-12 15:21:02,212 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-12 15:21:02,215 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-12 15:21:02,244 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-12 15:21:02,245 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-12 15:21:02,245 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-12 15:21:02,246 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-12 15:21:02,246 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-12 15:21:02,247 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-12 15:21:02,247 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-12 15:21:02,248 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-12 15:21:02,248 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-12 15:21:02,250 INFO L153 SettingsManager]: * Use SBE=true [2024-10-12 15:21:02,250 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-12 15:21:02,250 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-12 15:21:02,251 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-12 15:21:02,251 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-12 15:21:02,251 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-12 15:21:02,255 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-12 15:21:02,256 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-12 15:21:02,256 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-12 15:21:02,256 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-12 15:21:02,257 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-12 15:21:02,257 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-12 15:21:02,257 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-12 15:21:02,257 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-12 15:21:02,258 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-12 15:21:02,258 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-12 15:21:02,258 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-12 15:21:02,258 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-12 15:21:02,259 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-12 15:21:02,259 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-12 15:21:02,261 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-12 15:21:02,261 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-12 15:21:02,262 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-12 15:21:02,262 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-12 15:21:02,262 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-12 15:21:02,263 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-12 15:21:02,263 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-12 15:21:02,263 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-12 15:21:02,263 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 -> bac94640e4b1ca65f803532eef7d71e2867b8956b5651dd4d9133fab907f3070 [2024-10-12 15:21:02,509 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-12 15:21:02,535 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-12 15:21:02,538 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-12 15:21:02,539 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-12 15:21:02,540 INFO L274 PluginConnector]: CDTParser initialized [2024-10-12 15:21:02,541 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem03_label56.c [2024-10-12 15:21:04,037 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-12 15:21:04,389 INFO L384 CDTParser]: Found 1 translation units. [2024-10-12 15:21:04,390 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem03_label56.c [2024-10-12 15:21:04,419 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5669171a1/62b79e8d508447baa7977ddbd9116e38/FLAG5cf51629c [2024-10-12 15:21:04,608 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5669171a1/62b79e8d508447baa7977ddbd9116e38 [2024-10-12 15:21:04,611 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-12 15:21:04,613 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-12 15:21:04,616 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-12 15:21:04,616 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-12 15:21:04,623 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-12 15:21:04,624 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.10 03:21:04" (1/1) ... [2024-10-12 15:21:04,625 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7c750f19 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 03:21:04, skipping insertion in model container [2024-10-12 15:21:04,625 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.10 03:21:04" (1/1) ... [2024-10-12 15:21:04,692 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-12 15:21:05,200 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/Problem03_label56.c[57575,57588] [2024-10-12 15:21:05,237 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-12 15:21:05,255 INFO L200 MainTranslator]: Completed pre-run [2024-10-12 15:21:05,432 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/Problem03_label56.c[57575,57588] [2024-10-12 15:21:05,445 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-12 15:21:05,469 INFO L204 MainTranslator]: Completed translation [2024-10-12 15:21:05,469 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 03:21:05 WrapperNode [2024-10-12 15:21:05,469 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-12 15:21:05,470 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-12 15:21:05,471 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-12 15:21:05,471 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-12 15:21:05,478 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 03:21:05" (1/1) ... [2024-10-12 15:21:05,522 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 03:21:05" (1/1) ... [2024-10-12 15:21:05,610 INFO L138 Inliner]: procedures = 14, calls = 8, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 1772 [2024-10-12 15:21:05,611 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-12 15:21:05,612 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-12 15:21:05,612 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-12 15:21:05,612 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-12 15:21:05,623 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 03:21:05" (1/1) ... [2024-10-12 15:21:05,624 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 03:21:05" (1/1) ... [2024-10-12 15:21:05,633 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 03:21:05" (1/1) ... [2024-10-12 15:21:05,678 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-12 15:21:05,678 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 03:21:05" (1/1) ... [2024-10-12 15:21:05,679 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 03:21:05" (1/1) ... [2024-10-12 15:21:05,724 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 03:21:05" (1/1) ... [2024-10-12 15:21:05,742 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 03:21:05" (1/1) ... [2024-10-12 15:21:05,757 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 03:21:05" (1/1) ... [2024-10-12 15:21:05,765 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 03:21:05" (1/1) ... [2024-10-12 15:21:05,776 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-12 15:21:05,778 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-12 15:21:05,778 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-12 15:21:05,778 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-12 15:21:05,779 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 03:21:05" (1/1) ... [2024-10-12 15:21:05,784 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-12 15:21:05,794 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 15:21:05,812 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-12 15:21:05,818 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-12 15:21:05,857 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-12 15:21:05,857 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-12 15:21:05,857 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-12 15:21:05,857 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-12 15:21:05,931 INFO L238 CfgBuilder]: Building ICFG [2024-10-12 15:21:05,932 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-12 15:21:07,725 INFO L? ?]: Removed 147 outVars from TransFormulas that were not future-live. [2024-10-12 15:21:07,725 INFO L287 CfgBuilder]: Performing block encoding [2024-10-12 15:21:07,775 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-12 15:21:07,776 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-12 15:21:07,776 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.10 03:21:07 BoogieIcfgContainer [2024-10-12 15:21:07,776 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-12 15:21:07,778 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-12 15:21:07,778 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-12 15:21:07,785 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-12 15:21:07,786 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 12.10 03:21:04" (1/3) ... [2024-10-12 15:21:07,786 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@32c0645 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.10 03:21:07, skipping insertion in model container [2024-10-12 15:21:07,786 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 03:21:05" (2/3) ... [2024-10-12 15:21:07,787 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@32c0645 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.10 03:21:07, skipping insertion in model container [2024-10-12 15:21:07,787 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.10 03:21:07" (3/3) ... [2024-10-12 15:21:07,789 INFO L112 eAbstractionObserver]: Analyzing ICFG Problem03_label56.c [2024-10-12 15:21:07,805 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-12 15:21:07,806 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-12 15:21:07,885 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-12 15:21:07,893 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;@18cae34a, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-12 15:21:07,894 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-12 15:21:07,901 INFO L276 IsEmpty]: Start isEmpty. Operand has 240 states, 238 states have (on average 1.9201680672268908) internal successors, (457), 239 states have internal predecessors, (457), 0 states have call successors, (0), 0 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-12 15:21:07,918 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 173 [2024-10-12 15:21:07,919 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 15:21:07,919 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 15:21:07,920 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 15:21:07,925 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 15:21:07,927 INFO L85 PathProgramCache]: Analyzing trace with hash -1367574401, now seen corresponding path program 1 times [2024-10-12 15:21:07,936 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 15:21:07,937 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1855412373] [2024-10-12 15:21:07,937 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 15:21:07,937 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 15:21:08,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 15:21:08,506 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-12 15:21:08,507 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 15:21:08,507 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1855412373] [2024-10-12 15:21:08,508 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1855412373] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 15:21:08,508 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 15:21:08,509 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-12 15:21:08,511 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [667721825] [2024-10-12 15:21:08,511 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 15:21:08,517 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-12 15:21:08,518 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 15:21:08,545 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-12 15:21:08,546 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-12 15:21:08,549 INFO L87 Difference]: Start difference. First operand has 240 states, 238 states have (on average 1.9201680672268908) internal successors, (457), 239 states have internal predecessors, (457), 0 states have call successors, (0), 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 86.0) internal successors, (172), 2 states have internal predecessors, (172), 0 states have call successors, (0), 0 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-12 15:21:08,603 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 15:21:08,606 INFO L93 Difference]: Finished difference Result 479 states and 913 transitions. [2024-10-12 15:21:08,607 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-12 15:21:08,609 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 86.0) internal successors, (172), 2 states have internal predecessors, (172), 0 states have call successors, (0), 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 172 [2024-10-12 15:21:08,610 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 15:21:08,622 INFO L225 Difference]: With dead ends: 479 [2024-10-12 15:21:08,623 INFO L226 Difference]: Without dead ends: 238 [2024-10-12 15:21:08,627 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-12 15:21:08,631 INFO L432 NwaCegarLoop]: 392 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, 392 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-12 15:21:08,632 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 392 Invalid, 2 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 2 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-12 15:21:08,650 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 238 states. [2024-10-12 15:21:08,674 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 238 to 238. [2024-10-12 15:21:08,676 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 238 states, 237 states have (on average 1.6540084388185654) internal successors, (392), 237 states have internal predecessors, (392), 0 states have call successors, (0), 0 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-12 15:21:08,678 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 238 states to 238 states and 392 transitions. [2024-10-12 15:21:08,680 INFO L78 Accepts]: Start accepts. Automaton has 238 states and 392 transitions. Word has length 172 [2024-10-12 15:21:08,681 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 15:21:08,681 INFO L471 AbstractCegarLoop]: Abstraction has 238 states and 392 transitions. [2024-10-12 15:21:08,681 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 86.0) internal successors, (172), 2 states have internal predecessors, (172), 0 states have call successors, (0), 0 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-12 15:21:08,682 INFO L276 IsEmpty]: Start isEmpty. Operand 238 states and 392 transitions. [2024-10-12 15:21:08,685 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 173 [2024-10-12 15:21:08,685 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 15:21:08,685 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 15:21:08,686 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-12 15:21:08,686 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 15:21:08,687 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 15:21:08,687 INFO L85 PathProgramCache]: Analyzing trace with hash -947023826, now seen corresponding path program 1 times [2024-10-12 15:21:08,687 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 15:21:08,687 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1753795987] [2024-10-12 15:21:08,687 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 15:21:08,688 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 15:21:08,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 15:21:09,383 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-12 15:21:09,385 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 15:21:09,385 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1753795987] [2024-10-12 15:21:09,386 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1753795987] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 15:21:09,387 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 15:21:09,387 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-12 15:21:09,387 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [406432287] [2024-10-12 15:21:09,387 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 15:21:09,389 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-12 15:21:09,390 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 15:21:09,391 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-12 15:21:09,392 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-12 15:21:09,392 INFO L87 Difference]: Start difference. First operand 238 states and 392 transitions. Second operand has 3 states, 3 states have (on average 57.333333333333336) internal successors, (172), 2 states have internal predecessors, (172), 0 states have call successors, (0), 0 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-12 15:21:10,310 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 15:21:10,310 INFO L93 Difference]: Finished difference Result 701 states and 1160 transitions. [2024-10-12 15:21:10,311 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-12 15:21:10,311 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 57.333333333333336) internal successors, (172), 2 states have internal predecessors, (172), 0 states have call successors, (0), 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 172 [2024-10-12 15:21:10,312 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 15:21:10,315 INFO L225 Difference]: With dead ends: 701 [2024-10-12 15:21:10,315 INFO L226 Difference]: Without dead ends: 464 [2024-10-12 15:21:10,317 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-12 15:21:10,318 INFO L432 NwaCegarLoop]: 99 mSDtfsCounter, 99 mSDsluCounter, 32 mSDsCounter, 0 mSdLazyCounter, 614 mSolverCounterSat, 100 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 99 SdHoareTripleChecker+Valid, 131 SdHoareTripleChecker+Invalid, 714 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 100 IncrementalHoareTripleChecker+Valid, 614 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2024-10-12 15:21:10,318 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [99 Valid, 131 Invalid, 714 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [100 Valid, 614 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2024-10-12 15:21:10,319 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 464 states. [2024-10-12 15:21:10,353 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 464 to 458. [2024-10-12 15:21:10,354 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 458 states, 457 states have (on average 1.5579868708971554) internal successors, (712), 457 states have internal predecessors, (712), 0 states have call successors, (0), 0 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-12 15:21:10,356 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 458 states to 458 states and 712 transitions. [2024-10-12 15:21:10,357 INFO L78 Accepts]: Start accepts. Automaton has 458 states and 712 transitions. Word has length 172 [2024-10-12 15:21:10,358 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 15:21:10,358 INFO L471 AbstractCegarLoop]: Abstraction has 458 states and 712 transitions. [2024-10-12 15:21:10,359 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 57.333333333333336) internal successors, (172), 2 states have internal predecessors, (172), 0 states have call successors, (0), 0 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-12 15:21:10,359 INFO L276 IsEmpty]: Start isEmpty. Operand 458 states and 712 transitions. [2024-10-12 15:21:10,365 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 181 [2024-10-12 15:21:10,365 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 15:21:10,366 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12 15:21:10,366 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-12 15:21:10,366 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 15:21:10,367 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 15:21:10,367 INFO L85 PathProgramCache]: Analyzing trace with hash -1965761041, now seen corresponding path program 1 times [2024-10-12 15:21:10,367 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 15:21:10,368 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2073864204] [2024-10-12 15:21:10,368 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 15:21:10,368 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 15:21:10,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 15:21:10,656 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 15:21:10,656 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 15:21:10,657 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2073864204] [2024-10-12 15:21:10,657 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2073864204] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 15:21:10,657 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 15:21:10,657 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-12 15:21:10,657 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1515250507] [2024-10-12 15:21:10,657 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 15:21:10,658 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-12 15:21:10,658 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 15:21:10,658 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-12 15:21:10,659 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-12 15:21:10,659 INFO L87 Difference]: Start difference. First operand 458 states and 712 transitions. Second operand has 3 states, 3 states have (on average 60.0) internal successors, (180), 2 states have internal predecessors, (180), 0 states have call successors, (0), 0 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-12 15:21:11,407 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 15:21:11,408 INFO L93 Difference]: Finished difference Result 1342 states and 2101 transitions. [2024-10-12 15:21:11,408 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-12 15:21:11,408 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 60.0) internal successors, (180), 2 states have internal predecessors, (180), 0 states have call successors, (0), 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 180 [2024-10-12 15:21:11,408 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 15:21:11,411 INFO L225 Difference]: With dead ends: 1342 [2024-10-12 15:21:11,411 INFO L226 Difference]: Without dead ends: 885 [2024-10-12 15:21:11,413 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-12 15:21:11,414 INFO L432 NwaCegarLoop]: 73 mSDtfsCounter, 249 mSDsluCounter, 14 mSDsCounter, 0 mSdLazyCounter, 585 mSolverCounterSat, 195 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 249 SdHoareTripleChecker+Valid, 87 SdHoareTripleChecker+Invalid, 780 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 195 IncrementalHoareTripleChecker+Valid, 585 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-10-12 15:21:11,415 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [249 Valid, 87 Invalid, 780 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [195 Valid, 585 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-10-12 15:21:11,417 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 885 states. [2024-10-12 15:21:11,438 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 885 to 867. [2024-10-12 15:21:11,440 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 867 states, 866 states have (on average 1.5346420323325636) internal successors, (1329), 866 states have internal predecessors, (1329), 0 states have call successors, (0), 0 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-12 15:21:11,443 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 867 states to 867 states and 1329 transitions. [2024-10-12 15:21:11,443 INFO L78 Accepts]: Start accepts. Automaton has 867 states and 1329 transitions. Word has length 180 [2024-10-12 15:21:11,443 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 15:21:11,443 INFO L471 AbstractCegarLoop]: Abstraction has 867 states and 1329 transitions. [2024-10-12 15:21:11,443 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 60.0) internal successors, (180), 2 states have internal predecessors, (180), 0 states have call successors, (0), 0 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-12 15:21:11,444 INFO L276 IsEmpty]: Start isEmpty. Operand 867 states and 1329 transitions. [2024-10-12 15:21:11,447 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 182 [2024-10-12 15:21:11,447 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 15:21:11,447 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12 15:21:11,447 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-12 15:21:11,448 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 15:21:11,448 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 15:21:11,448 INFO L85 PathProgramCache]: Analyzing trace with hash -296452030, now seen corresponding path program 1 times [2024-10-12 15:21:11,448 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 15:21:11,449 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1331225451] [2024-10-12 15:21:11,449 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 15:21:11,449 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 15:21:11,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 15:21:11,722 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 15:21:11,723 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 15:21:11,723 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1331225451] [2024-10-12 15:21:11,723 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1331225451] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 15:21:11,723 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 15:21:11,723 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-12 15:21:11,724 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [894875128] [2024-10-12 15:21:11,724 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 15:21:11,724 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-12 15:21:11,724 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 15:21:11,725 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-12 15:21:11,725 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-12 15:21:11,726 INFO L87 Difference]: Start difference. First operand 867 states and 1329 transitions. Second operand has 3 states, 3 states have (on average 60.333333333333336) internal successors, (181), 2 states have internal predecessors, (181), 0 states have call successors, (0), 0 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-12 15:21:12,465 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 15:21:12,466 INFO L93 Difference]: Finished difference Result 2572 states and 3945 transitions. [2024-10-12 15:21:12,466 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-12 15:21:12,467 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 60.333333333333336) internal successors, (181), 2 states have internal predecessors, (181), 0 states have call successors, (0), 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 181 [2024-10-12 15:21:12,467 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 15:21:12,472 INFO L225 Difference]: With dead ends: 2572 [2024-10-12 15:21:12,473 INFO L226 Difference]: Without dead ends: 1706 [2024-10-12 15:21:12,478 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-12 15:21:12,479 INFO L432 NwaCegarLoop]: 102 mSDtfsCounter, 255 mSDsluCounter, 33 mSDsCounter, 0 mSdLazyCounter, 626 mSolverCounterSat, 77 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 255 SdHoareTripleChecker+Valid, 135 SdHoareTripleChecker+Invalid, 703 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 77 IncrementalHoareTripleChecker+Valid, 626 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-10-12 15:21:12,482 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [255 Valid, 135 Invalid, 703 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [77 Valid, 626 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-10-12 15:21:12,485 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1706 states. [2024-10-12 15:21:12,512 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1706 to 1703. [2024-10-12 15:21:12,515 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1703 states, 1702 states have (on average 1.4488836662749707) internal successors, (2466), 1702 states have internal predecessors, (2466), 0 states have call successors, (0), 0 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-12 15:21:12,520 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1703 states to 1703 states and 2466 transitions. [2024-10-12 15:21:12,520 INFO L78 Accepts]: Start accepts. Automaton has 1703 states and 2466 transitions. Word has length 181 [2024-10-12 15:21:12,520 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 15:21:12,520 INFO L471 AbstractCegarLoop]: Abstraction has 1703 states and 2466 transitions. [2024-10-12 15:21:12,521 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 60.333333333333336) internal successors, (181), 2 states have internal predecessors, (181), 0 states have call successors, (0), 0 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-12 15:21:12,521 INFO L276 IsEmpty]: Start isEmpty. Operand 1703 states and 2466 transitions. [2024-10-12 15:21:12,524 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 183 [2024-10-12 15:21:12,524 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 15:21:12,525 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12 15:21:12,525 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-12 15:21:12,525 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 15:21:12,526 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 15:21:12,526 INFO L85 PathProgramCache]: Analyzing trace with hash 1231004884, now seen corresponding path program 1 times [2024-10-12 15:21:12,527 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 15:21:12,527 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [720001268] [2024-10-12 15:21:12,527 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 15:21:12,527 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 15:21:12,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 15:21:12,876 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 15:21:12,878 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 15:21:12,878 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [720001268] [2024-10-12 15:21:12,878 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [720001268] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 15:21:12,878 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 15:21:12,880 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-12 15:21:12,880 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [383912470] [2024-10-12 15:21:12,880 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 15:21:12,881 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-12 15:21:12,881 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 15:21:12,881 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-12 15:21:12,881 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-12 15:21:12,882 INFO L87 Difference]: Start difference. First operand 1703 states and 2466 transitions. Second operand has 3 states, 3 states have (on average 60.666666666666664) internal successors, (182), 2 states have internal predecessors, (182), 0 states have call successors, (0), 0 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-12 15:21:13,698 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 15:21:13,699 INFO L93 Difference]: Finished difference Result 4237 states and 6116 transitions. [2024-10-12 15:21:13,699 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-12 15:21:13,700 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 60.666666666666664) internal successors, (182), 2 states have internal predecessors, (182), 0 states have call successors, (0), 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 182 [2024-10-12 15:21:13,700 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 15:21:13,709 INFO L225 Difference]: With dead ends: 4237 [2024-10-12 15:21:13,710 INFO L226 Difference]: Without dead ends: 2535 [2024-10-12 15:21:13,712 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-12 15:21:13,713 INFO L432 NwaCegarLoop]: 93 mSDtfsCounter, 236 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 585 mSolverCounterSat, 161 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 236 SdHoareTripleChecker+Valid, 110 SdHoareTripleChecker+Invalid, 746 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 161 IncrementalHoareTripleChecker+Valid, 585 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-10-12 15:21:13,716 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [236 Valid, 110 Invalid, 746 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [161 Valid, 585 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-10-12 15:21:13,719 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2535 states. [2024-10-12 15:21:13,755 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2535 to 2534. [2024-10-12 15:21:13,760 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2534 states, 2533 states have (on average 1.418476115278326) internal successors, (3593), 2533 states have internal predecessors, (3593), 0 states have call successors, (0), 0 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-12 15:21:13,768 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2534 states to 2534 states and 3593 transitions. [2024-10-12 15:21:13,769 INFO L78 Accepts]: Start accepts. Automaton has 2534 states and 3593 transitions. Word has length 182 [2024-10-12 15:21:13,769 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 15:21:13,770 INFO L471 AbstractCegarLoop]: Abstraction has 2534 states and 3593 transitions. [2024-10-12 15:21:13,770 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 60.666666666666664) internal successors, (182), 2 states have internal predecessors, (182), 0 states have call successors, (0), 0 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-12 15:21:13,770 INFO L276 IsEmpty]: Start isEmpty. Operand 2534 states and 3593 transitions. [2024-10-12 15:21:13,775 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 188 [2024-10-12 15:21:13,776 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 15:21:13,776 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12 15:21:13,776 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-10-12 15:21:13,777 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 15:21:13,777 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 15:21:13,777 INFO L85 PathProgramCache]: Analyzing trace with hash 242320446, now seen corresponding path program 1 times [2024-10-12 15:21:13,777 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 15:21:13,778 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [597717502] [2024-10-12 15:21:13,778 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 15:21:13,778 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 15:21:13,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 15:21:14,137 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 8 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 15:21:14,138 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 15:21:14,138 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [597717502] [2024-10-12 15:21:14,138 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [597717502] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-12 15:21:14,138 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [415599249] [2024-10-12 15:21:14,138 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 15:21:14,138 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-12 15:21:14,138 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 15:21:14,142 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-12 15:21:14,143 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-12 15:21:14,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 15:21:14,291 INFO L255 TraceCheckSpWp]: Trace formula consists of 389 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-10-12 15:21:14,301 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-12 15:21:14,532 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2024-10-12 15:21:14,533 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-12 15:21:14,533 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [415599249] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 15:21:14,533 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-12 15:21:14,533 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 5 [2024-10-12 15:21:14,533 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [418130486] [2024-10-12 15:21:14,535 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 15:21:14,536 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-12 15:21:14,536 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 15:21:14,537 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-12 15:21:14,537 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-10-12 15:21:14,537 INFO L87 Difference]: Start difference. First operand 2534 states and 3593 transitions. Second operand has 3 states, 3 states have (on average 60.666666666666664) internal successors, (182), 3 states have internal predecessors, (182), 0 states have call successors, (0), 0 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-12 15:21:15,400 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 15:21:15,400 INFO L93 Difference]: Finished difference Result 7506 states and 10648 transitions. [2024-10-12 15:21:15,401 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-12 15:21:15,401 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 60.666666666666664) internal successors, (182), 3 states have internal predecessors, (182), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 187 [2024-10-12 15:21:15,401 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 15:21:15,418 INFO L225 Difference]: With dead ends: 7506 [2024-10-12 15:21:15,418 INFO L226 Difference]: Without dead ends: 4973 [2024-10-12 15:21:15,423 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 190 GetRequests, 187 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-10-12 15:21:15,424 INFO L432 NwaCegarLoop]: 392 mSDtfsCounter, 62 mSDsluCounter, 28 mSDsCounter, 0 mSdLazyCounter, 534 mSolverCounterSat, 171 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 62 SdHoareTripleChecker+Valid, 420 SdHoareTripleChecker+Invalid, 705 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 171 IncrementalHoareTripleChecker+Valid, 534 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-10-12 15:21:15,424 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [62 Valid, 420 Invalid, 705 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [171 Valid, 534 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-10-12 15:21:15,430 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4973 states. [2024-10-12 15:21:15,491 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4973 to 4970. [2024-10-12 15:21:15,498 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4970 states, 4969 states have (on average 1.2684644797746025) internal successors, (6303), 4969 states have internal predecessors, (6303), 0 states have call successors, (0), 0 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-12 15:21:15,513 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4970 states to 4970 states and 6303 transitions. [2024-10-12 15:21:15,513 INFO L78 Accepts]: Start accepts. Automaton has 4970 states and 6303 transitions. Word has length 187 [2024-10-12 15:21:15,514 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 15:21:15,514 INFO L471 AbstractCegarLoop]: Abstraction has 4970 states and 6303 transitions. [2024-10-12 15:21:15,514 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 60.666666666666664) internal successors, (182), 3 states have internal predecessors, (182), 0 states have call successors, (0), 0 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-12 15:21:15,514 INFO L276 IsEmpty]: Start isEmpty. Operand 4970 states and 6303 transitions. [2024-10-12 15:21:15,522 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 193 [2024-10-12 15:21:15,523 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 15:21:15,523 INFO L215 NwaCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12 15:21:15,541 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-12 15:21:15,724 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,SelfDestructingSolverStorable5 [2024-10-12 15:21:15,724 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 15:21:15,725 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 15:21:15,725 INFO L85 PathProgramCache]: Analyzing trace with hash 176887005, now seen corresponding path program 1 times [2024-10-12 15:21:15,725 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 15:21:15,725 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [279672168] [2024-10-12 15:21:15,725 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 15:21:15,726 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 15:21:15,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 15:21:15,862 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 25 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 15:21:15,863 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 15:21:15,863 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [279672168] [2024-10-12 15:21:15,863 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [279672168] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 15:21:15,864 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 15:21:15,864 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-12 15:21:15,864 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2133292905] [2024-10-12 15:21:15,864 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 15:21:15,865 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-12 15:21:15,865 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 15:21:15,865 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-12 15:21:15,865 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-12 15:21:15,866 INFO L87 Difference]: Start difference. First operand 4970 states and 6303 transitions. Second operand has 3 states, 3 states have (on average 64.0) internal successors, (192), 3 states have internal predecessors, (192), 0 states have call successors, (0), 0 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-12 15:21:16,752 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 15:21:16,752 INFO L93 Difference]: Finished difference Result 14624 states and 18570 transitions. [2024-10-12 15:21:16,753 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-12 15:21:16,754 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 64.0) internal successors, (192), 3 states have internal predecessors, (192), 0 states have call successors, (0), 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 192 [2024-10-12 15:21:16,754 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 15:21:16,786 INFO L225 Difference]: With dead ends: 14624 [2024-10-12 15:21:16,787 INFO L226 Difference]: Without dead ends: 9655 [2024-10-12 15:21:16,795 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-12 15:21:16,796 INFO L432 NwaCegarLoop]: 151 mSDtfsCounter, 232 mSDsluCounter, 32 mSDsCounter, 0 mSdLazyCounter, 600 mSolverCounterSat, 119 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 232 SdHoareTripleChecker+Valid, 183 SdHoareTripleChecker+Invalid, 719 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 119 IncrementalHoareTripleChecker+Valid, 600 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-10-12 15:21:16,796 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [232 Valid, 183 Invalid, 719 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [119 Valid, 600 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-10-12 15:21:16,806 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9655 states. [2024-10-12 15:21:16,925 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9655 to 9652. [2024-10-12 15:21:16,939 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9652 states, 9651 states have (on average 1.231893068075847) internal successors, (11889), 9651 states have internal predecessors, (11889), 0 states have call successors, (0), 0 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-12 15:21:16,963 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9652 states to 9652 states and 11889 transitions. [2024-10-12 15:21:16,964 INFO L78 Accepts]: Start accepts. Automaton has 9652 states and 11889 transitions. Word has length 192 [2024-10-12 15:21:16,964 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 15:21:16,965 INFO L471 AbstractCegarLoop]: Abstraction has 9652 states and 11889 transitions. [2024-10-12 15:21:16,965 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 64.0) internal successors, (192), 3 states have internal predecessors, (192), 0 states have call successors, (0), 0 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-12 15:21:16,965 INFO L276 IsEmpty]: Start isEmpty. Operand 9652 states and 11889 transitions. [2024-10-12 15:21:16,979 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 221 [2024-10-12 15:21:16,980 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 15:21:16,981 INFO L215 NwaCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12 15:21:16,981 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-10-12 15:21:16,981 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 15:21:16,981 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 15:21:16,982 INFO L85 PathProgramCache]: Analyzing trace with hash 900150890, now seen corresponding path program 1 times [2024-10-12 15:21:16,982 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 15:21:16,982 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [438928788] [2024-10-12 15:21:16,982 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 15:21:16,983 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 15:21:17,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 15:21:17,572 INFO L134 CoverageAnalysis]: Checked inductivity of 53 backedges. 47 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 15:21:17,573 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 15:21:17,573 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [438928788] [2024-10-12 15:21:17,573 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [438928788] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-12 15:21:17,573 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [662680408] [2024-10-12 15:21:17,574 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 15:21:17,574 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-12 15:21:17,574 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 15:21:17,576 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-12 15:21:17,577 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-10-12 15:21:17,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 15:21:17,736 INFO L255 TraceCheckSpWp]: Trace formula consists of 414 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-10-12 15:21:17,741 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-12 15:21:17,978 INFO L134 CoverageAnalysis]: Checked inductivity of 53 backedges. 47 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2024-10-12 15:21:17,979 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-12 15:21:17,979 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [662680408] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 15:21:17,979 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-12 15:21:17,979 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [3] total 5 [2024-10-12 15:21:17,979 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [696828988] [2024-10-12 15:21:17,980 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 15:21:17,980 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-12 15:21:17,980 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 15:21:17,981 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-12 15:21:17,981 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-12 15:21:17,982 INFO L87 Difference]: Start difference. First operand 9652 states and 11889 transitions. Second operand has 3 states, 3 states have (on average 71.66666666666667) internal successors, (215), 3 states have internal predecessors, (215), 0 states have call successors, (0), 0 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-12 15:21:18,801 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 15:21:18,801 INFO L93 Difference]: Finished difference Result 19329 states and 23828 transitions. [2024-10-12 15:21:18,801 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-12 15:21:18,802 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 71.66666666666667) internal successors, (215), 3 states have internal predecessors, (215), 0 states have call successors, (0), 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 220 [2024-10-12 15:21:18,802 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 15:21:18,834 INFO L225 Difference]: With dead ends: 19329 [2024-10-12 15:21:18,834 INFO L226 Difference]: Without dead ends: 9678 [2024-10-12 15:21:18,845 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 222 GetRequests, 219 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-12 15:21:18,847 INFO L432 NwaCegarLoop]: 327 mSDtfsCounter, 65 mSDsluCounter, 21 mSDsCounter, 0 mSdLazyCounter, 669 mSolverCounterSat, 82 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 65 SdHoareTripleChecker+Valid, 348 SdHoareTripleChecker+Invalid, 751 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 82 IncrementalHoareTripleChecker+Valid, 669 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-10-12 15:21:18,847 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [65 Valid, 348 Invalid, 751 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [82 Valid, 669 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-10-12 15:21:18,859 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9678 states. [2024-10-12 15:21:18,982 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9678 to 9652. [2024-10-12 15:21:19,001 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9652 states, 9651 states have (on average 1.2199772044347736) internal successors, (11774), 9651 states have internal predecessors, (11774), 0 states have call successors, (0), 0 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-12 15:21:19,026 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9652 states to 9652 states and 11774 transitions. [2024-10-12 15:21:19,028 INFO L78 Accepts]: Start accepts. Automaton has 9652 states and 11774 transitions. Word has length 220 [2024-10-12 15:21:19,028 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 15:21:19,028 INFO L471 AbstractCegarLoop]: Abstraction has 9652 states and 11774 transitions. [2024-10-12 15:21:19,029 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 71.66666666666667) internal successors, (215), 3 states have internal predecessors, (215), 0 states have call successors, (0), 0 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-12 15:21:19,029 INFO L276 IsEmpty]: Start isEmpty. Operand 9652 states and 11774 transitions. [2024-10-12 15:21:19,044 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 227 [2024-10-12 15:21:19,046 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 15:21:19,047 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12 15:21:19,066 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-10-12 15:21:19,252 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable7 [2024-10-12 15:21:19,253 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 15:21:19,254 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 15:21:19,254 INFO L85 PathProgramCache]: Analyzing trace with hash 136125510, now seen corresponding path program 1 times [2024-10-12 15:21:19,254 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 15:21:19,254 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [355395593] [2024-10-12 15:21:19,254 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 15:21:19,255 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 15:21:19,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 15:21:19,585 INFO L134 CoverageAnalysis]: Checked inductivity of 70 backedges. 64 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2024-10-12 15:21:19,585 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 15:21:19,585 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [355395593] [2024-10-12 15:21:19,585 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [355395593] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 15:21:19,585 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 15:21:19,586 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-12 15:21:19,586 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1879447390] [2024-10-12 15:21:19,586 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 15:21:19,586 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-12 15:21:19,587 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 15:21:19,587 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-12 15:21:19,587 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-12 15:21:19,588 INFO L87 Difference]: Start difference. First operand 9652 states and 11774 transitions. Second operand has 3 states, 3 states have (on average 73.66666666666667) internal successors, (221), 3 states have internal predecessors, (221), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 15:21:20,382 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 15:21:20,383 INFO L93 Difference]: Finished difference Result 23566 states and 29200 transitions. [2024-10-12 15:21:20,383 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-12 15:21:20,384 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 73.66666666666667) internal successors, (221), 3 states have internal predecessors, (221), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 226 [2024-10-12 15:21:20,384 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 15:21:20,412 INFO L225 Difference]: With dead ends: 23566 [2024-10-12 15:21:20,412 INFO L226 Difference]: Without dead ends: 13915 [2024-10-12 15:21:20,425 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-12 15:21:20,426 INFO L432 NwaCegarLoop]: 166 mSDtfsCounter, 214 mSDsluCounter, 33 mSDsCounter, 0 mSdLazyCounter, 573 mSolverCounterSat, 126 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 214 SdHoareTripleChecker+Valid, 199 SdHoareTripleChecker+Invalid, 699 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 126 IncrementalHoareTripleChecker+Valid, 573 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-10-12 15:21:20,426 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [214 Valid, 199 Invalid, 699 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [126 Valid, 573 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-10-12 15:21:20,442 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13915 states. [2024-10-12 15:21:20,594 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13915 to 13915. [2024-10-12 15:21:20,615 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13915 states, 13914 states have (on average 1.1826218197498921) internal successors, (16455), 13914 states have internal predecessors, (16455), 0 states have call successors, (0), 0 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-12 15:21:20,647 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13915 states to 13915 states and 16455 transitions. [2024-10-12 15:21:20,648 INFO L78 Accepts]: Start accepts. Automaton has 13915 states and 16455 transitions. Word has length 226 [2024-10-12 15:21:20,648 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 15:21:20,648 INFO L471 AbstractCegarLoop]: Abstraction has 13915 states and 16455 transitions. [2024-10-12 15:21:20,649 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 73.66666666666667) internal successors, (221), 3 states have internal predecessors, (221), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 15:21:20,649 INFO L276 IsEmpty]: Start isEmpty. Operand 13915 states and 16455 transitions. [2024-10-12 15:21:20,669 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 231 [2024-10-12 15:21:20,670 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 15:21:20,670 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12 15:21:20,670 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-10-12 15:21:20,671 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 15:21:20,671 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 15:21:20,671 INFO L85 PathProgramCache]: Analyzing trace with hash -340207544, now seen corresponding path program 1 times [2024-10-12 15:21:20,671 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 15:21:20,671 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [366481309] [2024-10-12 15:21:20,671 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 15:21:20,672 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 15:21:20,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 15:21:21,105 INFO L134 CoverageAnalysis]: Checked inductivity of 85 backedges. 61 proven. 6 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2024-10-12 15:21:21,105 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 15:21:21,105 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [366481309] [2024-10-12 15:21:21,106 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [366481309] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-12 15:21:21,106 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1405807795] [2024-10-12 15:21:21,106 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 15:21:21,106 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-12 15:21:21,106 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 15:21:21,108 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-12 15:21:21,110 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-10-12 15:21:21,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 15:21:21,277 INFO L255 TraceCheckSpWp]: Trace formula consists of 467 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-10-12 15:21:21,281 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-12 15:21:21,463 INFO L134 CoverageAnalysis]: Checked inductivity of 85 backedges. 55 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2024-10-12 15:21:21,464 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-12 15:21:21,464 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1405807795] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 15:21:21,464 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-12 15:21:21,464 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [3] total 5 [2024-10-12 15:21:21,464 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1974238695] [2024-10-12 15:21:21,465 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 15:21:21,465 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-12 15:21:21,465 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 15:21:21,466 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-12 15:21:21,466 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-12 15:21:21,466 INFO L87 Difference]: Start difference. First operand 13915 states and 16455 transitions. Second operand has 3 states, 3 states have (on average 69.33333333333333) internal successors, (208), 3 states have internal predecessors, (208), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 15:21:22,162 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 15:21:22,163 INFO L93 Difference]: Finished difference Result 27832 states and 32914 transitions. [2024-10-12 15:21:22,163 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-12 15:21:22,163 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 69.33333333333333) internal successors, (208), 3 states have internal predecessors, (208), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 230 [2024-10-12 15:21:22,164 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 15:21:22,188 INFO L225 Difference]: With dead ends: 27832 [2024-10-12 15:21:22,189 INFO L226 Difference]: Without dead ends: 13918 [2024-10-12 15:21:22,201 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 232 GetRequests, 229 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-12 15:21:22,202 INFO L432 NwaCegarLoop]: 319 mSDtfsCounter, 98 mSDsluCounter, 20 mSDsCounter, 0 mSdLazyCounter, 627 mSolverCounterSat, 48 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 98 SdHoareTripleChecker+Valid, 339 SdHoareTripleChecker+Invalid, 675 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 48 IncrementalHoareTripleChecker+Valid, 627 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-10-12 15:21:22,202 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [98 Valid, 339 Invalid, 675 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [48 Valid, 627 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-10-12 15:21:22,214 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13918 states. [2024-10-12 15:21:22,387 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13918 to 13915. [2024-10-12 15:21:22,402 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13915 states, 13914 states have (on average 1.1627856834842605) internal successors, (16179), 13914 states have internal predecessors, (16179), 0 states have call successors, (0), 0 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-12 15:21:22,427 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13915 states to 13915 states and 16179 transitions. [2024-10-12 15:21:22,428 INFO L78 Accepts]: Start accepts. Automaton has 13915 states and 16179 transitions. Word has length 230 [2024-10-12 15:21:22,429 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 15:21:22,429 INFO L471 AbstractCegarLoop]: Abstraction has 13915 states and 16179 transitions. [2024-10-12 15:21:22,429 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 69.33333333333333) internal successors, (208), 3 states have internal predecessors, (208), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 15:21:22,429 INFO L276 IsEmpty]: Start isEmpty. Operand 13915 states and 16179 transitions. [2024-10-12 15:21:22,453 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 236 [2024-10-12 15:21:22,454 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 15:21:22,454 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 15:21:22,473 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2024-10-12 15:21:22,658 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-12 15:21:22,659 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 15:21:22,660 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 15:21:22,660 INFO L85 PathProgramCache]: Analyzing trace with hash 26196119, now seen corresponding path program 1 times [2024-10-12 15:21:22,660 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 15:21:22,661 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1198285040] [2024-10-12 15:21:22,661 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 15:21:22,661 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 15:21:22,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 15:21:23,162 INFO L134 CoverageAnalysis]: Checked inductivity of 62 backedges. 62 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 15:21:23,163 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 15:21:23,163 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1198285040] [2024-10-12 15:21:23,163 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1198285040] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 15:21:23,163 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 15:21:23,163 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-12 15:21:23,163 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [214565776] [2024-10-12 15:21:23,163 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 15:21:23,164 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-12 15:21:23,164 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 15:21:23,164 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-12 15:21:23,164 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-12 15:21:23,165 INFO L87 Difference]: Start difference. First operand 13915 states and 16179 transitions. Second operand has 3 states, 3 states have (on average 78.33333333333333) internal successors, (235), 2 states have internal predecessors, (235), 0 states have call successors, (0), 0 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-12 15:21:24,027 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 15:21:24,027 INFO L93 Difference]: Finished difference Result 34584 states and 40093 transitions. [2024-10-12 15:21:24,027 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-12 15:21:24,028 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 78.33333333333333) internal successors, (235), 2 states have internal predecessors, (235), 0 states have call successors, (0), 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 235 [2024-10-12 15:21:24,028 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 15:21:24,056 INFO L225 Difference]: With dead ends: 34584 [2024-10-12 15:21:24,056 INFO L226 Difference]: Without dead ends: 20670 [2024-10-12 15:21:24,073 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-12 15:21:24,073 INFO L432 NwaCegarLoop]: 212 mSDtfsCounter, 178 mSDsluCounter, 24 mSDsCounter, 0 mSdLazyCounter, 737 mSolverCounterSat, 48 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 178 SdHoareTripleChecker+Valid, 236 SdHoareTripleChecker+Invalid, 785 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 48 IncrementalHoareTripleChecker+Valid, 737 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-10-12 15:21:24,074 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [178 Valid, 236 Invalid, 785 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [48 Valid, 737 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-10-12 15:21:24,089 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20670 states. [2024-10-12 15:21:24,262 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20670 to 20656. [2024-10-12 15:21:24,284 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20656 states, 20655 states have (on average 1.1499878963931252) internal successors, (23753), 20655 states have internal predecessors, (23753), 0 states have call successors, (0), 0 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-12 15:21:24,315 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20656 states to 20656 states and 23753 transitions. [2024-10-12 15:21:24,316 INFO L78 Accepts]: Start accepts. Automaton has 20656 states and 23753 transitions. Word has length 235 [2024-10-12 15:21:24,317 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 15:21:24,317 INFO L471 AbstractCegarLoop]: Abstraction has 20656 states and 23753 transitions. [2024-10-12 15:21:24,317 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 78.33333333333333) internal successors, (235), 2 states have internal predecessors, (235), 0 states have call successors, (0), 0 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-12 15:21:24,317 INFO L276 IsEmpty]: Start isEmpty. Operand 20656 states and 23753 transitions. [2024-10-12 15:21:24,342 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 243 [2024-10-12 15:21:24,342 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 15:21:24,342 INFO L215 NwaCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12 15:21:24,343 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-10-12 15:21:24,343 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 15:21:24,343 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 15:21:24,343 INFO L85 PathProgramCache]: Analyzing trace with hash 938730856, now seen corresponding path program 1 times [2024-10-12 15:21:24,343 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 15:21:24,344 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1966525579] [2024-10-12 15:21:24,344 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 15:21:24,344 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 15:21:24,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 15:21:24,880 INFO L134 CoverageAnalysis]: Checked inductivity of 75 backedges. 75 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 15:21:24,880 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 15:21:24,880 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1966525579] [2024-10-12 15:21:24,880 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1966525579] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 15:21:24,880 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 15:21:24,880 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-12 15:21:24,880 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [151106416] [2024-10-12 15:21:24,880 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 15:21:24,881 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-12 15:21:24,881 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 15:21:24,881 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-12 15:21:24,882 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-10-12 15:21:24,882 INFO L87 Difference]: Start difference. First operand 20656 states and 23753 transitions. Second operand has 4 states, 4 states have (on average 60.5) internal successors, (242), 3 states have internal predecessors, (242), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 15:21:25,920 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 15:21:25,920 INFO L93 Difference]: Finished difference Result 47017 states and 54064 transitions. [2024-10-12 15:21:25,920 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-12 15:21:25,921 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 60.5) internal successors, (242), 3 states have internal predecessors, (242), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 242 [2024-10-12 15:21:25,921 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 15:21:25,967 INFO L225 Difference]: With dead ends: 47017 [2024-10-12 15:21:25,968 INFO L226 Difference]: Without dead ends: 26362 [2024-10-12 15:21:25,986 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-12 15:21:25,987 INFO L432 NwaCegarLoop]: 169 mSDtfsCounter, 508 mSDsluCounter, 28 mSDsCounter, 0 mSdLazyCounter, 916 mSolverCounterSat, 169 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 508 SdHoareTripleChecker+Valid, 197 SdHoareTripleChecker+Invalid, 1085 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 169 IncrementalHoareTripleChecker+Valid, 916 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2024-10-12 15:21:25,987 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [508 Valid, 197 Invalid, 1085 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [169 Valid, 916 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2024-10-12 15:21:26,008 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26362 states. [2024-10-12 15:21:26,246 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26362 to 26344. [2024-10-12 15:21:26,269 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26344 states, 26343 states have (on average 1.137341988384011) internal successors, (29961), 26343 states have internal predecessors, (29961), 0 states have call successors, (0), 0 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-12 15:21:26,309 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26344 states to 26344 states and 29961 transitions. [2024-10-12 15:21:26,310 INFO L78 Accepts]: Start accepts. Automaton has 26344 states and 29961 transitions. Word has length 242 [2024-10-12 15:21:26,310 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 15:21:26,311 INFO L471 AbstractCegarLoop]: Abstraction has 26344 states and 29961 transitions. [2024-10-12 15:21:26,311 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 60.5) internal successors, (242), 3 states have internal predecessors, (242), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 15:21:26,311 INFO L276 IsEmpty]: Start isEmpty. Operand 26344 states and 29961 transitions. [2024-10-12 15:21:26,336 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 261 [2024-10-12 15:21:26,337 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 15:21:26,337 INFO L215 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12 15:21:26,337 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-10-12 15:21:26,338 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 15:21:26,338 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 15:21:26,338 INFO L85 PathProgramCache]: Analyzing trace with hash -1427444517, now seen corresponding path program 1 times [2024-10-12 15:21:26,338 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 15:21:26,338 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1367048751] [2024-10-12 15:21:26,339 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 15:21:26,339 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 15:21:26,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 15:21:26,851 INFO L134 CoverageAnalysis]: Checked inductivity of 157 backedges. 86 proven. 6 refuted. 0 times theorem prover too weak. 65 trivial. 0 not checked. [2024-10-12 15:21:26,851 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 15:21:26,851 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1367048751] [2024-10-12 15:21:26,852 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1367048751] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-12 15:21:26,852 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1785137331] [2024-10-12 15:21:26,852 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 15:21:26,852 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-12 15:21:26,853 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 15:21:26,854 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-12 15:21:26,856 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-10-12 15:21:27,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 15:21:27,046 INFO L255 TraceCheckSpWp]: Trace formula consists of 531 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-10-12 15:21:27,051 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-12 15:21:27,241 INFO L134 CoverageAnalysis]: Checked inductivity of 157 backedges. 87 proven. 0 refuted. 0 times theorem prover too weak. 70 trivial. 0 not checked. [2024-10-12 15:21:27,241 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-12 15:21:27,241 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1785137331] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 15:21:27,241 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-12 15:21:27,241 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [3] total 5 [2024-10-12 15:21:27,242 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [390454499] [2024-10-12 15:21:27,242 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 15:21:27,242 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-12 15:21:27,242 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 15:21:27,243 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-12 15:21:27,243 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-12 15:21:27,244 INFO L87 Difference]: Start difference. First operand 26344 states and 29961 transitions. Second operand has 3 states, 3 states have (on average 72.33333333333333) internal successors, (217), 3 states have internal predecessors, (217), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 15:21:27,961 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 15:21:27,962 INFO L93 Difference]: Finished difference Result 64705 states and 74042 transitions. [2024-10-12 15:21:27,962 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-12 15:21:27,962 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 72.33333333333333) internal successors, (217), 3 states have internal predecessors, (217), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 260 [2024-10-12 15:21:27,963 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 15:21:28,019 INFO L225 Difference]: With dead ends: 64705 [2024-10-12 15:21:28,019 INFO L226 Difference]: Without dead ends: 38768 [2024-10-12 15:21:28,051 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 262 GetRequests, 259 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-12 15:21:28,051 INFO L432 NwaCegarLoop]: 359 mSDtfsCounter, 71 mSDsluCounter, 30 mSDsCounter, 0 mSdLazyCounter, 551 mSolverCounterSat, 183 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 71 SdHoareTripleChecker+Valid, 389 SdHoareTripleChecker+Invalid, 734 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 183 IncrementalHoareTripleChecker+Valid, 551 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-10-12 15:21:28,052 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [71 Valid, 389 Invalid, 734 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [183 Valid, 551 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-10-12 15:21:28,086 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38768 states. [2024-10-12 15:21:28,547 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38768 to 38725. [2024-10-12 15:21:28,580 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 38725 states, 38724 states have (on average 1.1370467926867058) internal successors, (44031), 38724 states have internal predecessors, (44031), 0 states have call successors, (0), 0 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-12 15:21:28,636 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38725 states to 38725 states and 44031 transitions. [2024-10-12 15:21:28,638 INFO L78 Accepts]: Start accepts. Automaton has 38725 states and 44031 transitions. Word has length 260 [2024-10-12 15:21:28,638 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 15:21:28,639 INFO L471 AbstractCegarLoop]: Abstraction has 38725 states and 44031 transitions. [2024-10-12 15:21:28,639 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 72.33333333333333) internal successors, (217), 3 states have internal predecessors, (217), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 15:21:28,639 INFO L276 IsEmpty]: Start isEmpty. Operand 38725 states and 44031 transitions. [2024-10-12 15:21:28,671 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 273 [2024-10-12 15:21:28,671 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 15:21:28,671 INFO L215 NwaCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12 15:21:28,689 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2024-10-12 15:21:28,872 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-12 15:21:28,872 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 15:21:28,873 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 15:21:28,873 INFO L85 PathProgramCache]: Analyzing trace with hash 411341231, now seen corresponding path program 1 times [2024-10-12 15:21:28,873 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 15:21:28,873 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [98253902] [2024-10-12 15:21:28,873 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 15:21:28,873 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 15:21:28,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 15:21:29,077 INFO L134 CoverageAnalysis]: Checked inductivity of 105 backedges. 99 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2024-10-12 15:21:29,078 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 15:21:29,078 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [98253902] [2024-10-12 15:21:29,078 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [98253902] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 15:21:29,078 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 15:21:29,078 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-12 15:21:29,078 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [644066358] [2024-10-12 15:21:29,078 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 15:21:29,079 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-12 15:21:29,079 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 15:21:29,079 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-12 15:21:29,079 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-12 15:21:29,080 INFO L87 Difference]: Start difference. First operand 38725 states and 44031 transitions. Second operand has 3 states, 3 states have (on average 89.0) internal successors, (267), 2 states have internal predecessors, (267), 0 states have call successors, (0), 0 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-12 15:21:29,523 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 15:21:29,523 INFO L93 Difference]: Finished difference Result 72720 states and 82633 transitions. [2024-10-12 15:21:29,523 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-12 15:21:29,523 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 89.0) internal successors, (267), 2 states have internal predecessors, (267), 0 states have call successors, (0), 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 272 [2024-10-12 15:21:29,524 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 15:21:29,556 INFO L225 Difference]: With dead ends: 72720 [2024-10-12 15:21:29,557 INFO L226 Difference]: Without dead ends: 34402 [2024-10-12 15:21:29,584 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-12 15:21:29,585 INFO L432 NwaCegarLoop]: 29 mSDtfsCounter, 247 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 324 mSolverCounterSat, 26 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 247 SdHoareTripleChecker+Valid, 29 SdHoareTripleChecker+Invalid, 350 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 26 IncrementalHoareTripleChecker+Valid, 324 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-12 15:21:29,585 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [247 Valid, 29 Invalid, 350 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [26 Valid, 324 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-12 15:21:29,609 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34402 states. [2024-10-12 15:21:30,275 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34402 to 34402. [2024-10-12 15:21:30,298 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 34402 states, 34401 states have (on average 1.1275253626348072) internal successors, (38788), 34401 states have internal predecessors, (38788), 0 states have call successors, (0), 0 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-12 15:21:30,333 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34402 states to 34402 states and 38788 transitions. [2024-10-12 15:21:30,334 INFO L78 Accepts]: Start accepts. Automaton has 34402 states and 38788 transitions. Word has length 272 [2024-10-12 15:21:30,334 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 15:21:30,335 INFO L471 AbstractCegarLoop]: Abstraction has 34402 states and 38788 transitions. [2024-10-12 15:21:30,335 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 89.0) internal successors, (267), 2 states have internal predecessors, (267), 0 states have call successors, (0), 0 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-12 15:21:30,335 INFO L276 IsEmpty]: Start isEmpty. Operand 34402 states and 38788 transitions. [2024-10-12 15:21:30,360 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 283 [2024-10-12 15:21:30,360 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 15:21:30,361 INFO L215 NwaCegarLoop]: trace histogram [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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12 15:21:30,361 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-10-12 15:21:30,361 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 15:21:30,361 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 15:21:30,361 INFO L85 PathProgramCache]: Analyzing trace with hash -63096391, now seen corresponding path program 1 times [2024-10-12 15:21:30,362 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 15:21:30,362 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1827637951] [2024-10-12 15:21:30,362 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 15:21:30,362 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 15:21:30,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 15:21:30,898 INFO L134 CoverageAnalysis]: Checked inductivity of 217 backedges. 102 proven. 6 refuted. 0 times theorem prover too weak. 109 trivial. 0 not checked. [2024-10-12 15:21:30,898 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 15:21:30,898 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1827637951] [2024-10-12 15:21:30,898 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1827637951] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-12 15:21:30,899 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [621315213] [2024-10-12 15:21:30,899 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 15:21:30,899 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-12 15:21:30,899 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 15:21:30,901 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-12 15:21:30,903 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2024-10-12 15:21:31,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 15:21:31,115 INFO L255 TraceCheckSpWp]: Trace formula consists of 542 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-10-12 15:21:31,122 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-12 15:21:31,247 INFO L134 CoverageAnalysis]: Checked inductivity of 217 backedges. 108 proven. 0 refuted. 0 times theorem prover too weak. 109 trivial. 0 not checked. [2024-10-12 15:21:31,247 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-12 15:21:31,247 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [621315213] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 15:21:31,248 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-12 15:21:31,248 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [3] total 5 [2024-10-12 15:21:31,248 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1026757927] [2024-10-12 15:21:31,248 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 15:21:31,249 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-12 15:21:31,249 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 15:21:31,250 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-12 15:21:31,250 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2024-10-12 15:21:31,250 INFO L87 Difference]: Start difference. First operand 34402 states and 38788 transitions. Second operand has 4 states, 4 states have (on average 52.25) internal successors, (209), 3 states have internal predecessors, (209), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 15:21:32,273 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 15:21:32,273 INFO L93 Difference]: Finished difference Result 113514 states and 128022 transitions. [2024-10-12 15:21:32,273 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-12 15:21:32,274 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 52.25) internal successors, (209), 3 states have internal predecessors, (209), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 282 [2024-10-12 15:21:32,274 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 15:21:32,359 INFO L225 Difference]: With dead ends: 113514 [2024-10-12 15:21:32,359 INFO L226 Difference]: Without dead ends: 79521 [2024-10-12 15:21:32,394 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 284 GetRequests, 280 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2024-10-12 15:21:32,395 INFO L432 NwaCegarLoop]: 90 mSDtfsCounter, 721 mSDsluCounter, 245 mSDsCounter, 0 mSdLazyCounter, 717 mSolverCounterSat, 150 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 721 SdHoareTripleChecker+Valid, 335 SdHoareTripleChecker+Invalid, 867 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 150 IncrementalHoareTripleChecker+Valid, 717 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-10-12 15:21:32,395 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [721 Valid, 335 Invalid, 867 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [150 Valid, 717 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-10-12 15:21:32,466 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79521 states. [2024-10-12 15:21:33,672 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79521 to 79516. [2024-10-12 15:21:33,733 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 79516 states, 79515 states have (on average 1.1208576998050683) internal successors, (89125), 79515 states have internal predecessors, (89125), 0 states have call successors, (0), 0 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-12 15:21:33,837 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79516 states to 79516 states and 89125 transitions. [2024-10-12 15:21:33,839 INFO L78 Accepts]: Start accepts. Automaton has 79516 states and 89125 transitions. Word has length 282 [2024-10-12 15:21:33,839 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 15:21:33,839 INFO L471 AbstractCegarLoop]: Abstraction has 79516 states and 89125 transitions. [2024-10-12 15:21:33,839 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 52.25) internal successors, (209), 3 states have internal predecessors, (209), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 15:21:33,839 INFO L276 IsEmpty]: Start isEmpty. Operand 79516 states and 89125 transitions. [2024-10-12 15:21:33,866 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 286 [2024-10-12 15:21:33,866 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 15:21:33,866 INFO L215 NwaCegarLoop]: trace histogram [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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12 15:21:33,879 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2024-10-12 15:21:34,066 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2024-10-12 15:21:34,067 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 15:21:34,068 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 15:21:34,068 INFO L85 PathProgramCache]: Analyzing trace with hash -1773423866, now seen corresponding path program 1 times [2024-10-12 15:21:34,068 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 15:21:34,068 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1447130300] [2024-10-12 15:21:34,068 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 15:21:34,068 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 15:21:34,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 15:21:34,612 INFO L134 CoverageAnalysis]: Checked inductivity of 226 backedges. 111 proven. 6 refuted. 0 times theorem prover too weak. 109 trivial. 0 not checked. [2024-10-12 15:21:34,612 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 15:21:34,612 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1447130300] [2024-10-12 15:21:34,612 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1447130300] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-12 15:21:34,612 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1019778623] [2024-10-12 15:21:34,612 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 15:21:34,613 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-12 15:21:34,613 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 15:21:34,615 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-12 15:21:34,616 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2024-10-12 15:21:34,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 15:21:34,756 INFO L255 TraceCheckSpWp]: Trace formula consists of 553 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-10-12 15:21:34,760 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-12 15:21:34,806 INFO L134 CoverageAnalysis]: Checked inductivity of 226 backedges. 183 proven. 0 refuted. 0 times theorem prover too weak. 43 trivial. 0 not checked. [2024-10-12 15:21:34,807 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-12 15:21:34,807 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1019778623] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 15:21:34,807 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-12 15:21:34,807 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [3] total 5 [2024-10-12 15:21:34,808 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [689493102] [2024-10-12 15:21:34,808 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 15:21:34,808 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-12 15:21:34,808 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 15:21:34,809 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-12 15:21:34,809 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-12 15:21:34,809 INFO L87 Difference]: Start difference. First operand 79516 states and 89125 transitions. Second operand has 3 states, 3 states have (on average 83.33333333333333) internal successors, (250), 3 states have internal predecessors, (250), 0 states have call successors, (0), 0 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-12 15:21:35,728 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 15:21:35,729 INFO L93 Difference]: Finished difference Result 143382 states and 160821 transitions. [2024-10-12 15:21:35,729 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-12 15:21:35,729 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 83.33333333333333) internal successors, (250), 3 states have internal predecessors, (250), 0 states have call successors, (0), 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 285 [2024-10-12 15:21:35,730 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 15:21:35,731 INFO L225 Difference]: With dead ends: 143382 [2024-10-12 15:21:35,731 INFO L226 Difference]: Without dead ends: 0 [2024-10-12 15:21:35,791 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 287 GetRequests, 284 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-12 15:21:35,792 INFO L432 NwaCegarLoop]: 282 mSDtfsCounter, 215 mSDsluCounter, 19 mSDsCounter, 0 mSdLazyCounter, 549 mSolverCounterSat, 88 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 215 SdHoareTripleChecker+Valid, 301 SdHoareTripleChecker+Invalid, 637 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 88 IncrementalHoareTripleChecker+Valid, 549 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-10-12 15:21:35,792 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [215 Valid, 301 Invalid, 637 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [88 Valid, 549 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-10-12 15:21:35,793 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2024-10-12 15:21:35,793 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2024-10-12 15:21:35,793 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-12 15:21:35,794 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2024-10-12 15:21:35,795 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 285 [2024-10-12 15:21:35,795 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 15:21:35,795 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2024-10-12 15:21:35,795 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 83.33333333333333) internal successors, (250), 3 states have internal predecessors, (250), 0 states have call successors, (0), 0 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-12 15:21:35,795 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2024-10-12 15:21:35,795 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2024-10-12 15:21:35,798 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-10-12 15:21:35,813 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2024-10-12 15:21:35,999 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2024-10-12 15:21:36,002 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 15:21:36,004 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2024-10-12 15:21:39,345 INFO L165 ceAbstractionStarter]: Computing trace abstraction results [2024-10-12 15:21:39,363 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 12.10 03:21:39 BoogieIcfgContainer [2024-10-12 15:21:39,364 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-10-12 15:21:39,364 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-10-12 15:21:39,364 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-10-12 15:21:39,365 INFO L274 PluginConnector]: Witness Printer initialized [2024-10-12 15:21:39,365 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.10 03:21:07" (3/4) ... [2024-10-12 15:21:39,367 INFO L139 WitnessPrinter]: Generating witness for correct program [2024-10-12 15:21:39,398 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 12 nodes and edges [2024-10-12 15:21:39,400 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2024-10-12 15:21:39,402 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2024-10-12 15:21:39,404 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2024-10-12 15:21:39,611 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2024-10-12 15:21:39,612 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.yml [2024-10-12 15:21:39,612 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-10-12 15:21:39,613 INFO L158 Benchmark]: Toolchain (without parser) took 35000.11ms. Allocated memory was 159.4MB in the beginning and 5.9GB in the end (delta: 5.7GB). Free memory was 83.0MB in the beginning and 5.0GB in the end (delta: -4.9GB). Peak memory consumption was 770.6MB. Max. memory is 16.1GB. [2024-10-12 15:21:39,613 INFO L158 Benchmark]: CDTParser took 0.17ms. Allocated memory is still 159.4MB. Free memory was 110.2MB in the beginning and 110.1MB in the end (delta: 159.4kB). There was no memory consumed. Max. memory is 16.1GB. [2024-10-12 15:21:39,614 INFO L158 Benchmark]: CACSL2BoogieTranslator took 853.56ms. Allocated memory was 159.4MB in the beginning and 220.2MB in the end (delta: 60.8MB). Free memory was 82.9MB in the beginning and 137.7MB in the end (delta: -54.8MB). Peak memory consumption was 17.2MB. Max. memory is 16.1GB. [2024-10-12 15:21:39,614 INFO L158 Benchmark]: Boogie Procedure Inliner took 140.30ms. Allocated memory is still 220.2MB. Free memory was 137.7MB in the beginning and 123.0MB in the end (delta: 14.7MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2024-10-12 15:21:39,614 INFO L158 Benchmark]: Boogie Preprocessor took 164.94ms. Allocated memory is still 220.2MB. Free memory was 123.0MB in the beginning and 110.4MB in the end (delta: 12.6MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2024-10-12 15:21:39,614 INFO L158 Benchmark]: RCFGBuilder took 1998.75ms. Allocated memory is still 220.2MB. Free memory was 110.4MB in the beginning and 151.0MB in the end (delta: -40.6MB). Peak memory consumption was 87.3MB. Max. memory is 16.1GB. [2024-10-12 15:21:39,614 INFO L158 Benchmark]: TraceAbstraction took 31585.54ms. Allocated memory was 220.2MB in the beginning and 5.9GB in the end (delta: 5.6GB). Free memory was 151.0MB in the beginning and 5.0GB in the end (delta: -4.9GB). Peak memory consumption was 1.0GB. Max. memory is 16.1GB. [2024-10-12 15:21:39,614 INFO L158 Benchmark]: Witness Printer took 247.80ms. Allocated memory is still 5.9GB. Free memory was 5.0GB in the beginning and 5.0GB in the end (delta: 26.2MB). Peak memory consumption was 27.3MB. Max. memory is 16.1GB. [2024-10-12 15:21:39,617 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.17ms. Allocated memory is still 159.4MB. Free memory was 110.2MB in the beginning and 110.1MB in the end (delta: 159.4kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 853.56ms. Allocated memory was 159.4MB in the beginning and 220.2MB in the end (delta: 60.8MB). Free memory was 82.9MB in the beginning and 137.7MB in the end (delta: -54.8MB). Peak memory consumption was 17.2MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 140.30ms. Allocated memory is still 220.2MB. Free memory was 137.7MB in the beginning and 123.0MB in the end (delta: 14.7MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. * Boogie Preprocessor took 164.94ms. Allocated memory is still 220.2MB. Free memory was 123.0MB in the beginning and 110.4MB in the end (delta: 12.6MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * RCFGBuilder took 1998.75ms. Allocated memory is still 220.2MB. Free memory was 110.4MB in the beginning and 151.0MB in the end (delta: -40.6MB). Peak memory consumption was 87.3MB. Max. memory is 16.1GB. * TraceAbstraction took 31585.54ms. Allocated memory was 220.2MB in the beginning and 5.9GB in the end (delta: 5.6GB). Free memory was 151.0MB in the beginning and 5.0GB in the end (delta: -4.9GB). Peak memory consumption was 1.0GB. Max. memory is 16.1GB. * Witness Printer took 247.80ms. Allocated memory is still 5.9GB. Free memory was 5.0GB in the beginning and 5.0GB in the end (delta: 26.2MB). Peak memory consumption was 27.3MB. 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: 1564]: 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, 240 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 28.1s, OverallIterations: 16, TraceHistogramMax: 5, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.3s, AutomataDifference: 13.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 3450 SdHoareTripleChecker+Valid, 10.6s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 3450 mSDsluCounter, 3831 SdHoareTripleChecker+Invalid, 8.7s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 576 mSDsCounter, 1743 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 9209 IncrementalHoareTripleChecker+Invalid, 10952 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 1743 mSolverCounterUnsat, 3255 mSDtfsCounter, 9209 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 1500 GetRequests, 1471 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=79516occurred in iteration=15, InterpolantAutomatonStates: 49, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 4.4s AutomataMinimizationTime, 16 MinimizatonAttempts, 143 StatesRemovedByMinimization, 12 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.5s SsaConstructionTime, 0.9s SatisfiabilityAnalysisTime, 6.5s InterpolantComputationTime, 4982 NumberOfCodeBlocks, 4982 NumberOfCodeBlocksAsserted, 22 NumberOfCheckSat, 4960 ConstructedInterpolants, 0 QuantifiedInterpolants, 10135 SizeOfPredicates, 0 NumberOfNonLiveVariables, 2896 ConjunctsInSsa, 16 ConjunctsInUnsatCore, 22 InterpolantComputations, 16 PerfectInterpolantSequences, 1835/1877 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: 1668]: Loop Invariant Derived loop invariant: ((((((((((((((((a15 == 1) && (a5 == 1)) && (a12 == 1)) && (a3 <= 0)) && (a27 == 1)) || ((((((a15 == 1) && (a26 == 1)) && (a5 == 1)) && (a12 == 1)) && (a11 == 1)) && (a27 == 1))) || (((a5 == 1) && (a12 == 1)) && (a27 <= 0))) || (((((a26 == 1) && (a5 == 1)) && (a12 == 1)) && (a11 == 0)) && (a27 == 1))) || (((((a26 == 1) && (a5 == 1)) && (a12 == 1)) && (a3 <= 0)) && (a27 == 1))) || ((((a26 == 1) && (a5 == 1)) && (a12 == 0)) && (a27 <= 0))) || ((((a5 == 1) && (a12 == 1)) && (2 <= a3)) && (a27 == 1))) || (((a5 == 1) && (a12 == 0)) && (a27 == 1))) || (((((a5 == 1) && (a11 == 0)) && (a3 == 1)) && (a12 == 0)) && (a27 <= 0))) || (((((a5 == 1) && (a3 == 1)) && (a6 != 1)) && (a12 == 0)) && (a27 <= 0))) || ((((((a26 == 1) && (a5 == 1)) && (a12 == 1)) && (a11 == 1)) && (a6 != 1)) && (a27 == 1))) || ((((a5 == 1) && (2 <= a3)) && (a12 == 0)) && (a27 <= 0))) RESULT: Ultimate proved your program to be correct! [2024-10-12 15:21:39,649 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE