./Ultimate.py --spec ../../sv-benchmarks/c/properties/termination.prp --file ../../sv-benchmarks/c/loops/n.c11.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version cad46833 Calling Ultimate with: /usr/lib/jvm/java-8-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_a69793a7-c23e-474f-8ebd-db0266489921/bin/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_a69793a7-c23e-474f-8ebd-db0266489921/bin/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_a69793a7-c23e-474f-8ebd-db0266489921/bin/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_a69793a7-c23e-474f-8ebd-db0266489921/bin/uautomizer/config/AutomizerTermination.xml -i ../../sv-benchmarks/c/loops/n.c11.c -s /tmp/vcloud-vcloud-master/worker/working_dir_a69793a7-c23e-474f-8ebd-db0266489921/bin/uautomizer/config/svcomp-Termination-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_a69793a7-c23e-474f-8ebd-db0266489921/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 f82cf7726c8201fc884c9fdb36548fce0440ab7f .......................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE(TERM) --- Real Ultimate output --- This is Ultimate 0.1.24-cad4683 [2019-10-22 08:57:51,900 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-10-22 08:57:51,903 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-10-22 08:57:51,914 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-10-22 08:57:51,914 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-10-22 08:57:51,915 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-10-22 08:57:51,916 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-10-22 08:57:51,917 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-10-22 08:57:51,920 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-10-22 08:57:51,920 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-10-22 08:57:51,921 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-10-22 08:57:51,922 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-10-22 08:57:51,922 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-10-22 08:57:51,923 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-10-22 08:57:51,923 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-10-22 08:57:51,924 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-10-22 08:57:51,925 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-10-22 08:57:51,925 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-10-22 08:57:51,933 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-10-22 08:57:51,934 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-10-22 08:57:51,935 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-10-22 08:57:51,936 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-10-22 08:57:51,936 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-10-22 08:57:51,937 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-10-22 08:57:51,942 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-10-22 08:57:51,942 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-10-22 08:57:51,942 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-10-22 08:57:51,943 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-10-22 08:57:51,943 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-10-22 08:57:51,944 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-10-22 08:57:51,944 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-10-22 08:57:51,945 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-10-22 08:57:51,945 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-10-22 08:57:51,945 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-10-22 08:57:51,948 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-10-22 08:57:51,949 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-10-22 08:57:51,949 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-10-22 08:57:51,949 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-10-22 08:57:51,949 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-10-22 08:57:51,950 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-10-22 08:57:51,950 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-10-22 08:57:51,951 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_a69793a7-c23e-474f-8ebd-db0266489921/bin/uautomizer/config/svcomp-Termination-32bit-Automizer_Default.epf [2019-10-22 08:57:51,966 INFO L113 SettingsManager]: Loading preferences was successful [2019-10-22 08:57:51,967 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-10-22 08:57:51,968 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-10-22 08:57:51,968 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-10-22 08:57:51,968 INFO L138 SettingsManager]: * Use SBE=true [2019-10-22 08:57:51,968 INFO L136 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2019-10-22 08:57:51,968 INFO L138 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2019-10-22 08:57:51,968 INFO L138 SettingsManager]: * Use old map elimination=false [2019-10-22 08:57:51,968 INFO L138 SettingsManager]: * Use external solver (rank synthesis)=false [2019-10-22 08:57:51,969 INFO L138 SettingsManager]: * Use only trivial implications for array writes=true [2019-10-22 08:57:51,969 INFO L138 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2019-10-22 08:57:51,969 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-10-22 08:57:51,969 INFO L138 SettingsManager]: * sizeof long=4 [2019-10-22 08:57:51,969 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2019-10-22 08:57:51,969 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-10-22 08:57:51,970 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-10-22 08:57:51,979 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-10-22 08:57:51,979 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2019-10-22 08:57:51,979 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2019-10-22 08:57:51,979 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2019-10-22 08:57:51,979 INFO L138 SettingsManager]: * sizeof long double=12 [2019-10-22 08:57:51,979 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-10-22 08:57:51,980 INFO L138 SettingsManager]: * Assume nondeterminstic values are in range=false [2019-10-22 08:57:51,980 INFO L138 SettingsManager]: * Use constant arrays=true [2019-10-22 08:57:51,980 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2019-10-22 08:57:51,980 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-10-22 08:57:51,980 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-10-22 08:57:51,980 INFO L138 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2019-10-22 08:57:51,981 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-10-22 08:57:51,981 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-10-22 08:57:51,981 INFO L138 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2019-10-22 08:57:51,982 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2019-10-22 08:57:51,984 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/working_dir_a69793a7-c23e-474f-8ebd-db0266489921/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 -> f82cf7726c8201fc884c9fdb36548fce0440ab7f [2019-10-22 08:57:52,014 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-10-22 08:57:52,025 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-10-22 08:57:52,028 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-10-22 08:57:52,029 INFO L271 PluginConnector]: Initializing CDTParser... [2019-10-22 08:57:52,029 INFO L275 PluginConnector]: CDTParser initialized [2019-10-22 08:57:52,030 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_a69793a7-c23e-474f-8ebd-db0266489921/bin/uautomizer/../../sv-benchmarks/c/loops/n.c11.c [2019-10-22 08:57:52,077 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_a69793a7-c23e-474f-8ebd-db0266489921/bin/uautomizer/data/88143a80f/a937851d5d0040a4aa99f822936175f0/FLAG3c707eaa5 [2019-10-22 08:57:52,471 INFO L306 CDTParser]: Found 1 translation units. [2019-10-22 08:57:52,471 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_a69793a7-c23e-474f-8ebd-db0266489921/sv-benchmarks/c/loops/n.c11.c [2019-10-22 08:57:52,476 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_a69793a7-c23e-474f-8ebd-db0266489921/bin/uautomizer/data/88143a80f/a937851d5d0040a4aa99f822936175f0/FLAG3c707eaa5 [2019-10-22 08:57:52,874 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_a69793a7-c23e-474f-8ebd-db0266489921/bin/uautomizer/data/88143a80f/a937851d5d0040a4aa99f822936175f0 [2019-10-22 08:57:52,877 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-10-22 08:57:52,878 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-10-22 08:57:52,879 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-10-22 08:57:52,879 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-10-22 08:57:52,882 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-10-22 08:57:52,882 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.10 08:57:52" (1/1) ... [2019-10-22 08:57:52,885 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@525ba5f0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 08:57:52, skipping insertion in model container [2019-10-22 08:57:52,885 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.10 08:57:52" (1/1) ... [2019-10-22 08:57:52,890 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-10-22 08:57:52,905 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-10-22 08:57:53,027 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-22 08:57:53,031 INFO L188 MainTranslator]: Completed pre-run [2019-10-22 08:57:53,104 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-22 08:57:53,116 INFO L192 MainTranslator]: Completed translation [2019-10-22 08:57:53,117 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 08:57:53 WrapperNode [2019-10-22 08:57:53,117 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-10-22 08:57:53,118 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-10-22 08:57:53,118 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-10-22 08:57:53,118 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-10-22 08:57:53,126 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 08:57:53" (1/1) ... [2019-10-22 08:57:53,129 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 08:57:53" (1/1) ... [2019-10-22 08:57:53,142 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-10-22 08:57:53,142 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-10-22 08:57:53,142 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-10-22 08:57:53,143 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-10-22 08:57:53,150 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 08:57:53" (1/1) ... [2019-10-22 08:57:53,150 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 08:57:53" (1/1) ... [2019-10-22 08:57:53,151 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 08:57:53" (1/1) ... [2019-10-22 08:57:53,151 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 08:57:53" (1/1) ... [2019-10-22 08:57:53,153 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 08:57:53" (1/1) ... [2019-10-22 08:57:53,157 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 08:57:53" (1/1) ... [2019-10-22 08:57:53,158 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 08:57:53" (1/1) ... [2019-10-22 08:57:53,159 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-10-22 08:57:53,159 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-10-22 08:57:53,159 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-10-22 08:57:53,160 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-10-22 08:57:53,160 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 08:57:53" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_a69793a7-c23e-474f-8ebd-db0266489921/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-10-22 08:57:53,229 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-10-22 08:57:53,229 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-10-22 08:57:53,393 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-10-22 08:57:53,394 INFO L284 CfgBuilder]: Removed 7 assume(true) statements. [2019-10-22 08:57:53,395 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.10 08:57:53 BoogieIcfgContainer [2019-10-22 08:57:53,395 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-10-22 08:57:53,395 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2019-10-22 08:57:53,395 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2019-10-22 08:57:53,400 INFO L275 PluginConnector]: BuchiAutomizer initialized [2019-10-22 08:57:53,402 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-10-22 08:57:53,403 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 22.10 08:57:52" (1/3) ... [2019-10-22 08:57:53,404 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@37e733fe and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 22.10 08:57:53, skipping insertion in model container [2019-10-22 08:57:53,404 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-10-22 08:57:53,404 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 08:57:53" (2/3) ... [2019-10-22 08:57:53,405 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@37e733fe and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 22.10 08:57:53, skipping insertion in model container [2019-10-22 08:57:53,405 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-10-22 08:57:53,406 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.10 08:57:53" (3/3) ... [2019-10-22 08:57:53,407 INFO L371 chiAutomizerObserver]: Analyzing ICFG n.c11.c [2019-10-22 08:57:53,492 INFO L356 BuchiCegarLoop]: Interprodecural is true [2019-10-22 08:57:53,502 INFO L357 BuchiCegarLoop]: Hoare is false [2019-10-22 08:57:53,502 INFO L358 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2019-10-22 08:57:53,502 INFO L359 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2019-10-22 08:57:53,503 INFO L360 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-10-22 08:57:53,503 INFO L361 BuchiCegarLoop]: Difference is false [2019-10-22 08:57:53,503 INFO L362 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-10-22 08:57:53,503 INFO L365 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2019-10-22 08:57:53,517 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 11 states. [2019-10-22 08:57:53,538 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2019-10-22 08:57:53,538 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-10-22 08:57:53,538 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-10-22 08:57:53,544 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1] [2019-10-22 08:57:53,545 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2019-10-22 08:57:53,545 INFO L424 BuchiCegarLoop]: ======== Iteration 1============ [2019-10-22 08:57:53,545 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 11 states. [2019-10-22 08:57:53,546 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2019-10-22 08:57:53,546 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-10-22 08:57:53,546 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-10-22 08:57:53,547 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1] [2019-10-22 08:57:53,547 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2019-10-22 08:57:53,555 INFO L791 eck$LassoCheckResult]: Stem: 5#ULTIMATE.startENTRYtrue havoc main_#res;havoc main_#t~post1, main_#t~nondet0, main_~a~0, main_~len~0, main_~i~0;havoc main_~a~0;main_~len~0 := 0;havoc main_~i~0; 7#L19-2true [2019-10-22 08:57:53,555 INFO L793 eck$LassoCheckResult]: Loop: 7#L19-2true assume !!(0 != main_#t~nondet0 % 256);havoc main_#t~nondet0; 3#L21true assume 4 == main_~len~0 % 4294967296;main_~len~0 := 0; 11#L21-2true assume 0 <= (if main_~len~0 % 4294967296 % 4294967296 <= 2147483647 then main_~len~0 % 4294967296 % 4294967296 else main_~len~0 % 4294967296 % 4294967296 - 4294967296) && (if main_~len~0 % 4294967296 % 4294967296 <= 2147483647 then main_~len~0 % 4294967296 % 4294967296 else main_~len~0 % 4294967296 % 4294967296 - 4294967296) < 5;main_~a~0 := main_~a~0[(if main_~len~0 % 4294967296 % 4294967296 <= 2147483647 then main_~len~0 % 4294967296 % 4294967296 else main_~len~0 % 4294967296 % 4294967296 - 4294967296) := 0];main_#t~post1 := main_~len~0;main_~len~0 := 1 + main_#t~post1;havoc main_#t~post1; 7#L19-2true [2019-10-22 08:57:53,562 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:57:53,562 INFO L82 PathProgramCache]: Analyzing trace with hash 32, now seen corresponding path program 1 times [2019-10-22 08:57:53,571 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:57:53,571 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1573482963] [2019-10-22 08:57:53,572 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:57:53,572 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:57:53,572 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:57:53,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:57:53,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:57:53,739 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-10-22 08:57:53,741 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:57:53,742 INFO L82 PathProgramCache]: Analyzing trace with hash 39821, now seen corresponding path program 1 times [2019-10-22 08:57:53,742 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:57:53,742 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1219432701] [2019-10-22 08:57:53,742 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:57:53,743 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:57:53,743 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:57:53,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:57:53,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:57:53,794 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-10-22 08:57:53,795 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:57:53,795 INFO L82 PathProgramCache]: Analyzing trace with hash 963342, now seen corresponding path program 1 times [2019-10-22 08:57:53,795 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:57:53,796 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [823993827] [2019-10-22 08:57:53,796 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:57:53,796 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:57:53,796 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:57:53,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:57:53,893 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 08:57:53,894 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [823993827] [2019-10-22 08:57:53,894 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 08:57:53,895 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-10-22 08:57:53,895 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [152484249] [2019-10-22 08:57:53,969 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 08:57:53,983 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-22 08:57:53,984 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-22 08:57:53,986 INFO L87 Difference]: Start difference. First operand 11 states. Second operand 3 states. [2019-10-22 08:57:54,018 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 08:57:54,019 INFO L93 Difference]: Finished difference Result 21 states and 22 transitions. [2019-10-22 08:57:54,019 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-22 08:57:54,021 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 21 states and 22 transitions. [2019-10-22 08:57:54,023 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2019-10-22 08:57:54,026 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 21 states to 7 states and 8 transitions. [2019-10-22 08:57:54,027 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 7 [2019-10-22 08:57:54,027 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 7 [2019-10-22 08:57:54,028 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 8 transitions. [2019-10-22 08:57:54,028 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-10-22 08:57:54,028 INFO L688 BuchiCegarLoop]: Abstraction has 7 states and 8 transitions. [2019-10-22 08:57:54,045 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7 states and 8 transitions. [2019-10-22 08:57:54,053 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7 to 6. [2019-10-22 08:57:54,054 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2019-10-22 08:57:54,055 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 7 transitions. [2019-10-22 08:57:54,056 INFO L711 BuchiCegarLoop]: Abstraction has 6 states and 7 transitions. [2019-10-22 08:57:54,056 INFO L591 BuchiCegarLoop]: Abstraction has 6 states and 7 transitions. [2019-10-22 08:57:54,056 INFO L424 BuchiCegarLoop]: ======== Iteration 2============ [2019-10-22 08:57:54,057 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 6 states and 7 transitions. [2019-10-22 08:57:54,057 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2019-10-22 08:57:54,057 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-10-22 08:57:54,057 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-10-22 08:57:54,058 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1] [2019-10-22 08:57:54,058 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2019-10-22 08:57:54,059 INFO L791 eck$LassoCheckResult]: Stem: 45#ULTIMATE.startENTRY havoc main_#res;havoc main_#t~post1, main_#t~nondet0, main_~a~0, main_~len~0, main_~i~0;havoc main_~a~0;main_~len~0 := 0;havoc main_~i~0; 46#L19-2 assume !!(0 != main_#t~nondet0 % 256);havoc main_#t~nondet0; 43#L21 assume !(4 == main_~len~0 % 4294967296); 44#L21-2 [2019-10-22 08:57:54,059 INFO L793 eck$LassoCheckResult]: Loop: 44#L21-2 assume 0 <= (if main_~len~0 % 4294967296 % 4294967296 <= 2147483647 then main_~len~0 % 4294967296 % 4294967296 else main_~len~0 % 4294967296 % 4294967296 - 4294967296) && (if main_~len~0 % 4294967296 % 4294967296 <= 2147483647 then main_~len~0 % 4294967296 % 4294967296 else main_~len~0 % 4294967296 % 4294967296 - 4294967296) < 5;main_~a~0 := main_~a~0[(if main_~len~0 % 4294967296 % 4294967296 <= 2147483647 then main_~len~0 % 4294967296 % 4294967296 else main_~len~0 % 4294967296 % 4294967296 - 4294967296) := 0];main_#t~post1 := main_~len~0;main_~len~0 := 1 + main_#t~post1;havoc main_#t~post1; 47#L19-2 assume !!(0 != main_#t~nondet0 % 256);havoc main_#t~nondet0; 48#L21 assume 4 == main_~len~0 % 4294967296;main_~len~0 := 0; 44#L21-2 [2019-10-22 08:57:54,059 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:57:54,059 INFO L82 PathProgramCache]: Analyzing trace with hash 31077, now seen corresponding path program 1 times [2019-10-22 08:57:54,060 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:57:54,060 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [921926636] [2019-10-22 08:57:54,060 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:57:54,060 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:57:54,060 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:57:54,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:57:54,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:57:54,070 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-10-22 08:57:54,071 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:57:54,071 INFO L82 PathProgramCache]: Analyzing trace with hash 46451, now seen corresponding path program 2 times [2019-10-22 08:57:54,071 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:57:54,071 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1383953386] [2019-10-22 08:57:54,071 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:57:54,072 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:57:54,072 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:57:54,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:57:54,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:57:54,097 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-10-22 08:57:54,098 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:57:54,098 INFO L82 PathProgramCache]: Analyzing trace with hash 925831567, now seen corresponding path program 1 times [2019-10-22 08:57:54,099 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:57:54,099 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1988020223] [2019-10-22 08:57:54,099 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:57:54,099 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:57:54,099 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:57:54,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:57:54,174 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 08:57:54,174 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1988020223] [2019-10-22 08:57:54,174 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1549928241] [2019-10-22 08:57:54,174 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_a69793a7-c23e-474f-8ebd-db0266489921/bin/uautomizer/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-22 08:57:54,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:57:54,213 INFO L256 TraceCheckSpWp]: Trace formula consists of 16 conjuncts, 6 conjunts are in the unsatisfiable core [2019-10-22 08:57:54,216 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-22 08:57:54,252 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 08:57:54,252 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-22 08:57:54,252 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [2, 2] total 3 [2019-10-22 08:57:54,253 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1016279339] [2019-10-22 08:57:54,379 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 08:57:54,380 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-22 08:57:54,380 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-10-22 08:57:54,380 INFO L87 Difference]: Start difference. First operand 6 states and 7 transitions. cyclomatic complexity: 2 Second operand 5 states. [2019-10-22 08:57:54,410 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 08:57:54,410 INFO L93 Difference]: Finished difference Result 10 states and 11 transitions. [2019-10-22 08:57:54,411 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-22 08:57:54,412 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 10 states and 11 transitions. [2019-10-22 08:57:54,412 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 7 [2019-10-22 08:57:54,413 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 10 states to 10 states and 11 transitions. [2019-10-22 08:57:54,413 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 10 [2019-10-22 08:57:54,413 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 10 [2019-10-22 08:57:54,413 INFO L73 IsDeterministic]: Start isDeterministic. Operand 10 states and 11 transitions. [2019-10-22 08:57:54,413 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-10-22 08:57:54,414 INFO L688 BuchiCegarLoop]: Abstraction has 10 states and 11 transitions. [2019-10-22 08:57:54,414 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10 states and 11 transitions. [2019-10-22 08:57:54,415 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10 to 9. [2019-10-22 08:57:54,415 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2019-10-22 08:57:54,415 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 10 transitions. [2019-10-22 08:57:54,415 INFO L711 BuchiCegarLoop]: Abstraction has 9 states and 10 transitions. [2019-10-22 08:57:54,415 INFO L591 BuchiCegarLoop]: Abstraction has 9 states and 10 transitions. [2019-10-22 08:57:54,416 INFO L424 BuchiCegarLoop]: ======== Iteration 3============ [2019-10-22 08:57:54,416 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 9 states and 10 transitions. [2019-10-22 08:57:54,416 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 6 [2019-10-22 08:57:54,416 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-10-22 08:57:54,416 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-10-22 08:57:54,417 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1] [2019-10-22 08:57:54,417 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [2, 2, 1, 1] [2019-10-22 08:57:54,417 INFO L791 eck$LassoCheckResult]: Stem: 86#ULTIMATE.startENTRY havoc main_#res;havoc main_#t~post1, main_#t~nondet0, main_~a~0, main_~len~0, main_~i~0;havoc main_~a~0;main_~len~0 := 0;havoc main_~i~0; 87#L19-2 assume !!(0 != main_#t~nondet0 % 256);havoc main_#t~nondet0; 92#L21 assume !(4 == main_~len~0 % 4294967296); 89#L21-2 [2019-10-22 08:57:54,417 INFO L793 eck$LassoCheckResult]: Loop: 89#L21-2 assume 0 <= (if main_~len~0 % 4294967296 % 4294967296 <= 2147483647 then main_~len~0 % 4294967296 % 4294967296 else main_~len~0 % 4294967296 % 4294967296 - 4294967296) && (if main_~len~0 % 4294967296 % 4294967296 <= 2147483647 then main_~len~0 % 4294967296 % 4294967296 else main_~len~0 % 4294967296 % 4294967296 - 4294967296) < 5;main_~a~0 := main_~a~0[(if main_~len~0 % 4294967296 % 4294967296 <= 2147483647 then main_~len~0 % 4294967296 % 4294967296 else main_~len~0 % 4294967296 % 4294967296 - 4294967296) := 0];main_#t~post1 := main_~len~0;main_~len~0 := 1 + main_#t~post1;havoc main_#t~post1; 88#L19-2 assume !!(0 != main_#t~nondet0 % 256);havoc main_#t~nondet0; 84#L21 assume !(4 == main_~len~0 % 4294967296); 85#L21-2 assume 0 <= (if main_~len~0 % 4294967296 % 4294967296 <= 2147483647 then main_~len~0 % 4294967296 % 4294967296 else main_~len~0 % 4294967296 % 4294967296 - 4294967296) && (if main_~len~0 % 4294967296 % 4294967296 <= 2147483647 then main_~len~0 % 4294967296 % 4294967296 else main_~len~0 % 4294967296 % 4294967296 - 4294967296) < 5;main_~a~0 := main_~a~0[(if main_~len~0 % 4294967296 % 4294967296 <= 2147483647 then main_~len~0 % 4294967296 % 4294967296 else main_~len~0 % 4294967296 % 4294967296 - 4294967296) := 0];main_#t~post1 := main_~len~0;main_~len~0 := 1 + main_#t~post1;havoc main_#t~post1; 91#L19-2 assume !!(0 != main_#t~nondet0 % 256);havoc main_#t~nondet0; 90#L21 assume 4 == main_~len~0 % 4294967296;main_~len~0 := 0; 89#L21-2 [2019-10-22 08:57:54,418 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:57:54,418 INFO L82 PathProgramCache]: Analyzing trace with hash 31077, now seen corresponding path program 2 times [2019-10-22 08:57:54,419 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:57:54,419 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1589510593] [2019-10-22 08:57:54,419 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:57:54,419 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:57:54,419 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:57:54,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:57:54,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:57:54,432 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-10-22 08:57:54,435 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:57:54,435 INFO L82 PathProgramCache]: Analyzing trace with hash 1383897983, now seen corresponding path program 1 times [2019-10-22 08:57:54,435 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:57:54,436 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [106096864] [2019-10-22 08:57:54,436 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:57:54,436 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:57:54,436 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:57:54,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:57:54,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:57:54,502 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-10-22 08:57:54,502 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:57:54,502 INFO L82 PathProgramCache]: Analyzing trace with hash -831686173, now seen corresponding path program 2 times [2019-10-22 08:57:54,503 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:57:54,503 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1150833490] [2019-10-22 08:57:54,503 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:57:54,503 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:57:54,503 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:57:54,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:57:54,592 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 08:57:54,593 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1150833490] [2019-10-22 08:57:54,593 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [342290904] [2019-10-22 08:57:54,593 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_a69793a7-c23e-474f-8ebd-db0266489921/bin/uautomizer/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-22 08:57:54,625 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-10-22 08:57:54,625 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-22 08:57:54,626 INFO L256 TraceCheckSpWp]: Trace formula consists of 23 conjuncts, 8 conjunts are in the unsatisfiable core [2019-10-22 08:57:54,627 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-22 08:57:54,643 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 08:57:54,644 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-22 08:57:54,644 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3] total 4 [2019-10-22 08:57:54,644 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2099109245] [2019-10-22 08:57:54,754 WARN L191 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 42 [2019-10-22 08:57:54,866 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 08:57:54,866 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-22 08:57:54,867 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2019-10-22 08:57:54,867 INFO L87 Difference]: Start difference. First operand 9 states and 10 transitions. cyclomatic complexity: 2 Second operand 6 states. [2019-10-22 08:57:54,900 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 08:57:54,900 INFO L93 Difference]: Finished difference Result 13 states and 14 transitions. [2019-10-22 08:57:54,901 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-22 08:57:54,901 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 13 states and 14 transitions. [2019-10-22 08:57:54,901 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 10 [2019-10-22 08:57:54,902 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 13 states to 13 states and 14 transitions. [2019-10-22 08:57:54,902 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 13 [2019-10-22 08:57:54,902 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 13 [2019-10-22 08:57:54,902 INFO L73 IsDeterministic]: Start isDeterministic. Operand 13 states and 14 transitions. [2019-10-22 08:57:54,903 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-10-22 08:57:54,903 INFO L688 BuchiCegarLoop]: Abstraction has 13 states and 14 transitions. [2019-10-22 08:57:54,903 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13 states and 14 transitions. [2019-10-22 08:57:54,904 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13 to 12. [2019-10-22 08:57:54,904 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2019-10-22 08:57:54,904 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 13 transitions. [2019-10-22 08:57:54,904 INFO L711 BuchiCegarLoop]: Abstraction has 12 states and 13 transitions. [2019-10-22 08:57:54,904 INFO L591 BuchiCegarLoop]: Abstraction has 12 states and 13 transitions. [2019-10-22 08:57:54,905 INFO L424 BuchiCegarLoop]: ======== Iteration 4============ [2019-10-22 08:57:54,905 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 12 states and 13 transitions. [2019-10-22 08:57:54,905 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 9 [2019-10-22 08:57:54,905 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-10-22 08:57:54,905 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-10-22 08:57:54,906 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1] [2019-10-22 08:57:54,906 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [3, 3, 2, 1] [2019-10-22 08:57:54,906 INFO L791 eck$LassoCheckResult]: Stem: 143#ULTIMATE.startENTRY havoc main_#res;havoc main_#t~post1, main_#t~nondet0, main_~a~0, main_~len~0, main_~i~0;havoc main_~a~0;main_~len~0 := 0;havoc main_~i~0; 144#L19-2 assume !!(0 != main_#t~nondet0 % 256);havoc main_#t~nondet0; 152#L21 assume !(4 == main_~len~0 % 4294967296); 147#L21-2 [2019-10-22 08:57:54,906 INFO L793 eck$LassoCheckResult]: Loop: 147#L21-2 assume 0 <= (if main_~len~0 % 4294967296 % 4294967296 <= 2147483647 then main_~len~0 % 4294967296 % 4294967296 else main_~len~0 % 4294967296 % 4294967296 - 4294967296) && (if main_~len~0 % 4294967296 % 4294967296 <= 2147483647 then main_~len~0 % 4294967296 % 4294967296 else main_~len~0 % 4294967296 % 4294967296 - 4294967296) < 5;main_~a~0 := main_~a~0[(if main_~len~0 % 4294967296 % 4294967296 <= 2147483647 then main_~len~0 % 4294967296 % 4294967296 else main_~len~0 % 4294967296 % 4294967296 - 4294967296) := 0];main_#t~post1 := main_~len~0;main_~len~0 := 1 + main_#t~post1;havoc main_#t~post1; 145#L19-2 assume !!(0 != main_#t~nondet0 % 256);havoc main_#t~nondet0; 146#L21 assume !(4 == main_~len~0 % 4294967296); 150#L21-2 assume 0 <= (if main_~len~0 % 4294967296 % 4294967296 <= 2147483647 then main_~len~0 % 4294967296 % 4294967296 else main_~len~0 % 4294967296 % 4294967296 - 4294967296) && (if main_~len~0 % 4294967296 % 4294967296 <= 2147483647 then main_~len~0 % 4294967296 % 4294967296 else main_~len~0 % 4294967296 % 4294967296 - 4294967296) < 5;main_~a~0 := main_~a~0[(if main_~len~0 % 4294967296 % 4294967296 <= 2147483647 then main_~len~0 % 4294967296 % 4294967296 else main_~len~0 % 4294967296 % 4294967296 - 4294967296) := 0];main_#t~post1 := main_~len~0;main_~len~0 := 1 + main_#t~post1;havoc main_#t~post1; 151#L19-2 assume !!(0 != main_#t~nondet0 % 256);havoc main_#t~nondet0; 141#L21 assume !(4 == main_~len~0 % 4294967296); 142#L21-2 assume 0 <= (if main_~len~0 % 4294967296 % 4294967296 <= 2147483647 then main_~len~0 % 4294967296 % 4294967296 else main_~len~0 % 4294967296 % 4294967296 - 4294967296) && (if main_~len~0 % 4294967296 % 4294967296 <= 2147483647 then main_~len~0 % 4294967296 % 4294967296 else main_~len~0 % 4294967296 % 4294967296 - 4294967296) < 5;main_~a~0 := main_~a~0[(if main_~len~0 % 4294967296 % 4294967296 <= 2147483647 then main_~len~0 % 4294967296 % 4294967296 else main_~len~0 % 4294967296 % 4294967296 - 4294967296) := 0];main_#t~post1 := main_~len~0;main_~len~0 := 1 + main_#t~post1;havoc main_#t~post1; 149#L19-2 assume !!(0 != main_#t~nondet0 % 256);havoc main_#t~nondet0; 148#L21 assume 4 == main_~len~0 % 4294967296;main_~len~0 := 0; 147#L21-2 [2019-10-22 08:57:54,907 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:57:54,907 INFO L82 PathProgramCache]: Analyzing trace with hash 31077, now seen corresponding path program 3 times [2019-10-22 08:57:54,907 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:57:54,907 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1738906485] [2019-10-22 08:57:54,908 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:57:54,908 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:57:54,908 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:57:54,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:57:54,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:57:54,914 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-10-22 08:57:54,915 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:57:54,915 INFO L82 PathProgramCache]: Analyzing trace with hash 313813491, now seen corresponding path program 2 times [2019-10-22 08:57:54,915 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:57:54,915 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1934889094] [2019-10-22 08:57:54,915 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:57:54,915 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:57:54,915 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:57:54,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:57:54,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:57:54,945 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-10-22 08:57:54,945 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:57:54,945 INFO L82 PathProgramCache]: Analyzing trace with hash 903627023, now seen corresponding path program 3 times [2019-10-22 08:57:54,945 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:57:54,945 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [539173225] [2019-10-22 08:57:54,946 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:57:54,946 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:57:54,946 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:57:54,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:57:55,027 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 08:57:55,027 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [539173225] [2019-10-22 08:57:55,028 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1095916340] [2019-10-22 08:57:55,028 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_a69793a7-c23e-474f-8ebd-db0266489921/bin/uautomizer/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-22 08:57:55,072 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2019-10-22 08:57:55,072 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-22 08:57:55,073 INFO L256 TraceCheckSpWp]: Trace formula consists of 30 conjuncts, 10 conjunts are in the unsatisfiable core [2019-10-22 08:57:55,074 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-22 08:57:55,097 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 08:57:55,097 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-22 08:57:55,097 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 5 [2019-10-22 08:57:55,098 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1230065827] [2019-10-22 08:57:55,877 WARN L191 SmtUtils]: Spent 777.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 56 [2019-10-22 08:57:56,770 WARN L191 SmtUtils]: Spent 847.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 29 [2019-10-22 08:57:56,770 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 08:57:56,771 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-10-22 08:57:56,771 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-10-22 08:57:56,771 INFO L87 Difference]: Start difference. First operand 12 states and 13 transitions. cyclomatic complexity: 2 Second operand 7 states. [2019-10-22 08:57:56,817 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 08:57:56,817 INFO L93 Difference]: Finished difference Result 16 states and 17 transitions. [2019-10-22 08:57:56,818 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-10-22 08:57:56,818 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 16 states and 17 transitions. [2019-10-22 08:57:56,819 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 13 [2019-10-22 08:57:56,819 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 16 states to 16 states and 17 transitions. [2019-10-22 08:57:56,819 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 16 [2019-10-22 08:57:56,819 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 16 [2019-10-22 08:57:56,819 INFO L73 IsDeterministic]: Start isDeterministic. Operand 16 states and 17 transitions. [2019-10-22 08:57:56,820 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-10-22 08:57:56,820 INFO L688 BuchiCegarLoop]: Abstraction has 16 states and 17 transitions. [2019-10-22 08:57:56,820 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16 states and 17 transitions. [2019-10-22 08:57:56,821 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16 to 15. [2019-10-22 08:57:56,821 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2019-10-22 08:57:56,821 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 16 transitions. [2019-10-22 08:57:56,822 INFO L711 BuchiCegarLoop]: Abstraction has 15 states and 16 transitions. [2019-10-22 08:57:56,822 INFO L591 BuchiCegarLoop]: Abstraction has 15 states and 16 transitions. [2019-10-22 08:57:56,822 INFO L424 BuchiCegarLoop]: ======== Iteration 5============ [2019-10-22 08:57:56,822 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 15 states and 16 transitions. [2019-10-22 08:57:56,823 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 12 [2019-10-22 08:57:56,823 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-10-22 08:57:56,823 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-10-22 08:57:56,823 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1] [2019-10-22 08:57:56,823 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [4, 4, 3, 1] [2019-10-22 08:57:56,824 INFO L791 eck$LassoCheckResult]: Stem: 216#ULTIMATE.startENTRY havoc main_#res;havoc main_#t~post1, main_#t~nondet0, main_~a~0, main_~len~0, main_~i~0;havoc main_~a~0;main_~len~0 := 0;havoc main_~i~0; 217#L19-2 assume !!(0 != main_#t~nondet0 % 256);havoc main_#t~nondet0; 214#L21 assume !(4 == main_~len~0 % 4294967296); 215#L21-2 [2019-10-22 08:57:56,824 INFO L793 eck$LassoCheckResult]: Loop: 215#L21-2 assume 0 <= (if main_~len~0 % 4294967296 % 4294967296 <= 2147483647 then main_~len~0 % 4294967296 % 4294967296 else main_~len~0 % 4294967296 % 4294967296 - 4294967296) && (if main_~len~0 % 4294967296 % 4294967296 <= 2147483647 then main_~len~0 % 4294967296 % 4294967296 else main_~len~0 % 4294967296 % 4294967296 - 4294967296) < 5;main_~a~0 := main_~a~0[(if main_~len~0 % 4294967296 % 4294967296 <= 2147483647 then main_~len~0 % 4294967296 % 4294967296 else main_~len~0 % 4294967296 % 4294967296 - 4294967296) := 0];main_#t~post1 := main_~len~0;main_~len~0 := 1 + main_#t~post1;havoc main_#t~post1; 218#L19-2 assume !!(0 != main_#t~nondet0 % 256);havoc main_#t~nondet0; 228#L21 assume !(4 == main_~len~0 % 4294967296); 227#L21-2 assume 0 <= (if main_~len~0 % 4294967296 % 4294967296 <= 2147483647 then main_~len~0 % 4294967296 % 4294967296 else main_~len~0 % 4294967296 % 4294967296 - 4294967296) && (if main_~len~0 % 4294967296 % 4294967296 <= 2147483647 then main_~len~0 % 4294967296 % 4294967296 else main_~len~0 % 4294967296 % 4294967296 - 4294967296) < 5;main_~a~0 := main_~a~0[(if main_~len~0 % 4294967296 % 4294967296 <= 2147483647 then main_~len~0 % 4294967296 % 4294967296 else main_~len~0 % 4294967296 % 4294967296 - 4294967296) := 0];main_#t~post1 := main_~len~0;main_~len~0 := 1 + main_#t~post1;havoc main_#t~post1; 226#L19-2 assume !!(0 != main_#t~nondet0 % 256);havoc main_#t~nondet0; 225#L21 assume !(4 == main_~len~0 % 4294967296); 224#L21-2 assume 0 <= (if main_~len~0 % 4294967296 % 4294967296 <= 2147483647 then main_~len~0 % 4294967296 % 4294967296 else main_~len~0 % 4294967296 % 4294967296 - 4294967296) && (if main_~len~0 % 4294967296 % 4294967296 <= 2147483647 then main_~len~0 % 4294967296 % 4294967296 else main_~len~0 % 4294967296 % 4294967296 - 4294967296) < 5;main_~a~0 := main_~a~0[(if main_~len~0 % 4294967296 % 4294967296 <= 2147483647 then main_~len~0 % 4294967296 % 4294967296 else main_~len~0 % 4294967296 % 4294967296 - 4294967296) := 0];main_#t~post1 := main_~len~0;main_~len~0 := 1 + main_#t~post1;havoc main_#t~post1; 223#L19-2 assume !!(0 != main_#t~nondet0 % 256);havoc main_#t~nondet0; 222#L21 assume !(4 == main_~len~0 % 4294967296); 220#L21-2 assume 0 <= (if main_~len~0 % 4294967296 % 4294967296 <= 2147483647 then main_~len~0 % 4294967296 % 4294967296 else main_~len~0 % 4294967296 % 4294967296 - 4294967296) && (if main_~len~0 % 4294967296 % 4294967296 <= 2147483647 then main_~len~0 % 4294967296 % 4294967296 else main_~len~0 % 4294967296 % 4294967296 - 4294967296) < 5;main_~a~0 := main_~a~0[(if main_~len~0 % 4294967296 % 4294967296 <= 2147483647 then main_~len~0 % 4294967296 % 4294967296 else main_~len~0 % 4294967296 % 4294967296 - 4294967296) := 0];main_#t~post1 := main_~len~0;main_~len~0 := 1 + main_#t~post1;havoc main_#t~post1; 221#L19-2 assume !!(0 != main_#t~nondet0 % 256);havoc main_#t~nondet0; 219#L21 assume 4 == main_~len~0 % 4294967296;main_~len~0 := 0; 215#L21-2 [2019-10-22 08:57:56,824 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:57:56,824 INFO L82 PathProgramCache]: Analyzing trace with hash 31077, now seen corresponding path program 4 times [2019-10-22 08:57:56,824 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:57:56,825 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1469418095] [2019-10-22 08:57:56,825 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:57:56,825 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:57:56,825 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:57:56,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:57:56,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:57:56,831 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-10-22 08:57:56,831 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:57:56,831 INFO L82 PathProgramCache]: Analyzing trace with hash -1326016769, now seen corresponding path program 3 times [2019-10-22 08:57:56,831 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:57:56,831 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [721380060] [2019-10-22 08:57:56,831 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:57:56,832 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:57:56,832 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:57:56,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:57:56,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:57:56,865 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-10-22 08:57:56,866 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:57:56,866 INFO L82 PathProgramCache]: Analyzing trace with hash -902292893, now seen corresponding path program 4 times [2019-10-22 08:57:56,866 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:57:56,866 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2146383305] [2019-10-22 08:57:56,866 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:57:56,866 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:57:56,867 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:57:56,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:57:56,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:57:56,915 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-10-22 08:57:58,315 WARN L191 SmtUtils]: Spent 1.40 s on a formula simplification. DAG size of input: 85 DAG size of output: 70 [2019-10-22 08:57:59,675 WARN L191 SmtUtils]: Spent 1.26 s on a formula simplification. DAG size of input: 103 DAG size of output: 32 [2019-10-22 08:57:59,714 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 22.10 08:57:59 BoogieIcfgContainer [2019-10-22 08:57:59,714 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2019-10-22 08:57:59,715 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-10-22 08:57:59,715 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-10-22 08:57:59,715 INFO L275 PluginConnector]: Witness Printer initialized [2019-10-22 08:57:59,715 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.10 08:57:53" (3/4) ... [2019-10-22 08:57:59,717 INFO L134 WitnessPrinter]: Generating witness for non-termination counterexample [2019-10-22 08:57:59,756 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/working_dir_a69793a7-c23e-474f-8ebd-db0266489921/bin/uautomizer/witness.graphml [2019-10-22 08:57:59,756 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-10-22 08:57:59,757 INFO L168 Benchmark]: Toolchain (without parser) took 6879.58 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 113.2 MB). Free memory was 949.9 MB in the beginning and 867.0 MB in the end (delta: 82.9 MB). Peak memory consumption was 196.1 MB. Max. memory is 11.5 GB. [2019-10-22 08:57:59,757 INFO L168 Benchmark]: CDTParser took 0.15 ms. Allocated memory is still 1.0 GB. Free memory is still 967.3 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-10-22 08:57:59,757 INFO L168 Benchmark]: CACSL2BoogieTranslator took 238.75 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 113.2 MB). Free memory was 949.9 MB in the beginning and 1.1 GB in the end (delta: -152.1 MB). Peak memory consumption was 23.0 MB. Max. memory is 11.5 GB. [2019-10-22 08:57:59,758 INFO L168 Benchmark]: Boogie Procedure Inliner took 24.38 ms. Allocated memory is still 1.1 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-10-22 08:57:59,758 INFO L168 Benchmark]: Boogie Preprocessor took 16.72 ms. Allocated memory is still 1.1 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-10-22 08:57:59,758 INFO L168 Benchmark]: RCFGBuilder took 235.69 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 15.3 MB). Peak memory consumption was 15.3 MB. Max. memory is 11.5 GB. [2019-10-22 08:57:59,759 INFO L168 Benchmark]: BuchiAutomizer took 6319.06 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 867.0 MB in the end (delta: 219.8 MB). Peak memory consumption was 219.8 MB. Max. memory is 11.5 GB. [2019-10-22 08:57:59,759 INFO L168 Benchmark]: Witness Printer took 41.33 ms. Allocated memory is still 1.1 GB. Free memory is still 867.0 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-10-22 08:57:59,760 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.15 ms. Allocated memory is still 1.0 GB. Free memory is still 967.3 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 238.75 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 113.2 MB). Free memory was 949.9 MB in the beginning and 1.1 GB in the end (delta: -152.1 MB). Peak memory consumption was 23.0 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 24.38 ms. Allocated memory is still 1.1 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * Boogie Preprocessor took 16.72 ms. Allocated memory is still 1.1 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 235.69 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 15.3 MB). Peak memory consumption was 15.3 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 6319.06 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 867.0 MB in the end (delta: 219.8 MB). Peak memory consumption was 219.8 MB. Max. memory is 11.5 GB. * Witness Printer took 41.33 ms. Allocated memory is still 1.1 GB. Free memory is still 867.0 MB. 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 4 terminating modules (4 trivial, 0 deterministic, 0 nondeterministic) and one nonterminating remainder module.4 modules have a trivial ranking function, the largest among these consists of 7 locations. The remainder module has 15 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 6.2s and 5 iterations. TraceHistogramMax:4. Analysis of lassos took 5.9s. Construction of modules took 0.0s. Büchi inclusion checks took 0.0s. Highest rank in rank-based complementation 0. Minimization of det autom 4. Minimization of nondet autom 0. Automata minimization 0.0s AutomataMinimizationTime, 4 MinimizatonAttempts, 4 StatesRemovedByMinimization, 4 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had 15 states and ocurred in iteration 4. Nontrivial modules had stage [0, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 24 SDtfs, 18 SDslu, 30 SDs, 0 SdLazy, 84 SolverSat, 10 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.0s Time LassoAnalysisResults: nont1 unkn0 SFLI0 SFLT0 conc4 concLT0 SILN0 SILU0 SILI0 SILT0 lasso0 LassoPreprocessingBenchmarks: LassoTerminationAnalysisBenchmarks: not availableLassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 0 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 0 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.0s - TerminationAnalysisResult: Nontermination possible Buchi Automizer proved that your program is nonterminating for some inputs - FixpointNonTerminationResult [Line: 19]: Nontermination argument in form of an infinite program execution. Nontermination argument in form of an infinite execution State at position 0 is {} State at position 1 is {len=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@153fa678=1, \result=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTUnaryExpression@613ababb=0, i=0} - StatisticsResult: NonterminationArgumentStatistics Fixpoint - NonterminatingLassoResult [Line: 21]: Nonterminating execution Found a nonterminating execution for the following lasso shaped sequence of statements. Stem: [L13] int a[5]; [L14] unsigned int len=0; [L16] int i; [L19] COND TRUE __VERIFIER_nondet_bool() [L21] COND FALSE !(len==4) Loop: [L24] EXPR a[len] [L24] a[len]=0 [L26] len++ [L19] COND TRUE __VERIFIER_nondet_bool() [L21] COND FALSE !(len==4) [L24] EXPR a[len] [L24] a[len]=0 [L26] len++ [L19] COND TRUE __VERIFIER_nondet_bool() [L21] COND FALSE !(len==4) [L24] EXPR a[len] [L24] a[len]=0 [L26] len++ [L19] COND TRUE __VERIFIER_nondet_bool() [L21] COND FALSE !(len==4) [L24] EXPR a[len] [L24] a[len]=0 [L26] len++ [L19] COND TRUE __VERIFIER_nondet_bool() [L21] COND TRUE len==4 [L22] len =0 End of lasso representation. RESULT: Ultimate proved your program to be incorrect! Received shutdown request...