./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/loop-crafted/simple_array_index_value_4.i.v+nlh-reducer.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 20ed64ec 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-crafted/simple_array_index_value_4.i.v+nlh-reducer.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.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 8242c02a65c511b095f42030318aeef939254d04 ........................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................ Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.2.1-dev-20ed64e [2021-08-26 03:34:18,625 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-08-26 03:34:18,627 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-08-26 03:34:18,653 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-08-26 03:34:18,653 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-08-26 03:34:18,657 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-08-26 03:34:18,659 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-08-26 03:34:18,662 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-08-26 03:34:18,665 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-08-26 03:34:18,666 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-08-26 03:34:18,667 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-08-26 03:34:18,670 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-08-26 03:34:18,670 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-08-26 03:34:18,673 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-08-26 03:34:18,675 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-08-26 03:34:18,676 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-08-26 03:34:18,677 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-08-26 03:34:18,682 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-08-26 03:34:18,685 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-08-26 03:34:18,690 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-08-26 03:34:18,692 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-08-26 03:34:18,693 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-08-26 03:34:18,696 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-08-26 03:34:18,696 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-08-26 03:34:18,700 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-08-26 03:34:18,704 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-08-26 03:34:18,705 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-08-26 03:34:18,705 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-08-26 03:34:18,706 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-08-26 03:34:18,707 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-08-26 03:34:18,707 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-08-26 03:34:18,707 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-08-26 03:34:18,710 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-08-26 03:34:18,710 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-08-26 03:34:18,712 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-08-26 03:34:18,712 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-08-26 03:34:18,713 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-08-26 03:34:18,713 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-08-26 03:34:18,714 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-08-26 03:34:18,714 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-08-26 03:34:18,716 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-08-26 03:34:18,716 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2021-08-26 03:34:18,752 INFO L113 SettingsManager]: Loading preferences was successful [2021-08-26 03:34:18,757 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-08-26 03:34:18,758 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2021-08-26 03:34:18,758 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2021-08-26 03:34:18,759 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-08-26 03:34:18,759 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-08-26 03:34:18,760 INFO L138 SettingsManager]: * Use SBE=true [2021-08-26 03:34:18,760 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-08-26 03:34:18,760 INFO L138 SettingsManager]: * sizeof long=4 [2021-08-26 03:34:18,760 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-08-26 03:34:18,761 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-08-26 03:34:18,761 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-08-26 03:34:18,761 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-08-26 03:34:18,762 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-08-26 03:34:18,762 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-08-26 03:34:18,762 INFO L138 SettingsManager]: * sizeof long double=12 [2021-08-26 03:34:18,762 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-08-26 03:34:18,762 INFO L138 SettingsManager]: * Use constant arrays=true [2021-08-26 03:34:18,762 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-08-26 03:34:18,763 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-08-26 03:34:18,763 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-08-26 03:34:18,763 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-08-26 03:34:18,763 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-08-26 03:34:18,763 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-08-26 03:34:18,764 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-08-26 03:34:18,764 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-08-26 03:34:18,764 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-08-26 03:34:18,764 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-08-26 03:34:18,764 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2021-08-26 03:34:18,764 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-08-26 03:34:18,765 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 -> 8242c02a65c511b095f42030318aeef939254d04 [2021-08-26 03:34:19,015 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-08-26 03:34:19,039 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-08-26 03:34:19,041 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-08-26 03:34:19,043 INFO L271 PluginConnector]: Initializing CDTParser... [2021-08-26 03:34:19,044 INFO L275 PluginConnector]: CDTParser initialized [2021-08-26 03:34:19,044 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/loop-crafted/simple_array_index_value_4.i.v+nlh-reducer.c [2021-08-26 03:34:19,113 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4ef030da5/ca306b902a1b41e484177877f052ee16/FLAG1e6ebcd0c [2021-08-26 03:34:19,508 INFO L306 CDTParser]: Found 1 translation units. [2021-08-26 03:34:19,509 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/loop-crafted/simple_array_index_value_4.i.v+nlh-reducer.c [2021-08-26 03:34:19,514 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4ef030da5/ca306b902a1b41e484177877f052ee16/FLAG1e6ebcd0c [2021-08-26 03:34:19,525 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4ef030da5/ca306b902a1b41e484177877f052ee16 [2021-08-26 03:34:19,527 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-08-26 03:34:19,528 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-08-26 03:34:19,529 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-08-26 03:34:19,529 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-08-26 03:34:19,532 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-08-26 03:34:19,533 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.08 03:34:19" (1/1) ... [2021-08-26 03:34:19,534 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3d07fa1b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 03:34:19, skipping insertion in model container [2021-08-26 03:34:19,534 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.08 03:34:19" (1/1) ... [2021-08-26 03:34:19,539 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-08-26 03:34:19,553 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-08-26 03:34:19,659 WARN L228 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-crafted/simple_array_index_value_4.i.v+nlh-reducer.c[1126,1139] [2021-08-26 03:34:19,666 WARN L228 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-crafted/simple_array_index_value_4.i.v+nlh-reducer.c[1880,1893] [2021-08-26 03:34:19,669 WARN L228 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-crafted/simple_array_index_value_4.i.v+nlh-reducer.c[2415,2428] [2021-08-26 03:34:19,672 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-08-26 03:34:19,678 INFO L203 MainTranslator]: Completed pre-run [2021-08-26 03:34:19,690 WARN L228 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-crafted/simple_array_index_value_4.i.v+nlh-reducer.c[1126,1139] [2021-08-26 03:34:19,698 WARN L228 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-crafted/simple_array_index_value_4.i.v+nlh-reducer.c[1880,1893] [2021-08-26 03:34:19,707 WARN L228 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-crafted/simple_array_index_value_4.i.v+nlh-reducer.c[2415,2428] [2021-08-26 03:34:19,713 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-08-26 03:34:19,734 INFO L208 MainTranslator]: Completed translation [2021-08-26 03:34:19,735 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 03:34:19 WrapperNode [2021-08-26 03:34:19,735 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-08-26 03:34:19,737 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-08-26 03:34:19,737 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-08-26 03:34:19,737 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-08-26 03:34:19,743 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 03:34:19" (1/1) ... [2021-08-26 03:34:19,755 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 03:34:19" (1/1) ... [2021-08-26 03:34:19,798 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-08-26 03:34:19,800 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-08-26 03:34:19,800 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-08-26 03:34:19,800 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-08-26 03:34:19,806 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 03:34:19" (1/1) ... [2021-08-26 03:34:19,807 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 03:34:19" (1/1) ... [2021-08-26 03:34:19,811 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 03:34:19" (1/1) ... [2021-08-26 03:34:19,811 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 03:34:19" (1/1) ... [2021-08-26 03:34:19,827 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 03:34:19" (1/1) ... [2021-08-26 03:34:19,830 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 03:34:19" (1/1) ... [2021-08-26 03:34:19,834 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 03:34:19" (1/1) ... [2021-08-26 03:34:19,836 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-08-26 03:34:19,838 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-08-26 03:34:19,839 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-08-26 03:34:19,840 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-08-26 03:34:19,840 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 03:34:19" (1/1) ... [2021-08-26 03:34:19,846 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-08-26 03:34:19,852 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-26 03:34:19,866 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-08-26 03:34:19,890 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-08-26 03:34:19,907 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-08-26 03:34:19,907 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-08-26 03:34:19,908 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-08-26 03:34:19,908 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-08-26 03:34:19,908 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2021-08-26 03:34:19,908 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2021-08-26 03:34:20,279 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-08-26 03:34:20,288 INFO L299 CfgBuilder]: Removed 4 assume(true) statements. [2021-08-26 03:34:20,290 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.08 03:34:20 BoogieIcfgContainer [2021-08-26 03:34:20,290 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-08-26 03:34:20,292 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-08-26 03:34:20,292 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-08-26 03:34:20,294 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-08-26 03:34:20,294 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 26.08 03:34:19" (1/3) ... [2021-08-26 03:34:20,295 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7df7b05 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.08 03:34:20, skipping insertion in model container [2021-08-26 03:34:20,295 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 03:34:19" (2/3) ... [2021-08-26 03:34:20,296 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7df7b05 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.08 03:34:20, skipping insertion in model container [2021-08-26 03:34:20,296 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.08 03:34:20" (3/3) ... [2021-08-26 03:34:20,297 INFO L111 eAbstractionObserver]: Analyzing ICFG simple_array_index_value_4.i.v+nlh-reducer.c [2021-08-26 03:34:20,301 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-08-26 03:34:20,301 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 3 error locations. [2021-08-26 03:34:20,350 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2021-08-26 03:34:20,358 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, mConcurrency=FINITE_AUTOMATA, 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-08-26 03:34:20,358 INFO L340 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2021-08-26 03:34:20,368 INFO L276 IsEmpty]: Start isEmpty. Operand has 31 states, 27 states have (on average 1.6296296296296295) internal successors, (44), 30 states have internal predecessors, (44), 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-08-26 03:34:20,371 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2021-08-26 03:34:20,371 INFO L504 BasicCegarLoop]: Found error trace [2021-08-26 03:34:20,372 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-26 03:34:20,372 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-26 03:34:20,375 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-26 03:34:20,376 INFO L82 PathProgramCache]: Analyzing trace with hash -551124073, now seen corresponding path program 1 times [2021-08-26 03:34:20,381 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-26 03:34:20,382 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1226797707] [2021-08-26 03:34:20,382 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-26 03:34:20,383 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-26 03:34:20,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 03:34:20,592 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-26 03:34:20,593 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-26 03:34:20,593 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1226797707] [2021-08-26 03:34:20,594 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1226797707] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-26 03:34:20,594 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-26 03:34:20,594 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-08-26 03:34:20,596 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1647041137] [2021-08-26 03:34:20,608 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-08-26 03:34:20,609 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-26 03:34:20,619 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-08-26 03:34:20,620 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-08-26 03:34:20,622 INFO L87 Difference]: Start difference. First operand has 31 states, 27 states have (on average 1.6296296296296295) internal successors, (44), 30 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 3 states, 3 states have (on average 3.0) internal successors, (9), 3 states have internal predecessors, (9), 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-08-26 03:34:20,676 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-26 03:34:20,676 INFO L93 Difference]: Finished difference Result 46 states and 61 transitions. [2021-08-26 03:34:20,677 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-08-26 03:34:20,678 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 3.0) internal successors, (9), 3 states have internal predecessors, (9), 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 9 [2021-08-26 03:34:20,679 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-26 03:34:20,684 INFO L225 Difference]: With dead ends: 46 [2021-08-26 03:34:20,685 INFO L226 Difference]: Without dead ends: 29 [2021-08-26 03:34:20,687 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 5.4ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-08-26 03:34:20,700 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2021-08-26 03:34:20,712 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 27. [2021-08-26 03:34:20,714 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27 states, 24 states have (on average 1.3333333333333333) internal successors, (32), 26 states have internal predecessors, (32), 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-08-26 03:34:20,715 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 32 transitions. [2021-08-26 03:34:20,716 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 32 transitions. Word has length 9 [2021-08-26 03:34:20,717 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-26 03:34:20,717 INFO L470 AbstractCegarLoop]: Abstraction has 27 states and 32 transitions. [2021-08-26 03:34:20,717 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 3.0) internal successors, (9), 3 states have internal predecessors, (9), 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-08-26 03:34:20,718 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 32 transitions. [2021-08-26 03:34:20,718 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2021-08-26 03:34:20,719 INFO L504 BasicCegarLoop]: Found error trace [2021-08-26 03:34:20,719 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-26 03:34:20,719 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-08-26 03:34:20,719 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-26 03:34:20,722 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-26 03:34:20,722 INFO L82 PathProgramCache]: Analyzing trace with hash -2085816175, now seen corresponding path program 1 times [2021-08-26 03:34:20,722 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-26 03:34:20,723 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [860530474] [2021-08-26 03:34:20,723 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-26 03:34:20,723 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-26 03:34:20,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 03:34:20,798 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-26 03:34:20,799 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-26 03:34:20,799 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [860530474] [2021-08-26 03:34:20,800 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [860530474] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-26 03:34:20,800 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-26 03:34:20,800 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-08-26 03:34:20,800 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1703042050] [2021-08-26 03:34:20,801 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-08-26 03:34:20,802 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-26 03:34:20,803 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-08-26 03:34:20,803 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-08-26 03:34:20,803 INFO L87 Difference]: Start difference. First operand 27 states and 32 transitions. Second operand has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 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-08-26 03:34:20,845 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-26 03:34:20,845 INFO L93 Difference]: Finished difference Result 54 states and 62 transitions. [2021-08-26 03:34:20,846 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-08-26 03:34:20,846 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 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 10 [2021-08-26 03:34:20,846 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-26 03:34:20,848 INFO L225 Difference]: With dead ends: 54 [2021-08-26 03:34:20,848 INFO L226 Difference]: Without dead ends: 34 [2021-08-26 03:34:20,849 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 6.2ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-08-26 03:34:20,850 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2021-08-26 03:34:20,855 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 27. [2021-08-26 03:34:20,856 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27 states, 24 states have (on average 1.2916666666666667) internal successors, (31), 26 states have internal predecessors, (31), 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-08-26 03:34:20,858 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 31 transitions. [2021-08-26 03:34:20,858 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 31 transitions. Word has length 10 [2021-08-26 03:34:20,858 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-26 03:34:20,859 INFO L470 AbstractCegarLoop]: Abstraction has 27 states and 31 transitions. [2021-08-26 03:34:20,859 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 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-08-26 03:34:20,859 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 31 transitions. [2021-08-26 03:34:20,860 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2021-08-26 03:34:20,860 INFO L504 BasicCegarLoop]: Found error trace [2021-08-26 03:34:20,860 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-26 03:34:20,860 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-08-26 03:34:20,861 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-26 03:34:20,862 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-26 03:34:20,862 INFO L82 PathProgramCache]: Analyzing trace with hash 2140661612, now seen corresponding path program 1 times [2021-08-26 03:34:20,862 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-26 03:34:20,862 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1558150064] [2021-08-26 03:34:20,863 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-26 03:34:20,864 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-26 03:34:20,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 03:34:20,929 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-26 03:34:20,929 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-26 03:34:20,930 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1558150064] [2021-08-26 03:34:20,931 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1558150064] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-26 03:34:20,931 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-26 03:34:20,931 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-08-26 03:34:20,932 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [963335466] [2021-08-26 03:34:20,933 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-08-26 03:34:20,939 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-26 03:34:20,939 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-08-26 03:34:20,939 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-08-26 03:34:20,940 INFO L87 Difference]: Start difference. First operand 27 states and 31 transitions. Second operand has 4 states, 4 states have (on average 2.5) internal successors, (10), 4 states have internal predecessors, (10), 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-08-26 03:34:20,985 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-26 03:34:20,985 INFO L93 Difference]: Finished difference Result 47 states and 54 transitions. [2021-08-26 03:34:20,985 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-08-26 03:34:20,986 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.5) internal successors, (10), 4 states have internal predecessors, (10), 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 10 [2021-08-26 03:34:20,986 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-26 03:34:20,988 INFO L225 Difference]: With dead ends: 47 [2021-08-26 03:34:20,988 INFO L226 Difference]: Without dead ends: 45 [2021-08-26 03:34:20,988 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 22.1ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-08-26 03:34:20,989 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2021-08-26 03:34:20,997 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 29. [2021-08-26 03:34:20,998 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 29 states, 26 states have (on average 1.2692307692307692) internal successors, (33), 28 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-08-26 03:34:20,999 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 33 transitions. [2021-08-26 03:34:20,999 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 33 transitions. Word has length 10 [2021-08-26 03:34:20,999 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-26 03:34:21,000 INFO L470 AbstractCegarLoop]: Abstraction has 29 states and 33 transitions. [2021-08-26 03:34:21,000 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 2.5) internal successors, (10), 4 states have internal predecessors, (10), 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-08-26 03:34:21,000 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 33 transitions. [2021-08-26 03:34:21,001 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2021-08-26 03:34:21,001 INFO L504 BasicCegarLoop]: Found error trace [2021-08-26 03:34:21,001 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-26 03:34:21,001 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2021-08-26 03:34:21,001 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-26 03:34:21,002 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-26 03:34:21,002 INFO L82 PathProgramCache]: Analyzing trace with hash 1997962921, now seen corresponding path program 1 times [2021-08-26 03:34:21,002 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-26 03:34:21,003 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [774015474] [2021-08-26 03:34:21,003 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-26 03:34:21,003 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-26 03:34:21,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 03:34:21,064 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-26 03:34:21,071 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-26 03:34:21,071 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [774015474] [2021-08-26 03:34:21,071 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [774015474] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-26 03:34:21,071 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-26 03:34:21,071 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-08-26 03:34:21,072 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1299960184] [2021-08-26 03:34:21,072 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-08-26 03:34:21,072 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-26 03:34:21,073 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-08-26 03:34:21,073 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-08-26 03:34:21,073 INFO L87 Difference]: Start difference. First operand 29 states and 33 transitions. Second operand has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 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-08-26 03:34:21,098 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-26 03:34:21,098 INFO L93 Difference]: Finished difference Result 50 states and 57 transitions. [2021-08-26 03:34:21,098 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-08-26 03:34:21,099 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 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-08-26 03:34:21,099 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-26 03:34:21,099 INFO L225 Difference]: With dead ends: 50 [2021-08-26 03:34:21,099 INFO L226 Difference]: Without dead ends: 30 [2021-08-26 03:34:21,100 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 18.9ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-08-26 03:34:21,100 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2021-08-26 03:34:21,102 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 24. [2021-08-26 03:34:21,102 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24 states, 22 states have (on average 1.2272727272727273) internal successors, (27), 23 states have internal predecessors, (27), 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-08-26 03:34:21,103 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 27 transitions. [2021-08-26 03:34:21,103 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 27 transitions. Word has length 11 [2021-08-26 03:34:21,103 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-26 03:34:21,103 INFO L470 AbstractCegarLoop]: Abstraction has 24 states and 27 transitions. [2021-08-26 03:34:21,103 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 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-08-26 03:34:21,104 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 27 transitions. [2021-08-26 03:34:21,104 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2021-08-26 03:34:21,104 INFO L504 BasicCegarLoop]: Found error trace [2021-08-26 03:34:21,104 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-26 03:34:21,104 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2021-08-26 03:34:21,105 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-26 03:34:21,105 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-26 03:34:21,105 INFO L82 PathProgramCache]: Analyzing trace with hash 588886092, now seen corresponding path program 1 times [2021-08-26 03:34:21,105 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-26 03:34:21,106 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1158863672] [2021-08-26 03:34:21,106 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-26 03:34:21,106 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-26 03:34:21,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 03:34:21,982 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-26 03:34:21,983 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-26 03:34:21,983 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1158863672] [2021-08-26 03:34:21,983 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1158863672] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-26 03:34:21,983 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-26 03:34:21,983 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-08-26 03:34:21,983 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2025586155] [2021-08-26 03:34:21,984 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2021-08-26 03:34:21,984 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-26 03:34:21,985 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-08-26 03:34:21,985 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2021-08-26 03:34:21,985 INFO L87 Difference]: Start difference. First operand 24 states and 27 transitions. Second operand has 8 states, 8 states have (on average 2.0) internal successors, (16), 8 states have internal predecessors, (16), 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-08-26 03:34:22,121 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-26 03:34:22,121 INFO L93 Difference]: Finished difference Result 40 states and 47 transitions. [2021-08-26 03:34:22,122 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-08-26 03:34:22,122 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 2.0) internal successors, (16), 8 states have internal predecessors, (16), 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 16 [2021-08-26 03:34:22,122 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-26 03:34:22,123 INFO L225 Difference]: With dead ends: 40 [2021-08-26 03:34:22,123 INFO L226 Difference]: Without dead ends: 25 [2021-08-26 03:34:22,124 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 147.2ms TimeCoverageRelationStatistics Valid=36, Invalid=54, Unknown=0, NotChecked=0, Total=90 [2021-08-26 03:34:22,124 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2021-08-26 03:34:22,128 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 25. [2021-08-26 03:34:22,128 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 25 states, 23 states have (on average 1.1304347826086956) internal successors, (26), 24 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-26 03:34:22,129 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 26 transitions. [2021-08-26 03:34:22,129 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 26 transitions. Word has length 16 [2021-08-26 03:34:22,129 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-26 03:34:22,130 INFO L470 AbstractCegarLoop]: Abstraction has 25 states and 26 transitions. [2021-08-26 03:34:22,130 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 2.0) internal successors, (16), 8 states have internal predecessors, (16), 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-08-26 03:34:22,130 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 26 transitions. [2021-08-26 03:34:22,130 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2021-08-26 03:34:22,130 INFO L504 BasicCegarLoop]: Found error trace [2021-08-26 03:34:22,130 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-26 03:34:22,130 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2021-08-26 03:34:22,131 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-26 03:34:22,131 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-26 03:34:22,131 INFO L82 PathProgramCache]: Analyzing trace with hash 394194232, now seen corresponding path program 1 times [2021-08-26 03:34:22,131 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-26 03:34:22,131 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [104331205] [2021-08-26 03:34:22,132 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-26 03:34:22,132 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-26 03:34:22,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 03:34:22,211 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-26 03:34:22,211 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-26 03:34:22,212 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [104331205] [2021-08-26 03:34:22,215 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [104331205] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-26 03:34:22,215 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-26 03:34:22,215 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-08-26 03:34:22,215 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [524073354] [2021-08-26 03:34:22,216 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-08-26 03:34:22,216 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-26 03:34:22,216 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-08-26 03:34:22,217 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-08-26 03:34:22,217 INFO L87 Difference]: Start difference. First operand 25 states and 26 transitions. Second operand has 6 states, 6 states have (on average 2.8333333333333335) internal successors, (17), 6 states have internal predecessors, (17), 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-08-26 03:34:22,276 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-26 03:34:22,276 INFO L93 Difference]: Finished difference Result 38 states and 40 transitions. [2021-08-26 03:34:22,276 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-08-26 03:34:22,276 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.8333333333333335) internal successors, (17), 6 states have internal predecessors, (17), 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 17 [2021-08-26 03:34:22,276 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-26 03:34:22,277 INFO L225 Difference]: With dead ends: 38 [2021-08-26 03:34:22,277 INFO L226 Difference]: Without dead ends: 36 [2021-08-26 03:34:22,278 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 47.7ms TimeCoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2021-08-26 03:34:22,278 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2021-08-26 03:34:22,281 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 23. [2021-08-26 03:34:22,283 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 23 states, 22 states have (on average 1.0909090909090908) internal successors, (24), 22 states have internal predecessors, (24), 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-08-26 03:34:22,284 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 24 transitions. [2021-08-26 03:34:22,284 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 24 transitions. Word has length 17 [2021-08-26 03:34:22,284 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-26 03:34:22,284 INFO L470 AbstractCegarLoop]: Abstraction has 23 states and 24 transitions. [2021-08-26 03:34:22,285 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 2.8333333333333335) internal successors, (17), 6 states have internal predecessors, (17), 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-08-26 03:34:22,285 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 24 transitions. [2021-08-26 03:34:22,286 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2021-08-26 03:34:22,286 INFO L504 BasicCegarLoop]: Found error trace [2021-08-26 03:34:22,286 INFO L512 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-26 03:34:22,286 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2021-08-26 03:34:22,289 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-26 03:34:22,289 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-26 03:34:22,289 INFO L82 PathProgramCache]: Analyzing trace with hash -1016031163, now seen corresponding path program 1 times [2021-08-26 03:34:22,290 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-26 03:34:22,290 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1734378020] [2021-08-26 03:34:22,290 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-26 03:34:22,290 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-26 03:34:22,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 03:34:22,464 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-26 03:34:22,464 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-26 03:34:22,465 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1734378020] [2021-08-26 03:34:22,465 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1734378020] provided 0 perfect and 1 imperfect interpolant sequences [2021-08-26 03:34:22,465 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [425730429] [2021-08-26 03:34:22,465 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-26 03:34:22,465 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-08-26 03:34:22,466 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-26 03:34:22,469 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-08-26 03:34:22,470 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-08-26 03:34:22,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 03:34:22,540 INFO L263 TraceCheckSpWp]: Trace formula consists of 107 conjuncts, 10 conjunts are in the unsatisfiable core [2021-08-26 03:34:22,543 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-26 03:34:22,686 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-26 03:34:22,686 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [425730429] provided 0 perfect and 1 imperfect interpolant sequences [2021-08-26 03:34:22,686 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-08-26 03:34:22,686 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 4] total 9 [2021-08-26 03:34:22,687 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1266748017] [2021-08-26 03:34:22,687 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2021-08-26 03:34:22,687 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-26 03:34:22,687 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-08-26 03:34:22,687 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2021-08-26 03:34:22,688 INFO L87 Difference]: Start difference. First operand 23 states and 24 transitions. Second operand has 9 states, 9 states have (on average 3.5555555555555554) internal successors, (32), 9 states have internal predecessors, (32), 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-08-26 03:34:26,574 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-26 03:34:26,574 INFO L93 Difference]: Finished difference Result 26 states and 27 transitions. [2021-08-26 03:34:26,575 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-08-26 03:34:26,575 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 3.5555555555555554) internal successors, (32), 9 states have internal predecessors, (32), 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 18 [2021-08-26 03:34:26,575 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-26 03:34:26,575 INFO L225 Difference]: With dead ends: 26 [2021-08-26 03:34:26,575 INFO L226 Difference]: Without dead ends: 0 [2021-08-26 03:34:26,576 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 191.6ms TimeCoverageRelationStatistics Valid=38, Invalid=72, Unknown=0, NotChecked=0, Total=110 [2021-08-26 03:34:26,576 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2021-08-26 03:34:26,576 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2021-08-26 03:34:26,576 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-08-26 03:34:26,576 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2021-08-26 03:34:26,576 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 18 [2021-08-26 03:34:26,576 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-26 03:34:26,576 INFO L470 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2021-08-26 03:34:26,577 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 3.5555555555555554) internal successors, (32), 9 states have internal predecessors, (32), 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-08-26 03:34:26,577 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2021-08-26 03:34:26,577 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2021-08-26 03:34:26,579 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION [2021-08-26 03:34:26,579 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION [2021-08-26 03:34:26,579 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION [2021-08-26 03:34:26,597 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2021-08-26 03:34:26,784 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-08-26 03:34:26,788 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2021-08-26 03:34:26,791 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-08-26 03:34:26,804 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-08-26 03:34:26,827 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-08-26 03:34:26,828 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-08-26 03:34:26,828 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-08-26 03:34:26,844 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-08-26 03:34:26,846 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-08-26 03:34:26,848 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-08-26 03:34:26,849 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-08-26 03:34:27,092 INFO L857 garLoopResultBuilder]: For program point L31(lines 31 147) no Hoare annotation was computed. [2021-08-26 03:34:27,093 INFO L857 garLoopResultBuilder]: For program point L60(lines 60 93) no Hoare annotation was computed. [2021-08-26 03:34:27,093 INFO L857 garLoopResultBuilder]: For program point ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION(line 73) no Hoare annotation was computed. [2021-08-26 03:34:27,093 INFO L853 garLoopResultBuilder]: At program point L151(lines 29 152) the Hoare annotation is: false [2021-08-26 03:34:27,093 INFO L857 garLoopResultBuilder]: For program point L110(line 110) no Hoare annotation was computed. [2021-08-26 03:34:27,093 INFO L857 garLoopResultBuilder]: For program point L73(line 73) no Hoare annotation was computed. [2021-08-26 03:34:27,093 INFO L857 garLoopResultBuilder]: For program point L40(lines 40 139) no Hoare annotation was computed. [2021-08-26 03:34:27,093 INFO L860 garLoopResultBuilder]: At program point L131(lines 98 132) the Hoare annotation is: true [2021-08-26 03:34:27,093 INFO L857 garLoopResultBuilder]: For program point L-1(line -1) no Hoare annotation was computed. [2021-08-26 03:34:27,093 INFO L857 garLoopResultBuilder]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2021-08-26 03:34:27,093 INFO L857 garLoopResultBuilder]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2021-08-26 03:34:27,094 INFO L853 garLoopResultBuilder]: At program point L156(lines 26 157) the Hoare annotation is: (or (let ((.cse6 (div ULTIMATE.start_main_~main__index1~0 4294967296)) (.cse7 (div ULTIMATE.start_main_~main__index2~0 4294967296))) (let ((.cse0 (* 4294967296 .cse7)) (.cse8 (* 4294967296 .cse6))) (and (<= ULTIMATE.start_main_~main__index1~0 (+ (* 4294967296 (div (+ (- 1) ULTIMATE.start_main_~main__index1~0) 4294967296)) 100000)) (<= ULTIMATE.start_main_~main__index2~0 (+ .cse0 99999)) (or (let ((.cse5 (select |#memory_int| |ULTIMATE.start_main_~#main__array~0.base|))) (let ((.cse4 (select .cse5 (+ |ULTIMATE.start_main_~#main__array~0.offset| (* .cse7 (- 17179869184)) (* ULTIMATE.start_main_~main__index2~0 4)))) (.cse1 (select .cse5 (+ |ULTIMATE.start_main_~#main__array~0.offset| (* ULTIMATE.start_main_~main__index1~0 4) (* .cse6 (- 17179869184)))))) (let ((.cse3 (+ .cse4 (* 4294967296 (div .cse1 4294967296)))) (.cse2 (* 4294967296 (div .cse4 4294967296)))) (and (<= (+ .cse1 .cse2) .cse3) (< .cse3 (+ .cse1 .cse2 1)))))) (<= (+ .cse0 ULTIMATE.start_main_~main__index1~0) (+ ULTIMATE.start_main_~main__index2~0 .cse8))) (<= ULTIMATE.start_main_~main__index1~0 (+ ULTIMATE.start_main_~main__index2~0 (* 4294967296 (div (+ (* ULTIMATE.start_main_~main__index2~0 (- 1)) ULTIMATE.start_main_~main__index1~0 99997) 4294967296)) 1)) (= ULTIMATE.start_main_~__VERIFIER_assert__cond~0 1) (<= ULTIMATE.start_main_~main__index1~0 (+ 99999 .cse8))))) (= ULTIMATE.start_main_~main__loop_entered~0 0)) [2021-08-26 03:34:27,094 INFO L857 garLoopResultBuilder]: For program point L57(lines 57 133) no Hoare annotation was computed. [2021-08-26 03:34:27,094 INFO L857 garLoopResultBuilder]: For program point L24(lines 24 162) no Hoare annotation was computed. [2021-08-26 03:34:27,094 INFO L857 garLoopResultBuilder]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 42) no Hoare annotation was computed. [2021-08-26 03:34:27,094 INFO L853 garLoopResultBuilder]: At program point L119(lines 99 128) the Hoare annotation is: (let ((.cse6 (div ULTIMATE.start_main_~main__index1~0 4294967296))) (let ((.cse7 (div ULTIMATE.start_main_~main__index2~0 4294967296)) (.cse11 (* 4294967296 .cse6))) (let ((.cse8 (+ ULTIMATE.start_main_~main__index2~0 .cse11)) (.cse0 (* 4294967296 .cse7)) (.cse9 (= ULTIMATE.start_main_~__VERIFIER_assert__cond~0 1)) (.cse10 (<= ULTIMATE.start_main_~main__index1~0 (+ 99999 .cse11)))) (or (and (<= ULTIMATE.start_main_~main__index1~0 (+ (* 4294967296 (div (+ (- 1) ULTIMATE.start_main_~main__index1~0) 4294967296)) 100000)) (<= ULTIMATE.start_main_~main__index2~0 (+ .cse0 99999)) (or (let ((.cse5 (select |#memory_int| |ULTIMATE.start_main_~#main__array~0.base|))) (let ((.cse4 (select .cse5 (+ |ULTIMATE.start_main_~#main__array~0.offset| (* .cse7 (- 17179869184)) (* ULTIMATE.start_main_~main__index2~0 4)))) (.cse1 (select .cse5 (+ |ULTIMATE.start_main_~#main__array~0.offset| (* ULTIMATE.start_main_~main__index1~0 4) (* .cse6 (- 17179869184)))))) (let ((.cse3 (+ .cse4 (* 4294967296 (div .cse1 4294967296)))) (.cse2 (* 4294967296 (div .cse4 4294967296)))) (and (<= (+ .cse1 .cse2) .cse3) (< .cse3 (+ .cse1 .cse2 1)))))) (<= (+ .cse0 ULTIMATE.start_main_~main__index1~0) .cse8)) (<= ULTIMATE.start_main_~main__index1~0 (+ ULTIMATE.start_main_~main__index2~0 (* 4294967296 (div (+ (* ULTIMATE.start_main_~main__index2~0 (- 1)) ULTIMATE.start_main_~main__index1~0 99997) 4294967296)) 1)) .cse9 .cse10) (and (<= (+ .cse0 ULTIMATE.start_main_~main__index1~0 1) .cse8) (not (= ULTIMATE.start_main_~__VERIFIER_assert__cond~2 0)) (<= .cse8 (+ .cse0 ULTIMATE.start_main_~main__index1~0 99999)) .cse9 .cse10))))) [2021-08-26 03:34:27,094 INFO L857 garLoopResultBuilder]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2021-08-26 03:34:27,094 INFO L857 garLoopResultBuilder]: For program point L62(lines 62 88) no Hoare annotation was computed. [2021-08-26 03:34:27,094 INFO L857 garLoopResultBuilder]: For program point L29(lines 29 152) no Hoare annotation was computed. [2021-08-26 03:34:27,094 INFO L853 garLoopResultBuilder]: At program point L87(lines 62 88) the Hoare annotation is: (let ((.cse0 (* 4294967296 (div ULTIMATE.start_main_~main__index2~0 4294967296)))) (and (<= (+ .cse0 ULTIMATE.start_main_~main__index1~0 1) (+ ULTIMATE.start_main_~main__index2~0 (* 4294967296 (div ULTIMATE.start_main_~main__index1~0 4294967296)))) (<= ULTIMATE.start_main_~main__index1~0 (+ (* 4294967296 (div (+ (- 1) ULTIMATE.start_main_~main__index1~0) 4294967296)) 100000)) (<= ULTIMATE.start_main_~main__index2~0 (+ .cse0 99999)) (<= ULTIMATE.start_main_~main__index1~0 (+ ULTIMATE.start_main_~main__index2~0 (* 4294967296 (div (+ (* ULTIMATE.start_main_~main__index2~0 (- 1)) ULTIMATE.start_main_~main__index1~0 99997) 4294967296)) 1)) (= ULTIMATE.start_main_~__VERIFIER_assert__cond~0 1) (not (= ULTIMATE.start_main_~main____CPAchecker_TMP_0~1 0)))) [2021-08-26 03:34:27,094 INFO L857 garLoopResultBuilder]: For program point L21(lines 21 167) no Hoare annotation was computed. [2021-08-26 03:34:27,094 INFO L857 garLoopResultBuilder]: For program point L50(lines 50 138) no Hoare annotation was computed. [2021-08-26 03:34:27,095 INFO L853 garLoopResultBuilder]: At program point L79(lines 46 139) the Hoare annotation is: (let ((.cse3 (* 4294967296 (div ULTIMATE.start_main_~main__index2~0 4294967296)))) (let ((.cse0 (<= (+ .cse3 ULTIMATE.start_main_~main__index1~0 1) (+ ULTIMATE.start_main_~main__index2~0 (* 4294967296 (div ULTIMATE.start_main_~main__index1~0 4294967296))))) (.cse1 (<= ULTIMATE.start_main_~main__index2~0 (+ .cse3 99999))) (.cse2 (= ULTIMATE.start_main_~__VERIFIER_assert__cond~0 1))) (or (and .cse0 .cse1 (= ULTIMATE.start_main_~main____CPAchecker_TMP_0~0 1) .cse2) (and .cse0 .cse1 (not (= ULTIMATE.start_main_~__VERIFIER_assert__cond~1 0)) .cse2 (not (= ULTIMATE.start_main_~main____CPAchecker_TMP_0~1 0)))))) [2021-08-26 03:34:27,095 INFO L857 garLoopResultBuilder]: For program point L108(lines 108 120) no Hoare annotation was computed. [2021-08-26 03:34:27,095 INFO L857 garLoopResultBuilder]: For program point L42(line 42) no Hoare annotation was computed. [2021-08-26 03:34:27,095 INFO L857 garLoopResultBuilder]: For program point L71(lines 71 80) no Hoare annotation was computed. [2021-08-26 03:34:27,095 INFO L860 garLoopResultBuilder]: At program point L166(lines 14 168) the Hoare annotation is: true [2021-08-26 03:34:27,095 INFO L853 garLoopResultBuilder]: At program point L92(lines 60 93) the Hoare annotation is: false [2021-08-26 03:34:27,095 INFO L857 garLoopResultBuilder]: For program point L26(lines 26 157) no Hoare annotation was computed. [2021-08-26 03:34:27,095 INFO L857 garLoopResultBuilder]: For program point ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION(line 110) no Hoare annotation was computed. [2021-08-26 03:34:27,095 INFO L853 garLoopResultBuilder]: At program point L146(lines 31 147) the Hoare annotation is: (let ((.cse0 (* 4294967296 (div ULTIMATE.start_main_~main__index2~0 4294967296)))) (and (<= (+ .cse0 ULTIMATE.start_main_~main__index1~0 1) (+ ULTIMATE.start_main_~main__index2~0 (* 4294967296 (div ULTIMATE.start_main_~main__index1~0 4294967296)))) (= ULTIMATE.start_main_~main__loop_entered~0 0) (<= ULTIMATE.start_main_~main__index2~0 (+ .cse0 99999)) (= ULTIMATE.start_main_~main____CPAchecker_TMP_0~0 1))) [2021-08-26 03:34:27,099 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2021-08-26 03:34:27,117 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 26.08 03:34:27 BoogieIcfgContainer [2021-08-26 03:34:27,117 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2021-08-26 03:34:27,118 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2021-08-26 03:34:27,118 INFO L271 PluginConnector]: Initializing Witness Printer... [2021-08-26 03:34:27,118 INFO L275 PluginConnector]: Witness Printer initialized [2021-08-26 03:34:27,118 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.08 03:34:20" (3/4) ... [2021-08-26 03:34:27,121 INFO L137 WitnessPrinter]: Generating witness for correct program [2021-08-26 03:34:27,129 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 14 nodes and edges [2021-08-26 03:34:27,129 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2021-08-26 03:34:27,130 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2021-08-26 03:34:27,130 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2021-08-26 03:34:27,167 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2021-08-26 03:34:27,167 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2021-08-26 03:34:27,169 INFO L168 Benchmark]: Toolchain (without parser) took 7639.51 ms. Allocated memory was 62.9 MB in the beginning and 104.9 MB in the end (delta: 41.9 MB). Free memory was 42.1 MB in the beginning and 71.4 MB in the end (delta: -29.2 MB). Peak memory consumption was 11.7 MB. Max. memory is 16.1 GB. [2021-08-26 03:34:27,169 INFO L168 Benchmark]: CDTParser took 0.18 ms. Allocated memory is still 62.9 MB. Free memory was 43.7 MB in the beginning and 43.6 MB in the end (delta: 39.6 kB). There was no memory consumed. Max. memory is 16.1 GB. [2021-08-26 03:34:27,169 INFO L168 Benchmark]: CACSL2BoogieTranslator took 206.12 ms. Allocated memory is still 62.9 MB. Free memory was 42.0 MB in the beginning and 45.6 MB in the end (delta: -3.7 MB). Peak memory consumption was 13.8 MB. Max. memory is 16.1 GB. [2021-08-26 03:34:27,170 INFO L168 Benchmark]: Boogie Procedure Inliner took 61.70 ms. Allocated memory is still 62.9 MB. Free memory was 45.4 MB in the beginning and 43.7 MB in the end (delta: 1.7 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. [2021-08-26 03:34:27,170 INFO L168 Benchmark]: Boogie Preprocessor took 38.18 ms. Allocated memory is still 62.9 MB. Free memory was 43.7 MB in the beginning and 42.5 MB in the end (delta: 1.2 MB). There was no memory consumed. Max. memory is 16.1 GB. [2021-08-26 03:34:27,170 INFO L168 Benchmark]: RCFGBuilder took 452.06 ms. Allocated memory is still 62.9 MB. Free memory was 42.5 MB in the beginning and 42.3 MB in the end (delta: 203.8 kB). Peak memory consumption was 18.0 MB. Max. memory is 16.1 GB. [2021-08-26 03:34:27,170 INFO L168 Benchmark]: TraceAbstraction took 6825.71 ms. Allocated memory was 62.9 MB in the beginning and 104.9 MB in the end (delta: 41.9 MB). Free memory was 41.8 MB in the beginning and 75.6 MB in the end (delta: -33.7 MB). Peak memory consumption was 56.1 MB. Max. memory is 16.1 GB. [2021-08-26 03:34:27,171 INFO L168 Benchmark]: Witness Printer took 49.49 ms. Allocated memory is still 104.9 MB. Free memory was 75.6 MB in the beginning and 71.4 MB in the end (delta: 4.2 MB). Peak memory consumption was 4.2 MB. Max. memory is 16.1 GB. [2021-08-26 03:34:27,172 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.18 ms. Allocated memory is still 62.9 MB. Free memory was 43.7 MB in the beginning and 43.6 MB in the end (delta: 39.6 kB). There was no memory consumed. Max. memory is 16.1 GB. * CACSL2BoogieTranslator took 206.12 ms. Allocated memory is still 62.9 MB. Free memory was 42.0 MB in the beginning and 45.6 MB in the end (delta: -3.7 MB). Peak memory consumption was 13.8 MB. Max. memory is 16.1 GB. * Boogie Procedure Inliner took 61.70 ms. Allocated memory is still 62.9 MB. Free memory was 45.4 MB in the beginning and 43.7 MB in the end (delta: 1.7 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. * Boogie Preprocessor took 38.18 ms. Allocated memory is still 62.9 MB. Free memory was 43.7 MB in the beginning and 42.5 MB in the end (delta: 1.2 MB). There was no memory consumed. Max. memory is 16.1 GB. * RCFGBuilder took 452.06 ms. Allocated memory is still 62.9 MB. Free memory was 42.5 MB in the beginning and 42.3 MB in the end (delta: 203.8 kB). Peak memory consumption was 18.0 MB. Max. memory is 16.1 GB. * TraceAbstraction took 6825.71 ms. Allocated memory was 62.9 MB in the beginning and 104.9 MB in the end (delta: 41.9 MB). Free memory was 41.8 MB in the beginning and 75.6 MB in the end (delta: -33.7 MB). Peak memory consumption was 56.1 MB. Max. memory is 16.1 GB. * Witness Printer took 49.49 ms. Allocated memory is still 104.9 MB. Free memory was 75.6 MB in the beginning and 71.4 MB in the end (delta: 4.2 MB). Peak memory consumption was 4.2 MB. Max. memory is 16.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0ms ErrorAutomatonConstructionTimeTotal, 0.0ms FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0ms ErrorAutomatonConstructionTimeAvg, 0.0ms ErrorAutomatonDifferenceTimeAvg, 0.0ms ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: 42]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 73]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 110]: 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, 31 locations, 3 error locations. Started 1 CEGAR loops. OverallTime: 6751.0ms, OverallIterations: 7, TraceHistogramMax: 2, EmptinessCheckTime: 9.4ms, AutomataDifference: 4291.4ms, DeadEndRemovalTime: 0.0ms, HoareAnnotationTime: 304.8ms, InitialAbstractionConstructionTime: 7.0ms, PartialOrderReductionTime: 0.0ms, HoareTripleCheckerStatistics: 172 SDtfs, 177 SDslu, 188 SDs, 0 SdLazy, 145 SolverSat, 18 SolverUnsat, 1 SolverUnknown, 0 SolverNotchecked, 3898.5ms Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 64 GetRequests, 33 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 439.4ms Time, 0.0ms BasicInterpolantAutomatonTime, BiggestAbstraction: size=31occurred in iteration=0, InterpolantAutomatonStates: 39, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0ms DumpTime, AutomataMinimizationStatistics: 51.7ms AutomataMinimizationTime, 7 MinimizatonAttempts, 44 StatesRemovedByMinimization, 5 NontrivialMinimizations, HoareAnnotationStatistics: 0.0ms HoareAnnotationTime, 9 LocationsWithAnnotation, 9 PreInvPairs, 21 NumberOfFragments, 619 HoareAnnotationTreeSize, 9 FomulaSimplifications, 473 FormulaSimplificationTreeSizeReduction, 59.2ms HoareSimplificationTime, 9 FomulaSimplificationsInter, 167 FormulaSimplificationTreeSizeReductionInter, 239.2ms HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 32.2ms SsaConstructionTime, 251.3ms SatisfiabilityAnalysisTime, 1365.0ms InterpolantComputationTime, 109 NumberOfCodeBlocks, 109 NumberOfCodeBlocksAsserted, 8 NumberOfCheckSat, 101 ConstructedInterpolants, 0 QuantifiedInterpolants, 1355 SizeOfPredicates, 0 NumberOfNonLiveVariables, 107 ConjunctsInSsa, 10 ConjunctsInUnsatCore, 8 InterpolantComputations, 6 PerfectInterpolantSequences, 2/4 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 3 specifications checked. All of them hold - InvariantResult [Line: 26]: Loop Invariant Derived loop invariant: (((((main__index1 <= 4294967296 * ((-1 + main__index1) / 4294967296) + 100000 && main__index2 <= 4294967296 * (main__index2 / 4294967296) + 99999) && ((unknown-#memory_int-unknown[main__array][main__array + main__index1 * 4 + main__index1 / 4294967296 * -17179869184] + 4294967296 * (unknown-#memory_int-unknown[main__array][main__array + main__index2 / 4294967296 * -17179869184 + main__index2 * 4] / 4294967296) <= unknown-#memory_int-unknown[main__array][main__array + main__index2 / 4294967296 * -17179869184 + main__index2 * 4] + 4294967296 * (unknown-#memory_int-unknown[main__array][main__array + main__index1 * 4 + main__index1 / 4294967296 * -17179869184] / 4294967296) && unknown-#memory_int-unknown[main__array][main__array + main__index2 / 4294967296 * -17179869184 + main__index2 * 4] + 4294967296 * (unknown-#memory_int-unknown[main__array][main__array + main__index1 * 4 + main__index1 / 4294967296 * -17179869184] / 4294967296) < unknown-#memory_int-unknown[main__array][main__array + main__index1 * 4 + main__index1 / 4294967296 * -17179869184] + 4294967296 * (unknown-#memory_int-unknown[main__array][main__array + main__index2 / 4294967296 * -17179869184 + main__index2 * 4] / 4294967296) + 1) || 4294967296 * (main__index2 / 4294967296) + main__index1 <= main__index2 + 4294967296 * (main__index1 / 4294967296))) && main__index1 <= main__index2 + 4294967296 * ((main__index2 * -1 + main__index1 + 99997) / 4294967296) + 1) && __VERIFIER_assert__cond == 1) && main__index1 <= 99999 + 4294967296 * (main__index1 / 4294967296)) || main__loop_entered == 0 - InvariantResult [Line: 99]: Loop Invariant Derived loop invariant: (((((main__index1 <= 4294967296 * ((-1 + main__index1) / 4294967296) + 100000 && main__index2 <= 4294967296 * (main__index2 / 4294967296) + 99999) && ((unknown-#memory_int-unknown[main__array][main__array + main__index1 * 4 + main__index1 / 4294967296 * -17179869184] + 4294967296 * (unknown-#memory_int-unknown[main__array][main__array + main__index2 / 4294967296 * -17179869184 + main__index2 * 4] / 4294967296) <= unknown-#memory_int-unknown[main__array][main__array + main__index2 / 4294967296 * -17179869184 + main__index2 * 4] + 4294967296 * (unknown-#memory_int-unknown[main__array][main__array + main__index1 * 4 + main__index1 / 4294967296 * -17179869184] / 4294967296) && unknown-#memory_int-unknown[main__array][main__array + main__index2 / 4294967296 * -17179869184 + main__index2 * 4] + 4294967296 * (unknown-#memory_int-unknown[main__array][main__array + main__index1 * 4 + main__index1 / 4294967296 * -17179869184] / 4294967296) < unknown-#memory_int-unknown[main__array][main__array + main__index1 * 4 + main__index1 / 4294967296 * -17179869184] + 4294967296 * (unknown-#memory_int-unknown[main__array][main__array + main__index2 / 4294967296 * -17179869184 + main__index2 * 4] / 4294967296) + 1) || 4294967296 * (main__index2 / 4294967296) + main__index1 <= main__index2 + 4294967296 * (main__index1 / 4294967296))) && main__index1 <= main__index2 + 4294967296 * ((main__index2 * -1 + main__index1 + 99997) / 4294967296) + 1) && __VERIFIER_assert__cond == 1) && main__index1 <= 99999 + 4294967296 * (main__index1 / 4294967296)) || ((((4294967296 * (main__index2 / 4294967296) + main__index1 + 1 <= main__index2 + 4294967296 * (main__index1 / 4294967296) && !(__VERIFIER_assert__cond == 0)) && main__index2 + 4294967296 * (main__index1 / 4294967296) <= 4294967296 * (main__index2 / 4294967296) + main__index1 + 99999) && __VERIFIER_assert__cond == 1) && main__index1 <= 99999 + 4294967296 * (main__index1 / 4294967296)) - InvariantResult [Line: 98]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 60]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 31]: Loop Invariant Derived loop invariant: ((4294967296 * (main__index2 / 4294967296) + main__index1 + 1 <= main__index2 + 4294967296 * (main__index1 / 4294967296) && main__loop_entered == 0) && main__index2 <= 4294967296 * (main__index2 / 4294967296) + 99999) && main____CPAchecker_TMP_0 == 1 - InvariantResult [Line: 46]: Loop Invariant Derived loop invariant: (((4294967296 * (main__index2 / 4294967296) + main__index1 + 1 <= main__index2 + 4294967296 * (main__index1 / 4294967296) && main__index2 <= 4294967296 * (main__index2 / 4294967296) + 99999) && main____CPAchecker_TMP_0 == 1) && __VERIFIER_assert__cond == 1) || ((((4294967296 * (main__index2 / 4294967296) + main__index1 + 1 <= main__index2 + 4294967296 * (main__index1 / 4294967296) && main__index2 <= 4294967296 * (main__index2 / 4294967296) + 99999) && !(__VERIFIER_assert__cond == 0)) && __VERIFIER_assert__cond == 1) && !(main____CPAchecker_TMP_0 == 0)) - InvariantResult [Line: 62]: Loop Invariant Derived loop invariant: ((((4294967296 * (main__index2 / 4294967296) + main__index1 + 1 <= main__index2 + 4294967296 * (main__index1 / 4294967296) && main__index1 <= 4294967296 * ((-1 + main__index1) / 4294967296) + 100000) && main__index2 <= 4294967296 * (main__index2 / 4294967296) + 99999) && main__index1 <= main__index2 + 4294967296 * ((main__index2 * -1 + main__index1 + 99997) / 4294967296) + 1) && __VERIFIER_assert__cond == 1) && !(main____CPAchecker_TMP_0 == 0) - InvariantResult [Line: 14]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 29]: Loop Invariant Derived loop invariant: 0 RESULT: Ultimate proved your program to be correct! [2021-08-26 03:34:27,205 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...