./Ultimate.py --spec ../../sv-benchmarks/c/properties/termination.prp --file ../../sv-benchmarks/c/seq-mthreaded/pals_lcr.3.1.ufo.BOUNDED-6.pals.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version a4ecdabc Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/run_dir_647a429e-f5d0-4a92-8161-798cc43f5c46/bin/uautomizer/data/config -Xmx15G -Xms4m -jar /tmp/vcloud-vcloud-master/worker/run_dir_647a429e-f5d0-4a92-8161-798cc43f5c46/bin/uautomizer/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_647a429e-f5d0-4a92-8161-798cc43f5c46/bin/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_647a429e-f5d0-4a92-8161-798cc43f5c46/bin/uautomizer/config/AutomizerTermination.xml -i ../../sv-benchmarks/c/seq-mthreaded/pals_lcr.3.1.ufo.BOUNDED-6.pals.c -s /tmp/vcloud-vcloud-master/worker/run_dir_647a429e-f5d0-4a92-8161-798cc43f5c46/bin/uautomizer/config/svcomp-Termination-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_647a429e-f5d0-4a92-8161-798cc43f5c46/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 afa37805b5dd75e7d693edd5075ed8bd4a944c21 ..................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.2.0-a4ecdab [2020-11-30 01:21:23,675 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-11-30 01:21:23,680 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-11-30 01:21:23,738 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-11-30 01:21:23,740 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-11-30 01:21:23,758 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-11-30 01:21:23,761 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-11-30 01:21:23,764 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-11-30 01:21:23,768 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-11-30 01:21:23,770 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-11-30 01:21:23,772 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-11-30 01:21:23,774 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-11-30 01:21:23,775 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-11-30 01:21:23,777 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-11-30 01:21:23,779 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-11-30 01:21:23,781 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-11-30 01:21:23,783 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-11-30 01:21:23,785 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-11-30 01:21:23,788 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-11-30 01:21:23,792 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-11-30 01:21:23,794 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-11-30 01:21:23,806 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-11-30 01:21:23,814 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-11-30 01:21:23,816 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-11-30 01:21:23,820 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-11-30 01:21:23,826 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-11-30 01:21:23,827 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-11-30 01:21:23,828 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-11-30 01:21:23,831 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-11-30 01:21:23,833 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-11-30 01:21:23,833 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-11-30 01:21:23,835 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-11-30 01:21:23,837 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-11-30 01:21:23,839 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-11-30 01:21:23,842 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-11-30 01:21:23,843 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-11-30 01:21:23,844 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-11-30 01:21:23,845 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-11-30 01:21:23,845 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-11-30 01:21:23,847 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-11-30 01:21:23,848 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-11-30 01:21:23,854 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_647a429e-f5d0-4a92-8161-798cc43f5c46/bin/uautomizer/config/svcomp-Termination-32bit-Automizer_Default.epf [2020-11-30 01:21:23,914 INFO L113 SettingsManager]: Loading preferences was successful [2020-11-30 01:21:23,918 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-11-30 01:21:23,920 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-11-30 01:21:23,921 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-11-30 01:21:23,921 INFO L138 SettingsManager]: * Use SBE=true [2020-11-30 01:21:23,922 INFO L136 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2020-11-30 01:21:23,922 INFO L138 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2020-11-30 01:21:23,922 INFO L138 SettingsManager]: * Use old map elimination=false [2020-11-30 01:21:23,923 INFO L138 SettingsManager]: * Use external solver (rank synthesis)=false [2020-11-30 01:21:23,923 INFO L138 SettingsManager]: * Use only trivial implications for array writes=true [2020-11-30 01:21:23,924 INFO L138 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2020-11-30 01:21:23,925 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-11-30 01:21:23,925 INFO L138 SettingsManager]: * sizeof long=4 [2020-11-30 01:21:23,926 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2020-11-30 01:21:23,926 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-11-30 01:21:23,926 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-11-30 01:21:23,926 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-11-30 01:21:23,927 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2020-11-30 01:21:23,927 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2020-11-30 01:21:23,927 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2020-11-30 01:21:23,928 INFO L138 SettingsManager]: * sizeof long double=12 [2020-11-30 01:21:23,928 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-11-30 01:21:23,928 INFO L138 SettingsManager]: * Assume nondeterminstic values are in range=false [2020-11-30 01:21:23,929 INFO L138 SettingsManager]: * Use constant arrays=true [2020-11-30 01:21:23,929 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2020-11-30 01:21:23,929 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-11-30 01:21:23,930 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-11-30 01:21:23,930 INFO L138 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2020-11-30 01:21:23,930 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-11-30 01:21:23,931 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-11-30 01:21:23,931 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2020-11-30 01:21:23,931 INFO L138 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2020-11-30 01:21:23,935 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2020-11-30 01:21:23,935 INFO L138 SettingsManager]: * TransformationType=MODULO_NEIGHBOR WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/tmp/vcloud-vcloud-master/worker/run_dir_647a429e-f5d0-4a92-8161-798cc43f5c46/bin/uautomizer/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /tmp/vcloud-vcloud-master/worker/run_dir_647a429e-f5d0-4a92-8161-798cc43f5c46/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 -> afa37805b5dd75e7d693edd5075ed8bd4a944c21 [2020-11-30 01:21:24,283 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-11-30 01:21:24,337 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-11-30 01:21:24,342 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-11-30 01:21:24,344 INFO L271 PluginConnector]: Initializing CDTParser... [2020-11-30 01:21:24,345 INFO L275 PluginConnector]: CDTParser initialized [2020-11-30 01:21:24,347 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_647a429e-f5d0-4a92-8161-798cc43f5c46/bin/uautomizer/../../sv-benchmarks/c/seq-mthreaded/pals_lcr.3.1.ufo.BOUNDED-6.pals.c [2020-11-30 01:21:24,428 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_647a429e-f5d0-4a92-8161-798cc43f5c46/bin/uautomizer/data/07485f651/73e2bc75ec2548b4a5e5539c3d79096d/FLAGda754cae8 [2020-11-30 01:21:25,031 INFO L306 CDTParser]: Found 1 translation units. [2020-11-30 01:21:25,036 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_647a429e-f5d0-4a92-8161-798cc43f5c46/sv-benchmarks/c/seq-mthreaded/pals_lcr.3.1.ufo.BOUNDED-6.pals.c [2020-11-30 01:21:25,048 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_647a429e-f5d0-4a92-8161-798cc43f5c46/bin/uautomizer/data/07485f651/73e2bc75ec2548b4a5e5539c3d79096d/FLAGda754cae8 [2020-11-30 01:21:25,389 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_647a429e-f5d0-4a92-8161-798cc43f5c46/bin/uautomizer/data/07485f651/73e2bc75ec2548b4a5e5539c3d79096d [2020-11-30 01:21:25,391 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-11-30 01:21:25,394 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2020-11-30 01:21:25,396 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-11-30 01:21:25,396 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-11-30 01:21:25,400 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-11-30 01:21:25,401 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 30.11 01:21:25" (1/1) ... [2020-11-30 01:21:25,403 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7fc19272 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 01:21:25, skipping insertion in model container [2020-11-30 01:21:25,403 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 30.11 01:21:25" (1/1) ... [2020-11-30 01:21:25,417 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-11-30 01:21:25,444 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-11-30 01:21:25,691 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-11-30 01:21:25,717 INFO L203 MainTranslator]: Completed pre-run [2020-11-30 01:21:25,805 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-11-30 01:21:25,823 INFO L208 MainTranslator]: Completed translation [2020-11-30 01:21:25,824 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 01:21:25 WrapperNode [2020-11-30 01:21:25,824 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-11-30 01:21:25,825 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2020-11-30 01:21:25,826 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2020-11-30 01:21:25,826 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2020-11-30 01:21:25,834 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 01:21:25" (1/1) ... [2020-11-30 01:21:25,843 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 01:21:25" (1/1) ... [2020-11-30 01:21:25,874 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2020-11-30 01:21:25,875 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-11-30 01:21:25,876 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-11-30 01:21:25,876 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-11-30 01:21:25,887 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 01:21:25" (1/1) ... [2020-11-30 01:21:25,887 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 01:21:25" (1/1) ... [2020-11-30 01:21:25,891 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 01:21:25" (1/1) ... [2020-11-30 01:21:25,891 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 01:21:25" (1/1) ... [2020-11-30 01:21:25,897 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 01:21:25" (1/1) ... [2020-11-30 01:21:25,903 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 01:21:25" (1/1) ... [2020-11-30 01:21:25,906 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 01:21:25" (1/1) ... [2020-11-30 01:21:25,909 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-11-30 01:21:25,910 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-11-30 01:21:25,911 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-11-30 01:21:25,911 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-11-30 01:21:25,912 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 01:21:25" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_647a429e-f5d0-4a92-8161-798cc43f5c46/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 [2020-11-30 01:21:25,985 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2020-11-30 01:21:25,985 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-11-30 01:21:25,986 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-11-30 01:21:25,986 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-11-30 01:21:26,594 INFO L293 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-11-30 01:21:26,594 INFO L298 CfgBuilder]: Removed 19 assume(true) statements. [2020-11-30 01:21:26,596 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 30.11 01:21:26 BoogieIcfgContainer [2020-11-30 01:21:26,596 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-11-30 01:21:26,598 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2020-11-30 01:21:26,598 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2020-11-30 01:21:26,602 INFO L275 PluginConnector]: BuchiAutomizer initialized [2020-11-30 01:21:26,603 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-11-30 01:21:26,603 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 30.11 01:21:25" (1/3) ... [2020-11-30 01:21:26,605 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@78ac0d5e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 30.11 01:21:26, skipping insertion in model container [2020-11-30 01:21:26,605 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-11-30 01:21:26,605 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 01:21:25" (2/3) ... [2020-11-30 01:21:26,606 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@78ac0d5e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 30.11 01:21:26, skipping insertion in model container [2020-11-30 01:21:26,606 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-11-30 01:21:26,606 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 30.11 01:21:26" (3/3) ... [2020-11-30 01:21:26,608 INFO L373 chiAutomizerObserver]: Analyzing ICFG pals_lcr.3.1.ufo.BOUNDED-6.pals.c [2020-11-30 01:21:26,659 INFO L359 BuchiCegarLoop]: Interprodecural is true [2020-11-30 01:21:26,659 INFO L360 BuchiCegarLoop]: Hoare is false [2020-11-30 01:21:26,659 INFO L361 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2020-11-30 01:21:26,659 INFO L362 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2020-11-30 01:21:26,659 INFO L363 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-11-30 01:21:26,660 INFO L364 BuchiCegarLoop]: Difference is false [2020-11-30 01:21:26,660 INFO L365 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-11-30 01:21:26,660 INFO L368 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2020-11-30 01:21:26,673 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 62 states. [2020-11-30 01:21:26,696 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 36 [2020-11-30 01:21:26,696 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-11-30 01:21:26,696 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-11-30 01:21:26,706 INFO L852 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1] [2020-11-30 01:21:26,706 INFO L853 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-30 01:21:26,706 INFO L427 BuchiCegarLoop]: ======== Iteration 1============ [2020-11-30 01:21:26,706 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 62 states. [2020-11-30 01:21:26,712 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 36 [2020-11-30 01:21:26,712 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-11-30 01:21:26,712 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-11-30 01:21:26,713 INFO L852 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1] [2020-11-30 01:21:26,714 INFO L853 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-30 01:21:26,722 INFO L794 eck$LassoCheckResult]: Stem: 38#ULTIMATE.startENTRYtrue #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;call #t~string4.base, #t~string4.offset := #Ultimate.allocOnStack(2);call write~init~int(48, #t~string4.base, #t~string4.offset, 1);call write~init~int(0, #t~string4.base, 1 + #t~string4.offset, 1);call #t~string5.base, #t~string5.offset := #Ultimate.allocOnStack(34);call #t~string6.base, #t~string6.offset := #Ultimate.allocOnStack(12);~nomsg~0 := -1;~r1~0 := 0;~p1~0 := 0;~p1_old~0 := 0;~p1_new~0 := 0;~id1~0 := 0;~st1~0 := 0;~send1~0 := 0;~mode1~0 := 0;~p2~0 := 0;~p2_old~0 := 0;~p2_new~0 := 0;~id2~0 := 0;~st2~0 := 0;~send2~0 := 0;~mode2~0 := 0;~p3~0 := 0;~p3_old~0 := 0;~p3_new~0 := 0;~id3~0 := 0;~st3~0 := 0;~send3~0 := 0;~mode3~0 := 0; 11#L-1true havoc main_#res;havoc main_#t~nondet10, main_#t~nondet11, main_#t~nondet12, main_#t~nondet13, main_#t~nondet14, main_#t~nondet15, main_#t~nondet16, main_#t~nondet17, main_#t~nondet18, main_#t~nondet19, main_#t~nondet20, main_#t~nondet21, main_#t~nondet22, main_#t~ret23, main_#t~ret24, main_#t~post25, main_~c1~0, main_~i2~0;havoc main_~c1~0;havoc main_~i2~0;main_~c1~0 := 0;~r1~0 := main_#t~nondet10;havoc main_#t~nondet10;~id1~0 := main_#t~nondet11;havoc main_#t~nondet11;~st1~0 := main_#t~nondet12;havoc main_#t~nondet12;~send1~0 := main_#t~nondet13;havoc main_#t~nondet13;~mode1~0 := main_#t~nondet14;havoc main_#t~nondet14;~id2~0 := main_#t~nondet15;havoc main_#t~nondet15;~st2~0 := main_#t~nondet16;havoc main_#t~nondet16;~send2~0 := main_#t~nondet17;havoc main_#t~nondet17;~mode2~0 := main_#t~nondet18;havoc main_#t~nondet18;~id3~0 := main_#t~nondet19;havoc main_#t~nondet19;~st3~0 := main_#t~nondet20;havoc main_#t~nondet20;~send3~0 := main_#t~nondet21;havoc main_#t~nondet21;~mode3~0 := main_#t~nondet22;havoc main_#t~nondet22;havoc init_#res;havoc init_~tmp~0;havoc init_~tmp~0; 22#L131true assume !(0 == ~r1~0);init_~tmp~0 := 0; 19#L131-1true init_#res := init_~tmp~0; 64#L196true main_#t~ret23 := init_#res;main_~i2~0 := main_#t~ret23;havoc main_#t~ret23; 20#L248true assume !(0 == main_~i2~0); 14#L248-2true ~p1_old~0 := ~nomsg~0;~p1_new~0 := ~nomsg~0;~p2_old~0 := ~nomsg~0;~p2_new~0 := ~nomsg~0;~p3_old~0 := ~nomsg~0;~p3_new~0 := ~nomsg~0;main_~i2~0 := 0; 9#L256-2true [2020-11-30 01:21:26,723 INFO L796 eck$LassoCheckResult]: Loop: 9#L256-2true assume !!(main_~i2~0 < 6);havoc node1_#t~ite7, node1_~m1~0;havoc node1_~m1~0;node1_~m1~0 := ~nomsg~0; 15#L54true assume 0 != ~mode1~0 % 256;~r1~0 := (if (1 + ~r1~0) % 256 <= 127 then (1 + ~r1~0) % 256 else (1 + ~r1~0) % 256 - 256);node1_~m1~0 := ~p3_old~0;~p3_old~0 := ~nomsg~0; 3#L58true assume !(node1_~m1~0 != ~nomsg~0); 26#L58-1true ~mode1~0 := 0; 60#L54-2true havoc node2_#t~ite8, node2_~m2~0;havoc node2_~m2~0;node2_~m2~0 := ~nomsg~0; 49#L82true assume 0 != ~mode2~0 % 256;node2_~m2~0 := ~p1_old~0;~p1_old~0 := ~nomsg~0; 51#L85true assume !(node2_~m2~0 != ~nomsg~0); 36#L85-1true ~mode2~0 := 0; 48#L82-2true havoc node3_#t~ite9, node3_~m3~0;havoc node3_~m3~0;node3_~m3~0 := ~nomsg~0; 54#L107true assume !(0 != ~mode3~0 % 256); 21#L120true assume ~send3~0 != ~nomsg~0 && ~p3_new~0 == ~nomsg~0;node3_#t~ite9 := ~send3~0; 16#L120-2true ~p3_new~0 := (if node3_#t~ite9 % 256 <= 127 then node3_#t~ite9 % 256 else node3_#t~ite9 % 256 - 256);havoc node3_#t~ite9;~mode3~0 := 1; 35#L107-2true ~p1_old~0 := ~p1_new~0;~p1_new~0 := ~nomsg~0;~p2_old~0 := ~p2_new~0;~p2_new~0 := ~nomsg~0;~p3_old~0 := ~p3_new~0;~p3_new~0 := ~nomsg~0;havoc check_#res;havoc check_~tmp~1;havoc check_~tmp~1; 17#L204true assume !(~st1~0 + ~st2~0 + ~st3~0 <= 1);check_~tmp~1 := 0; 13#L204-1true check_#res := check_~tmp~1; 53#L224true main_#t~ret24 := check_#res;main_~c1~0 := main_#t~ret24;havoc main_#t~ret24;assert_#in~arg := (if 0 == main_~c1~0 then 0 else 1);havoc assert_~arg;assert_~arg := assert_#in~arg; 63#L280true assume !(0 == assert_~arg % 256); 34#L275true main_#t~post25 := main_~i2~0;main_~i2~0 := 1 + main_#t~post25;havoc main_#t~post25; 9#L256-2true [2020-11-30 01:21:26,729 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-30 01:21:26,730 INFO L82 PathProgramCache]: Analyzing trace with hash 1892699938, now seen corresponding path program 1 times [2020-11-30 01:21:26,739 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-30 01:21:26,740 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [220326732] [2020-11-30 01:21:26,740 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-30 01:21:26,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 01:21:26,942 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-30 01:21:26,943 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [220326732] [2020-11-30 01:21:26,943 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-30 01:21:26,944 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-11-30 01:21:26,944 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [595394787] [2020-11-30 01:21:26,952 INFO L799 eck$LassoCheckResult]: stem already infeasible [2020-11-30 01:21:26,956 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-30 01:21:26,956 INFO L82 PathProgramCache]: Analyzing trace with hash 1735879526, now seen corresponding path program 1 times [2020-11-30 01:21:26,957 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-30 01:21:26,958 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1344005889] [2020-11-30 01:21:26,958 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-30 01:21:27,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 01:21:27,150 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-30 01:21:27,150 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1344005889] [2020-11-30 01:21:27,151 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-30 01:21:27,151 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-11-30 01:21:27,151 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [269826386] [2020-11-30 01:21:27,153 INFO L811 eck$LassoCheckResult]: loop already infeasible [2020-11-30 01:21:27,154 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-30 01:21:27,173 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-11-30 01:21:27,174 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-11-30 01:21:27,176 INFO L87 Difference]: Start difference. First operand 62 states. Second operand 5 states. [2020-11-30 01:21:27,419 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-30 01:21:27,419 INFO L93 Difference]: Finished difference Result 99 states and 154 transitions. [2020-11-30 01:21:27,424 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-11-30 01:21:27,427 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 99 states and 154 transitions. [2020-11-30 01:21:27,437 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 34 [2020-11-30 01:21:27,451 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 99 states to 90 states and 130 transitions. [2020-11-30 01:21:27,453 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 90 [2020-11-30 01:21:27,458 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 90 [2020-11-30 01:21:27,459 INFO L73 IsDeterministic]: Start isDeterministic. Operand 90 states and 130 transitions. [2020-11-30 01:21:27,460 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-11-30 01:21:27,460 INFO L691 BuchiCegarLoop]: Abstraction has 90 states and 130 transitions. [2020-11-30 01:21:27,479 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90 states and 130 transitions. [2020-11-30 01:21:27,498 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90 to 56. [2020-11-30 01:21:27,499 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 56 states. [2020-11-30 01:21:27,504 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 76 transitions. [2020-11-30 01:21:27,506 INFO L714 BuchiCegarLoop]: Abstraction has 56 states and 76 transitions. [2020-11-30 01:21:27,506 INFO L594 BuchiCegarLoop]: Abstraction has 56 states and 76 transitions. [2020-11-30 01:21:27,506 INFO L427 BuchiCegarLoop]: ======== Iteration 2============ [2020-11-30 01:21:27,507 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 56 states and 76 transitions. [2020-11-30 01:21:27,515 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 34 [2020-11-30 01:21:27,515 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-11-30 01:21:27,515 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-11-30 01:21:27,517 INFO L852 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-30 01:21:27,517 INFO L853 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-30 01:21:27,518 INFO L794 eck$LassoCheckResult]: Stem: 221#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;call #t~string4.base, #t~string4.offset := #Ultimate.allocOnStack(2);call write~init~int(48, #t~string4.base, #t~string4.offset, 1);call write~init~int(0, #t~string4.base, 1 + #t~string4.offset, 1);call #t~string5.base, #t~string5.offset := #Ultimate.allocOnStack(34);call #t~string6.base, #t~string6.offset := #Ultimate.allocOnStack(12);~nomsg~0 := -1;~r1~0 := 0;~p1~0 := 0;~p1_old~0 := 0;~p1_new~0 := 0;~id1~0 := 0;~st1~0 := 0;~send1~0 := 0;~mode1~0 := 0;~p2~0 := 0;~p2_old~0 := 0;~p2_new~0 := 0;~id2~0 := 0;~st2~0 := 0;~send2~0 := 0;~mode2~0 := 0;~p3~0 := 0;~p3_old~0 := 0;~p3_new~0 := 0;~id3~0 := 0;~st3~0 := 0;~send3~0 := 0;~mode3~0 := 0; 194#L-1 havoc main_#res;havoc main_#t~nondet10, main_#t~nondet11, main_#t~nondet12, main_#t~nondet13, main_#t~nondet14, main_#t~nondet15, main_#t~nondet16, main_#t~nondet17, main_#t~nondet18, main_#t~nondet19, main_#t~nondet20, main_#t~nondet21, main_#t~nondet22, main_#t~ret23, main_#t~ret24, main_#t~post25, main_~c1~0, main_~i2~0;havoc main_~c1~0;havoc main_~i2~0;main_~c1~0 := 0;~r1~0 := main_#t~nondet10;havoc main_#t~nondet10;~id1~0 := main_#t~nondet11;havoc main_#t~nondet11;~st1~0 := main_#t~nondet12;havoc main_#t~nondet12;~send1~0 := main_#t~nondet13;havoc main_#t~nondet13;~mode1~0 := main_#t~nondet14;havoc main_#t~nondet14;~id2~0 := main_#t~nondet15;havoc main_#t~nondet15;~st2~0 := main_#t~nondet16;havoc main_#t~nondet16;~send2~0 := main_#t~nondet17;havoc main_#t~nondet17;~mode2~0 := main_#t~nondet18;havoc main_#t~nondet18;~id3~0 := main_#t~nondet19;havoc main_#t~nondet19;~st3~0 := main_#t~nondet20;havoc main_#t~nondet20;~send3~0 := main_#t~nondet21;havoc main_#t~nondet21;~mode3~0 := main_#t~nondet22;havoc main_#t~nondet22;havoc init_#res;havoc init_~tmp~0;havoc init_~tmp~0; 195#L131 assume 0 == ~r1~0; 208#L132 assume ~id1~0 >= 0; 225#L133 assume 0 == ~st1~0; 226#L134 assume ~send1~0 == ~id1~0; 185#L135 assume 0 == ~mode1~0 % 256; 186#L136 assume ~id2~0 >= 0; 217#L137 assume 0 == ~st2~0; 196#L138 assume ~send2~0 == ~id2~0; 197#L139 assume 0 == ~mode2~0 % 256; 222#L140 assume ~id3~0 >= 0; 233#L141 assume 0 == ~st3~0; 209#L142 assume ~send3~0 == ~id3~0; 210#L143 assume 0 == ~mode3~0 % 256; 212#L144 assume ~id1~0 != ~id2~0; 228#L145 assume ~id1~0 != ~id3~0; 187#L146 assume ~id2~0 != ~id3~0;init_~tmp~0 := 1; 188#L131-1 init_#res := init_~tmp~0; 205#L196 main_#t~ret23 := init_#res;main_~i2~0 := main_#t~ret23;havoc main_#t~ret23; 207#L248 assume !(0 == main_~i2~0); 202#L248-2 ~p1_old~0 := ~nomsg~0;~p1_new~0 := ~nomsg~0;~p2_old~0 := ~nomsg~0;~p2_new~0 := ~nomsg~0;~p3_old~0 := ~nomsg~0;~p3_new~0 := ~nomsg~0;main_~i2~0 := 0; 191#L256-2 [2020-11-30 01:21:27,519 INFO L796 eck$LassoCheckResult]: Loop: 191#L256-2 assume !!(main_~i2~0 < 6);havoc node1_#t~ite7, node1_~m1~0;havoc node1_~m1~0;node1_~m1~0 := ~nomsg~0; 192#L54 assume 0 != ~mode1~0 % 256;~r1~0 := (if (1 + ~r1~0) % 256 <= 127 then (1 + ~r1~0) % 256 else (1 + ~r1~0) % 256 - 256);node1_~m1~0 := ~p3_old~0;~p3_old~0 := ~nomsg~0; 179#L58 assume !(node1_~m1~0 != ~nomsg~0); 180#L58-1 ~mode1~0 := 0; 211#L54-2 havoc node2_#t~ite8, node2_~m2~0;havoc node2_~m2~0;node2_~m2~0 := ~nomsg~0; 229#L82 assume 0 != ~mode2~0 % 256;node2_~m2~0 := ~p1_old~0;~p1_old~0 := ~nomsg~0; 230#L85 assume !(node2_~m2~0 != ~nomsg~0); 219#L85-1 ~mode2~0 := 0; 190#L82-2 havoc node3_#t~ite9, node3_~m3~0;havoc node3_~m3~0;node3_~m3~0 := ~nomsg~0; 227#L107 assume !(0 != ~mode3~0 % 256); 206#L120 assume ~send3~0 != ~nomsg~0 && ~p3_new~0 == ~nomsg~0;node3_#t~ite9 := ~send3~0; 200#L120-2 ~p3_new~0 := (if node3_#t~ite9 % 256 <= 127 then node3_#t~ite9 % 256 else node3_#t~ite9 % 256 - 256);havoc node3_#t~ite9;~mode3~0 := 1; 201#L107-2 ~p1_old~0 := ~p1_new~0;~p1_new~0 := ~nomsg~0;~p2_old~0 := ~p2_new~0;~p2_new~0 := ~nomsg~0;~p3_old~0 := ~p3_new~0;~p3_new~0 := ~nomsg~0;havoc check_#res;havoc check_~tmp~1;havoc check_~tmp~1; 203#L204 assume !(~st1~0 + ~st2~0 + ~st3~0 <= 1);check_~tmp~1 := 0; 183#L204-1 check_#res := check_~tmp~1; 198#L224 main_#t~ret24 := check_#res;main_~c1~0 := main_#t~ret24;havoc main_#t~ret24;assert_#in~arg := (if 0 == main_~c1~0 then 0 else 1);havoc assert_~arg;assert_~arg := assert_#in~arg; 232#L280 assume !(0 == assert_~arg % 256); 218#L275 main_#t~post25 := main_~i2~0;main_~i2~0 := 1 + main_#t~post25;havoc main_#t~post25; 191#L256-2 [2020-11-30 01:21:27,521 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-30 01:21:27,521 INFO L82 PathProgramCache]: Analyzing trace with hash -1473464705, now seen corresponding path program 1 times [2020-11-30 01:21:27,522 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-30 01:21:27,522 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [61037244] [2020-11-30 01:21:27,523 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-30 01:21:27,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-30 01:21:27,586 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-30 01:21:27,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-30 01:21:27,639 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-30 01:21:27,688 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-11-30 01:21:27,690 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-30 01:21:27,690 INFO L82 PathProgramCache]: Analyzing trace with hash 1735879526, now seen corresponding path program 2 times [2020-11-30 01:21:27,690 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-30 01:21:27,692 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [654064071] [2020-11-30 01:21:27,692 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-30 01:21:27,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 01:21:27,827 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-30 01:21:27,827 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [654064071] [2020-11-30 01:21:27,828 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-30 01:21:27,828 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-11-30 01:21:27,828 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [709878771] [2020-11-30 01:21:27,829 INFO L811 eck$LassoCheckResult]: loop already infeasible [2020-11-30 01:21:27,829 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-30 01:21:27,830 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-11-30 01:21:27,830 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-11-30 01:21:27,830 INFO L87 Difference]: Start difference. First operand 56 states and 76 transitions. cyclomatic complexity: 21 Second operand 5 states. [2020-11-30 01:21:27,893 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-30 01:21:27,894 INFO L93 Difference]: Finished difference Result 59 states and 78 transitions. [2020-11-30 01:21:27,895 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-11-30 01:21:27,896 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 59 states and 78 transitions. [2020-11-30 01:21:27,897 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 34 [2020-11-30 01:21:27,898 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 59 states to 56 states and 73 transitions. [2020-11-30 01:21:27,899 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 56 [2020-11-30 01:21:27,899 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 56 [2020-11-30 01:21:27,899 INFO L73 IsDeterministic]: Start isDeterministic. Operand 56 states and 73 transitions. [2020-11-30 01:21:27,900 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-11-30 01:21:27,900 INFO L691 BuchiCegarLoop]: Abstraction has 56 states and 73 transitions. [2020-11-30 01:21:27,900 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states and 73 transitions. [2020-11-30 01:21:27,903 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 56. [2020-11-30 01:21:27,903 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 56 states. [2020-11-30 01:21:27,904 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 73 transitions. [2020-11-30 01:21:27,904 INFO L714 BuchiCegarLoop]: Abstraction has 56 states and 73 transitions. [2020-11-30 01:21:27,904 INFO L594 BuchiCegarLoop]: Abstraction has 56 states and 73 transitions. [2020-11-30 01:21:27,904 INFO L427 BuchiCegarLoop]: ======== Iteration 3============ [2020-11-30 01:21:27,904 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 56 states and 73 transitions. [2020-11-30 01:21:27,905 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 34 [2020-11-30 01:21:27,905 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-11-30 01:21:27,906 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-11-30 01:21:27,907 INFO L852 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-30 01:21:27,907 INFO L853 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-30 01:21:27,907 INFO L794 eck$LassoCheckResult]: Stem: 348#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;call #t~string4.base, #t~string4.offset := #Ultimate.allocOnStack(2);call write~init~int(48, #t~string4.base, #t~string4.offset, 1);call write~init~int(0, #t~string4.base, 1 + #t~string4.offset, 1);call #t~string5.base, #t~string5.offset := #Ultimate.allocOnStack(34);call #t~string6.base, #t~string6.offset := #Ultimate.allocOnStack(12);~nomsg~0 := -1;~r1~0 := 0;~p1~0 := 0;~p1_old~0 := 0;~p1_new~0 := 0;~id1~0 := 0;~st1~0 := 0;~send1~0 := 0;~mode1~0 := 0;~p2~0 := 0;~p2_old~0 := 0;~p2_new~0 := 0;~id2~0 := 0;~st2~0 := 0;~send2~0 := 0;~mode2~0 := 0;~p3~0 := 0;~p3_old~0 := 0;~p3_new~0 := 0;~id3~0 := 0;~st3~0 := 0;~send3~0 := 0;~mode3~0 := 0; 320#L-1 havoc main_#res;havoc main_#t~nondet10, main_#t~nondet11, main_#t~nondet12, main_#t~nondet13, main_#t~nondet14, main_#t~nondet15, main_#t~nondet16, main_#t~nondet17, main_#t~nondet18, main_#t~nondet19, main_#t~nondet20, main_#t~nondet21, main_#t~nondet22, main_#t~ret23, main_#t~ret24, main_#t~post25, main_~c1~0, main_~i2~0;havoc main_~c1~0;havoc main_~i2~0;main_~c1~0 := 0;~r1~0 := main_#t~nondet10;havoc main_#t~nondet10;~id1~0 := main_#t~nondet11;havoc main_#t~nondet11;~st1~0 := main_#t~nondet12;havoc main_#t~nondet12;~send1~0 := main_#t~nondet13;havoc main_#t~nondet13;~mode1~0 := main_#t~nondet14;havoc main_#t~nondet14;~id2~0 := main_#t~nondet15;havoc main_#t~nondet15;~st2~0 := main_#t~nondet16;havoc main_#t~nondet16;~send2~0 := main_#t~nondet17;havoc main_#t~nondet17;~mode2~0 := main_#t~nondet18;havoc main_#t~nondet18;~id3~0 := main_#t~nondet19;havoc main_#t~nondet19;~st3~0 := main_#t~nondet20;havoc main_#t~nondet20;~send3~0 := main_#t~nondet21;havoc main_#t~nondet21;~mode3~0 := main_#t~nondet22;havoc main_#t~nondet22;havoc init_#res;havoc init_~tmp~0;havoc init_~tmp~0; 321#L131 assume 0 == ~r1~0; 335#L132 assume ~id1~0 >= 0; 352#L133 assume 0 == ~st1~0; 353#L134 assume ~send1~0 == ~id1~0; 311#L135 assume 0 == ~mode1~0 % 256; 312#L136 assume ~id2~0 >= 0; 344#L137 assume 0 == ~st2~0; 322#L138 assume ~send2~0 == ~id2~0; 323#L139 assume 0 == ~mode2~0 % 256; 349#L140 assume ~id3~0 >= 0; 360#L141 assume 0 == ~st3~0; 336#L142 assume ~send3~0 == ~id3~0; 337#L143 assume 0 == ~mode3~0 % 256; 339#L144 assume ~id1~0 != ~id2~0; 354#L145 assume ~id1~0 != ~id3~0; 313#L146 assume ~id2~0 != ~id3~0;init_~tmp~0 := 1; 314#L131-1 init_#res := init_~tmp~0; 332#L196 main_#t~ret23 := init_#res;main_~i2~0 := main_#t~ret23;havoc main_#t~ret23; 333#L248 assume !(0 == main_~i2~0); 326#L248-2 ~p1_old~0 := ~nomsg~0;~p1_new~0 := ~nomsg~0;~p2_old~0 := ~nomsg~0;~p2_new~0 := ~nomsg~0;~p3_old~0 := ~nomsg~0;~p3_new~0 := ~nomsg~0;main_~i2~0 := 0; 317#L256-2 [2020-11-30 01:21:27,912 INFO L796 eck$LassoCheckResult]: Loop: 317#L256-2 assume !!(main_~i2~0 < 6);havoc node1_#t~ite7, node1_~m1~0;havoc node1_~m1~0;node1_~m1~0 := ~nomsg~0; 318#L54 assume 0 != ~mode1~0 % 256;~r1~0 := (if (1 + ~r1~0) % 256 <= 127 then (1 + ~r1~0) % 256 else (1 + ~r1~0) % 256 - 256);node1_~m1~0 := ~p3_old~0;~p3_old~0 := ~nomsg~0; 306#L58 assume !(node1_~m1~0 != ~nomsg~0); 307#L58-1 ~mode1~0 := 0; 338#L54-2 havoc node2_#t~ite8, node2_~m2~0;havoc node2_~m2~0;node2_~m2~0 := ~nomsg~0; 356#L82 assume 0 != ~mode2~0 % 256;node2_~m2~0 := ~p1_old~0;~p1_old~0 := ~nomsg~0; 357#L85 assume !(node2_~m2~0 != ~nomsg~0); 346#L85-1 ~mode2~0 := 0; 316#L82-2 havoc node3_#t~ite9, node3_~m3~0;havoc node3_~m3~0;node3_~m3~0 := ~nomsg~0; 355#L107 assume 0 != ~mode3~0 % 256;node3_~m3~0 := ~p2_old~0;~p2_old~0 := ~nomsg~0; 350#L110 assume !(node3_~m3~0 != ~nomsg~0); 343#L110-1 ~mode3~0 := 0; 329#L107-2 ~p1_old~0 := ~p1_new~0;~p1_new~0 := ~nomsg~0;~p2_old~0 := ~p2_new~0;~p2_new~0 := ~nomsg~0;~p3_old~0 := ~p3_new~0;~p3_new~0 := ~nomsg~0;havoc check_#res;havoc check_~tmp~1;havoc check_~tmp~1; 330#L204 assume ~st1~0 + ~st2~0 + ~st3~0 <= 1; 331#L205 assume ~r1~0 >= 3; 310#L209 assume ~r1~0 < 3;check_~tmp~1 := 1; 324#L204-1 check_#res := check_~tmp~1; 325#L224 main_#t~ret24 := check_#res;main_~c1~0 := main_#t~ret24;havoc main_#t~ret24;assert_#in~arg := (if 0 == main_~c1~0 then 0 else 1);havoc assert_~arg;assert_~arg := assert_#in~arg; 359#L280 assume !(0 == assert_~arg % 256); 345#L275 main_#t~post25 := main_~i2~0;main_~i2~0 := 1 + main_#t~post25;havoc main_#t~post25; 317#L256-2 [2020-11-30 01:21:27,912 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-30 01:21:27,913 INFO L82 PathProgramCache]: Analyzing trace with hash -1473464705, now seen corresponding path program 2 times [2020-11-30 01:21:27,913 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-30 01:21:27,913 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1586825126] [2020-11-30 01:21:27,913 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-30 01:21:27,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-30 01:21:27,948 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-30 01:21:27,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-30 01:21:27,982 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-30 01:21:28,005 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-11-30 01:21:28,005 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-30 01:21:28,006 INFO L82 PathProgramCache]: Analyzing trace with hash -1935834400, now seen corresponding path program 1 times [2020-11-30 01:21:28,006 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-30 01:21:28,006 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1872969597] [2020-11-30 01:21:28,006 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-30 01:21:28,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 01:21:28,054 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-30 01:21:28,054 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1872969597] [2020-11-30 01:21:28,054 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-30 01:21:28,055 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-11-30 01:21:28,055 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [311826035] [2020-11-30 01:21:28,055 INFO L811 eck$LassoCheckResult]: loop already infeasible [2020-11-30 01:21:28,056 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-30 01:21:28,056 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-11-30 01:21:28,056 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-11-30 01:21:28,057 INFO L87 Difference]: Start difference. First operand 56 states and 73 transitions. cyclomatic complexity: 18 Second operand 3 states. [2020-11-30 01:21:28,097 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-30 01:21:28,098 INFO L93 Difference]: Finished difference Result 84 states and 113 transitions. [2020-11-30 01:21:28,098 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-11-30 01:21:28,099 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 84 states and 113 transitions. [2020-11-30 01:21:28,100 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 62 [2020-11-30 01:21:28,101 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 84 states to 84 states and 113 transitions. [2020-11-30 01:21:28,102 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 84 [2020-11-30 01:21:28,102 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 84 [2020-11-30 01:21:28,102 INFO L73 IsDeterministic]: Start isDeterministic. Operand 84 states and 113 transitions. [2020-11-30 01:21:28,103 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-11-30 01:21:28,103 INFO L691 BuchiCegarLoop]: Abstraction has 84 states and 113 transitions. [2020-11-30 01:21:28,103 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84 states and 113 transitions. [2020-11-30 01:21:28,112 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84 to 84. [2020-11-30 01:21:28,112 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 84 states. [2020-11-30 01:21:28,113 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 113 transitions. [2020-11-30 01:21:28,113 INFO L714 BuchiCegarLoop]: Abstraction has 84 states and 113 transitions. [2020-11-30 01:21:28,113 INFO L594 BuchiCegarLoop]: Abstraction has 84 states and 113 transitions. [2020-11-30 01:21:28,113 INFO L427 BuchiCegarLoop]: ======== Iteration 4============ [2020-11-30 01:21:28,113 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 84 states and 113 transitions. [2020-11-30 01:21:28,117 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 62 [2020-11-30 01:21:28,117 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-11-30 01:21:28,117 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-11-30 01:21:28,122 INFO L852 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-30 01:21:28,122 INFO L853 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-30 01:21:28,122 INFO L794 eck$LassoCheckResult]: Stem: 495#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;call #t~string4.base, #t~string4.offset := #Ultimate.allocOnStack(2);call write~init~int(48, #t~string4.base, #t~string4.offset, 1);call write~init~int(0, #t~string4.base, 1 + #t~string4.offset, 1);call #t~string5.base, #t~string5.offset := #Ultimate.allocOnStack(34);call #t~string6.base, #t~string6.offset := #Ultimate.allocOnStack(12);~nomsg~0 := -1;~r1~0 := 0;~p1~0 := 0;~p1_old~0 := 0;~p1_new~0 := 0;~id1~0 := 0;~st1~0 := 0;~send1~0 := 0;~mode1~0 := 0;~p2~0 := 0;~p2_old~0 := 0;~p2_new~0 := 0;~id2~0 := 0;~st2~0 := 0;~send2~0 := 0;~mode2~0 := 0;~p3~0 := 0;~p3_old~0 := 0;~p3_new~0 := 0;~id3~0 := 0;~st3~0 := 0;~send3~0 := 0;~mode3~0 := 0; 466#L-1 havoc main_#res;havoc main_#t~nondet10, main_#t~nondet11, main_#t~nondet12, main_#t~nondet13, main_#t~nondet14, main_#t~nondet15, main_#t~nondet16, main_#t~nondet17, main_#t~nondet18, main_#t~nondet19, main_#t~nondet20, main_#t~nondet21, main_#t~nondet22, main_#t~ret23, main_#t~ret24, main_#t~post25, main_~c1~0, main_~i2~0;havoc main_~c1~0;havoc main_~i2~0;main_~c1~0 := 0;~r1~0 := main_#t~nondet10;havoc main_#t~nondet10;~id1~0 := main_#t~nondet11;havoc main_#t~nondet11;~st1~0 := main_#t~nondet12;havoc main_#t~nondet12;~send1~0 := main_#t~nondet13;havoc main_#t~nondet13;~mode1~0 := main_#t~nondet14;havoc main_#t~nondet14;~id2~0 := main_#t~nondet15;havoc main_#t~nondet15;~st2~0 := main_#t~nondet16;havoc main_#t~nondet16;~send2~0 := main_#t~nondet17;havoc main_#t~nondet17;~mode2~0 := main_#t~nondet18;havoc main_#t~nondet18;~id3~0 := main_#t~nondet19;havoc main_#t~nondet19;~st3~0 := main_#t~nondet20;havoc main_#t~nondet20;~send3~0 := main_#t~nondet21;havoc main_#t~nondet21;~mode3~0 := main_#t~nondet22;havoc main_#t~nondet22;havoc init_#res;havoc init_~tmp~0;havoc init_~tmp~0; 467#L131 assume 0 == ~r1~0; 481#L132 assume ~id1~0 >= 0; 500#L133 assume 0 == ~st1~0; 501#L134 assume ~send1~0 == ~id1~0; 457#L135 assume 0 == ~mode1~0 % 256; 458#L136 assume ~id2~0 >= 0; 491#L137 assume 0 == ~st2~0; 468#L138 assume ~send2~0 == ~id2~0; 469#L139 assume 0 == ~mode2~0 % 256; 496#L140 assume ~id3~0 >= 0; 509#L141 assume 0 == ~st3~0; 482#L142 assume ~send3~0 == ~id3~0; 483#L143 assume 0 == ~mode3~0 % 256; 485#L144 assume ~id1~0 != ~id2~0; 503#L145 assume ~id1~0 != ~id3~0; 459#L146 assume ~id2~0 != ~id3~0;init_~tmp~0 := 1; 460#L131-1 init_#res := init_~tmp~0; 478#L196 main_#t~ret23 := init_#res;main_~i2~0 := main_#t~ret23;havoc main_#t~ret23; 479#L248 assume !(0 == main_~i2~0); 472#L248-2 ~p1_old~0 := ~nomsg~0;~p1_new~0 := ~nomsg~0;~p2_old~0 := ~nomsg~0;~p2_new~0 := ~nomsg~0;~p3_old~0 := ~nomsg~0;~p3_new~0 := ~nomsg~0;main_~i2~0 := 0; 463#L256-2 [2020-11-30 01:21:28,123 INFO L796 eck$LassoCheckResult]: Loop: 463#L256-2 assume !!(main_~i2~0 < 6);havoc node1_#t~ite7, node1_~m1~0;havoc node1_~m1~0;node1_~m1~0 := ~nomsg~0; 464#L54 assume 0 != ~mode1~0 % 256;~r1~0 := (if (1 + ~r1~0) % 256 <= 127 then (1 + ~r1~0) % 256 else (1 + ~r1~0) % 256 - 256);node1_~m1~0 := ~p3_old~0;~p3_old~0 := ~nomsg~0; 452#L58 assume !(node1_~m1~0 != ~nomsg~0); 453#L58-1 ~mode1~0 := 0; 484#L54-2 havoc node2_#t~ite8, node2_~m2~0;havoc node2_~m2~0;node2_~m2~0 := ~nomsg~0; 504#L82 assume 0 != ~mode2~0 % 256;node2_~m2~0 := ~p1_old~0;~p1_old~0 := ~nomsg~0; 505#L85 assume !(node2_~m2~0 != ~nomsg~0); 493#L85-1 ~mode2~0 := 0; 462#L82-2 havoc node3_#t~ite9, node3_~m3~0;havoc node3_~m3~0;node3_~m3~0 := ~nomsg~0; 502#L107 assume !(0 != ~mode3~0 % 256); 480#L120 assume ~send3~0 != ~nomsg~0 && ~p3_new~0 == ~nomsg~0;node3_#t~ite9 := ~send3~0; 474#L120-2 ~p3_new~0 := (if node3_#t~ite9 % 256 <= 127 then node3_#t~ite9 % 256 else node3_#t~ite9 % 256 - 256);havoc node3_#t~ite9;~mode3~0 := 1; 475#L107-2 ~p1_old~0 := ~p1_new~0;~p1_new~0 := ~nomsg~0;~p2_old~0 := ~p2_new~0;~p2_new~0 := ~nomsg~0;~p3_old~0 := ~p3_new~0;~p3_new~0 := ~nomsg~0;havoc check_#res;havoc check_~tmp~1;havoc check_~tmp~1; 476#L204 assume ~st1~0 + ~st2~0 + ~st3~0 <= 1; 477#L205 assume !(~r1~0 >= 3); 455#L208 assume 0 == ~st1~0 + ~st2~0 + ~st3~0; 456#L209 assume ~r1~0 < 3;check_~tmp~1 := 1; 470#L204-1 check_#res := check_~tmp~1; 471#L224 main_#t~ret24 := check_#res;main_~c1~0 := main_#t~ret24;havoc main_#t~ret24;assert_#in~arg := (if 0 == main_~c1~0 then 0 else 1);havoc assert_~arg;assert_~arg := assert_#in~arg; 508#L280 assume !(0 == assert_~arg % 256); 492#L275 main_#t~post25 := main_~i2~0;main_~i2~0 := 1 + main_#t~post25;havoc main_#t~post25; 463#L256-2 [2020-11-30 01:21:28,123 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-30 01:21:28,123 INFO L82 PathProgramCache]: Analyzing trace with hash -1473464705, now seen corresponding path program 3 times [2020-11-30 01:21:28,123 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-30 01:21:28,124 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1701366536] [2020-11-30 01:21:28,124 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-30 01:21:28,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-30 01:21:28,165 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-30 01:21:28,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-30 01:21:28,178 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-30 01:21:28,200 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-11-30 01:21:28,201 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-30 01:21:28,201 INFO L82 PathProgramCache]: Analyzing trace with hash -1410446433, now seen corresponding path program 1 times [2020-11-30 01:21:28,202 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-30 01:21:28,202 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1505369381] [2020-11-30 01:21:28,203 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-30 01:21:28,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-30 01:21:28,231 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-30 01:21:28,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-30 01:21:28,250 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-30 01:21:28,257 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-11-30 01:21:28,258 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-30 01:21:28,258 INFO L82 PathProgramCache]: Analyzing trace with hash 1606496225, now seen corresponding path program 1 times [2020-11-30 01:21:28,259 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-30 01:21:28,259 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1731892009] [2020-11-30 01:21:28,259 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-30 01:21:28,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 01:21:28,340 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-30 01:21:28,342 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1731892009] [2020-11-30 01:21:28,342 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-30 01:21:28,342 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-11-30 01:21:28,342 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [740445787] [2020-11-30 01:21:28,700 WARN L193 SmtUtils]: Spent 348.00 ms on a formula simplification. DAG size of input: 108 DAG size of output: 103 [2020-11-30 01:21:29,123 WARN L193 SmtUtils]: Spent 383.00 ms on a formula simplification. DAG size of input: 103 DAG size of output: 96 [2020-11-30 01:21:29,136 INFO L210 LassoAnalysis]: Preferences: [2020-11-30 01:21:29,137 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2020-11-30 01:21:29,137 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-11-30 01:21:29,137 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2020-11-30 01:21:29,138 INFO L129 ssoRankerPreferences]: Use exernal solver: true [2020-11-30 01:21:29,138 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-11-30 01:21:29,138 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2020-11-30 01:21:29,138 INFO L132 ssoRankerPreferences]: Path of dumped script: [2020-11-30 01:21:29,138 INFO L133 ssoRankerPreferences]: Filename of dumped script: pals_lcr.3.1.ufo.BOUNDED-6.pals.c_Iteration4_Loop [2020-11-30 01:21:29,138 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2020-11-30 01:21:29,139 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2020-11-30 01:21:29,164 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-11-30 01:21:29,177 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-11-30 01:21:29,187 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-11-30 01:21:29,192 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-11-30 01:21:29,203 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-11-30 01:21:29,215 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-11-30 01:21:29,222 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-11-30 01:21:29,228 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-11-30 01:21:29,253 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-11-30 01:21:29,264 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-11-30 01:21:29,275 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-11-30 01:21:29,408 WARN L193 SmtUtils]: Spent 128.00 ms on a formula simplification. DAG size of input: 42 DAG size of output: 40 [2020-11-30 01:21:29,410 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-11-30 01:21:29,414 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-11-30 01:21:29,419 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-11-30 01:21:29,812 WARN L193 SmtUtils]: Spent 133.00 ms on a formula simplification that was a NOOP. DAG size: 66 [2020-11-30 01:21:30,801 WARN L193 SmtUtils]: Spent 803.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 66 [2020-11-30 01:21:30,822 INFO L292 LassoAnalysis]: Preprocessing complete. [2020-11-30 01:21:30,822 INFO L404 LassoAnalysis]: Checking for nontermination... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_647a429e-f5d0-4a92-8161-798cc43f5c46/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) Waiting until toolchain timeout for monitored process 2 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-11-30 01:21:30,837 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2020-11-30 01:21:30,837 INFO L160 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_647a429e-f5d0-4a92-8161-798cc43f5c46/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) Waiting until toolchain timeout for monitored process 3 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-11-30 01:21:30,869 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2020-11-30 01:21:30,869 INFO L160 nArgumentSynthesizer]: Using integer mode. [2020-11-30 01:21:30,926 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2020-11-30 01:21:30,928 INFO L210 LassoAnalysis]: Preferences: [2020-11-30 01:21:30,928 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2020-11-30 01:21:30,928 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-11-30 01:21:30,928 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2020-11-30 01:21:30,928 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2020-11-30 01:21:30,928 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-11-30 01:21:30,929 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2020-11-30 01:21:30,929 INFO L132 ssoRankerPreferences]: Path of dumped script: [2020-11-30 01:21:30,929 INFO L133 ssoRankerPreferences]: Filename of dumped script: pals_lcr.3.1.ufo.BOUNDED-6.pals.c_Iteration4_Loop [2020-11-30 01:21:30,929 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2020-11-30 01:21:30,929 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2020-11-30 01:21:30,933 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-11-30 01:21:30,943 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-11-30 01:21:30,949 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-11-30 01:21:30,961 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-11-30 01:21:30,976 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-11-30 01:21:30,980 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-11-30 01:21:30,983 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-11-30 01:21:30,999 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-11-30 01:21:31,005 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-11-30 01:21:31,011 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-11-30 01:21:31,142 WARN L193 SmtUtils]: Spent 127.00 ms on a formula simplification. DAG size of input: 42 DAG size of output: 40 [2020-11-30 01:21:31,143 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-11-30 01:21:31,156 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-11-30 01:21:31,159 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-11-30 01:21:31,162 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-11-30 01:21:31,495 WARN L193 SmtUtils]: Spent 154.00 ms on a formula simplification that was a NOOP. DAG size: 66 [2020-11-30 01:21:32,403 WARN L193 SmtUtils]: Spent 749.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 66 [2020-11-30 01:21:32,427 INFO L292 LassoAnalysis]: Preprocessing complete. [2020-11-30 01:21:32,431 INFO L489 LassoAnalysis]: Using template 'affine'. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_647a429e-f5d0-4a92-8161-798cc43f5c46/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) [2020-11-30 01:21:32,445 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 Waiting until toolchain timeout for monitored process 4 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-11-30 01:21:32,447 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-11-30 01:21:32,447 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-11-30 01:21:32,448 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-11-30 01:21:32,448 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-11-30 01:21:32,448 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-11-30 01:21:32,452 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-11-30 01:21:32,452 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-11-30 01:21:32,454 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2020-11-30 01:21:32,467 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2020-11-30 01:21:32,467 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 0 variables to zero. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_647a429e-f5d0-4a92-8161-798cc43f5c46/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) Waiting until toolchain timeout for monitored process 5 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-11-30 01:21:32,474 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2020-11-30 01:21:32,475 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2020-11-30 01:21:32,476 INFO L510 LassoAnalysis]: Proved termination. [2020-11-30 01:21:32,477 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~i2~0) = -2*ULTIMATE.start_main_~i2~0 + 11 Supporting invariants [] [2020-11-30 01:21:32,511 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2020-11-30 01:21:32,553 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-30 01:21:32,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 01:21:32,638 INFO L263 TraceCheckSpWp]: Trace formula consists of 152 conjuncts, 2 conjunts are in the unsatisfiable core [2020-11-30 01:21:32,640 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-11-30 01:21:32,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 01:21:32,745 INFO L263 TraceCheckSpWp]: Trace formula consists of 70 conjuncts, 4 conjunts are in the unsatisfiable core [2020-11-30 01:21:32,746 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-11-30 01:21:32,793 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-30 01:21:32,801 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 [2020-11-30 01:21:32,802 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 84 states and 113 transitions. cyclomatic complexity: 30 Second operand 3 states. [2020-11-30 01:21:32,856 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 84 states and 113 transitions. cyclomatic complexity: 30. Second operand 3 states. Result 145 states and 204 transitions. Complement of second has 4 states. [2020-11-30 01:21:32,858 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2020-11-30 01:21:32,859 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-11-30 01:21:32,859 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 73 transitions. [2020-11-30 01:21:32,861 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 73 transitions. Stem has 22 letters. Loop has 21 letters. [2020-11-30 01:21:32,862 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-11-30 01:21:32,862 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 73 transitions. Stem has 43 letters. Loop has 21 letters. [2020-11-30 01:21:32,863 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-11-30 01:21:32,863 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 73 transitions. Stem has 22 letters. Loop has 42 letters. [2020-11-30 01:21:32,866 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-11-30 01:21:32,867 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 145 states and 204 transitions. [2020-11-30 01:21:32,869 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2020-11-30 01:21:32,869 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 145 states to 0 states and 0 transitions. [2020-11-30 01:21:32,869 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2020-11-30 01:21:32,870 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2020-11-30 01:21:32,870 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2020-11-30 01:21:32,870 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-11-30 01:21:32,870 INFO L691 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-11-30 01:21:32,870 INFO L714 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-11-30 01:21:32,870 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-30 01:21:32,871 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-11-30 01:21:32,871 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-11-30 01:21:32,871 INFO L87 Difference]: Start difference. First operand 0 states and 0 transitions. Second operand 3 states. [2020-11-30 01:21:32,871 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-30 01:21:32,871 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2020-11-30 01:21:32,871 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2020-11-30 01:21:32,872 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 0 states and 0 transitions. [2020-11-30 01:21:32,872 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2020-11-30 01:21:32,872 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 0 states to 0 states and 0 transitions. [2020-11-30 01:21:32,872 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2020-11-30 01:21:32,872 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2020-11-30 01:21:32,872 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2020-11-30 01:21:32,872 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-11-30 01:21:32,872 INFO L691 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-11-30 01:21:32,872 INFO L714 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-11-30 01:21:32,873 INFO L594 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-11-30 01:21:32,873 INFO L427 BuchiCegarLoop]: ======== Iteration 5============ [2020-11-30 01:21:32,873 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2020-11-30 01:21:32,873 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2020-11-30 01:21:32,873 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2020-11-30 01:21:32,885 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 30.11 01:21:32 BoogieIcfgContainer [2020-11-30 01:21:32,885 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2020-11-30 01:21:32,886 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2020-11-30 01:21:32,886 INFO L271 PluginConnector]: Initializing Witness Printer... [2020-11-30 01:21:32,886 INFO L275 PluginConnector]: Witness Printer initialized [2020-11-30 01:21:32,887 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 30.11 01:21:26" (3/4) ... [2020-11-30 01:21:32,890 INFO L140 WitnessPrinter]: No result that supports witness generation found [2020-11-30 01:21:32,890 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2020-11-30 01:21:32,893 INFO L168 Benchmark]: Toolchain (without parser) took 7497.21 ms. Allocated memory was 98.6 MB in the beginning and 174.1 MB in the end (delta: 75.5 MB). Free memory was 69.8 MB in the beginning and 137.2 MB in the end (delta: -67.5 MB). Peak memory consumption was 6.5 MB. Max. memory is 16.1 GB. [2020-11-30 01:21:32,894 INFO L168 Benchmark]: CDTParser took 1.17 ms. Allocated memory is still 98.6 MB. Free memory is still 57.3 MB. There was no memory consumed. Max. memory is 16.1 GB. [2020-11-30 01:21:32,902 INFO L168 Benchmark]: CACSL2BoogieTranslator took 428.26 ms. Allocated memory is still 98.6 MB. Free memory was 69.8 MB in the beginning and 72.3 MB in the end (delta: -2.6 MB). Peak memory consumption was 8.4 MB. Max. memory is 16.1 GB. [2020-11-30 01:21:32,902 INFO L168 Benchmark]: Boogie Procedure Inliner took 49.43 ms. Allocated memory is still 98.6 MB. Free memory was 72.3 MB in the beginning and 70.5 MB in the end (delta: 1.8 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. [2020-11-30 01:21:32,903 INFO L168 Benchmark]: Boogie Preprocessor took 34.33 ms. Allocated memory is still 98.6 MB. Free memory was 70.5 MB in the beginning and 68.8 MB in the end (delta: 1.7 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. [2020-11-30 01:21:32,903 INFO L168 Benchmark]: RCFGBuilder took 686.13 ms. Allocated memory was 98.6 MB in the beginning and 119.5 MB in the end (delta: 21.0 MB). Free memory was 68.8 MB in the beginning and 91.9 MB in the end (delta: -23.2 MB). Peak memory consumption was 27.5 MB. Max. memory is 16.1 GB. [2020-11-30 01:21:32,904 INFO L168 Benchmark]: BuchiAutomizer took 6287.70 ms. Allocated memory was 119.5 MB in the beginning and 174.1 MB in the end (delta: 54.5 MB). Free memory was 91.3 MB in the beginning and 137.2 MB in the end (delta: -45.9 MB). Peak memory consumption was 7.8 MB. Max. memory is 16.1 GB. [2020-11-30 01:21:32,904 INFO L168 Benchmark]: Witness Printer took 4.48 ms. Allocated memory is still 174.1 MB. Free memory is still 137.2 MB. There was no memory consumed. Max. memory is 16.1 GB. [2020-11-30 01:21:32,913 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 1.17 ms. Allocated memory is still 98.6 MB. Free memory is still 57.3 MB. There was no memory consumed. Max. memory is 16.1 GB. * CACSL2BoogieTranslator took 428.26 ms. Allocated memory is still 98.6 MB. Free memory was 69.8 MB in the beginning and 72.3 MB in the end (delta: -2.6 MB). Peak memory consumption was 8.4 MB. Max. memory is 16.1 GB. * Boogie Procedure Inliner took 49.43 ms. Allocated memory is still 98.6 MB. Free memory was 72.3 MB in the beginning and 70.5 MB in the end (delta: 1.8 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. * Boogie Preprocessor took 34.33 ms. Allocated memory is still 98.6 MB. Free memory was 70.5 MB in the beginning and 68.8 MB in the end (delta: 1.7 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. * RCFGBuilder took 686.13 ms. Allocated memory was 98.6 MB in the beginning and 119.5 MB in the end (delta: 21.0 MB). Free memory was 68.8 MB in the beginning and 91.9 MB in the end (delta: -23.2 MB). Peak memory consumption was 27.5 MB. Max. memory is 16.1 GB. * BuchiAutomizer took 6287.70 ms. Allocated memory was 119.5 MB in the beginning and 174.1 MB in the end (delta: 54.5 MB). Free memory was 91.3 MB in the beginning and 137.2 MB in the end (delta: -45.9 MB). Peak memory consumption was 7.8 MB. Max. memory is 16.1 GB. * Witness Printer took 4.48 ms. Allocated memory is still 174.1 MB. Free memory is still 137.2 MB. There was no memory consumed. Max. memory is 16.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 5 terminating modules (4 trivial, 1 deterministic, 0 nondeterministic). One deterministic module has affine ranking function -2 * i2 + 11 and consists of 3 locations. 4 modules have a trivial ranking function, the largest among these consists of 5 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 6.2s and 5 iterations. TraceHistogramMax:1. Analysis of lassos took 5.2s. Construction of modules took 0.1s. Büchi inclusion checks took 0.5s. Highest rank in rank-based complementation 3. Minimization of det autom 5. Minimization of nondet autom 0. Automata minimization 0.0s AutomataMinimizationTime, 3 MinimizatonAttempts, 34 StatesRemovedByMinimization, 1 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had 84 states and ocurred in iteration 3. Nontrivial modules had stage [1, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 347 SDtfs, 219 SDslu, 585 SDs, 0 SdLazy, 46 SolverSat, 23 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.1s Time LassoAnalysisResults: nont0 unkn0 SFLI2 SFLT0 conc0 concLT1 SILN0 SILU0 SILI1 SILT0 lasso0 LassoPreprocessingBenchmarks: Lassos: inital150 mio100 ax100 hnf98 lsp59 ukn72 mio100 lsp100 div149 bol100 ite100 ukn100 eq178 hnf72 smp100 dnf670 smp48 tf100 neg99 sie103 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: sat Degree: 0 Time: 43ms VariablesStem: 0 VariablesLoop: 2 DisjunctsStem: 1 DisjunctsLoop: 1 SupportingInvariants: 0 MotzkinApplications: 2 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 0 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 1 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.1s - TerminationAnalysisResult: Termination proven Buchi Automizer proved that your program is terminating RESULT: Ultimate proved your program to be correct! Received shutdown request...