./Ultimate.py --spec ../../sv-benchmarks/c/properties/termination.prp --file ../../sv-benchmarks/c/list-ext-properties/simple-ext.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version 678e0110 Calling Ultimate with: /usr/lib/jvm/java-8-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/run_dir_97d6820e-6904-4d0e-b2b3-53797c725ca1/bin/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/run_dir_97d6820e-6904-4d0e-b2b3-53797c725ca1/bin/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_97d6820e-6904-4d0e-b2b3-53797c725ca1/bin/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_97d6820e-6904-4d0e-b2b3-53797c725ca1/bin/uautomizer/config/AutomizerTermination.xml -i ../../sv-benchmarks/c/list-ext-properties/simple-ext.i -s /tmp/vcloud-vcloud-master/worker/run_dir_97d6820e-6904-4d0e-b2b3-53797c725ca1/bin/uautomizer/config/svcomp-Termination-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_97d6820e-6904-4d0e-b2b3-53797c725ca1/bin/uautomizer --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 32bit --witnessprinter.graph.data.programhash e1c4f57eca82444dbac59d6fae1e4e6e28bb6c95 ............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.24-678e011 [2019-11-20 08:11:22,858 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-20 08:11:22,860 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-20 08:11:22,874 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-20 08:11:22,875 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-20 08:11:22,876 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-20 08:11:22,879 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-20 08:11:22,890 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-20 08:11:22,893 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-20 08:11:22,897 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-20 08:11:22,898 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-20 08:11:22,899 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-20 08:11:22,899 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-20 08:11:22,900 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-20 08:11:22,901 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-20 08:11:22,902 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-20 08:11:22,903 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-20 08:11:22,904 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-20 08:11:22,905 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-20 08:11:22,911 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-20 08:11:22,916 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-20 08:11:22,920 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-20 08:11:22,923 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-20 08:11:22,924 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-20 08:11:22,929 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-20 08:11:22,929 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-20 08:11:22,929 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-20 08:11:22,930 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-20 08:11:22,931 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-20 08:11:22,931 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-20 08:11:22,932 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-20 08:11:22,932 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-20 08:11:22,933 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-20 08:11:22,933 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-20 08:11:22,934 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-20 08:11:22,934 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-20 08:11:22,935 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-20 08:11:22,935 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-20 08:11:22,935 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-20 08:11:22,936 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-20 08:11:22,937 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-20 08:11:22,937 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_97d6820e-6904-4d0e-b2b3-53797c725ca1/bin/uautomizer/config/svcomp-Termination-32bit-Automizer_Default.epf [2019-11-20 08:11:22,952 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-20 08:11:22,953 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-20 08:11:22,954 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-20 08:11:22,954 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-20 08:11:22,954 INFO L138 SettingsManager]: * Use SBE=true [2019-11-20 08:11:22,955 INFO L136 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2019-11-20 08:11:22,955 INFO L138 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2019-11-20 08:11:22,955 INFO L138 SettingsManager]: * Use old map elimination=false [2019-11-20 08:11:22,955 INFO L138 SettingsManager]: * Use external solver (rank synthesis)=false [2019-11-20 08:11:22,956 INFO L138 SettingsManager]: * Use only trivial implications for array writes=true [2019-11-20 08:11:22,956 INFO L138 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2019-11-20 08:11:22,956 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-20 08:11:22,956 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-20 08:11:22,957 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2019-11-20 08:11:22,957 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-20 08:11:22,957 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-20 08:11:22,957 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-20 08:11:22,957 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2019-11-20 08:11:22,958 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2019-11-20 08:11:22,958 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2019-11-20 08:11:22,958 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-20 08:11:22,958 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-20 08:11:22,959 INFO L138 SettingsManager]: * Assume nondeterminstic values are in range=false [2019-11-20 08:11:22,959 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-20 08:11:22,959 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2019-11-20 08:11:22,960 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-20 08:11:22,960 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-20 08:11:22,960 INFO L138 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2019-11-20 08:11:22,960 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-20 08:11:22,961 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-11-20 08:11:22,961 INFO L138 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2019-11-20 08:11:22,962 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2019-11-20 08:11:22,962 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 -> /tmp/vcloud-vcloud-master/worker/run_dir_97d6820e-6904-4d0e-b2b3-53797c725ca1/bin/uautomizer 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 -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> e1c4f57eca82444dbac59d6fae1e4e6e28bb6c95 [2019-11-20 08:11:23,092 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-20 08:11:23,102 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-20 08:11:23,105 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-20 08:11:23,107 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-20 08:11:23,107 INFO L275 PluginConnector]: CDTParser initialized [2019-11-20 08:11:23,108 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_97d6820e-6904-4d0e-b2b3-53797c725ca1/bin/uautomizer/../../sv-benchmarks/c/list-ext-properties/simple-ext.i [2019-11-20 08:11:23,154 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_97d6820e-6904-4d0e-b2b3-53797c725ca1/bin/uautomizer/data/9e4e8e201/f72e578987734a88a4342ef2b62f5d88/FLAG954bf4876 [2019-11-20 08:11:23,541 INFO L306 CDTParser]: Found 1 translation units. [2019-11-20 08:11:23,542 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_97d6820e-6904-4d0e-b2b3-53797c725ca1/sv-benchmarks/c/list-ext-properties/simple-ext.i [2019-11-20 08:11:23,556 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_97d6820e-6904-4d0e-b2b3-53797c725ca1/bin/uautomizer/data/9e4e8e201/f72e578987734a88a4342ef2b62f5d88/FLAG954bf4876 [2019-11-20 08:11:23,866 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_97d6820e-6904-4d0e-b2b3-53797c725ca1/bin/uautomizer/data/9e4e8e201/f72e578987734a88a4342ef2b62f5d88 [2019-11-20 08:11:23,868 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-20 08:11:23,869 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-11-20 08:11:23,869 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-20 08:11:23,869 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-20 08:11:23,872 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-20 08:11:23,873 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.11 08:11:23" (1/1) ... [2019-11-20 08:11:23,875 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6a834f61 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 08:11:23, skipping insertion in model container [2019-11-20 08:11:23,876 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.11 08:11:23" (1/1) ... [2019-11-20 08:11:23,882 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-11-20 08:11:23,931 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-11-20 08:11:24,372 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-20 08:11:24,384 INFO L188 MainTranslator]: Completed pre-run [2019-11-20 08:11:24,431 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-20 08:11:24,487 INFO L192 MainTranslator]: Completed translation [2019-11-20 08:11:24,488 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 08:11:24 WrapperNode [2019-11-20 08:11:24,488 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-20 08:11:24,488 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-11-20 08:11:24,488 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-11-20 08:11:24,489 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-11-20 08:11:24,497 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 08:11:24" (1/1) ... [2019-11-20 08:11:24,510 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 08:11:24" (1/1) ... [2019-11-20 08:11:24,536 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-11-20 08:11:24,537 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-20 08:11:24,537 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-20 08:11:24,537 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-20 08:11:24,545 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 08:11:24" (1/1) ... [2019-11-20 08:11:24,545 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 08:11:24" (1/1) ... [2019-11-20 08:11:24,554 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 08:11:24" (1/1) ... [2019-11-20 08:11:24,555 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 08:11:24" (1/1) ... [2019-11-20 08:11:24,569 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 08:11:24" (1/1) ... [2019-11-20 08:11:24,573 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 08:11:24" (1/1) ... [2019-11-20 08:11:24,575 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 08:11:24" (1/1) ... [2019-11-20 08:11:24,577 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-20 08:11:24,578 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-20 08:11:24,578 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-20 08:11:24,578 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-20 08:11:24,579 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 08:11:24" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_97d6820e-6904-4d0e-b2b3-53797c725ca1/bin/uautomizer/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-20 08:11:24,650 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-11-20 08:11:24,650 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-11-20 08:11:24,650 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2019-11-20 08:11:24,651 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2019-11-20 08:11:24,651 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2019-11-20 08:11:24,651 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-11-20 08:11:24,651 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-20 08:11:24,651 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-20 08:11:24,937 INFO L280 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-20 08:11:24,937 INFO L285 CfgBuilder]: Removed 11 assume(true) statements. [2019-11-20 08:11:24,939 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 08:11:24 BoogieIcfgContainer [2019-11-20 08:11:24,939 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-20 08:11:24,939 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2019-11-20 08:11:24,940 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2019-11-20 08:11:24,943 INFO L275 PluginConnector]: BuchiAutomizer initialized [2019-11-20 08:11:24,943 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-11-20 08:11:24,944 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 20.11 08:11:23" (1/3) ... [2019-11-20 08:11:24,944 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@3728fe and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 20.11 08:11:24, skipping insertion in model container [2019-11-20 08:11:24,945 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-11-20 08:11:24,945 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 08:11:24" (2/3) ... [2019-11-20 08:11:24,945 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@3728fe and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 20.11 08:11:24, skipping insertion in model container [2019-11-20 08:11:24,945 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-11-20 08:11:24,945 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 08:11:24" (3/3) ... [2019-11-20 08:11:24,947 INFO L371 chiAutomizerObserver]: Analyzing ICFG simple-ext.i [2019-11-20 08:11:24,997 INFO L356 BuchiCegarLoop]: Interprodecural is true [2019-11-20 08:11:24,997 INFO L357 BuchiCegarLoop]: Hoare is false [2019-11-20 08:11:24,997 INFO L358 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2019-11-20 08:11:24,997 INFO L359 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-20 08:11:24,997 INFO L360 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-20 08:11:24,997 INFO L361 BuchiCegarLoop]: Difference is false [2019-11-20 08:11:24,998 INFO L362 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-20 08:11:24,998 INFO L365 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2019-11-20 08:11:25,011 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 20 states. [2019-11-20 08:11:25,036 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 10 [2019-11-20 08:11:25,037 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-20 08:11:25,037 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-20 08:11:25,043 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1] [2019-11-20 08:11:25,043 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1] [2019-11-20 08:11:25,043 INFO L424 BuchiCegarLoop]: ======== Iteration 1============ [2019-11-20 08:11:25,044 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 20 states. [2019-11-20 08:11:25,046 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 10 [2019-11-20 08:11:25,047 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-20 08:11:25,047 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-20 08:11:25,047 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1] [2019-11-20 08:11:25,047 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1] [2019-11-20 08:11:25,055 INFO L794 eck$LassoCheckResult]: Stem: 15#ULTIMATE.startENTRYtrue #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 13#L-1true havoc main_#res;havoc main_#t~malloc2.base, main_#t~malloc2.offset, main_#t~malloc4.base, main_#t~malloc4.offset, main_#t~mem5.base, main_#t~mem5.offset, main_#t~post6, main_#t~nondet3, main_#t~mem7, main_#t~mem8.base, main_#t~mem8.offset, main_#t~post9, main_#t~mem10.base, main_#t~mem10.offset, main_~tmp~0.base, main_~tmp~0.offset, main_~a~0.base, main_~a~0.offset, main_~t~0.base, main_~t~0.offset, main_~p~0.base, main_~p~0.offset, main_~i~0;call main_#t~malloc2.base, main_#t~malloc2.offset := #Ultimate.allocOnHeap(8);main_~a~0.base, main_~a~0.offset := main_#t~malloc2.base, main_#t~malloc2.offset; 11#L522true assume main_~a~0.base == 0 && main_~a~0.offset == 0;myexit_#in~s := 1;havoc myexit_~s;myexit_~s := myexit_#in~s; 5#L514true [2019-11-20 08:11:25,055 INFO L796 eck$LassoCheckResult]: Loop: 5#L514true assume true; 5#L514true [2019-11-20 08:11:25,060 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 08:11:25,060 INFO L82 PathProgramCache]: Analyzing trace with hash 29858, now seen corresponding path program 1 times [2019-11-20 08:11:25,068 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 08:11:25,069 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [802985910] [2019-11-20 08:11:25,069 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 08:11:25,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 08:11:25,244 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-20 08:11:25,245 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [802985910] [2019-11-20 08:11:25,246 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 08:11:25,246 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-20 08:11:25,247 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1933802028] [2019-11-20 08:11:25,251 INFO L799 eck$LassoCheckResult]: stem already infeasible [2019-11-20 08:11:25,252 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 08:11:25,252 INFO L82 PathProgramCache]: Analyzing trace with hash 101, now seen corresponding path program 1 times [2019-11-20 08:11:25,252 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 08:11:25,255 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1540440532] [2019-11-20 08:11:25,255 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 08:11:25,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-20 08:11:25,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-20 08:11:25,288 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-20 08:11:25,298 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 08:11:25,312 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-20 08:11:25,313 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-20 08:11:25,314 INFO L87 Difference]: Start difference. First operand 20 states. Second operand 3 states. [2019-11-20 08:11:25,348 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 08:11:25,348 INFO L93 Difference]: Finished difference Result 19 states and 22 transitions. [2019-11-20 08:11:25,348 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-20 08:11:25,350 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 19 states and 22 transitions. [2019-11-20 08:11:25,352 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 8 [2019-11-20 08:11:25,355 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 19 states to 14 states and 17 transitions. [2019-11-20 08:11:25,356 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 14 [2019-11-20 08:11:25,356 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 14 [2019-11-20 08:11:25,357 INFO L73 IsDeterministic]: Start isDeterministic. Operand 14 states and 17 transitions. [2019-11-20 08:11:25,357 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-11-20 08:11:25,357 INFO L688 BuchiCegarLoop]: Abstraction has 14 states and 17 transitions. [2019-11-20 08:11:25,373 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14 states and 17 transitions. [2019-11-20 08:11:25,380 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14 to 14. [2019-11-20 08:11:25,381 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2019-11-20 08:11:25,381 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 17 transitions. [2019-11-20 08:11:25,382 INFO L711 BuchiCegarLoop]: Abstraction has 14 states and 17 transitions. [2019-11-20 08:11:25,383 INFO L591 BuchiCegarLoop]: Abstraction has 14 states and 17 transitions. [2019-11-20 08:11:25,383 INFO L424 BuchiCegarLoop]: ======== Iteration 2============ [2019-11-20 08:11:25,383 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 14 states and 17 transitions. [2019-11-20 08:11:25,384 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 8 [2019-11-20 08:11:25,384 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-20 08:11:25,384 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-20 08:11:25,384 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2019-11-20 08:11:25,384 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2019-11-20 08:11:25,385 INFO L794 eck$LassoCheckResult]: Stem: 60#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 59#L-1 havoc main_#res;havoc main_#t~malloc2.base, main_#t~malloc2.offset, main_#t~malloc4.base, main_#t~malloc4.offset, main_#t~mem5.base, main_#t~mem5.offset, main_#t~post6, main_#t~nondet3, main_#t~mem7, main_#t~mem8.base, main_#t~mem8.offset, main_#t~post9, main_#t~mem10.base, main_#t~mem10.offset, main_~tmp~0.base, main_~tmp~0.offset, main_~a~0.base, main_~a~0.offset, main_~t~0.base, main_~t~0.offset, main_~p~0.base, main_~p~0.offset, main_~i~0;call main_#t~malloc2.base, main_#t~malloc2.offset := #Ultimate.allocOnHeap(8);main_~a~0.base, main_~a~0.offset := main_#t~malloc2.base, main_#t~malloc2.offset; 57#L522 assume !(main_~a~0.base == 0 && main_~a~0.offset == 0); 58#L522-1 havoc main_~t~0.base, main_~t~0.offset;main_~p~0.base, main_~p~0.offset := main_~a~0.base, main_~a~0.offset;main_~i~0 := 0; 53#L526-2 [2019-11-20 08:11:25,385 INFO L796 eck$LassoCheckResult]: Loop: 53#L526-2 assume !!(main_~i~0 < 30 && 0 != main_#t~nondet3);havoc main_#t~nondet3;call write~int(main_~i~0, main_~p~0.base, main_~p~0.offset, 4);call main_#t~malloc4.base, main_#t~malloc4.offset := #Ultimate.allocOnHeap(8);main_~t~0.base, main_~t~0.offset := main_#t~malloc4.base, main_#t~malloc4.offset; 55#L529 assume !(main_~t~0.base == 0 && main_~t~0.offset == 0); 61#L529-1 call write~$Pointer$(main_~t~0.base, main_~t~0.offset, main_~p~0.base, 4 + main_~p~0.offset, 4);call main_#t~mem5.base, main_#t~mem5.offset := read~$Pointer$(main_~p~0.base, 4 + main_~p~0.offset, 4);main_~p~0.base, main_~p~0.offset := main_#t~mem5.base, main_#t~mem5.offset;havoc main_#t~mem5.base, main_#t~mem5.offset;main_#t~post6 := main_~i~0;main_~i~0 := 1 + main_#t~post6;havoc main_#t~post6; 53#L526-2 [2019-11-20 08:11:25,385 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 08:11:25,386 INFO L82 PathProgramCache]: Analyzing trace with hash 925701, now seen corresponding path program 1 times [2019-11-20 08:11:25,386 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 08:11:25,386 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [448925225] [2019-11-20 08:11:25,386 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 08:11:25,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-20 08:11:25,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-20 08:11:25,410 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-20 08:11:25,411 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 08:11:25,411 INFO L82 PathProgramCache]: Analyzing trace with hash 48852, now seen corresponding path program 1 times [2019-11-20 08:11:25,411 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 08:11:25,411 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [467352889] [2019-11-20 08:11:25,412 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 08:11:25,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-20 08:11:25,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-20 08:11:25,474 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-20 08:11:25,474 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 08:11:25,474 INFO L82 PathProgramCache]: Analyzing trace with hash 1807773776, now seen corresponding path program 1 times [2019-11-20 08:11:25,475 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 08:11:25,475 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [395866418] [2019-11-20 08:11:25,475 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 08:11:25,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-20 08:11:25,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-20 08:11:25,543 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-20 08:11:25,872 WARN L191 SmtUtils]: Spent 326.00 ms on a formula simplification. DAG size of input: 99 DAG size of output: 89 [2019-11-20 08:11:25,917 INFO L496 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-20 08:11:26,037 WARN L191 SmtUtils]: Spent 120.00 ms on a formula simplification that was a NOOP. DAG size: 81 [2019-11-20 08:11:26,038 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 08:11:26,045 INFO L496 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-20 08:11:26,134 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 08:11:26,136 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-11-20 08:11:26,137 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:157, output treesize:133 [2019-11-20 08:11:26,334 WARN L191 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 44 DAG size of output: 39 [2019-11-20 08:11:26,386 INFO L210 LassoAnalysis]: Preferences: [2019-11-20 08:11:26,387 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2019-11-20 08:11:26,387 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-11-20 08:11:26,387 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2019-11-20 08:11:26,394 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2019-11-20 08:11:26,394 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-20 08:11:26,395 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2019-11-20 08:11:26,395 INFO L132 ssoRankerPreferences]: Path of dumped script: [2019-11-20 08:11:26,395 INFO L133 ssoRankerPreferences]: Filename of dumped script: simple-ext.i_Iteration2_Lasso [2019-11-20 08:11:26,395 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2019-11-20 08:11:26,395 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-11-20 08:11:26,426 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-20 08:11:26,434 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-20 08:11:26,437 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-20 08:11:26,440 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-20 08:11:26,444 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-20 08:11:26,448 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-20 08:11:26,457 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-20 08:11:26,461 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-20 08:11:26,464 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-20 08:11:26,467 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-20 08:11:26,713 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-20 08:11:26,718 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-20 08:11:26,721 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-20 08:11:26,730 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-20 08:11:26,736 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-20 08:11:26,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-20 08:11:26,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-20 08:11:26,750 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-20 08:11:26,754 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-20 08:11:27,274 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-11-20 08:11:27,279 INFO L489 LassoAnalysis]: Using template 'affine'. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_97d6820e-6904-4d0e-b2b3-53797c725ca1/bin/uautomizer/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-20 08:11:27,294 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-20 08:11:27,297 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-20 08:11:27,297 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-20 08:11:27,298 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-20 08:11:27,298 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-20 08:11:27,298 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-20 08:11:27,302 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-20 08:11:27,302 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-20 08:11:27,321 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_97d6820e-6904-4d0e-b2b3-53797c725ca1/bin/uautomizer/z3 Starting monitored process 3 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-20 08:11:27,337 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-20 08:11:27,339 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-20 08:11:27,339 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-20 08:11:27,339 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-20 08:11:27,340 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-20 08:11:27,340 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-20 08:11:27,341 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-20 08:11:27,342 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. Waiting until toolchain timeout for monitored process 3 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-20 08:11:27,343 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_97d6820e-6904-4d0e-b2b3-53797c725ca1/bin/uautomizer/z3 Starting monitored process 4 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-20 08:11:27,358 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-20 08:11:27,359 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-20 08:11:27,359 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-20 08:11:27,360 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-20 08:11:27,360 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-20 08:11:27,365 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-20 08:11:27,367 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. Waiting until toolchain timeout for monitored process 4 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-20 08:11:27,372 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_97d6820e-6904-4d0e-b2b3-53797c725ca1/bin/uautomizer/z3 Starting monitored process 5 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-20 08:11:27,393 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-20 08:11:27,396 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-20 08:11:27,396 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-20 08:11:27,396 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-20 08:11:27,397 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-20 08:11:27,397 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-20 08:11:27,398 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-20 08:11:27,398 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. Waiting until toolchain timeout for monitored process 5 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-20 08:11:27,400 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_97d6820e-6904-4d0e-b2b3-53797c725ca1/bin/uautomizer/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-20 08:11:27,415 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-20 08:11:27,419 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-20 08:11:27,419 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-20 08:11:27,419 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-20 08:11:27,419 INFO L204 nArgumentSynthesizer]: 2 loop disjuncts [2019-11-20 08:11:27,420 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-20 08:11:27,423 INFO L401 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2019-11-20 08:11:27,423 INFO L402 nArgumentSynthesizer]: A total of 0 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-20 08:11:27,426 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_97d6820e-6904-4d0e-b2b3-53797c725ca1/bin/uautomizer/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-20 08:11:27,441 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-20 08:11:27,443 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-20 08:11:27,443 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-20 08:11:27,444 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-20 08:11:27,444 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-20 08:11:27,446 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-20 08:11:27,446 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-20 08:11:27,450 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_97d6820e-6904-4d0e-b2b3-53797c725ca1/bin/uautomizer/z3 Starting monitored process 8 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-20 08:11:27,465 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-20 08:11:27,467 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-20 08:11:27,467 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-20 08:11:27,467 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-20 08:11:27,467 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. Waiting until toolchain timeout for monitored process 8 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-20 08:11:27,470 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-20 08:11:27,470 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-20 08:11:27,474 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_97d6820e-6904-4d0e-b2b3-53797c725ca1/bin/uautomizer/z3 Starting monitored process 9 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-20 08:11:27,494 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-20 08:11:27,496 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-20 08:11:27,496 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-20 08:11:27,497 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-20 08:11:27,497 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-20 08:11:27,497 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-20 08:11:27,499 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-20 08:11:27,499 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. Waiting until toolchain timeout for monitored process 9 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-20 08:11:27,501 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_97d6820e-6904-4d0e-b2b3-53797c725ca1/bin/uautomizer/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-20 08:11:27,508 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-20 08:11:27,510 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-20 08:11:27,510 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-20 08:11:27,511 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-20 08:11:27,511 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-20 08:11:27,511 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-20 08:11:27,512 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-20 08:11:27,512 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-20 08:11:27,514 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_97d6820e-6904-4d0e-b2b3-53797c725ca1/bin/uautomizer/z3 Starting monitored process 11 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 11 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-20 08:11:27,533 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-20 08:11:27,535 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-20 08:11:27,535 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-20 08:11:27,535 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-20 08:11:27,535 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-20 08:11:27,540 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-20 08:11:27,540 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-20 08:11:27,546 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_97d6820e-6904-4d0e-b2b3-53797c725ca1/bin/uautomizer/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-20 08:11:27,557 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-20 08:11:27,559 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-20 08:11:27,559 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-20 08:11:27,559 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-20 08:11:27,560 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-20 08:11:27,560 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-20 08:11:27,561 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-20 08:11:27,561 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-20 08:11:27,563 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_97d6820e-6904-4d0e-b2b3-53797c725ca1/bin/uautomizer/z3 Starting monitored process 13 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 13 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-20 08:11:27,578 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-20 08:11:27,580 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-20 08:11:27,580 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-20 08:11:27,580 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-20 08:11:27,580 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-20 08:11:27,588 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-20 08:11:27,589 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-20 08:11:27,595 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-11-20 08:11:27,636 INFO L443 ModelExtractionUtils]: Simplification made 5 calls to the SMT solver. [2019-11-20 08:11:27,636 INFO L444 ModelExtractionUtils]: 2 out of 7 variables were initially zero. Simplification set additionally 2 variables to zero. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_97d6820e-6904-4d0e-b2b3-53797c725ca1/bin/uautomizer/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-20 08:11:27,661 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... Waiting until toolchain timeout for monitored process 14 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-20 08:11:27,679 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2019-11-20 08:11:27,679 INFO L510 LassoAnalysis]: Proved termination. [2019-11-20 08:11:27,680 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~i~0) = -2*ULTIMATE.start_main_~i~0 + 59 Supporting invariants [] [2019-11-20 08:11:27,693 INFO L297 tatePredicateManager]: 2 out of 2 supporting invariants were superfluous and have been removed [2019-11-20 08:11:27,757 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 08:11:27,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 08:11:27,775 INFO L255 TraceCheckSpWp]: Trace formula consists of 27 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-20 08:11:27,777 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 08:11:27,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 08:11:27,797 INFO L255 TraceCheckSpWp]: Trace formula consists of 37 conjuncts, 4 conjunts are in the unsatisfiable core [2019-11-20 08:11:27,797 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 08:11:27,816 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-20 08:11:27,819 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-20 08:11:27,820 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 14 states and 17 transitions. cyclomatic complexity: 7 Second operand 3 states. [2019-11-20 08:11:27,869 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 14 states and 17 transitions. cyclomatic complexity: 7. Second operand 3 states. Result 19 states and 26 transitions. Complement of second has 7 states. [2019-11-20 08:11:27,871 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2019-11-20 08:11:27,872 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2019-11-20 08:11:27,872 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 10 transitions. [2019-11-20 08:11:27,874 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 10 transitions. Stem has 4 letters. Loop has 3 letters. [2019-11-20 08:11:27,875 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-20 08:11:27,875 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 10 transitions. Stem has 7 letters. Loop has 3 letters. [2019-11-20 08:11:27,875 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-20 08:11:27,875 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 10 transitions. Stem has 4 letters. Loop has 6 letters. [2019-11-20 08:11:27,876 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-20 08:11:27,876 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 19 states and 26 transitions. [2019-11-20 08:11:27,878 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 5 [2019-11-20 08:11:27,879 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 19 states to 16 states and 21 transitions. [2019-11-20 08:11:27,879 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 11 [2019-11-20 08:11:27,879 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 13 [2019-11-20 08:11:27,879 INFO L73 IsDeterministic]: Start isDeterministic. Operand 16 states and 21 transitions. [2019-11-20 08:11:27,879 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-11-20 08:11:27,879 INFO L688 BuchiCegarLoop]: Abstraction has 16 states and 21 transitions. [2019-11-20 08:11:27,879 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16 states and 21 transitions. [2019-11-20 08:11:27,880 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16 to 16. [2019-11-20 08:11:27,881 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2019-11-20 08:11:27,881 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 21 transitions. [2019-11-20 08:11:27,881 INFO L711 BuchiCegarLoop]: Abstraction has 16 states and 21 transitions. [2019-11-20 08:11:27,881 INFO L591 BuchiCegarLoop]: Abstraction has 16 states and 21 transitions. [2019-11-20 08:11:27,881 INFO L424 BuchiCegarLoop]: ======== Iteration 3============ [2019-11-20 08:11:27,882 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 16 states and 21 transitions. [2019-11-20 08:11:27,882 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 5 [2019-11-20 08:11:27,882 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-20 08:11:27,882 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-20 08:11:27,883 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1] [2019-11-20 08:11:27,883 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2019-11-20 08:11:27,884 INFO L794 eck$LassoCheckResult]: Stem: 148#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 147#L-1 havoc main_#res;havoc main_#t~malloc2.base, main_#t~malloc2.offset, main_#t~malloc4.base, main_#t~malloc4.offset, main_#t~mem5.base, main_#t~mem5.offset, main_#t~post6, main_#t~nondet3, main_#t~mem7, main_#t~mem8.base, main_#t~mem8.offset, main_#t~post9, main_#t~mem10.base, main_#t~mem10.offset, main_~tmp~0.base, main_~tmp~0.offset, main_~a~0.base, main_~a~0.offset, main_~t~0.base, main_~t~0.offset, main_~p~0.base, main_~p~0.offset, main_~i~0;call main_#t~malloc2.base, main_#t~malloc2.offset := #Ultimate.allocOnHeap(8);main_~a~0.base, main_~a~0.offset := main_#t~malloc2.base, main_#t~malloc2.offset; 145#L522 assume !(main_~a~0.base == 0 && main_~a~0.offset == 0); 146#L522-1 havoc main_~t~0.base, main_~t~0.offset;main_~p~0.base, main_~p~0.offset := main_~a~0.base, main_~a~0.offset;main_~i~0 := 0; 139#L526-2 assume !(main_~i~0 < 30 && 0 != main_#t~nondet3);havoc main_#t~nondet3; 140#L526-3 call write~int(main_~i~0, main_~p~0.base, main_~p~0.offset, 4);call write~$Pointer$(0, 0, main_~p~0.base, 4 + main_~p~0.offset, 4);main_~p~0.base, main_~p~0.offset := main_~a~0.base, main_~a~0.offset;main_~i~0 := 0; 135#L538-2 [2019-11-20 08:11:27,885 INFO L796 eck$LassoCheckResult]: Loop: 135#L538-2 assume !!(main_~p~0.base != 0 || main_~p~0.offset != 0);call main_#t~mem7 := read~int(main_~p~0.base, main_~p~0.offset, 4); 137#L539 assume !(1 != main_#t~mem7);havoc main_#t~mem7; 134#L539-2 call main_#t~mem8.base, main_#t~mem8.offset := read~$Pointer$(main_~p~0.base, 4 + main_~p~0.offset, 4);main_~p~0.base, main_~p~0.offset := main_#t~mem8.base, main_#t~mem8.offset;havoc main_#t~mem8.base, main_#t~mem8.offset;main_#t~post9 := main_~i~0;main_~i~0 := 1 + main_#t~post9;havoc main_#t~post9; 135#L538-2 [2019-11-20 08:11:27,885 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 08:11:27,885 INFO L82 PathProgramCache]: Analyzing trace with hash 889599219, now seen corresponding path program 1 times [2019-11-20 08:11:27,885 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 08:11:27,885 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1270229469] [2019-11-20 08:11:27,885 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 08:11:27,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-20 08:11:27,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-20 08:11:27,915 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-20 08:11:27,915 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 08:11:27,915 INFO L82 PathProgramCache]: Analyzing trace with hash 69737, now seen corresponding path program 1 times [2019-11-20 08:11:27,916 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 08:11:27,916 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [426554243] [2019-11-20 08:11:27,916 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 08:11:27,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-20 08:11:27,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-20 08:11:27,926 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-20 08:11:27,926 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 08:11:27,927 INFO L82 PathProgramCache]: Analyzing trace with hash 2102156855, now seen corresponding path program 1 times [2019-11-20 08:11:27,927 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 08:11:27,927 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1695367735] [2019-11-20 08:11:27,927 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 08:11:27,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 08:11:27,987 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-20 08:11:27,987 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1695367735] [2019-11-20 08:11:27,987 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 08:11:27,987 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-20 08:11:27,988 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [617312100] [2019-11-20 08:11:28,110 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 08:11:28,111 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-20 08:11:28,111 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-20 08:11:28,111 INFO L87 Difference]: Start difference. First operand 16 states and 21 transitions. cyclomatic complexity: 9 Second operand 5 states. [2019-11-20 08:11:28,241 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 08:11:28,241 INFO L93 Difference]: Finished difference Result 30 states and 36 transitions. [2019-11-20 08:11:28,242 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-20 08:11:28,242 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 30 states and 36 transitions. [2019-11-20 08:11:28,244 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 6 [2019-11-20 08:11:28,246 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 30 states to 29 states and 35 transitions. [2019-11-20 08:11:28,247 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 24 [2019-11-20 08:11:28,247 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 24 [2019-11-20 08:11:28,247 INFO L73 IsDeterministic]: Start isDeterministic. Operand 29 states and 35 transitions. [2019-11-20 08:11:28,247 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-11-20 08:11:28,247 INFO L688 BuchiCegarLoop]: Abstraction has 29 states and 35 transitions. [2019-11-20 08:11:28,248 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states and 35 transitions. [2019-11-20 08:11:28,250 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 18. [2019-11-20 08:11:28,250 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2019-11-20 08:11:28,251 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 23 transitions. [2019-11-20 08:11:28,251 INFO L711 BuchiCegarLoop]: Abstraction has 18 states and 23 transitions. [2019-11-20 08:11:28,251 INFO L591 BuchiCegarLoop]: Abstraction has 18 states and 23 transitions. [2019-11-20 08:11:28,251 INFO L424 BuchiCegarLoop]: ======== Iteration 4============ [2019-11-20 08:11:28,251 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 18 states and 23 transitions. [2019-11-20 08:11:28,252 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 5 [2019-11-20 08:11:28,253 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-20 08:11:28,253 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-20 08:11:28,254 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1] [2019-11-20 08:11:28,254 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1] [2019-11-20 08:11:28,254 INFO L794 eck$LassoCheckResult]: Stem: 209#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 208#L-1 havoc main_#res;havoc main_#t~malloc2.base, main_#t~malloc2.offset, main_#t~malloc4.base, main_#t~malloc4.offset, main_#t~mem5.base, main_#t~mem5.offset, main_#t~post6, main_#t~nondet3, main_#t~mem7, main_#t~mem8.base, main_#t~mem8.offset, main_#t~post9, main_#t~mem10.base, main_#t~mem10.offset, main_~tmp~0.base, main_~tmp~0.offset, main_~a~0.base, main_~a~0.offset, main_~t~0.base, main_~t~0.offset, main_~p~0.base, main_~p~0.offset, main_~i~0;call main_#t~malloc2.base, main_#t~malloc2.offset := #Ultimate.allocOnHeap(8);main_~a~0.base, main_~a~0.offset := main_#t~malloc2.base, main_#t~malloc2.offset; 206#L522 assume !(main_~a~0.base == 0 && main_~a~0.offset == 0); 207#L522-1 havoc main_~t~0.base, main_~t~0.offset;main_~p~0.base, main_~p~0.offset := main_~a~0.base, main_~a~0.offset;main_~i~0 := 0; 199#L526-2 assume !!(main_~i~0 < 30 && 0 != main_#t~nondet3);havoc main_#t~nondet3;call write~int(main_~i~0, main_~p~0.base, main_~p~0.offset, 4);call main_#t~malloc4.base, main_#t~malloc4.offset := #Ultimate.allocOnHeap(8);main_~t~0.base, main_~t~0.offset := main_#t~malloc4.base, main_#t~malloc4.offset; 202#L529 assume main_~t~0.base == 0 && main_~t~0.offset == 0;myexit_#in~s := 1;havoc myexit_~s;myexit_~s := myexit_#in~s; 205#L514-1 [2019-11-20 08:11:28,254 INFO L796 eck$LassoCheckResult]: Loop: 205#L514-1 assume true; 205#L514-1 [2019-11-20 08:11:28,255 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 08:11:28,255 INFO L82 PathProgramCache]: Analyzing trace with hash 889599272, now seen corresponding path program 1 times [2019-11-20 08:11:28,255 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 08:11:28,255 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2087220718] [2019-11-20 08:11:28,255 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 08:11:28,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 08:11:28,281 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-20 08:11:28,282 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2087220718] [2019-11-20 08:11:28,282 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 08:11:28,282 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-20 08:11:28,282 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [395975119] [2019-11-20 08:11:28,283 INFO L799 eck$LassoCheckResult]: stem already infeasible [2019-11-20 08:11:28,283 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 08:11:28,283 INFO L82 PathProgramCache]: Analyzing trace with hash 102, now seen corresponding path program 1 times [2019-11-20 08:11:28,283 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 08:11:28,283 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [470029595] [2019-11-20 08:11:28,283 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 08:11:28,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-20 08:11:28,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-20 08:11:28,287 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-20 08:11:28,289 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 08:11:28,289 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-20 08:11:28,290 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-20 08:11:28,290 INFO L87 Difference]: Start difference. First operand 18 states and 23 transitions. cyclomatic complexity: 9 Second operand 3 states. [2019-11-20 08:11:28,303 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 08:11:28,303 INFO L93 Difference]: Finished difference Result 19 states and 23 transitions. [2019-11-20 08:11:28,303 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-20 08:11:28,304 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 19 states and 23 transitions. [2019-11-20 08:11:28,305 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 5 [2019-11-20 08:11:28,305 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 19 states to 18 states and 21 transitions. [2019-11-20 08:11:28,305 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 15 [2019-11-20 08:11:28,305 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 15 [2019-11-20 08:11:28,306 INFO L73 IsDeterministic]: Start isDeterministic. Operand 18 states and 21 transitions. [2019-11-20 08:11:28,306 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-11-20 08:11:28,306 INFO L688 BuchiCegarLoop]: Abstraction has 18 states and 21 transitions. [2019-11-20 08:11:28,306 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states and 21 transitions. [2019-11-20 08:11:28,307 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 16. [2019-11-20 08:11:28,307 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2019-11-20 08:11:28,308 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 19 transitions. [2019-11-20 08:11:28,308 INFO L711 BuchiCegarLoop]: Abstraction has 16 states and 19 transitions. [2019-11-20 08:11:28,308 INFO L591 BuchiCegarLoop]: Abstraction has 16 states and 19 transitions. [2019-11-20 08:11:28,308 INFO L424 BuchiCegarLoop]: ======== Iteration 5============ [2019-11-20 08:11:28,308 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 16 states and 19 transitions. [2019-11-20 08:11:28,309 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 4 [2019-11-20 08:11:28,309 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-20 08:11:28,309 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-20 08:11:28,309 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 08:11:28,310 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1] [2019-11-20 08:11:28,310 INFO L794 eck$LassoCheckResult]: Stem: 250#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 249#L-1 havoc main_#res;havoc main_#t~malloc2.base, main_#t~malloc2.offset, main_#t~malloc4.base, main_#t~malloc4.offset, main_#t~mem5.base, main_#t~mem5.offset, main_#t~post6, main_#t~nondet3, main_#t~mem7, main_#t~mem8.base, main_#t~mem8.offset, main_#t~post9, main_#t~mem10.base, main_#t~mem10.offset, main_~tmp~0.base, main_~tmp~0.offset, main_~a~0.base, main_~a~0.offset, main_~t~0.base, main_~t~0.offset, main_~p~0.base, main_~p~0.offset, main_~i~0;call main_#t~malloc2.base, main_#t~malloc2.offset := #Ultimate.allocOnHeap(8);main_~a~0.base, main_~a~0.offset := main_#t~malloc2.base, main_#t~malloc2.offset; 247#L522 assume !(main_~a~0.base == 0 && main_~a~0.offset == 0); 248#L522-1 havoc main_~t~0.base, main_~t~0.offset;main_~p~0.base, main_~p~0.offset := main_~a~0.base, main_~a~0.offset;main_~i~0 := 0; 242#L526-2 assume !(main_~i~0 < 30 && 0 != main_#t~nondet3);havoc main_#t~nondet3; 243#L526-3 call write~int(main_~i~0, main_~p~0.base, main_~p~0.offset, 4);call write~$Pointer$(0, 0, main_~p~0.base, 4 + main_~p~0.offset, 4);main_~p~0.base, main_~p~0.offset := main_~a~0.base, main_~a~0.offset;main_~i~0 := 0; 239#L538-2 assume !(main_~p~0.base != 0 || main_~p~0.offset != 0); 240#L538-3 main_~p~0.base, main_~p~0.offset := main_~a~0.base, main_~a~0.offset; 241#L546-2 [2019-11-20 08:11:28,310 INFO L796 eck$LassoCheckResult]: Loop: 241#L546-2 assume !!(main_~p~0.base != 0 || main_~p~0.offset != 0);call main_#t~mem10.base, main_#t~mem10.offset := read~$Pointer$(main_~p~0.base, 4 + main_~p~0.offset, 4);main_~tmp~0.base, main_~tmp~0.offset := main_#t~mem10.base, main_#t~mem10.offset;havoc main_#t~mem10.base, main_#t~mem10.offset;call ULTIMATE.dealloc(main_~p~0.base, main_~p~0.offset);main_~p~0.base, main_~p~0.offset := main_~tmp~0.base, main_~tmp~0.offset; 241#L546-2 [2019-11-20 08:11:28,310 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 08:11:28,310 INFO L82 PathProgramCache]: Analyzing trace with hash 206358786, now seen corresponding path program 1 times [2019-11-20 08:11:28,310 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 08:11:28,311 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [696469666] [2019-11-20 08:11:28,311 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 08:11:28,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 08:11:28,336 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-20 08:11:28,336 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [696469666] [2019-11-20 08:11:28,336 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 08:11:28,337 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-20 08:11:28,337 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [538414746] [2019-11-20 08:11:28,337 INFO L799 eck$LassoCheckResult]: stem already infeasible [2019-11-20 08:11:28,337 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 08:11:28,337 INFO L82 PathProgramCache]: Analyzing trace with hash 93, now seen corresponding path program 1 times [2019-11-20 08:11:28,338 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 08:11:28,338 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2077649287] [2019-11-20 08:11:28,338 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 08:11:28,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-20 08:11:28,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-20 08:11:28,345 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-20 08:11:28,405 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 08:11:28,405 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-20 08:11:28,406 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-20 08:11:28,406 INFO L87 Difference]: Start difference. First operand 16 states and 19 transitions. cyclomatic complexity: 6 Second operand 4 states. [2019-11-20 08:11:28,458 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 08:11:28,458 INFO L93 Difference]: Finished difference Result 22 states and 24 transitions. [2019-11-20 08:11:28,459 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-20 08:11:28,460 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 22 states and 24 transitions. [2019-11-20 08:11:28,460 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 4 [2019-11-20 08:11:28,461 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 22 states to 20 states and 22 transitions. [2019-11-20 08:11:28,461 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 15 [2019-11-20 08:11:28,461 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 15 [2019-11-20 08:11:28,461 INFO L73 IsDeterministic]: Start isDeterministic. Operand 20 states and 22 transitions. [2019-11-20 08:11:28,462 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-11-20 08:11:28,462 INFO L688 BuchiCegarLoop]: Abstraction has 20 states and 22 transitions. [2019-11-20 08:11:28,462 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states and 22 transitions. [2019-11-20 08:11:28,463 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 15. [2019-11-20 08:11:28,463 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2019-11-20 08:11:28,463 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 17 transitions. [2019-11-20 08:11:28,463 INFO L711 BuchiCegarLoop]: Abstraction has 15 states and 17 transitions. [2019-11-20 08:11:28,464 INFO L591 BuchiCegarLoop]: Abstraction has 15 states and 17 transitions. [2019-11-20 08:11:28,464 INFO L424 BuchiCegarLoop]: ======== Iteration 6============ [2019-11-20 08:11:28,464 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 15 states and 17 transitions. [2019-11-20 08:11:28,464 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 4 [2019-11-20 08:11:28,464 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-20 08:11:28,464 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-20 08:11:28,465 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 08:11:28,465 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2019-11-20 08:11:28,465 INFO L794 eck$LassoCheckResult]: Stem: 297#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 296#L-1 havoc main_#res;havoc main_#t~malloc2.base, main_#t~malloc2.offset, main_#t~malloc4.base, main_#t~malloc4.offset, main_#t~mem5.base, main_#t~mem5.offset, main_#t~post6, main_#t~nondet3, main_#t~mem7, main_#t~mem8.base, main_#t~mem8.offset, main_#t~post9, main_#t~mem10.base, main_#t~mem10.offset, main_~tmp~0.base, main_~tmp~0.offset, main_~a~0.base, main_~a~0.offset, main_~t~0.base, main_~t~0.offset, main_~p~0.base, main_~p~0.offset, main_~i~0;call main_#t~malloc2.base, main_#t~malloc2.offset := #Ultimate.allocOnHeap(8);main_~a~0.base, main_~a~0.offset := main_#t~malloc2.base, main_#t~malloc2.offset; 294#L522 assume !(main_~a~0.base == 0 && main_~a~0.offset == 0); 295#L522-1 havoc main_~t~0.base, main_~t~0.offset;main_~p~0.base, main_~p~0.offset := main_~a~0.base, main_~a~0.offset;main_~i~0 := 0; 290#L526-2 assume !!(main_~i~0 < 30 && 0 != main_#t~nondet3);havoc main_#t~nondet3;call write~int(main_~i~0, main_~p~0.base, main_~p~0.offset, 4);call main_#t~malloc4.base, main_#t~malloc4.offset := #Ultimate.allocOnHeap(8);main_~t~0.base, main_~t~0.offset := main_#t~malloc4.base, main_#t~malloc4.offset; 291#L529 assume !(main_~t~0.base == 0 && main_~t~0.offset == 0); 298#L529-1 call write~$Pointer$(main_~t~0.base, main_~t~0.offset, main_~p~0.base, 4 + main_~p~0.offset, 4);call main_#t~mem5.base, main_#t~mem5.offset := read~$Pointer$(main_~p~0.base, 4 + main_~p~0.offset, 4);main_~p~0.base, main_~p~0.offset := main_#t~mem5.base, main_#t~mem5.offset;havoc main_#t~mem5.base, main_#t~mem5.offset;main_#t~post6 := main_~i~0;main_~i~0 := 1 + main_#t~post6;havoc main_#t~post6; 292#L526-2 assume !(main_~i~0 < 30 && 0 != main_#t~nondet3);havoc main_#t~nondet3; 293#L526-3 call write~int(main_~i~0, main_~p~0.base, main_~p~0.offset, 4);call write~$Pointer$(0, 0, main_~p~0.base, 4 + main_~p~0.offset, 4);main_~p~0.base, main_~p~0.offset := main_~a~0.base, main_~a~0.offset;main_~i~0 := 0; 286#L538-2 assume !!(main_~p~0.base != 0 || main_~p~0.offset != 0);call main_#t~mem7 := read~int(main_~p~0.base, main_~p~0.offset, 4); 287#L539 [2019-11-20 08:11:28,465 INFO L796 eck$LassoCheckResult]: Loop: 287#L539 assume !(1 != main_#t~mem7);havoc main_#t~mem7; 284#L539-2 call main_#t~mem8.base, main_#t~mem8.offset := read~$Pointer$(main_~p~0.base, 4 + main_~p~0.offset, 4);main_~p~0.base, main_~p~0.offset := main_#t~mem8.base, main_#t~mem8.offset;havoc main_#t~mem8.base, main_#t~mem8.offset;main_#t~post9 := main_~i~0;main_~i~0 := 1 + main_#t~post9;havoc main_#t~post9; 285#L538-2 assume !!(main_~p~0.base != 0 || main_~p~0.offset != 0);call main_#t~mem7 := read~int(main_~p~0.base, main_~p~0.offset, 4); 287#L539 [2019-11-20 08:11:28,465 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 08:11:28,466 INFO L82 PathProgramCache]: Analyzing trace with hash 793653610, now seen corresponding path program 1 times [2019-11-20 08:11:28,466 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 08:11:28,466 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [911791346] [2019-11-20 08:11:28,466 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 08:11:28,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-20 08:11:28,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-20 08:11:28,548 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-20 08:11:28,548 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 08:11:28,548 INFO L82 PathProgramCache]: Analyzing trace with hash 76517, now seen corresponding path program 2 times [2019-11-20 08:11:28,549 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 08:11:28,549 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1833981138] [2019-11-20 08:11:28,549 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 08:11:28,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-20 08:11:28,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-20 08:11:28,564 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-20 08:11:28,565 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 08:11:28,566 INFO L82 PathProgramCache]: Analyzing trace with hash -60222244, now seen corresponding path program 1 times [2019-11-20 08:11:28,566 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 08:11:28,566 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [614171416] [2019-11-20 08:11:28,566 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 08:11:28,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 08:11:28,729 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 08:11:28,729 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [614171416] [2019-11-20 08:11:28,729 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [601886431] [2019-11-20 08:11:28,730 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_97d6820e-6904-4d0e-b2b3-53797c725ca1/bin/uautomizer/z3 Starting monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-20 08:11:28,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 08:11:28,803 INFO L255 TraceCheckSpWp]: Trace formula consists of 106 conjuncts, 30 conjunts are in the unsatisfiable core [2019-11-20 08:11:28,806 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 08:11:28,827 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 6 treesize of output 5 [2019-11-20 08:11:28,827 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 08:11:28,834 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 08:11:28,834 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-20 08:11:28,834 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2019-11-20 08:11:28,895 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 08:11:28,896 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 15 [2019-11-20 08:11:28,896 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 08:11:28,910 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 08:11:28,919 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2019-11-20 08:11:28,919 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-20 08:11:28,931 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 08:11:28,932 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-20 08:11:28,932 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:34, output treesize:24 [2019-11-20 08:11:28,960 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 08:11:28,965 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 11 [2019-11-20 08:11:28,966 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 08:11:28,984 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 08:11:28,984 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-20 08:11:28,984 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:37, output treesize:18 [2019-11-20 08:11:29,032 INFO L343 Elim1Store]: treesize reduction 27, result has 20.6 percent of original size [2019-11-20 08:11:29,032 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 30 treesize of output 18 [2019-11-20 08:11:29,033 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 08:11:29,043 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 08:11:29,043 INFO L496 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-20 08:11:29,044 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:40, output treesize:14 [2019-11-20 08:11:29,073 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 15 treesize of output 7 [2019-11-20 08:11:29,074 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 08:11:29,088 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 08:11:29,089 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-20 08:11:29,090 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:21, output treesize:3 [2019-11-20 08:11:29,104 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 08:11:29,105 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-20 08:11:29,105 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 14 [2019-11-20 08:11:29,105 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1475732564] [2019-11-20 08:11:29,184 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 08:11:29,184 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-11-20 08:11:29,185 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=145, Unknown=0, NotChecked=0, Total=182 [2019-11-20 08:11:29,185 INFO L87 Difference]: Start difference. First operand 15 states and 17 transitions. cyclomatic complexity: 5 Second operand 14 states. [2019-11-20 08:11:29,455 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 08:11:29,455 INFO L93 Difference]: Finished difference Result 26 states and 28 transitions. [2019-11-20 08:11:29,456 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-11-20 08:11:29,456 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 26 states and 28 transitions. [2019-11-20 08:11:29,457 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 4 [2019-11-20 08:11:29,458 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 26 states to 23 states and 25 transitions. [2019-11-20 08:11:29,458 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 15 [2019-11-20 08:11:29,458 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 15 [2019-11-20 08:11:29,458 INFO L73 IsDeterministic]: Start isDeterministic. Operand 23 states and 25 transitions. [2019-11-20 08:11:29,458 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-11-20 08:11:29,458 INFO L688 BuchiCegarLoop]: Abstraction has 23 states and 25 transitions. [2019-11-20 08:11:29,458 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states and 25 transitions. [2019-11-20 08:11:29,459 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 18. [2019-11-20 08:11:29,460 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2019-11-20 08:11:29,460 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 20 transitions. [2019-11-20 08:11:29,460 INFO L711 BuchiCegarLoop]: Abstraction has 18 states and 20 transitions. [2019-11-20 08:11:29,460 INFO L591 BuchiCegarLoop]: Abstraction has 18 states and 20 transitions. [2019-11-20 08:11:29,460 INFO L424 BuchiCegarLoop]: ======== Iteration 7============ [2019-11-20 08:11:29,460 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 18 states and 20 transitions. [2019-11-20 08:11:29,460 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 4 [2019-11-20 08:11:29,461 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-20 08:11:29,461 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-20 08:11:29,461 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 08:11:29,461 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2019-11-20 08:11:29,461 INFO L794 eck$LassoCheckResult]: Stem: 402#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 401#L-1 havoc main_#res;havoc main_#t~malloc2.base, main_#t~malloc2.offset, main_#t~malloc4.base, main_#t~malloc4.offset, main_#t~mem5.base, main_#t~mem5.offset, main_#t~post6, main_#t~nondet3, main_#t~mem7, main_#t~mem8.base, main_#t~mem8.offset, main_#t~post9, main_#t~mem10.base, main_#t~mem10.offset, main_~tmp~0.base, main_~tmp~0.offset, main_~a~0.base, main_~a~0.offset, main_~t~0.base, main_~t~0.offset, main_~p~0.base, main_~p~0.offset, main_~i~0;call main_#t~malloc2.base, main_#t~malloc2.offset := #Ultimate.allocOnHeap(8);main_~a~0.base, main_~a~0.offset := main_#t~malloc2.base, main_#t~malloc2.offset; 399#L522 assume !(main_~a~0.base == 0 && main_~a~0.offset == 0); 400#L522-1 havoc main_~t~0.base, main_~t~0.offset;main_~p~0.base, main_~p~0.offset := main_~a~0.base, main_~a~0.offset;main_~i~0 := 0; 394#L526-2 assume !!(main_~i~0 < 30 && 0 != main_#t~nondet3);havoc main_#t~nondet3;call write~int(main_~i~0, main_~p~0.base, main_~p~0.offset, 4);call main_#t~malloc4.base, main_#t~malloc4.offset := #Ultimate.allocOnHeap(8);main_~t~0.base, main_~t~0.offset := main_#t~malloc4.base, main_#t~malloc4.offset; 395#L529 assume !(main_~t~0.base == 0 && main_~t~0.offset == 0); 403#L529-1 call write~$Pointer$(main_~t~0.base, main_~t~0.offset, main_~p~0.base, 4 + main_~p~0.offset, 4);call main_#t~mem5.base, main_#t~mem5.offset := read~$Pointer$(main_~p~0.base, 4 + main_~p~0.offset, 4);main_~p~0.base, main_~p~0.offset := main_#t~mem5.base, main_#t~mem5.offset;havoc main_#t~mem5.base, main_#t~mem5.offset;main_#t~post6 := main_~i~0;main_~i~0 := 1 + main_#t~post6;havoc main_#t~post6; 396#L526-2 assume !!(main_~i~0 < 30 && 0 != main_#t~nondet3);havoc main_#t~nondet3;call write~int(main_~i~0, main_~p~0.base, main_~p~0.offset, 4);call main_#t~malloc4.base, main_#t~malloc4.offset := #Ultimate.allocOnHeap(8);main_~t~0.base, main_~t~0.offset := main_#t~malloc4.base, main_#t~malloc4.offset; 397#L529 assume !(main_~t~0.base == 0 && main_~t~0.offset == 0); 405#L529-1 call write~$Pointer$(main_~t~0.base, main_~t~0.offset, main_~p~0.base, 4 + main_~p~0.offset, 4);call main_#t~mem5.base, main_#t~mem5.offset := read~$Pointer$(main_~p~0.base, 4 + main_~p~0.offset, 4);main_~p~0.base, main_~p~0.offset := main_#t~mem5.base, main_#t~mem5.offset;havoc main_#t~mem5.base, main_#t~mem5.offset;main_#t~post6 := main_~i~0;main_~i~0 := 1 + main_#t~post6;havoc main_#t~post6; 404#L526-2 assume !(main_~i~0 < 30 && 0 != main_#t~nondet3);havoc main_#t~nondet3; 398#L526-3 call write~int(main_~i~0, main_~p~0.base, main_~p~0.offset, 4);call write~$Pointer$(0, 0, main_~p~0.base, 4 + main_~p~0.offset, 4);main_~p~0.base, main_~p~0.offset := main_~a~0.base, main_~a~0.offset;main_~i~0 := 0; 390#L538-2 assume !!(main_~p~0.base != 0 || main_~p~0.offset != 0);call main_#t~mem7 := read~int(main_~p~0.base, main_~p~0.offset, 4); 391#L539 [2019-11-20 08:11:29,461 INFO L796 eck$LassoCheckResult]: Loop: 391#L539 assume !(1 != main_#t~mem7);havoc main_#t~mem7; 388#L539-2 call main_#t~mem8.base, main_#t~mem8.offset := read~$Pointer$(main_~p~0.base, 4 + main_~p~0.offset, 4);main_~p~0.base, main_~p~0.offset := main_#t~mem8.base, main_#t~mem8.offset;havoc main_#t~mem8.base, main_#t~mem8.offset;main_#t~post9 := main_~i~0;main_~i~0 := 1 + main_#t~post9;havoc main_#t~post9; 389#L538-2 assume !!(main_~p~0.base != 0 || main_~p~0.offset != 0);call main_#t~mem7 := read~int(main_~p~0.base, main_~p~0.offset, 4); 391#L539 [2019-11-20 08:11:29,462 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 08:11:29,462 INFO L82 PathProgramCache]: Analyzing trace with hash -8921739, now seen corresponding path program 2 times [2019-11-20 08:11:29,462 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 08:11:29,462 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1521187650] [2019-11-20 08:11:29,462 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 08:11:29,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-20 08:11:29,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-20 08:11:29,500 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-20 08:11:29,501 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 08:11:29,501 INFO L82 PathProgramCache]: Analyzing trace with hash 76517, now seen corresponding path program 3 times [2019-11-20 08:11:29,501 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 08:11:29,501 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1256326481] [2019-11-20 08:11:29,501 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 08:11:29,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-20 08:11:29,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-20 08:11:29,508 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-20 08:11:29,511 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 08:11:29,511 INFO L82 PathProgramCache]: Analyzing trace with hash 500492529, now seen corresponding path program 2 times [2019-11-20 08:11:29,511 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 08:11:29,511 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1834519525] [2019-11-20 08:11:29,512 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 08:11:29,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 08:11:29,672 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 08:11:29,672 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1834519525] [2019-11-20 08:11:29,672 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1536292856] [2019-11-20 08:11:29,672 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_97d6820e-6904-4d0e-b2b3-53797c725ca1/bin/uautomizer/z3 Starting monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-20 08:11:29,760 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-11-20 08:11:29,760 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-20 08:11:29,762 INFO L255 TraceCheckSpWp]: Trace formula consists of 141 conjuncts, 48 conjunts are in the unsatisfiable core [2019-11-20 08:11:29,765 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 08:11:29,780 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 6 treesize of output 5 [2019-11-20 08:11:29,780 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 08:11:29,789 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 08:11:29,790 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-20 08:11:29,790 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2019-11-20 08:11:29,860 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 08:11:29,861 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 39 [2019-11-20 08:11:29,861 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 08:11:29,901 INFO L567 ElimStorePlain]: treesize reduction 14, result has 71.4 percent of original size [2019-11-20 08:11:29,908 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2019-11-20 08:11:29,909 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-20 08:11:29,926 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 08:11:29,927 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-20 08:11:29,927 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:37, output treesize:31 [2019-11-20 08:11:29,970 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 08:11:29,972 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 11 [2019-11-20 08:11:29,972 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 08:11:29,980 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 08:11:29,980 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-20 08:11:29,980 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:44, output treesize:25 [2019-11-20 08:11:30,019 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 08:11:30,020 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 16 treesize of output 26 [2019-11-20 08:11:30,020 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 08:11:30,032 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 08:11:30,037 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 18 [2019-11-20 08:11:30,038 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-20 08:11:30,050 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 08:11:30,051 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-20 08:11:30,051 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:44, output treesize:26 [2019-11-20 08:11:30,094 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 11 [2019-11-20 08:11:30,095 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 08:11:30,104 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 08:11:30,104 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-20 08:11:30,105 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:45, output treesize:18 [2019-11-20 08:11:30,137 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 18 [2019-11-20 08:11:30,137 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 08:11:30,143 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 08:11:30,144 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-20 08:11:30,145 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:33, output treesize:11 [2019-11-20 08:11:30,173 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-20 08:11:30,175 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 08:11:30,175 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 15 treesize of output 10 [2019-11-20 08:11:30,176 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 08:11:30,186 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 08:11:30,186 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-20 08:11:30,186 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:21, output treesize:3 [2019-11-20 08:11:30,188 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 08:11:30,188 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-20 08:11:30,188 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 17 [2019-11-20 08:11:30,188 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [676524978] [2019-11-20 08:11:30,254 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 08:11:30,254 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-11-20 08:11:30,255 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=220, Unknown=0, NotChecked=0, Total=272 [2019-11-20 08:11:30,255 INFO L87 Difference]: Start difference. First operand 18 states and 20 transitions. cyclomatic complexity: 5 Second operand 17 states. [2019-11-20 08:11:30,552 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 08:11:30,552 INFO L93 Difference]: Finished difference Result 16 states and 16 transitions. [2019-11-20 08:11:30,553 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-11-20 08:11:30,553 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 16 states and 16 transitions. [2019-11-20 08:11:30,553 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2019-11-20 08:11:30,554 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 16 states to 0 states and 0 transitions. [2019-11-20 08:11:30,554 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2019-11-20 08:11:30,554 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2019-11-20 08:11:30,554 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2019-11-20 08:11:30,554 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-11-20 08:11:30,554 INFO L688 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-11-20 08:11:30,554 INFO L711 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-11-20 08:11:30,554 INFO L591 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-11-20 08:11:30,554 INFO L424 BuchiCegarLoop]: ======== Iteration 8============ [2019-11-20 08:11:30,554 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2019-11-20 08:11:30,554 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2019-11-20 08:11:30,554 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2019-11-20 08:11:30,560 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 20.11 08:11:30 BoogieIcfgContainer [2019-11-20 08:11:30,560 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2019-11-20 08:11:30,561 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-11-20 08:11:30,561 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-11-20 08:11:30,561 INFO L275 PluginConnector]: Witness Printer initialized [2019-11-20 08:11:30,562 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 08:11:24" (3/4) ... [2019-11-20 08:11:30,565 INFO L140 WitnessPrinter]: No result that supports witness generation found [2019-11-20 08:11:30,566 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-11-20 08:11:30,567 INFO L168 Benchmark]: Toolchain (without parser) took 6698.20 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 199.2 MB). Free memory was 939.3 MB in the beginning and 1.1 GB in the end (delta: -126.9 MB). Peak memory consumption was 72.3 MB. Max. memory is 11.5 GB. [2019-11-20 08:11:30,567 INFO L168 Benchmark]: CDTParser took 0.22 ms. Allocated memory is still 1.0 GB. Free memory is still 962.2 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-20 08:11:30,568 INFO L168 Benchmark]: CACSL2BoogieTranslator took 618.64 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 159.9 MB). Free memory was 939.3 MB in the beginning and 1.1 GB in the end (delta: -203.2 MB). Peak memory consumption was 18.0 MB. Max. memory is 11.5 GB. [2019-11-20 08:11:30,568 INFO L168 Benchmark]: Boogie Procedure Inliner took 48.31 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-20 08:11:30,569 INFO L168 Benchmark]: Boogie Preprocessor took 40.80 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. [2019-11-20 08:11:30,569 INFO L168 Benchmark]: RCFGBuilder took 360.92 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 27.7 MB). Peak memory consumption was 27.7 MB. Max. memory is 11.5 GB. [2019-11-20 08:11:30,570 INFO L168 Benchmark]: BuchiAutomizer took 5621.20 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 39.3 MB). Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 43.2 MB). Peak memory consumption was 82.5 MB. Max. memory is 11.5 GB. [2019-11-20 08:11:30,570 INFO L168 Benchmark]: Witness Printer took 4.76 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-20 08:11:30,573 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.22 ms. Allocated memory is still 1.0 GB. Free memory is still 962.2 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 618.64 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 159.9 MB). Free memory was 939.3 MB in the beginning and 1.1 GB in the end (delta: -203.2 MB). Peak memory consumption was 18.0 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 48.31 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * Boogie Preprocessor took 40.80 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. * RCFGBuilder took 360.92 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 27.7 MB). Peak memory consumption was 27.7 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 5621.20 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 39.3 MB). Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 43.2 MB). Peak memory consumption was 82.5 MB. Max. memory is 11.5 GB. * Witness Printer took 4.76 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 7 terminating modules (6 trivial, 1 deterministic, 0 nondeterministic). One deterministic module has affine ranking function -2 * i + 59 and consists of 4 locations. 6 modules have a trivial ranking function, the largest among these consists of 17 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 5.5s and 8 iterations. TraceHistogramMax:2. Analysis of lassos took 4.4s. Construction of modules took 0.3s. Büchi inclusion checks took 0.6s. Highest rank in rank-based complementation 3. Minimization of det autom 5. Minimization of nondet autom 2. Automata minimization 0.0s AutomataMinimizationTime, 6 MinimizatonAttempts, 23 StatesRemovedByMinimization, 4 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had 18 states and ocurred in iteration 3. Nontrivial modules had stage [1, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 67 SDtfs, 127 SDslu, 62 SDs, 0 SdLazy, 263 SolverSat, 55 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.3s Time LassoAnalysisResults: nont0 unkn0 SFLI0 SFLT0 conc3 concLT0 SILN2 SILU1 SILI0 SILT0 lasso1 LassoPreprocessingBenchmarks: Lassos: inital191 mio100 ax109 hnf100 lsp86 ukn51 mio100 lsp33 div100 bol100 ite100 ukn100 eq177 hnf92 smp100 dnf172 smp93 tf100 neg95 sie120 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 26ms 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: Termination proven Buchi Automizer proved that your program is terminating RESULT: Ultimate proved your program to be correct! Received shutdown request...