./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/Problem01_label11.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/Problem01_label11.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 2dc34619b8722f38daca39084af716acca2f2990c40299072c7b560e6e3245de --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.dk.eval-mul-div-a046e57-m [2024-10-12 15:15:08,785 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-12 15:15:08,881 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-10-12 15:15:08,889 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-12 15:15:08,890 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-12 15:15:08,913 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-12 15:15:08,913 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-12 15:15:08,914 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-12 15:15:08,914 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-12 15:15:08,915 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-12 15:15:08,915 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-12 15:15:08,915 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-12 15:15:08,916 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-12 15:15:08,916 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-12 15:15:08,917 INFO L153 SettingsManager]: * Use SBE=true [2024-10-12 15:15:08,917 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-12 15:15:08,917 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-12 15:15:08,918 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-12 15:15:08,918 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-12 15:15:08,918 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-12 15:15:08,918 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-12 15:15:08,919 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-12 15:15:08,919 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-12 15:15:08,920 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-12 15:15:08,923 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-12 15:15:08,923 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-12 15:15:08,923 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-12 15:15:08,923 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-12 15:15:08,924 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-12 15:15:08,924 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-12 15:15:08,924 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-12 15:15:08,924 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-12 15:15:08,925 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-12 15:15:08,925 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-12 15:15:08,925 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-12 15:15:08,925 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-12 15:15:08,925 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-12 15:15:08,926 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-12 15:15:08,926 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-12 15:15:08,929 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-12 15:15:08,929 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-12 15:15:08,930 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-12 15:15:08,930 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 -> 2dc34619b8722f38daca39084af716acca2f2990c40299072c7b560e6e3245de [2024-10-12 15:15:09,189 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-12 15:15:09,215 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-12 15:15:09,217 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-12 15:15:09,219 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-12 15:15:09,219 INFO L274 PluginConnector]: CDTParser initialized [2024-10-12 15:15:09,220 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem01_label11.c [2024-10-12 15:15:10,670 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-12 15:15:10,910 INFO L384 CDTParser]: Found 1 translation units. [2024-10-12 15:15:10,911 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem01_label11.c [2024-10-12 15:15:10,931 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3ae238c0c/0eb8a3d3597742d0ad596111292c2877/FLAGc5988bb78 [2024-10-12 15:15:10,952 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3ae238c0c/0eb8a3d3597742d0ad596111292c2877 [2024-10-12 15:15:10,955 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-12 15:15:10,957 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-12 15:15:10,960 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-12 15:15:10,961 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-12 15:15:10,968 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-12 15:15:10,968 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.10 03:15:10" (1/1) ... [2024-10-12 15:15:10,970 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1fb5f9e5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 03:15:10, skipping insertion in model container [2024-10-12 15:15:10,970 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.10 03:15:10" (1/1) ... [2024-10-12 15:15:11,013 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-12 15:15:11,383 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/Problem01_label11.c[19099,19112] [2024-10-12 15:15:11,418 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-12 15:15:11,440 INFO L200 MainTranslator]: Completed pre-run [2024-10-12 15:15:11,524 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/Problem01_label11.c[19099,19112] [2024-10-12 15:15:11,536 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-12 15:15:11,559 INFO L204 MainTranslator]: Completed translation [2024-10-12 15:15:11,560 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 03:15:11 WrapperNode [2024-10-12 15:15:11,560 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-12 15:15:11,561 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-12 15:15:11,561 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-12 15:15:11,561 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-12 15:15:11,568 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:15:11" (1/1) ... [2024-10-12 15:15:11,586 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:15:11" (1/1) ... [2024-10-12 15:15:11,637 INFO L138 Inliner]: procedures = 14, calls = 8, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 658 [2024-10-12 15:15:11,641 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-12 15:15:11,642 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-12 15:15:11,642 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-12 15:15:11,642 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-12 15:15:11,652 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 03:15:11" (1/1) ... [2024-10-12 15:15:11,653 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 03:15:11" (1/1) ... [2024-10-12 15:15:11,657 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 03:15:11" (1/1) ... [2024-10-12 15:15:11,690 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:15:11,690 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 03:15:11" (1/1) ... [2024-10-12 15:15:11,690 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 03:15:11" (1/1) ... [2024-10-12 15:15:11,721 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 03:15:11" (1/1) ... [2024-10-12 15:15:11,735 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 03:15:11" (1/1) ... [2024-10-12 15:15:11,745 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 03:15:11" (1/1) ... [2024-10-12 15:15:11,756 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 03:15:11" (1/1) ... [2024-10-12 15:15:11,771 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-12 15:15:11,775 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-12 15:15:11,775 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-12 15:15:11,775 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-12 15:15:11,776 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 03:15:11" (1/1) ... [2024-10-12 15:15:11,783 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-12 15:15:11,794 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 15:15:11,810 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:15:11,817 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:15:11,862 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-12 15:15:11,863 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-12 15:15:11,864 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-12 15:15:11,864 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-12 15:15:11,932 INFO L238 CfgBuilder]: Building ICFG [2024-10-12 15:15:11,934 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-12 15:15:12,943 INFO L? ?]: Removed 75 outVars from TransFormulas that were not future-live. [2024-10-12 15:15:12,944 INFO L287 CfgBuilder]: Performing block encoding [2024-10-12 15:15:13,011 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-12 15:15:13,011 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-12 15:15:13,012 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.10 03:15:13 BoogieIcfgContainer [2024-10-12 15:15:13,012 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-12 15:15:13,014 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-12 15:15:13,015 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-12 15:15:13,018 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-12 15:15:13,018 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 12.10 03:15:10" (1/3) ... [2024-10-12 15:15:13,019 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3792e15e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.10 03:15:13, skipping insertion in model container [2024-10-12 15:15:13,019 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 03:15:11" (2/3) ... [2024-10-12 15:15:13,020 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3792e15e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.10 03:15:13, skipping insertion in model container [2024-10-12 15:15:13,020 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.10 03:15:13" (3/3) ... [2024-10-12 15:15:13,022 INFO L112 eAbstractionObserver]: Analyzing ICFG Problem01_label11.c [2024-10-12 15:15:13,039 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-12 15:15:13,040 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-12 15:15:13,111 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-12 15:15:13,117 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;@7533eafb, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-12 15:15:13,117 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-12 15:15:13,121 INFO L276 IsEmpty]: Start isEmpty. Operand has 136 states, 134 states have (on average 1.9776119402985075) internal successors, (265), 135 states have internal predecessors, (265), 0 states have call successors, (0), 0 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:15:13,129 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2024-10-12 15:15:13,129 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 15:15:13,130 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] [2024-10-12 15:15:13,131 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 15:15:13,135 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 15:15:13,135 INFO L85 PathProgramCache]: Analyzing trace with hash -1198555533, now seen corresponding path program 1 times [2024-10-12 15:15:13,143 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 15:15:13,143 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1195797298] [2024-10-12 15:15:13,144 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 15:15:13,144 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 15:15:13,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 15:15:13,550 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:15:13,550 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 15:15:13,550 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1195797298] [2024-10-12 15:15:13,552 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1195797298] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 15:15:13,552 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 15:15:13,552 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-12 15:15:13,554 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1498443752] [2024-10-12 15:15:13,554 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 15:15:13,560 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-12 15:15:13,561 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 15:15:13,589 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-12 15:15:13,591 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-12 15:15:13,595 INFO L87 Difference]: Start difference. First operand has 136 states, 134 states have (on average 1.9776119402985075) internal successors, (265), 135 states have internal predecessors, (265), 0 states have call successors, (0), 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 54.0) internal successors, (108), 2 states have internal predecessors, (108), 0 states have call successors, (0), 0 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:15:13,655 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 15:15:13,659 INFO L93 Difference]: Finished difference Result 271 states and 529 transitions. [2024-10-12 15:15:13,660 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-12 15:15:13,662 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 54.0) internal successors, (108), 2 states have internal predecessors, (108), 0 states have call successors, (0), 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 108 [2024-10-12 15:15:13,662 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 15:15:13,672 INFO L225 Difference]: With dead ends: 271 [2024-10-12 15:15:13,673 INFO L226 Difference]: Without dead ends: 134 [2024-10-12 15:15:13,677 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:15:13,683 INFO L432 NwaCegarLoop]: 200 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, 200 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:15:13,684 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 200 Invalid, 2 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 2 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-12 15:15:13,704 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 134 states. [2024-10-12 15:15:13,728 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 134 to 134. [2024-10-12 15:15:13,731 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 134 states, 133 states have (on average 1.5037593984962405) internal successors, (200), 133 states have internal predecessors, (200), 0 states have call successors, (0), 0 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:15:13,733 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 134 states to 134 states and 200 transitions. [2024-10-12 15:15:13,737 INFO L78 Accepts]: Start accepts. Automaton has 134 states and 200 transitions. Word has length 108 [2024-10-12 15:15:13,738 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 15:15:13,738 INFO L471 AbstractCegarLoop]: Abstraction has 134 states and 200 transitions. [2024-10-12 15:15:13,738 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 54.0) internal successors, (108), 2 states have internal predecessors, (108), 0 states have call successors, (0), 0 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:15:13,738 INFO L276 IsEmpty]: Start isEmpty. Operand 134 states and 200 transitions. [2024-10-12 15:15:13,740 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2024-10-12 15:15:13,740 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 15:15:13,740 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] [2024-10-12 15:15:13,740 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-12 15:15:13,740 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 15:15:13,741 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 15:15:13,742 INFO L85 PathProgramCache]: Analyzing trace with hash -1721528346, now seen corresponding path program 1 times [2024-10-12 15:15:13,743 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 15:15:13,743 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1697594247] [2024-10-12 15:15:13,744 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 15:15:13,744 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 15:15:13,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 15:15:14,040 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:15:14,041 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 15:15:14,042 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1697594247] [2024-10-12 15:15:14,042 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1697594247] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 15:15:14,043 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 15:15:14,043 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-12 15:15:14,043 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1128806916] [2024-10-12 15:15:14,044 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 15:15:14,046 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-12 15:15:14,047 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 15:15:14,048 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-12 15:15:14,049 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-12 15:15:14,049 INFO L87 Difference]: Start difference. First operand 134 states and 200 transitions. Second operand has 3 states, 3 states have (on average 36.0) internal successors, (108), 2 states have internal predecessors, (108), 0 states have call successors, (0), 0 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:15:14,603 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 15:15:14,603 INFO L93 Difference]: Finished difference Result 398 states and 597 transitions. [2024-10-12 15:15:14,604 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-12 15:15:14,604 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 36.0) internal successors, (108), 2 states have internal predecessors, (108), 0 states have call successors, (0), 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 108 [2024-10-12 15:15:14,605 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 15:15:14,607 INFO L225 Difference]: With dead ends: 398 [2024-10-12 15:15:14,611 INFO L226 Difference]: Without dead ends: 265 [2024-10-12 15:15:14,612 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:15:14,613 INFO L432 NwaCegarLoop]: 24 mSDtfsCounter, 47 mSDsluCounter, 5 mSDsCounter, 0 mSdLazyCounter, 342 mSolverCounterSat, 46 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 47 SdHoareTripleChecker+Valid, 29 SdHoareTripleChecker+Invalid, 388 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 46 IncrementalHoareTripleChecker+Valid, 342 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-10-12 15:15:14,615 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [47 Valid, 29 Invalid, 388 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [46 Valid, 342 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-10-12 15:15:14,617 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 265 states. [2024-10-12 15:15:14,646 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 265 to 265. [2024-10-12 15:15:14,647 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 265 states, 264 states have (on average 1.4356060606060606) internal successors, (379), 264 states have internal predecessors, (379), 0 states have call successors, (0), 0 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:15:14,648 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 265 states to 265 states and 379 transitions. [2024-10-12 15:15:14,651 INFO L78 Accepts]: Start accepts. Automaton has 265 states and 379 transitions. Word has length 108 [2024-10-12 15:15:14,652 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 15:15:14,652 INFO L471 AbstractCegarLoop]: Abstraction has 265 states and 379 transitions. [2024-10-12 15:15:14,652 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 36.0) internal successors, (108), 2 states have internal predecessors, (108), 0 states have call successors, (0), 0 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:15:14,652 INFO L276 IsEmpty]: Start isEmpty. Operand 265 states and 379 transitions. [2024-10-12 15:15:14,654 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2024-10-12 15:15:14,656 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 15:15:14,656 INFO L215 NwaCegarLoop]: trace histogram [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] [2024-10-12 15:15:14,657 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-12 15:15:14,657 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 15:15:14,658 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 15:15:14,659 INFO L85 PathProgramCache]: Analyzing trace with hash 156945715, now seen corresponding path program 1 times [2024-10-12 15:15:14,660 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 15:15:14,660 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1203361489] [2024-10-12 15:15:14,660 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 15:15:14,660 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 15:15:14,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 15:15:14,797 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 15:15:14,798 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 15:15:14,799 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1203361489] [2024-10-12 15:15:14,800 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1203361489] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 15:15:14,800 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 15:15:14,800 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-12 15:15:14,800 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [493120540] [2024-10-12 15:15:14,801 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 15:15:14,801 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-12 15:15:14,801 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 15:15:14,802 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-12 15:15:14,802 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-12 15:15:14,803 INFO L87 Difference]: Start difference. First operand 265 states and 379 transitions. Second operand has 3 states, 3 states have (on average 38.0) internal successors, (114), 2 states have internal predecessors, (114), 0 states have call successors, (0), 0 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:15:15,262 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 15:15:15,262 INFO L93 Difference]: Finished difference Result 791 states and 1134 transitions. [2024-10-12 15:15:15,263 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-12 15:15:15,263 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 38.0) internal successors, (114), 2 states have internal predecessors, (114), 0 states have call successors, (0), 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 114 [2024-10-12 15:15:15,263 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 15:15:15,266 INFO L225 Difference]: With dead ends: 791 [2024-10-12 15:15:15,267 INFO L226 Difference]: Without dead ends: 527 [2024-10-12 15:15:15,268 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:15:15,269 INFO L432 NwaCegarLoop]: 30 mSDtfsCounter, 142 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 328 mSolverCounterSat, 71 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 142 SdHoareTripleChecker+Valid, 34 SdHoareTripleChecker+Invalid, 399 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 71 IncrementalHoareTripleChecker+Valid, 328 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-10-12 15:15:15,270 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [142 Valid, 34 Invalid, 399 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [71 Valid, 328 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-10-12 15:15:15,271 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 527 states. [2024-10-12 15:15:15,301 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 527 to 527. [2024-10-12 15:15:15,303 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 527 states, 526 states have (on average 1.3460076045627376) internal successors, (708), 526 states have internal predecessors, (708), 0 states have call successors, (0), 0 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:15:15,304 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 527 states to 527 states and 708 transitions. [2024-10-12 15:15:15,305 INFO L78 Accepts]: Start accepts. Automaton has 527 states and 708 transitions. Word has length 114 [2024-10-12 15:15:15,305 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 15:15:15,305 INFO L471 AbstractCegarLoop]: Abstraction has 527 states and 708 transitions. [2024-10-12 15:15:15,306 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 38.0) internal successors, (114), 2 states have internal predecessors, (114), 0 states have call successors, (0), 0 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:15:15,306 INFO L276 IsEmpty]: Start isEmpty. Operand 527 states and 708 transitions. [2024-10-12 15:15:15,308 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2024-10-12 15:15:15,309 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 15:15:15,309 INFO L215 NwaCegarLoop]: trace histogram [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] [2024-10-12 15:15:15,309 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-12 15:15:15,310 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 15:15:15,310 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 15:15:15,311 INFO L85 PathProgramCache]: Analyzing trace with hash -1422492173, now seen corresponding path program 1 times [2024-10-12 15:15:15,311 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 15:15:15,311 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1078790840] [2024-10-12 15:15:15,311 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 15:15:15,312 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 15:15:15,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 15:15:15,727 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 15:15:15,728 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 15:15:15,728 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1078790840] [2024-10-12 15:15:15,728 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1078790840] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 15:15:15,728 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 15:15:15,728 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-12 15:15:15,728 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1248508132] [2024-10-12 15:15:15,728 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 15:15:15,732 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-12 15:15:15,732 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 15:15:15,733 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-12 15:15:15,733 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-10-12 15:15:15,733 INFO L87 Difference]: Start difference. First operand 527 states and 708 transitions. Second operand has 4 states, 4 states have (on average 28.75) internal successors, (115), 3 states have internal predecessors, (115), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 15:15:16,372 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 15:15:16,372 INFO L93 Difference]: Finished difference Result 1410 states and 1881 transitions. [2024-10-12 15:15:16,373 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-12 15:15:16,373 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 28.75) internal successors, (115), 3 states have internal predecessors, (115), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 115 [2024-10-12 15:15:16,373 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 15:15:16,376 INFO L225 Difference]: With dead ends: 1410 [2024-10-12 15:15:16,377 INFO L226 Difference]: Without dead ends: 789 [2024-10-12 15:15:16,380 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:15:16,382 INFO L432 NwaCegarLoop]: 68 mSDtfsCounter, 130 mSDsluCounter, 9 mSDsCounter, 0 mSdLazyCounter, 528 mSolverCounterSat, 106 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 130 SdHoareTripleChecker+Valid, 77 SdHoareTripleChecker+Invalid, 634 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 106 IncrementalHoareTripleChecker+Valid, 528 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-10-12 15:15:16,382 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [130 Valid, 77 Invalid, 634 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [106 Valid, 528 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-10-12 15:15:16,384 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 789 states. [2024-10-12 15:15:16,415 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 789 to 789. [2024-10-12 15:15:16,416 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 789 states, 788 states have (on average 1.1637055837563453) internal successors, (917), 788 states have internal predecessors, (917), 0 states have call successors, (0), 0 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:15:16,419 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 789 states to 789 states and 917 transitions. [2024-10-12 15:15:16,419 INFO L78 Accepts]: Start accepts. Automaton has 789 states and 917 transitions. Word has length 115 [2024-10-12 15:15:16,419 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 15:15:16,420 INFO L471 AbstractCegarLoop]: Abstraction has 789 states and 917 transitions. [2024-10-12 15:15:16,420 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 28.75) internal successors, (115), 3 states have internal predecessors, (115), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 15:15:16,420 INFO L276 IsEmpty]: Start isEmpty. Operand 789 states and 917 transitions. [2024-10-12 15:15:16,422 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2024-10-12 15:15:16,422 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 15:15:16,423 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:15:16,423 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-12 15:15:16,423 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 15:15:16,424 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 15:15:16,424 INFO L85 PathProgramCache]: Analyzing trace with hash 1976948352, now seen corresponding path program 1 times [2024-10-12 15:15:16,424 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 15:15:16,424 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1154936062] [2024-10-12 15:15:16,425 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 15:15:16,425 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 15:15:16,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 15:15:16,613 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-10-12 15:15:16,615 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 15:15:16,616 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1154936062] [2024-10-12 15:15:16,616 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1154936062] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 15:15:16,616 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 15:15:16,616 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-12 15:15:16,616 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1008946493] [2024-10-12 15:15:16,617 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 15:15:16,617 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-12 15:15:16,618 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 15:15:16,619 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-12 15:15:16,619 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-12 15:15:16,620 INFO L87 Difference]: Start difference. First operand 789 states and 917 transitions. Second operand has 3 states, 3 states have (on average 39.333333333333336) internal successors, (118), 2 states have internal predecessors, (118), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 15:15:17,008 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 15:15:17,009 INFO L93 Difference]: Finished difference Result 1577 states and 1858 transitions. [2024-10-12 15:15:17,010 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-12 15:15:17,010 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 39.333333333333336) internal successors, (118), 2 states have internal predecessors, (118), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 120 [2024-10-12 15:15:17,010 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 15:15:17,013 INFO L225 Difference]: With dead ends: 1577 [2024-10-12 15:15:17,014 INFO L226 Difference]: Without dead ends: 920 [2024-10-12 15:15:17,015 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:15:17,016 INFO L432 NwaCegarLoop]: 39 mSDtfsCounter, 129 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 298 mSolverCounterSat, 33 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 129 SdHoareTripleChecker+Valid, 43 SdHoareTripleChecker+Invalid, 331 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 33 IncrementalHoareTripleChecker+Valid, 298 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-10-12 15:15:17,018 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [129 Valid, 43 Invalid, 331 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [33 Valid, 298 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-10-12 15:15:17,020 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 920 states. [2024-10-12 15:15:17,037 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 920 to 920. [2024-10-12 15:15:17,039 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 920 states, 919 states have (on average 1.1534276387377584) internal successors, (1060), 919 states have internal predecessors, (1060), 0 states have call successors, (0), 0 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:15:17,041 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 920 states to 920 states and 1060 transitions. [2024-10-12 15:15:17,042 INFO L78 Accepts]: Start accepts. Automaton has 920 states and 1060 transitions. Word has length 120 [2024-10-12 15:15:17,042 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 15:15:17,043 INFO L471 AbstractCegarLoop]: Abstraction has 920 states and 1060 transitions. [2024-10-12 15:15:17,043 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 39.333333333333336) internal successors, (118), 2 states have internal predecessors, (118), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 15:15:17,044 INFO L276 IsEmpty]: Start isEmpty. Operand 920 states and 1060 transitions. [2024-10-12 15:15:17,047 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2024-10-12 15:15:17,047 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 15:15:17,048 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 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] [2024-10-12 15:15:17,048 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-10-12 15:15:17,048 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 15:15:17,048 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 15:15:17,049 INFO L85 PathProgramCache]: Analyzing trace with hash 1817204514, now seen corresponding path program 1 times [2024-10-12 15:15:17,049 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 15:15:17,050 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1302261785] [2024-10-12 15:15:17,050 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 15:15:17,050 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 15:15:17,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 15:15:17,172 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 26 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2024-10-12 15:15:17,173 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 15:15:17,173 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1302261785] [2024-10-12 15:15:17,173 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1302261785] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 15:15:17,174 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 15:15:17,174 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-12 15:15:17,174 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [482946013] [2024-10-12 15:15:17,174 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 15:15:17,175 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-12 15:15:17,175 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 15:15:17,175 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-12 15:15:17,175 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-12 15:15:17,175 INFO L87 Difference]: Start difference. First operand 920 states and 1060 transitions. Second operand has 3 states, 3 states have (on average 40.666666666666664) internal successors, (122), 3 states have internal predecessors, (122), 0 states have call successors, (0), 0 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:15:17,568 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 15:15:17,568 INFO L93 Difference]: Finished difference Result 2363 states and 2731 transitions. [2024-10-12 15:15:17,568 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-12 15:15:17,569 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 40.666666666666664) internal successors, (122), 3 states have internal predecessors, (122), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 129 [2024-10-12 15:15:17,570 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 15:15:17,579 INFO L225 Difference]: With dead ends: 2363 [2024-10-12 15:15:17,580 INFO L226 Difference]: Without dead ends: 1575 [2024-10-12 15:15:17,582 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:15:17,583 INFO L432 NwaCegarLoop]: 13 mSDtfsCounter, 134 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 315 mSolverCounterSat, 51 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 134 SdHoareTripleChecker+Valid, 17 SdHoareTripleChecker+Invalid, 366 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 51 IncrementalHoareTripleChecker+Valid, 315 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-10-12 15:15:17,584 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [134 Valid, 17 Invalid, 366 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [51 Valid, 315 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-10-12 15:15:17,588 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1575 states. [2024-10-12 15:15:17,609 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1575 to 1182. [2024-10-12 15:15:17,611 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1182 states, 1181 states have (on average 1.1507197290431836) internal successors, (1359), 1181 states have internal predecessors, (1359), 0 states have call successors, (0), 0 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:15:17,614 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1182 states to 1182 states and 1359 transitions. [2024-10-12 15:15:17,615 INFO L78 Accepts]: Start accepts. Automaton has 1182 states and 1359 transitions. Word has length 129 [2024-10-12 15:15:17,615 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 15:15:17,615 INFO L471 AbstractCegarLoop]: Abstraction has 1182 states and 1359 transitions. [2024-10-12 15:15:17,615 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 40.666666666666664) internal successors, (122), 3 states have internal predecessors, (122), 0 states have call successors, (0), 0 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:15:17,616 INFO L276 IsEmpty]: Start isEmpty. Operand 1182 states and 1359 transitions. [2024-10-12 15:15:17,618 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2024-10-12 15:15:17,618 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 15:15:17,618 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 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] [2024-10-12 15:15:17,619 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-10-12 15:15:17,619 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 15:15:17,619 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 15:15:17,619 INFO L85 PathProgramCache]: Analyzing trace with hash -908997231, now seen corresponding path program 1 times [2024-10-12 15:15:17,620 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 15:15:17,620 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [249941612] [2024-10-12 15:15:17,620 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 15:15:17,620 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 15:15:17,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 15:15:17,783 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 37 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-10-12 15:15:17,784 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 15:15:17,784 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [249941612] [2024-10-12 15:15:17,785 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [249941612] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 15:15:17,785 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 15:15:17,785 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-12 15:15:17,785 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2078235354] [2024-10-12 15:15:17,785 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 15:15:17,786 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-12 15:15:17,786 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 15:15:17,786 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-12 15:15:17,787 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-10-12 15:15:17,787 INFO L87 Difference]: Start difference. First operand 1182 states and 1359 transitions. Second operand has 4 states, 4 states have (on average 33.25) internal successors, (133), 3 states have internal predecessors, (133), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 15:15:18,370 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 15:15:18,371 INFO L93 Difference]: Finished difference Result 2494 states and 2924 transitions. [2024-10-12 15:15:18,371 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-12 15:15:18,371 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 33.25) internal successors, (133), 3 states have internal predecessors, (133), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 135 [2024-10-12 15:15:18,371 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 15:15:18,376 INFO L225 Difference]: With dead ends: 2494 [2024-10-12 15:15:18,377 INFO L226 Difference]: Without dead ends: 1444 [2024-10-12 15:15:18,378 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:15:18,379 INFO L432 NwaCegarLoop]: 24 mSDtfsCounter, 261 mSDsluCounter, 8 mSDsCounter, 0 mSdLazyCounter, 458 mSolverCounterSat, 91 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 261 SdHoareTripleChecker+Valid, 32 SdHoareTripleChecker+Invalid, 549 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 91 IncrementalHoareTripleChecker+Valid, 458 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-10-12 15:15:18,379 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [261 Valid, 32 Invalid, 549 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [91 Valid, 458 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-10-12 15:15:18,381 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1444 states. [2024-10-12 15:15:18,402 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1444 to 1444. [2024-10-12 15:15:18,404 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1444 states, 1443 states have (on average 1.1448371448371448) internal successors, (1652), 1443 states have internal predecessors, (1652), 0 states have call successors, (0), 0 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:15:18,408 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1444 states to 1444 states and 1652 transitions. [2024-10-12 15:15:18,409 INFO L78 Accepts]: Start accepts. Automaton has 1444 states and 1652 transitions. Word has length 135 [2024-10-12 15:15:18,409 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 15:15:18,409 INFO L471 AbstractCegarLoop]: Abstraction has 1444 states and 1652 transitions. [2024-10-12 15:15:18,410 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 33.25) internal successors, (133), 3 states have internal predecessors, (133), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 15:15:18,410 INFO L276 IsEmpty]: Start isEmpty. Operand 1444 states and 1652 transitions. [2024-10-12 15:15:18,413 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 150 [2024-10-12 15:15:18,413 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 15:15:18,413 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:15:18,414 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-10-12 15:15:18,414 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 15:15:18,414 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 15:15:18,414 INFO L85 PathProgramCache]: Analyzing trace with hash -1345138540, now seen corresponding path program 1 times [2024-10-12 15:15:18,415 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 15:15:18,415 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [602711570] [2024-10-12 15:15:18,415 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 15:15:18,415 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 15:15:18,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 15:15:18,629 INFO L134 CoverageAnalysis]: Checked inductivity of 54 backedges. 51 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-10-12 15:15:18,629 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 15:15:18,630 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [602711570] [2024-10-12 15:15:18,630 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [602711570] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 15:15:18,630 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 15:15:18,630 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-12 15:15:18,630 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1855186789] [2024-10-12 15:15:18,630 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 15:15:18,631 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-12 15:15:18,631 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 15:15:18,632 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-12 15:15:18,632 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-10-12 15:15:18,632 INFO L87 Difference]: Start difference. First operand 1444 states and 1652 transitions. Second operand has 4 states, 4 states have (on average 36.75) internal successors, (147), 3 states have internal predecessors, (147), 0 states have call successors, (0), 0 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:15:19,236 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 15:15:19,236 INFO L93 Difference]: Finished difference Result 3542 states and 4042 transitions. [2024-10-12 15:15:19,236 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-12 15:15:19,237 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 36.75) internal successors, (147), 3 states have internal predecessors, (147), 0 states have call successors, (0), 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 149 [2024-10-12 15:15:19,237 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 15:15:19,243 INFO L225 Difference]: With dead ends: 3542 [2024-10-12 15:15:19,243 INFO L226 Difference]: Without dead ends: 2230 [2024-10-12 15:15:19,245 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:15:19,246 INFO L432 NwaCegarLoop]: 27 mSDtfsCounter, 255 mSDsluCounter, 8 mSDsCounter, 0 mSdLazyCounter, 581 mSolverCounterSat, 81 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 255 SdHoareTripleChecker+Valid, 35 SdHoareTripleChecker+Invalid, 662 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 81 IncrementalHoareTripleChecker+Valid, 581 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-10-12 15:15:19,246 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [255 Valid, 35 Invalid, 662 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [81 Valid, 581 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-10-12 15:15:19,248 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2230 states. [2024-10-12 15:15:19,277 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2230 to 2230. [2024-10-12 15:15:19,280 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2230 states, 2229 states have (on average 1.1094661283086587) internal successors, (2473), 2229 states have internal predecessors, (2473), 0 states have call successors, (0), 0 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:15:19,284 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2230 states to 2230 states and 2473 transitions. [2024-10-12 15:15:19,284 INFO L78 Accepts]: Start accepts. Automaton has 2230 states and 2473 transitions. Word has length 149 [2024-10-12 15:15:19,285 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 15:15:19,285 INFO L471 AbstractCegarLoop]: Abstraction has 2230 states and 2473 transitions. [2024-10-12 15:15:19,285 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 36.75) internal successors, (147), 3 states have internal predecessors, (147), 0 states have call successors, (0), 0 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:15:19,285 INFO L276 IsEmpty]: Start isEmpty. Operand 2230 states and 2473 transitions. [2024-10-12 15:15:19,289 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 167 [2024-10-12 15:15:19,289 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 15:15:19,289 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:15:19,289 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-10-12 15:15:19,289 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 15:15:19,290 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 15:15:19,290 INFO L85 PathProgramCache]: Analyzing trace with hash 16467761, now seen corresponding path program 1 times [2024-10-12 15:15:19,290 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 15:15:19,290 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1146301055] [2024-10-12 15:15:19,290 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 15:15:19,290 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 15:15:19,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 15:15:19,487 INFO L134 CoverageAnalysis]: Checked inductivity of 71 backedges. 63 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2024-10-12 15:15:19,488 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 15:15:19,488 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1146301055] [2024-10-12 15:15:19,488 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1146301055] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 15:15:19,488 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 15:15:19,488 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-12 15:15:19,488 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1991955144] [2024-10-12 15:15:19,488 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 15:15:19,489 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-12 15:15:19,489 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 15:15:19,490 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-12 15:15:19,490 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-10-12 15:15:19,490 INFO L87 Difference]: Start difference. First operand 2230 states and 2473 transitions. Second operand has 4 states, 4 states have (on average 39.75) internal successors, (159), 3 states have internal predecessors, (159), 0 states have call successors, (0), 0 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:15:20,029 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 15:15:20,029 INFO L93 Difference]: Finished difference Result 4459 states and 4950 transitions. [2024-10-12 15:15:20,031 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-12 15:15:20,031 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 39.75) internal successors, (159), 3 states have internal predecessors, (159), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 166 [2024-10-12 15:15:20,032 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 15:15:20,039 INFO L225 Difference]: With dead ends: 4459 [2024-10-12 15:15:20,039 INFO L226 Difference]: Without dead ends: 2361 [2024-10-12 15:15:20,042 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:15:20,043 INFO L432 NwaCegarLoop]: 23 mSDtfsCounter, 233 mSDsluCounter, 8 mSDsCounter, 0 mSdLazyCounter, 439 mSolverCounterSat, 73 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 233 SdHoareTripleChecker+Valid, 31 SdHoareTripleChecker+Invalid, 512 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 73 IncrementalHoareTripleChecker+Valid, 439 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-10-12 15:15:20,043 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [233 Valid, 31 Invalid, 512 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [73 Valid, 439 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-10-12 15:15:20,045 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2361 states. [2024-10-12 15:15:20,079 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2361 to 2230. [2024-10-12 15:15:20,082 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2230 states, 2229 states have (on average 1.1040825482279049) internal successors, (2461), 2229 states have internal predecessors, (2461), 0 states have call successors, (0), 0 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:15:20,086 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2230 states to 2230 states and 2461 transitions. [2024-10-12 15:15:20,086 INFO L78 Accepts]: Start accepts. Automaton has 2230 states and 2461 transitions. Word has length 166 [2024-10-12 15:15:20,087 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 15:15:20,087 INFO L471 AbstractCegarLoop]: Abstraction has 2230 states and 2461 transitions. [2024-10-12 15:15:20,087 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 39.75) internal successors, (159), 3 states have internal predecessors, (159), 0 states have call successors, (0), 0 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:15:20,087 INFO L276 IsEmpty]: Start isEmpty. Operand 2230 states and 2461 transitions. [2024-10-12 15:15:20,091 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 192 [2024-10-12 15:15:20,091 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 15:15:20,092 INFO L215 NwaCegarLoop]: trace histogram [6, 6, 5, 5, 5, 5, 5, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:15:20,092 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-10-12 15:15:20,093 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 15:15:20,093 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 15:15:20,093 INFO L85 PathProgramCache]: Analyzing trace with hash -437867790, now seen corresponding path program 1 times [2024-10-12 15:15:20,093 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 15:15:20,094 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1728387846] [2024-10-12 15:15:20,094 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 15:15:20,094 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 15:15:20,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 15:15:20,375 INFO L134 CoverageAnalysis]: Checked inductivity of 151 backedges. 62 proven. 0 refuted. 0 times theorem prover too weak. 89 trivial. 0 not checked. [2024-10-12 15:15:20,375 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 15:15:20,376 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1728387846] [2024-10-12 15:15:20,376 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1728387846] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 15:15:20,376 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 15:15:20,377 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-12 15:15:20,377 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [827048408] [2024-10-12 15:15:20,377 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 15:15:20,377 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-12 15:15:20,377 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 15:15:20,378 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-12 15:15:20,378 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-10-12 15:15:20,378 INFO L87 Difference]: Start difference. First operand 2230 states and 2461 transitions. Second operand has 4 states, 4 states have (on average 32.5) internal successors, (130), 3 states have internal predecessors, (130), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 15:15:21,007 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 15:15:21,007 INFO L93 Difference]: Finished difference Result 4590 states and 5115 transitions. [2024-10-12 15:15:21,008 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-12 15:15:21,008 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 32.5) internal successors, (130), 3 states have internal predecessors, (130), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 191 [2024-10-12 15:15:21,008 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 15:15:21,017 INFO L225 Difference]: With dead ends: 4590 [2024-10-12 15:15:21,017 INFO L226 Difference]: Without dead ends: 2492 [2024-10-12 15:15:21,020 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:15:21,021 INFO L432 NwaCegarLoop]: 31 mSDtfsCounter, 252 mSDsluCounter, 13 mSDsCounter, 0 mSdLazyCounter, 630 mSolverCounterSat, 54 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 252 SdHoareTripleChecker+Valid, 44 SdHoareTripleChecker+Invalid, 684 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 54 IncrementalHoareTripleChecker+Valid, 630 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-10-12 15:15:21,022 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [252 Valid, 44 Invalid, 684 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [54 Valid, 630 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-10-12 15:15:21,025 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2492 states. [2024-10-12 15:15:21,062 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2492 to 2361. [2024-10-12 15:15:21,067 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2361 states, 2360 states have (on average 1.1088983050847459) internal successors, (2617), 2360 states have internal predecessors, (2617), 0 states have call successors, (0), 0 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:15:21,071 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2361 states to 2361 states and 2617 transitions. [2024-10-12 15:15:21,072 INFO L78 Accepts]: Start accepts. Automaton has 2361 states and 2617 transitions. Word has length 191 [2024-10-12 15:15:21,072 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 15:15:21,072 INFO L471 AbstractCegarLoop]: Abstraction has 2361 states and 2617 transitions. [2024-10-12 15:15:21,072 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 32.5) internal successors, (130), 3 states have internal predecessors, (130), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 15:15:21,072 INFO L276 IsEmpty]: Start isEmpty. Operand 2361 states and 2617 transitions. [2024-10-12 15:15:21,077 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 210 [2024-10-12 15:15:21,078 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 15:15:21,078 INFO L215 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2024-10-12 15:15:21,078 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-10-12 15:15:21,078 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 15:15:21,079 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 15:15:21,079 INFO L85 PathProgramCache]: Analyzing trace with hash -1886784175, now seen corresponding path program 1 times [2024-10-12 15:15:21,079 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 15:15:21,080 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1507643089] [2024-10-12 15:15:21,080 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 15:15:21,080 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 15:15:21,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 15:15:21,284 INFO L134 CoverageAnalysis]: Checked inductivity of 176 backedges. 151 proven. 0 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2024-10-12 15:15:21,284 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 15:15:21,285 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1507643089] [2024-10-12 15:15:21,285 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1507643089] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 15:15:21,285 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 15:15:21,285 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-12 15:15:21,285 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1753869008] [2024-10-12 15:15:21,285 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 15:15:21,286 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-12 15:15:21,286 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 15:15:21,287 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-12 15:15:21,287 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-12 15:15:21,287 INFO L87 Difference]: Start difference. First operand 2361 states and 2617 transitions. Second operand has 3 states, 3 states have (on average 64.66666666666667) internal successors, (194), 3 states have internal predecessors, (194), 0 states have call successors, (0), 0 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:15:21,671 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 15:15:21,671 INFO L93 Difference]: Finished difference Result 5114 states and 5670 transitions. [2024-10-12 15:15:21,671 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-12 15:15:21,672 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 64.66666666666667) internal successors, (194), 3 states have internal predecessors, (194), 0 states have call successors, (0), 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 209 [2024-10-12 15:15:21,672 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 15:15:21,682 INFO L225 Difference]: With dead ends: 5114 [2024-10-12 15:15:21,682 INFO L226 Difference]: Without dead ends: 2754 [2024-10-12 15:15:21,685 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:15:21,686 INFO L432 NwaCegarLoop]: 172 mSDtfsCounter, 86 mSDsluCounter, 5 mSDsCounter, 0 mSdLazyCounter, 324 mSolverCounterSat, 32 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 86 SdHoareTripleChecker+Valid, 177 SdHoareTripleChecker+Invalid, 356 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 32 IncrementalHoareTripleChecker+Valid, 324 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-12 15:15:21,686 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [86 Valid, 177 Invalid, 356 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [32 Valid, 324 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-12 15:15:21,689 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2754 states. [2024-10-12 15:15:21,723 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2754 to 2623. [2024-10-12 15:15:21,727 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2623 states, 2622 states have (on average 1.1033562166285278) internal successors, (2893), 2622 states have internal predecessors, (2893), 0 states have call successors, (0), 0 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:15:21,731 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2623 states to 2623 states and 2893 transitions. [2024-10-12 15:15:21,732 INFO L78 Accepts]: Start accepts. Automaton has 2623 states and 2893 transitions. Word has length 209 [2024-10-12 15:15:21,732 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 15:15:21,732 INFO L471 AbstractCegarLoop]: Abstraction has 2623 states and 2893 transitions. [2024-10-12 15:15:21,732 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 64.66666666666667) internal successors, (194), 3 states have internal predecessors, (194), 0 states have call successors, (0), 0 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:15:21,733 INFO L276 IsEmpty]: Start isEmpty. Operand 2623 states and 2893 transitions. [2024-10-12 15:15:21,737 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 213 [2024-10-12 15:15:21,737 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 15:15:21,737 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2024-10-12 15:15:21,737 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-10-12 15:15:21,737 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 15:15:21,738 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 15:15:21,738 INFO L85 PathProgramCache]: Analyzing trace with hash -2010342556, now seen corresponding path program 1 times [2024-10-12 15:15:21,738 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 15:15:21,738 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [193637566] [2024-10-12 15:15:21,738 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 15:15:21,739 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 15:15:21,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 15:15:22,282 INFO L134 CoverageAnalysis]: Checked inductivity of 155 backedges. 57 proven. 98 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 15:15:22,282 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 15:15:22,282 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [193637566] [2024-10-12 15:15:22,282 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [193637566] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-12 15:15:22,282 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [873929707] [2024-10-12 15:15:22,282 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 15:15:22,283 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-12 15:15:22,283 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 15:15:22,285 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:15:22,287 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:15:22,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 15:15:22,410 INFO L255 TraceCheckSpWp]: Trace formula consists of 366 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-10-12 15:15:22,421 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-12 15:15:22,790 INFO L134 CoverageAnalysis]: Checked inductivity of 155 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 155 trivial. 0 not checked. [2024-10-12 15:15:22,790 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-12 15:15:22,790 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [873929707] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 15:15:22,790 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-12 15:15:22,790 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [5] total 6 [2024-10-12 15:15:22,791 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1059964382] [2024-10-12 15:15:22,791 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 15:15:22,791 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-12 15:15:22,791 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 15:15:22,792 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-12 15:15:22,792 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-10-12 15:15:22,792 INFO L87 Difference]: Start difference. First operand 2623 states and 2893 transitions. Second operand has 3 states, 3 states have (on average 37.333333333333336) internal successors, (112), 2 states have internal predecessors, (112), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 15:15:23,151 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 15:15:23,151 INFO L93 Difference]: Finished difference Result 4066 states and 4446 transitions. [2024-10-12 15:15:23,151 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-12 15:15:23,152 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 37.333333333333336) internal successors, (112), 2 states have internal predecessors, (112), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 212 [2024-10-12 15:15:23,152 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 15:15:23,163 INFO L225 Difference]: With dead ends: 4066 [2024-10-12 15:15:23,163 INFO L226 Difference]: Without dead ends: 3933 [2024-10-12 15:15:23,164 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 216 GetRequests, 211 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-10-12 15:15:23,165 INFO L432 NwaCegarLoop]: 24 mSDtfsCounter, 44 mSDsluCounter, 5 mSDsCounter, 0 mSdLazyCounter, 318 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 44 SdHoareTripleChecker+Valid, 29 SdHoareTripleChecker+Invalid, 333 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 318 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-12 15:15:23,165 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [44 Valid, 29 Invalid, 333 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 318 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-12 15:15:23,168 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3933 states. [2024-10-12 15:15:23,209 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3933 to 3540. [2024-10-12 15:15:23,213 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3540 states, 3539 states have (on average 1.0938118112461148) internal successors, (3871), 3539 states have internal predecessors, (3871), 0 states have call successors, (0), 0 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:15:23,219 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3540 states to 3540 states and 3871 transitions. [2024-10-12 15:15:23,219 INFO L78 Accepts]: Start accepts. Automaton has 3540 states and 3871 transitions. Word has length 212 [2024-10-12 15:15:23,219 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 15:15:23,220 INFO L471 AbstractCegarLoop]: Abstraction has 3540 states and 3871 transitions. [2024-10-12 15:15:23,220 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 37.333333333333336) internal successors, (112), 2 states have internal predecessors, (112), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 15:15:23,220 INFO L276 IsEmpty]: Start isEmpty. Operand 3540 states and 3871 transitions. [2024-10-12 15:15:23,225 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 245 [2024-10-12 15:15:23,226 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 15:15:23,226 INFO L215 NwaCegarLoop]: trace histogram [6, 6, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2024-10-12 15:15:23,245 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2024-10-12 15:15:23,427 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,SelfDestructingSolverStorable11 [2024-10-12 15:15:23,427 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 15:15:23,428 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 15:15:23,428 INFO L85 PathProgramCache]: Analyzing trace with hash 1966114505, now seen corresponding path program 1 times [2024-10-12 15:15:23,428 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 15:15:23,428 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [270483441] [2024-10-12 15:15:23,428 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 15:15:23,429 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 15:15:23,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 15:15:24,121 INFO L134 CoverageAnalysis]: Checked inductivity of 280 backedges. 194 proven. 38 refuted. 0 times theorem prover too weak. 48 trivial. 0 not checked. [2024-10-12 15:15:24,121 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 15:15:24,121 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [270483441] [2024-10-12 15:15:24,121 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [270483441] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-12 15:15:24,121 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [122307373] [2024-10-12 15:15:24,121 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 15:15:24,121 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-12 15:15:24,122 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 15:15:24,123 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:15:24,125 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:15:24,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 15:15:24,287 INFO L255 TraceCheckSpWp]: Trace formula consists of 452 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-10-12 15:15:24,294 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-12 15:15:24,414 INFO L134 CoverageAnalysis]: Checked inductivity of 280 backedges. 186 proven. 0 refuted. 0 times theorem prover too weak. 94 trivial. 0 not checked. [2024-10-12 15:15:24,415 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-12 15:15:24,415 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [122307373] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 15:15:24,415 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-12 15:15:24,415 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 7 [2024-10-12 15:15:24,416 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2067463532] [2024-10-12 15:15:24,416 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 15:15:24,416 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-12 15:15:24,416 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 15:15:24,417 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-12 15:15:24,417 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-10-12 15:15:24,417 INFO L87 Difference]: Start difference. First operand 3540 states and 3871 transitions. Second operand has 3 states, 3 states have (on average 54.0) internal successors, (162), 3 states have internal predecessors, (162), 0 states have call successors, (0), 0 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:15:24,803 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 15:15:24,803 INFO L93 Difference]: Finished difference Result 7079 states and 7741 transitions. [2024-10-12 15:15:24,804 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-12 15:15:24,804 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 54.0) internal successors, (162), 3 states have internal predecessors, (162), 0 states have call successors, (0), 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 244 [2024-10-12 15:15:24,804 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 15:15:24,816 INFO L225 Difference]: With dead ends: 7079 [2024-10-12 15:15:24,816 INFO L226 Difference]: Without dead ends: 3540 [2024-10-12 15:15:24,821 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 248 GetRequests, 243 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-10-12 15:15:24,822 INFO L432 NwaCegarLoop]: 161 mSDtfsCounter, 96 mSDsluCounter, 5 mSDsCounter, 0 mSdLazyCounter, 304 mSolverCounterSat, 33 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 96 SdHoareTripleChecker+Valid, 166 SdHoareTripleChecker+Invalid, 337 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 33 IncrementalHoareTripleChecker+Valid, 304 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-12 15:15:24,823 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [96 Valid, 166 Invalid, 337 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [33 Valid, 304 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-12 15:15:24,827 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3540 states. [2024-10-12 15:15:24,862 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3540 to 2099. [2024-10-12 15:15:24,865 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2099 states, 2098 states have (on average 1.0919923736892279) internal successors, (2291), 2098 states have internal predecessors, (2291), 0 states have call successors, (0), 0 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:15:24,869 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2099 states to 2099 states and 2291 transitions. [2024-10-12 15:15:24,870 INFO L78 Accepts]: Start accepts. Automaton has 2099 states and 2291 transitions. Word has length 244 [2024-10-12 15:15:24,870 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 15:15:24,870 INFO L471 AbstractCegarLoop]: Abstraction has 2099 states and 2291 transitions. [2024-10-12 15:15:24,871 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 54.0) internal successors, (162), 3 states have internal predecessors, (162), 0 states have call successors, (0), 0 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:15:24,871 INFO L276 IsEmpty]: Start isEmpty. Operand 2099 states and 2291 transitions. [2024-10-12 15:15:24,876 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 254 [2024-10-12 15:15:24,876 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 15:15:24,876 INFO L215 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:15:24,895 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:15:25,080 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,SelfDestructingSolverStorable12 [2024-10-12 15:15:25,081 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 15:15:25,081 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 15:15:25,081 INFO L85 PathProgramCache]: Analyzing trace with hash -2126853217, now seen corresponding path program 1 times [2024-10-12 15:15:25,082 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 15:15:25,082 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1453640388] [2024-10-12 15:15:25,082 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 15:15:25,082 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 15:15:25,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 15:15:25,628 INFO L134 CoverageAnalysis]: Checked inductivity of 275 backedges. 86 proven. 141 refuted. 0 times theorem prover too weak. 48 trivial. 0 not checked. [2024-10-12 15:15:25,628 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 15:15:25,629 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1453640388] [2024-10-12 15:15:25,629 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1453640388] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-12 15:15:25,629 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1694243840] [2024-10-12 15:15:25,629 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 15:15:25,629 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-12 15:15:25,629 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 15:15:25,631 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:15:25,633 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:15:25,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 15:15:25,761 INFO L255 TraceCheckSpWp]: Trace formula consists of 436 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-10-12 15:15:25,766 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-12 15:15:25,893 INFO L134 CoverageAnalysis]: Checked inductivity of 275 backedges. 144 proven. 0 refuted. 0 times theorem prover too weak. 131 trivial. 0 not checked. [2024-10-12 15:15:25,893 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-12 15:15:25,893 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1694243840] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 15:15:25,894 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-12 15:15:25,894 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 6 [2024-10-12 15:15:25,894 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [554433019] [2024-10-12 15:15:25,894 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 15:15:25,897 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-12 15:15:25,897 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 15:15:25,897 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-12 15:15:25,897 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2024-10-12 15:15:25,898 INFO L87 Difference]: Start difference. First operand 2099 states and 2291 transitions. Second operand has 3 states, 3 states have (on average 57.0) internal successors, (171), 3 states have internal predecessors, (171), 0 states have call successors, (0), 0 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:15:26,318 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 15:15:26,318 INFO L93 Difference]: Finished difference Result 4197 states and 4581 transitions. [2024-10-12 15:15:26,318 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-12 15:15:26,319 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 57.0) internal successors, (171), 3 states have internal predecessors, (171), 0 states have call successors, (0), 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 253 [2024-10-12 15:15:26,319 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 15:15:26,325 INFO L225 Difference]: With dead ends: 4197 [2024-10-12 15:15:26,325 INFO L226 Difference]: Without dead ends: 2099 [2024-10-12 15:15:26,328 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 256 GetRequests, 252 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2024-10-12 15:15:26,328 INFO L432 NwaCegarLoop]: 17 mSDtfsCounter, 35 mSDsluCounter, 5 mSDsCounter, 0 mSdLazyCounter, 314 mSolverCounterSat, 41 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 35 SdHoareTripleChecker+Valid, 22 SdHoareTripleChecker+Invalid, 355 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 41 IncrementalHoareTripleChecker+Valid, 314 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-10-12 15:15:26,329 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [35 Valid, 22 Invalid, 355 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [41 Valid, 314 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-10-12 15:15:26,331 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2099 states. [2024-10-12 15:15:26,353 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2099 to 1837. [2024-10-12 15:15:26,355 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1837 states, 1836 states have (on average 1.093681917211329) internal successors, (2008), 1836 states have internal predecessors, (2008), 0 states have call successors, (0), 0 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:15:26,358 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1837 states to 1837 states and 2008 transitions. [2024-10-12 15:15:26,358 INFO L78 Accepts]: Start accepts. Automaton has 1837 states and 2008 transitions. Word has length 253 [2024-10-12 15:15:26,359 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 15:15:26,359 INFO L471 AbstractCegarLoop]: Abstraction has 1837 states and 2008 transitions. [2024-10-12 15:15:26,359 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 57.0) internal successors, (171), 3 states have internal predecessors, (171), 0 states have call successors, (0), 0 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:15:26,359 INFO L276 IsEmpty]: Start isEmpty. Operand 1837 states and 2008 transitions. [2024-10-12 15:15:26,364 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 260 [2024-10-12 15:15:26,364 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 15:15:26,364 INFO L215 NwaCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 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] [2024-10-12 15:15:26,381 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:15:26,568 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-12 15:15:26,569 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 15:15:26,570 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 15:15:26,570 INFO L85 PathProgramCache]: Analyzing trace with hash -1537508359, now seen corresponding path program 1 times [2024-10-12 15:15:26,570 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 15:15:26,570 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [761702610] [2024-10-12 15:15:26,570 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 15:15:26,570 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 15:15:26,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 15:15:26,769 INFO L134 CoverageAnalysis]: Checked inductivity of 312 backedges. 194 proven. 0 refuted. 0 times theorem prover too weak. 118 trivial. 0 not checked. [2024-10-12 15:15:26,769 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 15:15:26,769 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [761702610] [2024-10-12 15:15:26,769 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [761702610] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 15:15:26,770 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 15:15:26,770 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-12 15:15:26,770 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [443794413] [2024-10-12 15:15:26,770 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 15:15:26,770 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-12 15:15:26,770 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 15:15:26,771 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-12 15:15:26,771 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-12 15:15:26,771 INFO L87 Difference]: Start difference. First operand 1837 states and 2008 transitions. Second operand has 3 states, 3 states have (on average 57.333333333333336) internal successors, (172), 3 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:15:27,111 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 15:15:27,111 INFO L93 Difference]: Finished difference Result 4064 states and 4423 transitions. [2024-10-12 15:15:27,112 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-12 15:15:27,112 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 57.333333333333336) internal successors, (172), 3 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 259 [2024-10-12 15:15:27,112 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 15:15:27,113 INFO L225 Difference]: With dead ends: 4064 [2024-10-12 15:15:27,113 INFO L226 Difference]: Without dead ends: 0 [2024-10-12 15:15:27,116 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:15:27,117 INFO L432 NwaCegarLoop]: 162 mSDtfsCounter, 31 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 315 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 31 SdHoareTripleChecker+Valid, 166 SdHoareTripleChecker+Invalid, 333 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 315 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-12 15:15:27,117 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [31 Valid, 166 Invalid, 333 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 315 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-12 15:15:27,117 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2024-10-12 15:15:27,118 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2024-10-12 15:15:27,118 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:15:27,118 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2024-10-12 15:15:27,118 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 259 [2024-10-12 15:15:27,118 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 15:15:27,118 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2024-10-12 15:15:27,119 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 57.333333333333336) internal successors, (172), 3 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:15:27,119 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2024-10-12 15:15:27,119 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2024-10-12 15:15:27,122 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-10-12 15:15:27,122 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-10-12 15:15:27,126 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 15:15:27,128 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2024-10-12 15:15:27,489 INFO L165 ceAbstractionStarter]: Computing trace abstraction results [2024-10-12 15:15:27,521 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 12.10 03:15:27 BoogieIcfgContainer [2024-10-12 15:15:27,523 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-10-12 15:15:27,524 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-10-12 15:15:27,524 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-10-12 15:15:27,524 INFO L274 PluginConnector]: Witness Printer initialized [2024-10-12 15:15:27,524 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.10 03:15:13" (3/4) ... [2024-10-12 15:15:27,526 INFO L139 WitnessPrinter]: Generating witness for correct program [2024-10-12 15:15:27,552 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 12 nodes and edges [2024-10-12 15:15:27,553 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2024-10-12 15:15:27,554 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2024-10-12 15:15:27,555 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2024-10-12 15:15:27,704 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2024-10-12 15:15:27,705 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.yml [2024-10-12 15:15:27,705 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-10-12 15:15:27,706 INFO L158 Benchmark]: Toolchain (without parser) took 16748.80ms. Allocated memory was 167.8MB in the beginning and 461.4MB in the end (delta: 293.6MB). Free memory was 109.1MB in the beginning and 384.1MB in the end (delta: -275.0MB). Peak memory consumption was 18.5MB. Max. memory is 16.1GB. [2024-10-12 15:15:27,706 INFO L158 Benchmark]: CDTParser took 0.21ms. Allocated memory is still 100.7MB. Free memory is still 57.0MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-12 15:15:27,707 INFO L158 Benchmark]: CACSL2BoogieTranslator took 600.16ms. Allocated memory is still 167.8MB. Free memory was 109.1MB in the beginning and 118.7MB in the end (delta: -9.6MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2024-10-12 15:15:27,707 INFO L158 Benchmark]: Boogie Procedure Inliner took 80.05ms. Allocated memory is still 167.8MB. Free memory was 118.7MB in the beginning and 112.4MB in the end (delta: 6.3MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2024-10-12 15:15:27,707 INFO L158 Benchmark]: Boogie Preprocessor took 132.52ms. Allocated memory is still 167.8MB. Free memory was 112.4MB in the beginning and 107.5MB in the end (delta: 4.8MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-10-12 15:15:27,708 INFO L158 Benchmark]: RCFGBuilder took 1237.23ms. Allocated memory was 167.8MB in the beginning and 220.2MB in the end (delta: 52.4MB). Free memory was 107.5MB in the beginning and 136.3MB in the end (delta: -28.7MB). Peak memory consumption was 60.4MB. Max. memory is 16.1GB. [2024-10-12 15:15:27,708 INFO L158 Benchmark]: TraceAbstraction took 14508.73ms. Allocated memory was 220.2MB in the beginning and 461.4MB in the end (delta: 241.2MB). Free memory was 136.3MB in the beginning and 396.6MB in the end (delta: -260.4MB). Peak memory consumption was 180.0MB. Max. memory is 16.1GB. [2024-10-12 15:15:27,708 INFO L158 Benchmark]: Witness Printer took 181.81ms. Allocated memory is still 461.4MB. Free memory was 396.6MB in the beginning and 384.1MB in the end (delta: 12.6MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2024-10-12 15:15:27,710 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.21ms. Allocated memory is still 100.7MB. Free memory is still 57.0MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 600.16ms. Allocated memory is still 167.8MB. Free memory was 109.1MB in the beginning and 118.7MB in the end (delta: -9.6MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 80.05ms. Allocated memory is still 167.8MB. Free memory was 118.7MB in the beginning and 112.4MB in the end (delta: 6.3MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. * Boogie Preprocessor took 132.52ms. Allocated memory is still 167.8MB. Free memory was 112.4MB in the beginning and 107.5MB in the end (delta: 4.8MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * RCFGBuilder took 1237.23ms. Allocated memory was 167.8MB in the beginning and 220.2MB in the end (delta: 52.4MB). Free memory was 107.5MB in the beginning and 136.3MB in the end (delta: -28.7MB). Peak memory consumption was 60.4MB. Max. memory is 16.1GB. * TraceAbstraction took 14508.73ms. Allocated memory was 220.2MB in the beginning and 461.4MB in the end (delta: 241.2MB). Free memory was 136.3MB in the beginning and 396.6MB in the end (delta: -260.4MB). Peak memory consumption was 180.0MB. Max. memory is 16.1GB. * Witness Printer took 181.81ms. Allocated memory is still 461.4MB. Free memory was 396.6MB in the beginning and 384.1MB in the end (delta: 12.6MB). Peak memory consumption was 12.6MB. 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: 513]: 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, 136 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 14.0s, OverallIterations: 15, TraceHistogramMax: 6, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.1s, AutomataDifference: 7.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1875 SdHoareTripleChecker+Valid, 6.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1875 mSDsluCounter, 1102 SdHoareTripleChecker+Invalid, 5.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 87 mSDsCounter, 745 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 5496 IncrementalHoareTripleChecker+Invalid, 6241 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 745 mSolverCounterUnsat, 1015 mSDtfsCounter, 5496 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 752 GetRequests, 722 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=3540occurred in iteration=12, 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: 0.5s AutomataMinimizationTime, 15 MinimizatonAttempts, 2882 StatesRemovedByMinimization, 7 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 4.4s InterpolantComputationTime, 3221 NumberOfCodeBlocks, 3221 NumberOfCodeBlocksAsserted, 18 NumberOfCheckSat, 3203 ConstructedInterpolants, 0 QuantifiedInterpolants, 13787 SizeOfPredicates, 0 NumberOfNonLiveVariables, 1254 ConjunctsInSsa, 6 ConjunctsInUnsatCore, 18 InterpolantComputations, 15 PerfectInterpolantSequences, 2006/2283 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: 593]: Loop Invariant Derived loop invariant: ((((((((((((a7 <= 0) && (a21 == 1)) && (a16 <= 4)) && (a20 == 1)) || (((5 == a16) && (a21 == 1)) && (a20 == 1))) || ((((a20 <= 0) && (a16 == 6)) && (a21 == 1)) && (15 <= a8))) || (((a21 == 1) && (a20 == 1)) && (15 <= a8))) || ((a8 <= 13) && (a20 == 1))) || (((((a7 <= 0) && (a12 == 8)) && (a21 == 1)) && (a17 == 1)) && (a20 == 1))) || ((((a20 <= 0) && (a8 <= 13)) && (a17 == 1)) && (a16 <= 5))) || (((a20 <= 0) && (5 == a16)) && (a21 == 1))) || (((a20 <= 0) && (a21 == 1)) && (a16 <= 4))) RESULT: Ultimate proved your program to be correct! [2024-10-12 15:15:27,745 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE