./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/array-cav19/array_tiling_poly6.c --full-output -ea --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 8bd4bc60 Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx12G -Xms1G -ea -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.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/array-cav19/array_tiling_poly6.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(__VERIFIER_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 37750d464f6e46036bd3e2c16773841dab36b946 ............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx12G -Xms1G -ea -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.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/array-cav19/array_tiling_poly6.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.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(__VERIFIER_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 37750d464f6e46036bd3e2c16773841dab36b946 ........................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................ Execution finished normally Writing output log to file Ultimate.log Result: UNKNOWN --- Real Ultimate output --- This is Ultimate 0.1.25-8bd4bc6 [2020-07-28 14:46:51,045 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-07-28 14:46:51,047 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-07-28 14:46:51,066 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-07-28 14:46:51,066 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-07-28 14:46:51,069 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-07-28 14:46:51,071 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-07-28 14:46:51,076 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-07-28 14:46:51,078 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-07-28 14:46:51,079 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-07-28 14:46:51,080 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-07-28 14:46:51,081 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-07-28 14:46:51,081 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-07-28 14:46:51,083 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-07-28 14:46:51,084 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-07-28 14:46:51,085 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-07-28 14:46:51,086 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-07-28 14:46:51,087 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-07-28 14:46:51,089 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-07-28 14:46:51,091 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-07-28 14:46:51,093 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-07-28 14:46:51,094 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-07-28 14:46:51,095 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-07-28 14:46:51,096 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-07-28 14:46:51,098 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-07-28 14:46:51,099 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-07-28 14:46:51,099 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-07-28 14:46:51,101 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-07-28 14:46:51,102 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-07-28 14:46:51,103 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-07-28 14:46:51,103 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-07-28 14:46:51,104 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-07-28 14:46:51,105 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-07-28 14:46:51,105 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-07-28 14:46:51,107 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-07-28 14:46:51,107 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-07-28 14:46:51,108 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-07-28 14:46:51,108 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-07-28 14:46:51,109 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-07-28 14:46:51,110 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-07-28 14:46:51,110 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-07-28 14:46:51,111 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2020-07-28 14:46:51,126 INFO L113 SettingsManager]: Loading preferences was successful [2020-07-28 14:46:51,127 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-07-28 14:46:51,128 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-07-28 14:46:51,129 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-07-28 14:46:51,129 INFO L138 SettingsManager]: * Use SBE=true [2020-07-28 14:46:51,130 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-07-28 14:46:51,130 INFO L138 SettingsManager]: * sizeof long=4 [2020-07-28 14:46:51,130 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-07-28 14:46:51,130 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-07-28 14:46:51,131 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-07-28 14:46:51,131 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-07-28 14:46:51,131 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-07-28 14:46:51,132 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-07-28 14:46:51,132 INFO L138 SettingsManager]: * sizeof long double=12 [2020-07-28 14:46:51,132 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-07-28 14:46:51,132 INFO L138 SettingsManager]: * Use constant arrays=true [2020-07-28 14:46:51,133 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-07-28 14:46:51,133 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-07-28 14:46:51,133 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-07-28 14:46:51,134 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-07-28 14:46:51,134 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-07-28 14:46:51,134 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-07-28 14:46:51,135 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-07-28 14:46:51,135 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2020-07-28 14:46:51,135 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-07-28 14:46:51,135 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-07-28 14:46:51,136 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-07-28 14:46:51,136 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-07-28 14:46:51,136 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2020-07-28 14:46:51,136 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode 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(__VERIFIER_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 -> 37750d464f6e46036bd3e2c16773841dab36b946 [2020-07-28 14:46:51,470 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-07-28 14:46:51,489 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-07-28 14:46:51,493 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-07-28 14:46:51,494 INFO L271 PluginConnector]: Initializing CDTParser... [2020-07-28 14:46:51,495 INFO L275 PluginConnector]: CDTParser initialized [2020-07-28 14:46:51,496 INFO L429 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/array-cav19/array_tiling_poly6.c [2020-07-28 14:46:51,557 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/891a65f6e/363b4802551c4d799739c6a1ef87d14c/FLAGb5f225d58 [2020-07-28 14:46:51,973 INFO L306 CDTParser]: Found 1 translation units. [2020-07-28 14:46:51,974 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/array-cav19/array_tiling_poly6.c [2020-07-28 14:46:51,980 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/891a65f6e/363b4802551c4d799739c6a1ef87d14c/FLAGb5f225d58 [2020-07-28 14:46:52,378 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/891a65f6e/363b4802551c4d799739c6a1ef87d14c [2020-07-28 14:46:52,381 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-07-28 14:46:52,384 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2020-07-28 14:46:52,385 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-07-28 14:46:52,385 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-07-28 14:46:52,390 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-07-28 14:46:52,391 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.07 02:46:52" (1/1) ... [2020-07-28 14:46:52,395 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@540f41b2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.07 02:46:52, skipping insertion in model container [2020-07-28 14:46:52,395 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.07 02:46:52" (1/1) ... [2020-07-28 14:46:52,403 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-07-28 14:46:52,426 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-07-28 14:46:52,632 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-28 14:46:52,637 INFO L203 MainTranslator]: Completed pre-run [2020-07-28 14:46:52,661 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-28 14:46:52,680 INFO L208 MainTranslator]: Completed translation [2020-07-28 14:46:52,681 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.07 02:46:52 WrapperNode [2020-07-28 14:46:52,681 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-07-28 14:46:52,682 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2020-07-28 14:46:52,682 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2020-07-28 14:46:52,682 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2020-07-28 14:46:52,747 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.07 02:46:52" (1/1) ... [2020-07-28 14:46:52,756 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.07 02:46:52" (1/1) ... [2020-07-28 14:46:52,782 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2020-07-28 14:46:52,783 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-07-28 14:46:52,783 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-07-28 14:46:52,783 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-07-28 14:46:52,791 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.07 02:46:52" (1/1) ... [2020-07-28 14:46:52,792 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.07 02:46:52" (1/1) ... [2020-07-28 14:46:52,793 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.07 02:46:52" (1/1) ... [2020-07-28 14:46:52,794 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.07 02:46:52" (1/1) ... [2020-07-28 14:46:52,800 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.07 02:46:52" (1/1) ... [2020-07-28 14:46:52,806 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.07 02:46:52" (1/1) ... [2020-07-28 14:46:52,807 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.07 02:46:52" (1/1) ... [2020-07-28 14:46:52,809 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-07-28 14:46:52,810 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-07-28 14:46:52,810 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-07-28 14:46:52,810 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-07-28 14:46:52,811 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.07 02:46:52" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-07-28 14:46:52,879 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2020-07-28 14:46:52,880 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-07-28 14:46:52,880 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-07-28 14:46:52,881 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2020-07-28 14:46:52,881 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-07-28 14:46:52,882 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2020-07-28 14:46:53,239 INFO L290 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-07-28 14:46:53,240 INFO L295 CfgBuilder]: Removed 11 assume(true) statements. [2020-07-28 14:46:53,243 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.07 02:46:53 BoogieIcfgContainer [2020-07-28 14:46:53,243 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-07-28 14:46:53,245 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-07-28 14:46:53,245 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-07-28 14:46:53,248 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-07-28 14:46:53,248 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 28.07 02:46:52" (1/3) ... [2020-07-28 14:46:53,249 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4d532926 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.07 02:46:53, skipping insertion in model container [2020-07-28 14:46:53,249 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.07 02:46:52" (2/3) ... [2020-07-28 14:46:53,250 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4d532926 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.07 02:46:53, skipping insertion in model container [2020-07-28 14:46:53,250 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.07 02:46:53" (3/3) ... [2020-07-28 14:46:53,251 INFO L109 eAbstractionObserver]: Analyzing ICFG array_tiling_poly6.c [2020-07-28 14:46:53,262 INFO L157 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2020-07-28 14:46:53,270 INFO L169 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2020-07-28 14:46:53,285 INFO L251 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2020-07-28 14:46:53,304 INFO L375 AbstractCegarLoop]: Interprodecural is true [2020-07-28 14:46:53,304 INFO L376 AbstractCegarLoop]: Hoare is true [2020-07-28 14:46:53,304 INFO L377 AbstractCegarLoop]: Compute interpolants for FPandBP [2020-07-28 14:46:53,305 INFO L378 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-07-28 14:46:53,305 INFO L379 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-07-28 14:46:53,305 INFO L380 AbstractCegarLoop]: Difference is false [2020-07-28 14:46:53,305 INFO L381 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-07-28 14:46:53,305 INFO L385 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-07-28 14:46:53,319 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states. [2020-07-28 14:46:53,325 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2020-07-28 14:46:53,325 INFO L414 BasicCegarLoop]: Found error trace [2020-07-28 14:46:53,326 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-28 14:46:53,327 INFO L427 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-28 14:46:53,332 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-28 14:46:53,332 INFO L82 PathProgramCache]: Analyzing trace with hash -56209308, now seen corresponding path program 1 times [2020-07-28 14:46:53,340 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-28 14:46:53,341 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [737271292] [2020-07-28 14:46:53,341 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-28 14:46:53,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-28 14:46:53,488 INFO L280 TraceCheckUtils]: 0: Hoare triple {23#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; {23#true} is VALID [2020-07-28 14:46:53,488 INFO L280 TraceCheckUtils]: 1: Hoare triple {23#true} havoc main_#res;havoc main_#t~nondet0, main_#t~post1, main_#t~mem3, main_#t~post2, main_#t~mem5, main_#t~post4, main_~S~0, main_~i~0, main_~#a~0.base, main_~#a~0.offset;assume -2147483648 <= main_#t~nondet0 && main_#t~nondet0 <= 2147483647;main_~S~0 := main_#t~nondet0;havoc main_#t~nondet0;assume_abort_if_not_#in~cond := (if main_~S~0 > 1 then 1 else 0);havoc assume_abort_if_not_~cond;assume_abort_if_not_~cond := assume_abort_if_not_#in~cond; {23#true} is VALID [2020-07-28 14:46:53,490 INFO L280 TraceCheckUtils]: 2: Hoare triple {23#true} assume 0 == assume_abort_if_not_~cond;assume false; {24#false} is VALID [2020-07-28 14:46:53,490 INFO L280 TraceCheckUtils]: 3: Hoare triple {24#false} havoc main_~i~0;call main_~#a~0.base, main_~#a~0.offset := #Ultimate.allocOnStack(4 * main_~S~0);main_~i~0 := 0; {24#false} is VALID [2020-07-28 14:46:53,491 INFO L280 TraceCheckUtils]: 4: Hoare triple {24#false} assume !true; {24#false} is VALID [2020-07-28 14:46:53,491 INFO L280 TraceCheckUtils]: 5: Hoare triple {24#false} main_~i~0 := 0; {24#false} is VALID [2020-07-28 14:46:53,491 INFO L280 TraceCheckUtils]: 6: Hoare triple {24#false} assume !true; {24#false} is VALID [2020-07-28 14:46:53,492 INFO L280 TraceCheckUtils]: 7: Hoare triple {24#false} main_~i~0 := 0; {24#false} is VALID [2020-07-28 14:46:53,492 INFO L280 TraceCheckUtils]: 8: Hoare triple {24#false} assume !!(main_~i~0 < main_~S~0);call main_#t~mem5 := read~int(main_~#a~0.base, main_~#a~0.offset + 4 * main_~i~0, 4);__VERIFIER_assert_#in~cond := (if -1 == main_#t~mem5 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; {24#false} is VALID [2020-07-28 14:46:53,492 INFO L280 TraceCheckUtils]: 9: Hoare triple {24#false} assume 0 == __VERIFIER_assert_~cond; {24#false} is VALID [2020-07-28 14:46:53,493 INFO L280 TraceCheckUtils]: 10: Hoare triple {24#false} assume !false; {24#false} is VALID [2020-07-28 14:46:53,496 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-28 14:46:53,497 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [737271292] [2020-07-28 14:46:53,498 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-28 14:46:53,498 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-07-28 14:46:53,499 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [267811831] [2020-07-28 14:46:53,505 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 11 [2020-07-28 14:46:53,507 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-28 14:46:53,511 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states. [2020-07-28 14:46:53,537 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 11 edges. 11 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-28 14:46:53,538 INFO L459 AbstractCegarLoop]: Interpolant automaton has 2 states [2020-07-28 14:46:53,539 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-28 14:46:53,547 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2020-07-28 14:46:53,548 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2020-07-28 14:46:53,551 INFO L87 Difference]: Start difference. First operand 20 states. Second operand 2 states. [2020-07-28 14:46:53,610 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-28 14:46:53,610 INFO L93 Difference]: Finished difference Result 37 states and 50 transitions. [2020-07-28 14:46:53,611 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2020-07-28 14:46:53,611 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 11 [2020-07-28 14:46:53,611 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-28 14:46:53,613 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2020-07-28 14:46:53,621 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 50 transitions. [2020-07-28 14:46:53,622 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2020-07-28 14:46:53,626 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 50 transitions. [2020-07-28 14:46:53,626 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states and 50 transitions. [2020-07-28 14:46:53,708 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 50 edges. 50 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-28 14:46:53,719 INFO L225 Difference]: With dead ends: 37 [2020-07-28 14:46:53,719 INFO L226 Difference]: Without dead ends: 16 [2020-07-28 14:46:53,723 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2020-07-28 14:46:53,741 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16 states. [2020-07-28 14:46:53,757 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16 to 16. [2020-07-28 14:46:53,757 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-28 14:46:53,758 INFO L82 GeneralOperation]: Start isEquivalent. First operand 16 states. Second operand 16 states. [2020-07-28 14:46:53,759 INFO L74 IsIncluded]: Start isIncluded. First operand 16 states. Second operand 16 states. [2020-07-28 14:46:53,759 INFO L87 Difference]: Start difference. First operand 16 states. Second operand 16 states. [2020-07-28 14:46:53,762 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-28 14:46:53,762 INFO L93 Difference]: Finished difference Result 16 states and 18 transitions. [2020-07-28 14:46:53,763 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 18 transitions. [2020-07-28 14:46:53,763 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-28 14:46:53,763 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-28 14:46:53,764 INFO L74 IsIncluded]: Start isIncluded. First operand 16 states. Second operand 16 states. [2020-07-28 14:46:53,764 INFO L87 Difference]: Start difference. First operand 16 states. Second operand 16 states. [2020-07-28 14:46:53,766 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-28 14:46:53,767 INFO L93 Difference]: Finished difference Result 16 states and 18 transitions. [2020-07-28 14:46:53,767 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 18 transitions. [2020-07-28 14:46:53,768 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-28 14:46:53,768 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-28 14:46:53,768 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-28 14:46:53,769 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-28 14:46:53,769 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2020-07-28 14:46:53,771 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 18 transitions. [2020-07-28 14:46:53,773 INFO L78 Accepts]: Start accepts. Automaton has 16 states and 18 transitions. Word has length 11 [2020-07-28 14:46:53,773 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-28 14:46:53,773 INFO L479 AbstractCegarLoop]: Abstraction has 16 states and 18 transitions. [2020-07-28 14:46:53,774 INFO L480 AbstractCegarLoop]: Interpolant automaton has 2 states. [2020-07-28 14:46:53,774 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 18 transitions. [2020-07-28 14:46:53,775 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2020-07-28 14:46:53,775 INFO L414 BasicCegarLoop]: Found error trace [2020-07-28 14:46:53,775 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-28 14:46:53,776 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-07-28 14:46:53,776 INFO L427 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-28 14:46:53,776 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-28 14:46:53,777 INFO L82 PathProgramCache]: Analyzing trace with hash -411746854, now seen corresponding path program 1 times [2020-07-28 14:46:53,777 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-28 14:46:53,777 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [255160490] [2020-07-28 14:46:53,778 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-28 14:46:53,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-28 14:46:53,899 INFO L280 TraceCheckUtils]: 0: Hoare triple {123#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; {123#true} is VALID [2020-07-28 14:46:53,899 INFO L280 TraceCheckUtils]: 1: Hoare triple {123#true} havoc main_#res;havoc main_#t~nondet0, main_#t~post1, main_#t~mem3, main_#t~post2, main_#t~mem5, main_#t~post4, main_~S~0, main_~i~0, main_~#a~0.base, main_~#a~0.offset;assume -2147483648 <= main_#t~nondet0 && main_#t~nondet0 <= 2147483647;main_~S~0 := main_#t~nondet0;havoc main_#t~nondet0;assume_abort_if_not_#in~cond := (if main_~S~0 > 1 then 1 else 0);havoc assume_abort_if_not_~cond;assume_abort_if_not_~cond := assume_abort_if_not_#in~cond; {123#true} is VALID [2020-07-28 14:46:53,900 INFO L280 TraceCheckUtils]: 2: Hoare triple {123#true} assume !(0 == assume_abort_if_not_~cond); {123#true} is VALID [2020-07-28 14:46:53,902 INFO L280 TraceCheckUtils]: 3: Hoare triple {123#true} havoc main_~i~0;call main_~#a~0.base, main_~#a~0.offset := #Ultimate.allocOnStack(4 * main_~S~0);main_~i~0 := 0; {125#(= 0 ULTIMATE.start_main_~i~0)} is VALID [2020-07-28 14:46:53,903 INFO L280 TraceCheckUtils]: 4: Hoare triple {125#(= 0 ULTIMATE.start_main_~i~0)} assume !(main_~i~0 < main_~S~0); {126#(<= ULTIMATE.start_main_~S~0 0)} is VALID [2020-07-28 14:46:53,904 INFO L280 TraceCheckUtils]: 5: Hoare triple {126#(<= ULTIMATE.start_main_~S~0 0)} main_~i~0 := 0; {126#(<= ULTIMATE.start_main_~S~0 0)} is VALID [2020-07-28 14:46:53,905 INFO L280 TraceCheckUtils]: 6: Hoare triple {126#(<= ULTIMATE.start_main_~S~0 0)} assume !(main_~i~0 < main_~S~0); {126#(<= ULTIMATE.start_main_~S~0 0)} is VALID [2020-07-28 14:46:53,906 INFO L280 TraceCheckUtils]: 7: Hoare triple {126#(<= ULTIMATE.start_main_~S~0 0)} main_~i~0 := 0; {127#(and (= 0 ULTIMATE.start_main_~i~0) (<= ULTIMATE.start_main_~S~0 0))} is VALID [2020-07-28 14:46:53,908 INFO L280 TraceCheckUtils]: 8: Hoare triple {127#(and (= 0 ULTIMATE.start_main_~i~0) (<= ULTIMATE.start_main_~S~0 0))} assume !!(main_~i~0 < main_~S~0);call main_#t~mem5 := read~int(main_~#a~0.base, main_~#a~0.offset + 4 * main_~i~0, 4);__VERIFIER_assert_#in~cond := (if -1 == main_#t~mem5 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; {124#false} is VALID [2020-07-28 14:46:53,909 INFO L280 TraceCheckUtils]: 9: Hoare triple {124#false} assume 0 == __VERIFIER_assert_~cond; {124#false} is VALID [2020-07-28 14:46:53,909 INFO L280 TraceCheckUtils]: 10: Hoare triple {124#false} assume !false; {124#false} is VALID [2020-07-28 14:46:53,910 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-28 14:46:53,911 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [255160490] [2020-07-28 14:46:53,911 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-28 14:46:53,911 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-07-28 14:46:53,912 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [483014338] [2020-07-28 14:46:53,914 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 11 [2020-07-28 14:46:53,914 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-28 14:46:53,914 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states. [2020-07-28 14:46:53,934 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 11 edges. 11 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-28 14:46:53,934 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-07-28 14:46:53,935 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-28 14:46:53,935 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-07-28 14:46:53,935 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-07-28 14:46:53,936 INFO L87 Difference]: Start difference. First operand 16 states and 18 transitions. Second operand 5 states. [2020-07-28 14:46:54,095 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-28 14:46:54,095 INFO L93 Difference]: Finished difference Result 39 states and 45 transitions. [2020-07-28 14:46:54,096 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-07-28 14:46:54,096 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 11 [2020-07-28 14:46:54,096 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-28 14:46:54,097 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2020-07-28 14:46:54,099 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 45 transitions. [2020-07-28 14:46:54,099 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2020-07-28 14:46:54,101 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 45 transitions. [2020-07-28 14:46:54,102 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states and 45 transitions. [2020-07-28 14:46:54,172 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 45 edges. 45 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-28 14:46:54,174 INFO L225 Difference]: With dead ends: 39 [2020-07-28 14:46:54,175 INFO L226 Difference]: Without dead ends: 26 [2020-07-28 14:46:54,178 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-07-28 14:46:54,179 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2020-07-28 14:46:54,186 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 18. [2020-07-28 14:46:54,187 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-28 14:46:54,187 INFO L82 GeneralOperation]: Start isEquivalent. First operand 26 states. Second operand 18 states. [2020-07-28 14:46:54,187 INFO L74 IsIncluded]: Start isIncluded. First operand 26 states. Second operand 18 states. [2020-07-28 14:46:54,187 INFO L87 Difference]: Start difference. First operand 26 states. Second operand 18 states. [2020-07-28 14:46:54,190 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-28 14:46:54,190 INFO L93 Difference]: Finished difference Result 26 states and 28 transitions. [2020-07-28 14:46:54,190 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 28 transitions. [2020-07-28 14:46:54,191 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-28 14:46:54,191 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-28 14:46:54,191 INFO L74 IsIncluded]: Start isIncluded. First operand 18 states. Second operand 26 states. [2020-07-28 14:46:54,191 INFO L87 Difference]: Start difference. First operand 18 states. Second operand 26 states. [2020-07-28 14:46:54,196 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-28 14:46:54,196 INFO L93 Difference]: Finished difference Result 26 states and 28 transitions. [2020-07-28 14:46:54,198 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 28 transitions. [2020-07-28 14:46:54,199 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-28 14:46:54,199 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-28 14:46:54,199 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-28 14:46:54,200 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-28 14:46:54,200 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2020-07-28 14:46:54,203 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 20 transitions. [2020-07-28 14:46:54,203 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 20 transitions. Word has length 11 [2020-07-28 14:46:54,203 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-28 14:46:54,204 INFO L479 AbstractCegarLoop]: Abstraction has 18 states and 20 transitions. [2020-07-28 14:46:54,204 INFO L480 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-07-28 14:46:54,204 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 20 transitions. [2020-07-28 14:46:54,205 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2020-07-28 14:46:54,205 INFO L414 BasicCegarLoop]: Found error trace [2020-07-28 14:46:54,205 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-28 14:46:54,206 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-07-28 14:46:54,206 INFO L427 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-28 14:46:54,206 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-28 14:46:54,207 INFO L82 PathProgramCache]: Analyzing trace with hash 467501014, now seen corresponding path program 1 times [2020-07-28 14:46:54,207 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-28 14:46:54,208 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1880699264] [2020-07-28 14:46:54,208 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-28 14:46:54,248 ERROR L271 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2020-07-28 14:46:54,248 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [451700104] [2020-07-28 14:46:54,249 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-28 14:46:54,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-28 14:46:54,303 INFO L263 TraceCheckSpWp]: Trace formula consists of 51 conjuncts, 8 conjunts are in the unsatisfiable core [2020-07-28 14:46:54,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-28 14:46:54,319 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-28 14:46:54,407 INFO L342 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 2, 1] term [2020-07-28 14:46:54,408 INFO L523 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-07-28 14:46:54,556 INFO L280 TraceCheckUtils]: 0: Hoare triple {254#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; {254#true} is VALID [2020-07-28 14:46:54,558 INFO L280 TraceCheckUtils]: 1: Hoare triple {254#true} havoc main_#res;havoc main_#t~nondet0, main_#t~post1, main_#t~mem3, main_#t~post2, main_#t~mem5, main_#t~post4, main_~S~0, main_~i~0, main_~#a~0.base, main_~#a~0.offset;assume -2147483648 <= main_#t~nondet0 && main_#t~nondet0 <= 2147483647;main_~S~0 := main_#t~nondet0;havoc main_#t~nondet0;assume_abort_if_not_#in~cond := (if main_~S~0 > 1 then 1 else 0);havoc assume_abort_if_not_~cond;assume_abort_if_not_~cond := assume_abort_if_not_#in~cond; {262#(or (and (= 1 ULTIMATE.start_assume_abort_if_not_~cond) (< 1 ULTIMATE.start_main_~S~0)) (and (<= ULTIMATE.start_main_~S~0 1) (= 0 ULTIMATE.start_assume_abort_if_not_~cond)))} is VALID [2020-07-28 14:46:54,560 INFO L280 TraceCheckUtils]: 2: Hoare triple {262#(or (and (= 1 ULTIMATE.start_assume_abort_if_not_~cond) (< 1 ULTIMATE.start_main_~S~0)) (and (<= ULTIMATE.start_main_~S~0 1) (= 0 ULTIMATE.start_assume_abort_if_not_~cond)))} assume !(0 == assume_abort_if_not_~cond); {266#(< 1 ULTIMATE.start_main_~S~0)} is VALID [2020-07-28 14:46:54,561 INFO L280 TraceCheckUtils]: 3: Hoare triple {266#(< 1 ULTIMATE.start_main_~S~0)} havoc main_~i~0;call main_~#a~0.base, main_~#a~0.offset := #Ultimate.allocOnStack(4 * main_~S~0);main_~i~0 := 0; {270#(and (< 1 ULTIMATE.start_main_~S~0) (<= ULTIMATE.start_main_~i~0 0))} is VALID [2020-07-28 14:46:54,563 INFO L280 TraceCheckUtils]: 4: Hoare triple {270#(and (< 1 ULTIMATE.start_main_~S~0) (<= ULTIMATE.start_main_~i~0 0))} assume !!(main_~i~0 < main_~S~0);call write~int((main_~i~0 - 1) * (1 + main_~i~0), main_~#a~0.base, main_~#a~0.offset + 4 * main_~i~0, 4); {270#(and (< 1 ULTIMATE.start_main_~S~0) (<= ULTIMATE.start_main_~i~0 0))} is VALID [2020-07-28 14:46:54,564 INFO L280 TraceCheckUtils]: 5: Hoare triple {270#(and (< 1 ULTIMATE.start_main_~S~0) (<= ULTIMATE.start_main_~i~0 0))} main_#t~post1 := main_~i~0;main_~i~0 := 1 + main_#t~post1;havoc main_#t~post1; {277#(and (< 1 ULTIMATE.start_main_~S~0) (<= ULTIMATE.start_main_~i~0 1))} is VALID [2020-07-28 14:46:54,566 INFO L280 TraceCheckUtils]: 6: Hoare triple {277#(and (< 1 ULTIMATE.start_main_~S~0) (<= ULTIMATE.start_main_~i~0 1))} assume !(main_~i~0 < main_~S~0); {255#false} is VALID [2020-07-28 14:46:54,566 INFO L280 TraceCheckUtils]: 7: Hoare triple {255#false} main_~i~0 := 0; {255#false} is VALID [2020-07-28 14:46:54,566 INFO L280 TraceCheckUtils]: 8: Hoare triple {255#false} assume !!(main_~i~0 < main_~S~0);call main_#t~mem3 := read~int(main_~#a~0.base, main_~#a~0.offset + 4 * main_~i~0, 4);call write~int(main_#t~mem3 - main_~i~0 * main_~i~0, main_~#a~0.base, main_~#a~0.offset + 4 * main_~i~0, 4);havoc main_#t~mem3; {255#false} is VALID [2020-07-28 14:46:54,567 INFO L280 TraceCheckUtils]: 9: Hoare triple {255#false} main_#t~post2 := main_~i~0;main_~i~0 := 1 + main_#t~post2;havoc main_#t~post2; {255#false} is VALID [2020-07-28 14:46:54,567 INFO L280 TraceCheckUtils]: 10: Hoare triple {255#false} assume !(main_~i~0 < main_~S~0); {255#false} is VALID [2020-07-28 14:46:54,568 INFO L280 TraceCheckUtils]: 11: Hoare triple {255#false} main_~i~0 := 0; {255#false} is VALID [2020-07-28 14:46:54,568 INFO L280 TraceCheckUtils]: 12: Hoare triple {255#false} assume !!(main_~i~0 < main_~S~0);call main_#t~mem5 := read~int(main_~#a~0.base, main_~#a~0.offset + 4 * main_~i~0, 4);__VERIFIER_assert_#in~cond := (if -1 == main_#t~mem5 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; {255#false} is VALID [2020-07-28 14:46:54,568 INFO L280 TraceCheckUtils]: 13: Hoare triple {255#false} assume 0 == __VERIFIER_assert_~cond; {255#false} is VALID [2020-07-28 14:46:54,569 INFO L280 TraceCheckUtils]: 14: Hoare triple {255#false} assume !false; {255#false} is VALID [2020-07-28 14:46:54,571 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2020-07-28 14:46:54,571 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1880699264] [2020-07-28 14:46:54,572 WARN L333 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2020-07-28 14:46:54,572 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [451700104] [2020-07-28 14:46:54,572 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-07-28 14:46:54,573 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6] total 6 [2020-07-28 14:46:54,573 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1404451170] [2020-07-28 14:46:54,573 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 15 [2020-07-28 14:46:54,574 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-28 14:46:54,574 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states. [2020-07-28 14:46:54,597 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 15 edges. 15 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-28 14:46:54,597 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-07-28 14:46:54,597 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-28 14:46:54,597 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-07-28 14:46:54,598 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2020-07-28 14:46:54,598 INFO L87 Difference]: Start difference. First operand 18 states and 20 transitions. Second operand 6 states. [2020-07-28 14:46:54,907 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-28 14:46:54,907 INFO L93 Difference]: Finished difference Result 47 states and 52 transitions. [2020-07-28 14:46:54,907 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-07-28 14:46:54,907 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 15 [2020-07-28 14:46:54,908 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-28 14:46:54,908 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2020-07-28 14:46:54,910 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 51 transitions. [2020-07-28 14:46:54,910 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2020-07-28 14:46:54,912 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 51 transitions. [2020-07-28 14:46:54,912 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states and 51 transitions. [2020-07-28 14:46:55,004 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 51 edges. 51 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-28 14:46:55,006 INFO L225 Difference]: With dead ends: 47 [2020-07-28 14:46:55,006 INFO L226 Difference]: Without dead ends: 36 [2020-07-28 14:46:55,007 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-07-28 14:46:55,007 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2020-07-28 14:46:55,037 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 22. [2020-07-28 14:46:55,037 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-28 14:46:55,037 INFO L82 GeneralOperation]: Start isEquivalent. First operand 36 states. Second operand 22 states. [2020-07-28 14:46:55,038 INFO L74 IsIncluded]: Start isIncluded. First operand 36 states. Second operand 22 states. [2020-07-28 14:46:55,038 INFO L87 Difference]: Start difference. First operand 36 states. Second operand 22 states. [2020-07-28 14:46:55,040 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-28 14:46:55,041 INFO L93 Difference]: Finished difference Result 36 states and 38 transitions. [2020-07-28 14:46:55,041 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 38 transitions. [2020-07-28 14:46:55,041 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-28 14:46:55,042 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-28 14:46:55,042 INFO L74 IsIncluded]: Start isIncluded. First operand 22 states. Second operand 36 states. [2020-07-28 14:46:55,042 INFO L87 Difference]: Start difference. First operand 22 states. Second operand 36 states. [2020-07-28 14:46:55,045 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-28 14:46:55,045 INFO L93 Difference]: Finished difference Result 36 states and 38 transitions. [2020-07-28 14:46:55,045 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 38 transitions. [2020-07-28 14:46:55,046 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-28 14:46:55,046 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-28 14:46:55,046 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-28 14:46:55,047 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-28 14:46:55,047 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2020-07-28 14:46:55,048 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 24 transitions. [2020-07-28 14:46:55,048 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 24 transitions. Word has length 15 [2020-07-28 14:46:55,049 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-28 14:46:55,049 INFO L479 AbstractCegarLoop]: Abstraction has 22 states and 24 transitions. [2020-07-28 14:46:55,049 INFO L480 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-07-28 14:46:55,049 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 24 transitions. [2020-07-28 14:46:55,050 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-07-28 14:46:55,050 INFO L414 BasicCegarLoop]: Found error trace [2020-07-28 14:46:55,050 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-28 14:46:55,251 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable2 [2020-07-28 14:46:55,252 INFO L427 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-28 14:46:55,252 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-28 14:46:55,252 INFO L82 PathProgramCache]: Analyzing trace with hash 1570853842, now seen corresponding path program 2 times [2020-07-28 14:46:55,253 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-28 14:46:55,254 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [319790730] [2020-07-28 14:46:55,254 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-28 14:46:55,268 ERROR L271 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2020-07-28 14:46:55,268 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [831402037] [2020-07-28 14:46:55,269 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-28 14:46:55,328 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2020-07-28 14:46:55,329 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-07-28 14:46:55,330 INFO L263 TraceCheckSpWp]: Trace formula consists of 59 conjuncts, 17 conjunts are in the unsatisfiable core [2020-07-28 14:46:55,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-28 14:46:55,343 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-28 14:46:55,395 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 17 [2020-07-28 14:46:55,395 INFO L544 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-07-28 14:46:55,406 INFO L624 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-07-28 14:46:55,407 INFO L544 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-07-28 14:46:55,407 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:25, output treesize:21 [2020-07-28 14:46:55,414 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [319790730] [2020-07-28 14:46:55,415 WARN L333 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2020-07-28 14:46:55,415 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [831402037] [2020-07-28 14:46:55,415 WARN L333 FreeRefinementEngine]: Interpolation failed due to KNOWN_DEPENDING: transformation to positive normal form unsound [2020-07-28 14:46:55,416 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 0 imperfect interpolant sequences. [2020-07-28 14:46:55,416 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [] total 0 [2020-07-28 14:46:55,416 ERROR L206 FreeRefinementEngine]: Strategy CAMEL failed to provide any proof altough trace is infeasible [2020-07-28 14:46:55,416 INFO L520 BasicCegarLoop]: Counterexample might be feasible [2020-07-28 14:46:55,621 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-28 14:46:55,639 WARN L170 areAnnotationChecker]: ULTIMATE.startENTRY has no Hoare annotation [2020-07-28 14:46:55,639 WARN L170 areAnnotationChecker]: L-1 has no Hoare annotation [2020-07-28 14:46:55,639 WARN L170 areAnnotationChecker]: L4 has no Hoare annotation [2020-07-28 14:46:55,639 WARN L170 areAnnotationChecker]: L4 has no Hoare annotation [2020-07-28 14:46:55,639 WARN L170 areAnnotationChecker]: L3 has no Hoare annotation [2020-07-28 14:46:55,640 WARN L170 areAnnotationChecker]: L15-3 has no Hoare annotation [2020-07-28 14:46:55,640 WARN L170 areAnnotationChecker]: L15-3 has no Hoare annotation [2020-07-28 14:46:55,640 WARN L170 areAnnotationChecker]: L15-3 has no Hoare annotation [2020-07-28 14:46:55,640 WARN L170 areAnnotationChecker]: L15-4 has no Hoare annotation [2020-07-28 14:46:55,640 WARN L170 areAnnotationChecker]: L15-2 has no Hoare annotation [2020-07-28 14:46:55,640 WARN L170 areAnnotationChecker]: L18-3 has no Hoare annotation [2020-07-28 14:46:55,640 WARN L170 areAnnotationChecker]: L18-3 has no Hoare annotation [2020-07-28 14:46:55,641 WARN L170 areAnnotationChecker]: L18-3 has no Hoare annotation [2020-07-28 14:46:55,641 WARN L170 areAnnotationChecker]: L18-4 has no Hoare annotation [2020-07-28 14:46:55,641 WARN L170 areAnnotationChecker]: L18-2 has no Hoare annotation [2020-07-28 14:46:55,641 WARN L170 areAnnotationChecker]: L21-3 has no Hoare annotation [2020-07-28 14:46:55,641 WARN L170 areAnnotationChecker]: L21-3 has no Hoare annotation [2020-07-28 14:46:55,641 WARN L170 areAnnotationChecker]: L21-3 has no Hoare annotation [2020-07-28 14:46:55,641 WARN L170 areAnnotationChecker]: L21-4 has no Hoare annotation [2020-07-28 14:46:55,641 WARN L170 areAnnotationChecker]: L6 has no Hoare annotation [2020-07-28 14:46:55,642 WARN L170 areAnnotationChecker]: L6 has no Hoare annotation [2020-07-28 14:46:55,642 WARN L170 areAnnotationChecker]: L23 has no Hoare annotation [2020-07-28 14:46:55,642 WARN L170 areAnnotationChecker]: L6-1 has no Hoare annotation [2020-07-28 14:46:55,642 WARN L170 areAnnotationChecker]: L6-1 has no Hoare annotation [2020-07-28 14:46:55,642 WARN L170 areAnnotationChecker]: L6-3 has no Hoare annotation [2020-07-28 14:46:55,642 WARN L170 areAnnotationChecker]: ULTIMATE.startFINAL has no Hoare annotation [2020-07-28 14:46:55,642 WARN L170 areAnnotationChecker]: L21-2 has no Hoare annotation [2020-07-28 14:46:55,643 INFO L163 areAnnotationChecker]: CFG has 0 edges. 0 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. 0 times interpolants missing. [2020-07-28 14:46:55,646 WARN L231 ceAbstractionStarter]: Unable to decide correctness. Please check the following counterexample manually. [2020-07-28 14:46:55,646 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 28.07 02:46:55 BoogieIcfgContainer [2020-07-28 14:46:55,646 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-07-28 14:46:55,647 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2020-07-28 14:46:55,647 INFO L271 PluginConnector]: Initializing Witness Printer... [2020-07-28 14:46:55,647 INFO L275 PluginConnector]: Witness Printer initialized [2020-07-28 14:46:55,648 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.07 02:46:53" (3/4) ... [2020-07-28 14:46:55,651 INFO L140 WitnessPrinter]: No result that supports witness generation found [2020-07-28 14:46:55,651 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2020-07-28 14:46:55,654 INFO L168 Benchmark]: Toolchain (without parser) took 3271.25 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 140.0 MB). Free memory was 956.2 MB in the beginning and 902.5 MB in the end (delta: 53.7 MB). Peak memory consumption was 193.7 MB. Max. memory is 11.5 GB. [2020-07-28 14:46:55,656 INFO L168 Benchmark]: CDTParser took 0.79 ms. Allocated memory is still 1.0 GB. Free memory is still 981.7 MB. There was no memory consumed. Max. memory is 11.5 GB. [2020-07-28 14:46:55,656 INFO L168 Benchmark]: CACSL2BoogieTranslator took 296.33 ms. Allocated memory is still 1.0 GB. Free memory was 956.2 MB in the beginning and 945.5 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. [2020-07-28 14:46:55,658 INFO L168 Benchmark]: Boogie Procedure Inliner took 100.65 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 140.0 MB). Free memory was 945.5 MB in the beginning and 1.1 GB in the end (delta: -184.5 MB). Peak memory consumption was 9.7 MB. Max. memory is 11.5 GB. [2020-07-28 14:46:55,663 INFO L168 Benchmark]: Boogie Preprocessor took 26.86 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2020-07-28 14:46:55,665 INFO L168 Benchmark]: RCFGBuilder took 433.59 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 25.8 MB). Peak memory consumption was 25.8 MB. Max. memory is 11.5 GB. [2020-07-28 14:46:55,666 INFO L168 Benchmark]: TraceAbstraction took 2401.68 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 909.1 MB in the end (delta: 195.2 MB). Peak memory consumption was 195.2 MB. Max. memory is 11.5 GB. [2020-07-28 14:46:55,667 INFO L168 Benchmark]: Witness Printer took 5.01 ms. Allocated memory is still 1.2 GB. Free memory was 909.1 MB in the beginning and 902.5 MB in the end (delta: 6.6 MB). Peak memory consumption was 6.6 MB. Max. memory is 11.5 GB. [2020-07-28 14:46:55,680 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - AssertionsEnabledResult: Assertions are enabled Assertions are enabled - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.79 ms. Allocated memory is still 1.0 GB. Free memory is still 981.7 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 296.33 ms. Allocated memory is still 1.0 GB. Free memory was 956.2 MB in the beginning and 945.5 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 100.65 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 140.0 MB). Free memory was 945.5 MB in the beginning and 1.1 GB in the end (delta: -184.5 MB). Peak memory consumption was 9.7 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 26.86 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 433.59 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 25.8 MB). Peak memory consumption was 25.8 MB. Max. memory is 11.5 GB. * TraceAbstraction took 2401.68 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 909.1 MB in the end (delta: 195.2 MB). Peak memory consumption was 195.2 MB. Max. memory is 11.5 GB. * Witness Printer took 5.01 ms. Allocated memory is still 1.2 GB. Free memory was 909.1 MB in the beginning and 902.5 MB in the end (delta: 6.6 MB). Peak memory consumption was 6.6 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - UnprovableResult [Line: 6]: Unable to prove that call of __VERIFIER_error() unreachable Unable to prove that call of __VERIFIER_error() unreachable Reason: unable to decide satisfiability of path constraint. Possible FailurePath: [L10] int S=__VERIFIER_nondet_int(); [L4] COND FALSE !(!cond) [L12] int i; [L13] int a[S]; [L15] i=0 [L15] COND TRUE i 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(__VERIFIER_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 -> 37750d464f6e46036bd3e2c16773841dab36b946 [2020-07-28 14:46:58,126 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-07-28 14:46:58,139 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-07-28 14:46:58,143 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-07-28 14:46:58,145 INFO L271 PluginConnector]: Initializing CDTParser... [2020-07-28 14:46:58,146 INFO L275 PluginConnector]: CDTParser initialized [2020-07-28 14:46:58,147 INFO L429 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/array-cav19/array_tiling_poly6.c [2020-07-28 14:46:58,213 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e1ae2d1a8/990b2eb7b7114158898e9b90e634b1ee/FLAG3cc2cd260 [2020-07-28 14:46:58,698 INFO L306 CDTParser]: Found 1 translation units. [2020-07-28 14:46:58,699 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/array-cav19/array_tiling_poly6.c [2020-07-28 14:46:58,707 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e1ae2d1a8/990b2eb7b7114158898e9b90e634b1ee/FLAG3cc2cd260 [2020-07-28 14:46:59,093 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e1ae2d1a8/990b2eb7b7114158898e9b90e634b1ee [2020-07-28 14:46:59,097 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-07-28 14:46:59,100 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2020-07-28 14:46:59,102 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-07-28 14:46:59,102 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-07-28 14:46:59,106 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-07-28 14:46:59,107 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.07 02:46:59" (1/1) ... [2020-07-28 14:46:59,110 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@674049d7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.07 02:46:59, skipping insertion in model container [2020-07-28 14:46:59,111 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.07 02:46:59" (1/1) ... [2020-07-28 14:46:59,119 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-07-28 14:46:59,140 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-07-28 14:46:59,354 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-28 14:46:59,359 INFO L203 MainTranslator]: Completed pre-run [2020-07-28 14:46:59,384 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-28 14:46:59,467 INFO L208 MainTranslator]: Completed translation [2020-07-28 14:46:59,467 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.07 02:46:59 WrapperNode [2020-07-28 14:46:59,467 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-07-28 14:46:59,468 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2020-07-28 14:46:59,468 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2020-07-28 14:46:59,469 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2020-07-28 14:46:59,477 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.07 02:46:59" (1/1) ... [2020-07-28 14:46:59,487 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.07 02:46:59" (1/1) ... [2020-07-28 14:46:59,512 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2020-07-28 14:46:59,512 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-07-28 14:46:59,513 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-07-28 14:46:59,513 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-07-28 14:46:59,521 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.07 02:46:59" (1/1) ... [2020-07-28 14:46:59,521 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.07 02:46:59" (1/1) ... [2020-07-28 14:46:59,524 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.07 02:46:59" (1/1) ... [2020-07-28 14:46:59,524 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.07 02:46:59" (1/1) ... [2020-07-28 14:46:59,534 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.07 02:46:59" (1/1) ... [2020-07-28 14:46:59,540 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.07 02:46:59" (1/1) ... [2020-07-28 14:46:59,542 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.07 02:46:59" (1/1) ... [2020-07-28 14:46:59,545 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-07-28 14:46:59,545 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-07-28 14:46:59,545 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-07-28 14:46:59,546 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-07-28 14:46:59,547 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.07 02:46:59" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-07-28 14:46:59,609 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4 [2020-07-28 14:46:59,609 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-07-28 14:46:59,610 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-07-28 14:46:59,610 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-07-28 14:46:59,610 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2020-07-28 14:46:59,610 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2020-07-28 14:46:59,988 INFO L290 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-07-28 14:46:59,991 INFO L295 CfgBuilder]: Removed 11 assume(true) statements. [2020-07-28 14:46:59,995 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.07 02:46:59 BoogieIcfgContainer [2020-07-28 14:46:59,995 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-07-28 14:46:59,997 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-07-28 14:46:59,997 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-07-28 14:47:00,000 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-07-28 14:47:00,001 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 28.07 02:46:59" (1/3) ... [2020-07-28 14:47:00,002 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@65ab7951 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.07 02:47:00, skipping insertion in model container [2020-07-28 14:47:00,003 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.07 02:46:59" (2/3) ... [2020-07-28 14:47:00,003 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@65ab7951 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.07 02:47:00, skipping insertion in model container [2020-07-28 14:47:00,003 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.07 02:46:59" (3/3) ... [2020-07-28 14:47:00,005 INFO L109 eAbstractionObserver]: Analyzing ICFG array_tiling_poly6.c [2020-07-28 14:47:00,017 INFO L157 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2020-07-28 14:47:00,025 INFO L169 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2020-07-28 14:47:00,041 INFO L251 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2020-07-28 14:47:00,066 INFO L375 AbstractCegarLoop]: Interprodecural is true [2020-07-28 14:47:00,067 INFO L376 AbstractCegarLoop]: Hoare is true [2020-07-28 14:47:00,067 INFO L377 AbstractCegarLoop]: Compute interpolants for FPandBP [2020-07-28 14:47:00,067 INFO L378 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-07-28 14:47:00,067 INFO L379 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-07-28 14:47:00,068 INFO L380 AbstractCegarLoop]: Difference is false [2020-07-28 14:47:00,068 INFO L381 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-07-28 14:47:00,068 INFO L385 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-07-28 14:47:00,085 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states. [2020-07-28 14:47:00,092 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2020-07-28 14:47:00,092 INFO L414 BasicCegarLoop]: Found error trace [2020-07-28 14:47:00,093 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-28 14:47:00,093 INFO L427 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-28 14:47:00,099 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-28 14:47:00,099 INFO L82 PathProgramCache]: Analyzing trace with hash -56209308, now seen corresponding path program 1 times [2020-07-28 14:47:00,111 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2020-07-28 14:47:00,111 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2032571627] [2020-07-28 14:47:00,112 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 2 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with mathsat -unsat_core_generation=3 [2020-07-28 14:47:00,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-28 14:47:00,186 INFO L263 TraceCheckSpWp]: Trace formula consists of 27 conjuncts, 1 conjunts are in the unsatisfiable core [2020-07-28 14:47:00,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-28 14:47:00,202 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-28 14:47:00,266 INFO L280 TraceCheckUtils]: 0: Hoare triple {23#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1];assume ~bvult32(0bv32, #StackHeapBarrier); {23#true} is VALID [2020-07-28 14:47:00,267 INFO L280 TraceCheckUtils]: 1: Hoare triple {23#true} havoc main_#res;havoc main_#t~nondet0, main_#t~post1, main_#t~mem3, main_#t~post2, main_#t~mem5, main_#t~post4, main_~S~0, main_~i~0, main_~#a~0.base, main_~#a~0.offset;main_~S~0 := main_#t~nondet0;havoc main_#t~nondet0;assume_abort_if_not_#in~cond := (if ~bvsgt32(main_~S~0, 1bv32) then 1bv32 else 0bv32);havoc assume_abort_if_not_~cond;assume_abort_if_not_~cond := assume_abort_if_not_#in~cond; {23#true} is VALID [2020-07-28 14:47:00,268 INFO L280 TraceCheckUtils]: 2: Hoare triple {23#true} assume 0bv32 == assume_abort_if_not_~cond;assume false; {24#false} is VALID [2020-07-28 14:47:00,269 INFO L280 TraceCheckUtils]: 3: Hoare triple {24#false} havoc main_~i~0;call main_~#a~0.base, main_~#a~0.offset := #Ultimate.allocOnStack(~bvmul32(4bv32, main_~S~0));main_~i~0 := 0bv32; {24#false} is VALID [2020-07-28 14:47:00,270 INFO L280 TraceCheckUtils]: 4: Hoare triple {24#false} assume !true; {24#false} is VALID [2020-07-28 14:47:00,270 INFO L280 TraceCheckUtils]: 5: Hoare triple {24#false} main_~i~0 := 0bv32; {24#false} is VALID [2020-07-28 14:47:00,271 INFO L280 TraceCheckUtils]: 6: Hoare triple {24#false} assume !true; {24#false} is VALID [2020-07-28 14:47:00,271 INFO L280 TraceCheckUtils]: 7: Hoare triple {24#false} main_~i~0 := 0bv32; {24#false} is VALID [2020-07-28 14:47:00,272 INFO L280 TraceCheckUtils]: 8: Hoare triple {24#false} assume !!~bvslt32(main_~i~0, main_~S~0);call main_#t~mem5 := read~intINTTYPE4(main_~#a~0.base, ~bvadd32(main_~#a~0.offset, ~bvmul32(4bv32, main_~i~0)), 4bv32);__VERIFIER_assert_#in~cond := (if 4294967295bv32 == main_#t~mem5 then 1bv32 else 0bv32);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; {24#false} is VALID [2020-07-28 14:47:00,272 INFO L280 TraceCheckUtils]: 9: Hoare triple {24#false} assume 0bv32 == __VERIFIER_assert_~cond; {24#false} is VALID [2020-07-28 14:47:00,273 INFO L280 TraceCheckUtils]: 10: Hoare triple {24#false} assume !false; {24#false} is VALID [2020-07-28 14:47:00,276 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-28 14:47:00,276 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-07-28 14:47:00,295 INFO L280 TraceCheckUtils]: 10: Hoare triple {24#false} assume !false; {24#false} is VALID [2020-07-28 14:47:00,296 INFO L280 TraceCheckUtils]: 9: Hoare triple {24#false} assume 0bv32 == __VERIFIER_assert_~cond; {24#false} is VALID [2020-07-28 14:47:00,296 INFO L280 TraceCheckUtils]: 8: Hoare triple {24#false} assume !!~bvslt32(main_~i~0, main_~S~0);call main_#t~mem5 := read~intINTTYPE4(main_~#a~0.base, ~bvadd32(main_~#a~0.offset, ~bvmul32(4bv32, main_~i~0)), 4bv32);__VERIFIER_assert_#in~cond := (if 4294967295bv32 == main_#t~mem5 then 1bv32 else 0bv32);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; {24#false} is VALID [2020-07-28 14:47:00,296 INFO L280 TraceCheckUtils]: 7: Hoare triple {24#false} main_~i~0 := 0bv32; {24#false} is VALID [2020-07-28 14:47:00,297 INFO L280 TraceCheckUtils]: 6: Hoare triple {24#false} assume !true; {24#false} is VALID [2020-07-28 14:47:00,298 INFO L280 TraceCheckUtils]: 5: Hoare triple {24#false} main_~i~0 := 0bv32; {24#false} is VALID [2020-07-28 14:47:00,298 INFO L280 TraceCheckUtils]: 4: Hoare triple {24#false} assume !true; {24#false} is VALID [2020-07-28 14:47:00,298 INFO L280 TraceCheckUtils]: 3: Hoare triple {24#false} havoc main_~i~0;call main_~#a~0.base, main_~#a~0.offset := #Ultimate.allocOnStack(~bvmul32(4bv32, main_~S~0));main_~i~0 := 0bv32; {24#false} is VALID [2020-07-28 14:47:00,300 INFO L280 TraceCheckUtils]: 2: Hoare triple {23#true} assume 0bv32 == assume_abort_if_not_~cond;assume false; {24#false} is VALID [2020-07-28 14:47:00,300 INFO L280 TraceCheckUtils]: 1: Hoare triple {23#true} havoc main_#res;havoc main_#t~nondet0, main_#t~post1, main_#t~mem3, main_#t~post2, main_#t~mem5, main_#t~post4, main_~S~0, main_~i~0, main_~#a~0.base, main_~#a~0.offset;main_~S~0 := main_#t~nondet0;havoc main_#t~nondet0;assume_abort_if_not_#in~cond := (if ~bvsgt32(main_~S~0, 1bv32) then 1bv32 else 0bv32);havoc assume_abort_if_not_~cond;assume_abort_if_not_~cond := assume_abort_if_not_#in~cond; {23#true} is VALID [2020-07-28 14:47:00,301 INFO L280 TraceCheckUtils]: 0: Hoare triple {23#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1];assume ~bvult32(0bv32, #StackHeapBarrier); {23#true} is VALID [2020-07-28 14:47:00,302 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-28 14:47:00,303 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2032571627] [2020-07-28 14:47:00,304 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2020-07-28 14:47:00,304 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2, 2] imperfect sequences [] total 2 [2020-07-28 14:47:00,306 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [709074770] [2020-07-28 14:47:00,313 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 11 [2020-07-28 14:47:00,314 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-28 14:47:00,319 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states. [2020-07-28 14:47:00,349 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 11 edges. 11 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-28 14:47:00,350 INFO L459 AbstractCegarLoop]: Interpolant automaton has 2 states [2020-07-28 14:47:00,350 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2020-07-28 14:47:00,360 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2020-07-28 14:47:00,361 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2020-07-28 14:47:00,363 INFO L87 Difference]: Start difference. First operand 20 states. Second operand 2 states. [2020-07-28 14:47:00,465 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-28 14:47:00,465 INFO L93 Difference]: Finished difference Result 37 states and 50 transitions. [2020-07-28 14:47:00,466 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2020-07-28 14:47:00,466 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 11 [2020-07-28 14:47:00,466 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-28 14:47:00,468 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2020-07-28 14:47:00,476 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 50 transitions. [2020-07-28 14:47:00,477 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2020-07-28 14:47:00,480 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 50 transitions. [2020-07-28 14:47:00,480 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states and 50 transitions. [2020-07-28 14:47:00,644 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 50 edges. 50 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-28 14:47:00,656 INFO L225 Difference]: With dead ends: 37 [2020-07-28 14:47:00,656 INFO L226 Difference]: Without dead ends: 16 [2020-07-28 14:47:00,660 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2020-07-28 14:47:00,683 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16 states. [2020-07-28 14:47:00,703 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16 to 16. [2020-07-28 14:47:00,704 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-28 14:47:00,704 INFO L82 GeneralOperation]: Start isEquivalent. First operand 16 states. Second operand 16 states. [2020-07-28 14:47:00,705 INFO L74 IsIncluded]: Start isIncluded. First operand 16 states. Second operand 16 states. [2020-07-28 14:47:00,705 INFO L87 Difference]: Start difference. First operand 16 states. Second operand 16 states. [2020-07-28 14:47:00,708 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-28 14:47:00,708 INFO L93 Difference]: Finished difference Result 16 states and 18 transitions. [2020-07-28 14:47:00,708 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 18 transitions. [2020-07-28 14:47:00,709 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-28 14:47:00,709 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-28 14:47:00,709 INFO L74 IsIncluded]: Start isIncluded. First operand 16 states. Second operand 16 states. [2020-07-28 14:47:00,709 INFO L87 Difference]: Start difference. First operand 16 states. Second operand 16 states. [2020-07-28 14:47:00,711 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-28 14:47:00,712 INFO L93 Difference]: Finished difference Result 16 states and 18 transitions. [2020-07-28 14:47:00,712 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 18 transitions. [2020-07-28 14:47:00,712 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-28 14:47:00,713 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-28 14:47:00,713 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-28 14:47:00,713 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-28 14:47:00,713 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2020-07-28 14:47:00,715 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 18 transitions. [2020-07-28 14:47:00,717 INFO L78 Accepts]: Start accepts. Automaton has 16 states and 18 transitions. Word has length 11 [2020-07-28 14:47:00,717 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-28 14:47:00,717 INFO L479 AbstractCegarLoop]: Abstraction has 16 states and 18 transitions. [2020-07-28 14:47:00,718 INFO L480 AbstractCegarLoop]: Interpolant automaton has 2 states. [2020-07-28 14:47:00,718 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 18 transitions. [2020-07-28 14:47:00,718 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2020-07-28 14:47:00,718 INFO L414 BasicCegarLoop]: Found error trace [2020-07-28 14:47:00,719 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-28 14:47:00,931 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 mathsat -unsat_core_generation=3 [2020-07-28 14:47:00,931 INFO L427 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-28 14:47:00,932 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-28 14:47:00,932 INFO L82 PathProgramCache]: Analyzing trace with hash -411746854, now seen corresponding path program 1 times [2020-07-28 14:47:00,933 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2020-07-28 14:47:00,933 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1342120149] [2020-07-28 14:47:00,934 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 3 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with mathsat -unsat_core_generation=3 [2020-07-28 14:47:00,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-28 14:47:00,975 INFO L263 TraceCheckSpWp]: Trace formula consists of 27 conjuncts, 5 conjunts are in the unsatisfiable core [2020-07-28 14:47:00,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-28 14:47:00,986 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-28 14:47:01,069 INFO L523 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-07-28 14:47:01,122 INFO L280 TraceCheckUtils]: 0: Hoare triple {183#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1];assume ~bvult32(0bv32, #StackHeapBarrier); {183#true} is VALID [2020-07-28 14:47:01,124 INFO L280 TraceCheckUtils]: 1: Hoare triple {183#true} havoc main_#res;havoc main_#t~nondet0, main_#t~post1, main_#t~mem3, main_#t~post2, main_#t~mem5, main_#t~post4, main_~S~0, main_~i~0, main_~#a~0.base, main_~#a~0.offset;main_~S~0 := main_#t~nondet0;havoc main_#t~nondet0;assume_abort_if_not_#in~cond := (if ~bvsgt32(main_~S~0, 1bv32) then 1bv32 else 0bv32);havoc assume_abort_if_not_~cond;assume_abort_if_not_~cond := assume_abort_if_not_#in~cond; {191#(or (and (= (_ bv1 32) ULTIMATE.start_assume_abort_if_not_~cond) (bvsgt ULTIMATE.start_main_~S~0 (_ bv1 32))) (and (= (_ bv0 32) ULTIMATE.start_assume_abort_if_not_~cond) (not (bvsgt ULTIMATE.start_main_~S~0 (_ bv1 32)))))} is VALID [2020-07-28 14:47:01,126 INFO L280 TraceCheckUtils]: 2: Hoare triple {191#(or (and (= (_ bv1 32) ULTIMATE.start_assume_abort_if_not_~cond) (bvsgt ULTIMATE.start_main_~S~0 (_ bv1 32))) (and (= (_ bv0 32) ULTIMATE.start_assume_abort_if_not_~cond) (not (bvsgt ULTIMATE.start_main_~S~0 (_ bv1 32)))))} assume !(0bv32 == assume_abort_if_not_~cond); {195#(bvsgt ULTIMATE.start_main_~S~0 (_ bv1 32))} is VALID [2020-07-28 14:47:01,128 INFO L280 TraceCheckUtils]: 3: Hoare triple {195#(bvsgt ULTIMATE.start_main_~S~0 (_ bv1 32))} havoc main_~i~0;call main_~#a~0.base, main_~#a~0.offset := #Ultimate.allocOnStack(~bvmul32(4bv32, main_~S~0));main_~i~0 := 0bv32; {199#(and (= (_ bv0 32) ULTIMATE.start_main_~i~0) (bvsgt ULTIMATE.start_main_~S~0 (_ bv1 32)))} is VALID [2020-07-28 14:47:01,130 INFO L280 TraceCheckUtils]: 4: Hoare triple {199#(and (= (_ bv0 32) ULTIMATE.start_main_~i~0) (bvsgt ULTIMATE.start_main_~S~0 (_ bv1 32)))} assume !~bvslt32(main_~i~0, main_~S~0); {184#false} is VALID [2020-07-28 14:47:01,131 INFO L280 TraceCheckUtils]: 5: Hoare triple {184#false} main_~i~0 := 0bv32; {184#false} is VALID [2020-07-28 14:47:01,131 INFO L280 TraceCheckUtils]: 6: Hoare triple {184#false} assume !~bvslt32(main_~i~0, main_~S~0); {184#false} is VALID [2020-07-28 14:47:01,132 INFO L280 TraceCheckUtils]: 7: Hoare triple {184#false} main_~i~0 := 0bv32; {184#false} is VALID [2020-07-28 14:47:01,132 INFO L280 TraceCheckUtils]: 8: Hoare triple {184#false} assume !!~bvslt32(main_~i~0, main_~S~0);call main_#t~mem5 := read~intINTTYPE4(main_~#a~0.base, ~bvadd32(main_~#a~0.offset, ~bvmul32(4bv32, main_~i~0)), 4bv32);__VERIFIER_assert_#in~cond := (if 4294967295bv32 == main_#t~mem5 then 1bv32 else 0bv32);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; {184#false} is VALID [2020-07-28 14:47:01,133 INFO L280 TraceCheckUtils]: 9: Hoare triple {184#false} assume 0bv32 == __VERIFIER_assert_~cond; {184#false} is VALID [2020-07-28 14:47:01,133 INFO L280 TraceCheckUtils]: 10: Hoare triple {184#false} assume !false; {184#false} is VALID [2020-07-28 14:47:01,135 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-28 14:47:01,135 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-07-28 14:47:01,241 INFO L280 TraceCheckUtils]: 10: Hoare triple {184#false} assume !false; {184#false} is VALID [2020-07-28 14:47:01,241 INFO L280 TraceCheckUtils]: 9: Hoare triple {184#false} assume 0bv32 == __VERIFIER_assert_~cond; {184#false} is VALID [2020-07-28 14:47:01,242 INFO L280 TraceCheckUtils]: 8: Hoare triple {184#false} assume !!~bvslt32(main_~i~0, main_~S~0);call main_#t~mem5 := read~intINTTYPE4(main_~#a~0.base, ~bvadd32(main_~#a~0.offset, ~bvmul32(4bv32, main_~i~0)), 4bv32);__VERIFIER_assert_#in~cond := (if 4294967295bv32 == main_#t~mem5 then 1bv32 else 0bv32);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; {184#false} is VALID [2020-07-28 14:47:01,242 INFO L280 TraceCheckUtils]: 7: Hoare triple {184#false} main_~i~0 := 0bv32; {184#false} is VALID [2020-07-28 14:47:01,243 INFO L280 TraceCheckUtils]: 6: Hoare triple {184#false} assume !~bvslt32(main_~i~0, main_~S~0); {184#false} is VALID [2020-07-28 14:47:01,243 INFO L280 TraceCheckUtils]: 5: Hoare triple {184#false} main_~i~0 := 0bv32; {184#false} is VALID [2020-07-28 14:47:01,244 INFO L280 TraceCheckUtils]: 4: Hoare triple {239#(bvslt ULTIMATE.start_main_~i~0 ULTIMATE.start_main_~S~0)} assume !~bvslt32(main_~i~0, main_~S~0); {184#false} is VALID [2020-07-28 14:47:01,246 INFO L280 TraceCheckUtils]: 3: Hoare triple {243#(bvslt (_ bv0 32) ULTIMATE.start_main_~S~0)} havoc main_~i~0;call main_~#a~0.base, main_~#a~0.offset := #Ultimate.allocOnStack(~bvmul32(4bv32, main_~S~0));main_~i~0 := 0bv32; {239#(bvslt ULTIMATE.start_main_~i~0 ULTIMATE.start_main_~S~0)} is VALID [2020-07-28 14:47:01,248 INFO L280 TraceCheckUtils]: 2: Hoare triple {247#(or (= (_ bv0 32) ULTIMATE.start_assume_abort_if_not_~cond) (bvslt (_ bv0 32) ULTIMATE.start_main_~S~0))} assume !(0bv32 == assume_abort_if_not_~cond); {243#(bvslt (_ bv0 32) ULTIMATE.start_main_~S~0)} is VALID [2020-07-28 14:47:01,250 INFO L280 TraceCheckUtils]: 1: Hoare triple {183#true} havoc main_#res;havoc main_#t~nondet0, main_#t~post1, main_#t~mem3, main_#t~post2, main_#t~mem5, main_#t~post4, main_~S~0, main_~i~0, main_~#a~0.base, main_~#a~0.offset;main_~S~0 := main_#t~nondet0;havoc main_#t~nondet0;assume_abort_if_not_#in~cond := (if ~bvsgt32(main_~S~0, 1bv32) then 1bv32 else 0bv32);havoc assume_abort_if_not_~cond;assume_abort_if_not_~cond := assume_abort_if_not_#in~cond; {247#(or (= (_ bv0 32) ULTIMATE.start_assume_abort_if_not_~cond) (bvslt (_ bv0 32) ULTIMATE.start_main_~S~0))} is VALID [2020-07-28 14:47:01,251 INFO L280 TraceCheckUtils]: 0: Hoare triple {183#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1];assume ~bvult32(0bv32, #StackHeapBarrier); {183#true} is VALID [2020-07-28 14:47:01,251 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-28 14:47:01,252 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1342120149] [2020-07-28 14:47:01,253 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2020-07-28 14:47:01,253 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5, 5] imperfect sequences [] total 8 [2020-07-28 14:47:01,253 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2097468637] [2020-07-28 14:47:01,256 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 11 [2020-07-28 14:47:01,256 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-28 14:47:01,257 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 8 states. [2020-07-28 14:47:01,286 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 15 edges. 15 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-28 14:47:01,286 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-07-28 14:47:01,286 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2020-07-28 14:47:01,287 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-07-28 14:47:01,287 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2020-07-28 14:47:01,288 INFO L87 Difference]: Start difference. First operand 16 states and 18 transitions. Second operand 8 states. [2020-07-28 14:47:01,784 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-28 14:47:01,785 INFO L93 Difference]: Finished difference Result 39 states and 46 transitions. [2020-07-28 14:47:01,785 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-07-28 14:47:01,785 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 11 [2020-07-28 14:47:01,785 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-28 14:47:01,786 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2020-07-28 14:47:01,788 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 46 transitions. [2020-07-28 14:47:01,789 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2020-07-28 14:47:01,791 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 46 transitions. [2020-07-28 14:47:01,792 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states and 46 transitions. [2020-07-28 14:47:01,951 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 46 edges. 46 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-28 14:47:01,953 INFO L225 Difference]: With dead ends: 39 [2020-07-28 14:47:01,953 INFO L226 Difference]: Without dead ends: 29 [2020-07-28 14:47:01,954 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=45, Invalid=65, Unknown=0, NotChecked=0, Total=110 [2020-07-28 14:47:01,955 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2020-07-28 14:47:01,972 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 22. [2020-07-28 14:47:01,972 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-28 14:47:01,972 INFO L82 GeneralOperation]: Start isEquivalent. First operand 29 states. Second operand 22 states. [2020-07-28 14:47:01,972 INFO L74 IsIncluded]: Start isIncluded. First operand 29 states. Second operand 22 states. [2020-07-28 14:47:01,973 INFO L87 Difference]: Start difference. First operand 29 states. Second operand 22 states. [2020-07-28 14:47:01,975 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-28 14:47:01,976 INFO L93 Difference]: Finished difference Result 29 states and 31 transitions. [2020-07-28 14:47:01,976 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 31 transitions. [2020-07-28 14:47:01,977 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-28 14:47:01,977 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-28 14:47:01,977 INFO L74 IsIncluded]: Start isIncluded. First operand 22 states. Second operand 29 states. [2020-07-28 14:47:01,978 INFO L87 Difference]: Start difference. First operand 22 states. Second operand 29 states. [2020-07-28 14:47:01,980 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-28 14:47:01,981 INFO L93 Difference]: Finished difference Result 29 states and 31 transitions. [2020-07-28 14:47:01,981 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 31 transitions. [2020-07-28 14:47:01,982 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-28 14:47:01,982 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-28 14:47:01,982 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-28 14:47:01,983 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-28 14:47:01,983 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2020-07-28 14:47:01,985 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 24 transitions. [2020-07-28 14:47:01,985 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 24 transitions. Word has length 11 [2020-07-28 14:47:01,985 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-28 14:47:01,986 INFO L479 AbstractCegarLoop]: Abstraction has 22 states and 24 transitions. [2020-07-28 14:47:01,986 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-07-28 14:47:01,986 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 24 transitions. [2020-07-28 14:47:01,987 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-07-28 14:47:01,987 INFO L414 BasicCegarLoop]: Found error trace [2020-07-28 14:47:01,988 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-28 14:47:02,195 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 mathsat -unsat_core_generation=3 [2020-07-28 14:47:02,196 INFO L427 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-28 14:47:02,197 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-28 14:47:02,198 INFO L82 PathProgramCache]: Analyzing trace with hash 1570853842, now seen corresponding path program 1 times [2020-07-28 14:47:02,200 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2020-07-28 14:47:02,200 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1228458231] [2020-07-28 14:47:02,201 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 4 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with mathsat -unsat_core_generation=3 [2020-07-28 14:47:02,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-28 14:47:02,309 INFO L263 TraceCheckSpWp]: Trace formula consists of 39 conjuncts, 13 conjunts are in the unsatisfiable core [2020-07-28 14:47:02,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-28 14:47:02,329 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-28 14:47:02,409 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 17 [2020-07-28 14:47:02,410 INFO L544 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-07-28 14:47:02,455 INFO L624 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-07-28 14:47:02,456 INFO L544 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-07-28 14:47:02,456 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:25, output treesize:21 [2020-07-28 14:47:02,489 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1228458231] [2020-07-28 14:47:02,490 WARN L333 FreeRefinementEngine]: Interpolation failed due to KNOWN_DEPENDING: transformation to positive normal form unsound [2020-07-28 14:47:02,490 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [581767420] [2020-07-28 14:47:02,491 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 Starting monitored process 5 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2020-07-28 14:47:02,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-28 14:47:02,790 INFO L263 TraceCheckSpWp]: Trace formula consists of 39 conjuncts, 14 conjunts are in the unsatisfiable core [2020-07-28 14:47:02,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-28 14:47:02,806 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-28 14:47:02,807 WARN L333 FreeRefinementEngine]: Interpolation failed due to KNOWN_DEPENDING: Timing already running [2020-07-28 14:47:02,808 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [145727938] [2020-07-28 14:47:02,808 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-28 14:47:02,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-28 14:47:02,886 INFO L263 TraceCheckSpWp]: Trace formula consists of 39 conjuncts, 17 conjunts are in the unsatisfiable core [2020-07-28 14:47:02,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-28 14:47:02,900 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-28 14:47:02,902 WARN L333 FreeRefinementEngine]: Interpolation failed due to KNOWN_DEPENDING: Timing already running [2020-07-28 14:47:02,902 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 0 imperfect interpolant sequences. [2020-07-28 14:47:02,903 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [] total 0 [2020-07-28 14:47:02,903 ERROR L206 FreeRefinementEngine]: Strategy WOLF failed to provide any proof altough trace is infeasible [2020-07-28 14:47:02,903 INFO L520 BasicCegarLoop]: Counterexample might be feasible [2020-07-28 14:47:03,516 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 mathsat -unsat_core_generation=3,5 cvc4 --incremental --print-success --lang smt --rewrite-divk,6 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-28 14:47:03,534 WARN L170 areAnnotationChecker]: ULTIMATE.startENTRY has no Hoare annotation [2020-07-28 14:47:03,535 WARN L170 areAnnotationChecker]: L-1 has no Hoare annotation [2020-07-28 14:47:03,535 WARN L170 areAnnotationChecker]: L4 has no Hoare annotation [2020-07-28 14:47:03,535 WARN L170 areAnnotationChecker]: L4 has no Hoare annotation [2020-07-28 14:47:03,535 WARN L170 areAnnotationChecker]: L3 has no Hoare annotation [2020-07-28 14:47:03,535 WARN L170 areAnnotationChecker]: L15-3 has no Hoare annotation [2020-07-28 14:47:03,535 WARN L170 areAnnotationChecker]: L15-3 has no Hoare annotation [2020-07-28 14:47:03,535 WARN L170 areAnnotationChecker]: L15-3 has no Hoare annotation [2020-07-28 14:47:03,536 WARN L170 areAnnotationChecker]: L15-4 has no Hoare annotation [2020-07-28 14:47:03,536 WARN L170 areAnnotationChecker]: L15-2 has no Hoare annotation [2020-07-28 14:47:03,536 WARN L170 areAnnotationChecker]: L18-3 has no Hoare annotation [2020-07-28 14:47:03,536 WARN L170 areAnnotationChecker]: L18-3 has no Hoare annotation [2020-07-28 14:47:03,537 WARN L170 areAnnotationChecker]: L18-3 has no Hoare annotation [2020-07-28 14:47:03,537 WARN L170 areAnnotationChecker]: L18-4 has no Hoare annotation [2020-07-28 14:47:03,537 WARN L170 areAnnotationChecker]: L18-2 has no Hoare annotation [2020-07-28 14:47:03,537 WARN L170 areAnnotationChecker]: L21-3 has no Hoare annotation [2020-07-28 14:47:03,537 WARN L170 areAnnotationChecker]: L21-3 has no Hoare annotation [2020-07-28 14:47:03,538 WARN L170 areAnnotationChecker]: L21-3 has no Hoare annotation [2020-07-28 14:47:03,538 WARN L170 areAnnotationChecker]: L21-4 has no Hoare annotation [2020-07-28 14:47:03,538 WARN L170 areAnnotationChecker]: L6 has no Hoare annotation [2020-07-28 14:47:03,538 WARN L170 areAnnotationChecker]: L6 has no Hoare annotation [2020-07-28 14:47:03,538 WARN L170 areAnnotationChecker]: L23 has no Hoare annotation [2020-07-28 14:47:03,539 WARN L170 areAnnotationChecker]: L6-1 has no Hoare annotation [2020-07-28 14:47:03,539 WARN L170 areAnnotationChecker]: L6-1 has no Hoare annotation [2020-07-28 14:47:03,539 WARN L170 areAnnotationChecker]: L6-3 has no Hoare annotation [2020-07-28 14:47:03,539 WARN L170 areAnnotationChecker]: ULTIMATE.startFINAL has no Hoare annotation [2020-07-28 14:47:03,540 WARN L170 areAnnotationChecker]: L21-2 has no Hoare annotation [2020-07-28 14:47:03,540 INFO L163 areAnnotationChecker]: CFG has 0 edges. 0 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. 0 times interpolants missing. [2020-07-28 14:47:03,542 WARN L231 ceAbstractionStarter]: Unable to decide correctness. Please check the following counterexample manually. [2020-07-28 14:47:03,542 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 28.07 02:47:03 BoogieIcfgContainer [2020-07-28 14:47:03,543 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-07-28 14:47:03,543 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2020-07-28 14:47:03,543 INFO L271 PluginConnector]: Initializing Witness Printer... [2020-07-28 14:47:03,544 INFO L275 PluginConnector]: Witness Printer initialized [2020-07-28 14:47:03,544 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.07 02:46:59" (3/4) ... [2020-07-28 14:47:03,547 INFO L140 WitnessPrinter]: No result that supports witness generation found [2020-07-28 14:47:03,547 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2020-07-28 14:47:03,549 INFO L168 Benchmark]: Toolchain (without parser) took 4451.00 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 143.7 MB). Free memory was 956.2 MB in the beginning and 925.3 MB in the end (delta: 30.9 MB). Peak memory consumption was 174.5 MB. Max. memory is 11.5 GB. [2020-07-28 14:47:03,550 INFO L168 Benchmark]: CDTParser took 0.28 ms. Allocated memory is still 1.0 GB. Free memory is still 981.7 MB. There was no memory consumed. Max. memory is 11.5 GB. [2020-07-28 14:47:03,551 INFO L168 Benchmark]: CACSL2BoogieTranslator took 366.06 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 143.7 MB). Free memory was 956.2 MB in the beginning and 1.1 GB in the end (delta: -183.9 MB). Peak memory consumption was 20.6 MB. Max. memory is 11.5 GB. [2020-07-28 14:47:03,552 INFO L168 Benchmark]: Boogie Procedure Inliner took 43.89 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.6 MB). Peak memory consumption was 6.6 MB. Max. memory is 11.5 GB. [2020-07-28 14:47:03,552 INFO L168 Benchmark]: Boogie Preprocessor took 32.56 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2020-07-28 14:47:03,553 INFO L168 Benchmark]: RCFGBuilder took 450.47 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 25.8 MB). Peak memory consumption was 25.8 MB. Max. memory is 11.5 GB. [2020-07-28 14:47:03,553 INFO L168 Benchmark]: TraceAbstraction took 3546.04 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 931.9 MB in the end (delta: 175.8 MB). Peak memory consumption was 175.8 MB. Max. memory is 11.5 GB. [2020-07-28 14:47:03,554 INFO L168 Benchmark]: Witness Printer took 4.33 ms. Allocated memory is still 1.2 GB. Free memory was 931.9 MB in the beginning and 925.3 MB in the end (delta: 6.6 MB). Peak memory consumption was 6.6 MB. Max. memory is 11.5 GB. [2020-07-28 14:47:03,558 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - AssertionsEnabledResult: Assertions are enabled Assertions are enabled - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.28 ms. Allocated memory is still 1.0 GB. Free memory is still 981.7 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 366.06 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 143.7 MB). Free memory was 956.2 MB in the beginning and 1.1 GB in the end (delta: -183.9 MB). Peak memory consumption was 20.6 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 43.89 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.6 MB). Peak memory consumption was 6.6 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 32.56 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 450.47 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 25.8 MB). Peak memory consumption was 25.8 MB. Max. memory is 11.5 GB. * TraceAbstraction took 3546.04 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 931.9 MB in the end (delta: 175.8 MB). Peak memory consumption was 175.8 MB. Max. memory is 11.5 GB. * Witness Printer took 4.33 ms. Allocated memory is still 1.2 GB. Free memory was 931.9 MB in the beginning and 925.3 MB in the end (delta: 6.6 MB). Peak memory consumption was 6.6 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - UnprovableResult [Line: 6]: Unable to prove that call of __VERIFIER_error() unreachable Unable to prove that call of __VERIFIER_error() unreachable Reason: unable to decide satisfiability of path constraint. Possible FailurePath: [L10] int S=__VERIFIER_nondet_int(); [L4] COND FALSE !(!cond) [L12] int i; [L13] int a[S]; [L15] i=0 [L15] COND TRUE i