./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/eca-rers2012/Problem10_label06.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 3289d67d Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/eca-rers2012/Problem10_label06.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 0ad111d6936056460510a10e712b295b6541e8406527db903438c9aa67289a02 --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.fs.icfgbuilder-eval-3289d67-m [2024-11-16 03:47:10,979 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-16 03:47:11,037 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-16 03:47:11,041 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-16 03:47:11,041 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-16 03:47:11,095 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-16 03:47:11,097 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-16 03:47:11,097 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-16 03:47:11,098 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-16 03:47:11,099 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-16 03:47:11,099 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-16 03:47:11,100 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-16 03:47:11,100 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-16 03:47:11,100 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-16 03:47:11,100 INFO L153 SettingsManager]: * Use SBE=true [2024-11-16 03:47:11,102 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-16 03:47:11,102 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-16 03:47:11,102 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-16 03:47:11,102 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-16 03:47:11,105 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-16 03:47:11,105 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-16 03:47:11,106 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-16 03:47:11,106 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-16 03:47:11,106 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-16 03:47:11,106 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-16 03:47:11,106 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-16 03:47:11,106 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-16 03:47:11,107 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-16 03:47:11,107 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2024-11-16 03:47:11,107 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-16 03:47:11,107 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-16 03:47:11,107 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-16 03:47:11,107 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-16 03:47:11,108 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-16 03:47:11,108 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-16 03:47:11,108 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-16 03:47:11,108 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-16 03:47:11,108 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-16 03:47:11,108 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-16 03:47:11,108 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-16 03:47:11,109 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-16 03:47:11,110 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-16 03:47:11,110 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 -> 0ad111d6936056460510a10e712b295b6541e8406527db903438c9aa67289a02 [2024-11-16 03:47:11,310 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-16 03:47:11,329 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-16 03:47:11,331 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-16 03:47:11,332 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-16 03:47:11,332 INFO L274 PluginConnector]: CDTParser initialized [2024-11-16 03:47:11,333 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/eca-rers2012/Problem10_label06.c [2024-11-16 03:47:12,673 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-16 03:47:12,929 INFO L384 CDTParser]: Found 1 translation units. [2024-11-16 03:47:12,929 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem10_label06.c [2024-11-16 03:47:12,940 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e0075b4c3/6ad266ab63e14ed483d03d4e7ba53964/FLAGb0828542c [2024-11-16 03:47:13,256 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e0075b4c3/6ad266ab63e14ed483d03d4e7ba53964 [2024-11-16 03:47:13,258 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-16 03:47:13,259 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-16 03:47:13,260 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-16 03:47:13,260 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-16 03:47:13,266 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-16 03:47:13,267 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.11 03:47:13" (1/1) ... [2024-11-16 03:47:13,267 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7a55f8e8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 03:47:13, skipping insertion in model container [2024-11-16 03:47:13,268 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.11 03:47:13" (1/1) ... [2024-11-16 03:47:13,311 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-16 03:47:13,487 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_label06.c[2930,2943] [2024-11-16 03:47:13,640 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-16 03:47:13,648 INFO L200 MainTranslator]: Completed pre-run [2024-11-16 03:47:13,668 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_label06.c[2930,2943] [2024-11-16 03:47:13,726 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-16 03:47:13,742 INFO L204 MainTranslator]: Completed translation [2024-11-16 03:47:13,743 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 03:47:13 WrapperNode [2024-11-16 03:47:13,743 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-16 03:47:13,744 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-16 03:47:13,744 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-16 03:47:13,744 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-16 03:47:13,749 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 03:47:13" (1/1) ... [2024-11-16 03:47:13,763 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 03:47:13" (1/1) ... [2024-11-16 03:47:13,815 INFO L138 Inliner]: procedures = 14, calls = 8, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 597 [2024-11-16 03:47:13,815 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-16 03:47:13,816 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-16 03:47:13,816 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-16 03:47:13,816 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-16 03:47:13,833 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 03:47:13" (1/1) ... [2024-11-16 03:47:13,833 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 03:47:13" (1/1) ... [2024-11-16 03:47:13,839 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 03:47:13" (1/1) ... [2024-11-16 03:47:13,878 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-11-16 03:47:13,881 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 03:47:13" (1/1) ... [2024-11-16 03:47:13,881 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 03:47:13" (1/1) ... [2024-11-16 03:47:13,904 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 03:47:13" (1/1) ... [2024-11-16 03:47:13,908 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 03:47:13" (1/1) ... [2024-11-16 03:47:13,914 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 03:47:13" (1/1) ... [2024-11-16 03:47:13,917 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 03:47:13" (1/1) ... [2024-11-16 03:47:13,925 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-16 03:47:13,926 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2024-11-16 03:47:13,926 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2024-11-16 03:47:13,926 INFO L274 PluginConnector]: IcfgBuilder initialized [2024-11-16 03:47:13,927 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 03:47:13" (1/1) ... [2024-11-16 03:47:13,931 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-16 03:47:13,942 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-16 03:47:13,960 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-16 03:47:13,964 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-16 03:47:13,994 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-16 03:47:13,994 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-16 03:47:13,994 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-16 03:47:13,995 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-16 03:47:14,130 INFO L256 CfgBuilder]: Building ICFG [2024-11-16 03:47:14,132 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-16 03:47:14,856 INFO L? ?]: Removed 84 outVars from TransFormulas that were not future-live. [2024-11-16 03:47:14,856 INFO L307 CfgBuilder]: Performing block encoding [2024-11-16 03:47:14,873 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-16 03:47:14,873 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-16 03:47:14,873 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.11 03:47:14 BoogieIcfgContainer [2024-11-16 03:47:14,873 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2024-11-16 03:47:14,875 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-16 03:47:14,875 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-16 03:47:14,879 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-16 03:47:14,879 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 16.11 03:47:13" (1/3) ... [2024-11-16 03:47:14,879 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@36bd0447 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.11 03:47:14, skipping insertion in model container [2024-11-16 03:47:14,880 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 03:47:13" (2/3) ... [2024-11-16 03:47:14,880 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@36bd0447 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.11 03:47:14, skipping insertion in model container [2024-11-16 03:47:14,880 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.11 03:47:14" (3/3) ... [2024-11-16 03:47:14,882 INFO L112 eAbstractionObserver]: Analyzing ICFG Problem10_label06.c [2024-11-16 03:47:14,910 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-16 03:47:14,910 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-16 03:47:14,980 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-16 03:47:14,988 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;@6c2657a0, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-16 03:47:14,988 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-16 03:47:14,993 INFO L276 IsEmpty]: Start isEmpty. Operand has 209 states, 207 states have (on average 1.6763285024154588) internal successors, (347), 208 states have internal predecessors, (347), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-16 03:47:14,999 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2024-11-16 03:47:14,999 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 03:47:15,000 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] [2024-11-16 03:47:15,001 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 03:47:15,006 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 03:47:15,006 INFO L85 PathProgramCache]: Analyzing trace with hash -890558115, now seen corresponding path program 1 times [2024-11-16 03:47:15,014 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 03:47:15,014 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [866330302] [2024-11-16 03:47:15,015 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 03:47:15,015 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 03:47:15,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 03:47:15,272 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-16 03:47:15,273 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 03:47:15,273 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [866330302] [2024-11-16 03:47:15,274 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [866330302] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 03:47:15,274 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 03:47:15,274 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-16 03:47:15,279 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [495206407] [2024-11-16 03:47:15,279 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 03:47:15,283 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-16 03:47:15,283 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 03:47:15,303 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-16 03:47:15,304 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-16 03:47:15,306 INFO L87 Difference]: Start difference. First operand has 209 states, 207 states have (on average 1.6763285024154588) internal successors, (347), 208 states have internal predecessors, (347), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 3 states, 3 states have (on average 8.666666666666666) internal successors, (26), 2 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-16 03:47:16,131 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 03:47:16,131 INFO L93 Difference]: Finished difference Result 558 states and 972 transitions. [2024-11-16 03:47:16,133 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-16 03:47:16,134 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 8.666666666666666) internal successors, (26), 2 states have internal predecessors, (26), 0 states have call successors, (0), 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 26 [2024-11-16 03:47:16,134 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 03:47:16,143 INFO L225 Difference]: With dead ends: 558 [2024-11-16 03:47:16,143 INFO L226 Difference]: Without dead ends: 285 [2024-11-16 03:47:16,149 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-16 03:47:16,152 INFO L432 NwaCegarLoop]: 71 mSDtfsCounter, 164 mSDsluCounter, 9 mSDsCounter, 0 mSdLazyCounter, 424 mSolverCounterSat, 137 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 164 SdHoareTripleChecker+Valid, 80 SdHoareTripleChecker+Invalid, 561 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 137 IncrementalHoareTripleChecker+Valid, 424 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-11-16 03:47:16,153 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [164 Valid, 80 Invalid, 561 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [137 Valid, 424 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-11-16 03:47:16,167 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 285 states. [2024-11-16 03:47:16,187 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 285 to 285. [2024-11-16 03:47:16,188 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 285 states, 284 states have (on average 1.5316901408450705) internal successors, (435), 284 states have internal predecessors, (435), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-16 03:47:16,189 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 285 states to 285 states and 435 transitions. [2024-11-16 03:47:16,190 INFO L78 Accepts]: Start accepts. Automaton has 285 states and 435 transitions. Word has length 26 [2024-11-16 03:47:16,190 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 03:47:16,191 INFO L471 AbstractCegarLoop]: Abstraction has 285 states and 435 transitions. [2024-11-16 03:47:16,191 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 8.666666666666666) internal successors, (26), 2 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-16 03:47:16,191 INFO L276 IsEmpty]: Start isEmpty. Operand 285 states and 435 transitions. [2024-11-16 03:47:16,193 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2024-11-16 03:47:16,193 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 03:47:16,193 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 03:47:16,194 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-16 03:47:16,194 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 03:47:16,194 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 03:47:16,194 INFO L85 PathProgramCache]: Analyzing trace with hash -1826434545, now seen corresponding path program 1 times [2024-11-16 03:47:16,194 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 03:47:16,195 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [312544130] [2024-11-16 03:47:16,195 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 03:47:16,195 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 03:47:16,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 03:47:16,360 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 22 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-16 03:47:16,361 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 03:47:16,361 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [312544130] [2024-11-16 03:47:16,361 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [312544130] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 03:47:16,361 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 03:47:16,362 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-16 03:47:16,362 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [326478071] [2024-11-16 03:47:16,362 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 03:47:16,363 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-16 03:47:16,364 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 03:47:16,365 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-16 03:47:16,365 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-16 03:47:16,366 INFO L87 Difference]: Start difference. First operand 285 states and 435 transitions. Second operand has 3 states, 3 states have (on average 32.0) internal successors, (96), 2 states have internal predecessors, (96), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-16 03:47:16,739 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 03:47:16,739 INFO L93 Difference]: Finished difference Result 708 states and 1083 transitions. [2024-11-16 03:47:16,739 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-16 03:47:16,739 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 32.0) internal successors, (96), 2 states have internal predecessors, (96), 0 states have call successors, (0), 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 96 [2024-11-16 03:47:16,740 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 03:47:16,743 INFO L225 Difference]: With dead ends: 708 [2024-11-16 03:47:16,743 INFO L226 Difference]: Without dead ends: 425 [2024-11-16 03:47:16,744 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-16 03:47:16,744 INFO L432 NwaCegarLoop]: 33 mSDtfsCounter, 110 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 334 mSolverCounterSat, 98 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 110 SdHoareTripleChecker+Valid, 37 SdHoareTripleChecker+Invalid, 432 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 98 IncrementalHoareTripleChecker+Valid, 334 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-16 03:47:16,745 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [110 Valid, 37 Invalid, 432 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [98 Valid, 334 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-16 03:47:16,746 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 425 states. [2024-11-16 03:47:16,768 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 425 to 425. [2024-11-16 03:47:16,773 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 425 states, 424 states have (on average 1.4150943396226414) internal successors, (600), 424 states have internal predecessors, (600), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-16 03:47:16,773 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 425 states to 425 states and 600 transitions. [2024-11-16 03:47:16,775 INFO L78 Accepts]: Start accepts. Automaton has 425 states and 600 transitions. Word has length 96 [2024-11-16 03:47:16,775 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 03:47:16,776 INFO L471 AbstractCegarLoop]: Abstraction has 425 states and 600 transitions. [2024-11-16 03:47:16,776 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 32.0) internal successors, (96), 2 states have internal predecessors, (96), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-16 03:47:16,776 INFO L276 IsEmpty]: Start isEmpty. Operand 425 states and 600 transitions. [2024-11-16 03:47:16,779 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2024-11-16 03:47:16,779 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 03:47:16,779 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 03:47:16,779 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-16 03:47:16,779 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 03:47:16,780 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 03:47:16,780 INFO L85 PathProgramCache]: Analyzing trace with hash -1104769344, now seen corresponding path program 1 times [2024-11-16 03:47:16,780 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 03:47:16,780 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [738549708] [2024-11-16 03:47:16,780 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 03:47:16,781 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 03:47:16,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 03:47:16,920 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 22 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-16 03:47:16,921 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 03:47:16,921 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [738549708] [2024-11-16 03:47:16,921 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [738549708] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 03:47:16,921 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 03:47:16,921 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-16 03:47:16,921 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1961000621] [2024-11-16 03:47:16,921 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 03:47:16,922 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-16 03:47:16,922 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 03:47:16,923 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-16 03:47:16,923 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-16 03:47:16,923 INFO L87 Difference]: Start difference. First operand 425 states and 600 transitions. Second operand has 3 states, 3 states have (on average 34.0) internal successors, (102), 3 states have internal predecessors, (102), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-16 03:47:17,311 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 03:47:17,311 INFO L93 Difference]: Finished difference Result 568 states and 793 transitions. [2024-11-16 03:47:17,312 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-16 03:47:17,312 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 34.0) internal successors, (102), 3 states have internal predecessors, (102), 0 states have call successors, (0), 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 102 [2024-11-16 03:47:17,312 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 03:47:17,314 INFO L225 Difference]: With dead ends: 568 [2024-11-16 03:47:17,314 INFO L226 Difference]: Without dead ends: 565 [2024-11-16 03:47:17,314 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-16 03:47:17,322 INFO L432 NwaCegarLoop]: 9 mSDtfsCounter, 160 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 355 mSolverCounterSat, 73 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 160 SdHoareTripleChecker+Valid, 15 SdHoareTripleChecker+Invalid, 428 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 73 IncrementalHoareTripleChecker+Valid, 355 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-16 03:47:17,323 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [160 Valid, 15 Invalid, 428 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [73 Valid, 355 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-16 03:47:17,324 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 565 states. [2024-11-16 03:47:17,348 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 565 to 425. [2024-11-16 03:47:17,349 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 425 states, 424 states have (on average 1.4150943396226414) internal successors, (600), 424 states have internal predecessors, (600), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-16 03:47:17,353 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 425 states to 425 states and 600 transitions. [2024-11-16 03:47:17,353 INFO L78 Accepts]: Start accepts. Automaton has 425 states and 600 transitions. Word has length 102 [2024-11-16 03:47:17,353 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 03:47:17,353 INFO L471 AbstractCegarLoop]: Abstraction has 425 states and 600 transitions. [2024-11-16 03:47:17,357 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 34.0) internal successors, (102), 3 states have internal predecessors, (102), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-16 03:47:17,357 INFO L276 IsEmpty]: Start isEmpty. Operand 425 states and 600 transitions. [2024-11-16 03:47:17,358 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2024-11-16 03:47:17,362 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 03:47:17,362 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 03:47:17,362 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-16 03:47:17,362 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 03:47:17,363 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 03:47:17,363 INFO L85 PathProgramCache]: Analyzing trace with hash 1494558877, now seen corresponding path program 1 times [2024-11-16 03:47:17,363 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 03:47:17,363 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [56243094] [2024-11-16 03:47:17,365 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 03:47:17,365 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 03:47:17,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 03:47:17,506 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 22 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-16 03:47:17,507 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 03:47:17,508 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [56243094] [2024-11-16 03:47:17,508 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [56243094] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 03:47:17,508 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 03:47:17,508 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-16 03:47:17,508 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [493631001] [2024-11-16 03:47:17,508 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 03:47:17,509 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-16 03:47:17,509 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 03:47:17,511 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-16 03:47:17,511 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-16 03:47:17,511 INFO L87 Difference]: Start difference. First operand 425 states and 600 transitions. Second operand has 3 states, 3 states have (on average 35.0) internal successors, (105), 2 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-16 03:47:17,888 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 03:47:17,888 INFO L93 Difference]: Finished difference Result 1268 states and 1794 transitions. [2024-11-16 03:47:17,889 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-16 03:47:17,889 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 35.0) internal successors, (105), 2 states have internal predecessors, (105), 0 states have call successors, (0), 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 105 [2024-11-16 03:47:17,889 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 03:47:17,891 INFO L225 Difference]: With dead ends: 1268 [2024-11-16 03:47:17,891 INFO L226 Difference]: Without dead ends: 845 [2024-11-16 03:47:17,892 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-16 03:47:17,893 INFO L432 NwaCegarLoop]: 29 mSDtfsCounter, 64 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 376 mSolverCounterSat, 72 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 64 SdHoareTripleChecker+Valid, 35 SdHoareTripleChecker+Invalid, 448 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 72 IncrementalHoareTripleChecker+Valid, 376 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-16 03:47:17,893 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [64 Valid, 35 Invalid, 448 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [72 Valid, 376 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-16 03:47:17,894 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 845 states. [2024-11-16 03:47:17,911 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 845 to 705. [2024-11-16 03:47:17,915 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 705 states, 704 states have (on average 1.3849431818181819) internal successors, (975), 704 states have internal predecessors, (975), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-16 03:47:17,929 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 705 states to 705 states and 975 transitions. [2024-11-16 03:47:17,930 INFO L78 Accepts]: Start accepts. Automaton has 705 states and 975 transitions. Word has length 105 [2024-11-16 03:47:17,931 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 03:47:17,931 INFO L471 AbstractCegarLoop]: Abstraction has 705 states and 975 transitions. [2024-11-16 03:47:17,931 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 35.0) internal successors, (105), 2 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-16 03:47:17,931 INFO L276 IsEmpty]: Start isEmpty. Operand 705 states and 975 transitions. [2024-11-16 03:47:17,934 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2024-11-16 03:47:17,934 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 03:47:17,937 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 03:47:17,937 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-16 03:47:17,937 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 03:47:17,937 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 03:47:17,938 INFO L85 PathProgramCache]: Analyzing trace with hash -1177988747, now seen corresponding path program 1 times [2024-11-16 03:47:17,938 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 03:47:17,938 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1513529165] [2024-11-16 03:47:17,938 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 03:47:17,938 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 03:47:17,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 03:47:18,036 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 22 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-16 03:47:18,036 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 03:47:18,036 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1513529165] [2024-11-16 03:47:18,036 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1513529165] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 03:47:18,036 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 03:47:18,036 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-16 03:47:18,037 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [334128158] [2024-11-16 03:47:18,037 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 03:47:18,037 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-16 03:47:18,037 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 03:47:18,038 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-16 03:47:18,038 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-16 03:47:18,038 INFO L87 Difference]: Start difference. First operand 705 states and 975 transitions. Second operand has 3 states, 3 states have (on average 40.333333333333336) internal successors, (121), 2 states have internal predecessors, (121), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-16 03:47:18,429 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 03:47:18,429 INFO L93 Difference]: Finished difference Result 1968 states and 2728 transitions. [2024-11-16 03:47:18,429 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-16 03:47:18,429 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 40.333333333333336) internal successors, (121), 2 states have internal predecessors, (121), 0 states have call successors, (0), 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 121 [2024-11-16 03:47:18,430 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 03:47:18,434 INFO L225 Difference]: With dead ends: 1968 [2024-11-16 03:47:18,434 INFO L226 Difference]: Without dead ends: 1265 [2024-11-16 03:47:18,435 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-16 03:47:18,439 INFO L432 NwaCegarLoop]: 75 mSDtfsCounter, 48 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 361 mSolverCounterSat, 69 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 48 SdHoareTripleChecker+Valid, 81 SdHoareTripleChecker+Invalid, 430 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 69 IncrementalHoareTripleChecker+Valid, 361 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-16 03:47:18,439 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [48 Valid, 81 Invalid, 430 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [69 Valid, 361 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-16 03:47:18,443 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1265 states. [2024-11-16 03:47:18,464 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1265 to 1125. [2024-11-16 03:47:18,465 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1125 states, 1124 states have (on average 1.2855871886120998) internal successors, (1445), 1124 states have internal predecessors, (1445), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-16 03:47:18,467 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1125 states to 1125 states and 1445 transitions. [2024-11-16 03:47:18,467 INFO L78 Accepts]: Start accepts. Automaton has 1125 states and 1445 transitions. Word has length 121 [2024-11-16 03:47:18,467 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 03:47:18,467 INFO L471 AbstractCegarLoop]: Abstraction has 1125 states and 1445 transitions. [2024-11-16 03:47:18,467 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 40.333333333333336) internal successors, (121), 2 states have internal predecessors, (121), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-16 03:47:18,468 INFO L276 IsEmpty]: Start isEmpty. Operand 1125 states and 1445 transitions. [2024-11-16 03:47:18,469 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 182 [2024-11-16 03:47:18,469 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 03:47:18,470 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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-16 03:47:18,470 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-16 03:47:18,470 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 03:47:18,470 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 03:47:18,470 INFO L85 PathProgramCache]: Analyzing trace with hash 1556842714, now seen corresponding path program 1 times [2024-11-16 03:47:18,470 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 03:47:18,470 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [920199173] [2024-11-16 03:47:18,470 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 03:47:18,471 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 03:47:18,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 03:47:18,845 INFO L134 CoverageAnalysis]: Checked inductivity of 120 backedges. 120 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-16 03:47:18,846 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 03:47:18,846 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [920199173] [2024-11-16 03:47:18,846 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [920199173] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 03:47:18,846 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 03:47:18,846 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-16 03:47:18,849 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1390325759] [2024-11-16 03:47:18,849 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 03:47:18,849 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-16 03:47:18,849 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 03:47:18,850 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-16 03:47:18,850 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2024-11-16 03:47:18,850 INFO L87 Difference]: Start difference. First operand 1125 states and 1445 transitions. Second operand has 7 states, 7 states have (on average 25.857142857142858) internal successors, (181), 6 states have internal predecessors, (181), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-16 03:47:19,350 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 03:47:19,350 INFO L93 Difference]: Finished difference Result 2304 states and 2944 transitions. [2024-11-16 03:47:19,351 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-16 03:47:19,351 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 25.857142857142858) internal successors, (181), 6 states have internal predecessors, (181), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 181 [2024-11-16 03:47:19,351 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 03:47:19,354 INFO L225 Difference]: With dead ends: 2304 [2024-11-16 03:47:19,354 INFO L226 Difference]: Without dead ends: 1125 [2024-11-16 03:47:19,356 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-16 03:47:19,356 INFO L432 NwaCegarLoop]: 12 mSDtfsCounter, 143 mSDsluCounter, 29 mSDsCounter, 0 mSdLazyCounter, 962 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 143 SdHoareTripleChecker+Valid, 41 SdHoareTripleChecker+Invalid, 962 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 962 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-16 03:47:19,357 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [143 Valid, 41 Invalid, 962 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 962 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-16 03:47:19,358 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1125 states. [2024-11-16 03:47:19,368 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1125 to 1125. [2024-11-16 03:47:19,369 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1125 states, 1124 states have (on average 1.2784697508896796) internal successors, (1437), 1124 states have internal predecessors, (1437), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-16 03:47:19,371 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1125 states to 1125 states and 1437 transitions. [2024-11-16 03:47:19,371 INFO L78 Accepts]: Start accepts. Automaton has 1125 states and 1437 transitions. Word has length 181 [2024-11-16 03:47:19,371 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 03:47:19,371 INFO L471 AbstractCegarLoop]: Abstraction has 1125 states and 1437 transitions. [2024-11-16 03:47:19,372 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 25.857142857142858) internal successors, (181), 6 states have internal predecessors, (181), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-16 03:47:19,372 INFO L276 IsEmpty]: Start isEmpty. Operand 1125 states and 1437 transitions. [2024-11-16 03:47:19,373 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 189 [2024-11-16 03:47:19,373 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 03:47:19,373 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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-16 03:47:19,373 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-16 03:47:19,374 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 03:47:19,374 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 03:47:19,374 INFO L85 PathProgramCache]: Analyzing trace with hash -402135785, now seen corresponding path program 1 times [2024-11-16 03:47:19,374 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 03:47:19,374 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [411983951] [2024-11-16 03:47:19,374 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 03:47:19,375 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 03:47:19,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 03:47:19,562 INFO L134 CoverageAnalysis]: Checked inductivity of 111 backedges. 111 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-16 03:47:19,563 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 03:47:19,563 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [411983951] [2024-11-16 03:47:19,563 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [411983951] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 03:47:19,563 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 03:47:19,563 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-16 03:47:19,563 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1996041765] [2024-11-16 03:47:19,564 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 03:47:19,564 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-16 03:47:19,564 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 03:47:19,564 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-16 03:47:19,564 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-16 03:47:19,565 INFO L87 Difference]: Start difference. First operand 1125 states and 1437 transitions. Second operand has 3 states, 3 states have (on average 62.666666666666664) internal successors, (188), 3 states have internal predecessors, (188), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-16 03:47:19,994 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 03:47:19,994 INFO L93 Difference]: Finished difference Result 2668 states and 3430 transitions. [2024-11-16 03:47:19,995 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-16 03:47:19,995 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 62.666666666666664) internal successors, (188), 3 states have internal predecessors, (188), 0 states have call successors, (0), 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 188 [2024-11-16 03:47:19,996 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 03:47:19,999 INFO L225 Difference]: With dead ends: 2668 [2024-11-16 03:47:19,999 INFO L226 Difference]: Without dead ends: 1545 [2024-11-16 03:47:20,000 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-16 03:47:20,002 INFO L432 NwaCegarLoop]: 212 mSDtfsCounter, 50 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 339 mSolverCounterSat, 59 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 50 SdHoareTripleChecker+Valid, 219 SdHoareTripleChecker+Invalid, 398 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 59 IncrementalHoareTripleChecker+Valid, 339 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-16 03:47:20,002 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [50 Valid, 219 Invalid, 398 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [59 Valid, 339 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-16 03:47:20,004 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1545 states. [2024-11-16 03:47:20,014 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1545 to 1125. [2024-11-16 03:47:20,016 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1125 states, 1124 states have (on average 1.2704626334519573) internal successors, (1428), 1124 states have internal predecessors, (1428), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-16 03:47:20,018 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1125 states to 1125 states and 1428 transitions. [2024-11-16 03:47:20,019 INFO L78 Accepts]: Start accepts. Automaton has 1125 states and 1428 transitions. Word has length 188 [2024-11-16 03:47:20,019 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 03:47:20,019 INFO L471 AbstractCegarLoop]: Abstraction has 1125 states and 1428 transitions. [2024-11-16 03:47:20,019 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 62.666666666666664) internal successors, (188), 3 states have internal predecessors, (188), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-16 03:47:20,019 INFO L276 IsEmpty]: Start isEmpty. Operand 1125 states and 1428 transitions. [2024-11-16 03:47:20,021 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 199 [2024-11-16 03:47:20,021 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 03:47:20,021 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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-16 03:47:20,021 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-16 03:47:20,021 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 03:47:20,021 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 03:47:20,022 INFO L85 PathProgramCache]: Analyzing trace with hash -1501466112, now seen corresponding path program 1 times [2024-11-16 03:47:20,022 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 03:47:20,022 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [681968491] [2024-11-16 03:47:20,022 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 03:47:20,022 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 03:47:20,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 03:47:20,176 INFO L134 CoverageAnalysis]: Checked inductivity of 123 backedges. 100 proven. 0 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2024-11-16 03:47:20,176 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 03:47:20,177 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [681968491] [2024-11-16 03:47:20,177 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [681968491] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 03:47:20,177 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 03:47:20,177 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-16 03:47:20,177 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [290268739] [2024-11-16 03:47:20,178 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 03:47:20,178 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-16 03:47:20,178 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 03:47:20,178 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-16 03:47:20,179 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-16 03:47:20,179 INFO L87 Difference]: Start difference. First operand 1125 states and 1428 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-16 03:47:20,564 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 03:47:20,564 INFO L93 Difference]: Finished difference Result 2388 states and 3003 transitions. [2024-11-16 03:47:20,565 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-16 03:47:20,565 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 198 [2024-11-16 03:47:20,565 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 03:47:20,570 INFO L225 Difference]: With dead ends: 2388 [2024-11-16 03:47:20,573 INFO L226 Difference]: Without dead ends: 1265 [2024-11-16 03:47:20,574 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-16 03:47:20,579 INFO L432 NwaCegarLoop]: 80 mSDtfsCounter, 49 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 351 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 49 SdHoareTripleChecker+Valid, 86 SdHoareTripleChecker+Invalid, 355 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 351 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-16 03:47:20,580 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [49 Valid, 86 Invalid, 355 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 351 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-16 03:47:20,581 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1265 states. [2024-11-16 03:47:20,592 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1265 to 1265. [2024-11-16 03:47:20,594 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1265 states, 1264 states have (on average 1.2436708860759493) internal successors, (1572), 1264 states have internal predecessors, (1572), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-16 03:47:20,595 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1265 states to 1265 states and 1572 transitions. [2024-11-16 03:47:20,596 INFO L78 Accepts]: Start accepts. Automaton has 1265 states and 1572 transitions. Word has length 198 [2024-11-16 03:47:20,596 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 03:47:20,596 INFO L471 AbstractCegarLoop]: Abstraction has 1265 states and 1572 transitions. [2024-11-16 03:47:20,596 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-16 03:47:20,596 INFO L276 IsEmpty]: Start isEmpty. Operand 1265 states and 1572 transitions. [2024-11-16 03:47:20,598 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 218 [2024-11-16 03:47:20,598 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 03:47:20,598 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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-16 03:47:20,598 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-16 03:47:20,598 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 03:47:20,599 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 03:47:20,599 INFO L85 PathProgramCache]: Analyzing trace with hash -1669148684, now seen corresponding path program 1 times [2024-11-16 03:47:20,599 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 03:47:20,599 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1590480204] [2024-11-16 03:47:20,599 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 03:47:20,599 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 03:47:20,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 03:47:20,752 INFO L134 CoverageAnalysis]: Checked inductivity of 123 backedges. 123 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-16 03:47:20,753 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 03:47:20,753 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1590480204] [2024-11-16 03:47:20,753 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1590480204] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 03:47:20,753 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 03:47:20,753 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-16 03:47:20,753 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [689475980] [2024-11-16 03:47:20,754 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 03:47:20,754 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-16 03:47:20,754 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 03:47:20,754 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-16 03:47:20,754 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-16 03:47:20,755 INFO L87 Difference]: Start difference. First operand 1265 states and 1572 transitions. Second operand has 3 states, 3 states have (on average 72.33333333333333) internal successors, (217), 3 states have internal predecessors, (217), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-16 03:47:21,460 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 03:47:21,460 INFO L93 Difference]: Finished difference Result 2808 states and 3556 transitions. [2024-11-16 03:47:21,464 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-16 03:47:21,464 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 72.33333333333333) internal successors, (217), 3 states have internal predecessors, (217), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 217 [2024-11-16 03:47:21,465 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 03:47:21,468 INFO L225 Difference]: With dead ends: 2808 [2024-11-16 03:47:21,468 INFO L226 Difference]: Without dead ends: 1685 [2024-11-16 03:47:21,469 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-16 03:47:21,470 INFO L432 NwaCegarLoop]: 187 mSDtfsCounter, 78 mSDsluCounter, 5 mSDsCounter, 0 mSdLazyCounter, 362 mSolverCounterSat, 52 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 78 SdHoareTripleChecker+Valid, 192 SdHoareTripleChecker+Invalid, 414 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 52 IncrementalHoareTripleChecker+Valid, 362 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-11-16 03:47:21,470 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [78 Valid, 192 Invalid, 414 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [52 Valid, 362 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-11-16 03:47:21,471 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1685 states. [2024-11-16 03:47:21,483 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1685 to 1685. [2024-11-16 03:47:21,485 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1685 states, 1684 states have (on average 1.163895486935867) internal successors, (1960), 1684 states have internal predecessors, (1960), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-16 03:47:21,487 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1685 states to 1685 states and 1960 transitions. [2024-11-16 03:47:21,487 INFO L78 Accepts]: Start accepts. Automaton has 1685 states and 1960 transitions. Word has length 217 [2024-11-16 03:47:21,487 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 03:47:21,487 INFO L471 AbstractCegarLoop]: Abstraction has 1685 states and 1960 transitions. [2024-11-16 03:47:21,488 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 72.33333333333333) internal successors, (217), 3 states have internal predecessors, (217), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-16 03:47:21,488 INFO L276 IsEmpty]: Start isEmpty. Operand 1685 states and 1960 transitions. [2024-11-16 03:47:21,490 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 311 [2024-11-16 03:47:21,490 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 03:47:21,490 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, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 03:47:21,491 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-16 03:47:21,491 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 03:47:21,491 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 03:47:21,491 INFO L85 PathProgramCache]: Analyzing trace with hash 976401929, now seen corresponding path program 1 times [2024-11-16 03:47:21,491 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 03:47:21,491 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2106993640] [2024-11-16 03:47:21,491 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 03:47:21,492 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 03:47:21,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 03:47:21,628 INFO L134 CoverageAnalysis]: Checked inductivity of 317 backedges. 68 proven. 0 refuted. 0 times theorem prover too weak. 249 trivial. 0 not checked. [2024-11-16 03:47:21,628 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 03:47:21,628 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2106993640] [2024-11-16 03:47:21,628 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2106993640] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 03:47:21,628 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 03:47:21,628 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-16 03:47:21,628 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1776962889] [2024-11-16 03:47:21,629 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 03:47:21,629 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-16 03:47:21,629 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 03:47:21,629 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-16 03:47:21,631 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-16 03:47:21,631 INFO L87 Difference]: Start difference. First operand 1685 states and 1960 transitions. Second operand has 3 states, 3 states have (on average 47.0) internal successors, (141), 3 states have internal predecessors, (141), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-16 03:47:22,137 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 03:47:22,138 INFO L93 Difference]: Finished difference Result 1968 states and 2290 transitions. [2024-11-16 03:47:22,138 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-16 03:47:22,139 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 47.0) internal successors, (141), 3 states have internal predecessors, (141), 0 states have call successors, (0), 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 310 [2024-11-16 03:47:22,139 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 03:47:22,143 INFO L225 Difference]: With dead ends: 1968 [2024-11-16 03:47:22,143 INFO L226 Difference]: Without dead ends: 1965 [2024-11-16 03:47:22,144 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-16 03:47:22,144 INFO L432 NwaCegarLoop]: 9 mSDtfsCounter, 160 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 350 mSolverCounterSat, 77 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 160 SdHoareTripleChecker+Valid, 15 SdHoareTripleChecker+Invalid, 427 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 77 IncrementalHoareTripleChecker+Valid, 350 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-16 03:47:22,145 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [160 Valid, 15 Invalid, 427 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [77 Valid, 350 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-16 03:47:22,147 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1965 states. [2024-11-16 03:47:22,168 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1965 to 1545. [2024-11-16 03:47:22,170 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1545 states, 1544 states have (on average 1.1683937823834196) internal successors, (1804), 1544 states have internal predecessors, (1804), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-16 03:47:22,172 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1545 states to 1545 states and 1804 transitions. [2024-11-16 03:47:22,173 INFO L78 Accepts]: Start accepts. Automaton has 1545 states and 1804 transitions. Word has length 310 [2024-11-16 03:47:22,173 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 03:47:22,174 INFO L471 AbstractCegarLoop]: Abstraction has 1545 states and 1804 transitions. [2024-11-16 03:47:22,174 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 47.0) internal successors, (141), 3 states have internal predecessors, (141), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-16 03:47:22,174 INFO L276 IsEmpty]: Start isEmpty. Operand 1545 states and 1804 transitions. [2024-11-16 03:47:22,178 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 329 [2024-11-16 03:47:22,178 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 03:47:22,178 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, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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-16 03:47:22,178 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-11-16 03:47:22,178 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 03:47:22,179 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 03:47:22,179 INFO L85 PathProgramCache]: Analyzing trace with hash -2016776115, now seen corresponding path program 1 times [2024-11-16 03:47:22,179 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 03:47:22,179 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1594979491] [2024-11-16 03:47:22,179 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 03:47:22,180 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 03:47:22,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 03:47:22,572 INFO L134 CoverageAnalysis]: Checked inductivity of 326 backedges. 68 proven. 0 refuted. 0 times theorem prover too weak. 258 trivial. 0 not checked. [2024-11-16 03:47:22,572 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 03:47:22,572 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1594979491] [2024-11-16 03:47:22,572 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1594979491] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 03:47:22,573 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 03:47:22,573 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-16 03:47:22,573 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1475873563] [2024-11-16 03:47:22,573 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 03:47:22,573 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-16 03:47:22,573 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 03:47:22,573 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-16 03:47:22,573 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-16 03:47:22,574 INFO L87 Difference]: Start difference. First operand 1545 states and 1804 transitions. Second operand has 3 states, 3 states have (on average 48.333333333333336) internal successors, (145), 3 states have internal predecessors, (145), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-16 03:47:22,891 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 03:47:22,891 INFO L93 Difference]: Finished difference Result 2945 states and 3460 transitions. [2024-11-16 03:47:22,892 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-16 03:47:22,892 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 48.333333333333336) internal successors, (145), 3 states have internal predecessors, (145), 0 states have call successors, (0), 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 328 [2024-11-16 03:47:22,892 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 03:47:22,893 INFO L225 Difference]: With dead ends: 2945 [2024-11-16 03:47:22,894 INFO L226 Difference]: Without dead ends: 0 [2024-11-16 03:47:22,895 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-16 03:47:22,896 INFO L432 NwaCegarLoop]: 41 mSDtfsCounter, 132 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 342 mSolverCounterSat, 50 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 132 SdHoareTripleChecker+Valid, 45 SdHoareTripleChecker+Invalid, 392 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 50 IncrementalHoareTripleChecker+Valid, 342 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-16 03:47:22,896 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [132 Valid, 45 Invalid, 392 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [50 Valid, 342 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-16 03:47:22,896 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2024-11-16 03:47:22,896 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2024-11-16 03:47:22,897 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-16 03:47:22,897 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2024-11-16 03:47:22,897 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 328 [2024-11-16 03:47:22,897 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 03:47:22,897 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2024-11-16 03:47:22,897 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 48.333333333333336) internal successors, (145), 3 states have internal predecessors, (145), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-16 03:47:22,897 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2024-11-16 03:47:22,897 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2024-11-16 03:47:22,900 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-16 03:47:22,900 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-11-16 03:47:22,903 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 03:47:22,905 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2024-11-16 03:47:23,045 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-16 03:47:23,053 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 16.11 03:47:23 BoogieIcfgContainer [2024-11-16 03:47:23,053 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-16 03:47:23,053 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-16 03:47:23,053 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-16 03:47:23,054 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-16 03:47:23,054 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.11 03:47:14" (3/4) ... [2024-11-16 03:47:23,055 INFO L143 WitnessPrinter]: Generating witness for correct program [2024-11-16 03:47:23,065 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 15 nodes and edges [2024-11-16 03:47:23,066 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2024-11-16 03:47:23,066 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2024-11-16 03:47:23,067 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2024-11-16 03:47:23,194 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2024-11-16 03:47:23,194 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.yml [2024-11-16 03:47:23,194 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-16 03:47:23,195 INFO L158 Benchmark]: Toolchain (without parser) took 9935.90ms. Allocated memory was 255.9MB in the beginning and 413.1MB in the end (delta: 157.3MB). Free memory was 184.2MB in the beginning and 233.8MB in the end (delta: -49.5MB). Peak memory consumption was 110.4MB. Max. memory is 16.1GB. [2024-11-16 03:47:23,195 INFO L158 Benchmark]: CDTParser took 0.12ms. Allocated memory is still 127.9MB. Free memory is still 95.9MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-16 03:47:23,195 INFO L158 Benchmark]: CACSL2BoogieTranslator took 483.01ms. Allocated memory is still 255.9MB. Free memory was 183.8MB in the beginning and 154.0MB in the end (delta: 29.8MB). Peak memory consumption was 31.5MB. Max. memory is 16.1GB. [2024-11-16 03:47:23,196 INFO L158 Benchmark]: Boogie Procedure Inliner took 71.46ms. Allocated memory is still 255.9MB. Free memory was 154.0MB in the beginning and 146.1MB in the end (delta: 7.9MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2024-11-16 03:47:23,196 INFO L158 Benchmark]: Boogie Preprocessor took 109.36ms. Allocated memory is still 255.9MB. Free memory was 146.0MB in the beginning and 136.4MB in the end (delta: 9.6MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2024-11-16 03:47:23,196 INFO L158 Benchmark]: IcfgBuilder took 947.74ms. Allocated memory is still 255.9MB. Free memory was 136.4MB in the beginning and 131.5MB in the end (delta: 4.9MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2024-11-16 03:47:23,196 INFO L158 Benchmark]: TraceAbstraction took 8178.27ms. Allocated memory was 255.9MB in the beginning and 413.1MB in the end (delta: 157.3MB). Free memory was 130.4MB in the beginning and 246.3MB in the end (delta: -115.9MB). Peak memory consumption was 43.5MB. Max. memory is 16.1GB. [2024-11-16 03:47:23,196 INFO L158 Benchmark]: Witness Printer took 141.19ms. Allocated memory is still 413.1MB. Free memory was 246.3MB in the beginning and 233.8MB in the end (delta: 12.5MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2024-11-16 03:47:23,197 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.12ms. Allocated memory is still 127.9MB. Free memory is still 95.9MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 483.01ms. Allocated memory is still 255.9MB. Free memory was 183.8MB in the beginning and 154.0MB in the end (delta: 29.8MB). Peak memory consumption was 31.5MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 71.46ms. Allocated memory is still 255.9MB. Free memory was 154.0MB in the beginning and 146.1MB in the end (delta: 7.9MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. * Boogie Preprocessor took 109.36ms. Allocated memory is still 255.9MB. Free memory was 146.0MB in the beginning and 136.4MB in the end (delta: 9.6MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * IcfgBuilder took 947.74ms. Allocated memory is still 255.9MB. Free memory was 136.4MB in the beginning and 131.5MB in the end (delta: 4.9MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * TraceAbstraction took 8178.27ms. Allocated memory was 255.9MB in the beginning and 413.1MB in the end (delta: 157.3MB). Free memory was 130.4MB in the beginning and 246.3MB in the end (delta: -115.9MB). Peak memory consumption was 43.5MB. Max. memory is 16.1GB. * Witness Printer took 141.19ms. Allocated memory is still 413.1MB. Free memory was 246.3MB in the beginning and 233.8MB in the end (delta: 12.5MB). 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: 86]: 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.9s, OverallIterations: 11, TraceHistogramMax: 4, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 5.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1158 SdHoareTripleChecker+Valid, 5.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1158 mSDsluCounter, 846 SdHoareTripleChecker+Invalid, 4.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 88 mSDsCounter, 691 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 4556 IncrementalHoareTripleChecker+Invalid, 5247 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 691 mSolverCounterUnsat, 758 mSDtfsCounter, 4556 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 34 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1685occurred in iteration=9, InterpolantAutomatonStates: 37, 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, 11 MinimizatonAttempts, 1260 StatesRemovedByMinimization, 5 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 1.8s InterpolantComputationTime, 1872 NumberOfCodeBlocks, 1872 NumberOfCodeBlocksAsserted, 11 NumberOfCheckSat, 1861 ConstructedInterpolants, 0 QuantifiedInterpolants, 4436 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 11 InterpolantComputations, 11 PerfectInterpolantSequences, 1208/1208 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 592]: Location Invariant Derived location invariant: null RESULT: Ultimate proved your program to be correct! [2024-11-16 03:47:23,234 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