./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/eca-rers2012/Problem10_label20.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 023d838f 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_label20.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 d07934010d71201f260b1dca466306b0d1cde5b3f356e835c3486ab281635c25 --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.fs.icfgbuilder-eval-023d838-m [2024-11-09 19:19:53,799 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-09 19:19:53,891 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-09 19:19:53,895 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-09 19:19:53,895 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-09 19:19:53,917 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-09 19:19:53,918 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-09 19:19:53,918 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-09 19:19:53,918 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-09 19:19:53,918 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-09 19:19:53,919 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-09 19:19:53,919 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-09 19:19:53,920 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-09 19:19:53,923 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-09 19:19:53,924 INFO L153 SettingsManager]: * Use SBE=true [2024-11-09 19:19:53,924 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-09 19:19:53,924 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-09 19:19:53,924 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-09 19:19:53,924 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-09 19:19:53,924 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-09 19:19:53,925 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-09 19:19:53,925 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-09 19:19:53,925 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-09 19:19:53,925 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-09 19:19:53,926 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-09 19:19:53,926 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-09 19:19:53,926 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-09 19:19:53,926 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-09 19:19:53,926 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2024-11-09 19:19:53,926 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-09 19:19:53,927 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-09 19:19:53,927 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-09 19:19:53,927 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-09 19:19:53,929 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-09 19:19:53,929 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-09 19:19:53,929 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-09 19:19:53,930 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-09 19:19:53,930 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-09 19:19:53,930 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-09 19:19:53,930 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-09 19:19:53,930 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-09 19:19:53,931 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-09 19:19:53,931 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 -> d07934010d71201f260b1dca466306b0d1cde5b3f356e835c3486ab281635c25 [2024-11-09 19:19:54,126 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-09 19:19:54,142 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-09 19:19:54,144 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-09 19:19:54,145 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-09 19:19:54,145 INFO L274 PluginConnector]: CDTParser initialized [2024-11-09 19:19:54,146 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/eca-rers2012/Problem10_label20.c [2024-11-09 19:19:55,426 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-09 19:19:55,716 INFO L384 CDTParser]: Found 1 translation units. [2024-11-09 19:19:55,716 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem10_label20.c [2024-11-09 19:19:55,738 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7fd6a2ab6/4b54355cb6f1487ab589c8ddd6229a6c/FLAG1c1e407c1 [2024-11-09 19:19:55,767 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7fd6a2ab6/4b54355cb6f1487ab589c8ddd6229a6c [2024-11-09 19:19:55,770 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-09 19:19:55,774 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-09 19:19:55,776 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-09 19:19:55,776 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-09 19:19:55,786 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-09 19:19:55,787 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 07:19:55" (1/1) ... [2024-11-09 19:19:55,788 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@367cf1e0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:19:55, skipping insertion in model container [2024-11-09 19:19:55,788 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 07:19:55" (1/1) ... [2024-11-09 19:19:55,853 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-09 19:19:56,168 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_label20.c[3385,3398] [2024-11-09 19:19:56,393 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-09 19:19:56,408 INFO L200 MainTranslator]: Completed pre-run [2024-11-09 19:19:56,438 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_label20.c[3385,3398] [2024-11-09 19:19:56,521 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-09 19:19:56,583 INFO L204 MainTranslator]: Completed translation [2024-11-09 19:19:56,584 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:19:56 WrapperNode [2024-11-09 19:19:56,584 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-09 19:19:56,585 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-09 19:19:56,589 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-09 19:19:56,589 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-09 19:19:56,598 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:19:56" (1/1) ... [2024-11-09 19:19:56,638 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:19:56" (1/1) ... [2024-11-09 19:19:56,675 INFO L138 Inliner]: procedures = 14, calls = 8, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 597 [2024-11-09 19:19:56,675 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-09 19:19:56,676 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-09 19:19:56,676 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-09 19:19:56,676 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-09 19:19:56,684 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:19:56" (1/1) ... [2024-11-09 19:19:56,684 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:19:56" (1/1) ... [2024-11-09 19:19:56,688 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:19:56" (1/1) ... [2024-11-09 19:19:56,723 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-09 19:19:56,723 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:19:56" (1/1) ... [2024-11-09 19:19:56,725 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:19:56" (1/1) ... [2024-11-09 19:19:56,748 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:19:56" (1/1) ... [2024-11-09 19:19:56,754 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:19:56" (1/1) ... [2024-11-09 19:19:56,758 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:19:56" (1/1) ... [2024-11-09 19:19:56,763 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:19:56" (1/1) ... [2024-11-09 19:19:56,768 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-09 19:19:56,770 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2024-11-09 19:19:56,770 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2024-11-09 19:19:56,770 INFO L274 PluginConnector]: IcfgBuilder initialized [2024-11-09 19:19:56,771 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:19:56" (1/1) ... [2024-11-09 19:19:56,775 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-09 19:19:56,783 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 19:19:56,798 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-09 19:19:56,807 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-09 19:19:56,837 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-09 19:19:56,838 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-09 19:19:56,838 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-09 19:19:56,838 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-09 19:19:56,896 INFO L256 CfgBuilder]: Building ICFG [2024-11-09 19:19:56,897 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-09 19:19:57,831 INFO L? ?]: Removed 158 outVars from TransFormulas that were not future-live. [2024-11-09 19:19:57,831 INFO L307 CfgBuilder]: Performing block encoding [2024-11-09 19:19:57,851 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-09 19:19:57,853 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-09 19:19:57,853 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 09.11 07:19:57 BoogieIcfgContainer [2024-11-09 19:19:57,853 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2024-11-09 19:19:57,855 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-09 19:19:57,855 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-09 19:19:57,857 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-09 19:19:57,857 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.11 07:19:55" (1/3) ... [2024-11-09 19:19:57,858 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@41ec13c6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.11 07:19:57, skipping insertion in model container [2024-11-09 19:19:57,858 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:19:56" (2/3) ... [2024-11-09 19:19:57,859 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@41ec13c6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.11 07:19:57, skipping insertion in model container [2024-11-09 19:19:57,860 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 09.11 07:19:57" (3/3) ... [2024-11-09 19:19:57,860 INFO L112 eAbstractionObserver]: Analyzing ICFG Problem10_label20.c [2024-11-09 19:19:57,873 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-09 19:19:57,873 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-09 19:19:57,949 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-09 19:19:57,954 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;@39c0a9ee, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-09 19:19:57,954 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-09 19:19:57,965 INFO L276 IsEmpty]: Start isEmpty. Operand has 209 states, 207 states have (on average 2.033816425120773) internal successors, (421), 208 states have internal predecessors, (421), 0 states have call successors, (0), 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-09 19:19:57,974 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2024-11-09 19:19:57,974 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 19:19:57,974 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] [2024-11-09 19:19:57,978 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 19:19:57,985 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 19:19:57,985 INFO L85 PathProgramCache]: Analyzing trace with hash 1052791319, now seen corresponding path program 1 times [2024-11-09 19:19:57,996 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 19:19:57,999 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1672057684] [2024-11-09 19:19:57,999 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 19:19:58,000 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 19:19:58,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 19:19:58,259 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-09 19:19:58,260 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 19:19:58,260 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1672057684] [2024-11-09 19:19:58,260 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1672057684] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 19:19:58,260 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 19:19:58,260 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-09 19:19:58,262 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [707813850] [2024-11-09 19:19:58,262 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 19:19:58,267 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 19:19:58,268 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 19:19:58,283 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 19:19:58,283 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 19:19:58,285 INFO L87 Difference]: Start difference. First operand has 209 states, 207 states have (on average 2.033816425120773) internal successors, (421), 208 states have internal predecessors, (421), 0 states have call successors, (0), 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 3 states, 3 states have (on average 10.0) internal successors, (30), 2 states have internal predecessors, (30), 0 states have call successors, (0), 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-09 19:19:59,086 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 19:19:59,087 INFO L93 Difference]: Finished difference Result 558 states and 1194 transitions. [2024-11-09 19:19:59,088 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 19:19:59,089 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 10.0) internal successors, (30), 2 states have internal predecessors, (30), 0 states have call successors, (0), 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 30 [2024-11-09 19:19:59,089 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 19:19:59,097 INFO L225 Difference]: With dead ends: 558 [2024-11-09 19:19:59,097 INFO L226 Difference]: Without dead ends: 285 [2024-11-09 19:19:59,100 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-09 19:19:59,102 INFO L432 NwaCegarLoop]: 71 mSDtfsCounter, 234 mSDsluCounter, 9 mSDsCounter, 0 mSdLazyCounter, 572 mSolverCounterSat, 137 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 234 SdHoareTripleChecker+Valid, 80 SdHoareTripleChecker+Invalid, 709 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 137 IncrementalHoareTripleChecker+Valid, 572 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-11-09 19:19:59,103 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [234 Valid, 80 Invalid, 709 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [137 Valid, 572 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-11-09 19:19:59,117 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 285 states. [2024-11-09 19:19:59,141 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 285 to 285. [2024-11-09 19:19:59,144 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 285 states, 284 states have (on average 2.0528169014084505) internal successors, (583), 284 states have internal predecessors, (583), 0 states have call successors, (0), 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-09 19:19:59,145 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 285 states to 285 states and 583 transitions. [2024-11-09 19:19:59,146 INFO L78 Accepts]: Start accepts. Automaton has 285 states and 583 transitions. Word has length 30 [2024-11-09 19:19:59,146 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 19:19:59,146 INFO L471 AbstractCegarLoop]: Abstraction has 285 states and 583 transitions. [2024-11-09 19:19:59,146 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 10.0) internal successors, (30), 2 states have internal predecessors, (30), 0 states have call successors, (0), 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-09 19:19:59,146 INFO L276 IsEmpty]: Start isEmpty. Operand 285 states and 583 transitions. [2024-11-09 19:19:59,148 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2024-11-09 19:19:59,148 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 19:19:59,148 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-09 19:19:59,149 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-09 19:19:59,149 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 19:19:59,149 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 19:19:59,149 INFO L85 PathProgramCache]: Analyzing trace with hash -2131099513, now seen corresponding path program 1 times [2024-11-09 19:19:59,149 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 19:19:59,150 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [640445774] [2024-11-09 19:19:59,150 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 19:19:59,150 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 19:19:59,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 19:19:59,305 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 26 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 19:19:59,305 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 19:19:59,305 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [640445774] [2024-11-09 19:19:59,305 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [640445774] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 19:19:59,305 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 19:19:59,305 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-09 19:19:59,305 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [840731718] [2024-11-09 19:19:59,305 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 19:19:59,306 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 19:19:59,306 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 19:19:59,307 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 19:19:59,307 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 19:19:59,307 INFO L87 Difference]: Start difference. First operand 285 states and 583 transitions. Second operand has 3 states, 3 states have (on average 33.333333333333336) internal successors, (100), 2 states have internal predecessors, (100), 0 states have call successors, (0), 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-09 19:19:59,818 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 19:19:59,819 INFO L93 Difference]: Finished difference Result 708 states and 1453 transitions. [2024-11-09 19:19:59,819 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 19:19:59,819 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 33.333333333333336) internal successors, (100), 2 states have internal predecessors, (100), 0 states have call successors, (0), 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 100 [2024-11-09 19:19:59,820 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 19:19:59,822 INFO L225 Difference]: With dead ends: 708 [2024-11-09 19:19:59,822 INFO L226 Difference]: Without dead ends: 425 [2024-11-09 19:19:59,823 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-09 19:19:59,823 INFO L432 NwaCegarLoop]: 33 mSDtfsCounter, 184 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 482 mSolverCounterSat, 98 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 184 SdHoareTripleChecker+Valid, 37 SdHoareTripleChecker+Invalid, 580 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 98 IncrementalHoareTripleChecker+Valid, 482 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-09 19:19:59,824 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [184 Valid, 37 Invalid, 580 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [98 Valid, 482 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-09 19:19:59,825 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 425 states. [2024-11-09 19:19:59,838 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 425 to 425. [2024-11-09 19:19:59,839 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 425 states, 424 states have (on average 1.9386792452830188) internal successors, (822), 424 states have internal predecessors, (822), 0 states have call successors, (0), 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-09 19:19:59,840 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 425 states to 425 states and 822 transitions. [2024-11-09 19:19:59,840 INFO L78 Accepts]: Start accepts. Automaton has 425 states and 822 transitions. Word has length 100 [2024-11-09 19:19:59,840 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 19:19:59,840 INFO L471 AbstractCegarLoop]: Abstraction has 425 states and 822 transitions. [2024-11-09 19:19:59,840 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 33.333333333333336) internal successors, (100), 2 states have internal predecessors, (100), 0 states have call successors, (0), 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-09 19:19:59,841 INFO L276 IsEmpty]: Start isEmpty. Operand 425 states and 822 transitions. [2024-11-09 19:19:59,842 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2024-11-09 19:19:59,843 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 19:19:59,843 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-09 19:19:59,843 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-09 19:19:59,843 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 19:19:59,843 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 19:19:59,844 INFO L85 PathProgramCache]: Analyzing trace with hash -990495819, now seen corresponding path program 1 times [2024-11-09 19:19:59,844 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 19:19:59,844 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1534716781] [2024-11-09 19:19:59,844 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 19:19:59,844 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 19:19:59,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 19:20:00,004 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 26 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 19:20:00,004 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 19:20:00,004 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1534716781] [2024-11-09 19:20:00,005 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1534716781] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 19:20:00,005 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 19:20:00,005 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-09 19:20:00,005 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1026868172] [2024-11-09 19:20:00,005 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 19:20:00,005 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 19:20:00,005 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 19:20:00,006 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 19:20:00,006 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 19:20:00,006 INFO L87 Difference]: Start difference. First operand 425 states and 822 transitions. Second operand has 3 states, 3 states have (on average 35.333333333333336) internal successors, (106), 3 states have internal predecessors, (106), 0 states have call successors, (0), 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-09 19:20:00,615 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 19:20:00,616 INFO L93 Difference]: Finished difference Result 568 states and 1089 transitions. [2024-11-09 19:20:00,616 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 19:20:00,616 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 35.333333333333336) internal successors, (106), 3 states have internal predecessors, (106), 0 states have call successors, (0), 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 106 [2024-11-09 19:20:00,617 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 19:20:00,619 INFO L225 Difference]: With dead ends: 568 [2024-11-09 19:20:00,619 INFO L226 Difference]: Without dead ends: 565 [2024-11-09 19:20:00,619 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-09 19:20:00,620 INFO L432 NwaCegarLoop]: 9 mSDtfsCounter, 230 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 503 mSolverCounterSat, 73 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 230 SdHoareTripleChecker+Valid, 15 SdHoareTripleChecker+Invalid, 576 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 73 IncrementalHoareTripleChecker+Valid, 503 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-09 19:20:00,621 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [230 Valid, 15 Invalid, 576 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [73 Valid, 503 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-11-09 19:20:00,622 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 565 states. [2024-11-09 19:20:00,635 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 565 to 425. [2024-11-09 19:20:00,636 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 425 states, 424 states have (on average 1.9386792452830188) internal successors, (822), 424 states have internal predecessors, (822), 0 states have call successors, (0), 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-09 19:20:00,637 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 425 states to 425 states and 822 transitions. [2024-11-09 19:20:00,637 INFO L78 Accepts]: Start accepts. Automaton has 425 states and 822 transitions. Word has length 106 [2024-11-09 19:20:00,641 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 19:20:00,641 INFO L471 AbstractCegarLoop]: Abstraction has 425 states and 822 transitions. [2024-11-09 19:20:00,642 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 35.333333333333336) internal successors, (106), 3 states have internal predecessors, (106), 0 states have call successors, (0), 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-09 19:20:00,642 INFO L276 IsEmpty]: Start isEmpty. Operand 425 states and 822 transitions. [2024-11-09 19:20:00,643 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2024-11-09 19:20:00,643 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 19:20:00,644 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-09 19:20:00,644 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-09 19:20:00,644 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 19:20:00,644 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 19:20:00,644 INFO L85 PathProgramCache]: Analyzing trace with hash 2005205787, now seen corresponding path program 1 times [2024-11-09 19:20:00,645 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 19:20:00,645 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1223619508] [2024-11-09 19:20:00,645 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 19:20:00,649 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 19:20:00,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 19:20:00,825 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 26 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 19:20:00,825 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 19:20:00,826 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1223619508] [2024-11-09 19:20:00,826 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1223619508] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 19:20:00,826 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 19:20:00,826 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-09 19:20:00,826 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1062222440] [2024-11-09 19:20:00,826 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 19:20:00,827 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 19:20:00,827 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 19:20:00,827 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 19:20:00,828 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 19:20:00,828 INFO L87 Difference]: Start difference. First operand 425 states and 822 transitions. Second operand has 3 states, 3 states have (on average 36.333333333333336) internal successors, (109), 2 states have internal predecessors, (109), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 19:20:01,343 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 19:20:01,343 INFO L93 Difference]: Finished difference Result 1271 states and 2462 transitions. [2024-11-09 19:20:01,343 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 19:20:01,344 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 36.333333333333336) internal successors, (109), 2 states have internal predecessors, (109), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 109 [2024-11-09 19:20:01,344 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 19:20:01,347 INFO L225 Difference]: With dead ends: 1271 [2024-11-09 19:20:01,347 INFO L226 Difference]: Without dead ends: 848 [2024-11-09 19:20:01,348 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-09 19:20:01,349 INFO L432 NwaCegarLoop]: 31 mSDtfsCounter, 141 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 525 mSolverCounterSat, 71 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 141 SdHoareTripleChecker+Valid, 37 SdHoareTripleChecker+Invalid, 596 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 71 IncrementalHoareTripleChecker+Valid, 525 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-09 19:20:01,349 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [141 Valid, 37 Invalid, 596 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [71 Valid, 525 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-09 19:20:01,350 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 848 states. [2024-11-09 19:20:01,361 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 848 to 845. [2024-11-09 19:20:01,362 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 845 states, 844 states have (on average 1.8957345971563981) internal successors, (1600), 844 states have internal predecessors, (1600), 0 states have call successors, (0), 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-09 19:20:01,364 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 845 states to 845 states and 1600 transitions. [2024-11-09 19:20:01,364 INFO L78 Accepts]: Start accepts. Automaton has 845 states and 1600 transitions. Word has length 109 [2024-11-09 19:20:01,364 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 19:20:01,365 INFO L471 AbstractCegarLoop]: Abstraction has 845 states and 1600 transitions. [2024-11-09 19:20:01,365 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 36.333333333333336) internal successors, (109), 2 states have internal predecessors, (109), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 19:20:01,365 INFO L276 IsEmpty]: Start isEmpty. Operand 845 states and 1600 transitions. [2024-11-09 19:20:01,366 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2024-11-09 19:20:01,366 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 19:20:01,366 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-09 19:20:01,366 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-09 19:20:01,367 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 19:20:01,367 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 19:20:01,367 INFO L85 PathProgramCache]: Analyzing trace with hash -1222647061, now seen corresponding path program 1 times [2024-11-09 19:20:01,367 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 19:20:01,367 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [738001691] [2024-11-09 19:20:01,367 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 19:20:01,368 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 19:20:01,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 19:20:01,498 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 26 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 19:20:01,501 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 19:20:01,501 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [738001691] [2024-11-09 19:20:01,501 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [738001691] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 19:20:01,501 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 19:20:01,502 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-09 19:20:01,502 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [699076347] [2024-11-09 19:20:01,502 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 19:20:01,502 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 19:20:01,502 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 19:20:01,503 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 19:20:01,503 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 19:20:01,503 INFO L87 Difference]: Start difference. First operand 845 states and 1600 transitions. Second operand has 3 states, 3 states have (on average 41.666666666666664) internal successors, (125), 2 states have internal predecessors, (125), 0 states have call successors, (0), 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-09 19:20:01,983 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 19:20:01,983 INFO L93 Difference]: Finished difference Result 2388 states and 4529 transitions. [2024-11-09 19:20:01,983 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 19:20:01,984 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 41.666666666666664) internal successors, (125), 2 states have internal predecessors, (125), 0 states have call successors, (0), 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 125 [2024-11-09 19:20:01,984 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 19:20:01,988 INFO L225 Difference]: With dead ends: 2388 [2024-11-09 19:20:01,988 INFO L226 Difference]: Without dead ends: 1545 [2024-11-09 19:20:01,989 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-09 19:20:01,990 INFO L432 NwaCegarLoop]: 65 mSDtfsCounter, 127 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 502 mSolverCounterSat, 70 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 127 SdHoareTripleChecker+Valid, 69 SdHoareTripleChecker+Invalid, 572 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 70 IncrementalHoareTripleChecker+Valid, 502 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-09 19:20:01,991 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [127 Valid, 69 Invalid, 572 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [70 Valid, 502 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-09 19:20:01,992 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1545 states. [2024-11-09 19:20:02,005 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1545 to 1405. [2024-11-09 19:20:02,007 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1405 states, 1404 states have (on average 1.7927350427350428) internal successors, (2517), 1404 states have internal predecessors, (2517), 0 states have call successors, (0), 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-09 19:20:02,010 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1405 states to 1405 states and 2517 transitions. [2024-11-09 19:20:02,010 INFO L78 Accepts]: Start accepts. Automaton has 1405 states and 2517 transitions. Word has length 125 [2024-11-09 19:20:02,010 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 19:20:02,010 INFO L471 AbstractCegarLoop]: Abstraction has 1405 states and 2517 transitions. [2024-11-09 19:20:02,010 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 41.666666666666664) internal successors, (125), 2 states have internal predecessors, (125), 0 states have call successors, (0), 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-09 19:20:02,011 INFO L276 IsEmpty]: Start isEmpty. Operand 1405 states and 2517 transitions. [2024-11-09 19:20:02,012 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 186 [2024-11-09 19:20:02,012 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 19:20:02,012 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2024-11-09 19:20:02,012 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-09 19:20:02,013 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 19:20:02,013 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 19:20:02,013 INFO L85 PathProgramCache]: Analyzing trace with hash -861873731, now seen corresponding path program 1 times [2024-11-09 19:20:02,013 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 19:20:02,013 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [759422996] [2024-11-09 19:20:02,013 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 19:20:02,014 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 19:20:02,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 19:20:02,356 INFO L134 CoverageAnalysis]: Checked inductivity of 128 backedges. 128 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 19:20:02,356 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 19:20:02,358 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [759422996] [2024-11-09 19:20:02,358 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [759422996] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 19:20:02,358 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 19:20:02,358 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-09 19:20:02,358 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [339026470] [2024-11-09 19:20:02,359 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 19:20:02,359 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-09 19:20:02,359 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 19:20:02,360 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-09 19:20:02,360 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2024-11-09 19:20:02,360 INFO L87 Difference]: Start difference. First operand 1405 states and 2517 transitions. Second operand has 7 states, 7 states have (on average 26.428571428571427) internal successors, (185), 6 states have internal predecessors, (185), 0 states have call successors, (0), 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-09 19:20:02,802 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 19:20:02,802 INFO L93 Difference]: Finished difference Result 2864 states and 5088 transitions. [2024-11-09 19:20:02,802 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-09 19:20:02,803 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 26.428571428571427) internal successors, (185), 6 states have internal predecessors, (185), 0 states have call successors, (0), 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 185 [2024-11-09 19:20:02,803 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 19:20:02,807 INFO L225 Difference]: With dead ends: 2864 [2024-11-09 19:20:02,807 INFO L226 Difference]: Without dead ends: 1405 [2024-11-09 19:20:02,808 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2024-11-09 19:20:02,809 INFO L432 NwaCegarLoop]: 12 mSDtfsCounter, 217 mSDsluCounter, 11 mSDsCounter, 0 mSdLazyCounter, 656 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 217 SdHoareTripleChecker+Valid, 23 SdHoareTripleChecker+Invalid, 656 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 656 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-09 19:20:02,809 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [217 Valid, 23 Invalid, 656 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 656 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-09 19:20:02,810 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1405 states. [2024-11-09 19:20:02,823 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1405 to 1405. [2024-11-09 19:20:02,824 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1405 states, 1404 states have (on average 1.7856125356125356) internal successors, (2507), 1404 states have internal predecessors, (2507), 0 states have call successors, (0), 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-09 19:20:02,827 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1405 states to 1405 states and 2507 transitions. [2024-11-09 19:20:02,827 INFO L78 Accepts]: Start accepts. Automaton has 1405 states and 2507 transitions. Word has length 185 [2024-11-09 19:20:02,827 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 19:20:02,827 INFO L471 AbstractCegarLoop]: Abstraction has 1405 states and 2507 transitions. [2024-11-09 19:20:02,827 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 26.428571428571427) internal successors, (185), 6 states have internal predecessors, (185), 0 states have call successors, (0), 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-09 19:20:02,827 INFO L276 IsEmpty]: Start isEmpty. Operand 1405 states and 2507 transitions. [2024-11-09 19:20:02,829 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 193 [2024-11-09 19:20:02,829 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 19:20:02,829 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 19:20:02,829 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-09 19:20:02,829 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 19:20:02,829 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 19:20:02,830 INFO L85 PathProgramCache]: Analyzing trace with hash 323601603, now seen corresponding path program 1 times [2024-11-09 19:20:02,830 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 19:20:02,830 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2013738000] [2024-11-09 19:20:02,830 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 19:20:02,830 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 19:20:02,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 19:20:02,948 INFO L134 CoverageAnalysis]: Checked inductivity of 119 backedges. 119 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 19:20:02,948 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 19:20:02,948 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2013738000] [2024-11-09 19:20:02,949 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2013738000] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 19:20:02,949 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 19:20:02,949 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-09 19:20:02,949 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1380837710] [2024-11-09 19:20:02,949 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 19:20:02,949 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 19:20:02,949 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 19:20:02,950 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 19:20:02,950 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 19:20:02,950 INFO L87 Difference]: Start difference. First operand 1405 states and 2507 transitions. Second operand has 3 states, 3 states have (on average 64.0) internal successors, (192), 3 states have internal predecessors, (192), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 19:20:03,399 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 19:20:03,399 INFO L93 Difference]: Finished difference Result 3368 states and 6046 transitions. [2024-11-09 19:20:03,400 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 19:20:03,400 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 64.0) internal successors, (192), 3 states have internal predecessors, (192), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 192 [2024-11-09 19:20:03,400 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 19:20:03,405 INFO L225 Difference]: With dead ends: 3368 [2024-11-09 19:20:03,405 INFO L226 Difference]: Without dead ends: 1965 [2024-11-09 19:20:03,406 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 19:20:03,407 INFO L432 NwaCegarLoop]: 286 mSDtfsCounter, 124 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 487 mSolverCounterSat, 59 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 124 SdHoareTripleChecker+Valid, 293 SdHoareTripleChecker+Invalid, 546 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 59 IncrementalHoareTripleChecker+Valid, 487 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-09 19:20:03,407 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [124 Valid, 293 Invalid, 546 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [59 Valid, 487 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-09 19:20:03,408 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1965 states. [2024-11-09 19:20:03,423 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1965 to 1405. [2024-11-09 19:20:03,424 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1405 states, 1404 states have (on average 1.7792022792022792) internal successors, (2498), 1404 states have internal predecessors, (2498), 0 states have call successors, (0), 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-09 19:20:03,427 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1405 states to 1405 states and 2498 transitions. [2024-11-09 19:20:03,427 INFO L78 Accepts]: Start accepts. Automaton has 1405 states and 2498 transitions. Word has length 192 [2024-11-09 19:20:03,427 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 19:20:03,427 INFO L471 AbstractCegarLoop]: Abstraction has 1405 states and 2498 transitions. [2024-11-09 19:20:03,427 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 64.0) internal successors, (192), 3 states have internal predecessors, (192), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 19:20:03,427 INFO L276 IsEmpty]: Start isEmpty. Operand 1405 states and 2498 transitions. [2024-11-09 19:20:03,429 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 203 [2024-11-09 19:20:03,429 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 19:20:03,429 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2024-11-09 19:20:03,429 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-09 19:20:03,429 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 19:20:03,430 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 19:20:03,430 INFO L85 PathProgramCache]: Analyzing trace with hash -341462271, now seen corresponding path program 1 times [2024-11-09 19:20:03,430 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 19:20:03,430 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1446872814] [2024-11-09 19:20:03,430 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 19:20:03,430 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 19:20:03,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 19:20:03,599 INFO L134 CoverageAnalysis]: Checked inductivity of 131 backedges. 104 proven. 0 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2024-11-09 19:20:03,599 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 19:20:03,600 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1446872814] [2024-11-09 19:20:03,600 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1446872814] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 19:20:03,600 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 19:20:03,600 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-09 19:20:03,600 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1296744409] [2024-11-09 19:20:03,600 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 19:20:03,600 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 19:20:03,601 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 19:20:03,601 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 19:20:03,601 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 19:20:03,601 INFO L87 Difference]: Start difference. First operand 1405 states and 2498 transitions. Second operand has 3 states, 3 states have (on average 58.666666666666664) internal successors, (176), 2 states have internal predecessors, (176), 0 states have call successors, (0), 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-09 19:20:04,028 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 19:20:04,028 INFO L93 Difference]: Finished difference Result 2948 states and 5217 transitions. [2024-11-09 19:20:04,028 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 19:20:04,028 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 58.666666666666664) internal successors, (176), 2 states have internal predecessors, (176), 0 states have call successors, (0), 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 202 [2024-11-09 19:20:04,029 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 19:20:04,033 INFO L225 Difference]: With dead ends: 2948 [2024-11-09 19:20:04,033 INFO L226 Difference]: Without dead ends: 1545 [2024-11-09 19:20:04,034 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-09 19:20:04,034 INFO L432 NwaCegarLoop]: 80 mSDtfsCounter, 123 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 499 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 123 SdHoareTripleChecker+Valid, 86 SdHoareTripleChecker+Invalid, 503 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 499 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-09 19:20:04,035 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [123 Valid, 86 Invalid, 503 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 499 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-09 19:20:04,036 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1545 states. [2024-11-09 19:20:04,049 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1545 to 1545. [2024-11-09 19:20:04,051 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1545 states, 1544 states have (on average 1.7590673575129534) internal successors, (2716), 1544 states have internal predecessors, (2716), 0 states have call successors, (0), 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-09 19:20:04,053 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1545 states to 1545 states and 2716 transitions. [2024-11-09 19:20:04,053 INFO L78 Accepts]: Start accepts. Automaton has 1545 states and 2716 transitions. Word has length 202 [2024-11-09 19:20:04,053 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 19:20:04,053 INFO L471 AbstractCegarLoop]: Abstraction has 1545 states and 2716 transitions. [2024-11-09 19:20:04,054 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 58.666666666666664) internal successors, (176), 2 states have internal predecessors, (176), 0 states have call successors, (0), 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-09 19:20:04,054 INFO L276 IsEmpty]: Start isEmpty. Operand 1545 states and 2716 transitions. [2024-11-09 19:20:04,055 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 222 [2024-11-09 19:20:04,055 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 19:20:04,055 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2024-11-09 19:20:04,055 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-09 19:20:04,056 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 19:20:04,056 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 19:20:04,056 INFO L85 PathProgramCache]: Analyzing trace with hash 1547740201, now seen corresponding path program 1 times [2024-11-09 19:20:04,056 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 19:20:04,056 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1987243162] [2024-11-09 19:20:04,056 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 19:20:04,056 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 19:20:04,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 19:20:04,221 INFO L134 CoverageAnalysis]: Checked inductivity of 131 backedges. 131 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 19:20:04,221 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 19:20:04,221 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1987243162] [2024-11-09 19:20:04,221 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1987243162] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 19:20:04,222 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 19:20:04,222 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-09 19:20:04,222 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1016867622] [2024-11-09 19:20:04,222 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 19:20:04,222 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 19:20:04,222 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 19:20:04,223 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 19:20:04,223 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 19:20:04,223 INFO L87 Difference]: Start difference. First operand 1545 states and 2716 transitions. Second operand has 3 states, 3 states have (on average 73.66666666666667) internal successors, (221), 3 states have internal predecessors, (221), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 19:20:04,678 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 19:20:04,678 INFO L93 Difference]: Finished difference Result 3368 states and 5992 transitions. [2024-11-09 19:20:04,679 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 19:20:04,679 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 73.66666666666667) internal successors, (221), 3 states have internal predecessors, (221), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 221 [2024-11-09 19:20:04,679 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 19:20:04,684 INFO L225 Difference]: With dead ends: 3368 [2024-11-09 19:20:04,684 INFO L226 Difference]: Without dead ends: 1965 [2024-11-09 19:20:04,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-11-09 19:20:04,686 INFO L432 NwaCegarLoop]: 262 mSDtfsCounter, 149 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 510 mSolverCounterSat, 52 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 149 SdHoareTripleChecker+Valid, 269 SdHoareTripleChecker+Invalid, 562 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 52 IncrementalHoareTripleChecker+Valid, 510 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-09 19:20:04,686 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [149 Valid, 269 Invalid, 562 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [52 Valid, 510 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-09 19:20:04,687 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1965 states. [2024-11-09 19:20:04,703 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1965 to 1825. [2024-11-09 19:20:04,705 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1825 states, 1824 states have (on average 1.6973684210526316) internal successors, (3096), 1824 states have internal predecessors, (3096), 0 states have call successors, (0), 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-09 19:20:04,707 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1825 states to 1825 states and 3096 transitions. [2024-11-09 19:20:04,707 INFO L78 Accepts]: Start accepts. Automaton has 1825 states and 3096 transitions. Word has length 221 [2024-11-09 19:20:04,708 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 19:20:04,708 INFO L471 AbstractCegarLoop]: Abstraction has 1825 states and 3096 transitions. [2024-11-09 19:20:04,708 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 73.66666666666667) internal successors, (221), 3 states have internal predecessors, (221), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 19:20:04,708 INFO L276 IsEmpty]: Start isEmpty. Operand 1825 states and 3096 transitions. [2024-11-09 19:20:04,711 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 333 [2024-11-09 19:20:04,711 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 19:20:04,711 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, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 19:20:04,711 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-09 19:20:04,711 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 19:20:04,714 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 19:20:04,715 INFO L85 PathProgramCache]: Analyzing trace with hash -1437777069, now seen corresponding path program 1 times [2024-11-09 19:20:04,715 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 19:20:04,715 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1099180852] [2024-11-09 19:20:04,715 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 19:20:04,715 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 19:20:04,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 19:20:04,905 INFO L134 CoverageAnalysis]: Checked inductivity of 338 backedges. 80 proven. 0 refuted. 0 times theorem prover too weak. 258 trivial. 0 not checked. [2024-11-09 19:20:04,905 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 19:20:04,905 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1099180852] [2024-11-09 19:20:04,905 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1099180852] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 19:20:04,905 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 19:20:04,906 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-09 19:20:04,906 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1579250830] [2024-11-09 19:20:04,906 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 19:20:04,906 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 19:20:04,906 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 19:20:04,907 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 19:20:04,908 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 19:20:04,908 INFO L87 Difference]: Start difference. First operand 1825 states and 3096 transitions. Second operand has 3 states, 3 states have (on average 49.666666666666664) internal successors, (149), 3 states have internal predecessors, (149), 0 states have call successors, (0), 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-09 19:20:05,396 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 19:20:05,396 INFO L93 Difference]: Finished difference Result 3505 states and 5970 transitions. [2024-11-09 19:20:05,396 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 19:20:05,397 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 49.666666666666664) internal successors, (149), 3 states have internal predecessors, (149), 0 states have call successors, (0), 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 332 [2024-11-09 19:20:05,397 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 19:20:05,397 INFO L225 Difference]: With dead ends: 3505 [2024-11-09 19:20:05,397 INFO L226 Difference]: Without dead ends: 0 [2024-11-09 19:20:05,400 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-09 19:20:05,400 INFO L432 NwaCegarLoop]: 294 mSDtfsCounter, 188 mSDsluCounter, 5 mSDsCounter, 0 mSdLazyCounter, 492 mSolverCounterSat, 51 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 188 SdHoareTripleChecker+Valid, 299 SdHoareTripleChecker+Invalid, 543 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 51 IncrementalHoareTripleChecker+Valid, 492 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-09 19:20:05,401 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [188 Valid, 299 Invalid, 543 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [51 Valid, 492 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-09 19:20:05,402 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2024-11-09 19:20:05,402 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2024-11-09 19:20:05,402 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-09 19:20:05,403 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2024-11-09 19:20:05,403 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 332 [2024-11-09 19:20:05,403 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 19:20:05,403 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2024-11-09 19:20:05,403 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 49.666666666666664) internal successors, (149), 3 states have internal predecessors, (149), 0 states have call successors, (0), 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-09 19:20:05,403 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2024-11-09 19:20:05,403 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2024-11-09 19:20:05,406 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-09 19:20:05,407 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-11-09 19:20:05,409 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 19:20:05,411 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2024-11-09 19:20:05,555 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-09 19:20:05,569 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 09.11 07:20:05 BoogieIcfgContainer [2024-11-09 19:20:05,569 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-09 19:20:05,569 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-09 19:20:05,570 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-09 19:20:05,570 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-09 19:20:05,570 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 09.11 07:19:57" (3/4) ... [2024-11-09 19:20:05,572 INFO L143 WitnessPrinter]: Generating witness for correct program [2024-11-09 19:20:05,588 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 15 nodes and edges [2024-11-09 19:20:05,590 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2024-11-09 19:20:05,590 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2024-11-09 19:20:05,591 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2024-11-09 19:20:05,712 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2024-11-09 19:20:05,714 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.yml [2024-11-09 19:20:05,714 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-09 19:20:05,714 INFO L158 Benchmark]: Toolchain (without parser) took 9940.39ms. Allocated memory was 228.6MB in the beginning and 427.8MB in the end (delta: 199.2MB). Free memory was 154.7MB in the beginning and 277.3MB in the end (delta: -122.7MB). Peak memory consumption was 78.6MB. Max. memory is 16.1GB. [2024-11-09 19:20:05,714 INFO L158 Benchmark]: CDTParser took 0.15ms. Allocated memory is still 125.8MB. Free memory was 87.5MB in the beginning and 87.4MB in the end (delta: 118.9kB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-09 19:20:05,715 INFO L158 Benchmark]: CACSL2BoogieTranslator took 808.39ms. Allocated memory is still 228.6MB. Free memory was 154.4MB in the beginning and 193.9MB in the end (delta: -39.5MB). Peak memory consumption was 37.8MB. Max. memory is 16.1GB. [2024-11-09 19:20:05,715 INFO L158 Benchmark]: Boogie Procedure Inliner took 90.85ms. Allocated memory is still 228.6MB. Free memory was 193.9MB in the beginning and 186.0MB in the end (delta: 7.9MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2024-11-09 19:20:05,715 INFO L158 Benchmark]: Boogie Preprocessor took 93.02ms. Allocated memory is still 228.6MB. Free memory was 186.0MB in the beginning and 176.6MB in the end (delta: 9.4MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2024-11-09 19:20:05,715 INFO L158 Benchmark]: IcfgBuilder took 1083.45ms. Allocated memory is still 228.6MB. Free memory was 176.6MB in the beginning and 180.2MB in the end (delta: -3.7MB). Peak memory consumption was 114.8MB. Max. memory is 16.1GB. [2024-11-09 19:20:05,716 INFO L158 Benchmark]: TraceAbstraction took 7714.36ms. Allocated memory was 228.6MB in the beginning and 427.8MB in the end (delta: 199.2MB). Free memory was 179.2MB in the beginning and 291.0MB in the end (delta: -111.8MB). Peak memory consumption was 87.5MB. Max. memory is 16.1GB. [2024-11-09 19:20:05,716 INFO L158 Benchmark]: Witness Printer took 144.34ms. Allocated memory is still 427.8MB. Free memory was 291.0MB in the beginning and 277.3MB in the end (delta: 13.6MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2024-11-09 19:20:05,717 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.15ms. Allocated memory is still 125.8MB. Free memory was 87.5MB in the beginning and 87.4MB in the end (delta: 118.9kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 808.39ms. Allocated memory is still 228.6MB. Free memory was 154.4MB in the beginning and 193.9MB in the end (delta: -39.5MB). Peak memory consumption was 37.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 90.85ms. Allocated memory is still 228.6MB. Free memory was 193.9MB in the beginning and 186.0MB in the end (delta: 7.9MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. * Boogie Preprocessor took 93.02ms. Allocated memory is still 228.6MB. Free memory was 186.0MB in the beginning and 176.6MB in the end (delta: 9.4MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * IcfgBuilder took 1083.45ms. Allocated memory is still 228.6MB. Free memory was 176.6MB in the beginning and 180.2MB in the end (delta: -3.7MB). Peak memory consumption was 114.8MB. Max. memory is 16.1GB. * TraceAbstraction took 7714.36ms. Allocated memory was 228.6MB in the beginning and 427.8MB in the end (delta: 199.2MB). Free memory was 179.2MB in the beginning and 291.0MB in the end (delta: -111.8MB). Peak memory consumption was 87.5MB. Max. memory is 16.1GB. * Witness Printer took 144.34ms. Allocated memory is still 427.8MB. Free memory was 291.0MB in the beginning and 277.3MB in the end (delta: 13.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: 98]: 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.5s, OverallIterations: 10, TraceHistogramMax: 4, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 5.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1717 SdHoareTripleChecker+Valid, 4.9s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1717 mSDsluCounter, 1208 SdHoareTripleChecker+Invalid, 4.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 65 mSDsCounter, 615 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 5228 IncrementalHoareTripleChecker+Invalid, 5843 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 615 mSolverCounterUnsat, 1143 mSDtfsCounter, 5228 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 28 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1825occurred in iteration=9, InterpolantAutomatonStates: 34, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 10 MinimizatonAttempts, 983 StatesRemovedByMinimization, 5 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 1.5s InterpolantComputationTime, 1602 NumberOfCodeBlocks, 1602 NumberOfCodeBlocksAsserted, 10 NumberOfCheckSat, 1592 ConstructedInterpolants, 0 QuantifiedInterpolants, 4122 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 10 InterpolantComputations, 10 PerfectInterpolantSequences, 951/951 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-09 19:20:05,741 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