./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 678e0110 Calling Ultimate with: /usr/lib/jvm/java-8-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/run_dir_b1b602ea-99a1-463c-ac63-515b0333462a/bin/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/run_dir_b1b602ea-99a1-463c-ac63-515b0333462a/bin/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_b1b602ea-99a1-463c-ac63-515b0333462a/bin/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_b1b602ea-99a1-463c-ac63-515b0333462a/bin/uautomizer/config/AutomizerReach.xml -i ../../sv-benchmarks/c/bitvector/interleave_bits.i -s /tmp/vcloud-vcloud-master/worker/run_dir_b1b602ea-99a1-463c-ac63-515b0333462a/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_b1b602ea-99a1-463c-ac63-515b0333462a/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_b1b602ea-99a1-463c-ac63-515b0333462a/bin/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/run_dir_b1b602ea-99a1-463c-ac63-515b0333462a/bin/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_b1b602ea-99a1-463c-ac63-515b0333462a/bin/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_b1b602ea-99a1-463c-ac63-515b0333462a/bin/uautomizer/config/AutomizerReach.xml -i ../../sv-benchmarks/c/bitvector/interleave_bits.i -s /tmp/vcloud-vcloud-master/worker/run_dir_b1b602ea-99a1-463c-ac63-515b0333462a/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_b1b602ea-99a1-463c-ac63-515b0333462a/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-678e011 [2019-11-20 01:48:56,690 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-20 01:48:56,692 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-20 01:48:56,710 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-20 01:48:56,710 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-20 01:48:56,712 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-20 01:48:56,714 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-20 01:48:56,723 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-20 01:48:56,728 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-20 01:48:56,732 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-20 01:48:56,734 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-20 01:48:56,735 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-20 01:48:56,735 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-20 01:48:56,737 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-20 01:48:56,738 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-20 01:48:56,739 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-20 01:48:56,740 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-20 01:48:56,741 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-20 01:48:56,743 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-20 01:48:56,747 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-20 01:48:56,750 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-20 01:48:56,752 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-20 01:48:56,755 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-20 01:48:56,756 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-20 01:48:56,758 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-20 01:48:56,758 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-20 01:48:56,758 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-20 01:48:56,760 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-20 01:48:56,760 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-20 01:48:56,761 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-20 01:48:56,761 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-20 01:48:56,762 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-20 01:48:56,763 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-20 01:48:56,763 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-20 01:48:56,764 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-20 01:48:56,764 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-20 01:48:56,765 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-20 01:48:56,765 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-20 01:48:56,765 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-20 01:48:56,766 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-20 01:48:56,767 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-20 01:48:56,768 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_b1b602ea-99a1-463c-ac63-515b0333462a/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf [2019-11-20 01:48:56,792 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-20 01:48:56,792 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-20 01:48:56,793 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-20 01:48:56,793 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-20 01:48:56,793 INFO L138 SettingsManager]: * Use SBE=true [2019-11-20 01:48:56,794 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-20 01:48:56,794 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-20 01:48:56,794 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-20 01:48:56,794 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-20 01:48:56,794 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-20 01:48:56,794 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-11-20 01:48:56,795 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-20 01:48:56,795 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-11-20 01:48:56,795 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-20 01:48:56,795 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-20 01:48:56,795 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-20 01:48:56,795 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-11-20 01:48:56,796 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-20 01:48:56,796 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-20 01:48:56,796 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-20 01:48:56,796 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-20 01:48:56,796 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-20 01:48:56,797 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-20 01:48:56,797 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-20 01:48:56,797 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-11-20 01:48:56,797 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-11-20 01:48:56,797 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-11-20 01:48:56,797 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-11-20 01:48:56,798 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_b1b602ea-99a1-463c-ac63-515b0333462a/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-20 01:48:56,964 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-20 01:48:56,975 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-20 01:48:56,978 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-20 01:48:56,980 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-20 01:48:56,980 INFO L275 PluginConnector]: CDTParser initialized [2019-11-20 01:48:56,981 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_b1b602ea-99a1-463c-ac63-515b0333462a/bin/uautomizer/../../sv-benchmarks/c/bitvector/interleave_bits.i [2019-11-20 01:48:57,037 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_b1b602ea-99a1-463c-ac63-515b0333462a/bin/uautomizer/data/f79bed560/18aaa365edd2404ea6af15506388c8e7/FLAGb805c29b4 [2019-11-20 01:48:57,424 INFO L306 CDTParser]: Found 1 translation units. [2019-11-20 01:48:57,425 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_b1b602ea-99a1-463c-ac63-515b0333462a/sv-benchmarks/c/bitvector/interleave_bits.i [2019-11-20 01:48:57,432 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_b1b602ea-99a1-463c-ac63-515b0333462a/bin/uautomizer/data/f79bed560/18aaa365edd2404ea6af15506388c8e7/FLAGb805c29b4 [2019-11-20 01:48:57,449 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_b1b602ea-99a1-463c-ac63-515b0333462a/bin/uautomizer/data/f79bed560/18aaa365edd2404ea6af15506388c8e7 [2019-11-20 01:48:57,452 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-20 01:48:57,454 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-11-20 01:48:57,458 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-20 01:48:57,459 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-20 01:48:57,463 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-20 01:48:57,463 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.11 01:48:57" (1/1) ... [2019-11-20 01:48:57,466 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6f0b58a0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 01:48:57, skipping insertion in model container [2019-11-20 01:48:57,467 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.11 01:48:57" (1/1) ... [2019-11-20 01:48:57,474 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-11-20 01:48:57,500 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-11-20 01:48:57,728 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-20 01:48:57,736 INFO L188 MainTranslator]: Completed pre-run [2019-11-20 01:48:57,764 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-20 01:48:57,776 INFO L192 MainTranslator]: Completed translation [2019-11-20 01:48:57,777 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 01:48:57 WrapperNode [2019-11-20 01:48:57,777 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-20 01:48:57,778 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-11-20 01:48:57,778 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-11-20 01:48:57,778 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-11-20 01:48:57,786 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 01:48:57" (1/1) ... [2019-11-20 01:48:57,792 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 01:48:57" (1/1) ... [2019-11-20 01:48:57,816 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-11-20 01:48:57,817 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-20 01:48:57,818 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-20 01:48:57,818 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-20 01:48:57,825 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 01:48:57" (1/1) ... [2019-11-20 01:48:57,826 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 01:48:57" (1/1) ... [2019-11-20 01:48:57,826 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 01:48:57" (1/1) ... [2019-11-20 01:48:57,827 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 01:48:57" (1/1) ... [2019-11-20 01:48:57,830 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 01:48:57" (1/1) ... [2019-11-20 01:48:57,837 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 01:48:57" (1/1) ... [2019-11-20 01:48:57,838 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 01:48:57" (1/1) ... [2019-11-20 01:48:57,840 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-20 01:48:57,840 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-20 01:48:57,840 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-20 01:48:57,840 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-20 01:48:57,846 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 01:48:57" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_b1b602ea-99a1-463c-ac63-515b0333462a/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-20 01:48:57,904 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-20 01:48:57,904 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-20 01:48:58,075 INFO L280 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-20 01:48:58,076 INFO L285 CfgBuilder]: Removed 7 assume(true) statements. [2019-11-20 01:48:58,078 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 01:48:58 BoogieIcfgContainer [2019-11-20 01:48:58,078 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-20 01:48:58,079 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-20 01:48:58,079 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-20 01:48:58,082 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-20 01:48:58,083 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.11 01:48:57" (1/3) ... [2019-11-20 01:48:58,085 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5133d1b9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.11 01:48:58, skipping insertion in model container [2019-11-20 01:48:58,085 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 01:48:57" (2/3) ... [2019-11-20 01:48:58,086 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5133d1b9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.11 01:48:58, skipping insertion in model container [2019-11-20 01:48:58,086 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 01:48:58" (3/3) ... [2019-11-20 01:48:58,088 INFO L109 eAbstractionObserver]: Analyzing ICFG interleave_bits.i [2019-11-20 01:48:58,096 INFO L153 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-20 01:48:58,102 INFO L165 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-11-20 01:48:58,112 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-11-20 01:48:58,145 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-20 01:48:58,145 INFO L374 AbstractCegarLoop]: Hoare is true [2019-11-20 01:48:58,145 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-20 01:48:58,145 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-20 01:48:58,146 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-20 01:48:58,146 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-20 01:48:58,146 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-20 01:48:58,147 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-20 01:48:58,160 INFO L276 IsEmpty]: Start isEmpty. Operand 9 states. [2019-11-20 01:48:58,165 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-11-20 01:48:58,165 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 01:48:58,166 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-11-20 01:48:58,166 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 01:48:58,171 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 01:48:58,172 INFO L82 PathProgramCache]: Analyzing trace with hash 29805000, now seen corresponding path program 1 times [2019-11-20 01:48:58,180 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 01:48:58,181 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1339552535] [2019-11-20 01:48:58,181 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 01:48:58,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 01:48:58,394 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 01:48:58,395 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1339552535] [2019-11-20 01:48:58,395 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 01:48:58,396 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-20 01:48:58,398 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [97046485] [2019-11-20 01:48:58,402 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-20 01:48:58,403 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 01:48:58,423 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-20 01:48:58,424 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-20 01:48:58,426 INFO L87 Difference]: Start difference. First operand 9 states. Second operand 3 states. [2019-11-20 01:48:58,454 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 01:48:58,455 INFO L93 Difference]: Finished difference Result 17 states and 21 transitions. [2019-11-20 01:48:58,455 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-20 01:48:58,457 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 5 [2019-11-20 01:48:58,457 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 01:48:58,466 INFO L225 Difference]: With dead ends: 17 [2019-11-20 01:48:58,466 INFO L226 Difference]: Without dead ends: 7 [2019-11-20 01:48:58,484 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-20 01:48:58,509 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7 states. [2019-11-20 01:48:58,521 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7 to 7. [2019-11-20 01:48:58,523 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2019-11-20 01:48:58,523 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 7 transitions. [2019-11-20 01:48:58,525 INFO L78 Accepts]: Start accepts. Automaton has 7 states and 7 transitions. Word has length 5 [2019-11-20 01:48:58,525 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 01:48:58,525 INFO L462 AbstractCegarLoop]: Abstraction has 7 states and 7 transitions. [2019-11-20 01:48:58,525 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-20 01:48:58,525 INFO L276 IsEmpty]: Start isEmpty. Operand 7 states and 7 transitions. [2019-11-20 01:48:58,526 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-11-20 01:48:58,526 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 01:48:58,526 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2019-11-20 01:48:58,526 INFO L410 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 01:48:58,527 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 01:48:58,527 INFO L82 PathProgramCache]: Analyzing trace with hash 925620370, now seen corresponding path program 1 times [2019-11-20 01:48:58,527 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 01:48:58,527 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [348850665] [2019-11-20 01:48:58,528 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 01:48:58,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 01:48:58,617 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-20 01:48:58,617 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [348850665] [2019-11-20 01:48:58,617 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [718305692] [2019-11-20 01:48:58,618 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_b1b602ea-99a1-463c-ac63-515b0333462a/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-20 01:48:58,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 01:48:58,666 INFO L255 TraceCheckSpWp]: Trace formula consists of 21 conjuncts, 5 conjunts are in the unsatisfiable core [2019-11-20 01:48:58,670 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 01:48:58,719 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-20 01:48:58,719 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-20 01:48:58,719 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3] total 4 [2019-11-20 01:48:58,720 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [576368337] [2019-11-20 01:48:58,721 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-20 01:48:58,721 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 01:48:58,722 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-20 01:48:58,722 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-20 01:48:58,722 INFO L87 Difference]: Start difference. First operand 7 states and 7 transitions. Second operand 5 states. [2019-11-20 01:48:58,740 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 01:48:58,740 INFO L93 Difference]: Finished difference Result 12 states and 12 transitions. [2019-11-20 01:48:58,741 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-20 01:48:58,741 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 6 [2019-11-20 01:48:58,741 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 01:48:58,741 INFO L225 Difference]: With dead ends: 12 [2019-11-20 01:48:58,742 INFO L226 Difference]: Without dead ends: 8 [2019-11-20 01:48:58,743 INFO L630 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-20 01:48:58,743 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8 states. [2019-11-20 01:48:58,744 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8 to 8. [2019-11-20 01:48:58,745 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2019-11-20 01:48:58,745 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 8 transitions. [2019-11-20 01:48:58,745 INFO L78 Accepts]: Start accepts. Automaton has 8 states and 8 transitions. Word has length 6 [2019-11-20 01:48:58,746 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 01:48:58,746 INFO L462 AbstractCegarLoop]: Abstraction has 8 states and 8 transitions. [2019-11-20 01:48:58,746 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-20 01:48:58,746 INFO L276 IsEmpty]: Start isEmpty. Operand 8 states and 8 transitions. [2019-11-20 01:48:58,746 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-11-20 01:48:58,747 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 01:48:58,747 INFO L410 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1] [2019-11-20 01:48:58,950 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-20 01:48:58,955 INFO L410 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 01:48:58,955 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 01:48:58,955 INFO L82 PathProgramCache]: Analyzing trace with hash -1368874232, now seen corresponding path program 2 times [2019-11-20 01:48:58,955 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 01:48:58,956 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1911295705] [2019-11-20 01:48:58,956 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 01:48:58,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 01:48:59,044 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-20 01:48:59,044 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1911295705] [2019-11-20 01:48:59,044 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [710538833] [2019-11-20 01:48:59,044 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_b1b602ea-99a1-463c-ac63-515b0333462a/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-20 01:48:59,091 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-11-20 01:48:59,091 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-20 01:48:59,092 INFO L255 TraceCheckSpWp]: Trace formula consists of 24 conjuncts, 7 conjunts are in the unsatisfiable core [2019-11-20 01:48:59,093 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 01:48:59,121 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-20 01:48:59,121 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-20 01:48:59,121 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 5 [2019-11-20 01:48:59,121 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1844251796] [2019-11-20 01:48:59,122 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-20 01:48:59,122 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 01:48:59,122 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-20 01:48:59,123 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2019-11-20 01:48:59,123 INFO L87 Difference]: Start difference. First operand 8 states and 8 transitions. Second operand 6 states. [2019-11-20 01:48:59,157 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 01:48:59,158 INFO L93 Difference]: Finished difference Result 13 states and 13 transitions. [2019-11-20 01:48:59,159 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-20 01:48:59,159 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 7 [2019-11-20 01:48:59,160 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 01:48:59,160 INFO L225 Difference]: With dead ends: 13 [2019-11-20 01:48:59,160 INFO L226 Difference]: Without dead ends: 9 [2019-11-20 01:48:59,161 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 5 SyntacticMatches, 1 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2019-11-20 01:48:59,161 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9 states. [2019-11-20 01:48:59,163 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9 to 9. [2019-11-20 01:48:59,164 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2019-11-20 01:48:59,165 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 9 transitions. [2019-11-20 01:48:59,166 INFO L78 Accepts]: Start accepts. Automaton has 9 states and 9 transitions. Word has length 7 [2019-11-20 01:48:59,166 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 01:48:59,166 INFO L462 AbstractCegarLoop]: Abstraction has 9 states and 9 transitions. [2019-11-20 01:48:59,166 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-20 01:48:59,167 INFO L276 IsEmpty]: Start isEmpty. Operand 9 states and 9 transitions. [2019-11-20 01:48:59,167 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2019-11-20 01:48:59,167 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 01:48:59,168 INFO L410 BasicCegarLoop]: trace histogram [3, 1, 1, 1, 1, 1] [2019-11-20 01:48:59,370 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-20 01:48:59,371 INFO L410 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 01:48:59,371 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 01:48:59,371 INFO L82 PathProgramCache]: Analyzing trace with hash 516237138, now seen corresponding path program 3 times [2019-11-20 01:48:59,371 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 01:48:59,372 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [317653930] [2019-11-20 01:48:59,372 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 01:48:59,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 01:48:59,486 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-20 01:48:59,486 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [317653930] [2019-11-20 01:48:59,486 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1193503390] [2019-11-20 01:48:59,486 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_b1b602ea-99a1-463c-ac63-515b0333462a/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-20 01:48:59,520 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2019-11-20 01:48:59,520 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-20 01:48:59,521 INFO L255 TraceCheckSpWp]: Trace formula consists of 27 conjuncts, 9 conjunts are in the unsatisfiable core [2019-11-20 01:48:59,522 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 01:48:59,545 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-20 01:48:59,545 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-20 01:48:59,545 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 6 [2019-11-20 01:48:59,546 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2127563335] [2019-11-20 01:48:59,547 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-11-20 01:48:59,547 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 01:48:59,547 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-11-20 01:48:59,547 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-11-20 01:48:59,548 INFO L87 Difference]: Start difference. First operand 9 states and 9 transitions. Second operand 7 states. [2019-11-20 01:48:59,585 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 01:48:59,586 INFO L93 Difference]: Finished difference Result 14 states and 14 transitions. [2019-11-20 01:48:59,587 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-20 01:48:59,587 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 8 [2019-11-20 01:48:59,588 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 01:48:59,588 INFO L225 Difference]: With dead ends: 14 [2019-11-20 01:48:59,588 INFO L226 Difference]: Without dead ends: 10 [2019-11-20 01:48:59,589 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 6 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-11-20 01:48:59,589 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10 states. [2019-11-20 01:48:59,591 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10 to 10. [2019-11-20 01:48:59,591 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2019-11-20 01:48:59,592 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 10 transitions. [2019-11-20 01:48:59,592 INFO L78 Accepts]: Start accepts. Automaton has 10 states and 10 transitions. Word has length 8 [2019-11-20 01:48:59,592 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 01:48:59,592 INFO L462 AbstractCegarLoop]: Abstraction has 10 states and 10 transitions. [2019-11-20 01:48:59,592 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-11-20 01:48:59,592 INFO L276 IsEmpty]: Start isEmpty. Operand 10 states and 10 transitions. [2019-11-20 01:48:59,593 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2019-11-20 01:48:59,593 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 01:48:59,593 INFO L410 BasicCegarLoop]: trace histogram [4, 1, 1, 1, 1, 1] [2019-11-20 01:48:59,798 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-20 01:48:59,798 INFO L410 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 01:48:59,798 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 01:48:59,799 INFO L82 PathProgramCache]: Analyzing trace with hash -1174852536, now seen corresponding path program 4 times [2019-11-20 01:48:59,799 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 01:48:59,799 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1397430072] [2019-11-20 01:48:59,799 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 01:48:59,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 01:48:59,909 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-20 01:48:59,909 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1397430072] [2019-11-20 01:48:59,909 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1326014449] [2019-11-20 01:48:59,910 INFO L92 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_b1b602ea-99a1-463c-ac63-515b0333462a/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-20 01:48:59,944 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-11-20 01:48:59,944 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-20 01:48:59,945 INFO L255 TraceCheckSpWp]: Trace formula consists of 30 conjuncts, 11 conjunts are in the unsatisfiable core [2019-11-20 01:48:59,945 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 01:48:59,970 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-20 01:48:59,970 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-20 01:48:59,971 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 7 [2019-11-20 01:48:59,971 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1792400988] [2019-11-20 01:48:59,971 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-11-20 01:48:59,971 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 01:48:59,972 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-11-20 01:48:59,972 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2019-11-20 01:48:59,972 INFO L87 Difference]: Start difference. First operand 10 states and 10 transitions. Second operand 8 states. [2019-11-20 01:49:00,023 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 01:49:00,023 INFO L93 Difference]: Finished difference Result 15 states and 15 transitions. [2019-11-20 01:49:00,024 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-11-20 01:49:00,024 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 9 [2019-11-20 01:49:00,025 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 01:49:00,025 INFO L225 Difference]: With dead ends: 15 [2019-11-20 01:49:00,025 INFO L226 Difference]: Without dead ends: 11 [2019-11-20 01:49:00,026 INFO L630 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-20 01:49:00,026 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11 states. [2019-11-20 01:49:00,028 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11 to 11. [2019-11-20 01:49:00,028 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2019-11-20 01:49:00,028 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 11 transitions. [2019-11-20 01:49:00,028 INFO L78 Accepts]: Start accepts. Automaton has 11 states and 11 transitions. Word has length 9 [2019-11-20 01:49:00,029 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 01:49:00,029 INFO L462 AbstractCegarLoop]: Abstraction has 11 states and 11 transitions. [2019-11-20 01:49:00,029 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-11-20 01:49:00,029 INFO L276 IsEmpty]: Start isEmpty. Operand 11 states and 11 transitions. [2019-11-20 01:49:00,029 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2019-11-20 01:49:00,030 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 01:49:00,030 INFO L410 BasicCegarLoop]: trace histogram [5, 1, 1, 1, 1, 1] [2019-11-20 01:49:00,236 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-20 01:49:00,237 INFO L410 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 01:49:00,237 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 01:49:00,237 INFO L82 PathProgramCache]: Analyzing trace with hash -2059024878, now seen corresponding path program 5 times [2019-11-20 01:49:00,238 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 01:49:00,238 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1537283664] [2019-11-20 01:49:00,238 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 01:49:00,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 01:49:00,355 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-20 01:49:00,355 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1537283664] [2019-11-20 01:49:00,355 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1686974494] [2019-11-20 01:49:00,355 INFO L92 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_b1b602ea-99a1-463c-ac63-515b0333462a/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-20 01:49:00,396 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) [2019-11-20 01:49:00,396 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-20 01:49:00,398 INFO L255 TraceCheckSpWp]: Trace formula consists of 33 conjuncts, 13 conjunts are in the unsatisfiable core [2019-11-20 01:49:00,399 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 01:49:00,428 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-20 01:49:00,429 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-20 01:49:00,429 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 8 [2019-11-20 01:49:00,429 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [735424997] [2019-11-20 01:49:00,430 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-11-20 01:49:00,430 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 01:49:00,430 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-11-20 01:49:00,430 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2019-11-20 01:49:00,431 INFO L87 Difference]: Start difference. First operand 11 states and 11 transitions. Second operand 9 states. [2019-11-20 01:49:00,494 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 01:49:00,495 INFO L93 Difference]: Finished difference Result 16 states and 16 transitions. [2019-11-20 01:49:00,496 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-11-20 01:49:00,496 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 10 [2019-11-20 01:49:00,496 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 01:49:00,497 INFO L225 Difference]: With dead ends: 16 [2019-11-20 01:49:00,497 INFO L226 Difference]: Without dead ends: 12 [2019-11-20 01:49:00,498 INFO L630 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-20 01:49:00,498 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12 states. [2019-11-20 01:49:00,500 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12 to 12. [2019-11-20 01:49:00,500 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2019-11-20 01:49:00,500 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 12 transitions. [2019-11-20 01:49:00,501 INFO L78 Accepts]: Start accepts. Automaton has 12 states and 12 transitions. Word has length 10 [2019-11-20 01:49:00,501 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 01:49:00,501 INFO L462 AbstractCegarLoop]: Abstraction has 12 states and 12 transitions. [2019-11-20 01:49:00,501 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-11-20 01:49:00,501 INFO L276 IsEmpty]: Start isEmpty. Operand 12 states and 12 transitions. [2019-11-20 01:49:00,504 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-11-20 01:49:00,504 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 01:49:00,504 INFO L410 BasicCegarLoop]: trace histogram [6, 1, 1, 1, 1, 1] [2019-11-20 01:49:00,708 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-20 01:49:00,709 INFO L410 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 01:49:00,709 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 01:49:00,709 INFO L82 PathProgramCache]: Analyzing trace with hash 596403592, now seen corresponding path program 6 times [2019-11-20 01:49:00,709 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 01:49:00,709 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [477313962] [2019-11-20 01:49:00,710 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 01:49:00,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 01:49:00,897 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-20 01:49:00,897 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [477313962] [2019-11-20 01:49:00,898 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [163528011] [2019-11-20 01:49:00,898 INFO L92 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_b1b602ea-99a1-463c-ac63-515b0333462a/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-20 01:49:00,951 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 4 check-sat command(s) [2019-11-20 01:49:00,951 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-20 01:49:00,953 INFO L255 TraceCheckSpWp]: Trace formula consists of 36 conjuncts, 15 conjunts are in the unsatisfiable core [2019-11-20 01:49:00,954 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 01:49:00,987 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-20 01:49:00,988 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-20 01:49:00,988 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 9 [2019-11-20 01:49:00,988 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [3577352] [2019-11-20 01:49:00,989 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-11-20 01:49:00,989 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 01:49:00,989 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-11-20 01:49:00,990 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2019-11-20 01:49:00,990 INFO L87 Difference]: Start difference. First operand 12 states and 12 transitions. Second operand 10 states. [2019-11-20 01:49:01,054 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 01:49:01,055 INFO L93 Difference]: Finished difference Result 17 states and 17 transitions. [2019-11-20 01:49:01,055 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-11-20 01:49:01,056 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 11 [2019-11-20 01:49:01,056 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 01:49:01,056 INFO L225 Difference]: With dead ends: 17 [2019-11-20 01:49:01,056 INFO L226 Difference]: Without dead ends: 13 [2019-11-20 01:49:01,057 INFO L630 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-20 01:49:01,057 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13 states. [2019-11-20 01:49:01,060 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13 to 13. [2019-11-20 01:49:01,060 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2019-11-20 01:49:01,060 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 13 transitions. [2019-11-20 01:49:01,061 INFO L78 Accepts]: Start accepts. Automaton has 13 states and 13 transitions. Word has length 11 [2019-11-20 01:49:01,061 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 01:49:01,061 INFO L462 AbstractCegarLoop]: Abstraction has 13 states and 13 transitions. [2019-11-20 01:49:01,061 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-11-20 01:49:01,061 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 13 transitions. [2019-11-20 01:49:01,062 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2019-11-20 01:49:01,062 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 01:49:01,062 INFO L410 BasicCegarLoop]: trace histogram [7, 1, 1, 1, 1, 1] [2019-11-20 01:49:01,262 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-20 01:49:01,263 INFO L410 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 01:49:01,263 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 01:49:01,263 INFO L82 PathProgramCache]: Analyzing trace with hash 1310307538, now seen corresponding path program 7 times [2019-11-20 01:49:01,263 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 01:49:01,264 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [581322015] [2019-11-20 01:49:01,264 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 01:49:01,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 01:49:01,425 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-20 01:49:01,425 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [581322015] [2019-11-20 01:49:01,425 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1778505822] [2019-11-20 01:49:01,426 INFO L92 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_b1b602ea-99a1-463c-ac63-515b0333462a/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-20 01:49:01,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 01:49:01,461 INFO L255 TraceCheckSpWp]: Trace formula consists of 39 conjuncts, 17 conjunts are in the unsatisfiable core [2019-11-20 01:49:01,462 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 01:49:01,506 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-20 01:49:01,507 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-20 01:49:01,507 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 10 [2019-11-20 01:49:01,507 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [879714744] [2019-11-20 01:49:01,508 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-11-20 01:49:01,508 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 01:49:01,508 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-11-20 01:49:01,509 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2019-11-20 01:49:01,509 INFO L87 Difference]: Start difference. First operand 13 states and 13 transitions. Second operand 11 states. [2019-11-20 01:49:01,584 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 01:49:01,584 INFO L93 Difference]: Finished difference Result 18 states and 18 transitions. [2019-11-20 01:49:01,590 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-11-20 01:49:01,590 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 12 [2019-11-20 01:49:01,590 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 01:49:01,591 INFO L225 Difference]: With dead ends: 18 [2019-11-20 01:49:01,591 INFO L226 Difference]: Without dead ends: 14 [2019-11-20 01:49:01,592 INFO L630 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-20 01:49:01,592 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14 states. [2019-11-20 01:49:01,594 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14 to 14. [2019-11-20 01:49:01,595 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2019-11-20 01:49:01,595 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 14 transitions. [2019-11-20 01:49:01,595 INFO L78 Accepts]: Start accepts. Automaton has 14 states and 14 transitions. Word has length 12 [2019-11-20 01:49:01,596 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 01:49:01,596 INFO L462 AbstractCegarLoop]: Abstraction has 14 states and 14 transitions. [2019-11-20 01:49:01,596 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-11-20 01:49:01,596 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 14 transitions. [2019-11-20 01:49:01,597 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-11-20 01:49:01,597 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 01:49:01,597 INFO L410 BasicCegarLoop]: trace histogram [8, 1, 1, 1, 1, 1] [2019-11-20 01:49:01,798 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-20 01:49:01,798 INFO L410 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 01:49:01,798 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 01:49:01,798 INFO L82 PathProgramCache]: Analyzing trace with hash 1966493384, now seen corresponding path program 8 times [2019-11-20 01:49:01,798 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 01:49:01,798 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1025725746] [2019-11-20 01:49:01,799 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 01:49:01,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 01:49:02,010 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-20 01:49:02,010 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1025725746] [2019-11-20 01:49:02,011 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1870328999] [2019-11-20 01:49:02,011 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_b1b602ea-99a1-463c-ac63-515b0333462a/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-20 01:49:02,058 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-11-20 01:49:02,059 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-20 01:49:02,060 INFO L255 TraceCheckSpWp]: Trace formula consists of 42 conjuncts, 19 conjunts are in the unsatisfiable core [2019-11-20 01:49:02,061 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 01:49:02,094 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-20 01:49:02,095 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-20 01:49:02,095 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 11 [2019-11-20 01:49:02,095 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [882308763] [2019-11-20 01:49:02,096 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-11-20 01:49:02,096 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 01:49:02,096 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-11-20 01:49:02,097 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=102, Unknown=0, NotChecked=0, Total=132 [2019-11-20 01:49:02,097 INFO L87 Difference]: Start difference. First operand 14 states and 14 transitions. Second operand 12 states. [2019-11-20 01:49:02,196 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 01:49:02,196 INFO L93 Difference]: Finished difference Result 19 states and 19 transitions. [2019-11-20 01:49:02,197 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-11-20 01:49:02,197 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 13 [2019-11-20 01:49:02,197 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 01:49:02,197 INFO L225 Difference]: With dead ends: 19 [2019-11-20 01:49:02,198 INFO L226 Difference]: Without dead ends: 15 [2019-11-20 01:49:02,198 INFO L630 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-20 01:49:02,198 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15 states. [2019-11-20 01:49:02,201 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15 to 15. [2019-11-20 01:49:02,201 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2019-11-20 01:49:02,201 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 15 transitions. [2019-11-20 01:49:02,201 INFO L78 Accepts]: Start accepts. Automaton has 15 states and 15 transitions. Word has length 13 [2019-11-20 01:49:02,201 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 01:49:02,202 INFO L462 AbstractCegarLoop]: Abstraction has 15 states and 15 transitions. [2019-11-20 01:49:02,202 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-11-20 01:49:02,202 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 15 transitions. [2019-11-20 01:49:02,202 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-11-20 01:49:02,202 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 01:49:02,202 INFO L410 BasicCegarLoop]: trace histogram [9, 1, 1, 1, 1, 1] [2019-11-20 01:49:02,405 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-20 01:49:02,405 INFO L410 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 01:49:02,406 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 01:49:02,406 INFO L82 PathProgramCache]: Analyzing trace with hash 833418130, now seen corresponding path program 9 times [2019-11-20 01:49:02,406 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 01:49:02,406 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1504526289] [2019-11-20 01:49:02,406 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 01:49:02,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 01:49:02,589 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-20 01:49:02,589 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1504526289] [2019-11-20 01:49:02,589 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2699895] [2019-11-20 01:49:02,589 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_b1b602ea-99a1-463c-ac63-515b0333462a/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-20 01:49:02,644 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2019-11-20 01:49:02,644 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-20 01:49:02,645 INFO L255 TraceCheckSpWp]: Trace formula consists of 45 conjuncts, 21 conjunts are in the unsatisfiable core [2019-11-20 01:49:02,646 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 01:49:02,682 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-20 01:49:02,683 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-20 01:49:02,683 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 12 [2019-11-20 01:49:02,683 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1282022697] [2019-11-20 01:49:02,683 INFO L442 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-11-20 01:49:02,684 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 01:49:02,684 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-11-20 01:49:02,684 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=123, Unknown=0, NotChecked=0, Total=156 [2019-11-20 01:49:02,685 INFO L87 Difference]: Start difference. First operand 15 states and 15 transitions. Second operand 13 states. [2019-11-20 01:49:02,800 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 01:49:02,800 INFO L93 Difference]: Finished difference Result 20 states and 20 transitions. [2019-11-20 01:49:02,802 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-11-20 01:49:02,803 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 14 [2019-11-20 01:49:02,803 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 01:49:02,803 INFO L225 Difference]: With dead ends: 20 [2019-11-20 01:49:02,803 INFO L226 Difference]: Without dead ends: 16 [2019-11-20 01:49:02,804 INFO L630 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-20 01:49:02,804 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16 states. [2019-11-20 01:49:02,808 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16 to 16. [2019-11-20 01:49:02,808 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2019-11-20 01:49:02,809 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 16 transitions. [2019-11-20 01:49:02,809 INFO L78 Accepts]: Start accepts. Automaton has 16 states and 16 transitions. Word has length 14 [2019-11-20 01:49:02,809 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 01:49:02,809 INFO L462 AbstractCegarLoop]: Abstraction has 16 states and 16 transitions. [2019-11-20 01:49:02,810 INFO L463 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-11-20 01:49:02,810 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 16 transitions. [2019-11-20 01:49:02,810 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-11-20 01:49:02,810 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 01:49:02,810 INFO L410 BasicCegarLoop]: trace histogram [10, 1, 1, 1, 1, 1] [2019-11-20 01:49:03,014 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-20 01:49:03,015 INFO L410 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 01:49:03,015 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 01:49:03,015 INFO L82 PathProgramCache]: Analyzing trace with hash 67823624, now seen corresponding path program 10 times [2019-11-20 01:49:03,015 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 01:49:03,016 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1863730426] [2019-11-20 01:49:03,016 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 01:49:03,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 01:49:03,247 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-20 01:49:03,248 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1863730426] [2019-11-20 01:49:03,248 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [155123223] [2019-11-20 01:49:03,248 INFO L92 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_b1b602ea-99a1-463c-ac63-515b0333462a/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-20 01:49:03,281 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-11-20 01:49:03,281 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-20 01:49:03,282 INFO L255 TraceCheckSpWp]: Trace formula consists of 48 conjuncts, 23 conjunts are in the unsatisfiable core [2019-11-20 01:49:03,283 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 01:49:03,317 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-20 01:49:03,317 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-20 01:49:03,318 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12] total 13 [2019-11-20 01:49:03,318 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1796490436] [2019-11-20 01:49:03,318 INFO L442 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-11-20 01:49:03,318 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 01:49:03,319 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-11-20 01:49:03,319 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=146, Unknown=0, NotChecked=0, Total=182 [2019-11-20 01:49:03,319 INFO L87 Difference]: Start difference. First operand 16 states and 16 transitions. Second operand 14 states. [2019-11-20 01:49:03,404 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 01:49:03,404 INFO L93 Difference]: Finished difference Result 21 states and 21 transitions. [2019-11-20 01:49:03,405 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-11-20 01:49:03,405 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 15 [2019-11-20 01:49:03,405 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 01:49:03,405 INFO L225 Difference]: With dead ends: 21 [2019-11-20 01:49:03,405 INFO L226 Difference]: Without dead ends: 17 [2019-11-20 01:49:03,406 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 13 SyntacticMatches, 1 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=36, Invalid=146, Unknown=0, NotChecked=0, Total=182 [2019-11-20 01:49:03,406 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states. [2019-11-20 01:49:03,408 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 17. [2019-11-20 01:49:03,408 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2019-11-20 01:49:03,409 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 17 transitions. [2019-11-20 01:49:03,409 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 17 transitions. Word has length 15 [2019-11-20 01:49:03,409 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 01:49:03,409 INFO L462 AbstractCegarLoop]: Abstraction has 17 states and 17 transitions. [2019-11-20 01:49:03,409 INFO L463 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-11-20 01:49:03,409 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 17 transitions. [2019-11-20 01:49:03,410 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-11-20 01:49:03,410 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 01:49:03,410 INFO L410 BasicCegarLoop]: trace histogram [11, 1, 1, 1, 1, 1] [2019-11-20 01:49:03,610 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-20 01:49:03,611 INFO L410 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 01:49:03,611 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 01:49:03,611 INFO L82 PathProgramCache]: Analyzing trace with hash 2104197714, now seen corresponding path program 11 times [2019-11-20 01:49:03,611 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 01:49:03,611 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [437561331] [2019-11-20 01:49:03,611 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 01:49:03,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 01:49:03,820 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-20 01:49:03,821 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [437561331] [2019-11-20 01:49:03,821 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [283507189] [2019-11-20 01:49:03,821 INFO L92 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_b1b602ea-99a1-463c-ac63-515b0333462a/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-20 01:49:03,869 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 7 check-sat command(s) [2019-11-20 01:49:03,870 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-20 01:49:03,870 INFO L255 TraceCheckSpWp]: Trace formula consists of 51 conjuncts, 25 conjunts are in the unsatisfiable core [2019-11-20 01:49:03,872 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 01:49:03,901 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-20 01:49:03,901 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-20 01:49:03,901 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13] total 14 [2019-11-20 01:49:03,902 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1777529641] [2019-11-20 01:49:03,902 INFO L442 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-11-20 01:49:03,902 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 01:49:03,902 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-11-20 01:49:03,903 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=171, Unknown=0, NotChecked=0, Total=210 [2019-11-20 01:49:03,903 INFO L87 Difference]: Start difference. First operand 17 states and 17 transitions. Second operand 15 states. [2019-11-20 01:49:04,026 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 01:49:04,026 INFO L93 Difference]: Finished difference Result 22 states and 22 transitions. [2019-11-20 01:49:04,030 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-11-20 01:49:04,030 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 16 [2019-11-20 01:49:04,030 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 01:49:04,031 INFO L225 Difference]: With dead ends: 22 [2019-11-20 01:49:04,031 INFO L226 Difference]: Without dead ends: 18 [2019-11-20 01:49:04,031 INFO L630 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-20 01:49:04,032 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states. [2019-11-20 01:49:04,034 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 18. [2019-11-20 01:49:04,035 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2019-11-20 01:49:04,035 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 18 transitions. [2019-11-20 01:49:04,035 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 18 transitions. Word has length 16 [2019-11-20 01:49:04,035 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 01:49:04,036 INFO L462 AbstractCegarLoop]: Abstraction has 18 states and 18 transitions. [2019-11-20 01:49:04,036 INFO L463 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-11-20 01:49:04,036 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 18 transitions. [2019-11-20 01:49:04,036 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-11-20 01:49:04,036 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 01:49:04,036 INFO L410 BasicCegarLoop]: trace histogram [12, 1, 1, 1, 1, 1] [2019-11-20 01:49:04,242 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-20 01:49:04,243 INFO L410 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 01:49:04,243 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 01:49:04,243 INFO L82 PathProgramCache]: Analyzing trace with hash 807285064, now seen corresponding path program 12 times [2019-11-20 01:49:04,243 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 01:49:04,243 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1934124412] [2019-11-20 01:49:04,243 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 01:49:04,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 01:49:04,513 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-20 01:49:04,513 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1934124412] [2019-11-20 01:49:04,514 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [913616881] [2019-11-20 01:49:04,514 INFO L92 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_b1b602ea-99a1-463c-ac63-515b0333462a/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-20 01:49:04,593 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 7 check-sat command(s) [2019-11-20 01:49:04,593 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-20 01:49:04,595 WARN L253 TraceCheckSpWp]: Trace formula consists of 54 conjuncts, 27 conjunts are in the unsatisfiable core [2019-11-20 01:49:04,596 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 01:49:04,635 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-20 01:49:04,636 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-20 01:49:04,636 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14] total 15 [2019-11-20 01:49:04,636 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [363847203] [2019-11-20 01:49:04,637 INFO L442 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-11-20 01:49:04,637 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 01:49:04,637 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-11-20 01:49:04,637 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=198, Unknown=0, NotChecked=0, Total=240 [2019-11-20 01:49:04,638 INFO L87 Difference]: Start difference. First operand 18 states and 18 transitions. Second operand 16 states. [2019-11-20 01:49:04,816 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 01:49:04,817 INFO L93 Difference]: Finished difference Result 23 states and 23 transitions. [2019-11-20 01:49:04,817 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-11-20 01:49:04,817 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 17 [2019-11-20 01:49:04,818 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 01:49:04,818 INFO L225 Difference]: With dead ends: 23 [2019-11-20 01:49:04,818 INFO L226 Difference]: Without dead ends: 19 [2019-11-20 01:49:04,819 INFO L630 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-20 01:49:04,819 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states. [2019-11-20 01:49:04,822 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 19. [2019-11-20 01:49:04,822 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2019-11-20 01:49:04,823 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 19 transitions. [2019-11-20 01:49:04,823 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 19 transitions. Word has length 17 [2019-11-20 01:49:04,823 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 01:49:04,824 INFO L462 AbstractCegarLoop]: Abstraction has 19 states and 19 transitions. [2019-11-20 01:49:04,824 INFO L463 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-11-20 01:49:04,824 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 19 transitions. [2019-11-20 01:49:04,824 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-11-20 01:49:04,825 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 01:49:04,825 INFO L410 BasicCegarLoop]: trace histogram [13, 1, 1, 1, 1, 1] [2019-11-20 01:49:05,028 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-20 01:49:05,029 INFO L410 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 01:49:05,029 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 01:49:05,029 INFO L82 PathProgramCache]: Analyzing trace with hash -742301422, now seen corresponding path program 13 times [2019-11-20 01:49:05,029 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 01:49:05,029 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2134086098] [2019-11-20 01:49:05,029 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 01:49:05,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 01:49:05,273 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-20 01:49:05,274 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2134086098] [2019-11-20 01:49:05,274 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1488578595] [2019-11-20 01:49:05,274 INFO L92 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_b1b602ea-99a1-463c-ac63-515b0333462a/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-20 01:49:05,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 01:49:05,303 WARN L253 TraceCheckSpWp]: Trace formula consists of 57 conjuncts, 29 conjunts are in the unsatisfiable core [2019-11-20 01:49:05,304 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 01:49:05,348 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-20 01:49:05,349 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-20 01:49:05,349 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15] total 16 [2019-11-20 01:49:05,349 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [549374331] [2019-11-20 01:49:05,349 INFO L442 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-11-20 01:49:05,350 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 01:49:05,350 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-11-20 01:49:05,350 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=227, Unknown=0, NotChecked=0, Total=272 [2019-11-20 01:49:05,350 INFO L87 Difference]: Start difference. First operand 19 states and 19 transitions. Second operand 17 states. [2019-11-20 01:49:05,507 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 01:49:05,507 INFO L93 Difference]: Finished difference Result 24 states and 24 transitions. [2019-11-20 01:49:05,507 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-11-20 01:49:05,508 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 18 [2019-11-20 01:49:05,508 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 01:49:05,508 INFO L225 Difference]: With dead ends: 24 [2019-11-20 01:49:05,508 INFO L226 Difference]: Without dead ends: 20 [2019-11-20 01:49:05,509 INFO L630 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-20 01:49:05,509 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states. [2019-11-20 01:49:05,512 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 20. [2019-11-20 01:49:05,512 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2019-11-20 01:49:05,512 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 20 transitions. [2019-11-20 01:49:05,513 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 20 transitions. Word has length 18 [2019-11-20 01:49:05,513 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 01:49:05,513 INFO L462 AbstractCegarLoop]: Abstraction has 20 states and 20 transitions. [2019-11-20 01:49:05,513 INFO L463 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-11-20 01:49:05,513 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 20 transitions. [2019-11-20 01:49:05,514 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-11-20 01:49:05,514 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 01:49:05,514 INFO L410 BasicCegarLoop]: trace histogram [14, 1, 1, 1, 1, 1] [2019-11-20 01:49:05,717 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-20 01:49:05,717 INFO L410 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 01:49:05,717 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 01:49:05,718 INFO L82 PathProgramCache]: Analyzing trace with hash -1534842232, now seen corresponding path program 14 times [2019-11-20 01:49:05,718 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 01:49:05,718 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [948073748] [2019-11-20 01:49:05,718 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 01:49:05,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 01:49:05,977 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-20 01:49:05,977 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [948073748] [2019-11-20 01:49:05,977 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1059137255] [2019-11-20 01:49:05,977 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_b1b602ea-99a1-463c-ac63-515b0333462a/bin/uautomizer/z3 Starting monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-20 01:49:06,013 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-11-20 01:49:06,013 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-20 01:49:06,014 WARN L253 TraceCheckSpWp]: Trace formula consists of 60 conjuncts, 31 conjunts are in the unsatisfiable core [2019-11-20 01:49:06,016 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 01:49:06,059 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-20 01:49:06,060 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-20 01:49:06,060 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 16] total 17 [2019-11-20 01:49:06,060 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [507928944] [2019-11-20 01:49:06,060 INFO L442 AbstractCegarLoop]: Interpolant automaton has 18 states [2019-11-20 01:49:06,061 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 01:49:06,061 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2019-11-20 01:49:06,061 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=258, Unknown=0, NotChecked=0, Total=306 [2019-11-20 01:49:06,061 INFO L87 Difference]: Start difference. First operand 20 states and 20 transitions. Second operand 18 states. [2019-11-20 01:49:06,229 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 01:49:06,229 INFO L93 Difference]: Finished difference Result 25 states and 25 transitions. [2019-11-20 01:49:06,229 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-11-20 01:49:06,229 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 19 [2019-11-20 01:49:06,230 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 01:49:06,230 INFO L225 Difference]: With dead ends: 25 [2019-11-20 01:49:06,230 INFO L226 Difference]: Without dead ends: 21 [2019-11-20 01:49:06,230 INFO L630 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-20 01:49:06,231 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states. [2019-11-20 01:49:06,234 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 21. [2019-11-20 01:49:06,234 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2019-11-20 01:49:06,234 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 21 transitions. [2019-11-20 01:49:06,235 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 21 transitions. Word has length 19 [2019-11-20 01:49:06,235 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 01:49:06,235 INFO L462 AbstractCegarLoop]: Abstraction has 21 states and 21 transitions. [2019-11-20 01:49:06,235 INFO L463 AbstractCegarLoop]: Interpolant automaton has 18 states. [2019-11-20 01:49:06,235 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 21 transitions. [2019-11-20 01:49:06,235 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-11-20 01:49:06,235 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 01:49:06,236 INFO L410 BasicCegarLoop]: trace histogram [15, 1, 1, 1, 1, 1] [2019-11-20 01:49:06,436 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-20 01:49:06,436 INFO L410 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 01:49:06,436 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 01:49:06,436 INFO L82 PathProgramCache]: Analyzing trace with hash -333803566, now seen corresponding path program 15 times [2019-11-20 01:49:06,437 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 01:49:06,437 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [883159777] [2019-11-20 01:49:06,437 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 01:49:06,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 01:49:06,721 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-20 01:49:06,721 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [883159777] [2019-11-20 01:49:06,721 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [667247732] [2019-11-20 01:49:06,722 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_b1b602ea-99a1-463c-ac63-515b0333462a/bin/uautomizer/z3 Starting monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-20 01:49:06,853 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 9 check-sat command(s) [2019-11-20 01:49:06,853 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-20 01:49:06,854 WARN L253 TraceCheckSpWp]: Trace formula consists of 63 conjuncts, 33 conjunts are in the unsatisfiable core [2019-11-20 01:49:06,855 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 01:49:06,895 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-20 01:49:06,895 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-20 01:49:06,896 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17] total 18 [2019-11-20 01:49:06,896 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [426392516] [2019-11-20 01:49:06,896 INFO L442 AbstractCegarLoop]: Interpolant automaton has 19 states [2019-11-20 01:49:06,896 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 01:49:06,896 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2019-11-20 01:49:06,897 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=291, Unknown=0, NotChecked=0, Total=342 [2019-11-20 01:49:06,897 INFO L87 Difference]: Start difference. First operand 21 states and 21 transitions. Second operand 19 states. [2019-11-20 01:49:07,116 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 01:49:07,116 INFO L93 Difference]: Finished difference Result 26 states and 26 transitions. [2019-11-20 01:49:07,120 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-11-20 01:49:07,120 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 20 [2019-11-20 01:49:07,120 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 01:49:07,121 INFO L225 Difference]: With dead ends: 26 [2019-11-20 01:49:07,121 INFO L226 Difference]: Without dead ends: 22 [2019-11-20 01:49:07,121 INFO L630 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-20 01:49:07,122 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states. [2019-11-20 01:49:07,124 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 22. [2019-11-20 01:49:07,124 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2019-11-20 01:49:07,125 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 22 transitions. [2019-11-20 01:49:07,125 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 22 transitions. Word has length 20 [2019-11-20 01:49:07,125 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 01:49:07,125 INFO L462 AbstractCegarLoop]: Abstraction has 22 states and 22 transitions. [2019-11-20 01:49:07,125 INFO L463 AbstractCegarLoop]: Interpolant automaton has 19 states. [2019-11-20 01:49:07,125 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 22 transitions. [2019-11-20 01:49:07,128 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-11-20 01:49:07,129 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 01:49:07,129 INFO L410 BasicCegarLoop]: trace histogram [16, 1, 1, 1, 1, 1] [2019-11-20 01:49:07,336 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-20 01:49:07,336 INFO L410 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 01:49:07,336 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 01:49:07,336 INFO L82 PathProgramCache]: Analyzing trace with hash -1756310584, now seen corresponding path program 16 times [2019-11-20 01:49:07,336 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 01:49:07,337 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2015989554] [2019-11-20 01:49:07,337 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 01:49:07,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-20 01:49:07,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-20 01:49:07,374 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-20 01:49:07,374 INFO L475 BasicCegarLoop]: Counterexample might be feasible [2019-11-20 01:49:07,394 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 20.11 01:49:07 BoogieIcfgContainer [2019-11-20 01:49:07,394 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-11-20 01:49:07,395 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-11-20 01:49:07,395 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-11-20 01:49:07,395 INFO L275 PluginConnector]: Witness Printer initialized [2019-11-20 01:49:07,396 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 01:48:58" (3/4) ... [2019-11-20 01:49:07,399 INFO L140 WitnessPrinter]: No result that supports witness generation found [2019-11-20 01:49:07,399 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-11-20 01:49:07,401 INFO L168 Benchmark]: Toolchain (without parser) took 9946.93 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 166.2 MB). Free memory was 951.5 MB in the beginning and 974.8 MB in the end (delta: -23.3 MB). Peak memory consumption was 142.9 MB. Max. memory is 11.5 GB. [2019-11-20 01:49:07,401 INFO L168 Benchmark]: CDTParser took 0.27 ms. Allocated memory is still 1.0 GB. Free memory is still 967.6 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-20 01:49:07,402 INFO L168 Benchmark]: CACSL2BoogieTranslator took 319.42 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 132.1 MB). Free memory was 951.5 MB in the beginning and 1.1 GB in the end (delta: -175.6 MB). Peak memory consumption was 22.9 MB. Max. memory is 11.5 GB. [2019-11-20 01:49:07,402 INFO L168 Benchmark]: Boogie Procedure Inliner took 39.25 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-20 01:49:07,402 INFO L168 Benchmark]: Boogie Preprocessor took 22.39 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. [2019-11-20 01:49:07,403 INFO L168 Benchmark]: RCFGBuilder took 237.88 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: 13.0 MB). Peak memory consumption was 13.0 MB. Max. memory is 11.5 GB. [2019-11-20 01:49:07,403 INFO L168 Benchmark]: TraceAbstraction took 9315.38 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 34.1 MB). Free memory was 1.1 GB in the beginning and 974.8 MB in the end (delta: 134.0 MB). Peak memory consumption was 168.0 MB. Max. memory is 11.5 GB. [2019-11-20 01:49:07,404 INFO L168 Benchmark]: Witness Printer took 4.49 ms. Allocated memory is still 1.2 GB. Free memory is still 974.8 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-20 01:49:07,406 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.27 ms. Allocated memory is still 1.0 GB. Free memory is still 967.6 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 319.42 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 132.1 MB). Free memory was 951.5 MB in the beginning and 1.1 GB in the end (delta: -175.6 MB). Peak memory consumption was 22.9 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 39.25 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * Boogie Preprocessor took 22.39 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. * RCFGBuilder took 237.88 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: 13.0 MB). Peak memory consumption was 13.0 MB. Max. memory is 11.5 GB. * TraceAbstraction took 9315.38 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 34.1 MB). Free memory was 1.1 GB in the beginning and 974.8 MB in the end (delta: 134.0 MB). Peak memory consumption was 168.0 MB. Max. memory is 11.5 GB. * Witness Printer took 4.49 ms. Allocated memory is still 1.2 GB. Free memory is still 974.8 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: 9.2s, OverallIterations: 17, TraceHistogramMax: 16, AutomataDifference: 1.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 83 SDtfs, 0 SDslu, 342 SDs, 0 SdLazy, 1722 SolverSat, 120 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 1.1s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 332 GetRequests, 166 SyntacticMatches, 15 SemanticMatches, 151 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30 ImplicationChecksByTransitivity, 2.6s 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.1s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 3.2s 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-678e011 [2019-11-20 01:49:09,575 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-20 01:49:09,577 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-20 01:49:09,588 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-20 01:49:09,588 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-20 01:49:09,589 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-20 01:49:09,591 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-20 01:49:09,593 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-20 01:49:09,595 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-20 01:49:09,596 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-20 01:49:09,597 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-20 01:49:09,598 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-20 01:49:09,598 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-20 01:49:09,599 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-20 01:49:09,600 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-20 01:49:09,602 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-20 01:49:09,602 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-20 01:49:09,603 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-20 01:49:09,605 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-20 01:49:09,607 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-20 01:49:09,610 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-20 01:49:09,611 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-20 01:49:09,612 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-20 01:49:09,613 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-20 01:49:09,616 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-20 01:49:09,616 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-20 01:49:09,617 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-20 01:49:09,617 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-20 01:49:09,618 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-20 01:49:09,619 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-20 01:49:09,619 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-20 01:49:09,620 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-20 01:49:09,621 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-20 01:49:09,622 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-20 01:49:09,623 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-20 01:49:09,623 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-20 01:49:09,624 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-20 01:49:09,624 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-20 01:49:09,625 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-20 01:49:09,626 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-20 01:49:09,626 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-20 01:49:09,627 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_b1b602ea-99a1-463c-ac63-515b0333462a/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2019-11-20 01:49:09,647 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-20 01:49:09,647 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-20 01:49:09,649 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-20 01:49:09,649 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-20 01:49:09,649 INFO L138 SettingsManager]: * Use SBE=true [2019-11-20 01:49:09,649 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-20 01:49:09,650 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-20 01:49:09,650 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-20 01:49:09,650 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-20 01:49:09,650 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-11-20 01:49:09,650 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-20 01:49:09,651 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-11-20 01:49:09,651 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2019-11-20 01:49:09,651 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2019-11-20 01:49:09,651 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-20 01:49:09,651 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-20 01:49:09,652 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-20 01:49:09,652 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-11-20 01:49:09,652 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-20 01:49:09,652 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-20 01:49:09,653 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-20 01:49:09,653 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-20 01:49:09,653 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-20 01:49:09,653 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-20 01:49:09,658 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-20 01:49:09,658 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-11-20 01:49:09,658 INFO L138 SettingsManager]: * Trace refinement strategy=WOLF [2019-11-20 01:49:09,658 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --rewrite-divk --print-success --lang smt [2019-11-20 01:49:09,659 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-11-20 01:49:09,660 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-11-20 01:49:09,660 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_b1b602ea-99a1-463c-ac63-515b0333462a/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-20 01:49:09,965 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-20 01:49:09,980 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-20 01:49:09,984 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-20 01:49:09,986 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-20 01:49:09,986 INFO L275 PluginConnector]: CDTParser initialized [2019-11-20 01:49:09,987 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_b1b602ea-99a1-463c-ac63-515b0333462a/bin/uautomizer/../../sv-benchmarks/c/bitvector/interleave_bits.i [2019-11-20 01:49:10,058 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_b1b602ea-99a1-463c-ac63-515b0333462a/bin/uautomizer/data/64b21919b/ba04682baaa043d8b709f9e719de8052/FLAG839f0a2ed [2019-11-20 01:49:10,538 INFO L306 CDTParser]: Found 1 translation units. [2019-11-20 01:49:10,541 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_b1b602ea-99a1-463c-ac63-515b0333462a/sv-benchmarks/c/bitvector/interleave_bits.i [2019-11-20 01:49:10,547 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_b1b602ea-99a1-463c-ac63-515b0333462a/bin/uautomizer/data/64b21919b/ba04682baaa043d8b709f9e719de8052/FLAG839f0a2ed [2019-11-20 01:49:10,880 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_b1b602ea-99a1-463c-ac63-515b0333462a/bin/uautomizer/data/64b21919b/ba04682baaa043d8b709f9e719de8052 [2019-11-20 01:49:10,884 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-20 01:49:10,886 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-11-20 01:49:10,887 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-20 01:49:10,888 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-20 01:49:10,892 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-20 01:49:10,893 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.11 01:49:10" (1/1) ... [2019-11-20 01:49:10,895 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@24d2ce61 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 01:49:10, skipping insertion in model container [2019-11-20 01:49:10,895 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.11 01:49:10" (1/1) ... [2019-11-20 01:49:10,903 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-11-20 01:49:10,923 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-11-20 01:49:11,099 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-20 01:49:11,103 INFO L188 MainTranslator]: Completed pre-run [2019-11-20 01:49:11,124 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-20 01:49:11,135 INFO L192 MainTranslator]: Completed translation [2019-11-20 01:49:11,135 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 01:49:11 WrapperNode [2019-11-20 01:49:11,135 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-20 01:49:11,136 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-11-20 01:49:11,136 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-11-20 01:49:11,136 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-11-20 01:49:11,192 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 01:49:11" (1/1) ... [2019-11-20 01:49:11,202 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 01:49:11" (1/1) ... [2019-11-20 01:49:11,223 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-11-20 01:49:11,224 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-20 01:49:11,224 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-20 01:49:11,224 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-20 01:49:11,232 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 01:49:11" (1/1) ... [2019-11-20 01:49:11,233 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 01:49:11" (1/1) ... [2019-11-20 01:49:11,243 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 01:49:11" (1/1) ... [2019-11-20 01:49:11,243 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 01:49:11" (1/1) ... [2019-11-20 01:49:11,248 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 01:49:11" (1/1) ... [2019-11-20 01:49:11,251 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 01:49:11" (1/1) ... [2019-11-20 01:49:11,253 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 01:49:11" (1/1) ... [2019-11-20 01:49:11,255 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-20 01:49:11,259 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-20 01:49:11,259 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-20 01:49:11,259 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-20 01:49:11,260 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 01:49:11" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_b1b602ea-99a1-463c-ac63-515b0333462a/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-20 01:49:11,305 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-20 01:49:11,305 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-20 01:49:11,470 INFO L280 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-20 01:49:11,470 INFO L285 CfgBuilder]: Removed 7 assume(true) statements. [2019-11-20 01:49:11,471 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 01:49:11 BoogieIcfgContainer [2019-11-20 01:49:11,471 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-20 01:49:11,472 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-20 01:49:11,472 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-20 01:49:11,474 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-20 01:49:11,475 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.11 01:49:10" (1/3) ... [2019-11-20 01:49:11,475 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5398a321 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.11 01:49:11, skipping insertion in model container [2019-11-20 01:49:11,476 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 01:49:11" (2/3) ... [2019-11-20 01:49:11,476 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5398a321 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.11 01:49:11, skipping insertion in model container [2019-11-20 01:49:11,476 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 01:49:11" (3/3) ... [2019-11-20 01:49:11,478 INFO L109 eAbstractionObserver]: Analyzing ICFG interleave_bits.i [2019-11-20 01:49:11,486 INFO L153 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-20 01:49:11,492 INFO L165 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-11-20 01:49:11,502 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-11-20 01:49:11,523 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-20 01:49:11,524 INFO L374 AbstractCegarLoop]: Hoare is true [2019-11-20 01:49:11,524 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-20 01:49:11,524 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-20 01:49:11,524 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-20 01:49:11,524 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-20 01:49:11,524 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-20 01:49:11,524 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-20 01:49:11,535 INFO L276 IsEmpty]: Start isEmpty. Operand 9 states. [2019-11-20 01:49:11,540 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-11-20 01:49:11,540 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 01:49:11,542 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-11-20 01:49:11,543 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 01:49:11,548 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 01:49:11,548 INFO L82 PathProgramCache]: Analyzing trace with hash 29805000, now seen corresponding path program 1 times [2019-11-20 01:49:11,557 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-20 01:49:11,557 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [1247599542] [2019-11-20 01:49:11,558 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_b1b602ea-99a1-463c-ac63-515b0333462a/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-20 01:49:11,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 01:49:11,645 INFO L255 TraceCheckSpWp]: Trace formula consists of 14 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-20 01:49:11,650 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 01:49:11,684 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 01:49:11,684 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-20 01:49:11,697 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 01:49:11,698 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1247599542] [2019-11-20 01:49:11,699 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-20 01:49:11,699 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2, 2] imperfect sequences [] total 3 [2019-11-20 01:49:11,701 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1855718615] [2019-11-20 01:49:11,705 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-20 01:49:11,705 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-20 01:49:11,718 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-20 01:49:11,719 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-20 01:49:11,721 INFO L87 Difference]: Start difference. First operand 9 states. Second operand 4 states. [2019-11-20 01:49:11,760 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 01:49:11,760 INFO L93 Difference]: Finished difference Result 18 states and 24 transitions. [2019-11-20 01:49:11,761 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-20 01:49:11,762 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 5 [2019-11-20 01:49:11,762 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 01:49:11,771 INFO L225 Difference]: With dead ends: 18 [2019-11-20 01:49:11,771 INFO L226 Difference]: Without dead ends: 8 [2019-11-20 01:49:11,774 INFO L630 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-20 01:49:11,796 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8 states. [2019-11-20 01:49:11,810 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8 to 8. [2019-11-20 01:49:11,815 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2019-11-20 01:49:11,815 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 8 transitions. [2019-11-20 01:49:11,816 INFO L78 Accepts]: Start accepts. Automaton has 8 states and 8 transitions. Word has length 5 [2019-11-20 01:49:11,817 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 01:49:11,817 INFO L462 AbstractCegarLoop]: Abstraction has 8 states and 8 transitions. [2019-11-20 01:49:11,817 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-20 01:49:11,817 INFO L276 IsEmpty]: Start isEmpty. Operand 8 states and 8 transitions. [2019-11-20 01:49:11,817 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-11-20 01:49:11,818 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 01:49:11,818 INFO L410 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1] [2019-11-20 01:49:12,019 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-20 01:49:12,020 INFO L410 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 01:49:12,020 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 01:49:12,021 INFO L82 PathProgramCache]: Analyzing trace with hash -1368874232, now seen corresponding path program 1 times [2019-11-20 01:49:12,021 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-20 01:49:12,021 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [832215904] [2019-11-20 01:49:12,022 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_b1b602ea-99a1-463c-ac63-515b0333462a/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-20 01:49:12,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 01:49:12,091 INFO L255 TraceCheckSpWp]: Trace formula consists of 20 conjuncts, 4 conjunts are in the unsatisfiable core [2019-11-20 01:49:12,092 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 01:49:12,123 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-20 01:49:12,123 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-20 01:49:12,201 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-20 01:49:12,201 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [832215904] [2019-11-20 01:49:12,201 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-20 01:49:12,202 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 7 [2019-11-20 01:49:12,202 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1167970795] [2019-11-20 01:49:12,204 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-11-20 01:49:12,204 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-20 01:49:12,204 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-11-20 01:49:12,206 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2019-11-20 01:49:12,207 INFO L87 Difference]: Start difference. First operand 8 states and 8 transitions. Second operand 8 states. [2019-11-20 01:49:12,386 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 01:49:12,386 INFO L93 Difference]: Finished difference Result 16 states and 19 transitions. [2019-11-20 01:49:12,388 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-11-20 01:49:12,388 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 7 [2019-11-20 01:49:12,388 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 01:49:12,389 INFO L225 Difference]: With dead ends: 16 [2019-11-20 01:49:12,389 INFO L226 Difference]: Without dead ends: 12 [2019-11-20 01:49:12,390 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2019-11-20 01:49:12,390 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12 states. [2019-11-20 01:49:12,394 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12 to 12. [2019-11-20 01:49:12,397 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2019-11-20 01:49:12,397 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 12 transitions. [2019-11-20 01:49:12,398 INFO L78 Accepts]: Start accepts. Automaton has 12 states and 12 transitions. Word has length 7 [2019-11-20 01:49:12,398 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 01:49:12,398 INFO L462 AbstractCegarLoop]: Abstraction has 12 states and 12 transitions. [2019-11-20 01:49:12,399 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-11-20 01:49:12,399 INFO L276 IsEmpty]: Start isEmpty. Operand 12 states and 12 transitions. [2019-11-20 01:49:12,400 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-11-20 01:49:12,401 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 01:49:12,402 INFO L410 BasicCegarLoop]: trace histogram [6, 1, 1, 1, 1, 1] [2019-11-20 01:49:12,604 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-20 01:49:12,604 INFO L410 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 01:49:12,604 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 01:49:12,605 INFO L82 PathProgramCache]: Analyzing trace with hash 596403592, now seen corresponding path program 2 times [2019-11-20 01:49:12,605 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-20 01:49:12,606 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [1790593721] [2019-11-20 01:49:12,606 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_b1b602ea-99a1-463c-ac63-515b0333462a/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-20 01:49:12,731 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-11-20 01:49:12,732 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-20 01:49:12,733 INFO L255 TraceCheckSpWp]: Trace formula consists of 32 conjuncts, 8 conjunts are in the unsatisfiable core [2019-11-20 01:49:12,735 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 01:49:12,818 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-20 01:49:12,819 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-20 01:49:13,148 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-20 01:49:13,148 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1790593721] [2019-11-20 01:49:13,149 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-20 01:49:13,149 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 15 [2019-11-20 01:49:13,149 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1667744047] [2019-11-20 01:49:13,149 INFO L442 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-11-20 01:49:13,150 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-20 01:49:13,150 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-11-20 01:49:13,151 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=162, Unknown=0, NotChecked=0, Total=240 [2019-11-20 01:49:13,151 INFO L87 Difference]: Start difference. First operand 12 states and 12 transitions. Second operand 16 states. [2019-11-20 01:49:13,944 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 01:49:13,945 INFO L93 Difference]: Finished difference Result 24 states and 31 transitions. [2019-11-20 01:49:13,946 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-11-20 01:49:13,946 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 11 [2019-11-20 01:49:13,946 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 01:49:13,947 INFO L225 Difference]: With dead ends: 24 [2019-11-20 01:49:13,947 INFO L226 Difference]: Without dead ends: 20 [2019-11-20 01:49:13,948 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=174, Invalid=288, Unknown=0, NotChecked=0, Total=462 [2019-11-20 01:49:13,948 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states. [2019-11-20 01:49:13,951 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 20. [2019-11-20 01:49:13,951 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2019-11-20 01:49:13,952 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 20 transitions. [2019-11-20 01:49:13,952 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 20 transitions. Word has length 11 [2019-11-20 01:49:13,952 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 01:49:13,952 INFO L462 AbstractCegarLoop]: Abstraction has 20 states and 20 transitions. [2019-11-20 01:49:13,952 INFO L463 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-11-20 01:49:13,952 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 20 transitions. [2019-11-20 01:49:13,953 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-11-20 01:49:13,953 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 01:49:13,953 INFO L410 BasicCegarLoop]: trace histogram [14, 1, 1, 1, 1, 1] [2019-11-20 01:49:14,153 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-20 01:49:14,154 INFO L410 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 01:49:14,154 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 01:49:14,154 INFO L82 PathProgramCache]: Analyzing trace with hash -1534842232, now seen corresponding path program 3 times [2019-11-20 01:49:14,155 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-20 01:49:14,155 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [56087234] [2019-11-20 01:49:14,155 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_b1b602ea-99a1-463c-ac63-515b0333462a/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-20 01:49:14,396 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 8 check-sat command(s) [2019-11-20 01:49:14,397 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-20 01:49:14,399 INFO L255 TraceCheckSpWp]: Trace formula consists of 56 conjuncts, 17 conjunts are in the unsatisfiable core [2019-11-20 01:49:14,400 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 01:49:14,670 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-20 01:49:14,670 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-20 01:49:15,867 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-20 01:49:15,867 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [56087234] [2019-11-20 01:49:15,867 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-20 01:49:15,868 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 16] total 31 [2019-11-20 01:49:15,868 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1456283175] [2019-11-20 01:49:15,868 INFO L442 AbstractCegarLoop]: Interpolant automaton has 32 states [2019-11-20 01:49:15,868 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-20 01:49:15,869 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2019-11-20 01:49:15,869 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=273, Invalid=719, Unknown=0, NotChecked=0, Total=992 [2019-11-20 01:49:15,869 INFO L87 Difference]: Start difference. First operand 20 states and 20 transitions. Second operand 32 states. [2019-11-20 01:49:16,565 WARN L191 SmtUtils]: Spent 319.00 ms on a formula simplification that was a NOOP. DAG size: 72 [2019-11-20 01:49:17,062 WARN L191 SmtUtils]: Spent 275.00 ms on a formula simplification that was a NOOP. DAG size: 69 [2019-11-20 01:49:17,642 WARN L191 SmtUtils]: Spent 352.00 ms on a formula simplification that was a NOOP. DAG size: 74 [2019-11-20 01:49:18,057 WARN L191 SmtUtils]: Spent 219.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 7 [2019-11-20 01:49:18,421 WARN L191 SmtUtils]: Spent 152.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 7 [2019-11-20 01:49:18,748 WARN L191 SmtUtils]: Spent 145.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 7 [2019-11-20 01:49:19,040 WARN L191 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 7 [2019-11-20 01:49:19,331 WARN L191 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 44 DAG size of output: 7 [2019-11-20 01:49:20,716 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 01:49:20,717 INFO L93 Difference]: Finished difference Result 40 states and 55 transitions. [2019-11-20 01:49:20,717 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2019-11-20 01:49:20,718 INFO L78 Accepts]: Start accepts. Automaton has 32 states. Word has length 19 [2019-11-20 01:49:20,718 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 01:49:20,719 INFO L225 Difference]: With dead ends: 40 [2019-11-20 01:49:20,719 INFO L226 Difference]: Without dead ends: 36 [2019-11-20 01:49:20,720 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 208 ImplicationChecksByTransitivity, 6.0s TimeCoverageRelationStatistics Valid=622, Invalid=1540, Unknown=0, NotChecked=0, Total=2162 [2019-11-20 01:49:20,721 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2019-11-20 01:49:20,727 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 36. [2019-11-20 01:49:20,727 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2019-11-20 01:49:20,728 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 37 transitions. [2019-11-20 01:49:20,728 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 37 transitions. Word has length 19 [2019-11-20 01:49:20,729 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 01:49:20,729 INFO L462 AbstractCegarLoop]: Abstraction has 36 states and 37 transitions. [2019-11-20 01:49:20,729 INFO L463 AbstractCegarLoop]: Interpolant automaton has 32 states. [2019-11-20 01:49:20,729 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 37 transitions. [2019-11-20 01:49:20,730 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-11-20 01:49:20,730 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 01:49:20,730 INFO L410 BasicCegarLoop]: trace histogram [16, 1, 1, 1, 1, 1] [2019-11-20 01:49:20,930 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-20 01:49:20,931 INFO L410 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 01:49:20,931 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 01:49:20,931 INFO L82 PathProgramCache]: Analyzing trace with hash -1756310584, now seen corresponding path program 4 times [2019-11-20 01:49:20,931 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-20 01:49:20,931 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [1405977130] [2019-11-20 01:49:20,932 INFO L92 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_b1b602ea-99a1-463c-ac63-515b0333462a/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-20 01:49:21,191 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-11-20 01:49:21,191 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-20 01:49:21,193 WARN L253 TraceCheckSpWp]: Trace formula consists of 62 conjuncts, 39 conjunts are in the unsatisfiable core [2019-11-20 01:49:21,196 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 01:49:22,474 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-20 01:49:22,474 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-20 01:49:53,429 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-20 01:49:53,429 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1405977130] [2019-11-20 01:49:53,429 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-20 01:49:53,429 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 19] total 35 [2019-11-20 01:49:53,429 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [505965786] [2019-11-20 01:49:53,430 INFO L442 AbstractCegarLoop]: Interpolant automaton has 36 states [2019-11-20 01:49:53,430 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-20 01:49:53,430 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2019-11-20 01:49:53,431 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=310, Invalid=950, Unknown=0, NotChecked=0, Total=1260 [2019-11-20 01:49:53,431 INFO L87 Difference]: Start difference. First operand 36 states and 37 transitions. Second operand 36 states. [2019-11-20 01:49:55,678 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 01:49:55,678 INFO L93 Difference]: Finished difference Result 36 states and 37 transitions. [2019-11-20 01:49:55,678 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2019-11-20 01:49:55,678 INFO L78 Accepts]: Start accepts. Automaton has 36 states. Word has length 21 [2019-11-20 01:49:55,679 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 01:49:55,679 INFO L225 Difference]: With dead ends: 36 [2019-11-20 01:49:55,679 INFO L226 Difference]: Without dead ends: 0 [2019-11-20 01:49:55,680 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 4 SyntacticMatches, 2 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 32.2s TimeCoverageRelationStatistics Valid=330, Invalid=1002, Unknown=0, NotChecked=0, Total=1332 [2019-11-20 01:49:55,680 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-11-20 01:49:55,681 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-11-20 01:49:55,681 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-11-20 01:49:55,681 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-11-20 01:49:55,681 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 21 [2019-11-20 01:49:55,681 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 01:49:55,682 INFO L462 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-11-20 01:49:55,682 INFO L463 AbstractCegarLoop]: Interpolant automaton has 36 states. [2019-11-20 01:49:55,682 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-11-20 01:49:55,683 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-11-20 01:49:55,890 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-20 01:49:55,894 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2019-11-20 01:49:56,075 WARN L191 SmtUtils]: Spent 177.00 ms on a formula simplification. DAG size of input: 320 DAG size of output: 304 [2019-11-20 01:49:57,628 WARN L191 SmtUtils]: Spent 1.55 s on a formula simplification. DAG size of input: 304 DAG size of output: 239 [2019-11-20 01:49:57,631 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2019-11-20 01:49:57,631 INFO L444 ceAbstractionStarter]: For program point L5(lines 5 7) no Hoare annotation was computed. [2019-11-20 01:49:57,632 INFO L447 ceAbstractionStarter]: At program point L5-2(lines 1 48) the Hoare annotation is: true [2019-11-20 01:49:57,632 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2019-11-20 01:49:57,632 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2019-11-20 01:49:57,632 INFO L440 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-20 01:49:57,632 INFO L444 ceAbstractionStarter]: For program point L30-3(lines 30 33) no Hoare annotation was computed. [2019-11-20 01:49:57,633 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 6) no Hoare annotation was computed. [2019-11-20 01:49:57,633 INFO L444 ceAbstractionStarter]: For program point L6(line 6) no Hoare annotation was computed. [2019-11-20 01:49:57,692 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 20.11 01:49:57 BoogieIcfgContainer [2019-11-20 01:49:57,692 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-11-20 01:49:57,692 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-11-20 01:49:57,693 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-11-20 01:49:57,693 INFO L275 PluginConnector]: Witness Printer initialized [2019-11-20 01:49:57,693 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 01:49:11" (3/4) ... [2019-11-20 01:49:57,697 INFO L137 WitnessPrinter]: Generating witness for correct program [2019-11-20 01:49:57,706 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2019-11-20 01:49:57,707 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2019-11-20 01:49:57,776 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/run_dir_b1b602ea-99a1-463c-ac63-515b0333462a/bin/uautomizer/witness.graphml [2019-11-20 01:49:57,776 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-11-20 01:49:57,777 INFO L168 Benchmark]: Toolchain (without parser) took 46891.50 ms. Allocated memory was 1.0 GB in the beginning and 1.3 GB in the end (delta: 294.6 MB). Free memory was 960.4 MB in the beginning and 1.2 GB in the end (delta: -234.8 MB). Peak memory consumption was 59.8 MB. Max. memory is 11.5 GB. [2019-11-20 01:49:57,778 INFO L168 Benchmark]: CDTParser took 0.31 ms. Allocated memory is still 1.0 GB. Free memory is still 987.3 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-20 01:49:57,778 INFO L168 Benchmark]: CACSL2BoogieTranslator took 248.25 ms. Allocated memory is still 1.0 GB. Free memory was 960.4 MB in the beginning and 949.7 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. [2019-11-20 01:49:57,779 INFO L168 Benchmark]: Boogie Procedure Inliner took 87.39 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 136.3 MB). Free memory was 949.7 MB in the beginning and 1.1 GB in the end (delta: -183.4 MB). Peak memory consumption was 9.6 MB. Max. memory is 11.5 GB. [2019-11-20 01:49:57,780 INFO L168 Benchmark]: Boogie Preprocessor took 34.61 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.6 MB). Peak memory consumption was 6.6 MB. Max. memory is 11.5 GB. [2019-11-20 01:49:57,780 INFO L168 Benchmark]: RCFGBuilder took 212.52 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: 18.4 MB). Peak memory consumption was 18.4 MB. Max. memory is 11.5 GB. [2019-11-20 01:49:57,781 INFO L168 Benchmark]: TraceAbstraction took 46219.96 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 158.3 MB). Free memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: -95.6 MB). Peak memory consumption was 416.5 MB. Max. memory is 11.5 GB. [2019-11-20 01:49:57,781 INFO L168 Benchmark]: Witness Printer took 83.65 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-20 01:49:57,783 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.31 ms. Allocated memory is still 1.0 GB. Free memory is still 987.3 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 248.25 ms. Allocated memory is still 1.0 GB. Free memory was 960.4 MB in the beginning and 949.7 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 87.39 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 136.3 MB). Free memory was 949.7 MB in the beginning and 1.1 GB in the end (delta: -183.4 MB). Peak memory consumption was 9.6 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 34.61 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.6 MB). Peak memory consumption was 6.6 MB. Max. memory is 11.5 GB. * RCFGBuilder took 212.52 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: 18.4 MB). Peak memory consumption was 18.4 MB. Max. memory is 11.5 GB. * TraceAbstraction took 46219.96 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 158.3 MB). Free memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: -95.6 MB). Peak memory consumption was 416.5 MB. Max. memory is 11.5 GB. * Witness Printer took 83.65 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: 46.1s, OverallIterations: 5, TraceHistogramMax: 16, AutomataDifference: 8.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 1.7s, HoareTripleCheckerStatistics: 24 SDtfs, 60 SDslu, 67 SDs, 0 SdLazy, 577 SolverSat, 78 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 2.3s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 140 GetRequests, 28 SyntacticMatches, 2 SemanticMatches, 110 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 239 ImplicationChecksByTransitivity, 39.4s 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.5s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 34.2s 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...