./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/eca-rers2012/Problem10_label23.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 3289d67d Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/eca-rers2012/Problem10_label23.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 f668bcf95cb3f7c5766f9dcc6b0650136e6fca9e506098f3960957e6cecfca84 --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.fs.icfgbuilder-eval-3289d67-m [2024-11-16 03:47:47,685 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-16 03:47:47,767 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-16 03:47:47,773 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-16 03:47:47,774 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-16 03:47:47,797 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-16 03:47:47,798 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-16 03:47:47,798 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-16 03:47:47,799 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-16 03:47:47,800 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-16 03:47:47,800 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-16 03:47:47,801 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-16 03:47:47,801 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-16 03:47:47,801 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-16 03:47:47,801 INFO L153 SettingsManager]: * Use SBE=true [2024-11-16 03:47:47,803 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-16 03:47:47,803 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-16 03:47:47,803 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-16 03:47:47,803 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-16 03:47:47,804 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-16 03:47:47,804 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-16 03:47:47,806 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-16 03:47:47,806 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-16 03:47:47,806 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-16 03:47:47,807 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-16 03:47:47,807 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-16 03:47:47,807 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-16 03:47:47,807 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-16 03:47:47,807 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2024-11-16 03:47:47,807 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-16 03:47:47,808 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-16 03:47:47,808 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-16 03:47:47,808 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-16 03:47:47,808 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-16 03:47:47,808 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-16 03:47:47,809 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-16 03:47:47,809 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-16 03:47:47,809 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-16 03:47:47,809 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-16 03:47:47,809 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-16 03:47:47,809 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-16 03:47:47,810 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-16 03:47:47,810 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 -> f668bcf95cb3f7c5766f9dcc6b0650136e6fca9e506098f3960957e6cecfca84 [2024-11-16 03:47:48,008 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-16 03:47:48,022 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-16 03:47:48,023 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-16 03:47:48,024 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-16 03:47:48,024 INFO L274 PluginConnector]: CDTParser initialized [2024-11-16 03:47:48,025 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/eca-rers2012/Problem10_label23.c [2024-11-16 03:47:49,340 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-16 03:47:49,525 INFO L384 CDTParser]: Found 1 translation units. [2024-11-16 03:47:49,526 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem10_label23.c [2024-11-16 03:47:49,536 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4cbc50bf7/51e4ea9cdc1f475197b4286bc5fdc107/FLAGac1fd5ab5 [2024-11-16 03:47:49,899 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4cbc50bf7/51e4ea9cdc1f475197b4286bc5fdc107 [2024-11-16 03:47:49,901 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-16 03:47:49,902 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-16 03:47:49,907 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-16 03:47:49,907 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-16 03:47:49,914 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-16 03:47:49,915 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.11 03:47:49" (1/1) ... [2024-11-16 03:47:49,915 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@145f4286 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 03:47:49, skipping insertion in model container [2024-11-16 03:47:49,915 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.11 03:47:49" (1/1) ... [2024-11-16 03:47:49,944 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-16 03:47:50,164 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem10_label23.c[5328,5341] [2024-11-16 03:47:50,270 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-16 03:47:50,281 INFO L200 MainTranslator]: Completed pre-run [2024-11-16 03:47:50,301 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem10_label23.c[5328,5341] [2024-11-16 03:47:50,356 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-16 03:47:50,370 INFO L204 MainTranslator]: Completed translation [2024-11-16 03:47:50,370 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 03:47:50 WrapperNode [2024-11-16 03:47:50,370 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-16 03:47:50,371 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-16 03:47:50,372 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-16 03:47:50,372 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-16 03:47:50,378 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 03:47:50" (1/1) ... [2024-11-16 03:47:50,397 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 03:47:50" (1/1) ... [2024-11-16 03:47:50,450 INFO L138 Inliner]: procedures = 14, calls = 8, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 597 [2024-11-16 03:47:50,451 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-16 03:47:50,452 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-16 03:47:50,452 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-16 03:47:50,452 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-16 03:47:50,463 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 03:47:50" (1/1) ... [2024-11-16 03:47:50,463 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 03:47:50" (1/1) ... [2024-11-16 03:47:50,477 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 03:47:50" (1/1) ... [2024-11-16 03:47:50,513 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-11-16 03:47:50,513 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 03:47:50" (1/1) ... [2024-11-16 03:47:50,513 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 03:47:50" (1/1) ... [2024-11-16 03:47:50,528 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 03:47:50" (1/1) ... [2024-11-16 03:47:50,531 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 03:47:50" (1/1) ... [2024-11-16 03:47:50,535 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 03:47:50" (1/1) ... [2024-11-16 03:47:50,538 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 03:47:50" (1/1) ... [2024-11-16 03:47:50,545 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-16 03:47:50,546 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2024-11-16 03:47:50,546 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2024-11-16 03:47:50,546 INFO L274 PluginConnector]: IcfgBuilder initialized [2024-11-16 03:47:50,547 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 03:47:50" (1/1) ... [2024-11-16 03:47:50,552 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-16 03:47:50,561 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-16 03:47:50,578 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-16 03:47:50,586 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-16 03:47:50,628 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-16 03:47:50,628 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-16 03:47:50,629 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-16 03:47:50,629 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-16 03:47:50,692 INFO L256 CfgBuilder]: Building ICFG [2024-11-16 03:47:50,694 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-16 03:47:51,528 INFO L? ?]: Removed 84 outVars from TransFormulas that were not future-live. [2024-11-16 03:47:51,529 INFO L307 CfgBuilder]: Performing block encoding [2024-11-16 03:47:51,541 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-16 03:47:51,542 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-16 03:47:51,542 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.11 03:47:51 BoogieIcfgContainer [2024-11-16 03:47:51,542 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2024-11-16 03:47:51,544 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-16 03:47:51,544 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-16 03:47:51,546 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-16 03:47:51,547 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 16.11 03:47:49" (1/3) ... [2024-11-16 03:47:51,547 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7bcd90b1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.11 03:47:51, skipping insertion in model container [2024-11-16 03:47:51,547 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 03:47:50" (2/3) ... [2024-11-16 03:47:51,548 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7bcd90b1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.11 03:47:51, skipping insertion in model container [2024-11-16 03:47:51,548 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.11 03:47:51" (3/3) ... [2024-11-16 03:47:51,549 INFO L112 eAbstractionObserver]: Analyzing ICFG Problem10_label23.c [2024-11-16 03:47:51,563 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-16 03:47:51,564 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-16 03:47:51,618 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-16 03:47:51,623 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;@66d2989, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-16 03:47:51,624 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-16 03:47:51,627 INFO L276 IsEmpty]: Start isEmpty. Operand has 209 states, 207 states have (on average 1.6763285024154588) internal successors, (347), 208 states have internal predecessors, (347), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-16 03:47:51,633 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2024-11-16 03:47:51,633 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 03:47:51,634 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] [2024-11-16 03:47:51,634 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 03:47:51,640 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 03:47:51,640 INFO L85 PathProgramCache]: Analyzing trace with hash -1803135940, now seen corresponding path program 1 times [2024-11-16 03:47:51,652 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 03:47:51,652 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1410617712] [2024-11-16 03:47:51,653 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 03:47:51,653 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 03:47:51,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 03:47:52,046 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-16 03:47:52,047 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 03:47:52,047 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1410617712] [2024-11-16 03:47:52,048 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1410617712] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 03:47:52,048 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 03:47:52,048 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-16 03:47:52,049 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [588677251] [2024-11-16 03:47:52,050 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 03:47:52,052 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-16 03:47:52,053 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 03:47:52,067 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-16 03:47:52,068 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-16 03:47:52,070 INFO L87 Difference]: Start difference. First operand has 209 states, 207 states have (on average 1.6763285024154588) internal successors, (347), 208 states have internal predecessors, (347), 0 states have call successors, (0), 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 4 states, 4 states have (on average 12.0) internal successors, (48), 3 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-16 03:47:53,014 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 03:47:53,015 INFO L93 Difference]: Finished difference Result 703 states and 1255 transitions. [2024-11-16 03:47:53,016 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-16 03:47:53,017 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 12.0) internal successors, (48), 3 states have internal predecessors, (48), 0 states have call successors, (0), 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 48 [2024-11-16 03:47:53,017 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 03:47:53,027 INFO L225 Difference]: With dead ends: 703 [2024-11-16 03:47:53,028 INFO L226 Difference]: Without dead ends: 425 [2024-11-16 03:47:53,033 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-16 03:47:53,037 INFO L432 NwaCegarLoop]: 32 mSDtfsCounter, 462 mSDsluCounter, 18 mSDsCounter, 0 mSdLazyCounter, 684 mSolverCounterSat, 287 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 462 SdHoareTripleChecker+Valid, 50 SdHoareTripleChecker+Invalid, 971 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 287 IncrementalHoareTripleChecker+Valid, 684 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2024-11-16 03:47:53,037 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [462 Valid, 50 Invalid, 971 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [287 Valid, 684 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2024-11-16 03:47:53,056 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 425 states. [2024-11-16 03:47:53,088 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 425 to 425. [2024-11-16 03:47:53,089 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 425 states, 424 states have (on average 1.3797169811320755) internal successors, (585), 424 states have internal predecessors, (585), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-16 03:47:53,090 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 425 states to 425 states and 585 transitions. [2024-11-16 03:47:53,094 INFO L78 Accepts]: Start accepts. Automaton has 425 states and 585 transitions. Word has length 48 [2024-11-16 03:47:53,094 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 03:47:53,094 INFO L471 AbstractCegarLoop]: Abstraction has 425 states and 585 transitions. [2024-11-16 03:47:53,095 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 12.0) internal successors, (48), 3 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-16 03:47:53,095 INFO L276 IsEmpty]: Start isEmpty. Operand 425 states and 585 transitions. [2024-11-16 03:47:53,101 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 168 [2024-11-16 03:47:53,101 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 03:47:53,102 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 03:47:53,102 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-16 03:47:53,102 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 03:47:53,103 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 03:47:53,104 INFO L85 PathProgramCache]: Analyzing trace with hash 1576596600, now seen corresponding path program 1 times [2024-11-16 03:47:53,104 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 03:47:53,104 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [176215339] [2024-11-16 03:47:53,104 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 03:47:53,104 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 03:47:53,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 03:47:53,668 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 44 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-16 03:47:53,670 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 03:47:53,670 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [176215339] [2024-11-16 03:47:53,670 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [176215339] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 03:47:53,670 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 03:47:53,670 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-16 03:47:53,670 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1249038282] [2024-11-16 03:47:53,670 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 03:47:53,671 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-16 03:47:53,671 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 03:47:53,672 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-16 03:47:53,673 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-16 03:47:53,673 INFO L87 Difference]: Start difference. First operand 425 states and 585 transitions. Second operand has 4 states, 4 states have (on average 41.75) internal successors, (167), 3 states have internal predecessors, (167), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-16 03:47:54,113 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 03:47:54,114 INFO L93 Difference]: Finished difference Result 708 states and 1018 transitions. [2024-11-16 03:47:54,114 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-16 03:47:54,114 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 41.75) internal successors, (167), 3 states have internal predecessors, (167), 0 states have call successors, (0), 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 167 [2024-11-16 03:47:54,115 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 03:47:54,116 INFO L225 Difference]: With dead ends: 708 [2024-11-16 03:47:54,116 INFO L226 Difference]: Without dead ends: 425 [2024-11-16 03:47:54,117 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-16 03:47:54,118 INFO L432 NwaCegarLoop]: 80 mSDtfsCounter, 87 mSDsluCounter, 13 mSDsCounter, 0 mSdLazyCounter, 567 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 87 SdHoareTripleChecker+Valid, 93 SdHoareTripleChecker+Invalid, 571 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 567 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-16 03:47:54,118 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [87 Valid, 93 Invalid, 571 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 567 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-16 03:47:54,119 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 425 states. [2024-11-16 03:47:54,134 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 425 to 425. [2024-11-16 03:47:54,138 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 425 states, 424 states have (on average 1.3679245283018868) internal successors, (580), 424 states have internal predecessors, (580), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-16 03:47:54,139 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 425 states to 425 states and 580 transitions. [2024-11-16 03:47:54,139 INFO L78 Accepts]: Start accepts. Automaton has 425 states and 580 transitions. Word has length 167 [2024-11-16 03:47:54,140 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 03:47:54,140 INFO L471 AbstractCegarLoop]: Abstraction has 425 states and 580 transitions. [2024-11-16 03:47:54,140 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 41.75) internal successors, (167), 3 states have internal predecessors, (167), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-16 03:47:54,140 INFO L276 IsEmpty]: Start isEmpty. Operand 425 states and 580 transitions. [2024-11-16 03:47:54,144 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 195 [2024-11-16 03:47:54,144 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 03:47:54,144 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 03:47:54,144 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-16 03:47:54,145 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 03:47:54,147 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 03:47:54,147 INFO L85 PathProgramCache]: Analyzing trace with hash 2115676574, now seen corresponding path program 1 times [2024-11-16 03:47:54,148 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 03:47:54,148 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1358303148] [2024-11-16 03:47:54,148 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 03:47:54,148 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 03:47:54,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 03:47:54,620 INFO L134 CoverageAnalysis]: Checked inductivity of 155 backedges. 155 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-16 03:47:54,620 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 03:47:54,621 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1358303148] [2024-11-16 03:47:54,621 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1358303148] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 03:47:54,621 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 03:47:54,624 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-16 03:47:54,624 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [799302088] [2024-11-16 03:47:54,624 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 03:47:54,625 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-16 03:47:54,625 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 03:47:54,625 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-16 03:47:54,626 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-16 03:47:54,626 INFO L87 Difference]: Start difference. First operand 425 states and 580 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-11-16 03:47:55,117 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 03:47:55,117 INFO L93 Difference]: Finished difference Result 848 states and 1228 transitions. [2024-11-16 03:47:55,117 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-16 03:47:55,118 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 194 [2024-11-16 03:47:55,118 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 03:47:55,120 INFO L225 Difference]: With dead ends: 848 [2024-11-16 03:47:55,120 INFO L226 Difference]: Without dead ends: 565 [2024-11-16 03:47:55,120 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-16 03:47:55,121 INFO L432 NwaCegarLoop]: 18 mSDtfsCounter, 88 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 351 mSolverCounterSat, 104 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 88 SdHoareTripleChecker+Valid, 22 SdHoareTripleChecker+Invalid, 455 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 104 IncrementalHoareTripleChecker+Valid, 351 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-16 03:47:55,122 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [88 Valid, 22 Invalid, 455 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [104 Valid, 351 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-16 03:47:55,122 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 565 states. [2024-11-16 03:47:55,130 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 565 to 565. [2024-11-16 03:47:55,130 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 565 states, 564 states have (on average 1.374113475177305) internal successors, (775), 564 states have internal predecessors, (775), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-16 03:47:55,131 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 565 states to 565 states and 775 transitions. [2024-11-16 03:47:55,131 INFO L78 Accepts]: Start accepts. Automaton has 565 states and 775 transitions. Word has length 194 [2024-11-16 03:47:55,132 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 03:47:55,132 INFO L471 AbstractCegarLoop]: Abstraction has 565 states and 775 transitions. [2024-11-16 03:47:55,132 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-11-16 03:47:55,132 INFO L276 IsEmpty]: Start isEmpty. Operand 565 states and 775 transitions. [2024-11-16 03:47:55,134 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 211 [2024-11-16 03:47:55,134 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 03:47:55,134 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 03:47:55,134 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-16 03:47:55,134 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 03:47:55,134 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 03:47:55,135 INFO L85 PathProgramCache]: Analyzing trace with hash 1222483062, now seen corresponding path program 1 times [2024-11-16 03:47:55,135 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 03:47:55,135 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1631333448] [2024-11-16 03:47:55,135 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 03:47:55,135 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 03:47:55,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 03:47:55,272 INFO L134 CoverageAnalysis]: Checked inductivity of 155 backedges. 155 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-16 03:47:55,272 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 03:47:55,272 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1631333448] [2024-11-16 03:47:55,273 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1631333448] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 03:47:55,273 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 03:47:55,273 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-16 03:47:55,273 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2118668773] [2024-11-16 03:47:55,273 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 03:47:55,273 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-16 03:47:55,277 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 03:47:55,278 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-16 03:47:55,278 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-16 03:47:55,278 INFO L87 Difference]: Start difference. First operand 565 states and 775 transitions. Second operand has 3 states, 3 states have (on average 70.0) internal successors, (210), 3 states have internal predecessors, (210), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-16 03:47:56,092 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 03:47:56,092 INFO L93 Difference]: Finished difference Result 1268 states and 1814 transitions. [2024-11-16 03:47:56,093 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-16 03:47:56,093 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 70.0) internal successors, (210), 3 states have internal predecessors, (210), 0 states have call successors, (0), 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 210 [2024-11-16 03:47:56,093 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 03:47:56,095 INFO L225 Difference]: With dead ends: 1268 [2024-11-16 03:47:56,095 INFO L226 Difference]: Without dead ends: 845 [2024-11-16 03:47:56,096 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-11-16 03:47:56,097 INFO L432 NwaCegarLoop]: 213 mSDtfsCounter, 50 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 340 mSolverCounterSat, 75 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 50 SdHoareTripleChecker+Valid, 220 SdHoareTripleChecker+Invalid, 415 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 75 IncrementalHoareTripleChecker+Valid, 340 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-11-16 03:47:56,097 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [50 Valid, 220 Invalid, 415 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [75 Valid, 340 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-11-16 03:47:56,098 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 845 states. [2024-11-16 03:47:56,105 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 845 to 705. [2024-11-16 03:47:56,105 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 705 states, 704 states have (on average 1.3139204545454546) internal successors, (925), 704 states have internal predecessors, (925), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-16 03:47:56,107 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 705 states to 705 states and 925 transitions. [2024-11-16 03:47:56,107 INFO L78 Accepts]: Start accepts. Automaton has 705 states and 925 transitions. Word has length 210 [2024-11-16 03:47:56,107 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 03:47:56,107 INFO L471 AbstractCegarLoop]: Abstraction has 705 states and 925 transitions. [2024-11-16 03:47:56,108 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 70.0) internal successors, (210), 3 states have internal predecessors, (210), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-16 03:47:56,108 INFO L276 IsEmpty]: Start isEmpty. Operand 705 states and 925 transitions. [2024-11-16 03:47:56,109 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 244 [2024-11-16 03:47:56,109 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 03:47:56,110 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2024-11-16 03:47:56,110 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-16 03:47:56,110 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 03:47:56,110 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 03:47:56,110 INFO L85 PathProgramCache]: Analyzing trace with hash -1462366251, now seen corresponding path program 1 times [2024-11-16 03:47:56,110 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 03:47:56,111 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [791754487] [2024-11-16 03:47:56,111 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 03:47:56,111 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 03:47:56,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 03:47:56,535 INFO L134 CoverageAnalysis]: Checked inductivity of 164 backedges. 164 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-16 03:47:56,536 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 03:47:56,536 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [791754487] [2024-11-16 03:47:56,536 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [791754487] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 03:47:56,536 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 03:47:56,536 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-16 03:47:56,536 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [65656756] [2024-11-16 03:47:56,536 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 03:47:56,537 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-16 03:47:56,537 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 03:47:56,537 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-16 03:47:56,538 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2024-11-16 03:47:56,538 INFO L87 Difference]: Start difference. First operand 705 states and 925 transitions. Second operand has 7 states, 7 states have (on average 34.714285714285715) internal successors, (243), 6 states have internal predecessors, (243), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-16 03:47:56,969 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 03:47:56,970 INFO L93 Difference]: Finished difference Result 1324 states and 1759 transitions. [2024-11-16 03:47:56,970 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-16 03:47:56,970 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 34.714285714285715) internal successors, (243), 6 states have internal predecessors, (243), 0 states have call successors, (0), 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 243 [2024-11-16 03:47:56,971 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 03:47:56,972 INFO L225 Difference]: With dead ends: 1324 [2024-11-16 03:47:56,973 INFO L226 Difference]: Without dead ends: 705 [2024-11-16 03:47:56,973 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2024-11-16 03:47:56,974 INFO L432 NwaCegarLoop]: 12 mSDtfsCounter, 143 mSDsluCounter, 22 mSDsCounter, 0 mSdLazyCounter, 736 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 143 SdHoareTripleChecker+Valid, 34 SdHoareTripleChecker+Invalid, 736 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 736 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-16 03:47:56,974 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [143 Valid, 34 Invalid, 736 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 736 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-16 03:47:56,975 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 705 states. [2024-11-16 03:47:56,984 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 705 to 705. [2024-11-16 03:47:56,985 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 705 states, 704 states have (on average 1.3082386363636365) internal successors, (921), 704 states have internal predecessors, (921), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-16 03:47:56,986 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 705 states to 705 states and 921 transitions. [2024-11-16 03:47:56,986 INFO L78 Accepts]: Start accepts. Automaton has 705 states and 921 transitions. Word has length 243 [2024-11-16 03:47:56,987 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 03:47:56,987 INFO L471 AbstractCegarLoop]: Abstraction has 705 states and 921 transitions. [2024-11-16 03:47:56,987 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 34.714285714285715) internal successors, (243), 6 states have internal predecessors, (243), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-16 03:47:56,987 INFO L276 IsEmpty]: Start isEmpty. Operand 705 states and 921 transitions. [2024-11-16 03:47:56,989 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 280 [2024-11-16 03:47:56,990 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 03:47:56,990 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 03:47:56,990 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-16 03:47:56,990 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 03:47:56,991 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 03:47:56,991 INFO L85 PathProgramCache]: Analyzing trace with hash -1076357777, now seen corresponding path program 1 times [2024-11-16 03:47:56,991 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 03:47:56,991 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [70452178] [2024-11-16 03:47:56,991 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 03:47:56,992 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 03:47:57,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 03:47:57,158 INFO L134 CoverageAnalysis]: Checked inductivity of 200 backedges. 200 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-16 03:47:57,158 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 03:47:57,159 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [70452178] [2024-11-16 03:47:57,159 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [70452178] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 03:47:57,159 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 03:47:57,159 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-16 03:47:57,159 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [718157747] [2024-11-16 03:47:57,159 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 03:47:57,160 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-16 03:47:57,160 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 03:47:57,160 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-16 03:47:57,160 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-16 03:47:57,161 INFO L87 Difference]: Start difference. First operand 705 states and 921 transitions. Second operand has 3 states, 3 states have (on average 93.0) internal successors, (279), 3 states have internal predecessors, (279), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-16 03:47:57,493 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 03:47:57,493 INFO L93 Difference]: Finished difference Result 1408 states and 1900 transitions. [2024-11-16 03:47:57,493 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-16 03:47:57,494 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 93.0) internal successors, (279), 3 states have internal predecessors, (279), 0 states have call successors, (0), 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 279 [2024-11-16 03:47:57,494 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 03:47:57,496 INFO L225 Difference]: With dead ends: 1408 [2024-11-16 03:47:57,496 INFO L226 Difference]: Without dead ends: 845 [2024-11-16 03:47:57,497 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-11-16 03:47:57,498 INFO L432 NwaCegarLoop]: 187 mSDtfsCounter, 38 mSDsluCounter, 5 mSDsCounter, 0 mSdLazyCounter, 362 mSolverCounterSat, 48 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 38 SdHoareTripleChecker+Valid, 192 SdHoareTripleChecker+Invalid, 410 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 48 IncrementalHoareTripleChecker+Valid, 362 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-16 03:47:57,499 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [38 Valid, 192 Invalid, 410 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [48 Valid, 362 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-16 03:47:57,500 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 845 states. [2024-11-16 03:47:57,508 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 845 to 845. [2024-11-16 03:47:57,509 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 845 states, 844 states have (on average 1.264218009478673) internal successors, (1067), 844 states have internal predecessors, (1067), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-16 03:47:57,510 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 845 states to 845 states and 1067 transitions. [2024-11-16 03:47:57,512 INFO L78 Accepts]: Start accepts. Automaton has 845 states and 1067 transitions. Word has length 279 [2024-11-16 03:47:57,512 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 03:47:57,512 INFO L471 AbstractCegarLoop]: Abstraction has 845 states and 1067 transitions. [2024-11-16 03:47:57,513 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 93.0) internal successors, (279), 3 states have internal predecessors, (279), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-16 03:47:57,513 INFO L276 IsEmpty]: Start isEmpty. Operand 845 states and 1067 transitions. [2024-11-16 03:47:57,515 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 299 [2024-11-16 03:47:57,515 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 03:47:57,515 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 03:47:57,515 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-16 03:47:57,516 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 03:47:57,516 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 03:47:57,516 INFO L85 PathProgramCache]: Analyzing trace with hash -13909670, now seen corresponding path program 1 times [2024-11-16 03:47:57,516 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 03:47:57,516 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1433078000] [2024-11-16 03:47:57,516 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 03:47:57,517 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 03:47:57,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 03:47:57,667 INFO L134 CoverageAnalysis]: Checked inductivity of 207 backedges. 89 proven. 0 refuted. 0 times theorem prover too weak. 118 trivial. 0 not checked. [2024-11-16 03:47:57,668 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 03:47:57,668 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1433078000] [2024-11-16 03:47:57,668 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1433078000] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 03:47:57,668 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 03:47:57,668 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-16 03:47:57,668 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [448537391] [2024-11-16 03:47:57,668 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 03:47:57,669 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-16 03:47:57,669 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 03:47:57,669 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-16 03:47:57,669 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-16 03:47:57,670 INFO L87 Difference]: Start difference. First operand 845 states and 1067 transitions. Second operand has 3 states, 3 states have (on average 60.333333333333336) internal successors, (181), 2 states have internal predecessors, (181), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-16 03:47:58,018 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 03:47:58,018 INFO L93 Difference]: Finished difference Result 1828 states and 2367 transitions. [2024-11-16 03:47:58,018 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-16 03:47:58,018 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 60.333333333333336) internal successors, (181), 2 states have internal predecessors, (181), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 298 [2024-11-16 03:47:58,019 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 03:47:58,022 INFO L225 Difference]: With dead ends: 1828 [2024-11-16 03:47:58,022 INFO L226 Difference]: Without dead ends: 1125 [2024-11-16 03:47:58,022 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-11-16 03:47:58,023 INFO L432 NwaCegarLoop]: 33 mSDtfsCounter, 47 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 333 mSolverCounterSat, 86 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 47 SdHoareTripleChecker+Valid, 37 SdHoareTripleChecker+Invalid, 419 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 86 IncrementalHoareTripleChecker+Valid, 333 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-16 03:47:58,023 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [47 Valid, 37 Invalid, 419 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [86 Valid, 333 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-16 03:47:58,024 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1125 states. [2024-11-16 03:47:58,033 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1125 to 1125. [2024-11-16 03:47:58,034 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1125 states, 1124 states have (on average 1.206405693950178) internal successors, (1356), 1124 states have internal predecessors, (1356), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-16 03:47:58,036 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1125 states to 1125 states and 1356 transitions. [2024-11-16 03:47:58,036 INFO L78 Accepts]: Start accepts. Automaton has 1125 states and 1356 transitions. Word has length 298 [2024-11-16 03:47:58,036 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 03:47:58,036 INFO L471 AbstractCegarLoop]: Abstraction has 1125 states and 1356 transitions. [2024-11-16 03:47:58,036 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 60.333333333333336) internal successors, (181), 2 states have internal predecessors, (181), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-16 03:47:58,036 INFO L276 IsEmpty]: Start isEmpty. Operand 1125 states and 1356 transitions. [2024-11-16 03:47:58,039 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 324 [2024-11-16 03:47:58,039 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 03:47:58,039 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 03:47:58,039 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-16 03:47:58,040 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 03:47:58,040 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 03:47:58,040 INFO L85 PathProgramCache]: Analyzing trace with hash -1549558588, now seen corresponding path program 1 times [2024-11-16 03:47:58,040 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 03:47:58,040 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1866709740] [2024-11-16 03:47:58,040 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 03:47:58,041 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 03:47:58,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 03:47:58,243 INFO L134 CoverageAnalysis]: Checked inductivity of 374 backedges. 134 proven. 0 refuted. 0 times theorem prover too weak. 240 trivial. 0 not checked. [2024-11-16 03:47:58,243 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 03:47:58,243 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1866709740] [2024-11-16 03:47:58,243 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1866709740] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 03:47:58,243 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 03:47:58,244 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-16 03:47:58,244 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [168238464] [2024-11-16 03:47:58,244 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 03:47:58,244 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-16 03:47:58,244 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 03:47:58,244 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-16 03:47:58,245 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-16 03:47:58,245 INFO L87 Difference]: Start difference. First operand 1125 states and 1356 transitions. Second operand has 3 states, 3 states have (on average 54.333333333333336) internal successors, (163), 3 states have internal predecessors, (163), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-16 03:47:58,620 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 03:47:58,620 INFO L93 Difference]: Finished difference Result 1965 states and 2408 transitions. [2024-11-16 03:47:58,621 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-16 03:47:58,621 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 54.333333333333336) internal successors, (163), 3 states have internal predecessors, (163), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 323 [2024-11-16 03:47:58,621 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 03:47:58,621 INFO L225 Difference]: With dead ends: 1965 [2024-11-16 03:47:58,622 INFO L226 Difference]: Without dead ends: 0 [2024-11-16 03:47:58,623 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-11-16 03:47:58,624 INFO L432 NwaCegarLoop]: 32 mSDtfsCounter, 102 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 374 mSolverCounterSat, 76 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 102 SdHoareTripleChecker+Valid, 36 SdHoareTripleChecker+Invalid, 450 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 76 IncrementalHoareTripleChecker+Valid, 374 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-16 03:47:58,624 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [102 Valid, 36 Invalid, 450 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [76 Valid, 374 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-16 03:47:58,624 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2024-11-16 03:47:58,624 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2024-11-16 03:47:58,624 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-11-16 03:47:58,624 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2024-11-16 03:47:58,625 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 323 [2024-11-16 03:47:58,625 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 03:47:58,625 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2024-11-16 03:47:58,625 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 54.333333333333336) internal successors, (163), 3 states have internal predecessors, (163), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-16 03:47:58,625 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2024-11-16 03:47:58,625 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2024-11-16 03:47:58,627 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-16 03:47:58,627 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-16 03:47:58,629 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 03:47:58,631 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2024-11-16 03:47:58,712 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-16 03:47:58,720 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 16.11 03:47:58 BoogieIcfgContainer [2024-11-16 03:47:58,720 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-16 03:47:58,721 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-16 03:47:58,721 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-16 03:47:58,721 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-16 03:47:58,721 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.11 03:47:51" (3/4) ... [2024-11-16 03:47:58,723 INFO L143 WitnessPrinter]: Generating witness for correct program [2024-11-16 03:47:58,732 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 15 nodes and edges [2024-11-16 03:47:58,732 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2024-11-16 03:47:58,733 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2024-11-16 03:47:58,733 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2024-11-16 03:47:58,863 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2024-11-16 03:47:58,863 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.yml [2024-11-16 03:47:58,864 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-16 03:47:58,864 INFO L158 Benchmark]: Toolchain (without parser) took 8962.38ms. Allocated memory was 130.0MB in the beginning and 385.9MB in the end (delta: 255.9MB). Free memory was 59.2MB in the beginning and 224.7MB in the end (delta: -165.5MB). Peak memory consumption was 91.2MB. Max. memory is 16.1GB. [2024-11-16 03:47:58,864 INFO L158 Benchmark]: CDTParser took 0.16ms. Allocated memory is still 130.0MB. Free memory is still 91.5MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-16 03:47:58,864 INFO L158 Benchmark]: CACSL2BoogieTranslator took 463.62ms. Allocated memory was 130.0MB in the beginning and 220.2MB in the end (delta: 90.2MB). Free memory was 59.1MB in the beginning and 172.3MB in the end (delta: -113.3MB). Peak memory consumption was 17.9MB. Max. memory is 16.1GB. [2024-11-16 03:47:58,865 INFO L158 Benchmark]: Boogie Procedure Inliner took 79.76ms. Allocated memory is still 220.2MB. Free memory was 172.3MB in the beginning and 163.9MB in the end (delta: 8.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2024-11-16 03:47:58,865 INFO L158 Benchmark]: Boogie Preprocessor took 93.53ms. Allocated memory is still 220.2MB. Free memory was 163.9MB in the beginning and 154.5MB in the end (delta: 9.5MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2024-11-16 03:47:58,865 INFO L158 Benchmark]: IcfgBuilder took 996.72ms. Allocated memory is still 220.2MB. Free memory was 154.5MB in the beginning and 132.1MB in the end (delta: 22.4MB). Peak memory consumption was 52.4MB. Max. memory is 16.1GB. [2024-11-16 03:47:58,865 INFO L158 Benchmark]: TraceAbstraction took 7176.56ms. Allocated memory was 220.2MB in the beginning and 385.9MB in the end (delta: 165.7MB). Free memory was 131.0MB in the beginning and 237.3MB in the end (delta: -106.3MB). Peak memory consumption was 60.4MB. Max. memory is 16.1GB. [2024-11-16 03:47:58,865 INFO L158 Benchmark]: Witness Printer took 143.04ms. Allocated memory is still 385.9MB. Free memory was 237.3MB in the beginning and 224.7MB in the end (delta: 12.6MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2024-11-16 03:47:58,866 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.16ms. Allocated memory is still 130.0MB. Free memory is still 91.5MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 463.62ms. Allocated memory was 130.0MB in the beginning and 220.2MB in the end (delta: 90.2MB). Free memory was 59.1MB in the beginning and 172.3MB in the end (delta: -113.3MB). Peak memory consumption was 17.9MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 79.76ms. Allocated memory is still 220.2MB. Free memory was 172.3MB in the beginning and 163.9MB in the end (delta: 8.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Preprocessor took 93.53ms. Allocated memory is still 220.2MB. Free memory was 163.9MB in the beginning and 154.5MB in the end (delta: 9.5MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * IcfgBuilder took 996.72ms. Allocated memory is still 220.2MB. Free memory was 154.5MB in the beginning and 132.1MB in the end (delta: 22.4MB). Peak memory consumption was 52.4MB. Max. memory is 16.1GB. * TraceAbstraction took 7176.56ms. Allocated memory was 220.2MB in the beginning and 385.9MB in the end (delta: 165.7MB). Free memory was 131.0MB in the beginning and 237.3MB in the end (delta: -106.3MB). Peak memory consumption was 60.4MB. Max. memory is 16.1GB. * Witness Printer took 143.04ms. Allocated memory is still 385.9MB. Free memory was 237.3MB in the beginning and 224.7MB 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: 152]: 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, 209 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 7.0s, OverallIterations: 8, TraceHistogramMax: 4, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 4.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1017 SdHoareTripleChecker+Valid, 4.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1017 mSDsluCounter, 684 SdHoareTripleChecker+Invalid, 3.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 77 mSDsCounter, 680 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 3747 IncrementalHoareTripleChecker+Invalid, 4427 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 680 mSolverCounterUnsat, 607 mSDtfsCounter, 3747 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 30 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1125occurred in iteration=7, InterpolantAutomatonStates: 30, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 8 MinimizatonAttempts, 140 StatesRemovedByMinimization, 1 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 2.1s InterpolantComputationTime, 1762 NumberOfCodeBlocks, 1762 NumberOfCodeBlocksAsserted, 8 NumberOfCheckSat, 1754 ConstructedInterpolants, 0 QuantifiedInterpolants, 6092 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 8 InterpolantComputations, 8 PerfectInterpolantSequences, 1299/1299 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: 592]: Location Invariant Derived location invariant: null RESULT: Ultimate proved your program to be correct! [2024-11-16 03:47:58,905 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