./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/bitvector/interleave_bits.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability 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/run_dir_5d8e64fa-ebcf-4790-b71f-ba94ff809f7c/bin/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/run_dir_5d8e64fa-ebcf-4790-b71f-ba94ff809f7c/bin/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_5d8e64fa-ebcf-4790-b71f-ba94ff809f7c/bin/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_5d8e64fa-ebcf-4790-b71f-ba94ff809f7c/bin/uautomizer/config/AutomizerReach.xml -i ../../sv-benchmarks/c/bitvector/interleave_bits.i -s /tmp/vcloud-vcloud-master/worker/run_dir_5d8e64fa-ebcf-4790-b71f-ba94ff809f7c/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_5d8e64fa-ebcf-4790-b71f-ba94ff809f7c/bin/uautomizer --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(__VERIFIER_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash a69112b8d023c6203418abb04301ebe890b3a5f5 ............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................. Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis Calling Ultimate with: /usr/lib/jvm/java-8-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/run_dir_5d8e64fa-ebcf-4790-b71f-ba94ff809f7c/bin/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/run_dir_5d8e64fa-ebcf-4790-b71f-ba94ff809f7c/bin/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_5d8e64fa-ebcf-4790-b71f-ba94ff809f7c/bin/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_5d8e64fa-ebcf-4790-b71f-ba94ff809f7c/bin/uautomizer/config/AutomizerReach.xml -i ../../sv-benchmarks/c/bitvector/interleave_bits.i -s /tmp/vcloud-vcloud-master/worker/run_dir_5d8e64fa-ebcf-4790-b71f-ba94ff809f7c/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_5d8e64fa-ebcf-4790-b71f-ba94ff809f7c/bin/uautomizer --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(__VERIFIER_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash a69112b8d023c6203418abb04301ebe890b3a5f5 ...................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.24-cad4683 [2019-11-16 00:19:40,697 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-16 00:19:40,699 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-16 00:19:40,713 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-16 00:19:40,713 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-16 00:19:40,714 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-16 00:19:40,716 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-16 00:19:40,725 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-16 00:19:40,730 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-16 00:19:40,734 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-16 00:19:40,735 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-16 00:19:40,737 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-16 00:19:40,737 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-16 00:19:40,739 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-16 00:19:40,740 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-16 00:19:40,741 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-16 00:19:40,742 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-16 00:19:40,743 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-16 00:19:40,745 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-16 00:19:40,748 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-16 00:19:40,752 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-16 00:19:40,753 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-16 00:19:40,756 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-16 00:19:40,757 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-16 00:19:40,760 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-16 00:19:40,760 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-16 00:19:40,761 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-16 00:19:40,762 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-16 00:19:40,762 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-16 00:19:40,763 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-16 00:19:40,763 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-16 00:19:40,764 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-16 00:19:40,765 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-16 00:19:40,765 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-16 00:19:40,767 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-16 00:19:40,767 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-16 00:19:40,768 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-16 00:19:40,768 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-16 00:19:40,768 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-16 00:19:40,769 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-16 00:19:40,769 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-16 00:19:40,770 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_5d8e64fa-ebcf-4790-b71f-ba94ff809f7c/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf [2019-11-16 00:19:40,794 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-16 00:19:40,804 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-16 00:19:40,805 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-16 00:19:40,805 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-16 00:19:40,805 INFO L138 SettingsManager]: * Use SBE=true [2019-11-16 00:19:40,806 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-16 00:19:40,806 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-16 00:19:40,806 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-16 00:19:40,806 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-16 00:19:40,806 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-16 00:19:40,807 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-11-16 00:19:40,807 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-16 00:19:40,807 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-11-16 00:19:40,807 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-16 00:19:40,808 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-16 00:19:40,809 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-16 00:19:40,809 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-11-16 00:19:40,809 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-16 00:19:40,809 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-16 00:19:40,810 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-16 00:19:40,810 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-16 00:19:40,810 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-16 00:19:40,810 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-16 00:19:40,811 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-16 00:19:40,811 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-11-16 00:19:40,811 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-11-16 00:19:40,811 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-11-16 00:19:40,812 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-11-16 00:19:40,812 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /tmp/vcloud-vcloud-master/worker/run_dir_5d8e64fa-ebcf-4790-b71f-ba94ff809f7c/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(G ! call(__VERIFIER_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> a69112b8d023c6203418abb04301ebe890b3a5f5 [2019-11-16 00:19:40,845 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-16 00:19:40,861 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-16 00:19:40,864 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-16 00:19:40,866 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-16 00:19:40,866 INFO L275 PluginConnector]: CDTParser initialized [2019-11-16 00:19:40,867 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_5d8e64fa-ebcf-4790-b71f-ba94ff809f7c/bin/uautomizer/../../sv-benchmarks/c/bitvector/interleave_bits.i [2019-11-16 00:19:40,925 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_5d8e64fa-ebcf-4790-b71f-ba94ff809f7c/bin/uautomizer/data/d09170989/3f34ce453f65436e845d3a413b965095/FLAGbc2f5c4d2 [2019-11-16 00:19:41,338 INFO L306 CDTParser]: Found 1 translation units. [2019-11-16 00:19:41,339 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_5d8e64fa-ebcf-4790-b71f-ba94ff809f7c/sv-benchmarks/c/bitvector/interleave_bits.i [2019-11-16 00:19:41,345 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_5d8e64fa-ebcf-4790-b71f-ba94ff809f7c/bin/uautomizer/data/d09170989/3f34ce453f65436e845d3a413b965095/FLAGbc2f5c4d2 [2019-11-16 00:19:41,729 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_5d8e64fa-ebcf-4790-b71f-ba94ff809f7c/bin/uautomizer/data/d09170989/3f34ce453f65436e845d3a413b965095 [2019-11-16 00:19:41,732 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-16 00:19:41,733 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-11-16 00:19:41,734 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-16 00:19:41,734 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-16 00:19:41,737 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-16 00:19:41,738 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.11 12:19:41" (1/1) ... [2019-11-16 00:19:41,741 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@43625fe and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:19:41, skipping insertion in model container [2019-11-16 00:19:41,741 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.11 12:19:41" (1/1) ... [2019-11-16 00:19:41,747 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-11-16 00:19:41,763 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-11-16 00:19:41,974 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-16 00:19:41,982 INFO L188 MainTranslator]: Completed pre-run [2019-11-16 00:19:42,014 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-16 00:19:42,025 INFO L192 MainTranslator]: Completed translation [2019-11-16 00:19:42,025 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:19:42 WrapperNode [2019-11-16 00:19:42,025 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-16 00:19:42,026 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-11-16 00:19:42,026 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-11-16 00:19:42,026 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-11-16 00:19:42,033 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:19:42" (1/1) ... [2019-11-16 00:19:42,038 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:19:42" (1/1) ... [2019-11-16 00:19:42,055 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-11-16 00:19:42,055 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-16 00:19:42,055 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-16 00:19:42,055 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-16 00:19:42,064 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:19:42" (1/1) ... [2019-11-16 00:19:42,064 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:19:42" (1/1) ... [2019-11-16 00:19:42,065 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:19:42" (1/1) ... [2019-11-16 00:19:42,065 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:19:42" (1/1) ... [2019-11-16 00:19:42,069 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:19:42" (1/1) ... [2019-11-16 00:19:42,083 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:19:42" (1/1) ... [2019-11-16 00:19:42,085 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:19:42" (1/1) ... [2019-11-16 00:19:42,089 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-16 00:19:42,089 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-16 00:19:42,090 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-16 00:19:42,090 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-16 00:19:42,091 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:19:42" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_5d8e64fa-ebcf-4790-b71f-ba94ff809f7c/bin/uautomizer/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-16 00:19:42,156 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-16 00:19:42,156 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-16 00:19:42,318 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-16 00:19:42,319 INFO L284 CfgBuilder]: Removed 7 assume(true) statements. [2019-11-16 00:19:42,320 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.11 12:19:42 BoogieIcfgContainer [2019-11-16 00:19:42,320 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-16 00:19:42,321 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-16 00:19:42,321 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-16 00:19:42,324 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-16 00:19:42,325 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 16.11 12:19:41" (1/3) ... [2019-11-16 00:19:42,326 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2f286450 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.11 12:19:42, skipping insertion in model container [2019-11-16 00:19:42,326 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:19:42" (2/3) ... [2019-11-16 00:19:42,327 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2f286450 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.11 12:19:42, skipping insertion in model container [2019-11-16 00:19:42,327 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.11 12:19:42" (3/3) ... [2019-11-16 00:19:42,329 INFO L109 eAbstractionObserver]: Analyzing ICFG interleave_bits.i [2019-11-16 00:19:42,338 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-16 00:19:42,345 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-11-16 00:19:42,356 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-11-16 00:19:42,377 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-16 00:19:42,377 INFO L374 AbstractCegarLoop]: Hoare is true [2019-11-16 00:19:42,377 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-16 00:19:42,378 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-16 00:19:42,378 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-16 00:19:42,378 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-16 00:19:42,378 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-16 00:19:42,378 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-16 00:19:42,391 INFO L276 IsEmpty]: Start isEmpty. Operand 9 states. [2019-11-16 00:19:42,396 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-11-16 00:19:42,397 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:19:42,398 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-11-16 00:19:42,399 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:19:42,405 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:19:42,405 INFO L82 PathProgramCache]: Analyzing trace with hash 29805000, now seen corresponding path program 1 times [2019-11-16 00:19:42,413 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:19:42,414 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [89334792] [2019-11-16 00:19:42,414 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:19:42,414 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:19:42,414 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:19:42,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:19:42,691 WARN L191 SmtUtils]: Spent 117.00 ms on a formula simplification. DAG size of input: 13 DAG size of output: 5 [2019-11-16 00:19:42,693 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-16 00:19:42,694 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [89334792] [2019-11-16 00:19:42,695 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:19:42,696 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-16 00:19:42,696 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [863530837] [2019-11-16 00:19:42,700 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-16 00:19:42,701 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:19:42,711 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-16 00:19:42,711 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-16 00:19:42,713 INFO L87 Difference]: Start difference. First operand 9 states. Second operand 3 states. [2019-11-16 00:19:42,735 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:19:42,735 INFO L93 Difference]: Finished difference Result 17 states and 21 transitions. [2019-11-16 00:19:42,736 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-16 00:19:42,737 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 5 [2019-11-16 00:19:42,737 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:19:42,743 INFO L225 Difference]: With dead ends: 17 [2019-11-16 00:19:42,743 INFO L226 Difference]: Without dead ends: 7 [2019-11-16 00:19:42,746 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-16 00:19:42,759 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7 states. [2019-11-16 00:19:42,777 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7 to 7. [2019-11-16 00:19:42,778 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2019-11-16 00:19:42,778 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 7 transitions. [2019-11-16 00:19:42,779 INFO L78 Accepts]: Start accepts. Automaton has 7 states and 7 transitions. Word has length 5 [2019-11-16 00:19:42,779 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:19:42,779 INFO L462 AbstractCegarLoop]: Abstraction has 7 states and 7 transitions. [2019-11-16 00:19:42,779 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-16 00:19:42,779 INFO L276 IsEmpty]: Start isEmpty. Operand 7 states and 7 transitions. [2019-11-16 00:19:42,780 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-11-16 00:19:42,780 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:19:42,780 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2019-11-16 00:19:42,780 INFO L410 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:19:42,780 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:19:42,781 INFO L82 PathProgramCache]: Analyzing trace with hash 925620370, now seen corresponding path program 1 times [2019-11-16 00:19:42,781 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:19:42,781 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1026259705] [2019-11-16 00:19:42,781 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:19:42,781 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:19:42,781 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:19:42,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:19:42,858 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-16 00:19:42,859 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1026259705] [2019-11-16 00:19:42,859 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1027030088] [2019-11-16 00:19:42,859 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_5d8e64fa-ebcf-4790-b71f-ba94ff809f7c/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-11-16 00:19:42,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:19:42,904 INFO L256 TraceCheckSpWp]: Trace formula consists of 21 conjuncts, 5 conjunts are in the unsatisfiable core [2019-11-16 00:19:42,908 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-16 00:19:42,948 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-16 00:19:42,948 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-16 00:19:42,949 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3] total 4 [2019-11-16 00:19:42,949 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [362460302] [2019-11-16 00:19:42,950 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-16 00:19:42,950 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:19:42,951 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-16 00:19:42,951 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-16 00:19:42,951 INFO L87 Difference]: Start difference. First operand 7 states and 7 transitions. Second operand 5 states. [2019-11-16 00:19:42,965 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:19:42,965 INFO L93 Difference]: Finished difference Result 12 states and 12 transitions. [2019-11-16 00:19:42,965 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-16 00:19:42,965 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 6 [2019-11-16 00:19:42,966 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:19:42,966 INFO L225 Difference]: With dead ends: 12 [2019-11-16 00:19:42,966 INFO L226 Difference]: Without dead ends: 8 [2019-11-16 00:19:42,967 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 4 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-16 00:19:42,967 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8 states. [2019-11-16 00:19:42,968 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8 to 8. [2019-11-16 00:19:42,968 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2019-11-16 00:19:42,969 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 8 transitions. [2019-11-16 00:19:42,969 INFO L78 Accepts]: Start accepts. Automaton has 8 states and 8 transitions. Word has length 6 [2019-11-16 00:19:42,969 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:19:42,969 INFO L462 AbstractCegarLoop]: Abstraction has 8 states and 8 transitions. [2019-11-16 00:19:42,969 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-16 00:19:42,969 INFO L276 IsEmpty]: Start isEmpty. Operand 8 states and 8 transitions. [2019-11-16 00:19:42,970 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-11-16 00:19:42,970 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:19:42,970 INFO L380 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1] [2019-11-16 00:19:43,174 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-16 00:19:43,174 INFO L410 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:19:43,174 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:19:43,175 INFO L82 PathProgramCache]: Analyzing trace with hash -1368874232, now seen corresponding path program 2 times [2019-11-16 00:19:43,175 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:19:43,175 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1965617070] [2019-11-16 00:19:43,175 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:19:43,175 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:19:43,176 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:19:43,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:19:43,288 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-16 00:19:43,289 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1965617070] [2019-11-16 00:19:43,289 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1153164021] [2019-11-16 00:19:43,289 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_5d8e64fa-ebcf-4790-b71f-ba94ff809f7c/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-11-16 00:19:43,314 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-11-16 00:19:43,314 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-16 00:19:43,315 INFO L256 TraceCheckSpWp]: Trace formula consists of 24 conjuncts, 7 conjunts are in the unsatisfiable core [2019-11-16 00:19:43,316 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-16 00:19:43,371 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-16 00:19:43,371 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-16 00:19:43,371 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 5 [2019-11-16 00:19:43,371 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1007150306] [2019-11-16 00:19:43,372 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-16 00:19:43,372 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:19:43,372 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-16 00:19:43,373 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2019-11-16 00:19:43,373 INFO L87 Difference]: Start difference. First operand 8 states and 8 transitions. Second operand 6 states. [2019-11-16 00:19:43,413 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:19:43,413 INFO L93 Difference]: Finished difference Result 13 states and 13 transitions. [2019-11-16 00:19:43,414 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-16 00:19:43,414 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 7 [2019-11-16 00:19:43,414 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:19:43,414 INFO L225 Difference]: With dead ends: 13 [2019-11-16 00:19:43,414 INFO L226 Difference]: Without dead ends: 9 [2019-11-16 00:19:43,415 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 5 SyntacticMatches, 1 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2019-11-16 00:19:43,415 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9 states. [2019-11-16 00:19:43,417 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9 to 9. [2019-11-16 00:19:43,417 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2019-11-16 00:19:43,417 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 9 transitions. [2019-11-16 00:19:43,418 INFO L78 Accepts]: Start accepts. Automaton has 9 states and 9 transitions. Word has length 7 [2019-11-16 00:19:43,418 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:19:43,418 INFO L462 AbstractCegarLoop]: Abstraction has 9 states and 9 transitions. [2019-11-16 00:19:43,418 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-16 00:19:43,418 INFO L276 IsEmpty]: Start isEmpty. Operand 9 states and 9 transitions. [2019-11-16 00:19:43,418 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2019-11-16 00:19:43,419 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:19:43,419 INFO L380 BasicCegarLoop]: trace histogram [3, 1, 1, 1, 1, 1] [2019-11-16 00:19:43,631 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-16 00:19:43,631 INFO L410 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:19:43,632 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:19:43,632 INFO L82 PathProgramCache]: Analyzing trace with hash 516237138, now seen corresponding path program 3 times [2019-11-16 00:19:43,632 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:19:43,632 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1765630678] [2019-11-16 00:19:43,632 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:19:43,632 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:19:43,632 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:19:43,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:19:43,743 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-16 00:19:43,743 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1765630678] [2019-11-16 00:19:43,743 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1542468731] [2019-11-16 00:19:43,743 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_5d8e64fa-ebcf-4790-b71f-ba94ff809f7c/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-11-16 00:19:43,769 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2019-11-16 00:19:43,769 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-16 00:19:43,770 INFO L256 TraceCheckSpWp]: Trace formula consists of 27 conjuncts, 9 conjunts are in the unsatisfiable core [2019-11-16 00:19:43,771 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-16 00:19:43,809 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-16 00:19:43,810 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-16 00:19:43,810 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 6 [2019-11-16 00:19:43,810 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1120527259] [2019-11-16 00:19:43,811 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-11-16 00:19:43,811 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:19:43,811 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-11-16 00:19:43,812 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-11-16 00:19:43,812 INFO L87 Difference]: Start difference. First operand 9 states and 9 transitions. Second operand 7 states. [2019-11-16 00:19:43,854 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:19:43,854 INFO L93 Difference]: Finished difference Result 14 states and 14 transitions. [2019-11-16 00:19:43,855 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-16 00:19:43,856 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 8 [2019-11-16 00:19:43,856 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:19:43,856 INFO L225 Difference]: With dead ends: 14 [2019-11-16 00:19:43,856 INFO L226 Difference]: Without dead ends: 10 [2019-11-16 00:19:43,857 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 6 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-11-16 00:19:43,857 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10 states. [2019-11-16 00:19:43,859 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10 to 10. [2019-11-16 00:19:43,859 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2019-11-16 00:19:43,859 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 10 transitions. [2019-11-16 00:19:43,860 INFO L78 Accepts]: Start accepts. Automaton has 10 states and 10 transitions. Word has length 8 [2019-11-16 00:19:43,860 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:19:43,860 INFO L462 AbstractCegarLoop]: Abstraction has 10 states and 10 transitions. [2019-11-16 00:19:43,860 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-11-16 00:19:43,860 INFO L276 IsEmpty]: Start isEmpty. Operand 10 states and 10 transitions. [2019-11-16 00:19:43,861 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2019-11-16 00:19:43,861 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:19:43,861 INFO L380 BasicCegarLoop]: trace histogram [4, 1, 1, 1, 1, 1] [2019-11-16 00:19:44,061 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-16 00:19:44,062 INFO L410 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:19:44,062 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:19:44,062 INFO L82 PathProgramCache]: Analyzing trace with hash -1174852536, now seen corresponding path program 4 times [2019-11-16 00:19:44,062 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:19:44,062 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1423872933] [2019-11-16 00:19:44,062 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:19:44,062 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:19:44,063 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:19:44,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:19:44,157 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-16 00:19:44,157 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1423872933] [2019-11-16 00:19:44,158 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1222092213] [2019-11-16 00:19:44,158 INFO L92 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_5d8e64fa-ebcf-4790-b71f-ba94ff809f7c/bin/uautomizer/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-16 00:19:44,199 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-11-16 00:19:44,199 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-16 00:19:44,200 INFO L256 TraceCheckSpWp]: Trace formula consists of 30 conjuncts, 11 conjunts are in the unsatisfiable core [2019-11-16 00:19:44,201 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-16 00:19:44,229 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-16 00:19:44,230 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-16 00:19:44,230 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 7 [2019-11-16 00:19:44,230 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1339547362] [2019-11-16 00:19:44,231 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-11-16 00:19:44,231 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:19:44,231 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-11-16 00:19:44,231 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2019-11-16 00:19:44,231 INFO L87 Difference]: Start difference. First operand 10 states and 10 transitions. Second operand 8 states. [2019-11-16 00:19:44,273 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:19:44,273 INFO L93 Difference]: Finished difference Result 15 states and 15 transitions. [2019-11-16 00:19:44,273 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-11-16 00:19:44,273 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 9 [2019-11-16 00:19:44,274 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:19:44,274 INFO L225 Difference]: With dead ends: 15 [2019-11-16 00:19:44,274 INFO L226 Difference]: Without dead ends: 11 [2019-11-16 00:19:44,275 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 7 SyntacticMatches, 1 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2019-11-16 00:19:44,275 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11 states. [2019-11-16 00:19:44,277 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11 to 11. [2019-11-16 00:19:44,277 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2019-11-16 00:19:44,277 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 11 transitions. [2019-11-16 00:19:44,278 INFO L78 Accepts]: Start accepts. Automaton has 11 states and 11 transitions. Word has length 9 [2019-11-16 00:19:44,278 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:19:44,278 INFO L462 AbstractCegarLoop]: Abstraction has 11 states and 11 transitions. [2019-11-16 00:19:44,278 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-11-16 00:19:44,278 INFO L276 IsEmpty]: Start isEmpty. Operand 11 states and 11 transitions. [2019-11-16 00:19:44,278 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2019-11-16 00:19:44,279 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:19:44,279 INFO L380 BasicCegarLoop]: trace histogram [5, 1, 1, 1, 1, 1] [2019-11-16 00:19:44,485 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-16 00:19:44,485 INFO L410 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:19:44,485 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:19:44,485 INFO L82 PathProgramCache]: Analyzing trace with hash -2059024878, now seen corresponding path program 5 times [2019-11-16 00:19:44,486 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:19:44,486 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [68517796] [2019-11-16 00:19:44,486 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:19:44,486 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:19:44,486 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:19:44,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:19:44,629 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-16 00:19:44,630 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [68517796] [2019-11-16 00:19:44,630 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [22262606] [2019-11-16 00:19:44,630 INFO L92 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_5d8e64fa-ebcf-4790-b71f-ba94ff809f7c/bin/uautomizer/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-16 00:19:44,677 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) [2019-11-16 00:19:44,678 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-16 00:19:44,679 INFO L256 TraceCheckSpWp]: Trace formula consists of 33 conjuncts, 13 conjunts are in the unsatisfiable core [2019-11-16 00:19:44,680 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-16 00:19:44,700 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-16 00:19:44,701 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-16 00:19:44,701 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 8 [2019-11-16 00:19:44,701 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [811906445] [2019-11-16 00:19:44,702 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-11-16 00:19:44,702 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:19:44,702 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-11-16 00:19:44,702 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2019-11-16 00:19:44,702 INFO L87 Difference]: Start difference. First operand 11 states and 11 transitions. Second operand 9 states. [2019-11-16 00:19:44,751 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:19:44,751 INFO L93 Difference]: Finished difference Result 16 states and 16 transitions. [2019-11-16 00:19:44,752 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-11-16 00:19:44,752 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 10 [2019-11-16 00:19:44,752 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:19:44,753 INFO L225 Difference]: With dead ends: 16 [2019-11-16 00:19:44,753 INFO L226 Difference]: Without dead ends: 12 [2019-11-16 00:19:44,753 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 8 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2019-11-16 00:19:44,754 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12 states. [2019-11-16 00:19:44,755 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12 to 12. [2019-11-16 00:19:44,756 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2019-11-16 00:19:44,756 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 12 transitions. [2019-11-16 00:19:44,756 INFO L78 Accepts]: Start accepts. Automaton has 12 states and 12 transitions. Word has length 10 [2019-11-16 00:19:44,756 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:19:44,757 INFO L462 AbstractCegarLoop]: Abstraction has 12 states and 12 transitions. [2019-11-16 00:19:44,757 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-11-16 00:19:44,757 INFO L276 IsEmpty]: Start isEmpty. Operand 12 states and 12 transitions. [2019-11-16 00:19:44,757 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-11-16 00:19:44,757 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:19:44,757 INFO L380 BasicCegarLoop]: trace histogram [6, 1, 1, 1, 1, 1] [2019-11-16 00:19:44,964 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-16 00:19:44,964 INFO L410 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:19:44,965 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:19:44,965 INFO L82 PathProgramCache]: Analyzing trace with hash 596403592, now seen corresponding path program 6 times [2019-11-16 00:19:44,965 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:19:44,965 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [802012450] [2019-11-16 00:19:44,966 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:19:44,966 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:19:44,966 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:19:44,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:19:45,094 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-16 00:19:45,094 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [802012450] [2019-11-16 00:19:45,094 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [259564830] [2019-11-16 00:19:45,095 INFO L92 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_5d8e64fa-ebcf-4790-b71f-ba94ff809f7c/bin/uautomizer/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-16 00:19:45,135 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 4 check-sat command(s) [2019-11-16 00:19:45,135 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-16 00:19:45,136 INFO L256 TraceCheckSpWp]: Trace formula consists of 36 conjuncts, 15 conjunts are in the unsatisfiable core [2019-11-16 00:19:45,137 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-16 00:19:45,167 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-16 00:19:45,167 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-16 00:19:45,167 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 9 [2019-11-16 00:19:45,168 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2094690244] [2019-11-16 00:19:45,168 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-11-16 00:19:45,168 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:19:45,169 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-11-16 00:19:45,169 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2019-11-16 00:19:45,169 INFO L87 Difference]: Start difference. First operand 12 states and 12 transitions. Second operand 10 states. [2019-11-16 00:19:45,239 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:19:45,239 INFO L93 Difference]: Finished difference Result 17 states and 17 transitions. [2019-11-16 00:19:45,243 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-11-16 00:19:45,243 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 11 [2019-11-16 00:19:45,243 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:19:45,244 INFO L225 Difference]: With dead ends: 17 [2019-11-16 00:19:45,244 INFO L226 Difference]: Without dead ends: 13 [2019-11-16 00:19:45,244 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 9 SyntacticMatches, 1 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2019-11-16 00:19:45,245 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13 states. [2019-11-16 00:19:45,247 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13 to 13. [2019-11-16 00:19:45,247 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2019-11-16 00:19:45,247 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 13 transitions. [2019-11-16 00:19:45,247 INFO L78 Accepts]: Start accepts. Automaton has 13 states and 13 transitions. Word has length 11 [2019-11-16 00:19:45,248 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:19:45,248 INFO L462 AbstractCegarLoop]: Abstraction has 13 states and 13 transitions. [2019-11-16 00:19:45,248 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-11-16 00:19:45,248 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 13 transitions. [2019-11-16 00:19:45,248 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2019-11-16 00:19:45,251 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:19:45,251 INFO L380 BasicCegarLoop]: trace histogram [7, 1, 1, 1, 1, 1] [2019-11-16 00:19:45,454 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-16 00:19:45,455 INFO L410 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:19:45,455 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:19:45,455 INFO L82 PathProgramCache]: Analyzing trace with hash 1310307538, now seen corresponding path program 7 times [2019-11-16 00:19:45,455 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:19:45,456 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1163499286] [2019-11-16 00:19:45,456 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:19:45,456 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:19:45,456 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:19:45,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:19:45,593 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-16 00:19:45,593 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1163499286] [2019-11-16 00:19:45,593 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1430203817] [2019-11-16 00:19:45,594 INFO L92 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_5d8e64fa-ebcf-4790-b71f-ba94ff809f7c/bin/uautomizer/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-16 00:19:45,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:19:45,623 INFO L256 TraceCheckSpWp]: Trace formula consists of 39 conjuncts, 17 conjunts are in the unsatisfiable core [2019-11-16 00:19:45,624 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-16 00:19:45,674 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-16 00:19:45,674 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-16 00:19:45,674 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 10 [2019-11-16 00:19:45,674 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1989847663] [2019-11-16 00:19:45,674 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-11-16 00:19:45,675 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:19:45,675 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-11-16 00:19:45,675 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2019-11-16 00:19:45,675 INFO L87 Difference]: Start difference. First operand 13 states and 13 transitions. Second operand 11 states. [2019-11-16 00:19:45,733 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:19:45,733 INFO L93 Difference]: Finished difference Result 18 states and 18 transitions. [2019-11-16 00:19:45,733 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-11-16 00:19:45,733 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 12 [2019-11-16 00:19:45,734 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:19:45,734 INFO L225 Difference]: With dead ends: 18 [2019-11-16 00:19:45,734 INFO L226 Difference]: Without dead ends: 14 [2019-11-16 00:19:45,735 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 10 SyntacticMatches, 1 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2019-11-16 00:19:45,735 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14 states. [2019-11-16 00:19:45,737 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14 to 14. [2019-11-16 00:19:45,737 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2019-11-16 00:19:45,738 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 14 transitions. [2019-11-16 00:19:45,738 INFO L78 Accepts]: Start accepts. Automaton has 14 states and 14 transitions. Word has length 12 [2019-11-16 00:19:45,738 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:19:45,738 INFO L462 AbstractCegarLoop]: Abstraction has 14 states and 14 transitions. [2019-11-16 00:19:45,738 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-11-16 00:19:45,738 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 14 transitions. [2019-11-16 00:19:45,739 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-11-16 00:19:45,739 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:19:45,739 INFO L380 BasicCegarLoop]: trace histogram [8, 1, 1, 1, 1, 1] [2019-11-16 00:19:45,943 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-16 00:19:45,943 INFO L410 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:19:45,943 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:19:45,944 INFO L82 PathProgramCache]: Analyzing trace with hash 1966493384, now seen corresponding path program 8 times [2019-11-16 00:19:45,944 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:19:45,944 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [56852124] [2019-11-16 00:19:45,944 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:19:45,944 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:19:45,944 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:19:45,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:19:46,132 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-16 00:19:46,132 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [56852124] [2019-11-16 00:19:46,133 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [333238777] [2019-11-16 00:19:46,133 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_5d8e64fa-ebcf-4790-b71f-ba94ff809f7c/bin/uautomizer/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-16 00:19:46,165 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-11-16 00:19:46,165 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-16 00:19:46,166 INFO L256 TraceCheckSpWp]: Trace formula consists of 42 conjuncts, 19 conjunts are in the unsatisfiable core [2019-11-16 00:19:46,167 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-16 00:19:46,195 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-16 00:19:46,195 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-16 00:19:46,195 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 11 [2019-11-16 00:19:46,195 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1443651701] [2019-11-16 00:19:46,196 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-11-16 00:19:46,196 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:19:46,196 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-11-16 00:19:46,196 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=102, Unknown=0, NotChecked=0, Total=132 [2019-11-16 00:19:46,197 INFO L87 Difference]: Start difference. First operand 14 states and 14 transitions. Second operand 12 states. [2019-11-16 00:19:46,265 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:19:46,265 INFO L93 Difference]: Finished difference Result 19 states and 19 transitions. [2019-11-16 00:19:46,266 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-11-16 00:19:46,266 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 13 [2019-11-16 00:19:46,266 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:19:46,266 INFO L225 Difference]: With dead ends: 19 [2019-11-16 00:19:46,267 INFO L226 Difference]: Without dead ends: 15 [2019-11-16 00:19:46,267 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 11 SyntacticMatches, 1 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=30, Invalid=102, Unknown=0, NotChecked=0, Total=132 [2019-11-16 00:19:46,267 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15 states. [2019-11-16 00:19:46,269 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15 to 15. [2019-11-16 00:19:46,269 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2019-11-16 00:19:46,270 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 15 transitions. [2019-11-16 00:19:46,270 INFO L78 Accepts]: Start accepts. Automaton has 15 states and 15 transitions. Word has length 13 [2019-11-16 00:19:46,270 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:19:46,270 INFO L462 AbstractCegarLoop]: Abstraction has 15 states and 15 transitions. [2019-11-16 00:19:46,270 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-11-16 00:19:46,270 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 15 transitions. [2019-11-16 00:19:46,271 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-11-16 00:19:46,271 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:19:46,271 INFO L380 BasicCegarLoop]: trace histogram [9, 1, 1, 1, 1, 1] [2019-11-16 00:19:46,471 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-16 00:19:46,472 INFO L410 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:19:46,472 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:19:46,472 INFO L82 PathProgramCache]: Analyzing trace with hash 833418130, now seen corresponding path program 9 times [2019-11-16 00:19:46,472 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:19:46,472 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [533314428] [2019-11-16 00:19:46,472 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:19:46,473 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:19:46,473 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:19:46,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:19:46,658 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 0 proven. 45 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-16 00:19:46,659 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [533314428] [2019-11-16 00:19:46,659 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [723285931] [2019-11-16 00:19:46,659 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_5d8e64fa-ebcf-4790-b71f-ba94ff809f7c/bin/uautomizer/z3 Starting monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-16 00:19:46,712 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2019-11-16 00:19:46,712 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-16 00:19:46,713 INFO L256 TraceCheckSpWp]: Trace formula consists of 45 conjuncts, 21 conjunts are in the unsatisfiable core [2019-11-16 00:19:46,714 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-16 00:19:46,747 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 0 proven. 45 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-16 00:19:46,747 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-16 00:19:46,747 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 12 [2019-11-16 00:19:46,747 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2005586728] [2019-11-16 00:19:46,748 INFO L442 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-11-16 00:19:46,748 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:19:46,748 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-11-16 00:19:46,749 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=123, Unknown=0, NotChecked=0, Total=156 [2019-11-16 00:19:46,749 INFO L87 Difference]: Start difference. First operand 15 states and 15 transitions. Second operand 13 states. [2019-11-16 00:19:46,853 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:19:46,853 INFO L93 Difference]: Finished difference Result 20 states and 20 transitions. [2019-11-16 00:19:46,855 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-11-16 00:19:46,855 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 14 [2019-11-16 00:19:46,856 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:19:46,856 INFO L225 Difference]: With dead ends: 20 [2019-11-16 00:19:46,856 INFO L226 Difference]: Without dead ends: 16 [2019-11-16 00:19:46,856 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 12 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=33, Invalid=123, Unknown=0, NotChecked=0, Total=156 [2019-11-16 00:19:46,857 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16 states. [2019-11-16 00:19:46,859 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16 to 16. [2019-11-16 00:19:46,859 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2019-11-16 00:19:46,859 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 16 transitions. [2019-11-16 00:19:46,860 INFO L78 Accepts]: Start accepts. Automaton has 16 states and 16 transitions. Word has length 14 [2019-11-16 00:19:46,860 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:19:46,860 INFO L462 AbstractCegarLoop]: Abstraction has 16 states and 16 transitions. [2019-11-16 00:19:46,860 INFO L463 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-11-16 00:19:46,860 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 16 transitions. [2019-11-16 00:19:46,861 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-11-16 00:19:46,861 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:19:46,861 INFO L380 BasicCegarLoop]: trace histogram [10, 1, 1, 1, 1, 1] [2019-11-16 00:19:47,065 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-16 00:19:47,065 INFO L410 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:19:47,065 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:19:47,065 INFO L82 PathProgramCache]: Analyzing trace with hash 67823624, now seen corresponding path program 10 times [2019-11-16 00:19:47,065 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:19:47,066 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1504129803] [2019-11-16 00:19:47,066 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:19:47,066 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:19:47,066 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:19:47,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:19:47,277 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-16 00:19:47,277 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1504129803] [2019-11-16 00:19:47,277 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [795321873] [2019-11-16 00:19:47,277 INFO L92 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_5d8e64fa-ebcf-4790-b71f-ba94ff809f7c/bin/uautomizer/z3 Starting monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-16 00:19:47,317 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-11-16 00:19:47,317 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-16 00:19:47,318 INFO L256 TraceCheckSpWp]: Trace formula consists of 48 conjuncts, 23 conjunts are in the unsatisfiable core [2019-11-16 00:19:47,319 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-16 00:19:47,343 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-16 00:19:47,343 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-16 00:19:47,343 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12] total 13 [2019-11-16 00:19:47,343 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [732682288] [2019-11-16 00:19:47,344 INFO L442 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-11-16 00:19:47,344 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:19:47,344 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-11-16 00:19:47,344 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=146, Unknown=0, NotChecked=0, Total=182 [2019-11-16 00:19:47,344 INFO L87 Difference]: Start difference. First operand 16 states and 16 transitions. Second operand 14 states. [2019-11-16 00:19:47,444 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:19:47,444 INFO L93 Difference]: Finished difference Result 21 states and 21 transitions. [2019-11-16 00:19:47,445 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-11-16 00:19:47,445 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 15 [2019-11-16 00:19:47,445 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:19:47,445 INFO L225 Difference]: With dead ends: 21 [2019-11-16 00:19:47,446 INFO L226 Difference]: Without dead ends: 17 [2019-11-16 00:19:47,446 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 13 SyntacticMatches, 1 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=36, Invalid=146, Unknown=0, NotChecked=0, Total=182 [2019-11-16 00:19:47,446 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states. [2019-11-16 00:19:47,448 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 17. [2019-11-16 00:19:47,449 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2019-11-16 00:19:47,449 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 17 transitions. [2019-11-16 00:19:47,449 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 17 transitions. Word has length 15 [2019-11-16 00:19:47,449 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:19:47,449 INFO L462 AbstractCegarLoop]: Abstraction has 17 states and 17 transitions. [2019-11-16 00:19:47,449 INFO L463 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-11-16 00:19:47,450 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 17 transitions. [2019-11-16 00:19:47,450 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-11-16 00:19:47,450 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:19:47,450 INFO L380 BasicCegarLoop]: trace histogram [11, 1, 1, 1, 1, 1] [2019-11-16 00:19:47,654 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-16 00:19:47,655 INFO L410 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:19:47,655 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:19:47,655 INFO L82 PathProgramCache]: Analyzing trace with hash 2104197714, now seen corresponding path program 11 times [2019-11-16 00:19:47,655 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:19:47,655 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1776015890] [2019-11-16 00:19:47,655 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:19:47,655 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:19:47,655 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:19:47,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:19:47,830 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 0 proven. 66 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-16 00:19:47,831 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1776015890] [2019-11-16 00:19:47,831 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2137083808] [2019-11-16 00:19:47,831 INFO L92 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_5d8e64fa-ebcf-4790-b71f-ba94ff809f7c/bin/uautomizer/z3 Starting monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-16 00:19:47,902 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 7 check-sat command(s) [2019-11-16 00:19:47,902 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-16 00:19:47,903 INFO L256 TraceCheckSpWp]: Trace formula consists of 51 conjuncts, 25 conjunts are in the unsatisfiable core [2019-11-16 00:19:47,904 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-16 00:19:47,938 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 0 proven. 66 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-16 00:19:47,938 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-16 00:19:47,938 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13] total 14 [2019-11-16 00:19:47,938 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2091639856] [2019-11-16 00:19:47,939 INFO L442 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-11-16 00:19:47,939 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:19:47,939 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-11-16 00:19:47,939 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=171, Unknown=0, NotChecked=0, Total=210 [2019-11-16 00:19:47,939 INFO L87 Difference]: Start difference. First operand 17 states and 17 transitions. Second operand 15 states. [2019-11-16 00:19:48,046 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:19:48,046 INFO L93 Difference]: Finished difference Result 22 states and 22 transitions. [2019-11-16 00:19:48,053 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-11-16 00:19:48,053 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 16 [2019-11-16 00:19:48,053 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:19:48,054 INFO L225 Difference]: With dead ends: 22 [2019-11-16 00:19:48,054 INFO L226 Difference]: Without dead ends: 18 [2019-11-16 00:19:48,054 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 14 SyntacticMatches, 1 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=39, Invalid=171, Unknown=0, NotChecked=0, Total=210 [2019-11-16 00:19:48,054 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states. [2019-11-16 00:19:48,056 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 18. [2019-11-16 00:19:48,057 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2019-11-16 00:19:48,057 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 18 transitions. [2019-11-16 00:19:48,057 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 18 transitions. Word has length 16 [2019-11-16 00:19:48,057 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:19:48,057 INFO L462 AbstractCegarLoop]: Abstraction has 18 states and 18 transitions. [2019-11-16 00:19:48,057 INFO L463 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-11-16 00:19:48,058 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 18 transitions. [2019-11-16 00:19:48,058 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-11-16 00:19:48,058 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:19:48,058 INFO L380 BasicCegarLoop]: trace histogram [12, 1, 1, 1, 1, 1] [2019-11-16 00:19:48,264 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-16 00:19:48,264 INFO L410 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:19:48,265 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:19:48,265 INFO L82 PathProgramCache]: Analyzing trace with hash 807285064, now seen corresponding path program 12 times [2019-11-16 00:19:48,265 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:19:48,265 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [518654915] [2019-11-16 00:19:48,266 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:19:48,266 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:19:48,266 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:19:48,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:19:48,493 INFO L134 CoverageAnalysis]: Checked inductivity of 78 backedges. 0 proven. 78 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-16 00:19:48,493 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [518654915] [2019-11-16 00:19:48,493 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [318659916] [2019-11-16 00:19:48,494 INFO L92 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_5d8e64fa-ebcf-4790-b71f-ba94ff809f7c/bin/uautomizer/z3 Starting monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-16 00:19:48,561 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 7 check-sat command(s) [2019-11-16 00:19:48,561 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-16 00:19:48,562 WARN L254 TraceCheckSpWp]: Trace formula consists of 54 conjuncts, 27 conjunts are in the unsatisfiable core [2019-11-16 00:19:48,563 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-16 00:19:48,606 INFO L134 CoverageAnalysis]: Checked inductivity of 78 backedges. 0 proven. 78 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-16 00:19:48,606 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-16 00:19:48,606 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14] total 15 [2019-11-16 00:19:48,606 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1069025775] [2019-11-16 00:19:48,607 INFO L442 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-11-16 00:19:48,607 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:19:48,607 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-11-16 00:19:48,607 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=198, Unknown=0, NotChecked=0, Total=240 [2019-11-16 00:19:48,607 INFO L87 Difference]: Start difference. First operand 18 states and 18 transitions. Second operand 16 states. [2019-11-16 00:19:48,731 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:19:48,731 INFO L93 Difference]: Finished difference Result 23 states and 23 transitions. [2019-11-16 00:19:48,731 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-11-16 00:19:48,732 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 17 [2019-11-16 00:19:48,732 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:19:48,732 INFO L225 Difference]: With dead ends: 23 [2019-11-16 00:19:48,732 INFO L226 Difference]: Without dead ends: 19 [2019-11-16 00:19:48,733 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 15 SyntacticMatches, 1 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=42, Invalid=198, Unknown=0, NotChecked=0, Total=240 [2019-11-16 00:19:48,733 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states. [2019-11-16 00:19:48,735 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 19. [2019-11-16 00:19:48,735 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2019-11-16 00:19:48,736 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 19 transitions. [2019-11-16 00:19:48,736 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 19 transitions. Word has length 17 [2019-11-16 00:19:48,736 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:19:48,736 INFO L462 AbstractCegarLoop]: Abstraction has 19 states and 19 transitions. [2019-11-16 00:19:48,737 INFO L463 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-11-16 00:19:48,737 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 19 transitions. [2019-11-16 00:19:48,737 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-11-16 00:19:48,737 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:19:48,738 INFO L380 BasicCegarLoop]: trace histogram [13, 1, 1, 1, 1, 1] [2019-11-16 00:19:48,941 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-16 00:19:48,941 INFO L410 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:19:48,942 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:19:48,942 INFO L82 PathProgramCache]: Analyzing trace with hash -742301422, now seen corresponding path program 13 times [2019-11-16 00:19:48,942 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:19:48,942 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1481465530] [2019-11-16 00:19:48,942 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:19:48,942 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:19:48,942 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:19:48,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:19:49,164 INFO L134 CoverageAnalysis]: Checked inductivity of 91 backedges. 0 proven. 91 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-16 00:19:49,164 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1481465530] [2019-11-16 00:19:49,164 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2022128050] [2019-11-16 00:19:49,164 INFO L92 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_5d8e64fa-ebcf-4790-b71f-ba94ff809f7c/bin/uautomizer/z3 Starting monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-16 00:19:49,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:19:49,191 WARN L254 TraceCheckSpWp]: Trace formula consists of 57 conjuncts, 29 conjunts are in the unsatisfiable core [2019-11-16 00:19:49,192 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-16 00:19:49,249 INFO L134 CoverageAnalysis]: Checked inductivity of 91 backedges. 0 proven. 91 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-16 00:19:49,250 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-16 00:19:49,250 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15] total 16 [2019-11-16 00:19:49,250 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1632699548] [2019-11-16 00:19:49,250 INFO L442 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-11-16 00:19:49,251 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:19:49,251 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-11-16 00:19:49,251 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=227, Unknown=0, NotChecked=0, Total=272 [2019-11-16 00:19:49,251 INFO L87 Difference]: Start difference. First operand 19 states and 19 transitions. Second operand 17 states. [2019-11-16 00:19:49,395 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:19:49,395 INFO L93 Difference]: Finished difference Result 24 states and 24 transitions. [2019-11-16 00:19:49,395 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-11-16 00:19:49,395 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 18 [2019-11-16 00:19:49,395 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:19:49,396 INFO L225 Difference]: With dead ends: 24 [2019-11-16 00:19:49,396 INFO L226 Difference]: Without dead ends: 20 [2019-11-16 00:19:49,396 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 16 SyntacticMatches, 1 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=45, Invalid=227, Unknown=0, NotChecked=0, Total=272 [2019-11-16 00:19:49,396 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states. [2019-11-16 00:19:49,398 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 20. [2019-11-16 00:19:49,399 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2019-11-16 00:19:49,399 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 20 transitions. [2019-11-16 00:19:49,399 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 20 transitions. Word has length 18 [2019-11-16 00:19:49,399 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:19:49,399 INFO L462 AbstractCegarLoop]: Abstraction has 20 states and 20 transitions. [2019-11-16 00:19:49,399 INFO L463 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-11-16 00:19:49,400 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 20 transitions. [2019-11-16 00:19:49,400 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-11-16 00:19:49,400 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:19:49,400 INFO L380 BasicCegarLoop]: trace histogram [14, 1, 1, 1, 1, 1] [2019-11-16 00:19:49,600 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-16 00:19:49,601 INFO L410 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:19:49,601 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:19:49,601 INFO L82 PathProgramCache]: Analyzing trace with hash -1534842232, now seen corresponding path program 14 times [2019-11-16 00:19:49,601 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:19:49,601 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [199140385] [2019-11-16 00:19:49,601 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:19:49,601 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:19:49,602 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:19:49,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:19:49,855 INFO L134 CoverageAnalysis]: Checked inductivity of 105 backedges. 0 proven. 105 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-16 00:19:49,856 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [199140385] [2019-11-16 00:19:49,856 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [302887705] [2019-11-16 00:19:49,856 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_5d8e64fa-ebcf-4790-b71f-ba94ff809f7c/bin/uautomizer/z3 Starting monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-16 00:19:49,892 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-11-16 00:19:49,892 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-16 00:19:49,893 WARN L254 TraceCheckSpWp]: Trace formula consists of 60 conjuncts, 31 conjunts are in the unsatisfiable core [2019-11-16 00:19:49,894 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-16 00:19:49,931 INFO L134 CoverageAnalysis]: Checked inductivity of 105 backedges. 0 proven. 105 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-16 00:19:49,931 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-16 00:19:49,931 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 16] total 17 [2019-11-16 00:19:49,931 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1224493590] [2019-11-16 00:19:49,931 INFO L442 AbstractCegarLoop]: Interpolant automaton has 18 states [2019-11-16 00:19:49,931 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:19:49,932 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2019-11-16 00:19:49,932 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=258, Unknown=0, NotChecked=0, Total=306 [2019-11-16 00:19:49,932 INFO L87 Difference]: Start difference. First operand 20 states and 20 transitions. Second operand 18 states. [2019-11-16 00:19:50,088 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:19:50,088 INFO L93 Difference]: Finished difference Result 25 states and 25 transitions. [2019-11-16 00:19:50,089 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-11-16 00:19:50,089 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 19 [2019-11-16 00:19:50,089 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:19:50,089 INFO L225 Difference]: With dead ends: 25 [2019-11-16 00:19:50,089 INFO L226 Difference]: Without dead ends: 21 [2019-11-16 00:19:50,090 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 17 SyntacticMatches, 1 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=48, Invalid=258, Unknown=0, NotChecked=0, Total=306 [2019-11-16 00:19:50,090 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states. [2019-11-16 00:19:50,092 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 21. [2019-11-16 00:19:50,092 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2019-11-16 00:19:50,093 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 21 transitions. [2019-11-16 00:19:50,095 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 21 transitions. Word has length 19 [2019-11-16 00:19:50,095 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:19:50,095 INFO L462 AbstractCegarLoop]: Abstraction has 21 states and 21 transitions. [2019-11-16 00:19:50,095 INFO L463 AbstractCegarLoop]: Interpolant automaton has 18 states. [2019-11-16 00:19:50,095 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 21 transitions. [2019-11-16 00:19:50,096 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-11-16 00:19:50,096 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:19:50,096 INFO L380 BasicCegarLoop]: trace histogram [15, 1, 1, 1, 1, 1] [2019-11-16 00:19:50,299 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-16 00:19:50,300 INFO L410 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:19:50,300 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:19:50,300 INFO L82 PathProgramCache]: Analyzing trace with hash -333803566, now seen corresponding path program 15 times [2019-11-16 00:19:50,300 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:19:50,300 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [579427284] [2019-11-16 00:19:50,300 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:19:50,300 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:19:50,300 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:19:50,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:19:50,574 INFO L134 CoverageAnalysis]: Checked inductivity of 120 backedges. 0 proven. 120 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-16 00:19:50,575 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [579427284] [2019-11-16 00:19:50,575 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1573605638] [2019-11-16 00:19:50,575 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_5d8e64fa-ebcf-4790-b71f-ba94ff809f7c/bin/uautomizer/z3 Starting monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-16 00:19:50,718 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 9 check-sat command(s) [2019-11-16 00:19:50,718 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-16 00:19:50,719 WARN L254 TraceCheckSpWp]: Trace formula consists of 63 conjuncts, 33 conjunts are in the unsatisfiable core [2019-11-16 00:19:50,720 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-16 00:19:50,764 INFO L134 CoverageAnalysis]: Checked inductivity of 120 backedges. 0 proven. 120 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-16 00:19:50,765 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-16 00:19:50,765 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17] total 18 [2019-11-16 00:19:50,765 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [911394260] [2019-11-16 00:19:50,765 INFO L442 AbstractCegarLoop]: Interpolant automaton has 19 states [2019-11-16 00:19:50,765 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:19:50,766 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2019-11-16 00:19:50,766 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=291, Unknown=0, NotChecked=0, Total=342 [2019-11-16 00:19:50,766 INFO L87 Difference]: Start difference. First operand 21 states and 21 transitions. Second operand 19 states. [2019-11-16 00:19:50,918 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:19:50,918 INFO L93 Difference]: Finished difference Result 26 states and 26 transitions. [2019-11-16 00:19:50,924 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-11-16 00:19:50,924 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 20 [2019-11-16 00:19:50,924 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:19:50,925 INFO L225 Difference]: With dead ends: 26 [2019-11-16 00:19:50,925 INFO L226 Difference]: Without dead ends: 22 [2019-11-16 00:19:50,925 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 18 SyntacticMatches, 1 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=51, Invalid=291, Unknown=0, NotChecked=0, Total=342 [2019-11-16 00:19:50,925 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states. [2019-11-16 00:19:50,927 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 22. [2019-11-16 00:19:50,927 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2019-11-16 00:19:50,927 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 22 transitions. [2019-11-16 00:19:50,928 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 22 transitions. Word has length 20 [2019-11-16 00:19:50,928 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:19:50,928 INFO L462 AbstractCegarLoop]: Abstraction has 22 states and 22 transitions. [2019-11-16 00:19:50,928 INFO L463 AbstractCegarLoop]: Interpolant automaton has 19 states. [2019-11-16 00:19:50,928 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 22 transitions. [2019-11-16 00:19:50,928 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-11-16 00:19:50,928 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:19:50,929 INFO L380 BasicCegarLoop]: trace histogram [16, 1, 1, 1, 1, 1] [2019-11-16 00:19:51,134 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-16 00:19:51,134 INFO L410 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:19:51,134 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:19:51,134 INFO L82 PathProgramCache]: Analyzing trace with hash -1756310584, now seen corresponding path program 16 times [2019-11-16 00:19:51,134 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:19:51,135 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [305742280] [2019-11-16 00:19:51,135 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:19:51,135 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:19:51,135 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:19:51,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-16 00:19:51,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-16 00:19:51,171 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-16 00:19:51,172 INFO L445 BasicCegarLoop]: Counterexample might be feasible [2019-11-16 00:19:51,204 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 16.11 12:19:51 BoogieIcfgContainer [2019-11-16 00:19:51,204 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-11-16 00:19:51,205 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-11-16 00:19:51,205 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-11-16 00:19:51,205 INFO L275 PluginConnector]: Witness Printer initialized [2019-11-16 00:19:51,206 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.11 12:19:42" (3/4) ... [2019-11-16 00:19:51,210 INFO L140 WitnessPrinter]: No result that supports witness generation found [2019-11-16 00:19:51,210 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-11-16 00:19:51,211 INFO L168 Benchmark]: Toolchain (without parser) took 9478.33 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 187.2 MB). Free memory was 951.4 MB in the beginning and 758.6 MB in the end (delta: 192.8 MB). Peak memory consumption was 380.0 MB. Max. memory is 11.5 GB. [2019-11-16 00:19:51,211 INFO L168 Benchmark]: CDTParser took 0.23 ms. Allocated memory is still 1.0 GB. Free memory is still 967.5 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-16 00:19:51,212 INFO L168 Benchmark]: CACSL2BoogieTranslator took 291.64 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 111.1 MB). Free memory was 951.4 MB in the beginning and 1.1 GB in the end (delta: -148.8 MB). Peak memory consumption was 22.9 MB. Max. memory is 11.5 GB. [2019-11-16 00:19:51,213 INFO L168 Benchmark]: Boogie Procedure Inliner took 28.96 ms. Allocated memory is still 1.1 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-16 00:19:51,213 INFO L168 Benchmark]: Boogie Preprocessor took 34.04 ms. Allocated memory is still 1.1 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-16 00:19:51,214 INFO L168 Benchmark]: RCFGBuilder took 230.64 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: 22.2 MB). Peak memory consumption was 22.2 MB. Max. memory is 11.5 GB. [2019-11-16 00:19:51,215 INFO L168 Benchmark]: TraceAbstraction took 8883.82 ms. Allocated memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: 76.0 MB). Free memory was 1.1 GB in the beginning and 758.6 MB in the end (delta: 319.4 MB). Peak memory consumption was 395.4 MB. Max. memory is 11.5 GB. [2019-11-16 00:19:51,219 INFO L168 Benchmark]: Witness Printer took 4.88 ms. Allocated memory is still 1.2 GB. Free memory is still 758.6 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-16 00:19:51,221 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.23 ms. Allocated memory is still 1.0 GB. Free memory is still 967.5 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 291.64 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 111.1 MB). Free memory was 951.4 MB in the beginning and 1.1 GB in the end (delta: -148.8 MB). Peak memory consumption was 22.9 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 28.96 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 34.04 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 230.64 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: 22.2 MB). Peak memory consumption was 22.2 MB. Max. memory is 11.5 GB. * TraceAbstraction took 8883.82 ms. Allocated memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: 76.0 MB). Free memory was 1.1 GB in the beginning and 758.6 MB in the end (delta: 319.4 MB). Peak memory consumption was 395.4 MB. Max. memory is 11.5 GB. * Witness Printer took 4.88 ms. Allocated memory is still 1.2 GB. Free memory is still 758.6 MB. There was no memory consumed. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - UnprovableResult [Line: 6]: Unable to prove that call of __VERIFIER_error() unreachable Unable to prove that call of __VERIFIER_error() unreachable Reason: overapproximation of bitwiseOr at line 45, overapproximation of bitwiseAnd at line 36. Possible FailurePath: [L23] unsigned short x = __VERIFIER_nondet_ushort(); [L24] unsigned short y = __VERIFIER_nondet_ushort(); [L25] unsigned int xx; [L26] unsigned int yy; [L27] unsigned int zz; [L28] unsigned int z = 0; [L29] unsigned int i = 0; [L30] COND TRUE i < sizeof(x) * 8 [L31] z |= ((x & (1U << i)) << i) | ((y & (1U << i)) << (i + 1)) [L32] i += 1U [L30] COND TRUE i < sizeof(x) * 8 [L31] z |= ((x & (1U << i)) << i) | ((y & (1U << i)) << (i + 1)) [L32] i += 1U [L30] COND TRUE i < sizeof(x) * 8 [L31] z |= ((x & (1U << i)) << i) | ((y & (1U << i)) << (i + 1)) [L32] i += 1U [L30] COND TRUE i < sizeof(x) * 8 [L31] z |= ((x & (1U << i)) << i) | ((y & (1U << i)) << (i + 1)) [L32] i += 1U [L30] COND TRUE i < sizeof(x) * 8 [L31] z |= ((x & (1U << i)) << i) | ((y & (1U << i)) << (i + 1)) [L32] i += 1U [L30] COND TRUE i < sizeof(x) * 8 [L31] z |= ((x & (1U << i)) << i) | ((y & (1U << i)) << (i + 1)) [L32] i += 1U [L30] COND TRUE i < sizeof(x) * 8 [L31] z |= ((x & (1U << i)) << i) | ((y & (1U << i)) << (i + 1)) [L32] i += 1U [L30] COND TRUE i < sizeof(x) * 8 [L31] z |= ((x & (1U << i)) << i) | ((y & (1U << i)) << (i + 1)) [L32] i += 1U [L30] COND TRUE i < sizeof(x) * 8 [L31] z |= ((x & (1U << i)) << i) | ((y & (1U << i)) << (i + 1)) [L32] i += 1U [L30] COND TRUE i < sizeof(x) * 8 [L31] z |= ((x & (1U << i)) << i) | ((y & (1U << i)) << (i + 1)) [L32] i += 1U [L30] COND TRUE i < sizeof(x) * 8 [L31] z |= ((x & (1U << i)) << i) | ((y & (1U << i)) << (i + 1)) [L32] i += 1U [L30] COND TRUE i < sizeof(x) * 8 [L31] z |= ((x & (1U << i)) << i) | ((y & (1U << i)) << (i + 1)) [L32] i += 1U [L30] COND TRUE i < sizeof(x) * 8 [L31] z |= ((x & (1U << i)) << i) | ((y & (1U << i)) << (i + 1)) [L32] i += 1U [L30] COND TRUE i < sizeof(x) * 8 [L31] z |= ((x & (1U << i)) << i) | ((y & (1U << i)) << (i + 1)) [L32] i += 1U [L30] COND TRUE i < sizeof(x) * 8 [L31] z |= ((x & (1U << i)) << i) | ((y & (1U << i)) << (i + 1)) [L32] i += 1U [L30] COND TRUE i < sizeof(x) * 8 [L31] z |= ((x & (1U << i)) << i) | ((y & (1U << i)) << (i + 1)) [L32] i += 1U [L30] COND FALSE !(i < sizeof(x) * 8) [L34] xx = x [L35] yy = y [L36] xx = (xx | (xx << 8u)) & 16711935U [L37] xx = (xx | (xx << 4u)) & 252645135U [L38] xx = (xx | (xx << 2u)) & 858993459U [L39] xx = (xx | (xx << 1u)) & 1431655765U [L40] yy = (yy | (yy << 8u)) & 16711935U [L41] yy = (yy | (yy << 4u)) & 252645135U [L42] yy = (yy | (yy << 2u)) & 858993459U [L43] yy = (yy | (yy << 1u)) & 1431655765U [L45] zz = xx | (yy << 1U) [L5] COND TRUE !(cond) [L6] __VERIFIER_error() - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 9 locations, 1 error locations. Result: UNSAFE, OverallTime: 8.8s, OverallIterations: 17, TraceHistogramMax: 16, AutomataDifference: 1.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 83 SDtfs, 0 SDslu, 342 SDs, 0 SdLazy, 1722 SolverSat, 120 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.9s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 332 GetRequests, 166 SyntacticMatches, 15 SemanticMatches, 151 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30 ImplicationChecksByTransitivity, 2.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=22occurred in iteration=16, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 16 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 3.1s InterpolantComputationTime, 416 NumberOfCodeBlocks, 416 NumberOfCodeBlocksAsserted, 70 NumberOfCheckSat, 364 ConstructedInterpolants, 0 QuantifiedInterpolants, 28440 SizeOfPredicates, 15 NumberOfNonLiveVariables, 630 ConjunctsInSsa, 285 ConjunctsInUnsatCore, 31 InterpolantComputations, 1 PerfectInterpolantSequences, 0/1360 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces Received shutdown request... ### Bit-precise run ### This is Ultimate 0.1.24-cad4683 [2019-11-16 00:19:53,371 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-16 00:19:53,375 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-16 00:19:53,384 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-16 00:19:53,384 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-16 00:19:53,385 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-16 00:19:53,387 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-16 00:19:53,389 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-16 00:19:53,390 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-16 00:19:53,391 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-16 00:19:53,392 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-16 00:19:53,393 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-16 00:19:53,394 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-16 00:19:53,394 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-16 00:19:53,395 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-16 00:19:53,397 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-16 00:19:53,397 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-16 00:19:53,398 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-16 00:19:53,400 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-16 00:19:53,403 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-16 00:19:53,405 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-16 00:19:53,406 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-16 00:19:53,407 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-16 00:19:53,408 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-16 00:19:53,411 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-16 00:19:53,411 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-16 00:19:53,412 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-16 00:19:53,413 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-16 00:19:53,413 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-16 00:19:53,414 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-16 00:19:53,415 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-16 00:19:53,415 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-16 00:19:53,416 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-16 00:19:53,417 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-16 00:19:53,418 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-16 00:19:53,418 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-16 00:19:53,419 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-16 00:19:53,419 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-16 00:19:53,420 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-16 00:19:53,425 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-16 00:19:53,427 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-16 00:19:53,428 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_5d8e64fa-ebcf-4790-b71f-ba94ff809f7c/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2019-11-16 00:19:53,448 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-16 00:19:53,457 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-16 00:19:53,458 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-16 00:19:53,459 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-16 00:19:53,459 INFO L138 SettingsManager]: * Use SBE=true [2019-11-16 00:19:53,459 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-16 00:19:53,460 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-16 00:19:53,460 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-16 00:19:53,461 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-16 00:19:53,462 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-11-16 00:19:53,463 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-16 00:19:53,463 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-11-16 00:19:53,463 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2019-11-16 00:19:53,463 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2019-11-16 00:19:53,464 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-16 00:19:53,464 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-16 00:19:53,464 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-16 00:19:53,465 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-11-16 00:19:53,465 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-16 00:19:53,465 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-16 00:19:53,465 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-16 00:19:53,466 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-16 00:19:53,466 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-16 00:19:53,467 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-16 00:19:53,467 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-16 00:19:53,467 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-11-16 00:19:53,467 INFO L138 SettingsManager]: * Trace refinement strategy=WOLF [2019-11-16 00:19:53,468 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --rewrite-divk --print-success --lang smt [2019-11-16 00:19:53,468 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-11-16 00:19:53,468 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-11-16 00:19:53,468 INFO L138 SettingsManager]: * Logic for external solver=AUFBV 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_5d8e64fa-ebcf-4790-b71f-ba94ff809f7c/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(G ! call(__VERIFIER_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> a69112b8d023c6203418abb04301ebe890b3a5f5 [2019-11-16 00:19:53,515 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-16 00:19:53,527 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-16 00:19:53,533 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-16 00:19:53,534 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-16 00:19:53,534 INFO L275 PluginConnector]: CDTParser initialized [2019-11-16 00:19:53,535 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_5d8e64fa-ebcf-4790-b71f-ba94ff809f7c/bin/uautomizer/../../sv-benchmarks/c/bitvector/interleave_bits.i [2019-11-16 00:19:53,596 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_5d8e64fa-ebcf-4790-b71f-ba94ff809f7c/bin/uautomizer/data/1b0dd44bc/e9a4f758d75647a78e6623d63249bf52/FLAG98fe34cc1 [2019-11-16 00:19:53,993 INFO L306 CDTParser]: Found 1 translation units. [2019-11-16 00:19:53,994 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_5d8e64fa-ebcf-4790-b71f-ba94ff809f7c/sv-benchmarks/c/bitvector/interleave_bits.i [2019-11-16 00:19:54,000 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_5d8e64fa-ebcf-4790-b71f-ba94ff809f7c/bin/uautomizer/data/1b0dd44bc/e9a4f758d75647a78e6623d63249bf52/FLAG98fe34cc1 [2019-11-16 00:19:54,390 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_5d8e64fa-ebcf-4790-b71f-ba94ff809f7c/bin/uautomizer/data/1b0dd44bc/e9a4f758d75647a78e6623d63249bf52 [2019-11-16 00:19:54,393 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-16 00:19:54,394 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-11-16 00:19:54,394 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-16 00:19:54,394 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-16 00:19:54,396 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-16 00:19:54,397 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.11 12:19:54" (1/1) ... [2019-11-16 00:19:54,399 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@34074b27 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:19:54, skipping insertion in model container [2019-11-16 00:19:54,399 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.11 12:19:54" (1/1) ... [2019-11-16 00:19:54,405 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-11-16 00:19:54,420 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-11-16 00:19:54,578 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-16 00:19:54,582 INFO L188 MainTranslator]: Completed pre-run [2019-11-16 00:19:54,602 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-16 00:19:54,614 INFO L192 MainTranslator]: Completed translation [2019-11-16 00:19:54,614 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:19:54 WrapperNode [2019-11-16 00:19:54,614 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-16 00:19:54,615 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-11-16 00:19:54,615 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-11-16 00:19:54,615 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-11-16 00:19:54,675 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:19:54" (1/1) ... [2019-11-16 00:19:54,683 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:19:54" (1/1) ... [2019-11-16 00:19:54,698 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-11-16 00:19:54,699 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-16 00:19:54,699 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-16 00:19:54,699 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-16 00:19:54,708 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:19:54" (1/1) ... [2019-11-16 00:19:54,708 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:19:54" (1/1) ... [2019-11-16 00:19:54,709 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:19:54" (1/1) ... [2019-11-16 00:19:54,710 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:19:54" (1/1) ... [2019-11-16 00:19:54,714 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:19:54" (1/1) ... [2019-11-16 00:19:54,718 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:19:54" (1/1) ... [2019-11-16 00:19:54,720 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:19:54" (1/1) ... [2019-11-16 00:19:54,726 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-16 00:19:54,727 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-16 00:19:54,728 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-16 00:19:54,728 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-16 00:19:54,729 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:19:54" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_5d8e64fa-ebcf-4790-b71f-ba94ff809f7c/bin/uautomizer/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-16 00:19:54,778 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-16 00:19:54,778 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-16 00:19:54,947 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-16 00:19:54,947 INFO L284 CfgBuilder]: Removed 7 assume(true) statements. [2019-11-16 00:19:54,948 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.11 12:19:54 BoogieIcfgContainer [2019-11-16 00:19:54,949 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-16 00:19:54,950 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-16 00:19:54,950 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-16 00:19:54,952 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-16 00:19:54,953 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 16.11 12:19:54" (1/3) ... [2019-11-16 00:19:54,954 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@27298d25 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.11 12:19:54, skipping insertion in model container [2019-11-16 00:19:54,954 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:19:54" (2/3) ... [2019-11-16 00:19:54,954 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@27298d25 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.11 12:19:54, skipping insertion in model container [2019-11-16 00:19:54,954 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.11 12:19:54" (3/3) ... [2019-11-16 00:19:54,956 INFO L109 eAbstractionObserver]: Analyzing ICFG interleave_bits.i [2019-11-16 00:19:54,965 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-16 00:19:54,971 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-11-16 00:19:54,981 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-11-16 00:19:54,999 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-16 00:19:54,999 INFO L374 AbstractCegarLoop]: Hoare is true [2019-11-16 00:19:54,999 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-16 00:19:54,999 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-16 00:19:54,999 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-16 00:19:54,999 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-16 00:19:55,000 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-16 00:19:55,000 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-16 00:19:55,010 INFO L276 IsEmpty]: Start isEmpty. Operand 9 states. [2019-11-16 00:19:55,014 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-11-16 00:19:55,014 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:19:55,015 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-11-16 00:19:55,016 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:19:55,021 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:19:55,021 INFO L82 PathProgramCache]: Analyzing trace with hash 29805000, now seen corresponding path program 1 times [2019-11-16 00:19:55,029 INFO L157 tionRefinementEngine]: Executing refinement strategy WOLF [2019-11-16 00:19:55,030 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [2034322387] [2019-11-16 00:19:55,030 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_5d8e64fa-ebcf-4790-b71f-ba94ff809f7c/bin/uautomizer/cvc4 Starting monitored process 2 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-16 00:19:55,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:19:55,094 INFO L256 TraceCheckSpWp]: Trace formula consists of 14 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-16 00:19:55,099 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-16 00:19:55,142 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-16 00:19:55,142 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-11-16 00:19:55,155 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-16 00:19:55,156 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [2034322387] [2019-11-16 00:19:55,156 INFO L223 tionRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:19:55,157 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [2, 2] imperfect sequences [] total 3 [2019-11-16 00:19:55,157 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1562960796] [2019-11-16 00:19:55,161 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-16 00:19:55,161 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-16 00:19:55,173 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-16 00:19:55,174 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-16 00:19:55,176 INFO L87 Difference]: Start difference. First operand 9 states. Second operand 4 states. [2019-11-16 00:19:55,222 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:19:55,222 INFO L93 Difference]: Finished difference Result 18 states and 24 transitions. [2019-11-16 00:19:55,223 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-16 00:19:55,224 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 5 [2019-11-16 00:19:55,224 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:19:55,232 INFO L225 Difference]: With dead ends: 18 [2019-11-16 00:19:55,233 INFO L226 Difference]: Without dead ends: 8 [2019-11-16 00:19:55,236 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-16 00:19:55,252 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8 states. [2019-11-16 00:19:55,263 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8 to 8. [2019-11-16 00:19:55,264 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2019-11-16 00:19:55,265 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 8 transitions. [2019-11-16 00:19:55,266 INFO L78 Accepts]: Start accepts. Automaton has 8 states and 8 transitions. Word has length 5 [2019-11-16 00:19:55,267 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:19:55,267 INFO L462 AbstractCegarLoop]: Abstraction has 8 states and 8 transitions. [2019-11-16 00:19:55,267 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-16 00:19:55,267 INFO L276 IsEmpty]: Start isEmpty. Operand 8 states and 8 transitions. [2019-11-16 00:19:55,268 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-11-16 00:19:55,268 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:19:55,268 INFO L380 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1] [2019-11-16 00:19:55,470 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-16 00:19:55,470 INFO L410 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:19:55,471 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:19:55,471 INFO L82 PathProgramCache]: Analyzing trace with hash -1368874232, now seen corresponding path program 1 times [2019-11-16 00:19:55,471 INFO L157 tionRefinementEngine]: Executing refinement strategy WOLF [2019-11-16 00:19:55,471 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [341063824] [2019-11-16 00:19:55,471 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_5d8e64fa-ebcf-4790-b71f-ba94ff809f7c/bin/uautomizer/cvc4 Starting monitored process 3 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-16 00:19:55,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:19:55,538 INFO L256 TraceCheckSpWp]: Trace formula consists of 20 conjuncts, 4 conjunts are in the unsatisfiable core [2019-11-16 00:19:55,539 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-16 00:19:55,577 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-16 00:19:55,578 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-11-16 00:19:55,657 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-16 00:19:55,658 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [341063824] [2019-11-16 00:19:55,658 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-16 00:19:55,658 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 7 [2019-11-16 00:19:55,658 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [747108864] [2019-11-16 00:19:55,660 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-11-16 00:19:55,660 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-16 00:19:55,660 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-11-16 00:19:55,661 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2019-11-16 00:19:55,661 INFO L87 Difference]: Start difference. First operand 8 states and 8 transitions. Second operand 8 states. [2019-11-16 00:19:55,803 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:19:55,803 INFO L93 Difference]: Finished difference Result 16 states and 19 transitions. [2019-11-16 00:19:55,804 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-11-16 00:19:55,804 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 7 [2019-11-16 00:19:55,804 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:19:55,805 INFO L225 Difference]: With dead ends: 16 [2019-11-16 00:19:55,805 INFO L226 Difference]: Without dead ends: 12 [2019-11-16 00:19:55,806 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2019-11-16 00:19:55,806 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12 states. [2019-11-16 00:19:55,809 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12 to 12. [2019-11-16 00:19:55,810 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2019-11-16 00:19:55,811 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 12 transitions. [2019-11-16 00:19:55,811 INFO L78 Accepts]: Start accepts. Automaton has 12 states and 12 transitions. Word has length 7 [2019-11-16 00:19:55,811 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:19:55,811 INFO L462 AbstractCegarLoop]: Abstraction has 12 states and 12 transitions. [2019-11-16 00:19:55,811 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-11-16 00:19:55,811 INFO L276 IsEmpty]: Start isEmpty. Operand 12 states and 12 transitions. [2019-11-16 00:19:55,812 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-11-16 00:19:55,812 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:19:55,812 INFO L380 BasicCegarLoop]: trace histogram [6, 1, 1, 1, 1, 1] [2019-11-16 00:19:56,012 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-16 00:19:56,013 INFO L410 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:19:56,013 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:19:56,014 INFO L82 PathProgramCache]: Analyzing trace with hash 596403592, now seen corresponding path program 2 times [2019-11-16 00:19:56,015 INFO L157 tionRefinementEngine]: Executing refinement strategy WOLF [2019-11-16 00:19:56,015 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [1196893078] [2019-11-16 00:19:56,015 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_5d8e64fa-ebcf-4790-b71f-ba94ff809f7c/bin/uautomizer/cvc4 Starting monitored process 4 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-16 00:19:56,121 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-11-16 00:19:56,122 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-16 00:19:56,123 INFO L256 TraceCheckSpWp]: Trace formula consists of 32 conjuncts, 8 conjunts are in the unsatisfiable core [2019-11-16 00:19:56,124 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-16 00:19:56,216 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-16 00:19:56,216 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-11-16 00:19:56,493 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-16 00:19:56,494 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1196893078] [2019-11-16 00:19:56,494 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-16 00:19:56,494 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 15 [2019-11-16 00:19:56,494 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [175424839] [2019-11-16 00:19:56,495 INFO L442 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-11-16 00:19:56,495 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-16 00:19:56,495 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-11-16 00:19:56,496 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=162, Unknown=0, NotChecked=0, Total=240 [2019-11-16 00:19:56,496 INFO L87 Difference]: Start difference. First operand 12 states and 12 transitions. Second operand 16 states. [2019-11-16 00:19:57,299 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:19:57,300 INFO L93 Difference]: Finished difference Result 24 states and 31 transitions. [2019-11-16 00:19:57,301 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-11-16 00:19:57,301 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 11 [2019-11-16 00:19:57,302 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:19:57,302 INFO L225 Difference]: With dead ends: 24 [2019-11-16 00:19:57,302 INFO L226 Difference]: Without dead ends: 20 [2019-11-16 00:19:57,303 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=174, Invalid=288, Unknown=0, NotChecked=0, Total=462 [2019-11-16 00:19:57,304 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states. [2019-11-16 00:19:57,308 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 20. [2019-11-16 00:19:57,308 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2019-11-16 00:19:57,308 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 20 transitions. [2019-11-16 00:19:57,309 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 20 transitions. Word has length 11 [2019-11-16 00:19:57,309 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:19:57,310 INFO L462 AbstractCegarLoop]: Abstraction has 20 states and 20 transitions. [2019-11-16 00:19:57,310 INFO L463 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-11-16 00:19:57,310 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 20 transitions. [2019-11-16 00:19:57,311 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-11-16 00:19:57,311 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:19:57,311 INFO L380 BasicCegarLoop]: trace histogram [14, 1, 1, 1, 1, 1] [2019-11-16 00:19:57,517 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-16 00:19:57,517 INFO L410 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:19:57,518 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:19:57,518 INFO L82 PathProgramCache]: Analyzing trace with hash -1534842232, now seen corresponding path program 3 times [2019-11-16 00:19:57,518 INFO L157 tionRefinementEngine]: Executing refinement strategy WOLF [2019-11-16 00:19:57,518 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [244951524] [2019-11-16 00:19:57,519 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_5d8e64fa-ebcf-4790-b71f-ba94ff809f7c/bin/uautomizer/cvc4 Starting monitored process 5 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-16 00:19:57,726 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 8 check-sat command(s) [2019-11-16 00:19:57,726 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-16 00:19:57,728 INFO L256 TraceCheckSpWp]: Trace formula consists of 56 conjuncts, 17 conjunts are in the unsatisfiable core [2019-11-16 00:19:57,730 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-16 00:19:57,986 INFO L134 CoverageAnalysis]: Checked inductivity of 105 backedges. 0 proven. 105 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-16 00:19:57,986 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-11-16 00:19:59,123 INFO L134 CoverageAnalysis]: Checked inductivity of 105 backedges. 0 proven. 105 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-16 00:19:59,123 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [244951524] [2019-11-16 00:19:59,123 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-16 00:19:59,123 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 16] total 31 [2019-11-16 00:19:59,124 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2075242405] [2019-11-16 00:19:59,124 INFO L442 AbstractCegarLoop]: Interpolant automaton has 32 states [2019-11-16 00:19:59,124 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-16 00:19:59,125 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2019-11-16 00:19:59,125 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=273, Invalid=719, Unknown=0, NotChecked=0, Total=992 [2019-11-16 00:19:59,126 INFO L87 Difference]: Start difference. First operand 20 states and 20 transitions. Second operand 32 states. [2019-11-16 00:19:59,689 WARN L191 SmtUtils]: Spent 217.00 ms on a formula simplification that was a NOOP. DAG size: 72 [2019-11-16 00:20:00,119 WARN L191 SmtUtils]: Spent 251.00 ms on a formula simplification that was a NOOP. DAG size: 69 [2019-11-16 00:20:00,592 WARN L191 SmtUtils]: Spent 276.00 ms on a formula simplification that was a NOOP. DAG size: 74 [2019-11-16 00:20:00,891 WARN L191 SmtUtils]: Spent 150.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 7 [2019-11-16 00:20:01,185 WARN L191 SmtUtils]: Spent 138.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 7 [2019-11-16 00:20:01,480 WARN L191 SmtUtils]: Spent 124.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 7 [2019-11-16 00:20:01,783 WARN L191 SmtUtils]: Spent 124.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 7 [2019-11-16 00:20:02,145 WARN L191 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 44 DAG size of output: 7 [2019-11-16 00:20:03,450 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:20:03,451 INFO L93 Difference]: Finished difference Result 40 states and 55 transitions. [2019-11-16 00:20:03,454 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2019-11-16 00:20:03,454 INFO L78 Accepts]: Start accepts. Automaton has 32 states. Word has length 19 [2019-11-16 00:20:03,455 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:20:03,455 INFO L225 Difference]: With dead ends: 40 [2019-11-16 00:20:03,455 INFO L226 Difference]: Without dead ends: 36 [2019-11-16 00:20:03,457 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 208 ImplicationChecksByTransitivity, 5.4s TimeCoverageRelationStatistics Valid=622, Invalid=1540, Unknown=0, NotChecked=0, Total=2162 [2019-11-16 00:20:03,457 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2019-11-16 00:20:03,466 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 36. [2019-11-16 00:20:03,468 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2019-11-16 00:20:03,469 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 37 transitions. [2019-11-16 00:20:03,469 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 37 transitions. Word has length 19 [2019-11-16 00:20:03,471 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:20:03,471 INFO L462 AbstractCegarLoop]: Abstraction has 36 states and 37 transitions. [2019-11-16 00:20:03,471 INFO L463 AbstractCegarLoop]: Interpolant automaton has 32 states. [2019-11-16 00:20:03,472 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 37 transitions. [2019-11-16 00:20:03,473 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-11-16 00:20:03,474 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:20:03,474 INFO L380 BasicCegarLoop]: trace histogram [16, 1, 1, 1, 1, 1] [2019-11-16 00:20:03,676 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-16 00:20:03,677 INFO L410 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:20:03,677 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:20:03,677 INFO L82 PathProgramCache]: Analyzing trace with hash -1756310584, now seen corresponding path program 4 times [2019-11-16 00:20:03,677 INFO L157 tionRefinementEngine]: Executing refinement strategy WOLF [2019-11-16 00:20:03,678 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [1434154141] [2019-11-16 00:20:03,678 INFO L92 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_5d8e64fa-ebcf-4790-b71f-ba94ff809f7c/bin/uautomizer/cvc4 Starting monitored process 6 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-16 00:20:03,911 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-11-16 00:20:03,911 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-16 00:20:03,912 WARN L254 TraceCheckSpWp]: Trace formula consists of 62 conjuncts, 39 conjunts are in the unsatisfiable core [2019-11-16 00:20:03,915 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-16 00:20:05,090 INFO L134 CoverageAnalysis]: Checked inductivity of 136 backedges. 0 proven. 136 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-16 00:20:05,090 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-11-16 00:20:32,946 INFO L134 CoverageAnalysis]: Checked inductivity of 136 backedges. 120 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-16 00:20:32,946 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1434154141] [2019-11-16 00:20:32,946 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-16 00:20:32,947 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 19] total 35 [2019-11-16 00:20:32,947 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [481038980] [2019-11-16 00:20:32,947 INFO L442 AbstractCegarLoop]: Interpolant automaton has 36 states [2019-11-16 00:20:32,948 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-16 00:20:32,948 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2019-11-16 00:20:32,949 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=310, Invalid=950, Unknown=0, NotChecked=0, Total=1260 [2019-11-16 00:20:32,949 INFO L87 Difference]: Start difference. First operand 36 states and 37 transitions. Second operand 36 states. [2019-11-16 00:20:34,844 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:20:34,844 INFO L93 Difference]: Finished difference Result 36 states and 37 transitions. [2019-11-16 00:20:34,844 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2019-11-16 00:20:34,845 INFO L78 Accepts]: Start accepts. Automaton has 36 states. Word has length 21 [2019-11-16 00:20:34,845 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:20:34,845 INFO L225 Difference]: With dead ends: 36 [2019-11-16 00:20:34,845 INFO L226 Difference]: Without dead ends: 0 [2019-11-16 00:20:34,846 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 4 SyntacticMatches, 2 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 29.0s TimeCoverageRelationStatistics Valid=330, Invalid=1002, Unknown=0, NotChecked=0, Total=1332 [2019-11-16 00:20:34,847 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-11-16 00:20:34,847 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-11-16 00:20:34,847 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-11-16 00:20:34,847 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-11-16 00:20:34,847 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 21 [2019-11-16 00:20:34,847 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:20:34,848 INFO L462 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-11-16 00:20:34,848 INFO L463 AbstractCegarLoop]: Interpolant automaton has 36 states. [2019-11-16 00:20:34,848 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-11-16 00:20:34,848 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-11-16 00:20:35,048 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-16 00:20:35,052 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2019-11-16 00:20:35,225 WARN L191 SmtUtils]: Spent 170.00 ms on a formula simplification. DAG size of input: 320 DAG size of output: 304 [2019-11-16 00:20:36,491 WARN L191 SmtUtils]: Spent 1.26 s on a formula simplification. DAG size of input: 304 DAG size of output: 239 [2019-11-16 00:20:36,493 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 6) no Hoare annotation was computed. [2019-11-16 00:20:36,494 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2019-11-16 00:20:36,494 INFO L443 ceAbstractionStarter]: For program point L5(lines 5 7) no Hoare annotation was computed. [2019-11-16 00:20:36,494 INFO L446 ceAbstractionStarter]: At program point L5-2(lines 1 48) the Hoare annotation is: true [2019-11-16 00:20:36,494 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2019-11-16 00:20:36,494 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2019-11-16 00:20:36,495 INFO L439 ceAbstractionStarter]: At program point L30-2(lines 30 33) the Hoare annotation is: (let ((.cse3 ((_ zero_extend 16) ULTIMATE.start_main_~x~0)) (.cse6 ((_ zero_extend 16) ULTIMATE.start_main_~y~0))) (let ((.cse11 (bvor (bvor (bvor (bvor (bvor (_ bv0 32) (bvor (bvshl (bvand .cse3 (_ bv1 32)) (_ bv0 32)) (bvshl (bvand .cse6 (_ bv1 32)) (_ bv1 32)))) (bvor (bvshl (bvand .cse3 (_ bv2 32)) (_ bv1 32)) (bvshl (bvand .cse6 (_ bv2 32)) (_ bv2 32)))) (bvor (bvshl (bvand .cse3 (_ bv4 32)) (_ bv2 32)) (bvshl (bvand .cse6 (_ bv4 32)) (_ bv3 32)))) (bvor (bvshl (bvand .cse3 (_ bv8 32)) (_ bv3 32)) (bvshl (bvand .cse6 (_ bv8 32)) (_ bv4 32)))) (bvor (bvshl (bvand .cse3 (_ bv16 32)) (_ bv4 32)) (bvshl (bvand .cse6 (_ bv16 32)) (_ bv5 32)))))) (let ((.cse10 (bvor (bvor .cse11 (bvor (bvshl (bvand .cse3 (_ bv32 32)) (_ bv5 32)) (bvshl (bvand .cse6 (_ bv32 32)) (_ bv6 32)))) (bvor (bvshl (bvand .cse3 (_ bv64 32)) (_ bv6 32)) (bvshl (bvand .cse6 (_ bv64 32)) (_ bv7 32)))))) (let ((.cse9 (bvor (bvor (bvor .cse10 (bvor (bvshl (bvand .cse3 (_ bv128 32)) (_ bv7 32)) (bvshl (bvand .cse6 (_ bv128 32)) (_ bv8 32)))) (bvor (bvshl (bvand .cse3 (_ bv256 32)) (_ bv8 32)) (bvshl (bvand .cse6 (_ bv256 32)) (_ bv9 32)))) (bvor (bvshl (bvand .cse3 (_ bv512 32)) (_ bv9 32)) (bvshl (bvand .cse6 (_ bv512 32)) (_ bv10 32)))))) (let ((.cse0 (bvor .cse9 (bvor (bvshl (bvand .cse3 (_ bv1024 32)) (_ bv10 32)) (bvshl (bvand .cse6 (_ bv1024 32)) (_ bv11 32)))))) (let ((.cse12 (bvor (bvor (bvor .cse0 (bvor (bvshl (bvand .cse3 (_ bv2048 32)) (_ bv11 32)) (bvshl (bvand .cse6 (_ bv2048 32)) (_ bv12 32)))) (bvor (bvshl (bvand .cse3 (_ bv4096 32)) (_ bv12 32)) (bvshl (bvand .cse6 (_ bv4096 32)) (_ bv13 32)))) (bvor (bvshl (bvand .cse3 (_ bv8192 32)) (_ bv13 32)) (bvshl (bvand .cse6 (_ bv8192 32)) (_ bv14 32))))) (.cse16 (bvadd ULTIMATE.start_main_~i~0 (_ bv4294967295 32))) (.cse13 (bvadd ULTIMATE.start_main_~i~0 (_ bv4294967294 32))) (.cse7 (bvadd ULTIMATE.start_main_~i~0 (_ bv4294967293 32)))) (let ((.cse8 (let ((.cse18 (bvshl (_ bv1 32) .cse7))) (bvor (bvshl (bvand .cse3 .cse18) .cse7) (bvshl (bvand .cse6 .cse18) .cse13)))) (.cse1 (let ((.cse17 (bvshl (_ bv1 32) .cse13))) (bvor (bvshl (bvand .cse3 .cse17) .cse13) (bvshl (bvand .cse6 .cse17) .cse16)))) (.cse2 (let ((.cse15 (bvshl (_ bv1 32) .cse16))) (bvor (bvshl (bvand .cse3 .cse15) .cse16) (bvshl (bvand .cse6 .cse15) ULTIMATE.start_main_~i~0)))) (.cse14 (bvor .cse12 (bvor (bvshl (bvand .cse3 (_ bv16384 32)) (_ bv14 32)) (bvshl (bvand .cse6 (_ bv16384 32)) (_ bv15 32)))))) (or (and (= (bvor (bvor .cse0 .cse1) .cse2) ULTIMATE.start_main_~z~0) (= (bvadd ULTIMATE.start_main_~i~0 (_ bv4294967283 32)) (_ bv0 32))) (and (= (bvor (bvor (bvor (bvor (_ bv0 32) (let ((.cse5 (bvadd ULTIMATE.start_main_~i~0 (_ bv4294967292 32)))) (let ((.cse4 (bvshl (_ bv1 32) .cse5))) (bvor (bvshl (bvand .cse3 .cse4) .cse5) (bvshl (bvand .cse6 .cse4) .cse7))))) .cse8) .cse1) .cse2) ULTIMATE.start_main_~z~0) (= (_ bv4 32) ULTIMATE.start_main_~i~0)) (and (= .cse9 ULTIMATE.start_main_~z~0) (= (bvadd ULTIMATE.start_main_~i~0 (_ bv4294967286 32)) (_ bv0 32))) (and (= (bvadd ULTIMATE.start_main_~i~0 (_ bv4294967288 32)) (_ bv0 32)) (= (bvor .cse10 .cse2) ULTIMATE.start_main_~z~0)) (and (= (_ bv9 32) ULTIMATE.start_main_~i~0) (= (bvor (bvor .cse10 .cse1) .cse2) ULTIMATE.start_main_~z~0)) (and (= .cse11 ULTIMATE.start_main_~z~0) (= (bvadd ULTIMATE.start_main_~i~0 (_ bv4294967291 32)) (_ bv0 32))) (and (= (bvor (_ bv0 32) .cse2) ULTIMATE.start_main_~z~0) (= (_ bv1 32) ULTIMATE.start_main_~i~0)) (and (= .cse12 ULTIMATE.start_main_~z~0) (= (_ bv14 32) ULTIMATE.start_main_~i~0)) (and (= .cse13 (_ bv0 32)) (= (bvor (bvor (_ bv0 32) .cse1) .cse2) ULTIMATE.start_main_~z~0)) (and (= (bvadd ULTIMATE.start_main_~i~0 (_ bv4294967290 32)) (_ bv0 32)) (= (bvor .cse11 .cse2) ULTIMATE.start_main_~z~0)) (and (= (bvor .cse0 .cse2) ULTIMATE.start_main_~z~0) (= (_ bv12 32) ULTIMATE.start_main_~i~0)) (and (= .cse14 ULTIMATE.start_main_~z~0) (= (_ bv15 32) ULTIMATE.start_main_~i~0)) (and (= (bvor (bvor (bvor (_ bv0 32) .cse8) .cse1) .cse2) ULTIMATE.start_main_~z~0) (= .cse7 (_ bv0 32))) (and (= .cse10 ULTIMATE.start_main_~z~0) (= (_ bv7 32) ULTIMATE.start_main_~i~0)) (= ULTIMATE.start_main_~z~0 (bvor .cse14 (bvor (bvshl (bvand .cse3 (_ bv32768 32)) (_ bv15 32)) (bvshl (bvand .cse6 (_ bv32768 32)) (_ bv16 32))))) (and (= (_ bv11 32) ULTIMATE.start_main_~i~0) (= .cse0 ULTIMATE.start_main_~z~0)) (and (= (_ bv0 32) ULTIMATE.start_main_~i~0) (= (_ bv0 32) ULTIMATE.start_main_~z~0)))))))))) [2019-11-16 00:20:36,495 INFO L443 ceAbstractionStarter]: For program point L30-3(lines 30 33) no Hoare annotation was computed. [2019-11-16 00:20:36,495 INFO L443 ceAbstractionStarter]: For program point L6(line 6) no Hoare annotation was computed. [2019-11-16 00:20:36,557 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 16.11 12:20:36 BoogieIcfgContainer [2019-11-16 00:20:36,557 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-11-16 00:20:36,558 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-11-16 00:20:36,558 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-11-16 00:20:36,558 INFO L275 PluginConnector]: Witness Printer initialized [2019-11-16 00:20:36,559 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.11 12:19:54" (3/4) ... [2019-11-16 00:20:36,562 INFO L137 WitnessPrinter]: Generating witness for correct program [2019-11-16 00:20:36,571 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2019-11-16 00:20:36,571 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2019-11-16 00:20:36,633 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/run_dir_5d8e64fa-ebcf-4790-b71f-ba94ff809f7c/bin/uautomizer/witness.graphml [2019-11-16 00:20:36,634 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-11-16 00:20:36,635 INFO L168 Benchmark]: Toolchain (without parser) took 42241.37 ms. Allocated memory was 1.0 GB in the beginning and 1.3 GB in the end (delta: 309.9 MB). Free memory was 947.0 MB in the beginning and 1.2 GB in the end (delta: -244.6 MB). Peak memory consumption was 65.2 MB. Max. memory is 11.5 GB. [2019-11-16 00:20:36,636 INFO L168 Benchmark]: CDTParser took 0.50 ms. Allocated memory is still 1.0 GB. Free memory is still 972.5 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-16 00:20:36,636 INFO L168 Benchmark]: CACSL2BoogieTranslator took 220.13 ms. Allocated memory is still 1.0 GB. Free memory was 947.0 MB in the beginning and 936.2 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. [2019-11-16 00:20:36,637 INFO L168 Benchmark]: Boogie Procedure Inliner took 83.67 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 149.4 MB). Free memory was 936.2 MB in the beginning and 1.1 GB in the end (delta: -209.2 MB). Peak memory consumption was 12.1 MB. Max. memory is 11.5 GB. [2019-11-16 00:20:36,637 INFO L168 Benchmark]: Boogie Preprocessor took 28.49 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.5 MB). Peak memory consumption was 6.5 MB. Max. memory is 11.5 GB. [2019-11-16 00:20:36,638 INFO L168 Benchmark]: RCFGBuilder took 221.29 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 12.4 MB). Peak memory consumption was 12.4 MB. Max. memory is 11.5 GB. [2019-11-16 00:20:36,639 INFO L168 Benchmark]: TraceAbstraction took 41607.73 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 160.4 MB). Free memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: -73.7 MB). Peak memory consumption was 409.1 MB. Max. memory is 11.5 GB. [2019-11-16 00:20:36,639 INFO L168 Benchmark]: Witness Printer took 76.29 ms. Allocated memory is still 1.3 GB. Free memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 8.6 MB). Peak memory consumption was 8.6 MB. Max. memory is 11.5 GB. [2019-11-16 00:20:36,642 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.50 ms. Allocated memory is still 1.0 GB. Free memory is still 972.5 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 220.13 ms. Allocated memory is still 1.0 GB. Free memory was 947.0 MB in the beginning and 936.2 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 83.67 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 149.4 MB). Free memory was 936.2 MB in the beginning and 1.1 GB in the end (delta: -209.2 MB). Peak memory consumption was 12.1 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 28.49 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.5 MB). Peak memory consumption was 6.5 MB. Max. memory is 11.5 GB. * RCFGBuilder took 221.29 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 12.4 MB). Peak memory consumption was 12.4 MB. Max. memory is 11.5 GB. * TraceAbstraction took 41607.73 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 160.4 MB). Free memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: -73.7 MB). Peak memory consumption was 409.1 MB. Max. memory is 11.5 GB. * Witness Printer took 76.29 ms. Allocated memory is still 1.3 GB. Free memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 8.6 MB). Peak memory consumption was 8.6 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 6]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 30]: Loop Invariant Derived loop invariant: ((((((((((((((((~bvor32(~bvor32(~bvor32(~bvor32(~bvor32(~bvor32(~bvor32(~bvor32(~bvor32(~bvor32(~bvor32(~bvor32(~bvor32(0bv32, ~bvor32(~bvshl32(~bvand32(~zero_extendFrom16To32(x), 1bv32), 0bv32), ~bvshl32(~bvand32(~zero_extendFrom16To32(y), 1bv32), 1bv32))), ~bvor32(~bvshl32(~bvand32(~zero_extendFrom16To32(x), 2bv32), 1bv32), ~bvshl32(~bvand32(~zero_extendFrom16To32(y), 2bv32), 2bv32))), ~bvor32(~bvshl32(~bvand32(~zero_extendFrom16To32(x), 4bv32), 2bv32), ~bvshl32(~bvand32(~zero_extendFrom16To32(y), 4bv32), 3bv32))), ~bvor32(~bvshl32(~bvand32(~zero_extendFrom16To32(x), 8bv32), 3bv32), ~bvshl32(~bvand32(~zero_extendFrom16To32(y), 8bv32), 4bv32))), ~bvor32(~bvshl32(~bvand32(~zero_extendFrom16To32(x), 16bv32), 4bv32), ~bvshl32(~bvand32(~zero_extendFrom16To32(y), 16bv32), 5bv32))), ~bvor32(~bvshl32(~bvand32(~zero_extendFrom16To32(x), 32bv32), 5bv32), ~bvshl32(~bvand32(~zero_extendFrom16To32(y), 32bv32), 6bv32))), ~bvor32(~bvshl32(~bvand32(~zero_extendFrom16To32(x), 64bv32), 6bv32), ~bvshl32(~bvand32(~zero_extendFrom16To32(y), 64bv32), 7bv32))), ~bvor32(~bvshl32(~bvand32(~zero_extendFrom16To32(x), 128bv32), 7bv32), ~bvshl32(~bvand32(~zero_extendFrom16To32(y), 128bv32), 8bv32))), ~bvor32(~bvshl32(~bvand32(~zero_extendFrom16To32(x), 256bv32), 8bv32), ~bvshl32(~bvand32(~zero_extendFrom16To32(y), 256bv32), 9bv32))), ~bvor32(~bvshl32(~bvand32(~zero_extendFrom16To32(x), 512bv32), 9bv32), ~bvshl32(~bvand32(~zero_extendFrom16To32(y), 512bv32), 10bv32))), ~bvor32(~bvshl32(~bvand32(~zero_extendFrom16To32(x), 1024bv32), 10bv32), ~bvshl32(~bvand32(~zero_extendFrom16To32(y), 1024bv32), 11bv32))), ~bvor32(~bvshl32(~bvand32(~zero_extendFrom16To32(x), ~bvshl32(1bv32, ~bvadd64(i, 4294967294bv32))), ~bvadd64(i, 4294967294bv32)), ~bvshl32(~bvand32(~zero_extendFrom16To32(y), ~bvshl32(1bv32, ~bvadd64(i, 4294967294bv32))), ~bvadd64(i, 4294967295bv32)))), ~bvor32(~bvshl32(~bvand32(~zero_extendFrom16To32(x), ~bvshl32(1bv32, ~bvadd64(i, 4294967295bv32))), ~bvadd64(i, 4294967295bv32)), ~bvshl32(~bvand32(~zero_extendFrom16To32(y), ~bvshl32(1bv32, ~bvadd64(i, 4294967295bv32))), i))) == z && ~bvadd64(i, 4294967283bv32) == 0bv32) || (~bvor32(~bvor32(~bvor32(~bvor32(0bv32, ~bvor32(~bvshl32(~bvand32(~zero_extendFrom16To32(x), ~bvshl32(1bv32, ~bvadd64(i, 4294967292bv32))), ~bvadd64(i, 4294967292bv32)), ~bvshl32(~bvand32(~zero_extendFrom16To32(y), ~bvshl32(1bv32, ~bvadd64(i, 4294967292bv32))), ~bvadd64(i, 4294967293bv32)))), ~bvor32(~bvshl32(~bvand32(~zero_extendFrom16To32(x), ~bvshl32(1bv32, ~bvadd64(i, 4294967293bv32))), ~bvadd64(i, 4294967293bv32)), ~bvshl32(~bvand32(~zero_extendFrom16To32(y), ~bvshl32(1bv32, ~bvadd64(i, 4294967293bv32))), ~bvadd64(i, 4294967294bv32)))), ~bvor32(~bvshl32(~bvand32(~zero_extendFrom16To32(x), ~bvshl32(1bv32, ~bvadd64(i, 4294967294bv32))), ~bvadd64(i, 4294967294bv32)), ~bvshl32(~bvand32(~zero_extendFrom16To32(y), ~bvshl32(1bv32, ~bvadd64(i, 4294967294bv32))), ~bvadd64(i, 4294967295bv32)))), ~bvor32(~bvshl32(~bvand32(~zero_extendFrom16To32(x), ~bvshl32(1bv32, ~bvadd64(i, 4294967295bv32))), ~bvadd64(i, 4294967295bv32)), ~bvshl32(~bvand32(~zero_extendFrom16To32(y), ~bvshl32(1bv32, ~bvadd64(i, 4294967295bv32))), i))) == z && 4bv32 == i)) || (~bvor32(~bvor32(~bvor32(~bvor32(~bvor32(~bvor32(~bvor32(~bvor32(~bvor32(~bvor32(0bv32, ~bvor32(~bvshl32(~bvand32(~zero_extendFrom16To32(x), 1bv32), 0bv32), ~bvshl32(~bvand32(~zero_extendFrom16To32(y), 1bv32), 1bv32))), ~bvor32(~bvshl32(~bvand32(~zero_extendFrom16To32(x), 2bv32), 1bv32), ~bvshl32(~bvand32(~zero_extendFrom16To32(y), 2bv32), 2bv32))), ~bvor32(~bvshl32(~bvand32(~zero_extendFrom16To32(x), 4bv32), 2bv32), ~bvshl32(~bvand32(~zero_extendFrom16To32(y), 4bv32), 3bv32))), ~bvor32(~bvshl32(~bvand32(~zero_extendFrom16To32(x), 8bv32), 3bv32), ~bvshl32(~bvand32(~zero_extendFrom16To32(y), 8bv32), 4bv32))), ~bvor32(~bvshl32(~bvand32(~zero_extendFrom16To32(x), 16bv32), 4bv32), ~bvshl32(~bvand32(~zero_extendFrom16To32(y), 16bv32), 5bv32))), ~bvor32(~bvshl32(~bvand32(~zero_extendFrom16To32(x), 32bv32), 5bv32), ~bvshl32(~bvand32(~zero_extendFrom16To32(y), 32bv32), 6bv32))), ~bvor32(~bvshl32(~bvand32(~zero_extendFrom16To32(x), 64bv32), 6bv32), ~bvshl32(~bvand32(~zero_extendFrom16To32(y), 64bv32), 7bv32))), ~bvor32(~bvshl32(~bvand32(~zero_extendFrom16To32(x), 128bv32), 7bv32), ~bvshl32(~bvand32(~zero_extendFrom16To32(y), 128bv32), 8bv32))), ~bvor32(~bvshl32(~bvand32(~zero_extendFrom16To32(x), 256bv32), 8bv32), ~bvshl32(~bvand32(~zero_extendFrom16To32(y), 256bv32), 9bv32))), ~bvor32(~bvshl32(~bvand32(~zero_extendFrom16To32(x), 512bv32), 9bv32), ~bvshl32(~bvand32(~zero_extendFrom16To32(y), 512bv32), 10bv32))) == z && ~bvadd64(i, 4294967286bv32) == 0bv32)) || (~bvadd64(i, 4294967288bv32) == 0bv32 && ~bvor32(~bvor32(~bvor32(~bvor32(~bvor32(~bvor32(~bvor32(~bvor32(0bv32, ~bvor32(~bvshl32(~bvand32(~zero_extendFrom16To32(x), 1bv32), 0bv32), ~bvshl32(~bvand32(~zero_extendFrom16To32(y), 1bv32), 1bv32))), ~bvor32(~bvshl32(~bvand32(~zero_extendFrom16To32(x), 2bv32), 1bv32), ~bvshl32(~bvand32(~zero_extendFrom16To32(y), 2bv32), 2bv32))), ~bvor32(~bvshl32(~bvand32(~zero_extendFrom16To32(x), 4bv32), 2bv32), ~bvshl32(~bvand32(~zero_extendFrom16To32(y), 4bv32), 3bv32))), ~bvor32(~bvshl32(~bvand32(~zero_extendFrom16To32(x), 8bv32), 3bv32), ~bvshl32(~bvand32(~zero_extendFrom16To32(y), 8bv32), 4bv32))), ~bvor32(~bvshl32(~bvand32(~zero_extendFrom16To32(x), 16bv32), 4bv32), ~bvshl32(~bvand32(~zero_extendFrom16To32(y), 16bv32), 5bv32))), ~bvor32(~bvshl32(~bvand32(~zero_extendFrom16To32(x), 32bv32), 5bv32), ~bvshl32(~bvand32(~zero_extendFrom16To32(y), 32bv32), 6bv32))), ~bvor32(~bvshl32(~bvand32(~zero_extendFrom16To32(x), 64bv32), 6bv32), ~bvshl32(~bvand32(~zero_extendFrom16To32(y), 64bv32), 7bv32))), ~bvor32(~bvshl32(~bvand32(~zero_extendFrom16To32(x), ~bvshl32(1bv32, ~bvadd64(i, 4294967295bv32))), ~bvadd64(i, 4294967295bv32)), ~bvshl32(~bvand32(~zero_extendFrom16To32(y), ~bvshl32(1bv32, ~bvadd64(i, 4294967295bv32))), i))) == z)) || (9bv32 == i && ~bvor32(~bvor32(~bvor32(~bvor32(~bvor32(~bvor32(~bvor32(~bvor32(~bvor32(0bv32, ~bvor32(~bvshl32(~bvand32(~zero_extendFrom16To32(x), 1bv32), 0bv32), ~bvshl32(~bvand32(~zero_extendFrom16To32(y), 1bv32), 1bv32))), ~bvor32(~bvshl32(~bvand32(~zero_extendFrom16To32(x), 2bv32), 1bv32), ~bvshl32(~bvand32(~zero_extendFrom16To32(y), 2bv32), 2bv32))), ~bvor32(~bvshl32(~bvand32(~zero_extendFrom16To32(x), 4bv32), 2bv32), ~bvshl32(~bvand32(~zero_extendFrom16To32(y), 4bv32), 3bv32))), ~bvor32(~bvshl32(~bvand32(~zero_extendFrom16To32(x), 8bv32), 3bv32), ~bvshl32(~bvand32(~zero_extendFrom16To32(y), 8bv32), 4bv32))), ~bvor32(~bvshl32(~bvand32(~zero_extendFrom16To32(x), 16bv32), 4bv32), ~bvshl32(~bvand32(~zero_extendFrom16To32(y), 16bv32), 5bv32))), ~bvor32(~bvshl32(~bvand32(~zero_extendFrom16To32(x), 32bv32), 5bv32), ~bvshl32(~bvand32(~zero_extendFrom16To32(y), 32bv32), 6bv32))), ~bvor32(~bvshl32(~bvand32(~zero_extendFrom16To32(x), 64bv32), 6bv32), ~bvshl32(~bvand32(~zero_extendFrom16To32(y), 64bv32), 7bv32))), ~bvor32(~bvshl32(~bvand32(~zero_extendFrom16To32(x), ~bvshl32(1bv32, ~bvadd64(i, 4294967294bv32))), ~bvadd64(i, 4294967294bv32)), ~bvshl32(~bvand32(~zero_extendFrom16To32(y), ~bvshl32(1bv32, ~bvadd64(i, 4294967294bv32))), ~bvadd64(i, 4294967295bv32)))), ~bvor32(~bvshl32(~bvand32(~zero_extendFrom16To32(x), ~bvshl32(1bv32, ~bvadd64(i, 4294967295bv32))), ~bvadd64(i, 4294967295bv32)), ~bvshl32(~bvand32(~zero_extendFrom16To32(y), ~bvshl32(1bv32, ~bvadd64(i, 4294967295bv32))), i))) == z)) || (~bvor32(~bvor32(~bvor32(~bvor32(~bvor32(0bv32, ~bvor32(~bvshl32(~bvand32(~zero_extendFrom16To32(x), 1bv32), 0bv32), ~bvshl32(~bvand32(~zero_extendFrom16To32(y), 1bv32), 1bv32))), ~bvor32(~bvshl32(~bvand32(~zero_extendFrom16To32(x), 2bv32), 1bv32), ~bvshl32(~bvand32(~zero_extendFrom16To32(y), 2bv32), 2bv32))), ~bvor32(~bvshl32(~bvand32(~zero_extendFrom16To32(x), 4bv32), 2bv32), ~bvshl32(~bvand32(~zero_extendFrom16To32(y), 4bv32), 3bv32))), ~bvor32(~bvshl32(~bvand32(~zero_extendFrom16To32(x), 8bv32), 3bv32), ~bvshl32(~bvand32(~zero_extendFrom16To32(y), 8bv32), 4bv32))), ~bvor32(~bvshl32(~bvand32(~zero_extendFrom16To32(x), 16bv32), 4bv32), ~bvshl32(~bvand32(~zero_extendFrom16To32(y), 16bv32), 5bv32))) == z && ~bvadd64(i, 4294967291bv32) == 0bv32)) || (~bvor32(0bv32, ~bvor32(~bvshl32(~bvand32(~zero_extendFrom16To32(x), ~bvshl32(1bv32, ~bvadd64(i, 4294967295bv32))), ~bvadd64(i, 4294967295bv32)), ~bvshl32(~bvand32(~zero_extendFrom16To32(y), ~bvshl32(1bv32, ~bvadd64(i, 4294967295bv32))), i))) == z && 1bv32 == i)) || (~bvor32(~bvor32(~bvor32(~bvor32(~bvor32(~bvor32(~bvor32(~bvor32(~bvor32(~bvor32(~bvor32(~bvor32(~bvor32(~bvor32(0bv32, ~bvor32(~bvshl32(~bvand32(~zero_extendFrom16To32(x), 1bv32), 0bv32), ~bvshl32(~bvand32(~zero_extendFrom16To32(y), 1bv32), 1bv32))), ~bvor32(~bvshl32(~bvand32(~zero_extendFrom16To32(x), 2bv32), 1bv32), ~bvshl32(~bvand32(~zero_extendFrom16To32(y), 2bv32), 2bv32))), ~bvor32(~bvshl32(~bvand32(~zero_extendFrom16To32(x), 4bv32), 2bv32), ~bvshl32(~bvand32(~zero_extendFrom16To32(y), 4bv32), 3bv32))), ~bvor32(~bvshl32(~bvand32(~zero_extendFrom16To32(x), 8bv32), 3bv32), ~bvshl32(~bvand32(~zero_extendFrom16To32(y), 8bv32), 4bv32))), ~bvor32(~bvshl32(~bvand32(~zero_extendFrom16To32(x), 16bv32), 4bv32), ~bvshl32(~bvand32(~zero_extendFrom16To32(y), 16bv32), 5bv32))), ~bvor32(~bvshl32(~bvand32(~zero_extendFrom16To32(x), 32bv32), 5bv32), ~bvshl32(~bvand32(~zero_extendFrom16To32(y), 32bv32), 6bv32))), ~bvor32(~bvshl32(~bvand32(~zero_extendFrom16To32(x), 64bv32), 6bv32), ~bvshl32(~bvand32(~zero_extendFrom16To32(y), 64bv32), 7bv32))), ~bvor32(~bvshl32(~bvand32(~zero_extendFrom16To32(x), 128bv32), 7bv32), ~bvshl32(~bvand32(~zero_extendFrom16To32(y), 128bv32), 8bv32))), ~bvor32(~bvshl32(~bvand32(~zero_extendFrom16To32(x), 256bv32), 8bv32), ~bvshl32(~bvand32(~zero_extendFrom16To32(y), 256bv32), 9bv32))), ~bvor32(~bvshl32(~bvand32(~zero_extendFrom16To32(x), 512bv32), 9bv32), ~bvshl32(~bvand32(~zero_extendFrom16To32(y), 512bv32), 10bv32))), ~bvor32(~bvshl32(~bvand32(~zero_extendFrom16To32(x), 1024bv32), 10bv32), ~bvshl32(~bvand32(~zero_extendFrom16To32(y), 1024bv32), 11bv32))), ~bvor32(~bvshl32(~bvand32(~zero_extendFrom16To32(x), 2048bv32), 11bv32), ~bvshl32(~bvand32(~zero_extendFrom16To32(y), 2048bv32), 12bv32))), ~bvor32(~bvshl32(~bvand32(~zero_extendFrom16To32(x), 4096bv32), 12bv32), ~bvshl32(~bvand32(~zero_extendFrom16To32(y), 4096bv32), 13bv32))), ~bvor32(~bvshl32(~bvand32(~zero_extendFrom16To32(x), 8192bv32), 13bv32), ~bvshl32(~bvand32(~zero_extendFrom16To32(y), 8192bv32), 14bv32))) == z && 14bv32 == i)) || (~bvadd64(i, 4294967294bv32) == 0bv32 && ~bvor32(~bvor32(0bv32, ~bvor32(~bvshl32(~bvand32(~zero_extendFrom16To32(x), ~bvshl32(1bv32, ~bvadd64(i, 4294967294bv32))), ~bvadd64(i, 4294967294bv32)), ~bvshl32(~bvand32(~zero_extendFrom16To32(y), ~bvshl32(1bv32, ~bvadd64(i, 4294967294bv32))), ~bvadd64(i, 4294967295bv32)))), ~bvor32(~bvshl32(~bvand32(~zero_extendFrom16To32(x), ~bvshl32(1bv32, ~bvadd64(i, 4294967295bv32))), ~bvadd64(i, 4294967295bv32)), ~bvshl32(~bvand32(~zero_extendFrom16To32(y), ~bvshl32(1bv32, ~bvadd64(i, 4294967295bv32))), i))) == z)) || (~bvadd64(i, 4294967290bv32) == 0bv32 && ~bvor32(~bvor32(~bvor32(~bvor32(~bvor32(~bvor32(0bv32, ~bvor32(~bvshl32(~bvand32(~zero_extendFrom16To32(x), 1bv32), 0bv32), ~bvshl32(~bvand32(~zero_extendFrom16To32(y), 1bv32), 1bv32))), ~bvor32(~bvshl32(~bvand32(~zero_extendFrom16To32(x), 2bv32), 1bv32), ~bvshl32(~bvand32(~zero_extendFrom16To32(y), 2bv32), 2bv32))), ~bvor32(~bvshl32(~bvand32(~zero_extendFrom16To32(x), 4bv32), 2bv32), ~bvshl32(~bvand32(~zero_extendFrom16To32(y), 4bv32), 3bv32))), ~bvor32(~bvshl32(~bvand32(~zero_extendFrom16To32(x), 8bv32), 3bv32), ~bvshl32(~bvand32(~zero_extendFrom16To32(y), 8bv32), 4bv32))), ~bvor32(~bvshl32(~bvand32(~zero_extendFrom16To32(x), 16bv32), 4bv32), ~bvshl32(~bvand32(~zero_extendFrom16To32(y), 16bv32), 5bv32))), ~bvor32(~bvshl32(~bvand32(~zero_extendFrom16To32(x), ~bvshl32(1bv32, ~bvadd64(i, 4294967295bv32))), ~bvadd64(i, 4294967295bv32)), ~bvshl32(~bvand32(~zero_extendFrom16To32(y), ~bvshl32(1bv32, ~bvadd64(i, 4294967295bv32))), i))) == z)) || (~bvor32(~bvor32(~bvor32(~bvor32(~bvor32(~bvor32(~bvor32(~bvor32(~bvor32(~bvor32(~bvor32(~bvor32(0bv32, ~bvor32(~bvshl32(~bvand32(~zero_extendFrom16To32(x), 1bv32), 0bv32), ~bvshl32(~bvand32(~zero_extendFrom16To32(y), 1bv32), 1bv32))), ~bvor32(~bvshl32(~bvand32(~zero_extendFrom16To32(x), 2bv32), 1bv32), ~bvshl32(~bvand32(~zero_extendFrom16To32(y), 2bv32), 2bv32))), ~bvor32(~bvshl32(~bvand32(~zero_extendFrom16To32(x), 4bv32), 2bv32), ~bvshl32(~bvand32(~zero_extendFrom16To32(y), 4bv32), 3bv32))), ~bvor32(~bvshl32(~bvand32(~zero_extendFrom16To32(x), 8bv32), 3bv32), ~bvshl32(~bvand32(~zero_extendFrom16To32(y), 8bv32), 4bv32))), ~bvor32(~bvshl32(~bvand32(~zero_extendFrom16To32(x), 16bv32), 4bv32), ~bvshl32(~bvand32(~zero_extendFrom16To32(y), 16bv32), 5bv32))), ~bvor32(~bvshl32(~bvand32(~zero_extendFrom16To32(x), 32bv32), 5bv32), ~bvshl32(~bvand32(~zero_extendFrom16To32(y), 32bv32), 6bv32))), ~bvor32(~bvshl32(~bvand32(~zero_extendFrom16To32(x), 64bv32), 6bv32), ~bvshl32(~bvand32(~zero_extendFrom16To32(y), 64bv32), 7bv32))), ~bvor32(~bvshl32(~bvand32(~zero_extendFrom16To32(x), 128bv32), 7bv32), ~bvshl32(~bvand32(~zero_extendFrom16To32(y), 128bv32), 8bv32))), ~bvor32(~bvshl32(~bvand32(~zero_extendFrom16To32(x), 256bv32), 8bv32), ~bvshl32(~bvand32(~zero_extendFrom16To32(y), 256bv32), 9bv32))), ~bvor32(~bvshl32(~bvand32(~zero_extendFrom16To32(x), 512bv32), 9bv32), ~bvshl32(~bvand32(~zero_extendFrom16To32(y), 512bv32), 10bv32))), ~bvor32(~bvshl32(~bvand32(~zero_extendFrom16To32(x), 1024bv32), 10bv32), ~bvshl32(~bvand32(~zero_extendFrom16To32(y), 1024bv32), 11bv32))), ~bvor32(~bvshl32(~bvand32(~zero_extendFrom16To32(x), ~bvshl32(1bv32, ~bvadd64(i, 4294967295bv32))), ~bvadd64(i, 4294967295bv32)), ~bvshl32(~bvand32(~zero_extendFrom16To32(y), ~bvshl32(1bv32, ~bvadd64(i, 4294967295bv32))), i))) == z && 12bv32 == i)) || (~bvor32(~bvor32(~bvor32(~bvor32(~bvor32(~bvor32(~bvor32(~bvor32(~bvor32(~bvor32(~bvor32(~bvor32(~bvor32(~bvor32(~bvor32(0bv32, ~bvor32(~bvshl32(~bvand32(~zero_extendFrom16To32(x), 1bv32), 0bv32), ~bvshl32(~bvand32(~zero_extendFrom16To32(y), 1bv32), 1bv32))), ~bvor32(~bvshl32(~bvand32(~zero_extendFrom16To32(x), 2bv32), 1bv32), ~bvshl32(~bvand32(~zero_extendFrom16To32(y), 2bv32), 2bv32))), ~bvor32(~bvshl32(~bvand32(~zero_extendFrom16To32(x), 4bv32), 2bv32), ~bvshl32(~bvand32(~zero_extendFrom16To32(y), 4bv32), 3bv32))), ~bvor32(~bvshl32(~bvand32(~zero_extendFrom16To32(x), 8bv32), 3bv32), ~bvshl32(~bvand32(~zero_extendFrom16To32(y), 8bv32), 4bv32))), ~bvor32(~bvshl32(~bvand32(~zero_extendFrom16To32(x), 16bv32), 4bv32), ~bvshl32(~bvand32(~zero_extendFrom16To32(y), 16bv32), 5bv32))), ~bvor32(~bvshl32(~bvand32(~zero_extendFrom16To32(x), 32bv32), 5bv32), ~bvshl32(~bvand32(~zero_extendFrom16To32(y), 32bv32), 6bv32))), ~bvor32(~bvshl32(~bvand32(~zero_extendFrom16To32(x), 64bv32), 6bv32), ~bvshl32(~bvand32(~zero_extendFrom16To32(y), 64bv32), 7bv32))), ~bvor32(~bvshl32(~bvand32(~zero_extendFrom16To32(x), 128bv32), 7bv32), ~bvshl32(~bvand32(~zero_extendFrom16To32(y), 128bv32), 8bv32))), ~bvor32(~bvshl32(~bvand32(~zero_extendFrom16To32(x), 256bv32), 8bv32), ~bvshl32(~bvand32(~zero_extendFrom16To32(y), 256bv32), 9bv32))), ~bvor32(~bvshl32(~bvand32(~zero_extendFrom16To32(x), 512bv32), 9bv32), ~bvshl32(~bvand32(~zero_extendFrom16To32(y), 512bv32), 10bv32))), ~bvor32(~bvshl32(~bvand32(~zero_extendFrom16To32(x), 1024bv32), 10bv32), ~bvshl32(~bvand32(~zero_extendFrom16To32(y), 1024bv32), 11bv32))), ~bvor32(~bvshl32(~bvand32(~zero_extendFrom16To32(x), 2048bv32), 11bv32), ~bvshl32(~bvand32(~zero_extendFrom16To32(y), 2048bv32), 12bv32))), ~bvor32(~bvshl32(~bvand32(~zero_extendFrom16To32(x), 4096bv32), 12bv32), ~bvshl32(~bvand32(~zero_extendFrom16To32(y), 4096bv32), 13bv32))), ~bvor32(~bvshl32(~bvand32(~zero_extendFrom16To32(x), 8192bv32), 13bv32), ~bvshl32(~bvand32(~zero_extendFrom16To32(y), 8192bv32), 14bv32))), ~bvor32(~bvshl32(~bvand32(~zero_extendFrom16To32(x), 16384bv32), 14bv32), ~bvshl32(~bvand32(~zero_extendFrom16To32(y), 16384bv32), 15bv32))) == z && 15bv32 == i)) || (~bvor32(~bvor32(~bvor32(0bv32, ~bvor32(~bvshl32(~bvand32(~zero_extendFrom16To32(x), ~bvshl32(1bv32, ~bvadd64(i, 4294967293bv32))), ~bvadd64(i, 4294967293bv32)), ~bvshl32(~bvand32(~zero_extendFrom16To32(y), ~bvshl32(1bv32, ~bvadd64(i, 4294967293bv32))), ~bvadd64(i, 4294967294bv32)))), ~bvor32(~bvshl32(~bvand32(~zero_extendFrom16To32(x), ~bvshl32(1bv32, ~bvadd64(i, 4294967294bv32))), ~bvadd64(i, 4294967294bv32)), ~bvshl32(~bvand32(~zero_extendFrom16To32(y), ~bvshl32(1bv32, ~bvadd64(i, 4294967294bv32))), ~bvadd64(i, 4294967295bv32)))), ~bvor32(~bvshl32(~bvand32(~zero_extendFrom16To32(x), ~bvshl32(1bv32, ~bvadd64(i, 4294967295bv32))), ~bvadd64(i, 4294967295bv32)), ~bvshl32(~bvand32(~zero_extendFrom16To32(y), ~bvshl32(1bv32, ~bvadd64(i, 4294967295bv32))), i))) == z && ~bvadd64(i, 4294967293bv32) == 0bv32)) || (~bvor32(~bvor32(~bvor32(~bvor32(~bvor32(~bvor32(~bvor32(0bv32, ~bvor32(~bvshl32(~bvand32(~zero_extendFrom16To32(x), 1bv32), 0bv32), ~bvshl32(~bvand32(~zero_extendFrom16To32(y), 1bv32), 1bv32))), ~bvor32(~bvshl32(~bvand32(~zero_extendFrom16To32(x), 2bv32), 1bv32), ~bvshl32(~bvand32(~zero_extendFrom16To32(y), 2bv32), 2bv32))), ~bvor32(~bvshl32(~bvand32(~zero_extendFrom16To32(x), 4bv32), 2bv32), ~bvshl32(~bvand32(~zero_extendFrom16To32(y), 4bv32), 3bv32))), ~bvor32(~bvshl32(~bvand32(~zero_extendFrom16To32(x), 8bv32), 3bv32), ~bvshl32(~bvand32(~zero_extendFrom16To32(y), 8bv32), 4bv32))), ~bvor32(~bvshl32(~bvand32(~zero_extendFrom16To32(x), 16bv32), 4bv32), ~bvshl32(~bvand32(~zero_extendFrom16To32(y), 16bv32), 5bv32))), ~bvor32(~bvshl32(~bvand32(~zero_extendFrom16To32(x), 32bv32), 5bv32), ~bvshl32(~bvand32(~zero_extendFrom16To32(y), 32bv32), 6bv32))), ~bvor32(~bvshl32(~bvand32(~zero_extendFrom16To32(x), 64bv32), 6bv32), ~bvshl32(~bvand32(~zero_extendFrom16To32(y), 64bv32), 7bv32))) == z && 7bv32 == i)) || z == ~bvor32(~bvor32(~bvor32(~bvor32(~bvor32(~bvor32(~bvor32(~bvor32(~bvor32(~bvor32(~bvor32(~bvor32(~bvor32(~bvor32(~bvor32(~bvor32(0bv32, ~bvor32(~bvshl32(~bvand32(~zero_extendFrom16To32(x), 1bv32), 0bv32), ~bvshl32(~bvand32(~zero_extendFrom16To32(y), 1bv32), 1bv32))), ~bvor32(~bvshl32(~bvand32(~zero_extendFrom16To32(x), 2bv32), 1bv32), ~bvshl32(~bvand32(~zero_extendFrom16To32(y), 2bv32), 2bv32))), ~bvor32(~bvshl32(~bvand32(~zero_extendFrom16To32(x), 4bv32), 2bv32), ~bvshl32(~bvand32(~zero_extendFrom16To32(y), 4bv32), 3bv32))), ~bvor32(~bvshl32(~bvand32(~zero_extendFrom16To32(x), 8bv32), 3bv32), ~bvshl32(~bvand32(~zero_extendFrom16To32(y), 8bv32), 4bv32))), ~bvor32(~bvshl32(~bvand32(~zero_extendFrom16To32(x), 16bv32), 4bv32), ~bvshl32(~bvand32(~zero_extendFrom16To32(y), 16bv32), 5bv32))), ~bvor32(~bvshl32(~bvand32(~zero_extendFrom16To32(x), 32bv32), 5bv32), ~bvshl32(~bvand32(~zero_extendFrom16To32(y), 32bv32), 6bv32))), ~bvor32(~bvshl32(~bvand32(~zero_extendFrom16To32(x), 64bv32), 6bv32), ~bvshl32(~bvand32(~zero_extendFrom16To32(y), 64bv32), 7bv32))), ~bvor32(~bvshl32(~bvand32(~zero_extendFrom16To32(x), 128bv32), 7bv32), ~bvshl32(~bvand32(~zero_extendFrom16To32(y), 128bv32), 8bv32))), ~bvor32(~bvshl32(~bvand32(~zero_extendFrom16To32(x), 256bv32), 8bv32), ~bvshl32(~bvand32(~zero_extendFrom16To32(y), 256bv32), 9bv32))), ~bvor32(~bvshl32(~bvand32(~zero_extendFrom16To32(x), 512bv32), 9bv32), ~bvshl32(~bvand32(~zero_extendFrom16To32(y), 512bv32), 10bv32))), ~bvor32(~bvshl32(~bvand32(~zero_extendFrom16To32(x), 1024bv32), 10bv32), ~bvshl32(~bvand32(~zero_extendFrom16To32(y), 1024bv32), 11bv32))), ~bvor32(~bvshl32(~bvand32(~zero_extendFrom16To32(x), 2048bv32), 11bv32), ~bvshl32(~bvand32(~zero_extendFrom16To32(y), 2048bv32), 12bv32))), ~bvor32(~bvshl32(~bvand32(~zero_extendFrom16To32(x), 4096bv32), 12bv32), ~bvshl32(~bvand32(~zero_extendFrom16To32(y), 4096bv32), 13bv32))), ~bvor32(~bvshl32(~bvand32(~zero_extendFrom16To32(x), 8192bv32), 13bv32), ~bvshl32(~bvand32(~zero_extendFrom16To32(y), 8192bv32), 14bv32))), ~bvor32(~bvshl32(~bvand32(~zero_extendFrom16To32(x), 16384bv32), 14bv32), ~bvshl32(~bvand32(~zero_extendFrom16To32(y), 16384bv32), 15bv32))), ~bvor32(~bvshl32(~bvand32(~zero_extendFrom16To32(x), 32768bv32), 15bv32), ~bvshl32(~bvand32(~zero_extendFrom16To32(y), 32768bv32), 16bv32)))) || (11bv32 == i && ~bvor32(~bvor32(~bvor32(~bvor32(~bvor32(~bvor32(~bvor32(~bvor32(~bvor32(~bvor32(~bvor32(0bv32, ~bvor32(~bvshl32(~bvand32(~zero_extendFrom16To32(x), 1bv32), 0bv32), ~bvshl32(~bvand32(~zero_extendFrom16To32(y), 1bv32), 1bv32))), ~bvor32(~bvshl32(~bvand32(~zero_extendFrom16To32(x), 2bv32), 1bv32), ~bvshl32(~bvand32(~zero_extendFrom16To32(y), 2bv32), 2bv32))), ~bvor32(~bvshl32(~bvand32(~zero_extendFrom16To32(x), 4bv32), 2bv32), ~bvshl32(~bvand32(~zero_extendFrom16To32(y), 4bv32), 3bv32))), ~bvor32(~bvshl32(~bvand32(~zero_extendFrom16To32(x), 8bv32), 3bv32), ~bvshl32(~bvand32(~zero_extendFrom16To32(y), 8bv32), 4bv32))), ~bvor32(~bvshl32(~bvand32(~zero_extendFrom16To32(x), 16bv32), 4bv32), ~bvshl32(~bvand32(~zero_extendFrom16To32(y), 16bv32), 5bv32))), ~bvor32(~bvshl32(~bvand32(~zero_extendFrom16To32(x), 32bv32), 5bv32), ~bvshl32(~bvand32(~zero_extendFrom16To32(y), 32bv32), 6bv32))), ~bvor32(~bvshl32(~bvand32(~zero_extendFrom16To32(x), 64bv32), 6bv32), ~bvshl32(~bvand32(~zero_extendFrom16To32(y), 64bv32), 7bv32))), ~bvor32(~bvshl32(~bvand32(~zero_extendFrom16To32(x), 128bv32), 7bv32), ~bvshl32(~bvand32(~zero_extendFrom16To32(y), 128bv32), 8bv32))), ~bvor32(~bvshl32(~bvand32(~zero_extendFrom16To32(x), 256bv32), 8bv32), ~bvshl32(~bvand32(~zero_extendFrom16To32(y), 256bv32), 9bv32))), ~bvor32(~bvshl32(~bvand32(~zero_extendFrom16To32(x), 512bv32), 9bv32), ~bvshl32(~bvand32(~zero_extendFrom16To32(y), 512bv32), 10bv32))), ~bvor32(~bvshl32(~bvand32(~zero_extendFrom16To32(x), 1024bv32), 10bv32), ~bvshl32(~bvand32(~zero_extendFrom16To32(y), 1024bv32), 11bv32))) == z)) || (0bv32 == i && 0bv32 == z) - InvariantResult [Line: 1]: Loop Invariant Derived loop invariant: 1 - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 9 locations, 1 error locations. Result: SAFE, OverallTime: 41.4s, OverallIterations: 5, TraceHistogramMax: 16, AutomataDifference: 7.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 1.4s, HoareTripleCheckerStatistics: 24 SDtfs, 60 SDslu, 67 SDs, 0 SdLazy, 577 SolverSat, 78 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 2.0s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 140 GetRequests, 28 SyntacticMatches, 2 SemanticMatches, 110 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 239 ImplicationChecksByTransitivity, 35.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=36occurred in iteration=4, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 5 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 2 LocationsWithAnnotation, 2 PreInvPairs, 33 NumberOfFragments, 2221 HoareAnnotationTreeSize, 2 FomulaSimplifications, 3445 FormulaSimplificationTreeSizeReduction, 0.1s HoareSimplificationTime, 2 FomulaSimplificationsInter, 262 FormulaSimplificationTreeSizeReductionInter, 1.2s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 30.9s InterpolantComputationTime, 63 NumberOfCodeBlocks, 63 NumberOfCodeBlocksAsserted, 13 NumberOfCheckSat, 116 ConstructedInterpolants, 0 QuantifiedInterpolants, 192088 SizeOfPredicates, 14 NumberOfNonLiveVariables, 184 ConjunctsInSsa, 70 ConjunctsInUnsatCore, 10 InterpolantComputations, 2 PerfectInterpolantSequences, 120/530 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...