./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/loop-new/nested-1.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version c3fed411 Calling Ultimate with: /usr/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/loop-new/nested-1.i -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.graphml --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 3baf312ca85439572472b3c02ed304b3157fa97373d6ada535e5a723c6c0219a --- Real Ultimate output --- This is Ultimate 0.2.2-tmp.no-commuhash-c3fed41 [2021-12-17 10:10:59,794 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-12-17 10:10:59,796 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-12-17 10:10:59,842 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-12-17 10:10:59,843 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-12-17 10:10:59,845 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-12-17 10:10:59,846 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-12-17 10:10:59,848 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-12-17 10:10:59,850 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-12-17 10:10:59,853 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-12-17 10:10:59,854 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-12-17 10:10:59,855 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-12-17 10:10:59,855 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-12-17 10:10:59,857 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-12-17 10:10:59,858 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-12-17 10:10:59,861 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-12-17 10:10:59,862 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-12-17 10:10:59,862 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-12-17 10:10:59,864 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-12-17 10:10:59,868 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-12-17 10:10:59,869 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-12-17 10:10:59,869 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-12-17 10:10:59,871 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-12-17 10:10:59,871 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-12-17 10:10:59,876 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-12-17 10:10:59,876 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-12-17 10:10:59,876 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-12-17 10:10:59,877 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-12-17 10:10:59,878 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-12-17 10:10:59,878 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-12-17 10:10:59,878 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-12-17 10:10:59,879 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-12-17 10:10:59,880 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-12-17 10:10:59,881 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-12-17 10:10:59,882 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-12-17 10:10:59,883 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-12-17 10:10:59,883 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-12-17 10:10:59,883 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-12-17 10:10:59,883 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-12-17 10:10:59,884 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-12-17 10:10:59,884 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-12-17 10:10:59,885 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2021-12-17 10:10:59,909 INFO L113 SettingsManager]: Loading preferences was successful [2021-12-17 10:10:59,909 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-12-17 10:10:59,910 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2021-12-17 10:10:59,910 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2021-12-17 10:10:59,911 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2021-12-17 10:10:59,911 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2021-12-17 10:10:59,911 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-12-17 10:10:59,911 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-12-17 10:10:59,911 INFO L138 SettingsManager]: * Use SBE=true [2021-12-17 10:10:59,912 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-12-17 10:10:59,912 INFO L138 SettingsManager]: * sizeof long=4 [2021-12-17 10:10:59,912 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-12-17 10:10:59,912 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-12-17 10:10:59,913 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-12-17 10:10:59,913 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-12-17 10:10:59,913 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-12-17 10:10:59,913 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-12-17 10:10:59,913 INFO L138 SettingsManager]: * sizeof long double=12 [2021-12-17 10:10:59,913 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-12-17 10:10:59,913 INFO L138 SettingsManager]: * Use constant arrays=true [2021-12-17 10:10:59,913 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-12-17 10:10:59,914 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-12-17 10:10:59,914 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-12-17 10:10:59,914 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-12-17 10:10:59,914 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-12-17 10:10:59,914 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-12-17 10:10:59,914 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-12-17 10:10:59,914 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-12-17 10:10:59,915 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-12-17 10:10:59,915 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-12-17 10:10:59,915 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2021-12-17 10:10:59,915 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2021-12-17 10:10:59,915 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2021-12-17 10:10:59,915 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-12-17 10:10:59,916 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode 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.graphml 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 -> 3baf312ca85439572472b3c02ed304b3157fa97373d6ada535e5a723c6c0219a [2021-12-17 10:11:00,115 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-12-17 10:11:00,138 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-12-17 10:11:00,141 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-12-17 10:11:00,141 INFO L271 PluginConnector]: Initializing CDTParser... [2021-12-17 10:11:00,142 INFO L275 PluginConnector]: CDTParser initialized [2021-12-17 10:11:00,143 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/loop-new/nested-1.i [2021-12-17 10:11:00,181 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2c50373e5/1a2f7b8c8d8c48fc81ff15acf02a5433/FLAG6cd1e673b [2021-12-17 10:11:00,552 INFO L306 CDTParser]: Found 1 translation units. [2021-12-17 10:11:00,553 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/loop-new/nested-1.i [2021-12-17 10:11:00,557 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2c50373e5/1a2f7b8c8d8c48fc81ff15acf02a5433/FLAG6cd1e673b [2021-12-17 10:11:00,570 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2c50373e5/1a2f7b8c8d8c48fc81ff15acf02a5433 [2021-12-17 10:11:00,572 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-12-17 10:11:00,574 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-12-17 10:11:00,576 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-12-17 10:11:00,576 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-12-17 10:11:00,579 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-12-17 10:11:00,579 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.12 10:11:00" (1/1) ... [2021-12-17 10:11:00,580 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@202235a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.12 10:11:00, skipping insertion in model container [2021-12-17 10:11:00,580 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.12 10:11:00" (1/1) ... [2021-12-17 10:11:00,585 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-12-17 10:11:00,596 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-12-17 10:11:00,742 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/loop-new/nested-1.i[891,904] [2021-12-17 10:11:00,754 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-12-17 10:11:00,760 INFO L203 MainTranslator]: Completed pre-run [2021-12-17 10:11:00,770 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/loop-new/nested-1.i[891,904] [2021-12-17 10:11:00,774 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-12-17 10:11:00,785 INFO L208 MainTranslator]: Completed translation [2021-12-17 10:11:00,785 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.12 10:11:00 WrapperNode [2021-12-17 10:11:00,785 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-12-17 10:11:00,786 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-12-17 10:11:00,787 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-12-17 10:11:00,787 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-12-17 10:11:00,792 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.12 10:11:00" (1/1) ... [2021-12-17 10:11:00,797 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.12 10:11:00" (1/1) ... [2021-12-17 10:11:00,810 INFO L137 Inliner]: procedures = 16, calls = 7, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 52 [2021-12-17 10:11:00,811 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-12-17 10:11:00,812 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-12-17 10:11:00,812 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-12-17 10:11:00,812 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-12-17 10:11:00,817 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.12 10:11:00" (1/1) ... [2021-12-17 10:11:00,817 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.12 10:11:00" (1/1) ... [2021-12-17 10:11:00,824 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.12 10:11:00" (1/1) ... [2021-12-17 10:11:00,825 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.12 10:11:00" (1/1) ... [2021-12-17 10:11:00,833 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.12 10:11:00" (1/1) ... [2021-12-17 10:11:00,836 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.12 10:11:00" (1/1) ... [2021-12-17 10:11:00,840 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.12 10:11:00" (1/1) ... [2021-12-17 10:11:00,841 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-12-17 10:11:00,842 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-12-17 10:11:00,842 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-12-17 10:11:00,842 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-12-17 10:11:00,843 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.12 10:11:00" (1/1) ... [2021-12-17 10:11:00,848 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-12-17 10:11:00,862 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-17 10:11:00,872 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2021-12-17 10:11:00,888 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2021-12-17 10:11:00,903 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2021-12-17 10:11:00,904 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-12-17 10:11:00,904 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-12-17 10:11:00,904 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-12-17 10:11:00,941 INFO L236 CfgBuilder]: Building ICFG [2021-12-17 10:11:00,943 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2021-12-17 10:11:01,067 INFO L277 CfgBuilder]: Performing block encoding [2021-12-17 10:11:01,070 INFO L296 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-12-17 10:11:01,071 INFO L301 CfgBuilder]: Removed 2 assume(true) statements. [2021-12-17 10:11:01,072 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 17.12 10:11:01 BoogieIcfgContainer [2021-12-17 10:11:01,087 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-12-17 10:11:01,088 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-12-17 10:11:01,088 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-12-17 10:11:01,091 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-12-17 10:11:01,091 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 17.12 10:11:00" (1/3) ... [2021-12-17 10:11:01,091 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@17f33320 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.12 10:11:01, skipping insertion in model container [2021-12-17 10:11:01,092 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.12 10:11:00" (2/3) ... [2021-12-17 10:11:01,092 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@17f33320 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.12 10:11:01, skipping insertion in model container [2021-12-17 10:11:01,092 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 17.12 10:11:01" (3/3) ... [2021-12-17 10:11:01,093 INFO L111 eAbstractionObserver]: Analyzing ICFG nested-1.i [2021-12-17 10:11:01,096 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-12-17 10:11:01,096 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2021-12-17 10:11:01,139 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2021-12-17 10:11:01,151 INFO L339 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, mHoare=true, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, 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, mLoopAccelerationTechnique=FAST_UPR [2021-12-17 10:11:01,151 INFO L340 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2021-12-17 10:11:01,160 INFO L276 IsEmpty]: Start isEmpty. Operand has 16 states, 14 states have (on average 1.5714285714285714) internal successors, (22), 15 states have internal predecessors, (22), 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) [2021-12-17 10:11:01,164 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2021-12-17 10:11:01,164 INFO L506 BasicCegarLoop]: Found error trace [2021-12-17 10:11:01,164 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2021-12-17 10:11:01,165 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-17 10:11:01,171 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-17 10:11:01,171 INFO L85 PathProgramCache]: Analyzing trace with hash 179613278, now seen corresponding path program 1 times [2021-12-17 10:11:01,177 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-17 10:11:01,178 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1671410890] [2021-12-17 10:11:01,178 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-17 10:11:01,179 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-17 10:11:01,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 10:11:01,328 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-17 10:11:01,328 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-17 10:11:01,329 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1671410890] [2021-12-17 10:11:01,330 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1671410890] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-17 10:11:01,330 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-17 10:11:01,331 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-12-17 10:11:01,332 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [88698458] [2021-12-17 10:11:01,333 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-17 10:11:01,335 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-12-17 10:11:01,336 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-17 10:11:01,356 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-12-17 10:11:01,357 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2021-12-17 10:11:01,359 INFO L87 Difference]: Start difference. First operand has 16 states, 14 states have (on average 1.5714285714285714) internal successors, (22), 15 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 4 states, 4 states have (on average 2.0) internal successors, (8), 4 states have internal predecessors, (8), 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) [2021-12-17 10:11:01,389 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-17 10:11:01,389 INFO L93 Difference]: Finished difference Result 35 states and 48 transitions. [2021-12-17 10:11:01,391 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-12-17 10:11:01,392 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.0) internal successors, (8), 4 states have internal predecessors, (8), 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 8 [2021-12-17 10:11:01,392 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-17 10:11:01,397 INFO L225 Difference]: With dead ends: 35 [2021-12-17 10:11:01,397 INFO L226 Difference]: Without dead ends: 16 [2021-12-17 10:11:01,400 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2021-12-17 10:11:01,403 INFO L933 BasicCegarLoop]: 18 mSDtfsCounter, 23 mSDsluCounter, 14 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 23 SdHoareTripleChecker+Valid, 32 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-17 10:11:01,404 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [23 Valid, 32 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-17 10:11:01,415 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16 states. [2021-12-17 10:11:01,423 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16 to 13. [2021-12-17 10:11:01,424 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13 states, 12 states have (on average 1.1666666666666667) internal successors, (14), 12 states have internal predecessors, (14), 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) [2021-12-17 10:11:01,441 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 14 transitions. [2021-12-17 10:11:01,442 INFO L78 Accepts]: Start accepts. Automaton has 13 states and 14 transitions. Word has length 8 [2021-12-17 10:11:01,445 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-17 10:11:01,445 INFO L470 AbstractCegarLoop]: Abstraction has 13 states and 14 transitions. [2021-12-17 10:11:01,445 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 2.0) internal successors, (8), 4 states have internal predecessors, (8), 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) [2021-12-17 10:11:01,445 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 14 transitions. [2021-12-17 10:11:01,446 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2021-12-17 10:11:01,446 INFO L506 BasicCegarLoop]: Found error trace [2021-12-17 10:11:01,446 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-17 10:11:01,446 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-12-17 10:11:01,447 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-17 10:11:01,451 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-17 10:11:01,451 INFO L85 PathProgramCache]: Analyzing trace with hash 754200042, now seen corresponding path program 1 times [2021-12-17 10:11:01,451 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-17 10:11:01,451 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [744416441] [2021-12-17 10:11:01,451 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-17 10:11:01,452 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-17 10:11:01,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 10:11:01,499 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-17 10:11:01,499 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-17 10:11:01,500 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [744416441] [2021-12-17 10:11:01,500 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [744416441] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-17 10:11:01,500 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-17 10:11:01,500 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-12-17 10:11:01,500 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [682948339] [2021-12-17 10:11:01,500 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-17 10:11:01,502 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-12-17 10:11:01,502 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-17 10:11:01,503 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-12-17 10:11:01,503 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2021-12-17 10:11:01,504 INFO L87 Difference]: Start difference. First operand 13 states and 14 transitions. Second operand has 4 states, 4 states have (on average 2.75) internal successors, (11), 4 states have internal predecessors, (11), 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) [2021-12-17 10:11:01,519 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-17 10:11:01,519 INFO L93 Difference]: Finished difference Result 23 states and 26 transitions. [2021-12-17 10:11:01,519 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-12-17 10:11:01,520 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.75) internal successors, (11), 4 states have internal predecessors, (11), 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 11 [2021-12-17 10:11:01,520 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-17 10:11:01,521 INFO L225 Difference]: With dead ends: 23 [2021-12-17 10:11:01,521 INFO L226 Difference]: Without dead ends: 15 [2021-12-17 10:11:01,524 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2021-12-17 10:11:01,525 INFO L933 BasicCegarLoop]: 10 mSDtfsCounter, 10 mSDsluCounter, 9 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 19 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-17 10:11:01,526 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [10 Valid, 19 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-17 10:11:01,529 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15 states. [2021-12-17 10:11:01,533 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15 to 14. [2021-12-17 10:11:01,534 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14 states, 13 states have (on average 1.1538461538461537) internal successors, (15), 13 states have internal predecessors, (15), 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) [2021-12-17 10:11:01,535 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 15 transitions. [2021-12-17 10:11:01,535 INFO L78 Accepts]: Start accepts. Automaton has 14 states and 15 transitions. Word has length 11 [2021-12-17 10:11:01,535 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-17 10:11:01,536 INFO L470 AbstractCegarLoop]: Abstraction has 14 states and 15 transitions. [2021-12-17 10:11:01,536 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 2.75) internal successors, (11), 4 states have internal predecessors, (11), 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) [2021-12-17 10:11:01,536 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 15 transitions. [2021-12-17 10:11:01,537 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2021-12-17 10:11:01,537 INFO L506 BasicCegarLoop]: Found error trace [2021-12-17 10:11:01,538 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-17 10:11:01,539 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-12-17 10:11:01,540 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-17 10:11:01,540 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-17 10:11:01,540 INFO L85 PathProgramCache]: Analyzing trace with hash -902976276, now seen corresponding path program 1 times [2021-12-17 10:11:01,540 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-17 10:11:01,540 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1293464860] [2021-12-17 10:11:01,541 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-17 10:11:01,541 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-17 10:11:01,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 10:11:01,616 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-17 10:11:01,617 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-17 10:11:01,617 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1293464860] [2021-12-17 10:11:01,617 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1293464860] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-17 10:11:01,618 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [23911904] [2021-12-17 10:11:01,618 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-17 10:11:01,618 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-17 10:11:01,619 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-17 10:11:01,621 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-17 10:11:01,621 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2021-12-17 10:11:01,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 10:11:01,662 INFO L263 TraceCheckSpWp]: Trace formula consists of 52 conjuncts, 4 conjunts are in the unsatisfiable core [2021-12-17 10:11:01,664 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-17 10:11:01,736 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-17 10:11:01,737 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-17 10:11:01,779 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-17 10:11:01,780 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [23911904] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-17 10:11:01,780 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-17 10:11:01,780 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 10 [2021-12-17 10:11:01,780 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [741756814] [2021-12-17 10:11:01,780 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-17 10:11:01,781 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2021-12-17 10:11:01,781 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-17 10:11:01,781 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-12-17 10:11:01,781 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2021-12-17 10:11:01,782 INFO L87 Difference]: Start difference. First operand 14 states and 15 transitions. Second operand has 10 states, 10 states have (on average 2.2) internal successors, (22), 10 states have internal predecessors, (22), 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) [2021-12-17 10:11:01,818 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-17 10:11:01,818 INFO L93 Difference]: Finished difference Result 29 states and 34 transitions. [2021-12-17 10:11:01,818 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-12-17 10:11:01,818 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 2.2) internal successors, (22), 10 states have internal predecessors, (22), 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 13 [2021-12-17 10:11:01,819 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-17 10:11:01,819 INFO L225 Difference]: With dead ends: 29 [2021-12-17 10:11:01,819 INFO L226 Difference]: Without dead ends: 20 [2021-12-17 10:11:01,820 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2021-12-17 10:11:01,820 INFO L933 BasicCegarLoop]: 10 mSDtfsCounter, 30 mSDsluCounter, 23 mSDsCounter, 0 mSdLazyCounter, 22 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 30 SdHoareTripleChecker+Valid, 33 SdHoareTripleChecker+Invalid, 35 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 22 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-17 10:11:01,821 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [30 Valid, 33 Invalid, 35 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 22 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-17 10:11:01,821 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states. [2021-12-17 10:11:01,823 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 20. [2021-12-17 10:11:01,824 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20 states, 19 states have (on average 1.105263157894737) internal successors, (21), 19 states have internal predecessors, (21), 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) [2021-12-17 10:11:01,824 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 21 transitions. [2021-12-17 10:11:01,824 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 21 transitions. Word has length 13 [2021-12-17 10:11:01,824 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-17 10:11:01,825 INFO L470 AbstractCegarLoop]: Abstraction has 20 states and 21 transitions. [2021-12-17 10:11:01,825 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 2.2) internal successors, (22), 10 states have internal predecessors, (22), 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) [2021-12-17 10:11:01,825 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 21 transitions. [2021-12-17 10:11:01,825 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2021-12-17 10:11:01,826 INFO L506 BasicCegarLoop]: Found error trace [2021-12-17 10:11:01,826 INFO L514 BasicCegarLoop]: trace histogram [4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-17 10:11:01,858 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2021-12-17 10:11:02,060 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-17 10:11:02,061 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-17 10:11:02,061 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-17 10:11:02,061 INFO L85 PathProgramCache]: Analyzing trace with hash 86791922, now seen corresponding path program 2 times [2021-12-17 10:11:02,061 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-17 10:11:02,061 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1312303647] [2021-12-17 10:11:02,062 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-17 10:11:02,062 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-17 10:11:02,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 10:11:02,121 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 1 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-17 10:11:02,121 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-17 10:11:02,121 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1312303647] [2021-12-17 10:11:02,122 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1312303647] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-17 10:11:02,122 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [654002545] [2021-12-17 10:11:02,122 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2021-12-17 10:11:02,122 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-17 10:11:02,122 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-17 10:11:02,123 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-17 10:11:02,124 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2021-12-17 10:11:02,152 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-12-17 10:11:02,152 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-12-17 10:11:02,153 INFO L263 TraceCheckSpWp]: Trace formula consists of 67 conjuncts, 7 conjunts are in the unsatisfiable core [2021-12-17 10:11:02,154 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-17 10:11:02,259 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 1 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-17 10:11:02,259 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-17 10:11:02,357 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 1 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-17 10:11:02,357 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [654002545] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-17 10:11:02,358 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-17 10:11:02,358 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 19 [2021-12-17 10:11:02,358 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [965405607] [2021-12-17 10:11:02,358 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-17 10:11:02,358 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2021-12-17 10:11:02,359 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-17 10:11:02,359 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2021-12-17 10:11:02,359 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=147, Invalid=195, Unknown=0, NotChecked=0, Total=342 [2021-12-17 10:11:02,360 INFO L87 Difference]: Start difference. First operand 20 states and 21 transitions. Second operand has 19 states, 19 states have (on average 2.1052631578947367) internal successors, (40), 19 states have internal predecessors, (40), 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) [2021-12-17 10:11:02,462 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-17 10:11:02,462 INFO L93 Difference]: Finished difference Result 47 states and 55 transitions. [2021-12-17 10:11:02,462 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2021-12-17 10:11:02,462 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 2.1052631578947367) internal successors, (40), 19 states have internal predecessors, (40), 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 19 [2021-12-17 10:11:02,462 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-17 10:11:02,463 INFO L225 Difference]: With dead ends: 47 [2021-12-17 10:11:02,463 INFO L226 Difference]: Without dead ends: 32 [2021-12-17 10:11:02,463 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 157 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=222, Invalid=330, Unknown=0, NotChecked=0, Total=552 [2021-12-17 10:11:02,465 INFO L933 BasicCegarLoop]: 10 mSDtfsCounter, 51 mSDsluCounter, 16 mSDsCounter, 0 mSdLazyCounter, 35 mSolverCounterSat, 29 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 51 SdHoareTripleChecker+Valid, 26 SdHoareTripleChecker+Invalid, 64 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 29 IncrementalHoareTripleChecker+Valid, 35 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-17 10:11:02,468 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [51 Valid, 26 Invalid, 64 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [29 Valid, 35 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-17 10:11:02,469 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2021-12-17 10:11:02,473 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 32. [2021-12-17 10:11:02,473 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32 states, 31 states have (on average 1.064516129032258) internal successors, (33), 31 states have internal predecessors, (33), 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) [2021-12-17 10:11:02,475 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 33 transitions. [2021-12-17 10:11:02,475 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 33 transitions. Word has length 19 [2021-12-17 10:11:02,475 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-17 10:11:02,475 INFO L470 AbstractCegarLoop]: Abstraction has 32 states and 33 transitions. [2021-12-17 10:11:02,476 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 2.1052631578947367) internal successors, (40), 19 states have internal predecessors, (40), 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) [2021-12-17 10:11:02,476 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 33 transitions. [2021-12-17 10:11:02,476 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2021-12-17 10:11:02,477 INFO L506 BasicCegarLoop]: Found error trace [2021-12-17 10:11:02,477 INFO L514 BasicCegarLoop]: trace histogram [10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-17 10:11:02,492 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2021-12-17 10:11:02,683 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable3 [2021-12-17 10:11:02,683 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-17 10:11:02,684 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-17 10:11:02,684 INFO L85 PathProgramCache]: Analyzing trace with hash -238373506, now seen corresponding path program 3 times [2021-12-17 10:11:02,684 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-17 10:11:02,684 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [180674163] [2021-12-17 10:11:02,684 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-17 10:11:02,684 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-17 10:11:02,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 10:11:02,750 INFO L134 CoverageAnalysis]: Checked inductivity of 101 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 100 trivial. 0 not checked. [2021-12-17 10:11:02,750 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-17 10:11:02,751 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [180674163] [2021-12-17 10:11:02,751 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [180674163] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-17 10:11:02,751 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1331726935] [2021-12-17 10:11:02,751 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2021-12-17 10:11:02,751 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-17 10:11:02,751 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-17 10:11:02,752 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-17 10:11:02,753 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2021-12-17 10:11:02,776 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2021-12-17 10:11:02,777 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-12-17 10:11:02,777 INFO L263 TraceCheckSpWp]: Trace formula consists of 47 conjuncts, 4 conjunts are in the unsatisfiable core [2021-12-17 10:11:02,778 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-17 10:11:02,890 INFO L134 CoverageAnalysis]: Checked inductivity of 101 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 100 trivial. 0 not checked. [2021-12-17 10:11:02,890 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-17 10:11:02,948 INFO L134 CoverageAnalysis]: Checked inductivity of 101 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 100 trivial. 0 not checked. [2021-12-17 10:11:02,949 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1331726935] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-17 10:11:02,949 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-17 10:11:02,949 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 10 [2021-12-17 10:11:02,949 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2046809700] [2021-12-17 10:11:02,949 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-17 10:11:02,949 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2021-12-17 10:11:02,950 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-17 10:11:02,950 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-12-17 10:11:02,950 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2021-12-17 10:11:02,950 INFO L87 Difference]: Start difference. First operand 32 states and 33 transitions. Second operand has 10 states, 10 states have (on average 2.8) internal successors, (28), 10 states have internal predecessors, (28), 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) [2021-12-17 10:11:02,988 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-17 10:11:02,988 INFO L93 Difference]: Finished difference Result 105 states and 111 transitions. [2021-12-17 10:11:02,989 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-12-17 10:11:02,989 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 2.8) internal successors, (28), 10 states have internal predecessors, (28), 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 31 [2021-12-17 10:11:02,989 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-17 10:11:02,990 INFO L225 Difference]: With dead ends: 105 [2021-12-17 10:11:02,990 INFO L226 Difference]: Without dead ends: 101 [2021-12-17 10:11:02,990 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 57 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2021-12-17 10:11:02,990 INFO L933 BasicCegarLoop]: 10 mSDtfsCounter, 51 mSDsluCounter, 21 mSDsCounter, 0 mSdLazyCounter, 19 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 51 SdHoareTripleChecker+Valid, 31 SdHoareTripleChecker+Invalid, 31 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 19 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-17 10:11:02,990 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [51 Valid, 31 Invalid, 31 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 19 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-17 10:11:02,991 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101 states. [2021-12-17 10:11:02,997 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 101. [2021-12-17 10:11:02,997 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 101 states, 100 states have (on average 1.05) internal successors, (105), 100 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) [2021-12-17 10:11:02,998 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 105 transitions. [2021-12-17 10:11:02,998 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 105 transitions. Word has length 31 [2021-12-17 10:11:02,998 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-17 10:11:02,998 INFO L470 AbstractCegarLoop]: Abstraction has 101 states and 105 transitions. [2021-12-17 10:11:02,998 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 2.8) internal successors, (28), 10 states have internal predecessors, (28), 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) [2021-12-17 10:11:02,999 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 105 transitions. [2021-12-17 10:11:03,000 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2021-12-17 10:11:03,000 INFO L506 BasicCegarLoop]: Found error trace [2021-12-17 10:11:03,000 INFO L514 BasicCegarLoop]: trace histogram [40, 40, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-17 10:11:03,016 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2021-12-17 10:11:03,216 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-17 10:11:03,216 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-17 10:11:03,216 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-17 10:11:03,217 INFO L85 PathProgramCache]: Analyzing trace with hash -112220578, now seen corresponding path program 4 times [2021-12-17 10:11:03,217 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-17 10:11:03,217 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [291766963] [2021-12-17 10:11:03,217 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-17 10:11:03,217 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-17 10:11:03,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 10:11:03,336 INFO L134 CoverageAnalysis]: Checked inductivity of 1742 backedges. 0 proven. 1342 refuted. 0 times theorem prover too weak. 400 trivial. 0 not checked. [2021-12-17 10:11:03,336 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-17 10:11:03,336 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [291766963] [2021-12-17 10:11:03,336 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [291766963] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-17 10:11:03,336 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1909820693] [2021-12-17 10:11:03,336 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2021-12-17 10:11:03,336 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-17 10:11:03,336 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-17 10:11:03,337 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-17 10:11:03,338 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2021-12-17 10:11:03,395 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2021-12-17 10:11:03,395 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-12-17 10:11:03,396 INFO L263 TraceCheckSpWp]: Trace formula consists of 265 conjuncts, 7 conjunts are in the unsatisfiable core [2021-12-17 10:11:03,398 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-17 10:11:03,724 INFO L134 CoverageAnalysis]: Checked inductivity of 1742 backedges. 0 proven. 1342 refuted. 0 times theorem prover too weak. 400 trivial. 0 not checked. [2021-12-17 10:11:03,724 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-17 10:11:03,942 INFO L134 CoverageAnalysis]: Checked inductivity of 1742 backedges. 0 proven. 1342 refuted. 0 times theorem prover too weak. 400 trivial. 0 not checked. [2021-12-17 10:11:03,943 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1909820693] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-17 10:11:03,943 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-17 10:11:03,943 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 19 [2021-12-17 10:11:03,943 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [466214750] [2021-12-17 10:11:03,943 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-17 10:11:03,945 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2021-12-17 10:11:03,945 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-17 10:11:03,945 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2021-12-17 10:11:03,945 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=147, Invalid=195, Unknown=0, NotChecked=0, Total=342 [2021-12-17 10:11:03,946 INFO L87 Difference]: Start difference. First operand 101 states and 105 transitions. Second operand has 19 states, 19 states have (on average 3.8421052631578947) internal successors, (73), 19 states have internal predecessors, (73), 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) [2021-12-17 10:11:04,025 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-17 10:11:04,025 INFO L93 Difference]: Finished difference Result 243 states and 258 transitions. [2021-12-17 10:11:04,025 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2021-12-17 10:11:04,026 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 3.8421052631578947) internal successors, (73), 19 states have internal predecessors, (73), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 100 [2021-12-17 10:11:04,026 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-17 10:11:04,027 INFO L225 Difference]: With dead ends: 243 [2021-12-17 10:11:04,027 INFO L226 Difference]: Without dead ends: 239 [2021-12-17 10:11:04,028 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 211 GetRequests, 189 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 157 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=222, Invalid=330, Unknown=0, NotChecked=0, Total=552 [2021-12-17 10:11:04,028 INFO L933 BasicCegarLoop]: 10 mSDtfsCounter, 150 mSDsluCounter, 42 mSDsCounter, 0 mSdLazyCounter, 33 mSolverCounterSat, 31 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 150 SdHoareTripleChecker+Valid, 52 SdHoareTripleChecker+Invalid, 64 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 31 IncrementalHoareTripleChecker+Valid, 33 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-17 10:11:04,028 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [150 Valid, 52 Invalid, 64 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [31 Valid, 33 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-17 10:11:04,029 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 239 states. [2021-12-17 10:11:04,050 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 239 to 239. [2021-12-17 10:11:04,052 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 239 states, 238 states have (on average 1.046218487394958) internal successors, (249), 238 states have internal predecessors, (249), 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) [2021-12-17 10:11:04,055 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 239 states to 239 states and 249 transitions. [2021-12-17 10:11:04,056 INFO L78 Accepts]: Start accepts. Automaton has 239 states and 249 transitions. Word has length 100 [2021-12-17 10:11:04,056 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-17 10:11:04,058 INFO L470 AbstractCegarLoop]: Abstraction has 239 states and 249 transitions. [2021-12-17 10:11:04,058 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 3.8421052631578947) internal successors, (73), 19 states have internal predecessors, (73), 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) [2021-12-17 10:11:04,058 INFO L276 IsEmpty]: Start isEmpty. Operand 239 states and 249 transitions. [2021-12-17 10:11:04,060 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 239 [2021-12-17 10:11:04,061 INFO L506 BasicCegarLoop]: Found error trace [2021-12-17 10:11:04,061 INFO L514 BasicCegarLoop]: trace histogram [100, 100, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-17 10:11:04,079 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2021-12-17 10:11:04,275 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-17 10:11:04,275 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-17 10:11:04,276 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-17 10:11:04,276 INFO L85 PathProgramCache]: Analyzing trace with hash -16999842, now seen corresponding path program 5 times [2021-12-17 10:11:04,276 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-17 10:11:04,276 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1086158181] [2021-12-17 10:11:04,276 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-17 10:11:04,276 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-17 10:11:04,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 10:11:07,549 INFO L134 CoverageAnalysis]: Checked inductivity of 11045 backedges. 10917 proven. 119 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2021-12-17 10:11:07,550 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-17 10:11:07,550 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1086158181] [2021-12-17 10:11:07,550 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1086158181] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-17 10:11:07,550 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [130409564] [2021-12-17 10:11:07,550 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2021-12-17 10:11:07,550 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-17 10:11:07,550 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-17 10:11:07,551 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-17 10:11:07,552 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2021-12-17 10:11:07,710 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 81 check-sat command(s) [2021-12-17 10:11:07,710 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-12-17 10:11:07,713 INFO L263 TraceCheckSpWp]: Trace formula consists of 601 conjuncts, 104 conjunts are in the unsatisfiable core [2021-12-17 10:11:07,717 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-17 10:11:08,209 INFO L134 CoverageAnalysis]: Checked inductivity of 11045 backedges. 11036 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2021-12-17 10:11:08,209 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-17 10:11:08,210 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [130409564] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-17 10:11:08,210 INFO L186 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2021-12-17 10:11:08,210 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [104] imperfect sequences [104] total 106 [2021-12-17 10:11:08,210 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [145244435] [2021-12-17 10:11:08,210 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-17 10:11:08,213 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 104 states [2021-12-17 10:11:08,213 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-17 10:11:08,214 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 104 interpolants. [2021-12-17 10:11:08,217 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5261, Invalid=5869, Unknown=0, NotChecked=0, Total=11130 [2021-12-17 10:11:08,218 INFO L87 Difference]: Start difference. First operand 239 states and 249 transitions. Second operand has 104 states, 104 states have (on average 2.2884615384615383) internal successors, (238), 104 states have internal predecessors, (238), 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) [2021-12-17 10:11:09,042 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-17 10:11:09,043 INFO L93 Difference]: Finished difference Result 9779 states and 10239 transitions. [2021-12-17 10:11:09,043 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 104 states. [2021-12-17 10:11:09,043 INFO L78 Accepts]: Start accepts. Automaton has has 104 states, 104 states have (on average 2.2884615384615383) internal successors, (238), 104 states have internal predecessors, (238), 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 238 [2021-12-17 10:11:09,045 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-17 10:11:09,045 INFO L225 Difference]: With dead ends: 9779 [2021-12-17 10:11:09,045 INFO L226 Difference]: Without dead ends: 0 [2021-12-17 10:11:09,056 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 342 GetRequests, 237 SyntacticMatches, 0 SemanticMatches, 105 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 397 ImplicationChecksByTransitivity, 2.9s TimeCoverageRelationStatistics Valid=5366, Invalid=5976, Unknown=0, NotChecked=0, Total=11342 [2021-12-17 10:11:09,057 INFO L933 BasicCegarLoop]: 379 mSDtfsCounter, 260 mSDsluCounter, 2477 mSDsCounter, 0 mSdLazyCounter, 786 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 260 SdHoareTripleChecker+Valid, 2856 SdHoareTripleChecker+Invalid, 787 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 786 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2021-12-17 10:11:09,057 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [260 Valid, 2856 Invalid, 787 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 786 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2021-12-17 10:11:09,057 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2021-12-17 10:11:09,057 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2021-12-17 10:11:09,059 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) [2021-12-17 10:11:09,060 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2021-12-17 10:11:09,060 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 238 [2021-12-17 10:11:09,060 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-17 10:11:09,060 INFO L470 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2021-12-17 10:11:09,060 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 104 states, 104 states have (on average 2.2884615384615383) internal successors, (238), 104 states have internal predecessors, (238), 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) [2021-12-17 10:11:09,060 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2021-12-17 10:11:09,061 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2021-12-17 10:11:09,062 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2021-12-17 10:11:09,081 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2021-12-17 10:11:09,279 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-17 10:11:09,281 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2021-12-17 10:16:43,552 WARN L227 SmtUtils]: Spent 5.57m on a formula simplification. DAG size of input: 4895 DAG size of output: 4893 (called from [L 182] de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.HoareAnnotationComposer.or) [2021-12-17 10:23:29,554 WARN L227 SmtUtils]: Spent 6.75m on a formula simplification. DAG size of input: 4893 DAG size of output: 348 (called from [L 149] de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.HoareAnnotationComposer.combineInter) [2021-12-17 10:23:34,290 INFO L858 garLoopResultBuilder]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2021-12-17 10:23:34,290 INFO L858 garLoopResultBuilder]: For program point L29(line 29) no Hoare annotation was computed. [2021-12-17 10:23:34,290 INFO L858 garLoopResultBuilder]: For program point L31-2(lines 31 35) no Hoare annotation was computed. [2021-12-17 10:23:34,291 INFO L854 garLoopResultBuilder]: At program point L31-3(lines 31 35) the Hoare annotation is: (let ((.cse0 (<= 10 |ULTIMATE.start_main_~m~0#1|)) (.cse1 (<= 10 |ULTIMATE.start_main_~n~0#1|))) (or (and (<= |ULTIMATE.start_main_~i~0#1| 3) .cse0 .cse1 (<= 30 |ULTIMATE.start_main_~k~0#1|)) (and (<= 40 |ULTIMATE.start_main_~k~0#1|) (<= |ULTIMATE.start_main_~i~0#1| 4) .cse0 .cse1) (and (<= 10 |ULTIMATE.start_main_~k~0#1|) (<= |ULTIMATE.start_main_~i~0#1| 1) .cse0 .cse1) (and (< (+ |ULTIMATE.start_main_~i~0#1| 2) |ULTIMATE.start_main_~n~0#1|) (<= 70 |ULTIMATE.start_main_~k~0#1|) .cse0 .cse1) (and .cse0 (<= 100 |ULTIMATE.start_main_~k~0#1|) .cse1) (and (<= 80 |ULTIMATE.start_main_~k~0#1|) (< (+ |ULTIMATE.start_main_~i~0#1| 1) |ULTIMATE.start_main_~n~0#1|) .cse0 .cse1) (and (<= 60 |ULTIMATE.start_main_~k~0#1|) (< (+ |ULTIMATE.start_main_~i~0#1| 3) |ULTIMATE.start_main_~n~0#1|) .cse0 .cse1) (and (<= |ULTIMATE.start_main_~i~0#1| 2) .cse0 .cse1 (<= 20 |ULTIMATE.start_main_~k~0#1|)) (and (< (+ |ULTIMATE.start_main_~i~0#1| 4) |ULTIMATE.start_main_~n~0#1|) (<= 50 |ULTIMATE.start_main_~k~0#1|) .cse0 .cse1) (and (<= 0 |ULTIMATE.start_main_~k~0#1|) (= |ULTIMATE.start_main_~i~0#1| 0) .cse0 .cse1) (and (<= 90 |ULTIMATE.start_main_~k~0#1|) .cse0 .cse1 (< |ULTIMATE.start_main_~i~0#1| |ULTIMATE.start_main_~n~0#1|)))) [2021-12-17 10:23:34,292 INFO L858 garLoopResultBuilder]: For program point L31-4(lines 31 35) no Hoare annotation was computed. [2021-12-17 10:23:34,292 INFO L858 garLoopResultBuilder]: For program point L19(line 19) no Hoare annotation was computed. [2021-12-17 10:23:34,292 INFO L858 garLoopResultBuilder]: For program point L-1(line -1) no Hoare annotation was computed. [2021-12-17 10:23:34,292 INFO L858 garLoopResultBuilder]: For program point L30(line 30) no Hoare annotation was computed. [2021-12-17 10:23:34,292 INFO L858 garLoopResultBuilder]: For program point L32-2(lines 32 34) no Hoare annotation was computed. [2021-12-17 10:23:34,292 INFO L858 garLoopResultBuilder]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2021-12-17 10:23:34,293 INFO L854 garLoopResultBuilder]: At program point L32-3(lines 32 34) the Hoare annotation is: (let ((.cse23 (<= 90 |ULTIMATE.start_main_~k~0#1|)) (.cse22 (<= 60 |ULTIMATE.start_main_~k~0#1|)) (.cse10 (<= 70 |ULTIMATE.start_main_~k~0#1|)) (.cse17 (<= 80 |ULTIMATE.start_main_~k~0#1|)) (.cse26 (<= 50 |ULTIMATE.start_main_~k~0#1|)) (.cse9 (= |ULTIMATE.start_main_~j~0#1| 0)) (.cse15 (< |ULTIMATE.start_main_~j~0#1| |ULTIMATE.start_main_~m~0#1|)) (.cse0 (< (+ |ULTIMATE.start_main_~i~0#1| 2) |ULTIMATE.start_main_~n~0#1|)) (.cse14 (< (+ |ULTIMATE.start_main_~i~0#1| 3) |ULTIMATE.start_main_~n~0#1|)) (.cse27 (<= 40 |ULTIMATE.start_main_~k~0#1|)) (.cse30 (<= 20 |ULTIMATE.start_main_~k~0#1|)) (.cse7 (< (+ |ULTIMATE.start_main_~j~0#1| 4) |ULTIMATE.start_main_~m~0#1|)) (.cse25 (<= |ULTIMATE.start_main_~j~0#1| 3)) (.cse12 (<= |ULTIMATE.start_main_~i~0#1| 3)) (.cse1 (< (+ |ULTIMATE.start_main_~j~0#1| 3) |ULTIMATE.start_main_~m~0#1|)) (.cse28 (<= 10 |ULTIMATE.start_main_~k~0#1|)) (.cse8 (= |ULTIMATE.start_main_~i~0#1| 0)) (.cse19 (< (+ |ULTIMATE.start_main_~i~0#1| 4) |ULTIMATE.start_main_~n~0#1|)) (.cse29 (<= 30 |ULTIMATE.start_main_~k~0#1|)) (.cse18 (< (+ |ULTIMATE.start_main_~j~0#1| 2) |ULTIMATE.start_main_~m~0#1|)) (.cse11 (<= |ULTIMATE.start_main_~i~0#1| 1)) (.cse21 (<= |ULTIMATE.start_main_~j~0#1| 4)) (.cse24 (<= |ULTIMATE.start_main_~i~0#1| 4)) (.cse4 (< (+ |ULTIMATE.start_main_~j~0#1| 1) |ULTIMATE.start_main_~m~0#1|)) (.cse20 (< |ULTIMATE.start_main_~i~0#1| |ULTIMATE.start_main_~n~0#1|)) (.cse16 (<= |ULTIMATE.start_main_~j~0#1| 1)) (.cse6 (<= |ULTIMATE.start_main_~i~0#1| 2)) (.cse5 (< (+ |ULTIMATE.start_main_~i~0#1| 1) |ULTIMATE.start_main_~n~0#1|)) (.cse2 (<= 10 |ULTIMATE.start_main_~m~0#1|)) (.cse13 (<= |ULTIMATE.start_main_~j~0#1| 2)) (.cse3 (<= 10 |ULTIMATE.start_main_~n~0#1|))) (or (and .cse0 (<= 76 |ULTIMATE.start_main_~k~0#1|) .cse1 .cse2 .cse3) (and .cse4 (<= 88 |ULTIMATE.start_main_~k~0#1|) .cse5 .cse2 .cse3) (and (<= 25 |ULTIMATE.start_main_~k~0#1|) .cse6 .cse7 .cse2 .cse3) (and (<= 6 |ULTIMATE.start_main_~k~0#1|) .cse1 .cse8 .cse2 .cse3) (and .cse0 .cse9 .cse10 .cse2 .cse3) (and .cse7 .cse11 (<= 15 |ULTIMATE.start_main_~k~0#1|) .cse2 .cse3) (and .cse12 .cse1 .cse2 .cse3 (<= 36 |ULTIMATE.start_main_~k~0#1|)) (and .cse0 (<= 72 |ULTIMATE.start_main_~k~0#1|) .cse2 .cse13 .cse3) (and (<= 66 |ULTIMATE.start_main_~k~0#1|) .cse1 .cse14 .cse2 .cse3) (and .cse0 (<= 79 |ULTIMATE.start_main_~k~0#1|) .cse15 .cse2 .cse3) (and .cse16 (<= 1 |ULTIMATE.start_main_~k~0#1|) .cse8 .cse2 .cse3) (and .cse4 .cse12 (<= 38 |ULTIMATE.start_main_~k~0#1|) .cse2 .cse3) (and .cse9 .cse17 .cse5 .cse2 .cse3) (and .cse18 (<= 7 |ULTIMATE.start_main_~k~0#1|) .cse8 .cse2 .cse3) (and .cse19 (<= 59 |ULTIMATE.start_main_~k~0#1|) .cse15 .cse2 .cse3) (and (<= 29 |ULTIMATE.start_main_~k~0#1|) .cse15 .cse6 .cse2 .cse3) (and .cse18 .cse19 .cse2 (<= 57 |ULTIMATE.start_main_~k~0#1|) .cse3) (and .cse18 .cse2 .cse3 (<= 97 |ULTIMATE.start_main_~k~0#1|) .cse20) (and .cse16 (<= 91 |ULTIMATE.start_main_~k~0#1|) .cse2 .cse3 .cse20) (and .cse6 .cse21 .cse2 .cse3 (<= 24 |ULTIMATE.start_main_~k~0#1|)) (and .cse18 .cse12 .cse2 .cse3 (<= 37 |ULTIMATE.start_main_~k~0#1|)) (and .cse9 .cse22 .cse14 .cse2 .cse3) (and .cse16 (<= 11 |ULTIMATE.start_main_~k~0#1|) .cse11 .cse2 .cse3) (and .cse18 (<= 27 |ULTIMATE.start_main_~k~0#1|) .cse6 .cse2 .cse3) (and .cse19 (<= 56 |ULTIMATE.start_main_~k~0#1|) .cse1 .cse2 .cse3) (and .cse4 .cse0 (<= 78 |ULTIMATE.start_main_~k~0#1|) .cse2 .cse3) (and .cse0 (<= 75 |ULTIMATE.start_main_~k~0#1|) .cse7 .cse2 .cse3) (and .cse15 .cse11 (<= 19 |ULTIMATE.start_main_~k~0#1|) .cse2 .cse3) (and .cse9 .cse23 .cse2 .cse3 .cse20) (and (<= 9 |ULTIMATE.start_main_~k~0#1|) .cse15 .cse8 .cse2 .cse3) (and .cse5 .cse23 .cse2 .cse3) (and .cse12 (<= 32 |ULTIMATE.start_main_~k~0#1|) .cse2 .cse13 .cse3) (and .cse9 (<= 0 |ULTIMATE.start_main_~k~0#1|) .cse8 .cse2 .cse3) (and .cse19 .cse22 .cse2 .cse3) (and .cse16 (<= 41 |ULTIMATE.start_main_~k~0#1|) .cse24 .cse2 .cse3) (and .cse5 .cse2 .cse25 (<= 83 |ULTIMATE.start_main_~k~0#1|) .cse3) (and .cse18 (<= 47 |ULTIMATE.start_main_~k~0#1|) .cse24 .cse2 .cse3) (and .cse11 .cse2 (<= 13 |ULTIMATE.start_main_~k~0#1|) .cse25 .cse3) (and .cse10 .cse14 .cse2 .cse3) (and .cse16 .cse0 (<= 71 |ULTIMATE.start_main_~k~0#1|) .cse2 .cse3) (and .cse0 .cse2 .cse25 .cse3 (<= 73 |ULTIMATE.start_main_~k~0#1|)) (and .cse16 (<= 61 |ULTIMATE.start_main_~k~0#1|) .cse14 .cse2 .cse3) (and .cse26 .cse24 .cse2 .cse3) (and .cse18 .cse0 (<= 77 |ULTIMATE.start_main_~k~0#1|) .cse2 .cse3) (and (<= 84 |ULTIMATE.start_main_~k~0#1|) .cse5 .cse21 .cse2 .cse3) (and .cse4 .cse19 (<= 58 |ULTIMATE.start_main_~k~0#1|) .cse2 .cse3) (and (<= 85 |ULTIMATE.start_main_~k~0#1|) .cse5 .cse7 .cse2 .cse3) (and (<= 26 |ULTIMATE.start_main_~k~0#1|) .cse6 .cse1 .cse2 .cse3) (and .cse4 (<= 68 |ULTIMATE.start_main_~k~0#1|) .cse14 .cse2 .cse3) (and (<= 16 |ULTIMATE.start_main_~k~0#1|) .cse1 .cse11 .cse2 .cse3) (and .cse8 (<= 3 |ULTIMATE.start_main_~k~0#1|) .cse2 .cse25 .cse3) (and (<= 94 |ULTIMATE.start_main_~k~0#1|) .cse21 .cse2 .cse3 .cse20) (and .cse15 (<= 69 |ULTIMATE.start_main_~k~0#1|) .cse14 .cse2 .cse3) (and .cse9 .cse27 .cse24 .cse2 .cse3) (and .cse12 (<= 33 |ULTIMATE.start_main_~k~0#1|) .cse2 .cse25 .cse3) (and (<= 4 |ULTIMATE.start_main_~k~0#1|) .cse21 .cse8 .cse2 .cse3) (and .cse2 .cse13 (<= 92 |ULTIMATE.start_main_~k~0#1|) .cse3 .cse20) (and .cse9 .cse28 .cse11 .cse2 .cse3) (and (<= 45 |ULTIMATE.start_main_~k~0#1|) .cse24 .cse7 .cse2 .cse3) (and .cse0 .cse17 .cse2 .cse3) (and .cse21 (<= 64 |ULTIMATE.start_main_~k~0#1|) .cse14 .cse2 .cse3) (and .cse12 .cse9 .cse2 .cse3 .cse29) (and .cse12 (<= 35 |ULTIMATE.start_main_~k~0#1|) .cse7 .cse2 .cse3) (and (<= 63 |ULTIMATE.start_main_~k~0#1|) .cse14 .cse2 .cse25 .cse3) (and (<= 96 |ULTIMATE.start_main_~k~0#1|) .cse1 .cse2 .cse3 .cse20) (and (<= 95 |ULTIMATE.start_main_~k~0#1|) .cse7 .cse2 .cse3 .cse20) (and .cse14 .cse2 .cse13 .cse3 (<= 62 |ULTIMATE.start_main_~k~0#1|)) (and (<= 53 |ULTIMATE.start_main_~k~0#1|) .cse19 .cse2 .cse25 .cse3) (and .cse16 (<= 51 |ULTIMATE.start_main_~k~0#1|) .cse19 .cse2 .cse3) (and .cse18 (<= 87 |ULTIMATE.start_main_~k~0#1|) .cse5 .cse2 .cse3) (and .cse12 (<= 39 |ULTIMATE.start_main_~k~0#1|) .cse15 .cse2 .cse3) (and .cse9 .cse26 .cse19 .cse2 .cse3) (and .cse9 .cse6 .cse2 .cse3 .cse30) (and (<= 49 |ULTIMATE.start_main_~k~0#1|) .cse15 .cse24 .cse2 .cse3) (and (<= 22 |ULTIMATE.start_main_~k~0#1|) .cse6 .cse2 .cse13 .cse3) (and (<= 89 |ULTIMATE.start_main_~k~0#1|) .cse15 .cse5 .cse2 .cse3) (and .cse12 (<= 34 |ULTIMATE.start_main_~k~0#1|) .cse21 .cse2 .cse3) (and .cse18 (<= 67 |ULTIMATE.start_main_~k~0#1|) .cse14 .cse2 .cse3) (and .cse24 .cse2 .cse13 (<= 42 |ULTIMATE.start_main_~k~0#1|) .cse3) (and .cse4 (<= 28 |ULTIMATE.start_main_~k~0#1|) .cse6 .cse2 .cse3) (and .cse2 (<= 100 |ULTIMATE.start_main_~k~0#1|) .cse3 .cse20) (and .cse4 .cse11 .cse2 .cse3 (<= 18 |ULTIMATE.start_main_~k~0#1|)) (and (<= 5 |ULTIMATE.start_main_~k~0#1|) .cse7 .cse8 .cse2 .cse3) (and .cse15 (<= 99 |ULTIMATE.start_main_~k~0#1|) .cse2 .cse3 .cse20) (and (<= 23 |ULTIMATE.start_main_~k~0#1|) .cse6 .cse2 .cse25 .cse3) (and .cse4 (<= 8 |ULTIMATE.start_main_~k~0#1|) .cse8 .cse2 .cse3) (and .cse0 (<= 74 |ULTIMATE.start_main_~k~0#1|) .cse21 .cse2 .cse3) (and (<= 14 |ULTIMATE.start_main_~k~0#1|) .cse21 .cse11 .cse2 .cse3) (and .cse7 (<= 65 |ULTIMATE.start_main_~k~0#1|) .cse14 .cse2 .cse3) (and .cse12 .cse27 .cse2 .cse3) (and .cse16 (<= 81 |ULTIMATE.start_main_~k~0#1|) .cse5 .cse2 .cse3) (and (<= 12 |ULTIMATE.start_main_~k~0#1|) .cse11 .cse2 .cse13 .cse3) (and (<= 86 |ULTIMATE.start_main_~k~0#1|) .cse5 .cse1 .cse2 .cse3) (and (<= 2 |ULTIMATE.start_main_~k~0#1|) .cse8 .cse2 .cse13 .cse3) (and .cse11 .cse2 .cse3 .cse30) (and .cse24 .cse2 (<= 43 |ULTIMATE.start_main_~k~0#1|) .cse25 .cse3) (and (<= 55 |ULTIMATE.start_main_~k~0#1|) .cse19 .cse7 .cse2 .cse3) (and (<= 93 |ULTIMATE.start_main_~k~0#1|) .cse2 .cse25 .cse3 .cse20) (and .cse16 .cse12 (<= 31 |ULTIMATE.start_main_~k~0#1|) .cse2 .cse3) (and .cse24 .cse1 .cse2 (<= 46 |ULTIMATE.start_main_~k~0#1|) .cse3) (and .cse19 .cse21 .cse2 (<= 54 |ULTIMATE.start_main_~k~0#1|) .cse3) (and .cse28 .cse8 .cse2 .cse3) (and .cse19 (<= 52 |ULTIMATE.start_main_~k~0#1|) .cse2 .cse13 .cse3) (and .cse6 .cse2 .cse3 .cse29) (and .cse18 (<= 17 |ULTIMATE.start_main_~k~0#1|) .cse11 .cse2 .cse3) (and .cse24 .cse21 .cse2 .cse3 (<= 44 |ULTIMATE.start_main_~k~0#1|)) (and .cse4 .cse24 (<= 48 |ULTIMATE.start_main_~k~0#1|) .cse2 .cse3) (and .cse4 (<= 98 |ULTIMATE.start_main_~k~0#1|) .cse2 .cse3 .cse20) (and .cse16 (<= 21 |ULTIMATE.start_main_~k~0#1|) .cse6 .cse2 .cse3) (and .cse5 (<= 82 |ULTIMATE.start_main_~k~0#1|) .cse2 .cse13 .cse3))) [2021-12-17 10:23:34,293 INFO L858 garLoopResultBuilder]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2021-12-17 10:23:34,293 INFO L858 garLoopResultBuilder]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 19) no Hoare annotation was computed. [2021-12-17 10:23:34,293 INFO L858 garLoopResultBuilder]: For program point L18(lines 18 20) no Hoare annotation was computed. [2021-12-17 10:23:34,293 INFO L854 garLoopResultBuilder]: At program point L18-2(lines 17 22) the Hoare annotation is: (<= 10 |ULTIMATE.start_main_~n~0#1|) [2021-12-17 10:23:34,293 INFO L861 garLoopResultBuilder]: At program point L37(lines 24 38) the Hoare annotation is: true [2021-12-17 10:23:34,297 INFO L732 BasicCegarLoop]: Path program histogram: [5, 1, 1] [2021-12-17 10:23:34,298 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2021-12-17 10:23:34,333 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 17.12 10:23:34 BoogieIcfgContainer [2021-12-17 10:23:34,334 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2021-12-17 10:23:34,335 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2021-12-17 10:23:34,335 INFO L271 PluginConnector]: Initializing Witness Printer... [2021-12-17 10:23:34,335 INFO L275 PluginConnector]: Witness Printer initialized [2021-12-17 10:23:34,335 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 17.12 10:11:01" (3/4) ... [2021-12-17 10:23:34,337 INFO L137 WitnessPrinter]: Generating witness for correct program [2021-12-17 10:23:34,343 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 10 nodes and edges [2021-12-17 10:23:34,343 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2021-12-17 10:23:34,343 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2021-12-17 10:23:34,344 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2021-12-17 10:23:34,367 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2021-12-17 10:23:34,367 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2021-12-17 10:23:34,367 INFO L158 Benchmark]: Toolchain (without parser) took 753793.65ms. Allocated memory was 111.1MB in the beginning and 975.2MB in the end (delta: 864.0MB). Free memory was 80.5MB in the beginning and 468.2MB in the end (delta: -387.7MB). Peak memory consumption was 476.7MB. Max. memory is 16.1GB. [2021-12-17 10:23:34,368 INFO L158 Benchmark]: CDTParser took 0.15ms. Allocated memory is still 77.6MB. Free memory was 35.3MB in the beginning and 35.3MB in the end (delta: 69.9kB). There was no memory consumed. Max. memory is 16.1GB. [2021-12-17 10:23:34,368 INFO L158 Benchmark]: CACSL2BoogieTranslator took 209.65ms. Allocated memory is still 111.1MB. Free memory was 80.3MB in the beginning and 87.2MB in the end (delta: -6.9MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2021-12-17 10:23:34,368 INFO L158 Benchmark]: Boogie Procedure Inliner took 24.65ms. Allocated memory is still 111.1MB. Free memory was 87.2MB in the beginning and 85.9MB in the end (delta: 1.3MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2021-12-17 10:23:34,368 INFO L158 Benchmark]: Boogie Preprocessor took 29.50ms. Allocated memory is still 111.1MB. Free memory was 85.9MB in the beginning and 84.7MB in the end (delta: 1.2MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2021-12-17 10:23:34,368 INFO L158 Benchmark]: RCFGBuilder took 245.55ms. Allocated memory is still 111.1MB. Free memory was 84.7MB in the beginning and 75.4MB in the end (delta: 9.3MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2021-12-17 10:23:34,369 INFO L158 Benchmark]: TraceAbstraction took 753245.91ms. Allocated memory was 111.1MB in the beginning and 975.2MB in the end (delta: 864.0MB). Free memory was 75.0MB in the beginning and 472.4MB in the end (delta: -397.4MB). Peak memory consumption was 597.3MB. Max. memory is 16.1GB. [2021-12-17 10:23:34,369 INFO L158 Benchmark]: Witness Printer took 32.30ms. Allocated memory is still 975.2MB. Free memory was 472.4MB in the beginning and 468.2MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2021-12-17 10:23:34,370 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.15ms. Allocated memory is still 77.6MB. Free memory was 35.3MB in the beginning and 35.3MB in the end (delta: 69.9kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 209.65ms. Allocated memory is still 111.1MB. Free memory was 80.3MB in the beginning and 87.2MB in the end (delta: -6.9MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 24.65ms. Allocated memory is still 111.1MB. Free memory was 87.2MB in the beginning and 85.9MB in the end (delta: 1.3MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 29.50ms. Allocated memory is still 111.1MB. Free memory was 85.9MB in the beginning and 84.7MB in the end (delta: 1.2MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 245.55ms. Allocated memory is still 111.1MB. Free memory was 84.7MB in the beginning and 75.4MB in the end (delta: 9.3MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * TraceAbstraction took 753245.91ms. Allocated memory was 111.1MB in the beginning and 975.2MB in the end (delta: 864.0MB). Free memory was 75.0MB in the beginning and 472.4MB in the end (delta: -397.4MB). Peak memory consumption was 597.3MB. Max. memory is 16.1GB. * Witness Printer took 32.30ms. Allocated memory is still 975.2MB. Free memory was 472.4MB in the beginning and 468.2MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. 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: 19]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 16 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 753.2s, OverallIterations: 7, TraceHistogramMax: 100, PathProgramHistogramMax: 5, EmptinessCheckTime: 0.0s, AutomataDifference: 1.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 745.0s, InitialAbstractionConstructionTime: 0.0s, PartialOrderReductionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 575 SdHoareTripleChecker+Valid, 0.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 575 mSDsluCounter, 3049 SdHoareTripleChecker+Invalid, 0.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 2602 mSDsCounter, 88 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 913 IncrementalHoareTripleChecker+Invalid, 1001 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 88 mSolverCounterUnsat, 447 mSDtfsCounter, 913 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 708 GetRequests, 535 SyntacticMatches, 0 SemanticMatches, 173 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 761 ImplicationChecksByTransitivity, 3.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=239occurred in iteration=6, InterpolantAutomatonStates: 152, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 7 MinimizatonAttempts, 4 StatesRemovedByMinimization, 2 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 4 LocationsWithAnnotation, 4 PreInvPairs, 5123 NumberOfFragments, 2052 HoareAnnotationTreeSize, 4 FomulaSimplifications, 55297 FormulaSimplificationTreeSizeReduction, 335.3s HoareSimplificationTime, 4 FomulaSimplificationsInter, 95605 FormulaSimplificationTreeSizeReductionInter, 409.7s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 5.0s InterpolantComputationTime, 821 NumberOfCodeBlocks, 801 NumberOfCodeBlocksAsserted, 95 NumberOfCheckSat, 968 ConstructedInterpolants, 0 QuantifiedInterpolants, 3847 SizeOfPredicates, 10 NumberOfNonLiveVariables, 1032 ConjunctsInSsa, 126 ConjunctsInUnsatCore, 16 InterpolantComputations, 3 PerfectInterpolantSequences, 23478/27677 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: 17]: Loop Invariant Derived loop invariant: 10 <= n - InvariantResult [Line: 32]: Loop Invariant Derived loop invariant: ((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((i + 2 < n && 76 <= k) && j + 3 < m) && 10 <= m) && 10 <= n) || ((((j + 1 < m && 88 <= k) && i + 1 < n) && 10 <= m) && 10 <= n)) || ((((25 <= k && i <= 2) && j + 4 < m) && 10 <= m) && 10 <= n)) || ((((6 <= k && j + 3 < m) && i == 0) && 10 <= m) && 10 <= n)) || ((((i + 2 < n && j == 0) && 70 <= k) && 10 <= m) && 10 <= n)) || ((((j + 4 < m && i <= 1) && 15 <= k) && 10 <= m) && 10 <= n)) || ((((i <= 3 && j + 3 < m) && 10 <= m) && 10 <= n) && 36 <= k)) || ((((i + 2 < n && 72 <= k) && 10 <= m) && j <= 2) && 10 <= n)) || ((((66 <= k && j + 3 < m) && i + 3 < n) && 10 <= m) && 10 <= n)) || ((((i + 2 < n && 79 <= k) && j < m) && 10 <= m) && 10 <= n)) || ((((j <= 1 && 1 <= k) && i == 0) && 10 <= m) && 10 <= n)) || ((((j + 1 < m && i <= 3) && 38 <= k) && 10 <= m) && 10 <= n)) || ((((j == 0 && 80 <= k) && i + 1 < n) && 10 <= m) && 10 <= n)) || ((((j + 2 < m && 7 <= k) && i == 0) && 10 <= m) && 10 <= n)) || ((((i + 4 < n && 59 <= k) && j < m) && 10 <= m) && 10 <= n)) || ((((29 <= k && j < m) && i <= 2) && 10 <= m) && 10 <= n)) || ((((j + 2 < m && i + 4 < n) && 10 <= m) && 57 <= k) && 10 <= n)) || ((((j + 2 < m && 10 <= m) && 10 <= n) && 97 <= k) && i < n)) || ((((j <= 1 && 91 <= k) && 10 <= m) && 10 <= n) && i < n)) || ((((i <= 2 && j <= 4) && 10 <= m) && 10 <= n) && 24 <= k)) || ((((j + 2 < m && i <= 3) && 10 <= m) && 10 <= n) && 37 <= k)) || ((((j == 0 && 60 <= k) && i + 3 < n) && 10 <= m) && 10 <= n)) || ((((j <= 1 && 11 <= k) && i <= 1) && 10 <= m) && 10 <= n)) || ((((j + 2 < m && 27 <= k) && i <= 2) && 10 <= m) && 10 <= n)) || ((((i + 4 < n && 56 <= k) && j + 3 < m) && 10 <= m) && 10 <= n)) || ((((j + 1 < m && i + 2 < n) && 78 <= k) && 10 <= m) && 10 <= n)) || ((((i + 2 < n && 75 <= k) && j + 4 < m) && 10 <= m) && 10 <= n)) || ((((j < m && i <= 1) && 19 <= k) && 10 <= m) && 10 <= n)) || ((((j == 0 && 90 <= k) && 10 <= m) && 10 <= n) && i < n)) || ((((9 <= k && j < m) && i == 0) && 10 <= m) && 10 <= n)) || (((i + 1 < n && 90 <= k) && 10 <= m) && 10 <= n)) || ((((i <= 3 && 32 <= k) && 10 <= m) && j <= 2) && 10 <= n)) || ((((j == 0 && 0 <= k) && i == 0) && 10 <= m) && 10 <= n)) || (((i + 4 < n && 60 <= k) && 10 <= m) && 10 <= n)) || ((((j <= 1 && 41 <= k) && i <= 4) && 10 <= m) && 10 <= n)) || ((((i + 1 < n && 10 <= m) && j <= 3) && 83 <= k) && 10 <= n)) || ((((j + 2 < m && 47 <= k) && i <= 4) && 10 <= m) && 10 <= n)) || ((((i <= 1 && 10 <= m) && 13 <= k) && j <= 3) && 10 <= n)) || (((70 <= k && i + 3 < n) && 10 <= m) && 10 <= n)) || ((((j <= 1 && i + 2 < n) && 71 <= k) && 10 <= m) && 10 <= n)) || ((((i + 2 < n && 10 <= m) && j <= 3) && 10 <= n) && 73 <= k)) || ((((j <= 1 && 61 <= k) && i + 3 < n) && 10 <= m) && 10 <= n)) || (((50 <= k && i <= 4) && 10 <= m) && 10 <= n)) || ((((j + 2 < m && i + 2 < n) && 77 <= k) && 10 <= m) && 10 <= n)) || ((((84 <= k && i + 1 < n) && j <= 4) && 10 <= m) && 10 <= n)) || ((((j + 1 < m && i + 4 < n) && 58 <= k) && 10 <= m) && 10 <= n)) || ((((85 <= k && i + 1 < n) && j + 4 < m) && 10 <= m) && 10 <= n)) || ((((26 <= k && i <= 2) && j + 3 < m) && 10 <= m) && 10 <= n)) || ((((j + 1 < m && 68 <= k) && i + 3 < n) && 10 <= m) && 10 <= n)) || ((((16 <= k && j + 3 < m) && i <= 1) && 10 <= m) && 10 <= n)) || ((((i == 0 && 3 <= k) && 10 <= m) && j <= 3) && 10 <= n)) || ((((94 <= k && j <= 4) && 10 <= m) && 10 <= n) && i < n)) || ((((j < m && 69 <= k) && i + 3 < n) && 10 <= m) && 10 <= n)) || ((((j == 0 && 40 <= k) && i <= 4) && 10 <= m) && 10 <= n)) || ((((i <= 3 && 33 <= k) && 10 <= m) && j <= 3) && 10 <= n)) || ((((4 <= k && j <= 4) && i == 0) && 10 <= m) && 10 <= n)) || ((((10 <= m && j <= 2) && 92 <= k) && 10 <= n) && i < n)) || ((((j == 0 && 10 <= k) && i <= 1) && 10 <= m) && 10 <= n)) || ((((45 <= k && i <= 4) && j + 4 < m) && 10 <= m) && 10 <= n)) || (((i + 2 < n && 80 <= k) && 10 <= m) && 10 <= n)) || ((((j <= 4 && 64 <= k) && i + 3 < n) && 10 <= m) && 10 <= n)) || ((((i <= 3 && j == 0) && 10 <= m) && 10 <= n) && 30 <= k)) || ((((i <= 3 && 35 <= k) && j + 4 < m) && 10 <= m) && 10 <= n)) || ((((63 <= k && i + 3 < n) && 10 <= m) && j <= 3) && 10 <= n)) || ((((96 <= k && j + 3 < m) && 10 <= m) && 10 <= n) && i < n)) || ((((95 <= k && j + 4 < m) && 10 <= m) && 10 <= n) && i < n)) || ((((i + 3 < n && 10 <= m) && j <= 2) && 10 <= n) && 62 <= k)) || ((((53 <= k && i + 4 < n) && 10 <= m) && j <= 3) && 10 <= n)) || ((((j <= 1 && 51 <= k) && i + 4 < n) && 10 <= m) && 10 <= n)) || ((((j + 2 < m && 87 <= k) && i + 1 < n) && 10 <= m) && 10 <= n)) || ((((i <= 3 && 39 <= k) && j < m) && 10 <= m) && 10 <= n)) || ((((j == 0 && 50 <= k) && i + 4 < n) && 10 <= m) && 10 <= n)) || ((((j == 0 && i <= 2) && 10 <= m) && 10 <= n) && 20 <= k)) || ((((49 <= k && j < m) && i <= 4) && 10 <= m) && 10 <= n)) || ((((22 <= k && i <= 2) && 10 <= m) && j <= 2) && 10 <= n)) || ((((89 <= k && j < m) && i + 1 < n) && 10 <= m) && 10 <= n)) || ((((i <= 3 && 34 <= k) && j <= 4) && 10 <= m) && 10 <= n)) || ((((j + 2 < m && 67 <= k) && i + 3 < n) && 10 <= m) && 10 <= n)) || ((((i <= 4 && 10 <= m) && j <= 2) && 42 <= k) && 10 <= n)) || ((((j + 1 < m && 28 <= k) && i <= 2) && 10 <= m) && 10 <= n)) || (((10 <= m && 100 <= k) && 10 <= n) && i < n)) || ((((j + 1 < m && i <= 1) && 10 <= m) && 10 <= n) && 18 <= k)) || ((((5 <= k && j + 4 < m) && i == 0) && 10 <= m) && 10 <= n)) || ((((j < m && 99 <= k) && 10 <= m) && 10 <= n) && i < n)) || ((((23 <= k && i <= 2) && 10 <= m) && j <= 3) && 10 <= n)) || ((((j + 1 < m && 8 <= k) && i == 0) && 10 <= m) && 10 <= n)) || ((((i + 2 < n && 74 <= k) && j <= 4) && 10 <= m) && 10 <= n)) || ((((14 <= k && j <= 4) && i <= 1) && 10 <= m) && 10 <= n)) || ((((j + 4 < m && 65 <= k) && i + 3 < n) && 10 <= m) && 10 <= n)) || (((i <= 3 && 40 <= k) && 10 <= m) && 10 <= n)) || ((((j <= 1 && 81 <= k) && i + 1 < n) && 10 <= m) && 10 <= n)) || ((((12 <= k && i <= 1) && 10 <= m) && j <= 2) && 10 <= n)) || ((((86 <= k && i + 1 < n) && j + 3 < m) && 10 <= m) && 10 <= n)) || ((((2 <= k && i == 0) && 10 <= m) && j <= 2) && 10 <= n)) || (((i <= 1 && 10 <= m) && 10 <= n) && 20 <= k)) || ((((i <= 4 && 10 <= m) && 43 <= k) && j <= 3) && 10 <= n)) || ((((55 <= k && i + 4 < n) && j + 4 < m) && 10 <= m) && 10 <= n)) || ((((93 <= k && 10 <= m) && j <= 3) && 10 <= n) && i < n)) || ((((j <= 1 && i <= 3) && 31 <= k) && 10 <= m) && 10 <= n)) || ((((i <= 4 && j + 3 < m) && 10 <= m) && 46 <= k) && 10 <= n)) || ((((i + 4 < n && j <= 4) && 10 <= m) && 54 <= k) && 10 <= n)) || (((10 <= k && i == 0) && 10 <= m) && 10 <= n)) || ((((i + 4 < n && 52 <= k) && 10 <= m) && j <= 2) && 10 <= n)) || (((i <= 2 && 10 <= m) && 10 <= n) && 30 <= k)) || ((((j + 2 < m && 17 <= k) && i <= 1) && 10 <= m) && 10 <= n)) || ((((i <= 4 && j <= 4) && 10 <= m) && 10 <= n) && 44 <= k)) || ((((j + 1 < m && i <= 4) && 48 <= k) && 10 <= m) && 10 <= n)) || ((((j + 1 < m && 98 <= k) && 10 <= m) && 10 <= n) && i < n)) || ((((j <= 1 && 21 <= k) && i <= 2) && 10 <= m) && 10 <= n)) || ((((i + 1 < n && 82 <= k) && 10 <= m) && j <= 2) && 10 <= n) - InvariantResult [Line: 24]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 31]: Loop Invariant Derived loop invariant: ((((((((((((i <= 3 && 10 <= m) && 10 <= n) && 30 <= k) || (((40 <= k && i <= 4) && 10 <= m) && 10 <= n)) || (((10 <= k && i <= 1) && 10 <= m) && 10 <= n)) || (((i + 2 < n && 70 <= k) && 10 <= m) && 10 <= n)) || ((10 <= m && 100 <= k) && 10 <= n)) || (((80 <= k && i + 1 < n) && 10 <= m) && 10 <= n)) || (((60 <= k && i + 3 < n) && 10 <= m) && 10 <= n)) || (((i <= 2 && 10 <= m) && 10 <= n) && 20 <= k)) || (((i + 4 < n && 50 <= k) && 10 <= m) && 10 <= n)) || (((0 <= k && i == 0) && 10 <= m) && 10 <= n)) || (((90 <= k && 10 <= m) && 10 <= n) && i < n) RESULT: Ultimate proved your program to be correct! [2021-12-17 10:23:34,435 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE