./Ultimate.py --spec ../sv-benchmarks/c/properties/termination.prp --file ../sv-benchmarks/c/termination-15/array16_alloca_original.i --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version 30f4e4ab Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx12G -Xms1G -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/AutomizerTermination.xml -i ../sv-benchmarks/c/termination-15/array16_alloca_original.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-64bit-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(F end) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 64bit --witnessprinter.graph.data.programhash b6c8e92f4d5413ae33bafe73b9024f19a73a1964 ....................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE(TERM) --- Real Ultimate output --- This is Ultimate 0.1.24-30f4e4a [2019-11-28 03:03:21,797 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-28 03:03:21,800 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-28 03:03:21,816 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-28 03:03:21,816 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-28 03:03:21,818 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-28 03:03:21,820 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-28 03:03:21,829 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-28 03:03:21,833 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-28 03:03:21,836 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-28 03:03:21,837 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-28 03:03:21,839 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-28 03:03:21,839 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-28 03:03:21,843 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-28 03:03:21,845 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-28 03:03:21,847 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-28 03:03:21,848 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-28 03:03:21,849 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-28 03:03:21,851 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-28 03:03:21,855 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-28 03:03:21,859 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-28 03:03:21,863 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-28 03:03:21,864 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-28 03:03:21,866 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-28 03:03:21,870 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-28 03:03:21,870 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-28 03:03:21,870 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-28 03:03:21,873 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-28 03:03:21,873 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-28 03:03:21,874 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-28 03:03:21,874 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-28 03:03:21,875 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-28 03:03:21,876 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-28 03:03:21,877 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-28 03:03:21,878 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-28 03:03:21,879 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-28 03:03:21,880 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-28 03:03:21,880 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-28 03:03:21,880 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-28 03:03:21,881 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-28 03:03:21,883 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-28 03:03:21,884 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-64bit-Automizer_Default.epf [2019-11-28 03:03:21,920 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-28 03:03:21,923 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-28 03:03:21,926 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-28 03:03:21,926 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-28 03:03:21,926 INFO L138 SettingsManager]: * Use SBE=true [2019-11-28 03:03:21,927 INFO L136 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2019-11-28 03:03:21,927 INFO L138 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2019-11-28 03:03:21,927 INFO L138 SettingsManager]: * Use old map elimination=false [2019-11-28 03:03:21,927 INFO L138 SettingsManager]: * Use external solver (rank synthesis)=false [2019-11-28 03:03:21,928 INFO L138 SettingsManager]: * Use only trivial implications for array writes=true [2019-11-28 03:03:21,928 INFO L138 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2019-11-28 03:03:21,928 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-28 03:03:21,929 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2019-11-28 03:03:21,929 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-28 03:03:21,929 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-28 03:03:21,929 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2019-11-28 03:03:21,930 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2019-11-28 03:03:21,930 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2019-11-28 03:03:21,930 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-28 03:03:21,930 INFO L138 SettingsManager]: * Assume nondeterminstic values are in range=false [2019-11-28 03:03:21,931 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-28 03:03:21,931 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2019-11-28 03:03:21,931 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-28 03:03:21,932 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-28 03:03:21,932 INFO L138 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2019-11-28 03:03:21,932 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-28 03:03:21,933 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-11-28 03:03:21,933 INFO L138 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2019-11-28 03:03:21,934 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2019-11-28 03:03:21,934 INFO L138 SettingsManager]: * TransformationType=MODULO_NEIGHBOR 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(F end) ) 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 -> 64bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> b6c8e92f4d5413ae33bafe73b9024f19a73a1964 [2019-11-28 03:03:22,253 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-28 03:03:22,271 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-28 03:03:22,275 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-28 03:03:22,278 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-28 03:03:22,279 INFO L275 PluginConnector]: CDTParser initialized [2019-11-28 03:03:22,280 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/termination-15/array16_alloca_original.i [2019-11-28 03:03:22,351 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9c432e275/68be0bee5dab482ebf4a283c529ea437/FLAG2deb43229 [2019-11-28 03:03:22,889 INFO L306 CDTParser]: Found 1 translation units. [2019-11-28 03:03:22,890 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/termination-15/array16_alloca_original.i [2019-11-28 03:03:22,899 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9c432e275/68be0bee5dab482ebf4a283c529ea437/FLAG2deb43229 [2019-11-28 03:03:23,174 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9c432e275/68be0bee5dab482ebf4a283c529ea437 [2019-11-28 03:03:23,177 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-28 03:03:23,178 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-11-28 03:03:23,179 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-28 03:03:23,180 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-28 03:03:23,183 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-28 03:03:23,184 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 03:03:23" (1/1) ... [2019-11-28 03:03:23,187 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@46c20c6c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:03:23, skipping insertion in model container [2019-11-28 03:03:23,187 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 03:03:23" (1/1) ... [2019-11-28 03:03:23,195 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-11-28 03:03:23,232 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-11-28 03:03:23,647 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-28 03:03:23,658 INFO L203 MainTranslator]: Completed pre-run [2019-11-28 03:03:23,701 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-28 03:03:23,784 INFO L208 MainTranslator]: Completed translation [2019-11-28 03:03:23,785 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:03:23 WrapperNode [2019-11-28 03:03:23,785 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-28 03:03:23,786 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-11-28 03:03:23,786 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-11-28 03:03:23,787 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-11-28 03:03:23,795 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:03:23" (1/1) ... [2019-11-28 03:03:23,817 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:03:23" (1/1) ... [2019-11-28 03:03:23,836 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-11-28 03:03:23,836 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-28 03:03:23,837 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-28 03:03:23,837 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-28 03:03:23,845 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:03:23" (1/1) ... [2019-11-28 03:03:23,845 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:03:23" (1/1) ... [2019-11-28 03:03:23,847 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:03:23" (1/1) ... [2019-11-28 03:03:23,847 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:03:23" (1/1) ... [2019-11-28 03:03:23,853 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:03:23" (1/1) ... [2019-11-28 03:03:23,857 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:03:23" (1/1) ... [2019-11-28 03:03:23,859 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:03:23" (1/1) ... [2019-11-28 03:03:23,861 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-28 03:03:23,861 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-28 03:03:23,862 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-28 03:03:23,862 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-28 03:03:23,863 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:03:23" (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:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 03:03:23,928 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-11-28 03:03:23,928 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-11-28 03:03:23,929 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-11-28 03:03:23,929 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-11-28 03:03:23,929 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-28 03:03:23,930 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-28 03:03:24,174 INFO L292 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-28 03:03:24,175 INFO L297 CfgBuilder]: Removed 6 assume(true) statements. [2019-11-28 03:03:24,176 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 03:03:24 BoogieIcfgContainer [2019-11-28 03:03:24,177 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-28 03:03:24,178 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2019-11-28 03:03:24,178 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2019-11-28 03:03:24,191 INFO L275 PluginConnector]: BuchiAutomizer initialized [2019-11-28 03:03:24,193 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-11-28 03:03:24,193 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 28.11 03:03:23" (1/3) ... [2019-11-28 03:03:24,200 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@3b7ec0aa and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 28.11 03:03:24, skipping insertion in model container [2019-11-28 03:03:24,200 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-11-28 03:03:24,200 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:03:23" (2/3) ... [2019-11-28 03:03:24,201 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@3b7ec0aa and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 28.11 03:03:24, skipping insertion in model container [2019-11-28 03:03:24,201 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-11-28 03:03:24,202 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 03:03:24" (3/3) ... [2019-11-28 03:03:24,205 INFO L371 chiAutomizerObserver]: Analyzing ICFG array16_alloca_original.i [2019-11-28 03:03:24,257 INFO L356 BuchiCegarLoop]: Interprodecural is true [2019-11-28 03:03:24,258 INFO L357 BuchiCegarLoop]: Hoare is false [2019-11-28 03:03:24,258 INFO L358 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2019-11-28 03:03:24,258 INFO L359 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-28 03:03:24,258 INFO L360 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-28 03:03:24,259 INFO L361 BuchiCegarLoop]: Difference is false [2019-11-28 03:03:24,259 INFO L362 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-28 03:03:24,259 INFO L365 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2019-11-28 03:03:24,271 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 15 states. [2019-11-28 03:03:24,290 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 5 [2019-11-28 03:03:24,291 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-28 03:03:24,291 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-28 03:03:24,298 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2019-11-28 03:03:24,298 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2019-11-28 03:03:24,299 INFO L424 BuchiCegarLoop]: ======== Iteration 1============ [2019-11-28 03:03:24,299 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 15 states. [2019-11-28 03:03:24,301 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 5 [2019-11-28 03:03:24,301 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-28 03:03:24,301 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-28 03:03:24,302 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2019-11-28 03:03:24,302 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2019-11-28 03:03:24,310 INFO L794 eck$LassoCheckResult]: Stem: 10#ULTIMATE.startENTRYtrue #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 8#L-1true havoc main_#res;havoc main_#t~nondet205, main_#t~malloc206.base, main_#t~malloc206.offset, main_#t~nondet208, main_#t~mem209, main_#t~post207, main_#t~mem210, main_#t~post211, main_#t~post212, main_~i~0, main_~j~0, main_~length~0, main_~arr~0.base, main_~arr~0.offset;havoc main_~i~0;havoc main_~j~0;main_~length~0 := main_#t~nondet205;havoc main_#t~nondet205; 16#L367true assume !(main_~length~0 < 1); 5#L367-2true call main_#t~malloc206.base, main_#t~malloc206.offset := #Ultimate.allocOnStack(4 * main_~length~0);main_~arr~0.base, main_~arr~0.offset := main_#t~malloc206.base, main_#t~malloc206.offset; 12#L369true assume !(main_~arr~0.base == 0 && main_~arr~0.offset == 0);main_~i~0 := 0; 17#L370-3true [2019-11-28 03:03:24,310 INFO L796 eck$LassoCheckResult]: Loop: 17#L370-3true assume !!(main_~i~0 < main_~length~0);call write~int(main_#t~nondet208, main_~arr~0.base, main_~arr~0.offset + 4 * main_~i~0, 4);havoc main_#t~nondet208;call main_#t~mem209 := read~int(main_~arr~0.base, main_~arr~0.offset + 4 * main_~i~0, 4); 9#L372true assume 1 == (if main_#t~mem209 < 0 && 0 != main_#t~mem209 % 2 then main_#t~mem209 % 2 - 2 else main_#t~mem209 % 2);havoc main_#t~mem209;call write~int(0, main_~arr~0.base, main_~arr~0.offset + 4 * main_~i~0, 4); 14#L370-2true main_#t~post207 := main_~i~0;main_~i~0 := 1 + main_#t~post207;havoc main_#t~post207; 17#L370-3true [2019-11-28 03:03:24,315 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 03:03:24,316 INFO L82 PathProgramCache]: Analyzing trace with hash 28695753, now seen corresponding path program 1 times [2019-11-28 03:03:24,322 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 03:03:24,322 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1926328668] [2019-11-28 03:03:24,323 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 03:03:24,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 03:03:24,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 03:03:24,460 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-28 03:03:24,462 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 03:03:24,463 INFO L82 PathProgramCache]: Analyzing trace with hash 51737, now seen corresponding path program 1 times [2019-11-28 03:03:24,463 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 03:03:24,464 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [207561865] [2019-11-28 03:03:24,464 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 03:03:24,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 03:03:24,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 03:03:24,568 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-28 03:03:24,572 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 03:03:24,573 INFO L82 PathProgramCache]: Analyzing trace with hash 176707665, now seen corresponding path program 1 times [2019-11-28 03:03:24,573 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 03:03:24,573 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1992222622] [2019-11-28 03:03:24,574 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 03:03:24,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 03:03:24,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 03:03:24,669 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-28 03:03:24,879 WARN L192 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 43 DAG size of output: 35 [2019-11-28 03:03:25,036 INFO L210 LassoAnalysis]: Preferences: [2019-11-28 03:03:25,037 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2019-11-28 03:03:25,038 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-11-28 03:03:25,038 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2019-11-28 03:03:25,039 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2019-11-28 03:03:25,039 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 03:03:25,039 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2019-11-28 03:03:25,039 INFO L132 ssoRankerPreferences]: Path of dumped script: [2019-11-28 03:03:25,040 INFO L133 ssoRankerPreferences]: Filename of dumped script: array16_alloca_original.i_Iteration1_Lasso [2019-11-28 03:03:25,040 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2019-11-28 03:03:25,040 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-11-28 03:03:25,068 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 03:03:25,076 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 03:03:25,080 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 03:03:25,084 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 03:03:25,089 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 03:03:25,094 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 03:03:25,096 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 03:03:25,102 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 03:03:25,106 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 03:03:25,111 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 03:03:25,240 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 03:03:25,243 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 03:03:25,564 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-11-28 03:03:25,569 INFO L489 LassoAnalysis]: Using template 'affine'. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-28 03:03:25,585 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-28 03:03:25,588 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 03:03:25,589 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-28 03:03:25,590 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 03:03:25,590 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 03:03:25,590 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 03:03:25,593 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-28 03:03:25,593 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. Waiting until toolchain timeout for monitored process 2 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 03:03:25,596 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 03:03:25,608 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-28 03:03:25,610 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 03:03:25,610 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-28 03:03:25,611 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 03:03:25,611 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 03:03:25,611 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 03:03:25,614 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-28 03:03:25,615 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-28 03:03:25,617 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 03:03:25,634 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-28 03:03:25,636 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 03:03:25,636 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-28 03:03:25,636 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 03:03:25,636 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 03:03:25,637 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 03:03:25,640 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-28 03:03:25,641 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-28 03:03:25,644 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 03:03:25,662 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-28 03:03:25,664 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 03:03:25,665 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-28 03:03:25,665 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 03:03:25,665 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 03:03:25,665 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 03:03:25,666 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-28 03:03:25,666 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-28 03:03:25,668 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-28 03:03:25,683 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-28 03:03:25,685 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 03:03:25,686 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 03:03:25,686 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 03:03:25,686 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 03:03:25,690 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-28 03:03:25,690 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. Waiting until toolchain timeout for monitored process 6 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 03:03:25,696 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 03:03:25,704 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-28 03:03:25,706 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 03:03:25,706 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-28 03:03:25,706 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 03:03:25,706 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 03:03:25,707 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 03:03:25,708 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-28 03:03:25,708 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-28 03:03:25,710 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 03:03:25,719 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-28 03:03:25,721 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 03:03:25,722 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-28 03:03:25,722 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 03:03:25,722 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 03:03:25,722 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 03:03:25,723 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-28 03:03:25,724 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-28 03:03:25,725 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 9 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 03:03:25,741 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-28 03:03:25,743 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 03:03:25,743 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-28 03:03:25,743 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 03:03:25,743 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 03:03:25,743 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 03:03:25,744 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-28 03:03:25,744 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-28 03:03:25,748 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 10 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 03:03:25,759 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-28 03:03:25,761 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 03:03:25,761 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 03:03:25,762 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 03:03:25,762 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 03:03:25,765 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-28 03:03:25,765 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-28 03:03:25,770 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 11 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-28 03:03:25,790 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-28 03:03:25,792 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 03:03:25,793 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 03:03:25,793 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 03:03:25,793 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 03:03:25,803 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-28 03:03:25,803 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. Waiting until toolchain timeout for monitored process 11 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 03:03:25,820 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-11-28 03:03:25,870 INFO L443 ModelExtractionUtils]: Simplification made 10 calls to the SMT solver. [2019-11-28 03:03:25,871 INFO L444 ModelExtractionUtils]: 8 out of 22 variables were initially zero. Simplification set additionally 9 variables to zero. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 12 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 03:03:25,878 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-11-28 03:03:25,883 INFO L438 nArgumentSynthesizer]: Removed 1 redundant supporting invariants from a total of 2. [2019-11-28 03:03:25,883 INFO L510 LassoAnalysis]: Proved termination. [2019-11-28 03:03:25,884 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~i~0, v_rep(select #length ULTIMATE.start_main_#t~malloc206.base)_1) = -4*ULTIMATE.start_main_~i~0 + 1*v_rep(select #length ULTIMATE.start_main_#t~malloc206.base)_1 Supporting invariants [1*v_rep(select #length ULTIMATE.start_main_~arr~0.base)_1 - 4*ULTIMATE.start_main_~length~0 >= 0] [2019-11-28 03:03:25,909 INFO L297 tatePredicateManager]: 2 out of 4 supporting invariants were superfluous and have been removed [2019-11-28 03:03:25,926 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2019-11-28 03:03:25,972 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 03:03:26,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 03:03:26,003 INFO L255 TraceCheckSpWp]: Trace formula consists of 26 conjuncts, 5 conjunts are in the unsatisfiable core [2019-11-28 03:03:26,005 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 03:03:26,071 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 8 treesize of output 7 [2019-11-28 03:03:26,072 INFO L508 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-28 03:03:26,085 INFO L588 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-28 03:03:26,086 INFO L508 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-28 03:03:26,086 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:13, output treesize:12 [2019-11-28 03:03:26,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 03:03:26,122 INFO L255 TraceCheckSpWp]: Trace formula consists of 22 conjuncts, 7 conjunts are in the unsatisfiable core [2019-11-28 03:03:26,123 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 03:03:26,153 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 03:03:26,171 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.2 stem predicates 2 loop predicates [2019-11-28 03:03:26,173 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 15 states. Second operand 4 states. [2019-11-28 03:03:26,308 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 15 states.. Second operand 4 states. Result 32 states and 47 transitions. Complement of second has 9 states. [2019-11-28 03:03:26,309 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 6 states 2 stem states 2 non-accepting loop states 1 accepting loop states [2019-11-28 03:03:26,311 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2019-11-28 03:03:26,314 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 30 transitions. [2019-11-28 03:03:26,316 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 30 transitions. Stem has 5 letters. Loop has 3 letters. [2019-11-28 03:03:26,317 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-28 03:03:26,317 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 30 transitions. Stem has 8 letters. Loop has 3 letters. [2019-11-28 03:03:26,318 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-28 03:03:26,318 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 30 transitions. Stem has 5 letters. Loop has 6 letters. [2019-11-28 03:03:26,319 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-28 03:03:26,321 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 32 states and 47 transitions. [2019-11-28 03:03:26,332 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2019-11-28 03:03:26,337 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 32 states to 12 states and 17 transitions. [2019-11-28 03:03:26,339 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 8 [2019-11-28 03:03:26,339 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 9 [2019-11-28 03:03:26,344 INFO L73 IsDeterministic]: Start isDeterministic. Operand 12 states and 17 transitions. [2019-11-28 03:03:26,345 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-11-28 03:03:26,345 INFO L688 BuchiCegarLoop]: Abstraction has 12 states and 17 transitions. [2019-11-28 03:03:26,364 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12 states and 17 transitions. [2019-11-28 03:03:26,374 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12 to 12. [2019-11-28 03:03:26,374 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2019-11-28 03:03:26,376 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 17 transitions. [2019-11-28 03:03:26,377 INFO L711 BuchiCegarLoop]: Abstraction has 12 states and 17 transitions. [2019-11-28 03:03:26,378 INFO L591 BuchiCegarLoop]: Abstraction has 12 states and 17 transitions. [2019-11-28 03:03:26,378 INFO L424 BuchiCegarLoop]: ======== Iteration 2============ [2019-11-28 03:03:26,378 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 12 states and 17 transitions. [2019-11-28 03:03:26,380 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2019-11-28 03:03:26,380 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-28 03:03:26,381 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-28 03:03:26,381 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1] [2019-11-28 03:03:26,382 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2019-11-28 03:03:26,382 INFO L794 eck$LassoCheckResult]: Stem: 129#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 125#L-1 havoc main_#res;havoc main_#t~nondet205, main_#t~malloc206.base, main_#t~malloc206.offset, main_#t~nondet208, main_#t~mem209, main_#t~post207, main_#t~mem210, main_#t~post211, main_#t~post212, main_~i~0, main_~j~0, main_~length~0, main_~arr~0.base, main_~arr~0.offset;havoc main_~i~0;havoc main_~j~0;main_~length~0 := main_#t~nondet205;havoc main_#t~nondet205; 126#L367 assume !(main_~length~0 < 1); 131#L367-2 call main_#t~malloc206.base, main_#t~malloc206.offset := #Ultimate.allocOnStack(4 * main_~length~0);main_~arr~0.base, main_~arr~0.offset := main_#t~malloc206.base, main_#t~malloc206.offset; 132#L369 assume !(main_~arr~0.base == 0 && main_~arr~0.offset == 0);main_~i~0 := 0; 133#L370-3 assume !(main_~i~0 < main_~length~0); 127#L370-4 main_~j~0 := 0; 128#L378-2 [2019-11-28 03:03:26,382 INFO L796 eck$LassoCheckResult]: Loop: 128#L378-2 assume !!(0 <= main_~j~0 && main_~j~0 < main_~length~0);call main_#t~mem210 := read~int(main_~arr~0.base, main_~arr~0.offset + 4 * main_~j~0, 4); 130#L378 assume 0 == (if main_#t~mem210 < 0 && 0 != main_#t~mem210 % 2 then main_#t~mem210 % 2 - 2 else main_#t~mem210 % 2);havoc main_#t~mem210;main_#t~post211 := main_~j~0;main_~j~0 := 1 + main_#t~post211;havoc main_#t~post211; 128#L378-2 [2019-11-28 03:03:26,383 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 03:03:26,383 INFO L82 PathProgramCache]: Analyzing trace with hash 1806815510, now seen corresponding path program 1 times [2019-11-28 03:03:26,384 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 03:03:26,384 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [301275152] [2019-11-28 03:03:26,385 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 03:03:26,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 03:03:26,460 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 03:03:26,461 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [301275152] [2019-11-28 03:03:26,462 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 03:03:26,462 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-28 03:03:26,462 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1186819474] [2019-11-28 03:03:26,467 INFO L799 eck$LassoCheckResult]: stem already infeasible [2019-11-28 03:03:26,467 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 03:03:26,468 INFO L82 PathProgramCache]: Analyzing trace with hash 2308, now seen corresponding path program 1 times [2019-11-28 03:03:26,468 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 03:03:26,469 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1271898537] [2019-11-28 03:03:26,469 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 03:03:26,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 03:03:26,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 03:03:26,504 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-28 03:03:26,580 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 03:03:26,582 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-28 03:03:26,583 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-28 03:03:26,584 INFO L87 Difference]: Start difference. First operand 12 states and 17 transitions. cyclomatic complexity: 7 Second operand 4 states. [2019-11-28 03:03:26,621 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 03:03:26,622 INFO L93 Difference]: Finished difference Result 14 states and 19 transitions. [2019-11-28 03:03:26,623 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-28 03:03:26,624 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 14 states and 19 transitions. [2019-11-28 03:03:26,629 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2019-11-28 03:03:26,629 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 14 states to 14 states and 19 transitions. [2019-11-28 03:03:26,630 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 9 [2019-11-28 03:03:26,630 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 9 [2019-11-28 03:03:26,630 INFO L73 IsDeterministic]: Start isDeterministic. Operand 14 states and 19 transitions. [2019-11-28 03:03:26,630 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-11-28 03:03:26,631 INFO L688 BuchiCegarLoop]: Abstraction has 14 states and 19 transitions. [2019-11-28 03:03:26,631 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14 states and 19 transitions. [2019-11-28 03:03:26,634 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14 to 12. [2019-11-28 03:03:26,636 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2019-11-28 03:03:26,636 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 16 transitions. [2019-11-28 03:03:26,637 INFO L711 BuchiCegarLoop]: Abstraction has 12 states and 16 transitions. [2019-11-28 03:03:26,637 INFO L591 BuchiCegarLoop]: Abstraction has 12 states and 16 transitions. [2019-11-28 03:03:26,637 INFO L424 BuchiCegarLoop]: ======== Iteration 3============ [2019-11-28 03:03:26,637 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 12 states and 16 transitions. [2019-11-28 03:03:26,638 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2019-11-28 03:03:26,639 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-28 03:03:26,639 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-28 03:03:26,641 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 03:03:26,641 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2019-11-28 03:03:26,641 INFO L794 eck$LassoCheckResult]: Stem: 162#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 156#L-1 havoc main_#res;havoc main_#t~nondet205, main_#t~malloc206.base, main_#t~malloc206.offset, main_#t~nondet208, main_#t~mem209, main_#t~post207, main_#t~mem210, main_#t~post211, main_#t~post212, main_~i~0, main_~j~0, main_~length~0, main_~arr~0.base, main_~arr~0.offset;havoc main_~i~0;havoc main_~j~0;main_~length~0 := main_#t~nondet205;havoc main_#t~nondet205; 157#L367 assume !(main_~length~0 < 1); 164#L367-2 call main_#t~malloc206.base, main_#t~malloc206.offset := #Ultimate.allocOnStack(4 * main_~length~0);main_~arr~0.base, main_~arr~0.offset := main_#t~malloc206.base, main_#t~malloc206.offset; 165#L369 assume !(main_~arr~0.base == 0 && main_~arr~0.offset == 0);main_~i~0 := 0; 166#L370-3 assume !!(main_~i~0 < main_~length~0);call write~int(main_#t~nondet208, main_~arr~0.base, main_~arr~0.offset + 4 * main_~i~0, 4);havoc main_#t~nondet208;call main_#t~mem209 := read~int(main_~arr~0.base, main_~arr~0.offset + 4 * main_~i~0, 4); 158#L372 assume !(1 == (if main_#t~mem209 < 0 && 0 != main_#t~mem209 % 2 then main_#t~mem209 % 2 - 2 else main_#t~mem209 % 2));havoc main_#t~mem209; 159#L370-2 main_#t~post207 := main_~i~0;main_~i~0 := 1 + main_#t~post207;havoc main_#t~post207; 167#L370-3 assume !(main_~i~0 < main_~length~0); 160#L370-4 main_~j~0 := 0; 161#L378-2 [2019-11-28 03:03:26,641 INFO L796 eck$LassoCheckResult]: Loop: 161#L378-2 assume !!(0 <= main_~j~0 && main_~j~0 < main_~length~0);call main_#t~mem210 := read~int(main_~arr~0.base, main_~arr~0.offset + 4 * main_~j~0, 4); 163#L378 assume 0 == (if main_#t~mem210 < 0 && 0 != main_#t~mem210 % 2 then main_#t~mem210 % 2 - 2 else main_#t~mem210 % 2);havoc main_#t~mem210;main_#t~post211 := main_~j~0;main_~j~0 := 1 + main_#t~post211;havoc main_#t~post211; 161#L378-2 [2019-11-28 03:03:26,642 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 03:03:26,642 INFO L82 PathProgramCache]: Analyzing trace with hash -1982565540, now seen corresponding path program 1 times [2019-11-28 03:03:26,642 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 03:03:26,643 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [900206146] [2019-11-28 03:03:26,643 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 03:03:26,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 03:03:26,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 03:03:26,706 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-28 03:03:26,708 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 03:03:26,709 INFO L82 PathProgramCache]: Analyzing trace with hash 2308, now seen corresponding path program 2 times [2019-11-28 03:03:26,709 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 03:03:26,709 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1339171269] [2019-11-28 03:03:26,711 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 03:03:26,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 03:03:26,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 03:03:26,733 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-28 03:03:26,735 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 03:03:26,736 INFO L82 PathProgramCache]: Analyzing trace with hash 1719996831, now seen corresponding path program 1 times [2019-11-28 03:03:26,736 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 03:03:26,737 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [57733464] [2019-11-28 03:03:26,737 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 03:03:26,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 03:03:26,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 03:03:26,813 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-28 03:03:27,079 WARN L192 SmtUtils]: Spent 178.00 ms on a formula simplification. DAG size of input: 86 DAG size of output: 73 [2019-11-28 03:03:27,404 WARN L192 SmtUtils]: Spent 310.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 56 [2019-11-28 03:03:27,413 INFO L210 LassoAnalysis]: Preferences: [2019-11-28 03:03:27,413 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2019-11-28 03:03:27,413 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-11-28 03:03:27,413 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2019-11-28 03:03:27,413 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2019-11-28 03:03:27,414 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 03:03:27,414 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2019-11-28 03:03:27,414 INFO L132 ssoRankerPreferences]: Path of dumped script: [2019-11-28 03:03:27,414 INFO L133 ssoRankerPreferences]: Filename of dumped script: array16_alloca_original.i_Iteration3_Lasso [2019-11-28 03:03:27,414 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2019-11-28 03:03:27,414 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-11-28 03:03:27,418 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 03:03:27,427 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 03:03:27,435 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 03:03:27,438 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 03:03:27,692 WARN L192 SmtUtils]: Spent 229.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 43 [2019-11-28 03:03:27,722 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 03:03:27,727 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 03:03:27,729 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 03:03:27,731 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 03:03:27,733 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 03:03:27,737 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 03:03:27,739 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 03:03:27,743 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 03:03:28,095 WARN L192 SmtUtils]: Spent 115.00 ms on a formula simplification. DAG size of input: 24 DAG size of output: 24 [2019-11-28 03:03:28,120 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-11-28 03:03:28,120 INFO L489 LassoAnalysis]: Using template 'affine'. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 13 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-28 03:03:28,132 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-28 03:03:28,134 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 03:03:28,134 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-28 03:03:28,135 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 03:03:28,135 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 03:03:28,135 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 03:03:28,136 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-28 03:03:28,136 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. Waiting until toolchain timeout for monitored process 13 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 03:03:28,140 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 14 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-28 03:03:28,159 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-28 03:03:28,161 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 03:03:28,161 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-28 03:03:28,161 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 03:03:28,161 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 03:03:28,161 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 03:03:28,162 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-28 03:03:28,162 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. Waiting until toolchain timeout for monitored process 14 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 03:03:28,164 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 15 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-28 03:03:28,180 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-28 03:03:28,181 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 03:03:28,182 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 03:03:28,182 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 03:03:28,182 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 03:03:28,185 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-28 03:03:28,185 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. Waiting until toolchain timeout for monitored process 15 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 03:03:28,189 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 16 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-28 03:03:28,205 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-28 03:03:28,207 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 03:03:28,207 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 03:03:28,207 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 03:03:28,207 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 03:03:28,210 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-28 03:03:28,210 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. Waiting until toolchain timeout for monitored process 16 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 03:03:28,218 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 17 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-28 03:03:28,235 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-28 03:03:28,237 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 03:03:28,237 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 03:03:28,238 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 03:03:28,238 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 03:03:28,242 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-28 03:03:28,242 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. Waiting until toolchain timeout for monitored process 17 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 03:03:28,247 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 18 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-28 03:03:28,265 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-28 03:03:28,267 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 03:03:28,268 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 03:03:28,268 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 03:03:28,268 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 03:03:28,276 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-28 03:03:28,277 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. Waiting until toolchain timeout for monitored process 18 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 03:03:28,291 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-11-28 03:03:28,329 INFO L443 ModelExtractionUtils]: Simplification made 15 calls to the SMT solver. [2019-11-28 03:03:28,329 INFO L444 ModelExtractionUtils]: 3 out of 22 variables were initially zero. Simplification set additionally 16 variables to zero. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 19 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-28 03:03:28,339 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... Waiting until toolchain timeout for monitored process 19 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 03:03:28,344 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2019-11-28 03:03:28,344 INFO L510 LassoAnalysis]: Proved termination. [2019-11-28 03:03:28,344 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~j~0, ULTIMATE.start_main_~length~0) = -1*ULTIMATE.start_main_~j~0 + 1*ULTIMATE.start_main_~length~0 Supporting invariants [] [2019-11-28 03:03:28,361 INFO L297 tatePredicateManager]: 3 out of 3 supporting invariants were superfluous and have been removed [2019-11-28 03:03:28,401 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 03:03:28,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 03:03:28,418 INFO L255 TraceCheckSpWp]: Trace formula consists of 40 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-28 03:03:28,419 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 03:03:28,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 03:03:28,429 INFO L255 TraceCheckSpWp]: Trace formula consists of 14 conjuncts, 4 conjunts are in the unsatisfiable core [2019-11-28 03:03:28,429 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 03:03:28,443 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 03:03:28,443 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2019-11-28 03:03:28,443 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 12 states and 16 transitions. cyclomatic complexity: 6 Second operand 3 states. [2019-11-28 03:03:28,464 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 12 states and 16 transitions. cyclomatic complexity: 6. Second operand 3 states. Result 16 states and 22 transitions. Complement of second has 5 states. [2019-11-28 03:03:28,465 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2019-11-28 03:03:28,465 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2019-11-28 03:03:28,465 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 14 transitions. [2019-11-28 03:03:28,466 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 14 transitions. Stem has 10 letters. Loop has 2 letters. [2019-11-28 03:03:28,466 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-28 03:03:28,466 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 14 transitions. Stem has 12 letters. Loop has 2 letters. [2019-11-28 03:03:28,466 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-28 03:03:28,466 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 14 transitions. Stem has 10 letters. Loop has 4 letters. [2019-11-28 03:03:28,467 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-28 03:03:28,467 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 16 states and 22 transitions. [2019-11-28 03:03:28,468 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2019-11-28 03:03:28,468 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 16 states to 16 states and 22 transitions. [2019-11-28 03:03:28,468 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 10 [2019-11-28 03:03:28,471 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 11 [2019-11-28 03:03:28,471 INFO L73 IsDeterministic]: Start isDeterministic. Operand 16 states and 22 transitions. [2019-11-28 03:03:28,471 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-11-28 03:03:28,471 INFO L688 BuchiCegarLoop]: Abstraction has 16 states and 22 transitions. [2019-11-28 03:03:28,471 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16 states and 22 transitions. [2019-11-28 03:03:28,473 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16 to 16. [2019-11-28 03:03:28,473 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2019-11-28 03:03:28,475 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 22 transitions. [2019-11-28 03:03:28,475 INFO L711 BuchiCegarLoop]: Abstraction has 16 states and 22 transitions. [2019-11-28 03:03:28,476 INFO L591 BuchiCegarLoop]: Abstraction has 16 states and 22 transitions. [2019-11-28 03:03:28,476 INFO L424 BuchiCegarLoop]: ======== Iteration 4============ [2019-11-28 03:03:28,476 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 16 states and 22 transitions. [2019-11-28 03:03:28,477 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2019-11-28 03:03:28,479 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-28 03:03:28,479 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-28 03:03:28,480 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 03:03:28,480 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2019-11-28 03:03:28,481 INFO L794 eck$LassoCheckResult]: Stem: 259#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 253#L-1 havoc main_#res;havoc main_#t~nondet205, main_#t~malloc206.base, main_#t~malloc206.offset, main_#t~nondet208, main_#t~mem209, main_#t~post207, main_#t~mem210, main_#t~post211, main_#t~post212, main_~i~0, main_~j~0, main_~length~0, main_~arr~0.base, main_~arr~0.offset;havoc main_~i~0;havoc main_~j~0;main_~length~0 := main_#t~nondet205;havoc main_#t~nondet205; 254#L367 assume !(main_~length~0 < 1); 265#L367-2 call main_#t~malloc206.base, main_#t~malloc206.offset := #Ultimate.allocOnStack(4 * main_~length~0);main_~arr~0.base, main_~arr~0.offset := main_#t~malloc206.base, main_#t~malloc206.offset; 266#L369 assume !(main_~arr~0.base == 0 && main_~arr~0.offset == 0);main_~i~0 := 0; 267#L370-3 assume !!(main_~i~0 < main_~length~0);call write~int(main_#t~nondet208, main_~arr~0.base, main_~arr~0.offset + 4 * main_~i~0, 4);havoc main_#t~nondet208;call main_#t~mem209 := read~int(main_~arr~0.base, main_~arr~0.offset + 4 * main_~i~0, 4); 255#L372 assume !(1 == (if main_#t~mem209 < 0 && 0 != main_#t~mem209 % 2 then main_#t~mem209 % 2 - 2 else main_#t~mem209 % 2));havoc main_#t~mem209; 256#L370-2 main_#t~post207 := main_~i~0;main_~i~0 := 1 + main_#t~post207;havoc main_#t~post207; 268#L370-3 assume !(main_~i~0 < main_~length~0); 257#L370-4 main_~j~0 := 0; 258#L378-2 assume !!(0 <= main_~j~0 && main_~j~0 < main_~length~0);call main_#t~mem210 := read~int(main_~arr~0.base, main_~arr~0.offset + 4 * main_~j~0, 4); 264#L378 assume !(0 == (if main_#t~mem210 < 0 && 0 != main_#t~mem210 % 2 then main_#t~mem210 % 2 - 2 else main_#t~mem210 % 2));havoc main_#t~mem210;main_#t~post212 := main_~j~0;main_~j~0 := main_#t~post212 - 1;havoc main_#t~post212; 260#L378-2 [2019-11-28 03:03:28,481 INFO L796 eck$LassoCheckResult]: Loop: 260#L378-2 assume !!(0 <= main_~j~0 && main_~j~0 < main_~length~0);call main_#t~mem210 := read~int(main_~arr~0.base, main_~arr~0.offset + 4 * main_~j~0, 4); 261#L378 assume 0 == (if main_#t~mem210 < 0 && 0 != main_#t~mem210 % 2 then main_#t~mem210 % 2 - 2 else main_#t~mem210 % 2);havoc main_#t~mem210;main_#t~post211 := main_~j~0;main_~j~0 := 1 + main_#t~post211;havoc main_#t~post211; 260#L378-2 [2019-11-28 03:03:28,481 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 03:03:28,481 INFO L82 PathProgramCache]: Analyzing trace with hash 1719996833, now seen corresponding path program 1 times [2019-11-28 03:03:28,481 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 03:03:28,482 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1453584795] [2019-11-28 03:03:28,482 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 03:03:28,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 03:03:28,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 03:03:28,544 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-28 03:03:28,544 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 03:03:28,545 INFO L82 PathProgramCache]: Analyzing trace with hash 2308, now seen corresponding path program 3 times [2019-11-28 03:03:28,545 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 03:03:28,545 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1360024678] [2019-11-28 03:03:28,545 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 03:03:28,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 03:03:28,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 03:03:28,555 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-28 03:03:28,555 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 03:03:28,555 INFO L82 PathProgramCache]: Analyzing trace with hash -645451100, now seen corresponding path program 1 times [2019-11-28 03:03:28,556 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 03:03:28,556 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1568144539] [2019-11-28 03:03:28,556 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 03:03:28,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 03:03:28,585 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-11-28 03:03:28,586 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1568144539] [2019-11-28 03:03:28,586 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [561187840] [2019-11-28 03:03:28,586 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-28 03:03:28,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 03:03:28,629 INFO L255 TraceCheckSpWp]: Trace formula consists of 63 conjuncts, 3 conjunts are in the unsatisfiable core [2019-11-28 03:03:28,630 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 03:03:28,640 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-11-28 03:03:28,640 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-11-28 03:03:28,641 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [4] total 5 [2019-11-28 03:03:28,641 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [380080270] [2019-11-28 03:03:28,710 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 03:03:28,710 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-28 03:03:28,711 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-28 03:03:28,711 INFO L87 Difference]: Start difference. First operand 16 states and 22 transitions. cyclomatic complexity: 9 Second operand 4 states. [2019-11-28 03:03:28,732 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 03:03:28,732 INFO L93 Difference]: Finished difference Result 19 states and 24 transitions. [2019-11-28 03:03:28,733 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-28 03:03:28,733 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 19 states and 24 transitions. [2019-11-28 03:03:28,734 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2019-11-28 03:03:28,735 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 19 states to 17 states and 22 transitions. [2019-11-28 03:03:28,735 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 11 [2019-11-28 03:03:28,735 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 11 [2019-11-28 03:03:28,736 INFO L73 IsDeterministic]: Start isDeterministic. Operand 17 states and 22 transitions. [2019-11-28 03:03:28,736 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-11-28 03:03:28,736 INFO L688 BuchiCegarLoop]: Abstraction has 17 states and 22 transitions. [2019-11-28 03:03:28,736 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states and 22 transitions. [2019-11-28 03:03:28,738 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 16. [2019-11-28 03:03:28,738 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2019-11-28 03:03:28,739 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 21 transitions. [2019-11-28 03:03:28,739 INFO L711 BuchiCegarLoop]: Abstraction has 16 states and 21 transitions. [2019-11-28 03:03:28,739 INFO L591 BuchiCegarLoop]: Abstraction has 16 states and 21 transitions. [2019-11-28 03:03:28,739 INFO L424 BuchiCegarLoop]: ======== Iteration 5============ [2019-11-28 03:03:28,739 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 16 states and 21 transitions. [2019-11-28 03:03:28,740 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2019-11-28 03:03:28,740 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-28 03:03:28,740 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-28 03:03:28,741 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 03:03:28,741 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2019-11-28 03:03:28,741 INFO L794 eck$LassoCheckResult]: Stem: 343#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 339#L-1 havoc main_#res;havoc main_#t~nondet205, main_#t~malloc206.base, main_#t~malloc206.offset, main_#t~nondet208, main_#t~mem209, main_#t~post207, main_#t~mem210, main_#t~post211, main_#t~post212, main_~i~0, main_~j~0, main_~length~0, main_~arr~0.base, main_~arr~0.offset;havoc main_~i~0;havoc main_~j~0;main_~length~0 := main_#t~nondet205;havoc main_#t~nondet205; 340#L367 assume !(main_~length~0 < 1); 347#L367-2 call main_#t~malloc206.base, main_#t~malloc206.offset := #Ultimate.allocOnStack(4 * main_~length~0);main_~arr~0.base, main_~arr~0.offset := main_#t~malloc206.base, main_#t~malloc206.offset; 348#L369 assume !(main_~arr~0.base == 0 && main_~arr~0.offset == 0);main_~i~0 := 0; 349#L370-3 assume !!(main_~i~0 < main_~length~0);call write~int(main_#t~nondet208, main_~arr~0.base, main_~arr~0.offset + 4 * main_~i~0, 4);havoc main_#t~nondet208;call main_#t~mem209 := read~int(main_~arr~0.base, main_~arr~0.offset + 4 * main_~i~0, 4); 337#L372 assume !(1 == (if main_#t~mem209 < 0 && 0 != main_#t~mem209 % 2 then main_#t~mem209 % 2 - 2 else main_#t~mem209 % 2));havoc main_#t~mem209; 338#L370-2 main_#t~post207 := main_~i~0;main_~i~0 := 1 + main_#t~post207;havoc main_#t~post207; 350#L370-3 assume !(main_~i~0 < main_~length~0); 341#L370-4 main_~j~0 := 0; 342#L378-2 assume !!(0 <= main_~j~0 && main_~j~0 < main_~length~0);call main_#t~mem210 := read~int(main_~arr~0.base, main_~arr~0.offset + 4 * main_~j~0, 4); 344#L378 assume 0 == (if main_#t~mem210 < 0 && 0 != main_#t~mem210 % 2 then main_#t~mem210 % 2 - 2 else main_#t~mem210 % 2);havoc main_#t~mem210;main_#t~post211 := main_~j~0;main_~j~0 := 1 + main_#t~post211;havoc main_#t~post211; 345#L378-2 assume !!(0 <= main_~j~0 && main_~j~0 < main_~length~0);call main_#t~mem210 := read~int(main_~arr~0.base, main_~arr~0.offset + 4 * main_~j~0, 4); 346#L378 assume !(0 == (if main_#t~mem210 < 0 && 0 != main_#t~mem210 % 2 then main_#t~mem210 % 2 - 2 else main_#t~mem210 % 2));havoc main_#t~mem210;main_#t~post212 := main_~j~0;main_~j~0 := main_#t~post212 - 1;havoc main_#t~post212; 351#L378-2 [2019-11-28 03:03:28,741 INFO L796 eck$LassoCheckResult]: Loop: 351#L378-2 assume !!(0 <= main_~j~0 && main_~j~0 < main_~length~0);call main_#t~mem210 := read~int(main_~arr~0.base, main_~arr~0.offset + 4 * main_~j~0, 4); 352#L378 assume 0 == (if main_#t~mem210 < 0 && 0 != main_#t~mem210 % 2 then main_#t~mem210 % 2 - 2 else main_#t~mem210 % 2);havoc main_#t~mem210;main_#t~post211 := main_~j~0;main_~j~0 := 1 + main_#t~post211;havoc main_#t~post211; 351#L378-2 [2019-11-28 03:03:28,741 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 03:03:28,742 INFO L82 PathProgramCache]: Analyzing trace with hash -645453020, now seen corresponding path program 2 times [2019-11-28 03:03:28,742 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 03:03:28,742 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [430797749] [2019-11-28 03:03:28,743 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 03:03:28,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 03:03:28,851 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 03:03:28,851 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [430797749] [2019-11-28 03:03:28,851 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [144707000] [2019-11-28 03:03:28,851 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 21 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 21 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-28 03:03:28,891 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-11-28 03:03:28,892 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-28 03:03:28,892 INFO L255 TraceCheckSpWp]: Trace formula consists of 63 conjuncts, 6 conjunts are in the unsatisfiable core [2019-11-28 03:03:28,894 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 03:03:28,942 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 03:03:28,942 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-28 03:03:28,942 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7] total 13 [2019-11-28 03:03:28,943 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1268779764] [2019-11-28 03:03:28,943 INFO L799 eck$LassoCheckResult]: stem already infeasible [2019-11-28 03:03:28,943 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 03:03:28,943 INFO L82 PathProgramCache]: Analyzing trace with hash 2308, now seen corresponding path program 4 times [2019-11-28 03:03:28,943 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 03:03:28,944 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2024835308] [2019-11-28 03:03:28,944 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 03:03:28,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 03:03:28,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 03:03:28,953 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-28 03:03:29,022 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 03:03:29,022 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-11-28 03:03:29,023 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=118, Unknown=0, NotChecked=0, Total=156 [2019-11-28 03:03:29,023 INFO L87 Difference]: Start difference. First operand 16 states and 21 transitions. cyclomatic complexity: 8 Second operand 13 states. [2019-11-28 03:03:29,186 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 03:03:29,186 INFO L93 Difference]: Finished difference Result 31 states and 40 transitions. [2019-11-28 03:03:29,187 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-11-28 03:03:29,187 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 31 states and 40 transitions. [2019-11-28 03:03:29,189 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2019-11-28 03:03:29,190 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 31 states to 21 states and 27 transitions. [2019-11-28 03:03:29,190 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 11 [2019-11-28 03:03:29,190 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 11 [2019-11-28 03:03:29,190 INFO L73 IsDeterministic]: Start isDeterministic. Operand 21 states and 27 transitions. [2019-11-28 03:03:29,191 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-11-28 03:03:29,191 INFO L688 BuchiCegarLoop]: Abstraction has 21 states and 27 transitions. [2019-11-28 03:03:29,191 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states and 27 transitions. [2019-11-28 03:03:29,192 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 19. [2019-11-28 03:03:29,192 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2019-11-28 03:03:29,193 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 24 transitions. [2019-11-28 03:03:29,193 INFO L711 BuchiCegarLoop]: Abstraction has 19 states and 24 transitions. [2019-11-28 03:03:29,193 INFO L591 BuchiCegarLoop]: Abstraction has 19 states and 24 transitions. [2019-11-28 03:03:29,193 INFO L424 BuchiCegarLoop]: ======== Iteration 6============ [2019-11-28 03:03:29,193 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 19 states and 24 transitions. [2019-11-28 03:03:29,194 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2019-11-28 03:03:29,194 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-28 03:03:29,194 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-28 03:03:29,195 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 03:03:29,195 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2019-11-28 03:03:29,195 INFO L794 eck$LassoCheckResult]: Stem: 453#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 449#L-1 havoc main_#res;havoc main_#t~nondet205, main_#t~malloc206.base, main_#t~malloc206.offset, main_#t~nondet208, main_#t~mem209, main_#t~post207, main_#t~mem210, main_#t~post211, main_#t~post212, main_~i~0, main_~j~0, main_~length~0, main_~arr~0.base, main_~arr~0.offset;havoc main_~i~0;havoc main_~j~0;main_~length~0 := main_#t~nondet205;havoc main_#t~nondet205; 450#L367 assume !(main_~length~0 < 1); 459#L367-2 call main_#t~malloc206.base, main_#t~malloc206.offset := #Ultimate.allocOnStack(4 * main_~length~0);main_~arr~0.base, main_~arr~0.offset := main_#t~malloc206.base, main_#t~malloc206.offset; 460#L369 assume !(main_~arr~0.base == 0 && main_~arr~0.offset == 0);main_~i~0 := 0; 461#L370-3 assume !!(main_~i~0 < main_~length~0);call write~int(main_#t~nondet208, main_~arr~0.base, main_~arr~0.offset + 4 * main_~i~0, 4);havoc main_#t~nondet208;call main_#t~mem209 := read~int(main_~arr~0.base, main_~arr~0.offset + 4 * main_~i~0, 4); 464#L372 assume !(1 == (if main_#t~mem209 < 0 && 0 != main_#t~mem209 % 2 then main_#t~mem209 % 2 - 2 else main_#t~mem209 % 2));havoc main_#t~mem209; 462#L370-2 main_#t~post207 := main_~i~0;main_~i~0 := 1 + main_#t~post207;havoc main_#t~post207; 463#L370-3 assume !!(main_~i~0 < main_~length~0);call write~int(main_#t~nondet208, main_~arr~0.base, main_~arr~0.offset + 4 * main_~i~0, 4);havoc main_#t~nondet208;call main_#t~mem209 := read~int(main_~arr~0.base, main_~arr~0.offset + 4 * main_~i~0, 4); 447#L372 assume !(1 == (if main_#t~mem209 < 0 && 0 != main_#t~mem209 % 2 then main_#t~mem209 % 2 - 2 else main_#t~mem209 % 2));havoc main_#t~mem209; 448#L370-2 main_#t~post207 := main_~i~0;main_~i~0 := 1 + main_#t~post207;havoc main_#t~post207; 465#L370-3 assume !(main_~i~0 < main_~length~0); 451#L370-4 main_~j~0 := 0; 452#L378-2 assume !!(0 <= main_~j~0 && main_~j~0 < main_~length~0);call main_#t~mem210 := read~int(main_~arr~0.base, main_~arr~0.offset + 4 * main_~j~0, 4); 457#L378 assume 0 == (if main_#t~mem210 < 0 && 0 != main_#t~mem210 % 2 then main_#t~mem210 % 2 - 2 else main_#t~mem210 % 2);havoc main_#t~mem210;main_#t~post211 := main_~j~0;main_~j~0 := 1 + main_#t~post211;havoc main_#t~post211; 456#L378-2 assume !!(0 <= main_~j~0 && main_~j~0 < main_~length~0);call main_#t~mem210 := read~int(main_~arr~0.base, main_~arr~0.offset + 4 * main_~j~0, 4); 458#L378 assume !(0 == (if main_#t~mem210 < 0 && 0 != main_#t~mem210 % 2 then main_#t~mem210 % 2 - 2 else main_#t~mem210 % 2));havoc main_#t~mem210;main_#t~post212 := main_~j~0;main_~j~0 := main_#t~post212 - 1;havoc main_#t~post212; 454#L378-2 [2019-11-28 03:03:29,195 INFO L796 eck$LassoCheckResult]: Loop: 454#L378-2 assume !!(0 <= main_~j~0 && main_~j~0 < main_~length~0);call main_#t~mem210 := read~int(main_~arr~0.base, main_~arr~0.offset + 4 * main_~j~0, 4); 455#L378 assume 0 == (if main_#t~mem210 < 0 && 0 != main_#t~mem210 % 2 then main_#t~mem210 % 2 - 2 else main_#t~mem210 % 2);havoc main_#t~mem210;main_#t~post211 := main_~j~0;main_~j~0 := 1 + main_#t~post211;havoc main_#t~post211; 454#L378-2 [2019-11-28 03:03:29,195 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 03:03:29,195 INFO L82 PathProgramCache]: Analyzing trace with hash -685994466, now seen corresponding path program 3 times [2019-11-28 03:03:29,196 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 03:03:29,196 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2123567121] [2019-11-28 03:03:29,196 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 03:03:29,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 03:03:29,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 03:03:29,252 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-28 03:03:29,253 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 03:03:29,253 INFO L82 PathProgramCache]: Analyzing trace with hash 2308, now seen corresponding path program 5 times [2019-11-28 03:03:29,253 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 03:03:29,253 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [157534760] [2019-11-28 03:03:29,254 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 03:03:29,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 03:03:29,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 03:03:29,261 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-28 03:03:29,261 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 03:03:29,261 INFO L82 PathProgramCache]: Analyzing trace with hash -2110684191, now seen corresponding path program 4 times [2019-11-28 03:03:29,262 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 03:03:29,262 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1302616270] [2019-11-28 03:03:29,262 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 03:03:29,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 03:03:29,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 03:03:29,313 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-28 03:03:29,806 WARN L192 SmtUtils]: Spent 431.00 ms on a formula simplification. DAG size of input: 162 DAG size of output: 121 [MP z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (19)] Exception during sending of exit command (exit): Broken pipe [2019-11-28 03:03:30,316 WARN L192 SmtUtils]: Spent 396.00 ms on a formula simplification. DAG size of input: 110 DAG size of output: 69 [2019-11-28 03:03:30,319 INFO L210 LassoAnalysis]: Preferences: [2019-11-28 03:03:30,319 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2019-11-28 03:03:30,319 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-11-28 03:03:30,319 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2019-11-28 03:03:30,319 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2019-11-28 03:03:30,320 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 03:03:30,320 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2019-11-28 03:03:30,320 INFO L132 ssoRankerPreferences]: Path of dumped script: [2019-11-28 03:03:30,320 INFO L133 ssoRankerPreferences]: Filename of dumped script: array16_alloca_original.i_Iteration6_Lasso [2019-11-28 03:03:30,320 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2019-11-28 03:03:30,320 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-11-28 03:03:30,323 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 03:03:30,331 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 03:03:30,332 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 03:03:30,335 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 03:03:30,509 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 03:03:30,515 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 03:03:30,517 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 03:03:30,518 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 03:03:30,521 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 03:03:30,523 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 03:03:30,525 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 03:03:30,526 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 03:03:30,888 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-11-28 03:03:30,888 INFO L489 LassoAnalysis]: Using template 'affine'. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 22 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 22 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 03:03:30,896 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-28 03:03:30,897 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 03:03:30,897 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-28 03:03:30,897 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 03:03:30,897 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 03:03:30,898 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 03:03:30,898 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-28 03:03:30,899 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-28 03:03:30,906 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 23 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-28 03:03:30,920 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-28 03:03:30,922 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 03:03:30,922 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-28 03:03:30,922 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 03:03:30,922 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 03:03:30,922 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 03:03:30,923 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-28 03:03:30,923 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. Waiting until toolchain timeout for monitored process 23 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 03:03:30,925 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 24 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 24 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 03:03:30,937 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-28 03:03:30,939 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 03:03:30,939 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 03:03:30,939 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 03:03:30,939 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 03:03:30,941 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-28 03:03:30,941 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-28 03:03:30,946 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 25 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-28 03:03:30,957 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-28 03:03:30,959 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 03:03:30,959 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 03:03:30,960 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 03:03:30,960 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 03:03:30,963 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-28 03:03:30,963 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. Waiting until toolchain timeout for monitored process 25 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 03:03:30,969 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 26 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-28 03:03:30,978 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-28 03:03:30,980 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 03:03:30,980 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 03:03:30,980 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 03:03:30,980 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 03:03:30,987 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-28 03:03:30,987 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. Waiting until toolchain timeout for monitored process 26 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 03:03:30,997 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 27 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-28 03:03:31,004 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-28 03:03:31,005 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 03:03:31,006 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 03:03:31,006 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 03:03:31,006 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 03:03:31,013 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-28 03:03:31,013 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. Waiting until toolchain timeout for monitored process 27 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 03:03:31,026 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-11-28 03:03:31,073 INFO L443 ModelExtractionUtils]: Simplification made 18 calls to the SMT solver. [2019-11-28 03:03:31,073 INFO L444 ModelExtractionUtils]: 1 out of 22 variables were initially zero. Simplification set additionally 15 variables to zero. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 28 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-28 03:03:31,079 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... Waiting until toolchain timeout for monitored process 28 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 03:03:31,083 INFO L438 nArgumentSynthesizer]: Removed 1 redundant supporting invariants from a total of 2. [2019-11-28 03:03:31,083 INFO L510 LassoAnalysis]: Proved termination. [2019-11-28 03:03:31,083 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~arr~0.offset, ULTIMATE.start_main_~j~0) = -1*ULTIMATE.start_main_~arr~0.offset - 4*ULTIMATE.start_main_~j~0 + 10 Supporting invariants [-1*v_rep(select #length ULTIMATE.start_main_~arr~0.base)_3 + 8 >= 0] [2019-11-28 03:03:31,111 INFO L297 tatePredicateManager]: 6 out of 7 supporting invariants were superfluous and have been removed [2019-11-28 03:03:31,138 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 03:03:31,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 03:03:31,158 INFO L255 TraceCheckSpWp]: Trace formula consists of 74 conjuncts, 9 conjunts are in the unsatisfiable core [2019-11-28 03:03:31,159 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 03:03:31,164 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 8 treesize of output 7 [2019-11-28 03:03:31,164 INFO L508 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-28 03:03:31,168 INFO L588 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-28 03:03:31,168 INFO L508 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-28 03:03:31,169 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2019-11-28 03:03:31,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 03:03:31,255 INFO L255 TraceCheckSpWp]: Trace formula consists of 15 conjuncts, 5 conjunts are in the unsatisfiable core [2019-11-28 03:03:31,256 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 03:03:31,273 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 03:03:31,274 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.6 stem predicates 2 loop predicates [2019-11-28 03:03:31,274 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 19 states and 24 transitions. cyclomatic complexity: 8 Second operand 8 states. [2019-11-28 03:03:31,460 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 19 states and 24 transitions. cyclomatic complexity: 8. Second operand 8 states. Result 35 states and 47 transitions. Complement of second has 11 states. [2019-11-28 03:03:31,461 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 9 states 6 stem states 1 non-accepting loop states 2 accepting loop states [2019-11-28 03:03:31,461 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2019-11-28 03:03:31,462 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 33 transitions. [2019-11-28 03:03:31,462 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 9 states and 33 transitions. Stem has 17 letters. Loop has 2 letters. [2019-11-28 03:03:31,462 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-28 03:03:31,462 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 9 states and 33 transitions. Stem has 19 letters. Loop has 2 letters. [2019-11-28 03:03:31,463 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-28 03:03:31,463 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 9 states and 33 transitions. Stem has 17 letters. Loop has 4 letters. [2019-11-28 03:03:31,464 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-28 03:03:31,464 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 35 states and 47 transitions. [2019-11-28 03:03:31,465 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2019-11-28 03:03:31,467 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 35 states to 35 states and 47 transitions. [2019-11-28 03:03:31,467 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 16 [2019-11-28 03:03:31,468 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 18 [2019-11-28 03:03:31,468 INFO L73 IsDeterministic]: Start isDeterministic. Operand 35 states and 47 transitions. [2019-11-28 03:03:31,468 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-11-28 03:03:31,469 INFO L688 BuchiCegarLoop]: Abstraction has 35 states and 47 transitions. [2019-11-28 03:03:31,469 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states and 47 transitions. [2019-11-28 03:03:31,472 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 28. [2019-11-28 03:03:31,472 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2019-11-28 03:03:31,473 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 37 transitions. [2019-11-28 03:03:31,473 INFO L711 BuchiCegarLoop]: Abstraction has 28 states and 37 transitions. [2019-11-28 03:03:31,473 INFO L591 BuchiCegarLoop]: Abstraction has 28 states and 37 transitions. [2019-11-28 03:03:31,473 INFO L424 BuchiCegarLoop]: ======== Iteration 7============ [2019-11-28 03:03:31,474 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 28 states and 37 transitions. [2019-11-28 03:03:31,474 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2019-11-28 03:03:31,475 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-28 03:03:31,475 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-28 03:03:31,475 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 03:03:31,475 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2019-11-28 03:03:31,476 INFO L794 eck$LassoCheckResult]: Stem: 639#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 635#L-1 havoc main_#res;havoc main_#t~nondet205, main_#t~malloc206.base, main_#t~malloc206.offset, main_#t~nondet208, main_#t~mem209, main_#t~post207, main_#t~mem210, main_#t~post211, main_#t~post212, main_~i~0, main_~j~0, main_~length~0, main_~arr~0.base, main_~arr~0.offset;havoc main_~i~0;havoc main_~j~0;main_~length~0 := main_#t~nondet205;havoc main_#t~nondet205; 636#L367 assume !(main_~length~0 < 1); 645#L367-2 call main_#t~malloc206.base, main_#t~malloc206.offset := #Ultimate.allocOnStack(4 * main_~length~0);main_~arr~0.base, main_~arr~0.offset := main_#t~malloc206.base, main_#t~malloc206.offset; 646#L369 assume !(main_~arr~0.base == 0 && main_~arr~0.offset == 0);main_~i~0 := 0; 647#L370-3 assume !!(main_~i~0 < main_~length~0);call write~int(main_#t~nondet208, main_~arr~0.base, main_~arr~0.offset + 4 * main_~i~0, 4);havoc main_#t~nondet208;call main_#t~mem209 := read~int(main_~arr~0.base, main_~arr~0.offset + 4 * main_~i~0, 4); 649#L372 assume !(1 == (if main_#t~mem209 < 0 && 0 != main_#t~mem209 % 2 then main_#t~mem209 % 2 - 2 else main_#t~mem209 % 2));havoc main_#t~mem209; 654#L370-2 main_#t~post207 := main_~i~0;main_~i~0 := 1 + main_#t~post207;havoc main_#t~post207; 650#L370-3 assume !!(main_~i~0 < main_~length~0);call write~int(main_#t~nondet208, main_~arr~0.base, main_~arr~0.offset + 4 * main_~i~0, 4);havoc main_#t~nondet208;call main_#t~mem209 := read~int(main_~arr~0.base, main_~arr~0.offset + 4 * main_~i~0, 4); 651#L372 assume !(1 == (if main_#t~mem209 < 0 && 0 != main_#t~mem209 % 2 then main_#t~mem209 % 2 - 2 else main_#t~mem209 % 2));havoc main_#t~mem209; 660#L370-2 main_#t~post207 := main_~i~0;main_~i~0 := 1 + main_#t~post207;havoc main_#t~post207; 652#L370-3 assume !(main_~i~0 < main_~length~0); 653#L370-4 main_~j~0 := 0; 659#L378-2 assume !!(0 <= main_~j~0 && main_~j~0 < main_~length~0);call main_#t~mem210 := read~int(main_~arr~0.base, main_~arr~0.offset + 4 * main_~j~0, 4); 658#L378 assume 0 == (if main_#t~mem210 < 0 && 0 != main_#t~mem210 % 2 then main_#t~mem210 % 2 - 2 else main_#t~mem210 % 2);havoc main_#t~mem210;main_#t~post211 := main_~j~0;main_~j~0 := 1 + main_#t~post211;havoc main_#t~post211; 657#L378-2 assume !!(0 <= main_~j~0 && main_~j~0 < main_~length~0);call main_#t~mem210 := read~int(main_~arr~0.base, main_~arr~0.offset + 4 * main_~j~0, 4); 655#L378 assume !(0 == (if main_#t~mem210 < 0 && 0 != main_#t~mem210 % 2 then main_#t~mem210 % 2 - 2 else main_#t~mem210 % 2));havoc main_#t~mem210;main_#t~post212 := main_~j~0;main_~j~0 := main_#t~post212 - 1;havoc main_#t~post212; 656#L378-2 assume !!(0 <= main_~j~0 && main_~j~0 < main_~length~0);call main_#t~mem210 := read~int(main_~arr~0.base, main_~arr~0.offset + 4 * main_~j~0, 4); 644#L378 assume !(0 == (if main_#t~mem210 < 0 && 0 != main_#t~mem210 % 2 then main_#t~mem210 % 2 - 2 else main_#t~mem210 % 2));havoc main_#t~mem210;main_#t~post212 := main_~j~0;main_~j~0 := main_#t~post212 - 1;havoc main_#t~post212; 640#L378-2 [2019-11-28 03:03:31,476 INFO L796 eck$LassoCheckResult]: Loop: 640#L378-2 assume !!(0 <= main_~j~0 && main_~j~0 < main_~length~0);call main_#t~mem210 := read~int(main_~arr~0.base, main_~arr~0.offset + 4 * main_~j~0, 4); 641#L378 assume 0 == (if main_#t~mem210 < 0 && 0 != main_#t~mem210 % 2 then main_#t~mem210 % 2 - 2 else main_#t~mem210 % 2);havoc main_#t~mem210;main_#t~post211 := main_~j~0;main_~j~0 := 1 + main_#t~post211;havoc main_#t~post211; 640#L378-2 [2019-11-28 03:03:31,476 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 03:03:31,476 INFO L82 PathProgramCache]: Analyzing trace with hash -2110684189, now seen corresponding path program 5 times [2019-11-28 03:03:31,477 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 03:03:31,477 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [192730586] [2019-11-28 03:03:31,477 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 03:03:31,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 03:03:31,938 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 03:03:31,938 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [192730586] [2019-11-28 03:03:31,938 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1701906338] [2019-11-28 03:03:31,939 INFO L92 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 29 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 29 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-28 03:03:31,983 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) [2019-11-28 03:03:31,983 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-28 03:03:31,984 INFO L255 TraceCheckSpWp]: Trace formula consists of 85 conjuncts, 17 conjunts are in the unsatisfiable core [2019-11-28 03:03:31,986 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 03:03:32,089 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 9 [2019-11-28 03:03:32,089 INFO L508 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-28 03:03:32,091 INFO L588 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-28 03:03:32,091 INFO L508 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-28 03:03:32,091 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:17, output treesize:5 [2019-11-28 03:03:32,100 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2019-11-28 03:03:32,101 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-28 03:03:32,101 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 7] total 15 [2019-11-28 03:03:32,102 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [668911226] [2019-11-28 03:03:32,102 INFO L799 eck$LassoCheckResult]: stem already infeasible [2019-11-28 03:03:32,102 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 03:03:32,103 INFO L82 PathProgramCache]: Analyzing trace with hash 2308, now seen corresponding path program 6 times [2019-11-28 03:03:32,103 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 03:03:32,103 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [160652297] [2019-11-28 03:03:32,103 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 03:03:32,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 03:03:32,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 03:03:32,111 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-28 03:03:32,173 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 03:03:32,173 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-11-28 03:03:32,174 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=183, Unknown=0, NotChecked=0, Total=240 [2019-11-28 03:03:32,174 INFO L87 Difference]: Start difference. First operand 28 states and 37 transitions. cyclomatic complexity: 13 Second operand 16 states. [2019-11-28 03:03:32,382 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 03:03:32,382 INFO L93 Difference]: Finished difference Result 43 states and 55 transitions. [2019-11-28 03:03:32,382 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-11-28 03:03:32,383 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 43 states and 55 transitions. [2019-11-28 03:03:32,384 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 6 [2019-11-28 03:03:32,385 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 43 states to 42 states and 54 transitions. [2019-11-28 03:03:32,386 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 22 [2019-11-28 03:03:32,386 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 22 [2019-11-28 03:03:32,386 INFO L73 IsDeterministic]: Start isDeterministic. Operand 42 states and 54 transitions. [2019-11-28 03:03:32,386 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-11-28 03:03:32,387 INFO L688 BuchiCegarLoop]: Abstraction has 42 states and 54 transitions. [2019-11-28 03:03:32,387 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states and 54 transitions. [2019-11-28 03:03:32,390 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 38. [2019-11-28 03:03:32,390 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38 states. [2019-11-28 03:03:32,391 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 50 transitions. [2019-11-28 03:03:32,391 INFO L711 BuchiCegarLoop]: Abstraction has 38 states and 50 transitions. [2019-11-28 03:03:32,391 INFO L591 BuchiCegarLoop]: Abstraction has 38 states and 50 transitions. [2019-11-28 03:03:32,391 INFO L424 BuchiCegarLoop]: ======== Iteration 8============ [2019-11-28 03:03:32,391 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 38 states and 50 transitions. [2019-11-28 03:03:32,392 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 6 [2019-11-28 03:03:32,392 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-28 03:03:32,392 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-28 03:03:32,393 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 03:03:32,393 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [2, 1, 1] [2019-11-28 03:03:32,393 INFO L794 eck$LassoCheckResult]: Stem: 787#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 781#L-1 havoc main_#res;havoc main_#t~nondet205, main_#t~malloc206.base, main_#t~malloc206.offset, main_#t~nondet208, main_#t~mem209, main_#t~post207, main_#t~mem210, main_#t~post211, main_#t~post212, main_~i~0, main_~j~0, main_~length~0, main_~arr~0.base, main_~arr~0.offset;havoc main_~i~0;havoc main_~j~0;main_~length~0 := main_#t~nondet205;havoc main_#t~nondet205; 782#L367 assume !(main_~length~0 < 1); 792#L367-2 call main_#t~malloc206.base, main_#t~malloc206.offset := #Ultimate.allocOnStack(4 * main_~length~0);main_~arr~0.base, main_~arr~0.offset := main_#t~malloc206.base, main_#t~malloc206.offset; 793#L369 assume !(main_~arr~0.base == 0 && main_~arr~0.offset == 0);main_~i~0 := 0; 794#L370-3 assume !!(main_~i~0 < main_~length~0);call write~int(main_#t~nondet208, main_~arr~0.base, main_~arr~0.offset + 4 * main_~i~0, 4);havoc main_#t~nondet208;call main_#t~mem209 := read~int(main_~arr~0.base, main_~arr~0.offset + 4 * main_~i~0, 4); 798#L372 assume !(1 == (if main_#t~mem209 < 0 && 0 != main_#t~mem209 % 2 then main_#t~mem209 % 2 - 2 else main_#t~mem209 % 2));havoc main_#t~mem209; 802#L370-2 main_#t~post207 := main_~i~0;main_~i~0 := 1 + main_#t~post207;havoc main_#t~post207; 799#L370-3 assume !!(main_~i~0 < main_~length~0);call write~int(main_#t~nondet208, main_~arr~0.base, main_~arr~0.offset + 4 * main_~i~0, 4);havoc main_#t~nondet208;call main_#t~mem209 := read~int(main_~arr~0.base, main_~arr~0.offset + 4 * main_~i~0, 4); 800#L372 assume !(1 == (if main_#t~mem209 < 0 && 0 != main_#t~mem209 % 2 then main_#t~mem209 % 2 - 2 else main_#t~mem209 % 2));havoc main_#t~mem209; 795#L370-2 main_#t~post207 := main_~i~0;main_~i~0 := 1 + main_#t~post207;havoc main_#t~post207; 796#L370-3 assume !!(main_~i~0 < main_~length~0);call write~int(main_#t~nondet208, main_~arr~0.base, main_~arr~0.offset + 4 * main_~i~0, 4);havoc main_#t~nondet208;call main_#t~mem209 := read~int(main_~arr~0.base, main_~arr~0.offset + 4 * main_~i~0, 4); 783#L372 assume !(1 == (if main_#t~mem209 < 0 && 0 != main_#t~mem209 % 2 then main_#t~mem209 % 2 - 2 else main_#t~mem209 % 2));havoc main_#t~mem209; 784#L370-2 main_#t~post207 := main_~i~0;main_~i~0 := 1 + main_#t~post207;havoc main_#t~post207; 801#L370-3 assume !(main_~i~0 < main_~length~0); 785#L370-4 main_~j~0 := 0; 786#L378-2 assume !!(0 <= main_~j~0 && main_~j~0 < main_~length~0);call main_#t~mem210 := read~int(main_~arr~0.base, main_~arr~0.offset + 4 * main_~j~0, 4); 788#L378 assume 0 == (if main_#t~mem210 < 0 && 0 != main_#t~mem210 % 2 then main_#t~mem210 % 2 - 2 else main_#t~mem210 % 2);havoc main_#t~mem210;main_#t~post211 := main_~j~0;main_~j~0 := 1 + main_#t~post211;havoc main_#t~post211; 789#L378-2 assume !!(0 <= main_~j~0 && main_~j~0 < main_~length~0);call main_#t~mem210 := read~int(main_~arr~0.base, main_~arr~0.offset + 4 * main_~j~0, 4); 791#L378 assume !(0 == (if main_#t~mem210 < 0 && 0 != main_#t~mem210 % 2 then main_#t~mem210 % 2 - 2 else main_#t~mem210 % 2));havoc main_#t~mem210;main_#t~post212 := main_~j~0;main_~j~0 := main_#t~post212 - 1;havoc main_#t~post212; 810#L378-2 [2019-11-28 03:03:32,393 INFO L796 eck$LassoCheckResult]: Loop: 810#L378-2 assume !!(0 <= main_~j~0 && main_~j~0 < main_~length~0);call main_#t~mem210 := read~int(main_~arr~0.base, main_~arr~0.offset + 4 * main_~j~0, 4); 805#L378 assume 0 == (if main_#t~mem210 < 0 && 0 != main_#t~mem210 % 2 then main_#t~mem210 % 2 - 2 else main_#t~mem210 % 2);havoc main_#t~mem210;main_#t~post211 := main_~j~0;main_~j~0 := 1 + main_#t~post211;havoc main_#t~post211; 806#L378-2 assume !!(0 <= main_~j~0 && main_~j~0 < main_~length~0);call main_#t~mem210 := read~int(main_~arr~0.base, main_~arr~0.offset + 4 * main_~j~0, 4); 813#L378 assume !(0 == (if main_#t~mem210 < 0 && 0 != main_#t~mem210 % 2 then main_#t~mem210 % 2 - 2 else main_#t~mem210 % 2));havoc main_#t~mem210;main_#t~post212 := main_~j~0;main_~j~0 := main_#t~post212 - 1;havoc main_#t~post212; 810#L378-2 [2019-11-28 03:03:32,394 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 03:03:32,394 INFO L82 PathProgramCache]: Analyzing trace with hash -1570402076, now seen corresponding path program 6 times [2019-11-28 03:03:32,394 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 03:03:32,394 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1866308929] [2019-11-28 03:03:32,394 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 03:03:32,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 03:03:32,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 03:03:32,435 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-28 03:03:32,435 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 03:03:32,436 INFO L82 PathProgramCache]: Analyzing trace with hash 2219337, now seen corresponding path program 1 times [2019-11-28 03:03:32,436 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 03:03:32,436 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1947410798] [2019-11-28 03:03:32,436 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 03:03:32,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 03:03:32,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 03:03:32,446 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-28 03:03:32,447 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 03:03:32,447 INFO L82 PathProgramCache]: Analyzing trace with hash -507624276, now seen corresponding path program 7 times [2019-11-28 03:03:32,447 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 03:03:32,448 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [274459501] [2019-11-28 03:03:32,448 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 03:03:32,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 03:03:32,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 03:03:32,515 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-28 03:03:33,181 WARN L192 SmtUtils]: Spent 516.00 ms on a formula simplification. DAG size of input: 191 DAG size of output: 144 [2019-11-28 03:03:34,761 WARN L192 SmtUtils]: Spent 1.24 s on a formula simplification. DAG size of input: 190 DAG size of output: 78 [2019-11-28 03:03:34,790 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 28.11 03:03:34 BoogieIcfgContainer [2019-11-28 03:03:34,790 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2019-11-28 03:03:34,791 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-11-28 03:03:34,791 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-11-28 03:03:34,791 INFO L275 PluginConnector]: Witness Printer initialized [2019-11-28 03:03:34,792 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 03:03:24" (3/4) ... [2019-11-28 03:03:34,795 INFO L134 WitnessPrinter]: Generating witness for non-termination counterexample [2019-11-28 03:03:34,844 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2019-11-28 03:03:34,844 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-11-28 03:03:34,846 INFO L168 Benchmark]: Toolchain (without parser) took 11667.80 ms. Allocated memory was 1.0 GB in the beginning and 1.3 GB in the end (delta: 259.0 MB). Free memory was 956.3 MB in the beginning and 953.9 MB in the end (delta: 2.5 MB). Peak memory consumption was 261.5 MB. Max. memory is 11.5 GB. [2019-11-28 03:03:34,846 INFO L168 Benchmark]: CDTParser took 0.26 ms. Allocated memory is still 1.0 GB. Free memory is still 981.8 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-28 03:03:34,847 INFO L168 Benchmark]: CACSL2BoogieTranslator took 606.28 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 81.8 MB). Free memory was 951.0 MB in the beginning and 1.1 GB in the end (delta: -105.4 MB). Peak memory consumption was 15.3 MB. Max. memory is 11.5 GB. [2019-11-28 03:03:34,848 INFO L168 Benchmark]: Boogie Procedure Inliner took 50.01 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 1.8 MB). Peak memory consumption was 1.8 MB. Max. memory is 11.5 GB. [2019-11-28 03:03:34,848 INFO L168 Benchmark]: Boogie Preprocessor took 24.79 ms. Allocated memory is still 1.1 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-28 03:03:34,849 INFO L168 Benchmark]: RCFGBuilder took 315.41 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 18.7 MB). Peak memory consumption was 18.7 MB. Max. memory is 11.5 GB. [2019-11-28 03:03:34,849 INFO L168 Benchmark]: BuchiAutomizer took 10613.14 ms. Allocated memory was 1.1 GB in the beginning and 1.3 GB in the end (delta: 177.2 MB). Free memory was 1.0 GB in the beginning and 962.7 MB in the end (delta: 73.2 MB). Peak memory consumption was 444.0 MB. Max. memory is 11.5 GB. [2019-11-28 03:03:34,850 INFO L168 Benchmark]: Witness Printer took 53.26 ms. Allocated memory is still 1.3 GB. Free memory was 962.7 MB in the beginning and 953.9 MB in the end (delta: 8.8 MB). Peak memory consumption was 8.8 MB. Max. memory is 11.5 GB. [2019-11-28 03:03:34,853 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.26 ms. Allocated memory is still 1.0 GB. Free memory is still 981.8 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 606.28 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 81.8 MB). Free memory was 951.0 MB in the beginning and 1.1 GB in the end (delta: -105.4 MB). Peak memory consumption was 15.3 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 50.01 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 1.8 MB). Peak memory consumption was 1.8 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 24.79 ms. Allocated memory is still 1.1 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 315.41 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 18.7 MB). Peak memory consumption was 18.7 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 10613.14 ms. Allocated memory was 1.1 GB in the beginning and 1.3 GB in the end (delta: 177.2 MB). Free memory was 1.0 GB in the beginning and 962.7 MB in the end (delta: 73.2 MB). Peak memory consumption was 444.0 MB. Max. memory is 11.5 GB. * Witness Printer took 53.26 ms. Allocated memory is still 1.3 GB. Free memory was 962.7 MB in the beginning and 953.9 MB in the end (delta: 8.8 MB). Peak memory consumption was 8.8 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation unknown boogie variable #length * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 7 terminating modules (4 trivial, 3 deterministic, 0 nondeterministic) and one nonterminating remainder module.One deterministic module has affine ranking function -4 * i + unknown-#length-unknown[__builtin_alloca(length*sizeof(int))] and consists of 6 locations. One deterministic module has affine ranking function -1 * j + length and consists of 3 locations. One deterministic module has affine ranking function -1 * arr + -4 * j + 10 and consists of 9 locations. 4 modules have a trivial ranking function, the largest among these consists of 16 locations. The remainder module has 38 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 10.5s and 8 iterations. TraceHistogramMax:3. Analysis of lassos took 9.0s. Construction of modules took 0.3s. Büchi inclusion checks took 0.9s. Highest rank in rank-based complementation 3. Minimization of det autom 2. Minimization of nondet autom 5. Automata minimization 0.0s AutomataMinimizationTime, 7 MinimizatonAttempts, 16 StatesRemovedByMinimization, 5 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had 38 states and ocurred in iteration 7. Nontrivial modules had stage [3, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 66 SDtfs, 164 SDslu, 95 SDs, 0 SdLazy, 298 SolverSat, 56 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.3s Time LassoAnalysisResults: nont1 unkn0 SFLI0 SFLT0 conc1 concLT0 SILN0 SILU3 SILI0 SILT0 lasso3 LassoPreprocessingBenchmarks: Lassos: inital167 mio100 ax100 hnf99 lsp80 ukn92 mio100 lsp51 div161 bol100 ite100 ukn100 eq156 hnf65 smp92 dnf109 smp98 tf100 neg99 sie103 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 25ms VariablesStem: 1 VariablesLoop: 0 DisjunctsStem: 1 DisjunctsLoop: 1 SupportingInvariants: 2 MotzkinApplications: 6 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 0 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 0 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.0s - TerminationAnalysisResult: Nontermination possible Buchi Automizer proved that your program is nonterminating for some inputs - FixpointNonTerminationResult [Line: 377]: Nontermination argument in form of an infinite program execution. Nontermination argument in form of an infinite execution State at position 0 is {NULL=1} State at position 1 is {NULL=0, \result=0, NULL=1, arr=2, arr=0, i=3, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@29e378b7=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@39bb11dd=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@139c946a=0, length=3, org.eclipse.cdt.internal.core.dom.parser.c.CASTArraySubscriptExpression@6ba013db=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@139c946a=2, j=0, NULL=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTUnaryExpression@63af3675=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTArraySubscriptExpression@50ba193b=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTUnaryExpression@386ea648=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTUnaryExpression@58b5e0e9=0} - StatisticsResult: NonterminationArgumentStatistics Fixpoint - NonterminatingLassoResult [Line: 377]: Nonterminating execution Found a nonterminating execution for the following lasso shaped sequence of statements. Stem: [L365] int i, j; [L366] int length = __VERIFIER_nondet_int(); [L367] COND FALSE !(length < 1) [L368] int *arr = __builtin_alloca(length*sizeof(int)); [L369] COND FALSE !(!arr) [L370] i=0 [L370] COND TRUE i