./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/bitvector/num_conversion_1_true-unreach-call_true-no-overflow.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version aa418289 Calling Ultimate with: java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_4becc31a-4406-42a9-ae1e-b055b76278dc/bin-2019/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_4becc31a-4406-42a9-ae1e-b055b76278dc/bin-2019/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_4becc31a-4406-42a9-ae1e-b055b76278dc/bin-2019/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_4becc31a-4406-42a9-ae1e-b055b76278dc/bin-2019/uautomizer/config/AutomizerReach.xml -i ../../sv-benchmarks/c/bitvector/num_conversion_1_true-unreach-call_true-no-overflow.i -s /tmp/vcloud-vcloud-master/worker/working_dir_4becc31a-4406-42a9-ae1e-b055b76278dc/bin-2019/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_4becc31a-4406-42a9-ae1e-b055b76278dc/bin-2019/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 d2a071cc6090a217f48ed180b566a651717a8e39 ........................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................ Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis Calling Ultimate with: java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_4becc31a-4406-42a9-ae1e-b055b76278dc/bin-2019/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_4becc31a-4406-42a9-ae1e-b055b76278dc/bin-2019/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_4becc31a-4406-42a9-ae1e-b055b76278dc/bin-2019/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_4becc31a-4406-42a9-ae1e-b055b76278dc/bin-2019/uautomizer/config/AutomizerReach.xml -i ../../sv-benchmarks/c/bitvector/num_conversion_1_true-unreach-call_true-no-overflow.i -s /tmp/vcloud-vcloud-master/worker/working_dir_4becc31a-4406-42a9-ae1e-b055b76278dc/bin-2019/uautomizer/config/svcomp-Reach-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_4becc31a-4406-42a9-ae1e-b055b76278dc/bin-2019/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 d2a071cc6090a217f48ed180b566a651717a8e39 ................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.23-aa41828 [2018-11-23 05:42:48,937 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-23 05:42:48,939 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-23 05:42:48,949 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-23 05:42:48,949 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-23 05:42:48,950 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-23 05:42:48,951 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-23 05:42:48,953 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-23 05:42:48,954 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-23 05:42:48,955 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-23 05:42:48,955 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-23 05:42:48,956 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-23 05:42:48,956 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-23 05:42:48,957 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-23 05:42:48,958 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-23 05:42:48,959 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-23 05:42:48,959 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-23 05:42:48,961 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-23 05:42:48,962 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-23 05:42:48,963 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-23 05:42:48,964 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-23 05:42:48,965 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-23 05:42:48,967 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-23 05:42:48,967 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-23 05:42:48,967 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-23 05:42:48,968 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-23 05:42:48,969 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-23 05:42:48,969 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-23 05:42:48,970 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-23 05:42:48,971 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-23 05:42:48,971 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-23 05:42:48,972 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-23 05:42:48,972 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-23 05:42:48,972 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-23 05:42:48,973 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-23 05:42:48,973 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-23 05:42:48,974 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_4becc31a-4406-42a9-ae1e-b055b76278dc/bin-2019/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf [2018-11-23 05:42:48,985 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-23 05:42:48,985 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-23 05:42:48,986 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-23 05:42:48,986 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-11-23 05:42:48,987 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-23 05:42:48,987 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-23 05:42:48,987 INFO L133 SettingsManager]: * Use SBE=true [2018-11-23 05:42:48,987 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-23 05:42:48,988 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-23 05:42:48,988 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-23 05:42:48,988 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-23 05:42:48,988 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-23 05:42:48,988 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-23 05:42:48,988 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-23 05:42:48,989 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-23 05:42:48,989 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-23 05:42:48,989 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-23 05:42:48,989 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-23 05:42:48,989 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-23 05:42:48,989 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-23 05:42:48,990 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-23 05:42:48,990 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-23 05:42:48,990 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-23 05:42:48,990 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-23 05:42:48,990 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-23 05:42:48,990 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-23 05:42:48,991 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-23 05:42:48,991 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-11-23 05:42:48,991 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-23 05:42:48,991 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-11-23 05:42:48,991 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /tmp/vcloud-vcloud-master/worker/working_dir_4becc31a-4406-42a9-ae1e-b055b76278dc/bin-2019/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 -> d2a071cc6090a217f48ed180b566a651717a8e39 [2018-11-23 05:42:49,017 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-23 05:42:49,028 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-23 05:42:49,031 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-23 05:42:49,032 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-23 05:42:49,033 INFO L276 PluginConnector]: CDTParser initialized [2018-11-23 05:42:49,033 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_4becc31a-4406-42a9-ae1e-b055b76278dc/bin-2019/uautomizer/../../sv-benchmarks/c/bitvector/num_conversion_1_true-unreach-call_true-no-overflow.i [2018-11-23 05:42:49,079 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_4becc31a-4406-42a9-ae1e-b055b76278dc/bin-2019/uautomizer/data/0ef73a9e8/b4b15fc417724da2927e30ea91459245/FLAGb47eda72a [2018-11-23 05:42:49,444 INFO L307 CDTParser]: Found 1 translation units. [2018-11-23 05:42:49,445 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_4becc31a-4406-42a9-ae1e-b055b76278dc/sv-benchmarks/c/bitvector/num_conversion_1_true-unreach-call_true-no-overflow.i [2018-11-23 05:42:49,449 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_4becc31a-4406-42a9-ae1e-b055b76278dc/bin-2019/uautomizer/data/0ef73a9e8/b4b15fc417724da2927e30ea91459245/FLAGb47eda72a [2018-11-23 05:42:49,858 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_4becc31a-4406-42a9-ae1e-b055b76278dc/bin-2019/uautomizer/data/0ef73a9e8/b4b15fc417724da2927e30ea91459245 [2018-11-23 05:42:49,861 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-23 05:42:49,862 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-23 05:42:49,862 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-23 05:42:49,863 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-23 05:42:49,866 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-23 05:42:49,867 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 05:42:49" (1/1) ... [2018-11-23 05:42:49,869 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@fa4fa66 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 05:42:49, skipping insertion in model container [2018-11-23 05:42:49,870 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 05:42:49" (1/1) ... [2018-11-23 05:42:49,878 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-23 05:42:49,897 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-23 05:42:50,033 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 05:42:50,036 INFO L191 MainTranslator]: Completed pre-run [2018-11-23 05:42:50,048 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 05:42:50,060 INFO L195 MainTranslator]: Completed translation [2018-11-23 05:42:50,061 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 05:42:50 WrapperNode [2018-11-23 05:42:50,061 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-23 05:42:50,061 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-23 05:42:50,061 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-23 05:42:50,061 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-23 05:42:50,067 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 05:42:50" (1/1) ... [2018-11-23 05:42:50,073 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 05:42:50" (1/1) ... [2018-11-23 05:42:50,078 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-23 05:42:50,078 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-23 05:42:50,078 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-23 05:42:50,078 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-23 05:42:50,085 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 05:42:50" (1/1) ... [2018-11-23 05:42:50,085 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 05:42:50" (1/1) ... [2018-11-23 05:42:50,085 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 05:42:50" (1/1) ... [2018-11-23 05:42:50,085 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 05:42:50" (1/1) ... [2018-11-23 05:42:50,088 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 05:42:50" (1/1) ... [2018-11-23 05:42:50,092 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 05:42:50" (1/1) ... [2018-11-23 05:42:50,093 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 05:42:50" (1/1) ... [2018-11-23 05:42:50,094 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-23 05:42:50,094 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-23 05:42:50,094 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-23 05:42:50,094 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-23 05:42:50,095 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 05:42:50" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_4becc31a-4406-42a9-ae1e-b055b76278dc/bin-2019/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 [2018-11-23 05:42:50,183 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-23 05:42:50,183 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-23 05:42:50,183 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-23 05:42:50,183 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-23 05:42:50,183 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-23 05:42:50,183 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-23 05:42:50,183 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2018-11-23 05:42:50,184 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2018-11-23 05:42:50,297 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-23 05:42:50,297 INFO L280 CfgBuilder]: Removed 1 assue(true) statements. [2018-11-23 05:42:50,298 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 05:42:50 BoogieIcfgContainer [2018-11-23 05:42:50,298 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-23 05:42:50,298 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-23 05:42:50,298 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-23 05:42:50,301 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-23 05:42:50,301 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 23.11 05:42:49" (1/3) ... [2018-11-23 05:42:50,301 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@78187512 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 05:42:50, skipping insertion in model container [2018-11-23 05:42:50,301 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 05:42:50" (2/3) ... [2018-11-23 05:42:50,302 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@78187512 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 05:42:50, skipping insertion in model container [2018-11-23 05:42:50,302 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 05:42:50" (3/3) ... [2018-11-23 05:42:50,303 INFO L112 eAbstractionObserver]: Analyzing ICFG num_conversion_1_true-unreach-call_true-no-overflow.i [2018-11-23 05:42:50,310 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-23 05:42:50,315 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-11-23 05:42:50,326 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-11-23 05:42:50,347 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-11-23 05:42:50,347 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-23 05:42:50,348 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-23 05:42:50,348 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-23 05:42:50,348 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-23 05:42:50,348 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-23 05:42:50,348 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-23 05:42:50,348 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-23 05:42:50,348 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-23 05:42:50,362 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states. [2018-11-23 05:42:50,366 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2018-11-23 05:42:50,366 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 05:42:50,367 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 05:42:50,369 INFO L423 AbstractCegarLoop]: === Iteration 1 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 05:42:50,374 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 05:42:50,374 INFO L82 PathProgramCache]: Analyzing trace with hash -147882559, now seen corresponding path program 1 times [2018-11-23 05:42:50,375 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 05:42:50,376 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 05:42:50,410 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 05:42:50,410 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 05:42:50,410 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 05:42:50,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 05:42:50,454 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 05:42:50,456 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 05:42:50,456 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-23 05:42:50,459 INFO L459 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-11-23 05:42:50,469 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-11-23 05:42:50,469 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-11-23 05:42:50,471 INFO L87 Difference]: Start difference. First operand 20 states. Second operand 2 states. [2018-11-23 05:42:50,487 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 05:42:50,487 INFO L93 Difference]: Finished difference Result 32 states and 36 transitions. [2018-11-23 05:42:50,488 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-11-23 05:42:50,488 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 10 [2018-11-23 05:42:50,489 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 05:42:50,494 INFO L225 Difference]: With dead ends: 32 [2018-11-23 05:42:50,494 INFO L226 Difference]: Without dead ends: 13 [2018-11-23 05:42:50,497 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-11-23 05:42:50,509 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13 states. [2018-11-23 05:42:50,520 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13 to 13. [2018-11-23 05:42:50,521 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2018-11-23 05:42:50,521 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 14 transitions. [2018-11-23 05:42:50,522 INFO L78 Accepts]: Start accepts. Automaton has 13 states and 14 transitions. Word has length 10 [2018-11-23 05:42:50,522 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 05:42:50,523 INFO L480 AbstractCegarLoop]: Abstraction has 13 states and 14 transitions. [2018-11-23 05:42:50,523 INFO L481 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-11-23 05:42:50,523 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 14 transitions. [2018-11-23 05:42:50,523 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2018-11-23 05:42:50,523 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 05:42:50,523 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 05:42:50,523 INFO L423 AbstractCegarLoop]: === Iteration 2 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 05:42:50,524 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 05:42:50,524 INFO L82 PathProgramCache]: Analyzing trace with hash -158041290, now seen corresponding path program 1 times [2018-11-23 05:42:50,524 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 05:42:50,524 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 05:42:50,527 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 05:42:50,527 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 05:42:50,527 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 05:42:50,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 05:42:50,582 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 05:42:50,582 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 05:42:50,582 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-23 05:42:50,584 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-23 05:42:50,584 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-23 05:42:50,584 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 05:42:50,584 INFO L87 Difference]: Start difference. First operand 13 states and 14 transitions. Second operand 3 states. [2018-11-23 05:42:50,598 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 05:42:50,598 INFO L93 Difference]: Finished difference Result 21 states and 23 transitions. [2018-11-23 05:42:50,598 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-23 05:42:50,598 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 10 [2018-11-23 05:42:50,598 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 05:42:50,599 INFO L225 Difference]: With dead ends: 21 [2018-11-23 05:42:50,599 INFO L226 Difference]: Without dead ends: 16 [2018-11-23 05:42:50,600 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 05:42:50,600 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16 states. [2018-11-23 05:42:50,602 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16 to 14. [2018-11-23 05:42:50,602 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2018-11-23 05:42:50,603 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 15 transitions. [2018-11-23 05:42:50,603 INFO L78 Accepts]: Start accepts. Automaton has 14 states and 15 transitions. Word has length 10 [2018-11-23 05:42:50,603 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 05:42:50,603 INFO L480 AbstractCegarLoop]: Abstraction has 14 states and 15 transitions. [2018-11-23 05:42:50,603 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-23 05:42:50,603 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 15 transitions. [2018-11-23 05:42:50,603 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-11-23 05:42:50,603 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 05:42:50,604 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 05:42:50,604 INFO L423 AbstractCegarLoop]: === Iteration 3 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 05:42:50,604 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 05:42:50,604 INFO L82 PathProgramCache]: Analyzing trace with hash 743821333, now seen corresponding path program 1 times [2018-11-23 05:42:50,604 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 05:42:50,604 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 05:42:50,605 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 05:42:50,605 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 05:42:50,605 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 05:42:50,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 05:42:50,673 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 05:42:50,673 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 05:42:50,673 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_4becc31a-4406-42a9-ae1e-b055b76278dc/bin-2019/uautomizer/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 05:42:50,694 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 05:42:50,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 05:42:50,712 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 05:42:50,758 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 05:42:50,774 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 05:42:50,775 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 5 [2018-11-23 05:42:50,775 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-23 05:42:50,775 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-23 05:42:50,775 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-11-23 05:42:50,775 INFO L87 Difference]: Start difference. First operand 14 states and 15 transitions. Second operand 5 states. [2018-11-23 05:42:50,800 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 05:42:50,801 INFO L93 Difference]: Finished difference Result 24 states and 27 transitions. [2018-11-23 05:42:50,801 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-23 05:42:50,801 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 13 [2018-11-23 05:42:50,801 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 05:42:50,802 INFO L225 Difference]: With dead ends: 24 [2018-11-23 05:42:50,802 INFO L226 Difference]: Without dead ends: 19 [2018-11-23 05:42:50,802 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 12 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-11-23 05:42:50,802 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states. [2018-11-23 05:42:50,804 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 17. [2018-11-23 05:42:50,805 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2018-11-23 05:42:50,805 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 19 transitions. [2018-11-23 05:42:50,805 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 19 transitions. Word has length 13 [2018-11-23 05:42:50,805 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 05:42:50,805 INFO L480 AbstractCegarLoop]: Abstraction has 17 states and 19 transitions. [2018-11-23 05:42:50,806 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-23 05:42:50,806 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 19 transitions. [2018-11-23 05:42:50,806 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-11-23 05:42:50,806 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 05:42:50,806 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 05:42:50,806 INFO L423 AbstractCegarLoop]: === Iteration 4 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 05:42:50,807 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 05:42:50,807 INFO L82 PathProgramCache]: Analyzing trace with hash -1182180650, now seen corresponding path program 2 times [2018-11-23 05:42:50,807 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 05:42:50,807 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 05:42:50,808 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 05:42:50,808 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 05:42:50,808 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 05:42:50,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 05:42:50,894 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 05:42:50,895 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 05:42:50,895 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_4becc31a-4406-42a9-ae1e-b055b76278dc/bin-2019/uautomizer/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 05:42:50,913 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-11-23 05:42:50,925 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-11-23 05:42:50,925 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 05:42:50,927 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 05:42:50,976 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 05:42:50,993 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 05:42:50,993 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 7 [2018-11-23 05:42:50,994 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-11-23 05:42:50,994 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-11-23 05:42:50,994 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2018-11-23 05:42:50,994 INFO L87 Difference]: Start difference. First operand 17 states and 19 transitions. Second operand 7 states. [2018-11-23 05:42:51,032 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 05:42:51,032 INFO L93 Difference]: Finished difference Result 27 states and 31 transitions. [2018-11-23 05:42:51,033 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-23 05:42:51,033 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 16 [2018-11-23 05:42:51,033 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 05:42:51,034 INFO L225 Difference]: With dead ends: 27 [2018-11-23 05:42:51,034 INFO L226 Difference]: Without dead ends: 22 [2018-11-23 05:42:51,034 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 14 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2018-11-23 05:42:51,034 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states. [2018-11-23 05:42:51,038 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 20. [2018-11-23 05:42:51,038 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2018-11-23 05:42:51,039 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 23 transitions. [2018-11-23 05:42:51,039 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 23 transitions. Word has length 16 [2018-11-23 05:42:51,039 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 05:42:51,039 INFO L480 AbstractCegarLoop]: Abstraction has 20 states and 23 transitions. [2018-11-23 05:42:51,039 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-11-23 05:42:51,039 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 23 transitions. [2018-11-23 05:42:51,040 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-11-23 05:42:51,040 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 05:42:51,040 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 05:42:51,040 INFO L423 AbstractCegarLoop]: === Iteration 5 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 05:42:51,041 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 05:42:51,041 INFO L82 PathProgramCache]: Analyzing trace with hash 2055818357, now seen corresponding path program 3 times [2018-11-23 05:42:51,041 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 05:42:51,041 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 05:42:51,042 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 05:42:51,042 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 05:42:51,042 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 05:42:51,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 05:42:51,125 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 05:42:51,125 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 05:42:51,125 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_4becc31a-4406-42a9-ae1e-b055b76278dc/bin-2019/uautomizer/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 05:42:51,133 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-23 05:42:51,145 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2018-11-23 05:42:51,145 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 05:42:51,147 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 05:42:51,197 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 05:42:51,215 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 05:42:51,215 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 9 [2018-11-23 05:42:51,215 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-11-23 05:42:51,215 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-11-23 05:42:51,216 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2018-11-23 05:42:51,216 INFO L87 Difference]: Start difference. First operand 20 states and 23 transitions. Second operand 9 states. [2018-11-23 05:42:51,254 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 05:42:51,254 INFO L93 Difference]: Finished difference Result 30 states and 35 transitions. [2018-11-23 05:42:51,255 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-23 05:42:51,255 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 19 [2018-11-23 05:42:51,255 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 05:42:51,256 INFO L225 Difference]: With dead ends: 30 [2018-11-23 05:42:51,256 INFO L226 Difference]: Without dead ends: 25 [2018-11-23 05:42:51,256 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 16 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2018-11-23 05:42:51,257 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2018-11-23 05:42:51,260 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 23. [2018-11-23 05:42:51,260 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2018-11-23 05:42:51,261 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 27 transitions. [2018-11-23 05:42:51,261 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 27 transitions. Word has length 19 [2018-11-23 05:42:51,261 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 05:42:51,262 INFO L480 AbstractCegarLoop]: Abstraction has 23 states and 27 transitions. [2018-11-23 05:42:51,262 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-11-23 05:42:51,262 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 27 transitions. [2018-11-23 05:42:51,262 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-11-23 05:42:51,262 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 05:42:51,262 INFO L402 BasicCegarLoop]: trace histogram [4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 05:42:51,263 INFO L423 AbstractCegarLoop]: === Iteration 6 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 05:42:51,263 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 05:42:51,263 INFO L82 PathProgramCache]: Analyzing trace with hash 318767734, now seen corresponding path program 4 times [2018-11-23 05:42:51,263 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 05:42:51,263 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 05:42:51,264 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 05:42:51,264 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 05:42:51,264 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 05:42:51,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 05:42:51,357 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 05:42:51,357 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 05:42:51,357 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_4becc31a-4406-42a9-ae1e-b055b76278dc/bin-2019/uautomizer/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 05:42:51,367 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-23 05:42:51,376 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-23 05:42:51,376 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 05:42:51,377 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 05:42:51,470 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 05:42:51,487 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 05:42:51,487 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 11 [2018-11-23 05:42:51,487 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-11-23 05:42:51,488 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-11-23 05:42:51,488 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=80, Unknown=0, NotChecked=0, Total=110 [2018-11-23 05:42:51,488 INFO L87 Difference]: Start difference. First operand 23 states and 27 transitions. Second operand 11 states. [2018-11-23 05:42:51,584 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 05:42:51,584 INFO L93 Difference]: Finished difference Result 33 states and 39 transitions. [2018-11-23 05:42:51,586 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-23 05:42:51,586 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 22 [2018-11-23 05:42:51,587 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 05:42:51,587 INFO L225 Difference]: With dead ends: 33 [2018-11-23 05:42:51,588 INFO L226 Difference]: Without dead ends: 28 [2018-11-23 05:42:51,588 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 18 SyntacticMatches, 1 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=30, Invalid=80, Unknown=0, NotChecked=0, Total=110 [2018-11-23 05:42:51,588 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2018-11-23 05:42:51,596 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 26. [2018-11-23 05:42:51,596 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2018-11-23 05:42:51,597 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 31 transitions. [2018-11-23 05:42:51,597 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 31 transitions. Word has length 22 [2018-11-23 05:42:51,597 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 05:42:51,598 INFO L480 AbstractCegarLoop]: Abstraction has 26 states and 31 transitions. [2018-11-23 05:42:51,598 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-11-23 05:42:51,598 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 31 transitions. [2018-11-23 05:42:51,598 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-11-23 05:42:51,598 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 05:42:51,599 INFO L402 BasicCegarLoop]: trace histogram [5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 05:42:51,599 INFO L423 AbstractCegarLoop]: === Iteration 7 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 05:42:51,599 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 05:42:51,599 INFO L82 PathProgramCache]: Analyzing trace with hash 1904607445, now seen corresponding path program 5 times [2018-11-23 05:42:51,599 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 05:42:51,600 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 05:42:51,600 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 05:42:51,600 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 05:42:51,601 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 05:42:51,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 05:42:51,699 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 0 proven. 35 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 05:42:51,699 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 05:42:51,699 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_4becc31a-4406-42a9-ae1e-b055b76278dc/bin-2019/uautomizer/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 05:42:51,711 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-11-23 05:42:51,734 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 6 check-sat command(s) [2018-11-23 05:42:51,734 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 05:42:51,737 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 05:42:51,887 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 0 proven. 35 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 05:42:51,905 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 05:42:51,905 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 13 [2018-11-23 05:42:51,905 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-11-23 05:42:51,906 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-11-23 05:42:51,906 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=119, Unknown=0, NotChecked=0, Total=156 [2018-11-23 05:42:51,906 INFO L87 Difference]: Start difference. First operand 26 states and 31 transitions. Second operand 13 states. [2018-11-23 05:42:52,067 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 05:42:52,067 INFO L93 Difference]: Finished difference Result 36 states and 43 transitions. [2018-11-23 05:42:52,068 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-11-23 05:42:52,069 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 25 [2018-11-23 05:42:52,069 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 05:42:52,069 INFO L225 Difference]: With dead ends: 36 [2018-11-23 05:42:52,069 INFO L226 Difference]: Without dead ends: 31 [2018-11-23 05:42:52,070 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 15 SyntacticMatches, 6 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 35 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=37, Invalid=119, Unknown=0, NotChecked=0, Total=156 [2018-11-23 05:42:52,070 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2018-11-23 05:42:52,075 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 29. [2018-11-23 05:42:52,075 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2018-11-23 05:42:52,076 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 35 transitions. [2018-11-23 05:42:52,076 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 35 transitions. Word has length 25 [2018-11-23 05:42:52,076 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 05:42:52,076 INFO L480 AbstractCegarLoop]: Abstraction has 29 states and 35 transitions. [2018-11-23 05:42:52,077 INFO L481 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-11-23 05:42:52,077 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 35 transitions. [2018-11-23 05:42:52,077 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2018-11-23 05:42:52,077 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 05:42:52,077 INFO L402 BasicCegarLoop]: trace histogram [6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 05:42:52,077 INFO L423 AbstractCegarLoop]: === Iteration 8 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 05:42:52,078 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 05:42:52,078 INFO L82 PathProgramCache]: Analyzing trace with hash 1015181846, now seen corresponding path program 6 times [2018-11-23 05:42:52,078 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 05:42:52,078 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 05:42:52,078 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 05:42:52,078 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 05:42:52,079 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 05:42:52,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 05:42:52,182 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 0 proven. 51 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 05:42:52,182 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 05:42:52,182 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_4becc31a-4406-42a9-ae1e-b055b76278dc/bin-2019/uautomizer/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 05:42:52,192 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-11-23 05:42:52,215 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 7 check-sat command(s) [2018-11-23 05:42:52,215 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 05:42:52,217 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 05:42:52,363 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 0 proven. 51 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 05:42:52,382 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 05:42:52,382 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 15 [2018-11-23 05:42:52,382 INFO L459 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-11-23 05:42:52,383 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-11-23 05:42:52,383 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=166, Unknown=0, NotChecked=0, Total=210 [2018-11-23 05:42:52,383 INFO L87 Difference]: Start difference. First operand 29 states and 35 transitions. Second operand 15 states. [2018-11-23 05:42:52,499 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 05:42:52,499 INFO L93 Difference]: Finished difference Result 39 states and 47 transitions. [2018-11-23 05:42:52,500 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-11-23 05:42:52,500 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 28 [2018-11-23 05:42:52,500 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 05:42:52,501 INFO L225 Difference]: With dead ends: 39 [2018-11-23 05:42:52,501 INFO L226 Difference]: Without dead ends: 34 [2018-11-23 05:42:52,501 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 22 SyntacticMatches, 1 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 27 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=44, Invalid=166, Unknown=0, NotChecked=0, Total=210 [2018-11-23 05:42:52,501 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2018-11-23 05:42:52,506 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 32. [2018-11-23 05:42:52,506 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2018-11-23 05:42:52,507 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 39 transitions. [2018-11-23 05:42:52,507 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 39 transitions. Word has length 28 [2018-11-23 05:42:52,507 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 05:42:52,507 INFO L480 AbstractCegarLoop]: Abstraction has 32 states and 39 transitions. [2018-11-23 05:42:52,507 INFO L481 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-11-23 05:42:52,507 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 39 transitions. [2018-11-23 05:42:52,508 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2018-11-23 05:42:52,508 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 05:42:52,508 INFO L402 BasicCegarLoop]: trace histogram [7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 05:42:52,508 INFO L423 AbstractCegarLoop]: === Iteration 9 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 05:42:52,508 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 05:42:52,509 INFO L82 PathProgramCache]: Analyzing trace with hash -209588939, now seen corresponding path program 7 times [2018-11-23 05:42:52,509 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 05:42:52,509 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 05:42:52,509 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 05:42:52,510 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 05:42:52,510 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 05:42:52,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 05:42:52,628 INFO L134 CoverageAnalysis]: Checked inductivity of 70 backedges. 0 proven. 70 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 05:42:52,629 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 05:42:52,629 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_4becc31a-4406-42a9-ae1e-b055b76278dc/bin-2019/uautomizer/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 05:42:52,644 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 05:42:52,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 05:42:52,659 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 05:42:52,878 INFO L134 CoverageAnalysis]: Checked inductivity of 70 backedges. 0 proven. 70 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 05:42:52,895 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 05:42:52,895 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 17 [2018-11-23 05:42:52,896 INFO L459 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-11-23 05:42:52,896 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-11-23 05:42:52,896 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=221, Unknown=0, NotChecked=0, Total=272 [2018-11-23 05:42:52,897 INFO L87 Difference]: Start difference. First operand 32 states and 39 transitions. Second operand 17 states. [2018-11-23 05:42:53,045 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 05:42:53,045 INFO L93 Difference]: Finished difference Result 42 states and 51 transitions. [2018-11-23 05:42:53,045 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-11-23 05:42:53,045 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 31 [2018-11-23 05:42:53,046 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 05:42:53,046 INFO L225 Difference]: With dead ends: 42 [2018-11-23 05:42:53,046 INFO L226 Difference]: Without dead ends: 37 [2018-11-23 05:42:53,046 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 23 SyntacticMatches, 2 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 42 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=51, Invalid=221, Unknown=0, NotChecked=0, Total=272 [2018-11-23 05:42:53,047 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2018-11-23 05:42:53,050 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 35. [2018-11-23 05:42:53,050 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35 states. [2018-11-23 05:42:53,051 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 43 transitions. [2018-11-23 05:42:53,051 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 43 transitions. Word has length 31 [2018-11-23 05:42:53,051 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 05:42:53,051 INFO L480 AbstractCegarLoop]: Abstraction has 35 states and 43 transitions. [2018-11-23 05:42:53,051 INFO L481 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-11-23 05:42:53,051 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 43 transitions. [2018-11-23 05:42:53,052 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2018-11-23 05:42:53,052 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 05:42:53,052 INFO L402 BasicCegarLoop]: trace histogram [8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 05:42:53,052 INFO L423 AbstractCegarLoop]: === Iteration 10 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 05:42:53,052 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 05:42:53,052 INFO L82 PathProgramCache]: Analyzing trace with hash -1608865354, now seen corresponding path program 8 times [2018-11-23 05:42:53,053 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 05:42:53,053 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 05:42:53,053 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 05:42:53,053 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 05:42:53,054 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 05:42:53,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 05:42:53,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 05:42:53,091 INFO L469 BasicCegarLoop]: Counterexample might be feasible ----- class de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.RCFGBacktranslator [?] CALL call ULTIMATE.init(); [?] assume true; [?] RET #39#return; [?] CALL call #t~ret0 := main(); [?] havoc ~x~0;havoc ~y~0;havoc ~c~0;~x~0 := 37;~y~0 := 0;~c~0 := 0; VAL [main_~c~0=0, main_~x~0=37, main_~y~0=0] [?] assume !!(~c~0 % 256 < 8);~i~0 := ~shiftLeft(1, ~c~0 % 256);~bit~0 := ~bitwiseAnd(~x~0 % 256, ~i~0 % 256); VAL [main_~c~0=0, main_~x~0=37, main_~y~0=0] [?] assume 0 != ~bit~0 % 256;~y~0 := ~y~0 % 256 + ~i~0 % 256; VAL [main_~bit~0=1, main_~c~0=0, main_~i~0=0, main_~x~0=37, main_~y~0=0] [?] ~c~0 := 1 + ~c~0 % 256; VAL [main_~bit~0=1, main_~c~0=1, main_~i~0=0, main_~x~0=37, main_~y~0=0] [?] assume !!(~c~0 % 256 < 8);~i~0 := ~shiftLeft(1, ~c~0 % 256);~bit~0 := ~bitwiseAnd(~x~0 % 256, ~i~0 % 256); VAL [main_~c~0=1, main_~x~0=37, main_~y~0=0] [?] assume 0 != ~bit~0 % 256;~y~0 := ~y~0 % 256 + ~i~0 % 256; VAL [main_~bit~0=1, main_~c~0=1, main_~i~0=0, main_~x~0=37, main_~y~0=0] [?] ~c~0 := 1 + ~c~0 % 256; VAL [main_~bit~0=1, main_~c~0=2, main_~i~0=0, main_~x~0=37, main_~y~0=0] [?] assume !!(~c~0 % 256 < 8);~i~0 := ~shiftLeft(1, ~c~0 % 256);~bit~0 := ~bitwiseAnd(~x~0 % 256, ~i~0 % 256); VAL [main_~c~0=2, main_~x~0=37, main_~y~0=0] [?] assume 0 != ~bit~0 % 256;~y~0 := ~y~0 % 256 + ~i~0 % 256; VAL [main_~bit~0=1, main_~c~0=2, main_~i~0=0, main_~x~0=37, main_~y~0=0] [?] ~c~0 := 1 + ~c~0 % 256; VAL [main_~bit~0=1, main_~c~0=3, main_~i~0=0, main_~x~0=37, main_~y~0=0] [?] assume !!(~c~0 % 256 < 8);~i~0 := ~shiftLeft(1, ~c~0 % 256);~bit~0 := ~bitwiseAnd(~x~0 % 256, ~i~0 % 256); VAL [main_~c~0=3, main_~x~0=37, main_~y~0=0] [?] assume 0 != ~bit~0 % 256;~y~0 := ~y~0 % 256 + ~i~0 % 256; VAL [main_~bit~0=1, main_~c~0=3, main_~i~0=0, main_~x~0=37, main_~y~0=0] [?] ~c~0 := 1 + ~c~0 % 256; VAL [main_~bit~0=1, main_~c~0=4, main_~i~0=0, main_~x~0=37, main_~y~0=0] [?] assume !!(~c~0 % 256 < 8);~i~0 := ~shiftLeft(1, ~c~0 % 256);~bit~0 := ~bitwiseAnd(~x~0 % 256, ~i~0 % 256); VAL [main_~c~0=4, main_~x~0=37, main_~y~0=0] [?] assume 0 != ~bit~0 % 256;~y~0 := ~y~0 % 256 + ~i~0 % 256; VAL [main_~bit~0=1, main_~c~0=4, main_~i~0=0, main_~x~0=37, main_~y~0=0] [?] ~c~0 := 1 + ~c~0 % 256; VAL [main_~bit~0=1, main_~c~0=5, main_~i~0=0, main_~x~0=37, main_~y~0=0] [?] assume !!(~c~0 % 256 < 8);~i~0 := ~shiftLeft(1, ~c~0 % 256);~bit~0 := ~bitwiseAnd(~x~0 % 256, ~i~0 % 256); VAL [main_~c~0=5, main_~x~0=37, main_~y~0=0] [?] assume 0 != ~bit~0 % 256;~y~0 := ~y~0 % 256 + ~i~0 % 256; VAL [main_~bit~0=1, main_~c~0=5, main_~i~0=0, main_~x~0=37, main_~y~0=0] [?] ~c~0 := 1 + ~c~0 % 256; VAL [main_~bit~0=1, main_~c~0=6, main_~i~0=0, main_~x~0=37, main_~y~0=0] [?] assume !!(~c~0 % 256 < 8);~i~0 := ~shiftLeft(1, ~c~0 % 256);~bit~0 := ~bitwiseAnd(~x~0 % 256, ~i~0 % 256); VAL [main_~c~0=6, main_~x~0=37, main_~y~0=0] [?] assume 0 != ~bit~0 % 256;~y~0 := ~y~0 % 256 + ~i~0 % 256; VAL [main_~bit~0=1, main_~c~0=6, main_~i~0=0, main_~x~0=37, main_~y~0=0] [?] ~c~0 := 1 + ~c~0 % 256; VAL [main_~bit~0=1, main_~c~0=7, main_~i~0=0, main_~x~0=37, main_~y~0=0] [?] assume !!(~c~0 % 256 < 8);~i~0 := ~shiftLeft(1, ~c~0 % 256);~bit~0 := ~bitwiseAnd(~x~0 % 256, ~i~0 % 256); VAL [main_~c~0=7, main_~x~0=37, main_~y~0=0] [?] assume 0 != ~bit~0 % 256;~y~0 := ~y~0 % 256 + ~i~0 % 256; VAL [main_~bit~0=1, main_~c~0=7, main_~i~0=0, main_~x~0=37, main_~y~0=0] [?] ~c~0 := 1 + ~c~0 % 256; VAL [main_~bit~0=1, main_~c~0=8, main_~i~0=0, main_~x~0=37, main_~y~0=0] [?] assume !(~c~0 % 256 < 8); VAL [main_~bit~0=1, main_~c~0=8, main_~i~0=0, main_~x~0=37, main_~y~0=0] [?] CALL call __VERIFIER_assert((if ~x~0 % 256 == ~y~0 % 256 then 1 else 0)); VAL [|__VERIFIER_assert_#in~cond|=0] [?] ~cond := #in~cond; VAL [__VERIFIER_assert_~cond=0, |__VERIFIER_assert_#in~cond|=0] [?] assume 0 == ~cond; VAL [__VERIFIER_assert_~cond=0, |__VERIFIER_assert_#in~cond|=0] [?] assume !false; VAL [__VERIFIER_assert_~cond=0, |__VERIFIER_assert_#in~cond|=0] [?] CALL call ULTIMATE.init(); [?] ensures true; [?] RET call ULTIMATE.init(); [?] CALL call #t~ret0 := main(); [L14] havoc ~x~0; [L15] havoc ~y~0; [L16] havoc ~c~0; [L18] ~x~0 := 37; [L19] ~y~0 := 0; [L20] ~c~0 := 0; VAL [~c~0=0, ~x~0=37, ~y~0=0] [L21-L28] assume !!(~c~0 % 256 < 8); [L22] ~i~0 := ~shiftLeft(1, ~c~0 % 256); [L23] ~bit~0 := ~bitwiseAnd(~x~0 % 256, ~i~0 % 256); VAL [~c~0=0, ~x~0=37, ~y~0=0] [L24-L26] assume 0 != ~bit~0 % 256; [L25] ~y~0 := ~y~0 % 256 + ~i~0 % 256; VAL [~bit~0=1, ~c~0=0, ~i~0=0, ~x~0=37, ~y~0=0] [L27] ~c~0 := 1 + ~c~0 % 256; VAL [~bit~0=1, ~c~0=1, ~i~0=0, ~x~0=37, ~y~0=0] [L21-L28] assume !!(~c~0 % 256 < 8); [L22] ~i~0 := ~shiftLeft(1, ~c~0 % 256); [L23] ~bit~0 := ~bitwiseAnd(~x~0 % 256, ~i~0 % 256); VAL [~c~0=1, ~x~0=37, ~y~0=0] [L24-L26] assume 0 != ~bit~0 % 256; [L25] ~y~0 := ~y~0 % 256 + ~i~0 % 256; VAL [~bit~0=1, ~c~0=1, ~i~0=0, ~x~0=37, ~y~0=0] [L27] ~c~0 := 1 + ~c~0 % 256; VAL [~bit~0=1, ~c~0=2, ~i~0=0, ~x~0=37, ~y~0=0] [L21-L28] assume !!(~c~0 % 256 < 8); [L22] ~i~0 := ~shiftLeft(1, ~c~0 % 256); [L23] ~bit~0 := ~bitwiseAnd(~x~0 % 256, ~i~0 % 256); VAL [~c~0=2, ~x~0=37, ~y~0=0] [L24-L26] assume 0 != ~bit~0 % 256; [L25] ~y~0 := ~y~0 % 256 + ~i~0 % 256; VAL [~bit~0=1, ~c~0=2, ~i~0=0, ~x~0=37, ~y~0=0] [L27] ~c~0 := 1 + ~c~0 % 256; VAL [~bit~0=1, ~c~0=3, ~i~0=0, ~x~0=37, ~y~0=0] [L21-L28] assume !!(~c~0 % 256 < 8); [L22] ~i~0 := ~shiftLeft(1, ~c~0 % 256); [L23] ~bit~0 := ~bitwiseAnd(~x~0 % 256, ~i~0 % 256); VAL [~c~0=3, ~x~0=37, ~y~0=0] [L24-L26] assume 0 != ~bit~0 % 256; [L25] ~y~0 := ~y~0 % 256 + ~i~0 % 256; VAL [~bit~0=1, ~c~0=3, ~i~0=0, ~x~0=37, ~y~0=0] [L27] ~c~0 := 1 + ~c~0 % 256; VAL [~bit~0=1, ~c~0=4, ~i~0=0, ~x~0=37, ~y~0=0] [L21-L28] assume !!(~c~0 % 256 < 8); [L22] ~i~0 := ~shiftLeft(1, ~c~0 % 256); [L23] ~bit~0 := ~bitwiseAnd(~x~0 % 256, ~i~0 % 256); VAL [~c~0=4, ~x~0=37, ~y~0=0] [L24-L26] assume 0 != ~bit~0 % 256; [L25] ~y~0 := ~y~0 % 256 + ~i~0 % 256; VAL [~bit~0=1, ~c~0=4, ~i~0=0, ~x~0=37, ~y~0=0] [L27] ~c~0 := 1 + ~c~0 % 256; VAL [~bit~0=1, ~c~0=5, ~i~0=0, ~x~0=37, ~y~0=0] [L21-L28] assume !!(~c~0 % 256 < 8); [L22] ~i~0 := ~shiftLeft(1, ~c~0 % 256); [L23] ~bit~0 := ~bitwiseAnd(~x~0 % 256, ~i~0 % 256); VAL [~c~0=5, ~x~0=37, ~y~0=0] [L24-L26] assume 0 != ~bit~0 % 256; [L25] ~y~0 := ~y~0 % 256 + ~i~0 % 256; VAL [~bit~0=1, ~c~0=5, ~i~0=0, ~x~0=37, ~y~0=0] [L27] ~c~0 := 1 + ~c~0 % 256; VAL [~bit~0=1, ~c~0=6, ~i~0=0, ~x~0=37, ~y~0=0] [L21-L28] assume !!(~c~0 % 256 < 8); [L22] ~i~0 := ~shiftLeft(1, ~c~0 % 256); [L23] ~bit~0 := ~bitwiseAnd(~x~0 % 256, ~i~0 % 256); VAL [~c~0=6, ~x~0=37, ~y~0=0] [L24-L26] assume 0 != ~bit~0 % 256; [L25] ~y~0 := ~y~0 % 256 + ~i~0 % 256; VAL [~bit~0=1, ~c~0=6, ~i~0=0, ~x~0=37, ~y~0=0] [L27] ~c~0 := 1 + ~c~0 % 256; VAL [~bit~0=1, ~c~0=7, ~i~0=0, ~x~0=37, ~y~0=0] [L21-L28] assume !!(~c~0 % 256 < 8); [L22] ~i~0 := ~shiftLeft(1, ~c~0 % 256); [L23] ~bit~0 := ~bitwiseAnd(~x~0 % 256, ~i~0 % 256); VAL [~c~0=7, ~x~0=37, ~y~0=0] [L24-L26] assume 0 != ~bit~0 % 256; [L25] ~y~0 := ~y~0 % 256 + ~i~0 % 256; VAL [~bit~0=1, ~c~0=7, ~i~0=0, ~x~0=37, ~y~0=0] [L27] ~c~0 := 1 + ~c~0 % 256; VAL [~bit~0=1, ~c~0=8, ~i~0=0, ~x~0=37, ~y~0=0] [L21-L28] assume !(~c~0 % 256 < 8); VAL [~bit~0=1, ~c~0=8, ~i~0=0, ~x~0=37, ~y~0=0] [L29] CALL call __VERIFIER_assert((if ~x~0 % 256 == ~y~0 % 256 then 1 else 0)); VAL [#in~cond=0] [L4-L9] ~cond := #in~cond; VAL [#in~cond=0, ~cond=0] [L5-L7] assume 0 == ~cond; VAL [#in~cond=0, ~cond=0] [L6] assert false; VAL [#in~cond=0, ~cond=0] ----- ----- class de.uni_freiburg.informatik.ultimate.boogie.preprocessor.BoogiePreprocessorBacktranslator [?] CALL call ULTIMATE.init(); [?] ensures true; [?] RET call ULTIMATE.init(); [?] CALL call #t~ret0 := main(); [L14] havoc ~x~0; [L15] havoc ~y~0; [L16] havoc ~c~0; [L18] ~x~0 := 37; [L19] ~y~0 := 0; [L20] ~c~0 := 0; VAL [~c~0=0, ~x~0=37, ~y~0=0] [L21-L28] assume !!(~c~0 % 256 < 8); [L22] ~i~0 := ~shiftLeft(1, ~c~0 % 256); [L23] ~bit~0 := ~bitwiseAnd(~x~0 % 256, ~i~0 % 256); VAL [~c~0=0, ~x~0=37, ~y~0=0] [L24-L26] assume 0 != ~bit~0 % 256; [L25] ~y~0 := ~y~0 % 256 + ~i~0 % 256; VAL [~bit~0=1, ~c~0=0, ~i~0=0, ~x~0=37, ~y~0=0] [L27] ~c~0 := 1 + ~c~0 % 256; VAL [~bit~0=1, ~c~0=1, ~i~0=0, ~x~0=37, ~y~0=0] [L21-L28] assume !!(~c~0 % 256 < 8); [L22] ~i~0 := ~shiftLeft(1, ~c~0 % 256); [L23] ~bit~0 := ~bitwiseAnd(~x~0 % 256, ~i~0 % 256); VAL [~c~0=1, ~x~0=37, ~y~0=0] [L24-L26] assume 0 != ~bit~0 % 256; [L25] ~y~0 := ~y~0 % 256 + ~i~0 % 256; VAL [~bit~0=1, ~c~0=1, ~i~0=0, ~x~0=37, ~y~0=0] [L27] ~c~0 := 1 + ~c~0 % 256; VAL [~bit~0=1, ~c~0=2, ~i~0=0, ~x~0=37, ~y~0=0] [L21-L28] assume !!(~c~0 % 256 < 8); [L22] ~i~0 := ~shiftLeft(1, ~c~0 % 256); [L23] ~bit~0 := ~bitwiseAnd(~x~0 % 256, ~i~0 % 256); VAL [~c~0=2, ~x~0=37, ~y~0=0] [L24-L26] assume 0 != ~bit~0 % 256; [L25] ~y~0 := ~y~0 % 256 + ~i~0 % 256; VAL [~bit~0=1, ~c~0=2, ~i~0=0, ~x~0=37, ~y~0=0] [L27] ~c~0 := 1 + ~c~0 % 256; VAL [~bit~0=1, ~c~0=3, ~i~0=0, ~x~0=37, ~y~0=0] [L21-L28] assume !!(~c~0 % 256 < 8); [L22] ~i~0 := ~shiftLeft(1, ~c~0 % 256); [L23] ~bit~0 := ~bitwiseAnd(~x~0 % 256, ~i~0 % 256); VAL [~c~0=3, ~x~0=37, ~y~0=0] [L24-L26] assume 0 != ~bit~0 % 256; [L25] ~y~0 := ~y~0 % 256 + ~i~0 % 256; VAL [~bit~0=1, ~c~0=3, ~i~0=0, ~x~0=37, ~y~0=0] [L27] ~c~0 := 1 + ~c~0 % 256; VAL [~bit~0=1, ~c~0=4, ~i~0=0, ~x~0=37, ~y~0=0] [L21-L28] assume !!(~c~0 % 256 < 8); [L22] ~i~0 := ~shiftLeft(1, ~c~0 % 256); [L23] ~bit~0 := ~bitwiseAnd(~x~0 % 256, ~i~0 % 256); VAL [~c~0=4, ~x~0=37, ~y~0=0] [L24-L26] assume 0 != ~bit~0 % 256; [L25] ~y~0 := ~y~0 % 256 + ~i~0 % 256; VAL [~bit~0=1, ~c~0=4, ~i~0=0, ~x~0=37, ~y~0=0] [L27] ~c~0 := 1 + ~c~0 % 256; VAL [~bit~0=1, ~c~0=5, ~i~0=0, ~x~0=37, ~y~0=0] [L21-L28] assume !!(~c~0 % 256 < 8); [L22] ~i~0 := ~shiftLeft(1, ~c~0 % 256); [L23] ~bit~0 := ~bitwiseAnd(~x~0 % 256, ~i~0 % 256); VAL [~c~0=5, ~x~0=37, ~y~0=0] [L24-L26] assume 0 != ~bit~0 % 256; [L25] ~y~0 := ~y~0 % 256 + ~i~0 % 256; VAL [~bit~0=1, ~c~0=5, ~i~0=0, ~x~0=37, ~y~0=0] [L27] ~c~0 := 1 + ~c~0 % 256; VAL [~bit~0=1, ~c~0=6, ~i~0=0, ~x~0=37, ~y~0=0] [L21-L28] assume !!(~c~0 % 256 < 8); [L22] ~i~0 := ~shiftLeft(1, ~c~0 % 256); [L23] ~bit~0 := ~bitwiseAnd(~x~0 % 256, ~i~0 % 256); VAL [~c~0=6, ~x~0=37, ~y~0=0] [L24-L26] assume 0 != ~bit~0 % 256; [L25] ~y~0 := ~y~0 % 256 + ~i~0 % 256; VAL [~bit~0=1, ~c~0=6, ~i~0=0, ~x~0=37, ~y~0=0] [L27] ~c~0 := 1 + ~c~0 % 256; VAL [~bit~0=1, ~c~0=7, ~i~0=0, ~x~0=37, ~y~0=0] [L21-L28] assume !!(~c~0 % 256 < 8); [L22] ~i~0 := ~shiftLeft(1, ~c~0 % 256); [L23] ~bit~0 := ~bitwiseAnd(~x~0 % 256, ~i~0 % 256); VAL [~c~0=7, ~x~0=37, ~y~0=0] [L24-L26] assume 0 != ~bit~0 % 256; [L25] ~y~0 := ~y~0 % 256 + ~i~0 % 256; VAL [~bit~0=1, ~c~0=7, ~i~0=0, ~x~0=37, ~y~0=0] [L27] ~c~0 := 1 + ~c~0 % 256; VAL [~bit~0=1, ~c~0=8, ~i~0=0, ~x~0=37, ~y~0=0] [L21-L28] assume !(~c~0 % 256 < 8); VAL [~bit~0=1, ~c~0=8, ~i~0=0, ~x~0=37, ~y~0=0] [L29] CALL call __VERIFIER_assert((if ~x~0 % 256 == ~y~0 % 256 then 1 else 0)); VAL [#in~cond=0] [L4-L9] ~cond := #in~cond; VAL [#in~cond=0, ~cond=0] [L5-L7] assume 0 == ~cond; VAL [#in~cond=0, ~cond=0] [L6] assert false; VAL [#in~cond=0, ~cond=0] [?] CALL call ULTIMATE.init(); [?] RET call ULTIMATE.init(); [?] CALL call #t~ret0 := main(); [L14] havoc ~x~0; [L15] havoc ~y~0; [L16] havoc ~c~0; [L18] ~x~0 := 37; [L19] ~y~0 := 0; [L20] ~c~0 := 0; VAL [~c~0=0, ~x~0=37, ~y~0=0] [L21-L28] COND FALSE !(!(~c~0 % 256 < 8)) [L22] ~i~0 := ~shiftLeft(1, ~c~0 % 256); [L23] ~bit~0 := ~bitwiseAnd(~x~0 % 256, ~i~0 % 256); VAL [~c~0=0, ~x~0=37, ~y~0=0] [L24] COND TRUE 0 != ~bit~0 % 256 [L25] ~y~0 := ~y~0 % 256 + ~i~0 % 256; VAL [~bit~0=1, ~c~0=0, ~i~0=0, ~x~0=37, ~y~0=0] [L27] ~c~0 := 1 + ~c~0 % 256; VAL [~bit~0=1, ~c~0=1, ~i~0=0, ~x~0=37, ~y~0=0] [L21-L28] COND FALSE !(!(~c~0 % 256 < 8)) [L22] ~i~0 := ~shiftLeft(1, ~c~0 % 256); [L23] ~bit~0 := ~bitwiseAnd(~x~0 % 256, ~i~0 % 256); VAL [~c~0=1, ~x~0=37, ~y~0=0] [L24] COND TRUE 0 != ~bit~0 % 256 [L25] ~y~0 := ~y~0 % 256 + ~i~0 % 256; VAL [~bit~0=1, ~c~0=1, ~i~0=0, ~x~0=37, ~y~0=0] [L27] ~c~0 := 1 + ~c~0 % 256; VAL [~bit~0=1, ~c~0=2, ~i~0=0, ~x~0=37, ~y~0=0] [L21-L28] COND FALSE !(!(~c~0 % 256 < 8)) [L22] ~i~0 := ~shiftLeft(1, ~c~0 % 256); [L23] ~bit~0 := ~bitwiseAnd(~x~0 % 256, ~i~0 % 256); VAL [~c~0=2, ~x~0=37, ~y~0=0] [L24] COND TRUE 0 != ~bit~0 % 256 [L25] ~y~0 := ~y~0 % 256 + ~i~0 % 256; VAL [~bit~0=1, ~c~0=2, ~i~0=0, ~x~0=37, ~y~0=0] [L27] ~c~0 := 1 + ~c~0 % 256; VAL [~bit~0=1, ~c~0=3, ~i~0=0, ~x~0=37, ~y~0=0] [L21-L28] COND FALSE !(!(~c~0 % 256 < 8)) [L22] ~i~0 := ~shiftLeft(1, ~c~0 % 256); [L23] ~bit~0 := ~bitwiseAnd(~x~0 % 256, ~i~0 % 256); VAL [~c~0=3, ~x~0=37, ~y~0=0] [L24] COND TRUE 0 != ~bit~0 % 256 [L25] ~y~0 := ~y~0 % 256 + ~i~0 % 256; VAL [~bit~0=1, ~c~0=3, ~i~0=0, ~x~0=37, ~y~0=0] [L27] ~c~0 := 1 + ~c~0 % 256; VAL [~bit~0=1, ~c~0=4, ~i~0=0, ~x~0=37, ~y~0=0] [L21-L28] COND FALSE !(!(~c~0 % 256 < 8)) [L22] ~i~0 := ~shiftLeft(1, ~c~0 % 256); [L23] ~bit~0 := ~bitwiseAnd(~x~0 % 256, ~i~0 % 256); VAL [~c~0=4, ~x~0=37, ~y~0=0] [L24] COND TRUE 0 != ~bit~0 % 256 [L25] ~y~0 := ~y~0 % 256 + ~i~0 % 256; VAL [~bit~0=1, ~c~0=4, ~i~0=0, ~x~0=37, ~y~0=0] [L27] ~c~0 := 1 + ~c~0 % 256; VAL [~bit~0=1, ~c~0=5, ~i~0=0, ~x~0=37, ~y~0=0] [L21-L28] COND FALSE !(!(~c~0 % 256 < 8)) [L22] ~i~0 := ~shiftLeft(1, ~c~0 % 256); [L23] ~bit~0 := ~bitwiseAnd(~x~0 % 256, ~i~0 % 256); VAL [~c~0=5, ~x~0=37, ~y~0=0] [L24] COND TRUE 0 != ~bit~0 % 256 [L25] ~y~0 := ~y~0 % 256 + ~i~0 % 256; VAL [~bit~0=1, ~c~0=5, ~i~0=0, ~x~0=37, ~y~0=0] [L27] ~c~0 := 1 + ~c~0 % 256; VAL [~bit~0=1, ~c~0=6, ~i~0=0, ~x~0=37, ~y~0=0] [L21-L28] COND FALSE !(!(~c~0 % 256 < 8)) [L22] ~i~0 := ~shiftLeft(1, ~c~0 % 256); [L23] ~bit~0 := ~bitwiseAnd(~x~0 % 256, ~i~0 % 256); VAL [~c~0=6, ~x~0=37, ~y~0=0] [L24] COND TRUE 0 != ~bit~0 % 256 [L25] ~y~0 := ~y~0 % 256 + ~i~0 % 256; VAL [~bit~0=1, ~c~0=6, ~i~0=0, ~x~0=37, ~y~0=0] [L27] ~c~0 := 1 + ~c~0 % 256; VAL [~bit~0=1, ~c~0=7, ~i~0=0, ~x~0=37, ~y~0=0] [L21-L28] COND FALSE !(!(~c~0 % 256 < 8)) [L22] ~i~0 := ~shiftLeft(1, ~c~0 % 256); [L23] ~bit~0 := ~bitwiseAnd(~x~0 % 256, ~i~0 % 256); VAL [~c~0=7, ~x~0=37, ~y~0=0] [L24] COND TRUE 0 != ~bit~0 % 256 [L25] ~y~0 := ~y~0 % 256 + ~i~0 % 256; VAL [~bit~0=1, ~c~0=7, ~i~0=0, ~x~0=37, ~y~0=0] [L27] ~c~0 := 1 + ~c~0 % 256; VAL [~bit~0=1, ~c~0=8, ~i~0=0, ~x~0=37, ~y~0=0] [L21-L28] COND TRUE !(~c~0 % 256 < 8) VAL [~bit~0=1, ~c~0=8, ~i~0=0, ~x~0=37, ~y~0=0] [L29] CALL call __VERIFIER_assert((if ~x~0 % 256 == ~y~0 % 256 then 1 else 0)); VAL [#in~cond=0] [L4-L9] ~cond := #in~cond; VAL [#in~cond=0, ~cond=0] [L5] COND TRUE 0 == ~cond VAL [#in~cond=0, ~cond=0] [L6] assert false; VAL [#in~cond=0, ~cond=0] ----- ----- class de.uni_freiburg.informatik.ultimate.boogie.procedureinliner.backtranslation.InlinerBacktranslator [?] CALL call ULTIMATE.init(); [?] RET call ULTIMATE.init(); [?] CALL call #t~ret0 := main(); [L14] havoc ~x~0; [L15] havoc ~y~0; [L16] havoc ~c~0; [L18] ~x~0 := 37; [L19] ~y~0 := 0; [L20] ~c~0 := 0; VAL [~c~0=0, ~x~0=37, ~y~0=0] [L21-L28] COND FALSE !(!(~c~0 % 256 < 8)) [L22] ~i~0 := ~shiftLeft(1, ~c~0 % 256); [L23] ~bit~0 := ~bitwiseAnd(~x~0 % 256, ~i~0 % 256); VAL [~c~0=0, ~x~0=37, ~y~0=0] [L24] COND TRUE 0 != ~bit~0 % 256 [L25] ~y~0 := ~y~0 % 256 + ~i~0 % 256; VAL [~bit~0=1, ~c~0=0, ~i~0=0, ~x~0=37, ~y~0=0] [L27] ~c~0 := 1 + ~c~0 % 256; VAL [~bit~0=1, ~c~0=1, ~i~0=0, ~x~0=37, ~y~0=0] [L21-L28] COND FALSE !(!(~c~0 % 256 < 8)) [L22] ~i~0 := ~shiftLeft(1, ~c~0 % 256); [L23] ~bit~0 := ~bitwiseAnd(~x~0 % 256, ~i~0 % 256); VAL [~c~0=1, ~x~0=37, ~y~0=0] [L24] COND TRUE 0 != ~bit~0 % 256 [L25] ~y~0 := ~y~0 % 256 + ~i~0 % 256; VAL [~bit~0=1, ~c~0=1, ~i~0=0, ~x~0=37, ~y~0=0] [L27] ~c~0 := 1 + ~c~0 % 256; VAL [~bit~0=1, ~c~0=2, ~i~0=0, ~x~0=37, ~y~0=0] [L21-L28] COND FALSE !(!(~c~0 % 256 < 8)) [L22] ~i~0 := ~shiftLeft(1, ~c~0 % 256); [L23] ~bit~0 := ~bitwiseAnd(~x~0 % 256, ~i~0 % 256); VAL [~c~0=2, ~x~0=37, ~y~0=0] [L24] COND TRUE 0 != ~bit~0 % 256 [L25] ~y~0 := ~y~0 % 256 + ~i~0 % 256; VAL [~bit~0=1, ~c~0=2, ~i~0=0, ~x~0=37, ~y~0=0] [L27] ~c~0 := 1 + ~c~0 % 256; VAL [~bit~0=1, ~c~0=3, ~i~0=0, ~x~0=37, ~y~0=0] [L21-L28] COND FALSE !(!(~c~0 % 256 < 8)) [L22] ~i~0 := ~shiftLeft(1, ~c~0 % 256); [L23] ~bit~0 := ~bitwiseAnd(~x~0 % 256, ~i~0 % 256); VAL [~c~0=3, ~x~0=37, ~y~0=0] [L24] COND TRUE 0 != ~bit~0 % 256 [L25] ~y~0 := ~y~0 % 256 + ~i~0 % 256; VAL [~bit~0=1, ~c~0=3, ~i~0=0, ~x~0=37, ~y~0=0] [L27] ~c~0 := 1 + ~c~0 % 256; VAL [~bit~0=1, ~c~0=4, ~i~0=0, ~x~0=37, ~y~0=0] [L21-L28] COND FALSE !(!(~c~0 % 256 < 8)) [L22] ~i~0 := ~shiftLeft(1, ~c~0 % 256); [L23] ~bit~0 := ~bitwiseAnd(~x~0 % 256, ~i~0 % 256); VAL [~c~0=4, ~x~0=37, ~y~0=0] [L24] COND TRUE 0 != ~bit~0 % 256 [L25] ~y~0 := ~y~0 % 256 + ~i~0 % 256; VAL [~bit~0=1, ~c~0=4, ~i~0=0, ~x~0=37, ~y~0=0] [L27] ~c~0 := 1 + ~c~0 % 256; VAL [~bit~0=1, ~c~0=5, ~i~0=0, ~x~0=37, ~y~0=0] [L21-L28] COND FALSE !(!(~c~0 % 256 < 8)) [L22] ~i~0 := ~shiftLeft(1, ~c~0 % 256); [L23] ~bit~0 := ~bitwiseAnd(~x~0 % 256, ~i~0 % 256); VAL [~c~0=5, ~x~0=37, ~y~0=0] [L24] COND TRUE 0 != ~bit~0 % 256 [L25] ~y~0 := ~y~0 % 256 + ~i~0 % 256; VAL [~bit~0=1, ~c~0=5, ~i~0=0, ~x~0=37, ~y~0=0] [L27] ~c~0 := 1 + ~c~0 % 256; VAL [~bit~0=1, ~c~0=6, ~i~0=0, ~x~0=37, ~y~0=0] [L21-L28] COND FALSE !(!(~c~0 % 256 < 8)) [L22] ~i~0 := ~shiftLeft(1, ~c~0 % 256); [L23] ~bit~0 := ~bitwiseAnd(~x~0 % 256, ~i~0 % 256); VAL [~c~0=6, ~x~0=37, ~y~0=0] [L24] COND TRUE 0 != ~bit~0 % 256 [L25] ~y~0 := ~y~0 % 256 + ~i~0 % 256; VAL [~bit~0=1, ~c~0=6, ~i~0=0, ~x~0=37, ~y~0=0] [L27] ~c~0 := 1 + ~c~0 % 256; VAL [~bit~0=1, ~c~0=7, ~i~0=0, ~x~0=37, ~y~0=0] [L21-L28] COND FALSE !(!(~c~0 % 256 < 8)) [L22] ~i~0 := ~shiftLeft(1, ~c~0 % 256); [L23] ~bit~0 := ~bitwiseAnd(~x~0 % 256, ~i~0 % 256); VAL [~c~0=7, ~x~0=37, ~y~0=0] [L24] COND TRUE 0 != ~bit~0 % 256 [L25] ~y~0 := ~y~0 % 256 + ~i~0 % 256; VAL [~bit~0=1, ~c~0=7, ~i~0=0, ~x~0=37, ~y~0=0] [L27] ~c~0 := 1 + ~c~0 % 256; VAL [~bit~0=1, ~c~0=8, ~i~0=0, ~x~0=37, ~y~0=0] [L21-L28] COND TRUE !(~c~0 % 256 < 8) VAL [~bit~0=1, ~c~0=8, ~i~0=0, ~x~0=37, ~y~0=0] [L29] CALL call __VERIFIER_assert((if ~x~0 % 256 == ~y~0 % 256 then 1 else 0)); VAL [#in~cond=0] [L4-L9] ~cond := #in~cond; VAL [#in~cond=0, ~cond=0] [L5] COND TRUE 0 == ~cond VAL [#in~cond=0, ~cond=0] [L6] assert false; VAL [#in~cond=0, ~cond=0] [?] CALL call ULTIMATE.init(); [?] RET call ULTIMATE.init(); [?] CALL call #t~ret0 := main(); [L14] havoc ~x~0; [L15] havoc ~y~0; [L16] havoc ~c~0; [L18] ~x~0 := 37; [L19] ~y~0 := 0; [L20] ~c~0 := 0; VAL [~c~0=0, ~x~0=37, ~y~0=0] [L21-L28] COND FALSE !(!(~c~0 % 256 < 8)) [L22] ~i~0 := ~shiftLeft(1, ~c~0 % 256); [L23] ~bit~0 := ~bitwiseAnd(~x~0 % 256, ~i~0 % 256); VAL [~c~0=0, ~x~0=37, ~y~0=0] [L24] COND TRUE 0 != ~bit~0 % 256 [L25] ~y~0 := ~y~0 % 256 + ~i~0 % 256; VAL [~bit~0=1, ~c~0=0, ~i~0=0, ~x~0=37, ~y~0=0] [L27] ~c~0 := 1 + ~c~0 % 256; VAL [~bit~0=1, ~c~0=1, ~i~0=0, ~x~0=37, ~y~0=0] [L21-L28] COND FALSE !(!(~c~0 % 256 < 8)) [L22] ~i~0 := ~shiftLeft(1, ~c~0 % 256); [L23] ~bit~0 := ~bitwiseAnd(~x~0 % 256, ~i~0 % 256); VAL [~c~0=1, ~x~0=37, ~y~0=0] [L24] COND TRUE 0 != ~bit~0 % 256 [L25] ~y~0 := ~y~0 % 256 + ~i~0 % 256; VAL [~bit~0=1, ~c~0=1, ~i~0=0, ~x~0=37, ~y~0=0] [L27] ~c~0 := 1 + ~c~0 % 256; VAL [~bit~0=1, ~c~0=2, ~i~0=0, ~x~0=37, ~y~0=0] [L21-L28] COND FALSE !(!(~c~0 % 256 < 8)) [L22] ~i~0 := ~shiftLeft(1, ~c~0 % 256); [L23] ~bit~0 := ~bitwiseAnd(~x~0 % 256, ~i~0 % 256); VAL [~c~0=2, ~x~0=37, ~y~0=0] [L24] COND TRUE 0 != ~bit~0 % 256 [L25] ~y~0 := ~y~0 % 256 + ~i~0 % 256; VAL [~bit~0=1, ~c~0=2, ~i~0=0, ~x~0=37, ~y~0=0] [L27] ~c~0 := 1 + ~c~0 % 256; VAL [~bit~0=1, ~c~0=3, ~i~0=0, ~x~0=37, ~y~0=0] [L21-L28] COND FALSE !(!(~c~0 % 256 < 8)) [L22] ~i~0 := ~shiftLeft(1, ~c~0 % 256); [L23] ~bit~0 := ~bitwiseAnd(~x~0 % 256, ~i~0 % 256); VAL [~c~0=3, ~x~0=37, ~y~0=0] [L24] COND TRUE 0 != ~bit~0 % 256 [L25] ~y~0 := ~y~0 % 256 + ~i~0 % 256; VAL [~bit~0=1, ~c~0=3, ~i~0=0, ~x~0=37, ~y~0=0] [L27] ~c~0 := 1 + ~c~0 % 256; VAL [~bit~0=1, ~c~0=4, ~i~0=0, ~x~0=37, ~y~0=0] [L21-L28] COND FALSE !(!(~c~0 % 256 < 8)) [L22] ~i~0 := ~shiftLeft(1, ~c~0 % 256); [L23] ~bit~0 := ~bitwiseAnd(~x~0 % 256, ~i~0 % 256); VAL [~c~0=4, ~x~0=37, ~y~0=0] [L24] COND TRUE 0 != ~bit~0 % 256 [L25] ~y~0 := ~y~0 % 256 + ~i~0 % 256; VAL [~bit~0=1, ~c~0=4, ~i~0=0, ~x~0=37, ~y~0=0] [L27] ~c~0 := 1 + ~c~0 % 256; VAL [~bit~0=1, ~c~0=5, ~i~0=0, ~x~0=37, ~y~0=0] [L21-L28] COND FALSE !(!(~c~0 % 256 < 8)) [L22] ~i~0 := ~shiftLeft(1, ~c~0 % 256); [L23] ~bit~0 := ~bitwiseAnd(~x~0 % 256, ~i~0 % 256); VAL [~c~0=5, ~x~0=37, ~y~0=0] [L24] COND TRUE 0 != ~bit~0 % 256 [L25] ~y~0 := ~y~0 % 256 + ~i~0 % 256; VAL [~bit~0=1, ~c~0=5, ~i~0=0, ~x~0=37, ~y~0=0] [L27] ~c~0 := 1 + ~c~0 % 256; VAL [~bit~0=1, ~c~0=6, ~i~0=0, ~x~0=37, ~y~0=0] [L21-L28] COND FALSE !(!(~c~0 % 256 < 8)) [L22] ~i~0 := ~shiftLeft(1, ~c~0 % 256); [L23] ~bit~0 := ~bitwiseAnd(~x~0 % 256, ~i~0 % 256); VAL [~c~0=6, ~x~0=37, ~y~0=0] [L24] COND TRUE 0 != ~bit~0 % 256 [L25] ~y~0 := ~y~0 % 256 + ~i~0 % 256; VAL [~bit~0=1, ~c~0=6, ~i~0=0, ~x~0=37, ~y~0=0] [L27] ~c~0 := 1 + ~c~0 % 256; VAL [~bit~0=1, ~c~0=7, ~i~0=0, ~x~0=37, ~y~0=0] [L21-L28] COND FALSE !(!(~c~0 % 256 < 8)) [L22] ~i~0 := ~shiftLeft(1, ~c~0 % 256); [L23] ~bit~0 := ~bitwiseAnd(~x~0 % 256, ~i~0 % 256); VAL [~c~0=7, ~x~0=37, ~y~0=0] [L24] COND TRUE 0 != ~bit~0 % 256 [L25] ~y~0 := ~y~0 % 256 + ~i~0 % 256; VAL [~bit~0=1, ~c~0=7, ~i~0=0, ~x~0=37, ~y~0=0] [L27] ~c~0 := 1 + ~c~0 % 256; VAL [~bit~0=1, ~c~0=8, ~i~0=0, ~x~0=37, ~y~0=0] [L21-L28] COND TRUE !(~c~0 % 256 < 8) VAL [~bit~0=1, ~c~0=8, ~i~0=0, ~x~0=37, ~y~0=0] [L29] CALL call __VERIFIER_assert((if ~x~0 % 256 == ~y~0 % 256 then 1 else 0)); VAL [#in~cond=0] [L4-L9] ~cond := #in~cond; VAL [#in~cond=0, ~cond=0] [L5] COND TRUE 0 == ~cond VAL [#in~cond=0, ~cond=0] [L6] assert false; VAL [#in~cond=0, ~cond=0] ----- ----- class de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieBacktranslator [?] CALL call ULTIMATE.init(); [?] RET call ULTIMATE.init(); [?] CALL call #t~ret0 := main(); [L14] havoc ~x~0; [L15] havoc ~y~0; [L16] havoc ~c~0; [L18] ~x~0 := 37; [L19] ~y~0 := 0; [L20] ~c~0 := 0; VAL [~c~0=0, ~x~0=37, ~y~0=0] [L21-L28] COND FALSE !(!(~c~0 % 256 < 8)) [L22] ~i~0 := ~shiftLeft(1, ~c~0 % 256); [L23] ~bit~0 := ~bitwiseAnd(~x~0 % 256, ~i~0 % 256); VAL [~c~0=0, ~x~0=37, ~y~0=0] [L24] COND TRUE 0 != ~bit~0 % 256 [L25] ~y~0 := ~y~0 % 256 + ~i~0 % 256; VAL [~bit~0=1, ~c~0=0, ~i~0=0, ~x~0=37, ~y~0=0] [L27] ~c~0 := 1 + ~c~0 % 256; VAL [~bit~0=1, ~c~0=1, ~i~0=0, ~x~0=37, ~y~0=0] [L21-L28] COND FALSE !(!(~c~0 % 256 < 8)) [L22] ~i~0 := ~shiftLeft(1, ~c~0 % 256); [L23] ~bit~0 := ~bitwiseAnd(~x~0 % 256, ~i~0 % 256); VAL [~c~0=1, ~x~0=37, ~y~0=0] [L24] COND TRUE 0 != ~bit~0 % 256 [L25] ~y~0 := ~y~0 % 256 + ~i~0 % 256; VAL [~bit~0=1, ~c~0=1, ~i~0=0, ~x~0=37, ~y~0=0] [L27] ~c~0 := 1 + ~c~0 % 256; VAL [~bit~0=1, ~c~0=2, ~i~0=0, ~x~0=37, ~y~0=0] [L21-L28] COND FALSE !(!(~c~0 % 256 < 8)) [L22] ~i~0 := ~shiftLeft(1, ~c~0 % 256); [L23] ~bit~0 := ~bitwiseAnd(~x~0 % 256, ~i~0 % 256); VAL [~c~0=2, ~x~0=37, ~y~0=0] [L24] COND TRUE 0 != ~bit~0 % 256 [L25] ~y~0 := ~y~0 % 256 + ~i~0 % 256; VAL [~bit~0=1, ~c~0=2, ~i~0=0, ~x~0=37, ~y~0=0] [L27] ~c~0 := 1 + ~c~0 % 256; VAL [~bit~0=1, ~c~0=3, ~i~0=0, ~x~0=37, ~y~0=0] [L21-L28] COND FALSE !(!(~c~0 % 256 < 8)) [L22] ~i~0 := ~shiftLeft(1, ~c~0 % 256); [L23] ~bit~0 := ~bitwiseAnd(~x~0 % 256, ~i~0 % 256); VAL [~c~0=3, ~x~0=37, ~y~0=0] [L24] COND TRUE 0 != ~bit~0 % 256 [L25] ~y~0 := ~y~0 % 256 + ~i~0 % 256; VAL [~bit~0=1, ~c~0=3, ~i~0=0, ~x~0=37, ~y~0=0] [L27] ~c~0 := 1 + ~c~0 % 256; VAL [~bit~0=1, ~c~0=4, ~i~0=0, ~x~0=37, ~y~0=0] [L21-L28] COND FALSE !(!(~c~0 % 256 < 8)) [L22] ~i~0 := ~shiftLeft(1, ~c~0 % 256); [L23] ~bit~0 := ~bitwiseAnd(~x~0 % 256, ~i~0 % 256); VAL [~c~0=4, ~x~0=37, ~y~0=0] [L24] COND TRUE 0 != ~bit~0 % 256 [L25] ~y~0 := ~y~0 % 256 + ~i~0 % 256; VAL [~bit~0=1, ~c~0=4, ~i~0=0, ~x~0=37, ~y~0=0] [L27] ~c~0 := 1 + ~c~0 % 256; VAL [~bit~0=1, ~c~0=5, ~i~0=0, ~x~0=37, ~y~0=0] [L21-L28] COND FALSE !(!(~c~0 % 256 < 8)) [L22] ~i~0 := ~shiftLeft(1, ~c~0 % 256); [L23] ~bit~0 := ~bitwiseAnd(~x~0 % 256, ~i~0 % 256); VAL [~c~0=5, ~x~0=37, ~y~0=0] [L24] COND TRUE 0 != ~bit~0 % 256 [L25] ~y~0 := ~y~0 % 256 + ~i~0 % 256; VAL [~bit~0=1, ~c~0=5, ~i~0=0, ~x~0=37, ~y~0=0] [L27] ~c~0 := 1 + ~c~0 % 256; VAL [~bit~0=1, ~c~0=6, ~i~0=0, ~x~0=37, ~y~0=0] [L21-L28] COND FALSE !(!(~c~0 % 256 < 8)) [L22] ~i~0 := ~shiftLeft(1, ~c~0 % 256); [L23] ~bit~0 := ~bitwiseAnd(~x~0 % 256, ~i~0 % 256); VAL [~c~0=6, ~x~0=37, ~y~0=0] [L24] COND TRUE 0 != ~bit~0 % 256 [L25] ~y~0 := ~y~0 % 256 + ~i~0 % 256; VAL [~bit~0=1, ~c~0=6, ~i~0=0, ~x~0=37, ~y~0=0] [L27] ~c~0 := 1 + ~c~0 % 256; VAL [~bit~0=1, ~c~0=7, ~i~0=0, ~x~0=37, ~y~0=0] [L21-L28] COND FALSE !(!(~c~0 % 256 < 8)) [L22] ~i~0 := ~shiftLeft(1, ~c~0 % 256); [L23] ~bit~0 := ~bitwiseAnd(~x~0 % 256, ~i~0 % 256); VAL [~c~0=7, ~x~0=37, ~y~0=0] [L24] COND TRUE 0 != ~bit~0 % 256 [L25] ~y~0 := ~y~0 % 256 + ~i~0 % 256; VAL [~bit~0=1, ~c~0=7, ~i~0=0, ~x~0=37, ~y~0=0] [L27] ~c~0 := 1 + ~c~0 % 256; VAL [~bit~0=1, ~c~0=8, ~i~0=0, ~x~0=37, ~y~0=0] [L21-L28] COND TRUE !(~c~0 % 256 < 8) VAL [~bit~0=1, ~c~0=8, ~i~0=0, ~x~0=37, ~y~0=0] [L29] CALL call __VERIFIER_assert((if ~x~0 % 256 == ~y~0 % 256 then 1 else 0)); VAL [#in~cond=0] [L4-L9] ~cond := #in~cond; VAL [#in~cond=0, ~cond=0] [L5] COND TRUE 0 == ~cond VAL [#in~cond=0, ~cond=0] [L6] assert false; VAL [#in~cond=0, ~cond=0] [L14] unsigned char x; [L15] unsigned char y; [L16] unsigned char c; [L18] x = 37 [L19] y = 0 [L20] c = 0 VAL [c=0, x=37, y=0] [L21] COND TRUE c < (unsigned char)8 [L22] unsigned char i = ((unsigned char)1) << c; [L23] unsigned char bit = x & i; VAL [c=0, x=37, y=0] [L24] COND TRUE bit != (unsigned char)0 [L25] y = y + i VAL [bit=1, c=0, i=0, x=37, y=0] [L27] c = c + ((unsigned char)1) VAL [bit=1, c=1, i=0, x=37, y=0] [L21] COND TRUE c < (unsigned char)8 [L22] unsigned char i = ((unsigned char)1) << c; [L23] unsigned char bit = x & i; VAL [c=1, x=37, y=0] [L24] COND TRUE bit != (unsigned char)0 [L25] y = y + i VAL [bit=1, c=1, i=0, x=37, y=0] [L27] c = c + ((unsigned char)1) VAL [bit=1, c=2, i=0, x=37, y=0] [L21] COND TRUE c < (unsigned char)8 [L22] unsigned char i = ((unsigned char)1) << c; [L23] unsigned char bit = x & i; VAL [c=2, x=37, y=0] [L24] COND TRUE bit != (unsigned char)0 [L25] y = y + i VAL [bit=1, c=2, i=0, x=37, y=0] [L27] c = c + ((unsigned char)1) VAL [bit=1, c=3, i=0, x=37, y=0] [L21] COND TRUE c < (unsigned char)8 [L22] unsigned char i = ((unsigned char)1) << c; [L23] unsigned char bit = x & i; VAL [c=3, x=37, y=0] [L24] COND TRUE bit != (unsigned char)0 [L25] y = y + i VAL [bit=1, c=3, i=0, x=37, y=0] [L27] c = c + ((unsigned char)1) VAL [bit=1, c=4, i=0, x=37, y=0] [L21] COND TRUE c < (unsigned char)8 [L22] unsigned char i = ((unsigned char)1) << c; [L23] unsigned char bit = x & i; VAL [c=4, x=37, y=0] [L24] COND TRUE bit != (unsigned char)0 [L25] y = y + i VAL [bit=1, c=4, i=0, x=37, y=0] [L27] c = c + ((unsigned char)1) VAL [bit=1, c=5, i=0, x=37, y=0] [L21] COND TRUE c < (unsigned char)8 [L22] unsigned char i = ((unsigned char)1) << c; [L23] unsigned char bit = x & i; VAL [c=5, x=37, y=0] [L24] COND TRUE bit != (unsigned char)0 [L25] y = y + i VAL [bit=1, c=5, i=0, x=37, y=0] [L27] c = c + ((unsigned char)1) VAL [bit=1, c=6, i=0, x=37, y=0] [L21] COND TRUE c < (unsigned char)8 [L22] unsigned char i = ((unsigned char)1) << c; [L23] unsigned char bit = x & i; VAL [c=6, x=37, y=0] [L24] COND TRUE bit != (unsigned char)0 [L25] y = y + i VAL [bit=1, c=6, i=0, x=37, y=0] [L27] c = c + ((unsigned char)1) VAL [bit=1, c=7, i=0, x=37, y=0] [L21] COND TRUE c < (unsigned char)8 [L22] unsigned char i = ((unsigned char)1) << c; [L23] unsigned char bit = x & i; VAL [c=7, x=37, y=0] [L24] COND TRUE bit != (unsigned char)0 [L25] y = y + i VAL [bit=1, c=7, i=0, x=37, y=0] [L27] c = c + ((unsigned char)1) VAL [bit=1, c=8, i=0, x=37, y=0] [L21] COND FALSE !(c < (unsigned char)8) VAL [bit=1, c=8, i=0, x=37, y=0] [L29] CALL __VERIFIER_assert(x == y) VAL [\old(cond)=0] [L5] COND TRUE !(cond) VAL [\old(cond)=0, cond=0] [L6] __VERIFIER_error() VAL [\old(cond)=0, cond=0] ----- [2018-11-23 05:42:53,136 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 23.11 05:42:53 BoogieIcfgContainer [2018-11-23 05:42:53,136 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-11-23 05:42:53,137 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-11-23 05:42:53,137 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-11-23 05:42:53,137 INFO L276 PluginConnector]: Witness Printer initialized [2018-11-23 05:42:53,137 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 05:42:50" (3/4) ... [2018-11-23 05:42:53,140 INFO L147 WitnessPrinter]: No result that supports witness generation found [2018-11-23 05:42:53,140 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-11-23 05:42:53,141 INFO L168 Benchmark]: Toolchain (without parser) took 3279.92 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 220.2 MB). Free memory was 958.0 MB in the beginning and 1.2 GB in the end (delta: -213.6 MB). Peak memory consumption was 6.6 MB. Max. memory is 11.5 GB. [2018-11-23 05:42:53,143 INFO L168 Benchmark]: CDTParser took 0.18 ms. Allocated memory is still 1.0 GB. Free memory is still 985.4 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-23 05:42:53,143 INFO L168 Benchmark]: CACSL2BoogieTranslator took 198.52 ms. Allocated memory is still 1.0 GB. Free memory was 958.0 MB in the beginning and 947.3 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. [2018-11-23 05:42:53,143 INFO L168 Benchmark]: Boogie Procedure Inliner took 16.88 ms. Allocated memory is still 1.0 GB. Free memory was 947.3 MB in the beginning and 944.6 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB. [2018-11-23 05:42:53,144 INFO L168 Benchmark]: Boogie Preprocessor took 15.36 ms. Allocated memory is still 1.0 GB. Free memory is still 944.6 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-23 05:42:53,144 INFO L168 Benchmark]: RCFGBuilder took 204.06 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 159.9 MB). Free memory was 944.6 MB in the beginning and 1.1 GB in the end (delta: -196.7 MB). Peak memory consumption was 14.1 MB. Max. memory is 11.5 GB. [2018-11-23 05:42:53,145 INFO L168 Benchmark]: TraceAbstraction took 2837.98 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 60.3 MB). Free memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: -30.3 MB). Peak memory consumption was 30.0 MB. Max. memory is 11.5 GB. [2018-11-23 05:42:53,146 INFO L168 Benchmark]: Witness Printer took 3.93 ms. Allocated memory is still 1.2 GB. Free memory is still 1.2 GB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-23 05:42:53,148 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.18 ms. Allocated memory is still 1.0 GB. Free memory is still 985.4 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 198.52 ms. Allocated memory is still 1.0 GB. Free memory was 958.0 MB in the beginning and 947.3 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 16.88 ms. Allocated memory is still 1.0 GB. Free memory was 947.3 MB in the beginning and 944.6 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 15.36 ms. Allocated memory is still 1.0 GB. Free memory is still 944.6 MB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 204.06 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 159.9 MB). Free memory was 944.6 MB in the beginning and 1.1 GB in the end (delta: -196.7 MB). Peak memory consumption was 14.1 MB. Max. memory is 11.5 GB. * TraceAbstraction took 2837.98 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 60.3 MB). Free memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: -30.3 MB). Peak memory consumption was 30.0 MB. Max. memory is 11.5 GB. * Witness Printer took 3.93 ms. Allocated memory is still 1.2 GB. Free memory is still 1.2 GB. 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 shiftLeft at line 22, overapproximation of bitwiseAnd at line 23. Possible FailurePath: [L14] unsigned char x; [L15] unsigned char y; [L16] unsigned char c; [L18] x = 37 [L19] y = 0 [L20] c = 0 VAL [c=0, x=37, y=0] [L21] COND TRUE c < (unsigned char)8 [L22] unsigned char i = ((unsigned char)1) << c; [L23] unsigned char bit = x & i; VAL [c=0, x=37, y=0] [L24] COND TRUE bit != (unsigned char)0 [L25] y = y + i VAL [bit=1, c=0, i=0, x=37, y=0] [L27] c = c + ((unsigned char)1) VAL [bit=1, c=1, i=0, x=37, y=0] [L21] COND TRUE c < (unsigned char)8 [L22] unsigned char i = ((unsigned char)1) << c; [L23] unsigned char bit = x & i; VAL [c=1, x=37, y=0] [L24] COND TRUE bit != (unsigned char)0 [L25] y = y + i VAL [bit=1, c=1, i=0, x=37, y=0] [L27] c = c + ((unsigned char)1) VAL [bit=1, c=2, i=0, x=37, y=0] [L21] COND TRUE c < (unsigned char)8 [L22] unsigned char i = ((unsigned char)1) << c; [L23] unsigned char bit = x & i; VAL [c=2, x=37, y=0] [L24] COND TRUE bit != (unsigned char)0 [L25] y = y + i VAL [bit=1, c=2, i=0, x=37, y=0] [L27] c = c + ((unsigned char)1) VAL [bit=1, c=3, i=0, x=37, y=0] [L21] COND TRUE c < (unsigned char)8 [L22] unsigned char i = ((unsigned char)1) << c; [L23] unsigned char bit = x & i; VAL [c=3, x=37, y=0] [L24] COND TRUE bit != (unsigned char)0 [L25] y = y + i VAL [bit=1, c=3, i=0, x=37, y=0] [L27] c = c + ((unsigned char)1) VAL [bit=1, c=4, i=0, x=37, y=0] [L21] COND TRUE c < (unsigned char)8 [L22] unsigned char i = ((unsigned char)1) << c; [L23] unsigned char bit = x & i; VAL [c=4, x=37, y=0] [L24] COND TRUE bit != (unsigned char)0 [L25] y = y + i VAL [bit=1, c=4, i=0, x=37, y=0] [L27] c = c + ((unsigned char)1) VAL [bit=1, c=5, i=0, x=37, y=0] [L21] COND TRUE c < (unsigned char)8 [L22] unsigned char i = ((unsigned char)1) << c; [L23] unsigned char bit = x & i; VAL [c=5, x=37, y=0] [L24] COND TRUE bit != (unsigned char)0 [L25] y = y + i VAL [bit=1, c=5, i=0, x=37, y=0] [L27] c = c + ((unsigned char)1) VAL [bit=1, c=6, i=0, x=37, y=0] [L21] COND TRUE c < (unsigned char)8 [L22] unsigned char i = ((unsigned char)1) << c; [L23] unsigned char bit = x & i; VAL [c=6, x=37, y=0] [L24] COND TRUE bit != (unsigned char)0 [L25] y = y + i VAL [bit=1, c=6, i=0, x=37, y=0] [L27] c = c + ((unsigned char)1) VAL [bit=1, c=7, i=0, x=37, y=0] [L21] COND TRUE c < (unsigned char)8 [L22] unsigned char i = ((unsigned char)1) << c; [L23] unsigned char bit = x & i; VAL [c=7, x=37, y=0] [L24] COND TRUE bit != (unsigned char)0 [L25] y = y + i VAL [bit=1, c=7, i=0, x=37, y=0] [L27] c = c + ((unsigned char)1) VAL [bit=1, c=8, i=0, x=37, y=0] [L21] COND FALSE !(c < (unsigned char)8) VAL [bit=1, c=8, i=0, x=37, y=0] [L29] CALL __VERIFIER_assert(x == y) VAL [\old(cond)=0] [L5] COND TRUE !(cond) VAL [\old(cond)=0, cond=0] [L6] __VERIFIER_error() VAL [\old(cond)=0, cond=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 20 locations, 1 error locations. UNSAFE Result, 2.7s OverallTime, 10 OverallIterations, 8 TraceHistogramMax, 0.6s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 173 SDtfs, 130 SDslu, 914 SDs, 0 SdLazy, 667 SolverSat, 29 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.4s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 201 GetRequests, 124 SyntacticMatches, 13 SemanticMatches, 64 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 134 ImplicationChecksByTransitivity, 1.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=35occurred in iteration=9, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 9 MinimizatonAttempts, 16 StatesRemovedByMinimization, 8 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 1.3s InterpolantComputationTime, 362 NumberOfCodeBlocks, 362 NumberOfCodeBlocksAsserted, 33 NumberOfCheckSat, 312 ConstructedInterpolants, 70 QuantifiedInterpolants, 68271 SizeOfPredicates, 11 NumberOfNonLiveVariables, 350 ConjunctsInSsa, 91 ConjunctsInUnsatCore, 16 InterpolantComputations, 2 PerfectInterpolantSequences, 0/392 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: 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.23-aa41828 [2018-11-23 05:42:54,712 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-23 05:42:54,713 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-23 05:42:54,722 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-23 05:42:54,722 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-23 05:42:54,723 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-23 05:42:54,724 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-23 05:42:54,725 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-23 05:42:54,727 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-23 05:42:54,728 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-23 05:42:54,728 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-23 05:42:54,729 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-23 05:42:54,729 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-23 05:42:54,730 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-23 05:42:54,731 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-23 05:42:54,732 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-23 05:42:54,733 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-23 05:42:54,734 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-23 05:42:54,736 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-23 05:42:54,737 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-23 05:42:54,738 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-23 05:42:54,739 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-23 05:42:54,741 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-23 05:42:54,741 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-23 05:42:54,741 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-23 05:42:54,742 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-23 05:42:54,743 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-23 05:42:54,743 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-23 05:42:54,744 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-23 05:42:54,745 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-23 05:42:54,745 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-23 05:42:54,746 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-23 05:42:54,746 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-23 05:42:54,746 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-23 05:42:54,747 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-23 05:42:54,748 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-23 05:42:54,748 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_4becc31a-4406-42a9-ae1e-b055b76278dc/bin-2019/uautomizer/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2018-11-23 05:42:54,760 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-23 05:42:54,760 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-23 05:42:54,761 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-23 05:42:54,761 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-11-23 05:42:54,762 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-23 05:42:54,762 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-23 05:42:54,762 INFO L133 SettingsManager]: * Use SBE=true [2018-11-23 05:42:54,762 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-23 05:42:54,762 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-23 05:42:54,763 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-23 05:42:54,763 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-23 05:42:54,763 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-23 05:42:54,763 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-23 05:42:54,763 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-23 05:42:54,763 INFO L133 SettingsManager]: * Use bitvectors instead of ints=true [2018-11-23 05:42:54,764 INFO L133 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2018-11-23 05:42:54,764 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-23 05:42:54,764 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-23 05:42:54,764 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-23 05:42:54,764 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-23 05:42:54,764 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-23 05:42:54,765 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-23 05:42:54,765 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-23 05:42:54,765 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-23 05:42:54,765 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-23 05:42:54,765 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-23 05:42:54,765 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-23 05:42:54,765 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-23 05:42:54,766 INFO L133 SettingsManager]: * Trace refinement strategy=WOLF [2018-11-23 05:42:54,766 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-23 05:42:54,766 INFO L133 SettingsManager]: * Command for external solver=cvc4nyu --tear-down-incremental --rewrite-divk --print-success --lang smt [2018-11-23 05:42:54,766 INFO L133 SettingsManager]: * Logic for external solver=AUFBV [2018-11-23 05:42:54,766 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /tmp/vcloud-vcloud-master/worker/working_dir_4becc31a-4406-42a9-ae1e-b055b76278dc/bin-2019/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 -> d2a071cc6090a217f48ed180b566a651717a8e39 [2018-11-23 05:42:54,799 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-23 05:42:54,808 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-23 05:42:54,810 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-23 05:42:54,811 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-23 05:42:54,811 INFO L276 PluginConnector]: CDTParser initialized [2018-11-23 05:42:54,812 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_4becc31a-4406-42a9-ae1e-b055b76278dc/bin-2019/uautomizer/../../sv-benchmarks/c/bitvector/num_conversion_1_true-unreach-call_true-no-overflow.i [2018-11-23 05:42:54,853 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_4becc31a-4406-42a9-ae1e-b055b76278dc/bin-2019/uautomizer/data/cf951573e/ed551a687f024b87b60bcb5e91bf3924/FLAG768e621c9 [2018-11-23 05:42:55,197 INFO L307 CDTParser]: Found 1 translation units. [2018-11-23 05:42:55,197 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_4becc31a-4406-42a9-ae1e-b055b76278dc/sv-benchmarks/c/bitvector/num_conversion_1_true-unreach-call_true-no-overflow.i [2018-11-23 05:42:55,201 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_4becc31a-4406-42a9-ae1e-b055b76278dc/bin-2019/uautomizer/data/cf951573e/ed551a687f024b87b60bcb5e91bf3924/FLAG768e621c9 [2018-11-23 05:42:55,623 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_4becc31a-4406-42a9-ae1e-b055b76278dc/bin-2019/uautomizer/data/cf951573e/ed551a687f024b87b60bcb5e91bf3924 [2018-11-23 05:42:55,626 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-23 05:42:55,627 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-23 05:42:55,628 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-23 05:42:55,628 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-23 05:42:55,632 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-23 05:42:55,632 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 05:42:55" (1/1) ... [2018-11-23 05:42:55,635 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@53e3bff2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 05:42:55, skipping insertion in model container [2018-11-23 05:42:55,635 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 05:42:55" (1/1) ... [2018-11-23 05:42:55,642 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-23 05:42:55,662 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-23 05:42:55,802 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 05:42:55,806 INFO L191 MainTranslator]: Completed pre-run [2018-11-23 05:42:55,819 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 05:42:55,830 INFO L195 MainTranslator]: Completed translation [2018-11-23 05:42:55,830 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 05:42:55 WrapperNode [2018-11-23 05:42:55,830 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-23 05:42:55,831 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-23 05:42:55,831 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-23 05:42:55,831 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-23 05:42:55,839 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 05:42:55" (1/1) ... [2018-11-23 05:42:55,844 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 05:42:55" (1/1) ... [2018-11-23 05:42:55,850 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-23 05:42:55,851 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-23 05:42:55,851 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-23 05:42:55,851 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-23 05:42:55,860 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 05:42:55" (1/1) ... [2018-11-23 05:42:55,860 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 05:42:55" (1/1) ... [2018-11-23 05:42:55,861 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 05:42:55" (1/1) ... [2018-11-23 05:42:55,861 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 05:42:55" (1/1) ... [2018-11-23 05:42:55,866 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 05:42:55" (1/1) ... [2018-11-23 05:42:55,869 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 05:42:55" (1/1) ... [2018-11-23 05:42:55,870 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 05:42:55" (1/1) ... [2018-11-23 05:42:55,871 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-23 05:42:55,871 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-23 05:42:55,871 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-23 05:42:55,872 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-23 05:42:55,872 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 05:42:55" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_4becc31a-4406-42a9-ae1e-b055b76278dc/bin-2019/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 [2018-11-23 05:42:55,958 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-23 05:42:55,958 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-23 05:42:55,958 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-23 05:42:55,958 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-23 05:42:55,958 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-23 05:42:55,958 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-23 05:42:55,959 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2018-11-23 05:42:55,959 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2018-11-23 05:42:56,084 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-23 05:42:56,085 INFO L280 CfgBuilder]: Removed 1 assue(true) statements. [2018-11-23 05:42:56,085 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 05:42:56 BoogieIcfgContainer [2018-11-23 05:42:56,085 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-23 05:42:56,086 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-23 05:42:56,086 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-23 05:42:56,089 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-23 05:42:56,089 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 23.11 05:42:55" (1/3) ... [2018-11-23 05:42:56,090 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@45bcec19 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 05:42:56, skipping insertion in model container [2018-11-23 05:42:56,090 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 05:42:55" (2/3) ... [2018-11-23 05:42:56,091 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@45bcec19 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 05:42:56, skipping insertion in model container [2018-11-23 05:42:56,091 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 05:42:56" (3/3) ... [2018-11-23 05:42:56,093 INFO L112 eAbstractionObserver]: Analyzing ICFG num_conversion_1_true-unreach-call_true-no-overflow.i [2018-11-23 05:42:56,103 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-23 05:42:56,109 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-11-23 05:42:56,123 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-11-23 05:42:56,144 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-11-23 05:42:56,145 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-23 05:42:56,145 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-23 05:42:56,145 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-23 05:42:56,145 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-23 05:42:56,145 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-23 05:42:56,146 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-23 05:42:56,146 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-23 05:42:56,146 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-23 05:42:56,162 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states. [2018-11-23 05:42:56,167 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2018-11-23 05:42:56,167 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 05:42:56,168 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 05:42:56,169 INFO L423 AbstractCegarLoop]: === Iteration 1 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 05:42:56,173 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 05:42:56,173 INFO L82 PathProgramCache]: Analyzing trace with hash -147882559, now seen corresponding path program 1 times [2018-11-23 05:42:56,176 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-23 05:42:56,177 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_4becc31a-4406-42a9-ae1e-b055b76278dc/bin-2019/uautomizer/cvc4nyu Starting monitored process 2 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-23 05:42:56,199 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 05:42:56,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 05:42:56,226 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 05:42:56,237 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 05:42:56,237 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-23 05:42:56,240 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 05:42:56,240 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-23 05:42:56,243 INFO L459 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-11-23 05:42:56,256 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-11-23 05:42:56,257 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-11-23 05:42:56,260 INFO L87 Difference]: Start difference. First operand 20 states. Second operand 2 states. [2018-11-23 05:42:56,280 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 05:42:56,280 INFO L93 Difference]: Finished difference Result 32 states and 36 transitions. [2018-11-23 05:42:56,280 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-11-23 05:42:56,281 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 10 [2018-11-23 05:42:56,281 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 05:42:56,288 INFO L225 Difference]: With dead ends: 32 [2018-11-23 05:42:56,288 INFO L226 Difference]: Without dead ends: 13 [2018-11-23 05:42:56,291 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-11-23 05:42:56,307 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13 states. [2018-11-23 05:42:56,317 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13 to 13. [2018-11-23 05:42:56,318 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2018-11-23 05:42:56,319 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 14 transitions. [2018-11-23 05:42:56,320 INFO L78 Accepts]: Start accepts. Automaton has 13 states and 14 transitions. Word has length 10 [2018-11-23 05:42:56,320 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 05:42:56,320 INFO L480 AbstractCegarLoop]: Abstraction has 13 states and 14 transitions. [2018-11-23 05:42:56,320 INFO L481 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-11-23 05:42:56,320 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 14 transitions. [2018-11-23 05:42:56,321 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2018-11-23 05:42:56,321 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 05:42:56,321 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 05:42:56,321 INFO L423 AbstractCegarLoop]: === Iteration 2 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 05:42:56,321 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 05:42:56,322 INFO L82 PathProgramCache]: Analyzing trace with hash -158041290, now seen corresponding path program 1 times [2018-11-23 05:42:56,322 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-23 05:42:56,322 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_4becc31a-4406-42a9-ae1e-b055b76278dc/bin-2019/uautomizer/cvc4nyu Starting monitored process 3 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-23 05:42:56,346 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 05:42:56,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 05:42:56,360 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 05:42:56,383 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 05:42:56,383 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-23 05:42:56,384 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 05:42:56,384 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-23 05:42:56,386 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-23 05:42:56,386 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-23 05:42:56,386 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 05:42:56,387 INFO L87 Difference]: Start difference. First operand 13 states and 14 transitions. Second operand 3 states. [2018-11-23 05:42:56,408 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 05:42:56,409 INFO L93 Difference]: Finished difference Result 21 states and 23 transitions. [2018-11-23 05:42:56,409 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-23 05:42:56,409 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 10 [2018-11-23 05:42:56,409 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 05:42:56,410 INFO L225 Difference]: With dead ends: 21 [2018-11-23 05:42:56,410 INFO L226 Difference]: Without dead ends: 16 [2018-11-23 05:42:56,411 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 05:42:56,411 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16 states. [2018-11-23 05:42:56,414 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16 to 14. [2018-11-23 05:42:56,414 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2018-11-23 05:42:56,414 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 15 transitions. [2018-11-23 05:42:56,415 INFO L78 Accepts]: Start accepts. Automaton has 14 states and 15 transitions. Word has length 10 [2018-11-23 05:42:56,415 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 05:42:56,415 INFO L480 AbstractCegarLoop]: Abstraction has 14 states and 15 transitions. [2018-11-23 05:42:56,415 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-23 05:42:56,415 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 15 transitions. [2018-11-23 05:42:56,416 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-11-23 05:42:56,416 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 05:42:56,416 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 05:42:56,416 INFO L423 AbstractCegarLoop]: === Iteration 3 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 05:42:56,417 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 05:42:56,417 INFO L82 PathProgramCache]: Analyzing trace with hash 743821333, now seen corresponding path program 1 times [2018-11-23 05:42:56,417 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-23 05:42:56,417 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_4becc31a-4406-42a9-ae1e-b055b76278dc/bin-2019/uautomizer/cvc4nyu Starting monitored process 4 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-23 05:42:56,438 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 05:42:56,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 05:42:56,456 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 05:42:56,471 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 05:42:56,472 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-23 05:42:56,500 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 05:42:56,501 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 05:42:56,501 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 6 [2018-11-23 05:42:56,502 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-23 05:42:56,502 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-23 05:42:56,502 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2018-11-23 05:42:56,502 INFO L87 Difference]: Start difference. First operand 14 states and 15 transitions. Second operand 6 states. [2018-11-23 05:42:56,570 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 05:42:56,570 INFO L93 Difference]: Finished difference Result 28 states and 34 transitions. [2018-11-23 05:42:56,571 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-23 05:42:56,571 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 13 [2018-11-23 05:42:56,571 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 05:42:56,572 INFO L225 Difference]: With dead ends: 28 [2018-11-23 05:42:56,572 INFO L226 Difference]: Without dead ends: 23 [2018-11-23 05:42:56,572 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=23, Unknown=0, NotChecked=0, Total=42 [2018-11-23 05:42:56,573 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2018-11-23 05:42:56,576 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 23. [2018-11-23 05:42:56,576 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2018-11-23 05:42:56,577 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 27 transitions. [2018-11-23 05:42:56,577 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 27 transitions. Word has length 13 [2018-11-23 05:42:56,577 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 05:42:56,577 INFO L480 AbstractCegarLoop]: Abstraction has 23 states and 27 transitions. [2018-11-23 05:42:56,577 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-23 05:42:56,578 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 27 transitions. [2018-11-23 05:42:56,580 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-11-23 05:42:56,580 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 05:42:56,580 INFO L402 BasicCegarLoop]: trace histogram [4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 05:42:56,580 INFO L423 AbstractCegarLoop]: === Iteration 4 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 05:42:56,581 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 05:42:56,581 INFO L82 PathProgramCache]: Analyzing trace with hash 318767734, now seen corresponding path program 2 times [2018-11-23 05:42:56,582 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-23 05:42:56,582 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_4becc31a-4406-42a9-ae1e-b055b76278dc/bin-2019/uautomizer/cvc4nyu Starting monitored process 5 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-23 05:42:56,607 INFO L101 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2018-11-23 05:42:56,634 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-11-23 05:42:56,634 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 05:42:56,638 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 05:42:56,673 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 13 proven. 2 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2018-11-23 05:42:56,673 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-23 05:42:56,729 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 13 proven. 2 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2018-11-23 05:42:56,731 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 05:42:56,731 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 7 [2018-11-23 05:42:56,731 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-11-23 05:42:56,732 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-11-23 05:42:56,732 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2018-11-23 05:42:56,732 INFO L87 Difference]: Start difference. First operand 23 states and 27 transitions. Second operand 7 states. [2018-11-23 05:42:56,869 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 05:42:56,869 INFO L93 Difference]: Finished difference Result 45 states and 53 transitions. [2018-11-23 05:42:56,870 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-11-23 05:42:56,870 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 22 [2018-11-23 05:42:56,871 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 05:42:56,873 INFO L225 Difference]: With dead ends: 45 [2018-11-23 05:42:56,873 INFO L226 Difference]: Without dead ends: 32 [2018-11-23 05:42:56,873 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 37 SyntacticMatches, 1 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=33, Invalid=77, Unknown=0, NotChecked=0, Total=110 [2018-11-23 05:42:56,874 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2018-11-23 05:42:56,878 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 24. [2018-11-23 05:42:56,879 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2018-11-23 05:42:56,879 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 27 transitions. [2018-11-23 05:42:56,880 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 27 transitions. Word has length 22 [2018-11-23 05:42:56,880 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 05:42:56,880 INFO L480 AbstractCegarLoop]: Abstraction has 24 states and 27 transitions. [2018-11-23 05:42:56,880 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-11-23 05:42:56,880 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 27 transitions. [2018-11-23 05:42:56,881 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-11-23 05:42:56,881 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 05:42:56,881 INFO L402 BasicCegarLoop]: trace histogram [4, 4, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 05:42:56,881 INFO L423 AbstractCegarLoop]: === Iteration 5 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 05:42:56,881 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 05:42:56,881 INFO L82 PathProgramCache]: Analyzing trace with hash 1506969082, now seen corresponding path program 1 times [2018-11-23 05:42:56,882 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-23 05:42:56,882 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_4becc31a-4406-42a9-ae1e-b055b76278dc/bin-2019/uautomizer/cvc4nyu Starting monitored process 6 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-23 05:42:56,904 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 05:42:56,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 05:42:56,932 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 05:42:56,995 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 05:42:56,996 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-23 05:42:57,130 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 05:42:57,132 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 05:42:57,132 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 12 [2018-11-23 05:42:57,132 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-11-23 05:42:57,133 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-11-23 05:42:57,133 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=87, Unknown=0, NotChecked=0, Total=132 [2018-11-23 05:42:57,133 INFO L87 Difference]: Start difference. First operand 24 states and 27 transitions. Second operand 12 states. [2018-11-23 05:42:57,273 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 05:42:57,273 INFO L93 Difference]: Finished difference Result 40 states and 49 transitions. [2018-11-23 05:42:57,274 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-11-23 05:42:57,274 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 22 [2018-11-23 05:42:57,274 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 05:42:57,275 INFO L225 Difference]: With dead ends: 40 [2018-11-23 05:42:57,275 INFO L226 Difference]: Without dead ends: 35 [2018-11-23 05:42:57,275 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 33 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=65, Invalid=117, Unknown=0, NotChecked=0, Total=182 [2018-11-23 05:42:57,275 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2018-11-23 05:42:57,280 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 35. [2018-11-23 05:42:57,281 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35 states. [2018-11-23 05:42:57,282 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 41 transitions. [2018-11-23 05:42:57,282 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 41 transitions. Word has length 22 [2018-11-23 05:42:57,282 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 05:42:57,282 INFO L480 AbstractCegarLoop]: Abstraction has 35 states and 41 transitions. [2018-11-23 05:42:57,282 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-11-23 05:42:57,283 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 41 transitions. [2018-11-23 05:42:57,283 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2018-11-23 05:42:57,283 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 05:42:57,284 INFO L402 BasicCegarLoop]: trace histogram [8, 8, 6, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 05:42:57,284 INFO L423 AbstractCegarLoop]: === Iteration 6 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 05:42:57,284 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 05:42:57,284 INFO L82 PathProgramCache]: Analyzing trace with hash 1137706810, now seen corresponding path program 2 times [2018-11-23 05:42:57,285 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-23 05:42:57,285 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_4becc31a-4406-42a9-ae1e-b055b76278dc/bin-2019/uautomizer/cvc4nyu Starting monitored process 7 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-23 05:42:57,308 INFO L101 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2018-11-23 05:42:57,355 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-11-23 05:42:57,355 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 05:42:57,360 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 05:42:57,421 INFO L134 CoverageAnalysis]: Checked inductivity of 92 backedges. 51 proven. 26 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2018-11-23 05:42:57,421 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-23 05:42:57,551 INFO L134 CoverageAnalysis]: Checked inductivity of 92 backedges. 51 proven. 26 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2018-11-23 05:42:57,552 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 05:42:57,553 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 13 [2018-11-23 05:42:57,553 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-11-23 05:42:57,553 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-11-23 05:42:57,553 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=116, Unknown=0, NotChecked=0, Total=156 [2018-11-23 05:42:57,554 INFO L87 Difference]: Start difference. First operand 35 states and 41 transitions. Second operand 13 states. [2018-11-23 05:42:58,010 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 05:42:58,010 INFO L93 Difference]: Finished difference Result 69 states and 84 transitions. [2018-11-23 05:42:58,011 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-11-23 05:42:58,011 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 34 [2018-11-23 05:42:58,011 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 05:42:58,012 INFO L225 Difference]: With dead ends: 69 [2018-11-23 05:42:58,012 INFO L226 Difference]: Without dead ends: 53 [2018-11-23 05:42:58,013 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 79 GetRequests, 55 SyntacticMatches, 1 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 73 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=130, Invalid=470, Unknown=0, NotChecked=0, Total=600 [2018-11-23 05:42:58,013 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2018-11-23 05:42:58,021 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 42. [2018-11-23 05:42:58,021 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42 states. [2018-11-23 05:42:58,022 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 48 transitions. [2018-11-23 05:42:58,022 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 48 transitions. Word has length 34 [2018-11-23 05:42:58,026 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 05:42:58,027 INFO L480 AbstractCegarLoop]: Abstraction has 42 states and 48 transitions. [2018-11-23 05:42:58,027 INFO L481 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-11-23 05:42:58,027 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 48 transitions. [2018-11-23 05:42:58,028 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2018-11-23 05:42:58,028 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 05:42:58,028 INFO L402 BasicCegarLoop]: trace histogram [8, 8, 5, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 05:42:58,028 INFO L423 AbstractCegarLoop]: === Iteration 7 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 05:42:58,028 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 05:42:58,029 INFO L82 PathProgramCache]: Analyzing trace with hash 1498618808, now seen corresponding path program 3 times [2018-11-23 05:42:58,029 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-23 05:42:58,029 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_4becc31a-4406-42a9-ae1e-b055b76278dc/bin-2019/uautomizer/cvc4nyu Starting monitored process 8 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-23 05:42:58,044 INFO L101 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2018-11-23 05:42:58,148 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 9 check-sat command(s) [2018-11-23 05:42:58,148 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 05:42:58,154 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 05:42:58,495 INFO L134 CoverageAnalysis]: Checked inductivity of 92 backedges. 2 proven. 83 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2018-11-23 05:42:58,495 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-23 05:42:59,862 INFO L134 CoverageAnalysis]: Checked inductivity of 92 backedges. 0 proven. 85 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2018-11-23 05:42:59,864 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 05:42:59,864 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 18] total 34 [2018-11-23 05:42:59,864 INFO L459 AbstractCegarLoop]: Interpolant automaton has 34 states [2018-11-23 05:42:59,864 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2018-11-23 05:42:59,865 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=129, Invalid=993, Unknown=0, NotChecked=0, Total=1122 [2018-11-23 05:42:59,865 INFO L87 Difference]: Start difference. First operand 42 states and 48 transitions. Second operand 34 states. [2018-11-23 05:43:02,479 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 05:43:02,480 INFO L93 Difference]: Finished difference Result 118 states and 137 transitions. [2018-11-23 05:43:02,480 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2018-11-23 05:43:02,480 INFO L78 Accepts]: Start accepts. Automaton has 34 states. Word has length 34 [2018-11-23 05:43:02,480 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 05:43:02,482 INFO L225 Difference]: With dead ends: 118 [2018-11-23 05:43:02,482 INFO L226 Difference]: Without dead ends: 113 [2018-11-23 05:43:02,484 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 91 GetRequests, 35 SyntacticMatches, 0 SemanticMatches, 56 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 532 ImplicationChecksByTransitivity, 3.4s TimeCoverageRelationStatistics Valid=431, Invalid=2875, Unknown=0, NotChecked=0, Total=3306 [2018-11-23 05:43:02,484 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 113 states. [2018-11-23 05:43:02,501 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 113 to 88. [2018-11-23 05:43:02,502 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 88 states. [2018-11-23 05:43:02,503 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 104 transitions. [2018-11-23 05:43:02,503 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 104 transitions. Word has length 34 [2018-11-23 05:43:02,504 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 05:43:02,504 INFO L480 AbstractCegarLoop]: Abstraction has 88 states and 104 transitions. [2018-11-23 05:43:02,504 INFO L481 AbstractCegarLoop]: Interpolant automaton has 34 states. [2018-11-23 05:43:02,504 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 104 transitions. [2018-11-23 05:43:02,505 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2018-11-23 05:43:02,505 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 05:43:02,505 INFO L402 BasicCegarLoop]: trace histogram [8, 8, 6, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 05:43:02,505 INFO L423 AbstractCegarLoop]: === Iteration 8 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 05:43:02,506 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 05:43:02,506 INFO L82 PathProgramCache]: Analyzing trace with hash 911812794, now seen corresponding path program 4 times [2018-11-23 05:43:02,506 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-23 05:43:02,506 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_4becc31a-4406-42a9-ae1e-b055b76278dc/bin-2019/uautomizer/cvc4nyu Starting monitored process 9 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-23 05:43:02,520 INFO L101 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-23 05:43:02,545 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-23 05:43:02,546 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 05:43:02,550 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 05:43:02,620 INFO L134 CoverageAnalysis]: Checked inductivity of 92 backedges. 45 proven. 40 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2018-11-23 05:43:02,620 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-23 05:43:02,744 INFO L134 CoverageAnalysis]: Checked inductivity of 92 backedges. 45 proven. 40 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2018-11-23 05:43:02,746 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 05:43:02,746 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 16 [2018-11-23 05:43:02,747 INFO L459 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-11-23 05:43:02,747 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-11-23 05:43:02,747 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=200, Unknown=0, NotChecked=0, Total=240 [2018-11-23 05:43:02,747 INFO L87 Difference]: Start difference. First operand 88 states and 104 transitions. Second operand 16 states. [2018-11-23 05:43:02,908 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 05:43:02,908 INFO L93 Difference]: Finished difference Result 103 states and 122 transitions. [2018-11-23 05:43:02,909 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-11-23 05:43:02,909 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 34 [2018-11-23 05:43:02,909 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 05:43:02,909 INFO L225 Difference]: With dead ends: 103 [2018-11-23 05:43:02,910 INFO L226 Difference]: Without dead ends: 45 [2018-11-23 05:43:02,910 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 72 GetRequests, 53 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 31 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=70, Invalid=350, Unknown=0, NotChecked=0, Total=420 [2018-11-23 05:43:02,911 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2018-11-23 05:43:02,918 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 42. [2018-11-23 05:43:02,918 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42 states. [2018-11-23 05:43:02,919 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 44 transitions. [2018-11-23 05:43:02,919 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 44 transitions. Word has length 34 [2018-11-23 05:43:02,919 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 05:43:02,919 INFO L480 AbstractCegarLoop]: Abstraction has 42 states and 44 transitions. [2018-11-23 05:43:02,919 INFO L481 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-11-23 05:43:02,919 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 44 transitions. [2018-11-23 05:43:02,920 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2018-11-23 05:43:02,920 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 05:43:02,920 INFO L402 BasicCegarLoop]: trace histogram [9, 9, 6, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 05:43:02,921 INFO L423 AbstractCegarLoop]: === Iteration 9 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 05:43:02,921 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 05:43:02,921 INFO L82 PathProgramCache]: Analyzing trace with hash -1684357419, now seen corresponding path program 5 times [2018-11-23 05:43:02,921 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-23 05:43:02,921 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_4becc31a-4406-42a9-ae1e-b055b76278dc/bin-2019/uautomizer/cvc4nyu Starting monitored process 10 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-23 05:43:02,941 INFO L101 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2018-11-23 05:43:03,059 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 9 check-sat command(s) [2018-11-23 05:43:03,059 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 05:43:03,064 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 05:43:04,748 INFO L134 CoverageAnalysis]: Checked inductivity of 117 backedges. 37 proven. 80 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 05:43:04,748 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-23 05:43:08,209 INFO L134 CoverageAnalysis]: Checked inductivity of 117 backedges. 68 proven. 49 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 05:43:08,211 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 05:43:08,211 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 24] total 46 [2018-11-23 05:43:08,211 INFO L459 AbstractCegarLoop]: Interpolant automaton has 46 states [2018-11-23 05:43:08,211 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 46 interpolants. [2018-11-23 05:43:08,212 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=446, Invalid=1624, Unknown=0, NotChecked=0, Total=2070 [2018-11-23 05:43:08,212 INFO L87 Difference]: Start difference. First operand 42 states and 44 transitions. Second operand 46 states. [2018-11-23 05:43:08,771 WARN L180 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 69 [2018-11-23 05:43:12,406 WARN L180 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 88 DAG size of output: 86 [2018-11-23 05:43:12,674 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 05:43:12,675 INFO L93 Difference]: Finished difference Result 42 states and 44 transitions. [2018-11-23 05:43:12,675 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2018-11-23 05:43:12,675 INFO L78 Accepts]: Start accepts. Automaton has 46 states. Word has length 37 [2018-11-23 05:43:12,675 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 05:43:12,675 INFO L225 Difference]: With dead ends: 42 [2018-11-23 05:43:12,675 INFO L226 Difference]: Without dead ends: 0 [2018-11-23 05:43:12,676 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 96 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 67 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 974 ImplicationChecksByTransitivity, 8.4s TimeCoverageRelationStatistics Valid=955, Invalid=3737, Unknown=0, NotChecked=0, Total=4692 [2018-11-23 05:43:12,676 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-11-23 05:43:12,677 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-11-23 05:43:12,677 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-11-23 05:43:12,677 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-11-23 05:43:12,677 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 37 [2018-11-23 05:43:12,677 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 05:43:12,677 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-23 05:43:12,677 INFO L481 AbstractCegarLoop]: Interpolant automaton has 46 states. [2018-11-23 05:43:12,678 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-11-23 05:43:12,678 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 05:43:12,681 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2018-11-23 05:43:13,699 WARN L180 SmtUtils]: Spent 842.00 ms on a formula simplification. DAG size of input: 235 DAG size of output: 154 [2018-11-23 05:43:13,702 INFO L451 ceAbstractionStarter]: At program point ULTIMATE.initFINAL(line -1) the Hoare annotation is: true [2018-11-23 05:43:13,702 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.initEXIT(line -1) no Hoare annotation was computed. [2018-11-23 05:43:13,702 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2018-11-23 05:43:13,703 INFO L451 ceAbstractionStarter]: At program point L-1(line -1) the Hoare annotation is: true [2018-11-23 05:43:13,703 INFO L451 ceAbstractionStarter]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2018-11-23 05:43:13,703 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2018-11-23 05:43:13,703 INFO L451 ceAbstractionStarter]: At program point mainENTRY(lines 12 32) the Hoare annotation is: true [2018-11-23 05:43:13,703 INFO L448 ceAbstractionStarter]: For program point L29(line 29) no Hoare annotation was computed. [2018-11-23 05:43:13,703 INFO L448 ceAbstractionStarter]: For program point mainEXIT(lines 12 32) no Hoare annotation was computed. [2018-11-23 05:43:13,703 INFO L448 ceAbstractionStarter]: For program point L24(lines 24 26) no Hoare annotation was computed. [2018-11-23 05:43:13,703 INFO L448 ceAbstractionStarter]: For program point L24-2(lines 24 26) no Hoare annotation was computed. [2018-11-23 05:43:13,705 INFO L444 ceAbstractionStarter]: At program point L21-2(lines 21 28) the Hoare annotation is: (let ((.cse13 (= (_ bv1 8) main_~y~0)) (.cse12 (not (= ((_ zero_extend 24) main_~bit~0) (_ bv0 32)))) (.cse11 (= (_ bv5 8) main_~y~0)) (.cse0 (= (_ bv37 8) main_~x~0)) (.cse1 (= (_ bv0 8) main_~bit~0))) (or (and .cse0 .cse1 (exists ((v_main_~c~0_40 (_ BitVec 8))) (let ((.cse2 ((_ zero_extend 24) v_main_~c~0_40))) (and (= ((_ extract 7 0) (bvadd ((_ zero_extend 24) ((_ extract 7 0) (bvshl (_ bv1 32) .cse2))) (_ bv5 32))) main_~y~0) (= main_~c~0 ((_ extract 7 0) (bvadd ((_ zero_extend 24) ((_ extract 7 0) (bvadd .cse2 (_ bv1 32)))) (_ bv1 32))))))) (exists ((v_main_~c~0_66 (_ BitVec 8))) (let ((.cse9 ((_ zero_extend 24) v_main_~c~0_66))) (let ((.cse10 ((_ zero_extend 24) ((_ extract 7 0) (bvadd .cse9 (_ bv1 32)))))) (let ((.cse6 ((_ zero_extend 24) ((_ extract 7 0) (bvadd .cse10 (_ bv1 32)))))) (let ((.cse4 ((_ zero_extend 24) ((_ extract 7 0) (bvadd .cse6 (_ bv1 32)))))) (let ((.cse5 ((_ zero_extend 24) ((_ extract 7 0) (bvadd .cse4 (_ bv1 32)))))) (let ((.cse8 ((_ zero_extend 24) ((_ extract 7 0) (bvadd .cse5 (_ bv1 32)))))) (let ((.cse3 ((_ zero_extend 24) main_~x~0)) (.cse7 ((_ zero_extend 24) ((_ extract 7 0) (bvadd .cse8 (_ bv1 32)))))) (and (= ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse3 ((_ zero_extend 24) ((_ extract 7 0) (bvshl (_ bv1 32) .cse4)))))) (_ bv0 32)) (bvslt .cse5 (_ bv8 32)) (bvslt .cse6 (_ bv8 32)) (= ((_ extract 7 0) (bvadd .cse7 (_ bv1 32))) main_~c~0) (bvslt .cse4 (_ bv8 32)) (bvslt .cse8 (_ bv8 32)) (= ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse3 ((_ zero_extend 24) ((_ extract 7 0) (bvshl (_ bv1 32) .cse7)))))) (_ bv0 32)) (not (= ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse3 ((_ zero_extend 24) ((_ extract 7 0) (bvshl (_ bv1 32) .cse9)))))) (_ bv0 32))) (= (_ bv0 32) ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse3 ((_ zero_extend 24) ((_ extract 7 0) (bvshl (_ bv1 32) .cse5))))))) (= (_ bv0 32) ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse3 ((_ zero_extend 24) ((_ extract 7 0) (bvshl (_ bv1 32) .cse10))))))) (bvslt .cse7 (_ bv8 32)) (bvslt .cse10 (_ bv8 32)))))))))))) (and .cse0 .cse1 .cse11 (= (_ bv4 8) main_~c~0)) (and .cse0 (= (_ bv1 8) main_~c~0) .cse12 .cse13) (and .cse0 .cse1 .cse13 (= (_ bv2 8) main_~c~0)) (and .cse1 .cse0 (exists ((v_main_~c~0_66 (_ BitVec 8))) (let ((.cse18 ((_ zero_extend 24) v_main_~c~0_66))) (let ((.cse19 ((_ zero_extend 24) ((_ extract 7 0) (bvadd .cse18 (_ bv1 32)))))) (let ((.cse17 ((_ zero_extend 24) ((_ extract 7 0) (bvadd .cse19 (_ bv1 32)))))) (let ((.cse15 ((_ zero_extend 24) ((_ extract 7 0) (bvadd .cse17 (_ bv1 32)))))) (let ((.cse14 ((_ zero_extend 24) main_~x~0)) (.cse16 ((_ zero_extend 24) ((_ extract 7 0) (bvadd .cse15 (_ bv1 32)))))) (and (= ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse14 ((_ zero_extend 24) ((_ extract 7 0) (bvshl (_ bv1 32) .cse15)))))) (_ bv0 32)) (bvslt .cse16 (_ bv8 32)) (bvslt .cse17 (_ bv8 32)) (bvslt .cse15 (_ bv8 32)) (not (= ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse14 ((_ zero_extend 24) ((_ extract 7 0) (bvshl (_ bv1 32) .cse18)))))) (_ bv0 32))) (= (_ bv0 32) ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse14 ((_ zero_extend 24) ((_ extract 7 0) (bvshl (_ bv1 32) .cse16))))))) (= (_ bv0 32) ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse14 ((_ zero_extend 24) ((_ extract 7 0) (bvshl (_ bv1 32) .cse19))))))) (bvslt .cse19 (_ bv8 32)) (= ((_ extract 7 0) (bvadd .cse16 (_ bv1 32))) main_~c~0)))))))) .cse11) (and .cse0 (exists ((v_main_~c~0_40 (_ BitVec 8))) (let ((.cse20 ((_ zero_extend 24) v_main_~c~0_40))) (and (= ((_ extract 7 0) (bvadd .cse20 (_ bv1 32))) main_~c~0) (= ((_ extract 7 0) (bvadd ((_ zero_extend 24) ((_ extract 7 0) (bvshl (_ bv1 32) .cse20))) (_ bv5 32))) main_~y~0)))) (= (_ bv32 8) main_~bit~0) (exists ((v_main_~c~0_66 (_ BitVec 8))) (let ((.cse26 ((_ zero_extend 24) v_main_~c~0_66))) (let ((.cse27 ((_ zero_extend 24) ((_ extract 7 0) (bvadd .cse26 (_ bv1 32)))))) (let ((.cse25 ((_ zero_extend 24) ((_ extract 7 0) (bvadd .cse27 (_ bv1 32)))))) (let ((.cse23 ((_ zero_extend 24) ((_ extract 7 0) (bvadd .cse25 (_ bv1 32)))))) (let ((.cse24 ((_ zero_extend 24) ((_ extract 7 0) (bvadd .cse23 (_ bv1 32)))))) (let ((.cse21 ((_ zero_extend 24) ((_ extract 7 0) (bvadd .cse24 (_ bv1 32))))) (.cse22 ((_ zero_extend 24) main_~x~0))) (and (= ((_ extract 7 0) (bvadd .cse21 (_ bv1 32))) main_~c~0) (= ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse22 ((_ zero_extend 24) ((_ extract 7 0) (bvshl (_ bv1 32) .cse23)))))) (_ bv0 32)) (bvslt .cse24 (_ bv8 32)) (bvslt .cse25 (_ bv8 32)) (bvslt .cse23 (_ bv8 32)) (bvslt .cse21 (_ bv8 32)) (not (= ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse22 ((_ zero_extend 24) ((_ extract 7 0) (bvshl (_ bv1 32) .cse26)))))) (_ bv0 32))) (= (_ bv0 32) ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse22 ((_ zero_extend 24) ((_ extract 7 0) (bvshl (_ bv1 32) .cse24))))))) (= (_ bv0 32) ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse22 ((_ zero_extend 24) ((_ extract 7 0) (bvshl (_ bv1 32) .cse27))))))) (bvslt .cse27 (_ bv8 32))))))))))) (and (= (_ bv0 8) main_~c~0) .cse0 (= (_ bv0 8) main_~y~0)) (and .cse0 .cse12 .cse11 (= (_ bv3 8) main_~c~0)) (and .cse0 (exists ((v_main_~c~0_40 (_ BitVec 8))) (let ((.cse28 ((_ zero_extend 24) v_main_~c~0_40))) (let ((.cse29 ((_ zero_extend 24) ((_ extract 7 0) (bvadd ((_ zero_extend 24) ((_ extract 7 0) (bvadd .cse28 (_ bv1 32)))) (_ bv1 32)))))) (and (= ((_ extract 7 0) (bvadd ((_ zero_extend 24) ((_ extract 7 0) (bvshl (_ bv1 32) .cse28))) (_ bv5 32))) main_~y~0) (= main_~c~0 ((_ extract 7 0) (bvadd .cse29 (_ bv1 32)))) (bvslt .cse29 (_ bv8 32)))))) .cse1 (exists ((main_~x~0 (_ BitVec 8)) (v_main_~c~0_66 (_ BitVec 8))) (let ((.cse37 ((_ zero_extend 24) v_main_~c~0_66))) (let ((.cse38 ((_ zero_extend 24) ((_ extract 7 0) (bvadd .cse37 (_ bv1 32)))))) (let ((.cse35 ((_ zero_extend 24) ((_ extract 7 0) (bvadd .cse38 (_ bv1 32)))))) (let ((.cse31 ((_ zero_extend 24) ((_ extract 7 0) (bvadd .cse35 (_ bv1 32)))))) (let ((.cse32 ((_ zero_extend 24) ((_ extract 7 0) (bvadd .cse31 (_ bv1 32)))))) (let ((.cse36 ((_ zero_extend 24) ((_ extract 7 0) (bvadd .cse32 (_ bv1 32)))))) (let ((.cse34 ((_ zero_extend 24) ((_ extract 7 0) (bvadd .cse36 (_ bv1 32)))))) (let ((.cse33 ((_ zero_extend 24) ((_ extract 7 0) (bvadd .cse34 (_ bv1 32))))) (.cse30 ((_ zero_extend 24) main_~x~0))) (and (= ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse30 ((_ zero_extend 24) ((_ extract 7 0) (bvshl (_ bv1 32) .cse31)))))) (_ bv0 32)) (bvslt .cse32 (_ bv8 32)) (bvslt .cse33 (_ bv8 32)) (= ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse30 ((_ zero_extend 24) ((_ extract 7 0) (bvshl (_ bv1 32) .cse34)))))) (_ bv0 32)) (= ((_ extract 7 0) (bvadd .cse33 (_ bv1 32))) main_~c~0) (bvslt .cse35 (_ bv8 32)) (bvslt .cse31 (_ bv8 32)) (bvslt .cse36 (_ bv8 32)) (not (= ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse30 ((_ zero_extend 24) ((_ extract 7 0) (bvshl (_ bv1 32) .cse37)))))) (_ bv0 32))) (= (_ bv0 32) ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse30 ((_ zero_extend 24) ((_ extract 7 0) (bvshl (_ bv1 32) .cse32))))))) (= (_ bv0 32) ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse30 ((_ zero_extend 24) ((_ extract 7 0) (bvshl (_ bv1 32) .cse33))))))) (= (_ bv0 32) ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse30 ((_ zero_extend 24) ((_ extract 7 0) (bvshl (_ bv1 32) .cse38))))))) (bvslt .cse34 (_ bv8 32)) (bvslt .cse38 (_ bv8 32))))))))))))))) [2018-11-23 05:43:13,705 INFO L444 ceAbstractionStarter]: At program point L21-3(lines 21 28) the Hoare annotation is: (and (= (_ bv37 8) main_~x~0) (exists ((v_main_~c~0_40 (_ BitVec 8))) (let ((.cse0 ((_ zero_extend 24) v_main_~c~0_40))) (let ((.cse1 ((_ zero_extend 24) ((_ extract 7 0) (bvadd ((_ zero_extend 24) ((_ extract 7 0) (bvadd .cse0 (_ bv1 32)))) (_ bv1 32)))))) (and (= ((_ extract 7 0) (bvadd ((_ zero_extend 24) ((_ extract 7 0) (bvshl (_ bv1 32) .cse0))) (_ bv5 32))) main_~y~0) (= main_~c~0 ((_ extract 7 0) (bvadd .cse1 (_ bv1 32)))) (bvslt .cse1 (_ bv8 32)))))) (exists ((v_main_~c~0_40 (_ BitVec 8))) (let ((.cse2 ((_ zero_extend 24) v_main_~c~0_40))) (let ((.cse3 ((_ zero_extend 24) ((_ extract 7 0) (bvadd ((_ zero_extend 24) ((_ extract 7 0) (bvadd .cse2 (_ bv1 32)))) (_ bv1 32)))))) (and (= ((_ extract 7 0) (bvadd ((_ zero_extend 24) ((_ extract 7 0) (bvshl (_ bv1 32) .cse2))) (_ bv5 32))) main_~y~0) (bvslt .cse3 (_ bv8 32)) (not (bvslt ((_ zero_extend 24) ((_ extract 7 0) (bvadd .cse3 (_ bv1 32)))) (_ bv8 32)))))))) [2018-11-23 05:43:13,705 INFO L448 ceAbstractionStarter]: For program point mainFINAL(lines 12 32) no Hoare annotation was computed. [2018-11-23 05:43:13,705 INFO L451 ceAbstractionStarter]: At program point __VERIFIER_assertENTRY(lines 4 9) the Hoare annotation is: true [2018-11-23 05:43:13,705 INFO L448 ceAbstractionStarter]: For program point __VERIFIER_assertEXIT(lines 4 9) no Hoare annotation was computed. [2018-11-23 05:43:13,705 INFO L448 ceAbstractionStarter]: For program point L6(line 6) no Hoare annotation was computed. [2018-11-23 05:43:13,706 INFO L448 ceAbstractionStarter]: For program point L5(lines 5 7) no Hoare annotation was computed. [2018-11-23 05:43:13,706 INFO L448 ceAbstractionStarter]: For program point L5-2(lines 4 9) no Hoare annotation was computed. [2018-11-23 05:43:13,706 INFO L448 ceAbstractionStarter]: For program point __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION(line 6) no Hoare annotation was computed. [2018-11-23 05:43:13,716 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~c~0_40,QUANTIFIED] [2018-11-23 05:43:13,718 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~c~0_40,QUANTIFIED] [2018-11-23 05:43:13,718 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~c~0_66,QUANTIFIED] [2018-11-23 05:43:13,718 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~c~0_66,QUANTIFIED] [2018-11-23 05:43:13,719 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~c~0_66,QUANTIFIED] [2018-11-23 05:43:13,719 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~c~0_66,QUANTIFIED] [2018-11-23 05:43:13,720 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~c~0_66,QUANTIFIED] [2018-11-23 05:43:13,720 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~c~0_66,QUANTIFIED] [2018-11-23 05:43:13,720 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~c~0_66,QUANTIFIED] [2018-11-23 05:43:13,721 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~c~0_66,QUANTIFIED] [2018-11-23 05:43:13,721 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~c~0_66,QUANTIFIED] [2018-11-23 05:43:13,721 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~c~0_66,QUANTIFIED] [2018-11-23 05:43:13,722 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~c~0_66,QUANTIFIED] [2018-11-23 05:43:13,724 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~c~0_66,QUANTIFIED] [2018-11-23 05:43:13,724 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~c~0_66,QUANTIFIED] [2018-11-23 05:43:13,725 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~c~0_66,QUANTIFIED] [2018-11-23 05:43:13,725 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~c~0_66,QUANTIFIED] [2018-11-23 05:43:13,725 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~c~0_66,QUANTIFIED] [2018-11-23 05:43:13,725 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~c~0_66,QUANTIFIED] [2018-11-23 05:43:13,725 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~c~0_66,QUANTIFIED] [2018-11-23 05:43:13,726 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~c~0_66,QUANTIFIED] [2018-11-23 05:43:13,726 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~c~0_66,QUANTIFIED] [2018-11-23 05:43:13,726 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~c~0_66,QUANTIFIED] [2018-11-23 05:43:13,726 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~c~0_40,QUANTIFIED] [2018-11-23 05:43:13,727 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~c~0_40,QUANTIFIED] [2018-11-23 05:43:13,727 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~c~0_66,QUANTIFIED] [2018-11-23 05:43:13,727 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~c~0_66,QUANTIFIED] [2018-11-23 05:43:13,727 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~c~0_66,QUANTIFIED] [2018-11-23 05:43:13,728 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~c~0_66,QUANTIFIED] [2018-11-23 05:43:13,728 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~c~0_66,QUANTIFIED] [2018-11-23 05:43:13,728 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~c~0_66,QUANTIFIED] [2018-11-23 05:43:13,728 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~c~0_66,QUANTIFIED] [2018-11-23 05:43:13,729 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~c~0_66,QUANTIFIED] [2018-11-23 05:43:13,729 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~c~0_66,QUANTIFIED] [2018-11-23 05:43:13,729 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~c~0_66,QUANTIFIED] [2018-11-23 05:43:13,729 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~c~0_40,QUANTIFIED] [2018-11-23 05:43:13,729 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~c~0_40,QUANTIFIED] [2018-11-23 05:43:13,730 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~c~0_40,QUANTIFIED] [2018-11-23 05:43:13,730 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~x~0,QUANTIFIED] [2018-11-23 05:43:13,730 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~c~0_66,QUANTIFIED] [2018-11-23 05:43:13,730 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~c~0_66,QUANTIFIED] [2018-11-23 05:43:13,731 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~c~0_66,QUANTIFIED] [2018-11-23 05:43:13,731 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~x~0,QUANTIFIED] [2018-11-23 05:43:13,731 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~c~0_66,QUANTIFIED] [2018-11-23 05:43:13,731 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~c~0_66,QUANTIFIED] [2018-11-23 05:43:13,732 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~c~0_66,QUANTIFIED] [2018-11-23 05:43:13,732 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~c~0_66,QUANTIFIED] [2018-11-23 05:43:13,732 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~c~0_66,QUANTIFIED] [2018-11-23 05:43:13,732 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~x~0,QUANTIFIED] [2018-11-23 05:43:13,733 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~c~0_66,QUANTIFIED] [2018-11-23 05:43:13,733 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~x~0,QUANTIFIED] [2018-11-23 05:43:13,733 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~c~0_66,QUANTIFIED] [2018-11-23 05:43:13,733 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~x~0,QUANTIFIED] [2018-11-23 05:43:13,733 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~c~0_66,QUANTIFIED] [2018-11-23 05:43:13,734 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~x~0,QUANTIFIED] [2018-11-23 05:43:13,734 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~c~0_66,QUANTIFIED] [2018-11-23 05:43:13,734 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~c~0_66,QUANTIFIED] [2018-11-23 05:43:13,734 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~c~0_66,QUANTIFIED] [2018-11-23 05:43:13,747 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~c~0_40,QUANTIFIED] [2018-11-23 05:43:13,747 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~c~0_40,QUANTIFIED] [2018-11-23 05:43:13,747 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~c~0_66,QUANTIFIED] [2018-11-23 05:43:13,748 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~c~0_66,QUANTIFIED] [2018-11-23 05:43:13,748 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~c~0_66,QUANTIFIED] [2018-11-23 05:43:13,748 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~c~0_66,QUANTIFIED] [2018-11-23 05:43:13,749 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~c~0_66,QUANTIFIED] [2018-11-23 05:43:13,749 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~c~0_66,QUANTIFIED] [2018-11-23 05:43:13,749 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~c~0_66,QUANTIFIED] [2018-11-23 05:43:13,750 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~c~0_66,QUANTIFIED] [2018-11-23 05:43:13,750 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~c~0_66,QUANTIFIED] [2018-11-23 05:43:13,750 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~c~0_66,QUANTIFIED] [2018-11-23 05:43:13,751 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~c~0_66,QUANTIFIED] [2018-11-23 05:43:13,751 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~c~0_66,QUANTIFIED] [2018-11-23 05:43:13,751 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~c~0_66,QUANTIFIED] [2018-11-23 05:43:13,752 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~c~0_66,QUANTIFIED] [2018-11-23 05:43:13,752 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~c~0_66,QUANTIFIED] [2018-11-23 05:43:13,752 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~c~0_66,QUANTIFIED] [2018-11-23 05:43:13,752 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~c~0_66,QUANTIFIED] [2018-11-23 05:43:13,753 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~c~0_66,QUANTIFIED] [2018-11-23 05:43:13,753 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~c~0_66,QUANTIFIED] [2018-11-23 05:43:13,753 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~c~0_66,QUANTIFIED] [2018-11-23 05:43:13,754 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~c~0_66,QUANTIFIED] [2018-11-23 05:43:13,754 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~c~0_40,QUANTIFIED] [2018-11-23 05:43:13,754 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~c~0_40,QUANTIFIED] [2018-11-23 05:43:13,754 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~c~0_66,QUANTIFIED] [2018-11-23 05:43:13,755 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~c~0_66,QUANTIFIED] [2018-11-23 05:43:13,755 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~c~0_66,QUANTIFIED] [2018-11-23 05:43:13,755 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~c~0_66,QUANTIFIED] [2018-11-23 05:43:13,755 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~c~0_66,QUANTIFIED] [2018-11-23 05:43:13,756 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~c~0_66,QUANTIFIED] [2018-11-23 05:43:13,756 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~c~0_66,QUANTIFIED] [2018-11-23 05:43:13,756 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~c~0_66,QUANTIFIED] [2018-11-23 05:43:13,757 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~c~0_66,QUANTIFIED] [2018-11-23 05:43:13,757 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~c~0_66,QUANTIFIED] [2018-11-23 05:43:13,757 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~c~0_40,QUANTIFIED] [2018-11-23 05:43:13,757 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~c~0_40,QUANTIFIED] [2018-11-23 05:43:13,757 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~c~0_40,QUANTIFIED] [2018-11-23 05:43:13,758 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~x~0,QUANTIFIED] [2018-11-23 05:43:13,758 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~c~0_66,QUANTIFIED] [2018-11-23 05:43:13,758 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~c~0_66,QUANTIFIED] [2018-11-23 05:43:13,758 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~c~0_66,QUANTIFIED] [2018-11-23 05:43:13,759 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~x~0,QUANTIFIED] [2018-11-23 05:43:13,759 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~c~0_66,QUANTIFIED] [2018-11-23 05:43:13,759 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~c~0_66,QUANTIFIED] [2018-11-23 05:43:13,760 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~c~0_66,QUANTIFIED] [2018-11-23 05:43:13,760 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~c~0_66,QUANTIFIED] [2018-11-23 05:43:13,760 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~c~0_66,QUANTIFIED] [2018-11-23 05:43:13,761 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~x~0,QUANTIFIED] [2018-11-23 05:43:13,761 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~c~0_66,QUANTIFIED] [2018-11-23 05:43:13,761 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~x~0,QUANTIFIED] [2018-11-23 05:43:13,761 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~c~0_66,QUANTIFIED] [2018-11-23 05:43:13,761 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~x~0,QUANTIFIED] [2018-11-23 05:43:13,762 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~c~0_66,QUANTIFIED] [2018-11-23 05:43:13,762 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~x~0,QUANTIFIED] [2018-11-23 05:43:13,762 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~c~0_66,QUANTIFIED] [2018-11-23 05:43:13,762 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~c~0_66,QUANTIFIED] [2018-11-23 05:43:13,763 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~c~0_66,QUANTIFIED] [2018-11-23 05:43:13,767 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 23.11 05:43:13 BoogieIcfgContainer [2018-11-23 05:43:13,767 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-11-23 05:43:13,768 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-11-23 05:43:13,768 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-11-23 05:43:13,768 INFO L276 PluginConnector]: Witness Printer initialized [2018-11-23 05:43:13,768 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 05:42:56" (3/4) ... [2018-11-23 05:43:13,772 INFO L144 WitnessPrinter]: Generating witness for correct program [2018-11-23 05:43:13,778 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ULTIMATE.init [2018-11-23 05:43:13,778 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure main [2018-11-23 05:43:13,779 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure __VERIFIER_assert [2018-11-23 05:43:13,782 INFO L879 BoogieBacktranslator]: Reduced CFG by removing 7 nodes and edges [2018-11-23 05:43:13,782 INFO L879 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2018-11-23 05:43:13,782 INFO L879 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2018-11-23 05:43:13,810 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((37bv8 == x && 0bv8 == bit) && (\exists v_main_~c~0_40 : bv8 :: ~bvadd64(~zero_extendFrom8To32(~bvshl32(1bv32, ~zero_extendFrom8To32(v_main_~c~0_40))[7:0]), 5bv32)[7:0] == y && c == ~bvadd64(~zero_extendFrom8To32(~bvadd64(~zero_extendFrom8To32(v_main_~c~0_40), 1bv32)[7:0]), 1bv32)[7:0])) && (\exists v_main_~c~0_66 : bv8 :: ((((((((((~zero_extendFrom8To32(~bvand32(~zero_extendFrom8To32(x), ~zero_extendFrom8To32(~bvshl32(1bv32, ~zero_extendFrom8To32(~bvadd64(~zero_extendFrom8To32(~bvadd64(~zero_extendFrom8To32(~bvadd64(~zero_extendFrom8To32(v_main_~c~0_66), 1bv32)[7:0]), 1bv32)[7:0]), 1bv32)[7:0]))[7:0]))[7:0]) == 0bv32 && ~bvslt32(~zero_extendFrom8To32(~bvadd64(~zero_extendFrom8To32(~bvadd64(~zero_extendFrom8To32(~bvadd64(~zero_extendFrom8To32(~bvadd64(~zero_extendFrom8To32(v_main_~c~0_66), 1bv32)[7:0]), 1bv32)[7:0]), 1bv32)[7:0]), 1bv32)[7:0]), 8bv32)) && ~bvslt32(~zero_extendFrom8To32(~bvadd64(~zero_extendFrom8To32(~bvadd64(~zero_extendFrom8To32(v_main_~c~0_66), 1bv32)[7:0]), 1bv32)[7:0]), 8bv32)) && ~bvadd64(~zero_extendFrom8To32(~bvadd64(~zero_extendFrom8To32(~bvadd64(~zero_extendFrom8To32(~bvadd64(~zero_extendFrom8To32(~bvadd64(~zero_extendFrom8To32(~bvadd64(~zero_extendFrom8To32(~bvadd64(~zero_extendFrom8To32(v_main_~c~0_66), 1bv32)[7:0]), 1bv32)[7:0]), 1bv32)[7:0]), 1bv32)[7:0]), 1bv32)[7:0]), 1bv32)[7:0]), 1bv32)[7:0] == c) && ~bvslt32(~zero_extendFrom8To32(~bvadd64(~zero_extendFrom8To32(~bvadd64(~zero_extendFrom8To32(~bvadd64(~zero_extendFrom8To32(v_main_~c~0_66), 1bv32)[7:0]), 1bv32)[7:0]), 1bv32)[7:0]), 8bv32)) && ~bvslt32(~zero_extendFrom8To32(~bvadd64(~zero_extendFrom8To32(~bvadd64(~zero_extendFrom8To32(~bvadd64(~zero_extendFrom8To32(~bvadd64(~zero_extendFrom8To32(~bvadd64(~zero_extendFrom8To32(v_main_~c~0_66), 1bv32)[7:0]), 1bv32)[7:0]), 1bv32)[7:0]), 1bv32)[7:0]), 1bv32)[7:0]), 8bv32)) && ~zero_extendFrom8To32(~bvand32(~zero_extendFrom8To32(x), ~zero_extendFrom8To32(~bvshl32(1bv32, ~zero_extendFrom8To32(~bvadd64(~zero_extendFrom8To32(~bvadd64(~zero_extendFrom8To32(~bvadd64(~zero_extendFrom8To32(~bvadd64(~zero_extendFrom8To32(~bvadd64(~zero_extendFrom8To32(~bvadd64(~zero_extendFrom8To32(v_main_~c~0_66), 1bv32)[7:0]), 1bv32)[7:0]), 1bv32)[7:0]), 1bv32)[7:0]), 1bv32)[7:0]), 1bv32)[7:0]))[7:0]))[7:0]) == 0bv32) && !(~zero_extendFrom8To32(~bvand32(~zero_extendFrom8To32(x), ~zero_extendFrom8To32(~bvshl32(1bv32, ~zero_extendFrom8To32(v_main_~c~0_66))[7:0]))[7:0]) == 0bv32)) && 0bv32 == ~zero_extendFrom8To32(~bvand32(~zero_extendFrom8To32(x), ~zero_extendFrom8To32(~bvshl32(1bv32, ~zero_extendFrom8To32(~bvadd64(~zero_extendFrom8To32(~bvadd64(~zero_extendFrom8To32(~bvadd64(~zero_extendFrom8To32(~bvadd64(~zero_extendFrom8To32(v_main_~c~0_66), 1bv32)[7:0]), 1bv32)[7:0]), 1bv32)[7:0]), 1bv32)[7:0]))[7:0]))[7:0])) && 0bv32 == ~zero_extendFrom8To32(~bvand32(~zero_extendFrom8To32(x), ~zero_extendFrom8To32(~bvshl32(1bv32, ~zero_extendFrom8To32(~bvadd64(~zero_extendFrom8To32(v_main_~c~0_66), 1bv32)[7:0]))[7:0]))[7:0])) && ~bvslt32(~zero_extendFrom8To32(~bvadd64(~zero_extendFrom8To32(~bvadd64(~zero_extendFrom8To32(~bvadd64(~zero_extendFrom8To32(~bvadd64(~zero_extendFrom8To32(~bvadd64(~zero_extendFrom8To32(~bvadd64(~zero_extendFrom8To32(v_main_~c~0_66), 1bv32)[7:0]), 1bv32)[7:0]), 1bv32)[7:0]), 1bv32)[7:0]), 1bv32)[7:0]), 1bv32)[7:0]), 8bv32)) && ~bvslt32(~zero_extendFrom8To32(~bvadd64(~zero_extendFrom8To32(v_main_~c~0_66), 1bv32)[7:0]), 8bv32))) || (((37bv8 == x && 0bv8 == bit) && 5bv8 == y) && 4bv8 == c)) || (((37bv8 == x && 1bv8 == c) && !(~zero_extendFrom8To32(bit) == 0bv32)) && 1bv8 == y)) || (((37bv8 == x && 0bv8 == bit) && 1bv8 == y) && 2bv8 == c)) || (((0bv8 == bit && 37bv8 == x) && (\exists v_main_~c~0_66 : bv8 :: (((((((~zero_extendFrom8To32(~bvand32(~zero_extendFrom8To32(x), ~zero_extendFrom8To32(~bvshl32(1bv32, ~zero_extendFrom8To32(~bvadd64(~zero_extendFrom8To32(~bvadd64(~zero_extendFrom8To32(~bvadd64(~zero_extendFrom8To32(v_main_~c~0_66), 1bv32)[7:0]), 1bv32)[7:0]), 1bv32)[7:0]))[7:0]))[7:0]) == 0bv32 && ~bvslt32(~zero_extendFrom8To32(~bvadd64(~zero_extendFrom8To32(~bvadd64(~zero_extendFrom8To32(~bvadd64(~zero_extendFrom8To32(~bvadd64(~zero_extendFrom8To32(v_main_~c~0_66), 1bv32)[7:0]), 1bv32)[7:0]), 1bv32)[7:0]), 1bv32)[7:0]), 8bv32)) && ~bvslt32(~zero_extendFrom8To32(~bvadd64(~zero_extendFrom8To32(~bvadd64(~zero_extendFrom8To32(v_main_~c~0_66), 1bv32)[7:0]), 1bv32)[7:0]), 8bv32)) && ~bvslt32(~zero_extendFrom8To32(~bvadd64(~zero_extendFrom8To32(~bvadd64(~zero_extendFrom8To32(~bvadd64(~zero_extendFrom8To32(v_main_~c~0_66), 1bv32)[7:0]), 1bv32)[7:0]), 1bv32)[7:0]), 8bv32)) && !(~zero_extendFrom8To32(~bvand32(~zero_extendFrom8To32(x), ~zero_extendFrom8To32(~bvshl32(1bv32, ~zero_extendFrom8To32(v_main_~c~0_66))[7:0]))[7:0]) == 0bv32)) && 0bv32 == ~zero_extendFrom8To32(~bvand32(~zero_extendFrom8To32(x), ~zero_extendFrom8To32(~bvshl32(1bv32, ~zero_extendFrom8To32(~bvadd64(~zero_extendFrom8To32(~bvadd64(~zero_extendFrom8To32(~bvadd64(~zero_extendFrom8To32(~bvadd64(~zero_extendFrom8To32(v_main_~c~0_66), 1bv32)[7:0]), 1bv32)[7:0]), 1bv32)[7:0]), 1bv32)[7:0]))[7:0]))[7:0])) && 0bv32 == ~zero_extendFrom8To32(~bvand32(~zero_extendFrom8To32(x), ~zero_extendFrom8To32(~bvshl32(1bv32, ~zero_extendFrom8To32(~bvadd64(~zero_extendFrom8To32(v_main_~c~0_66), 1bv32)[7:0]))[7:0]))[7:0])) && ~bvslt32(~zero_extendFrom8To32(~bvadd64(~zero_extendFrom8To32(v_main_~c~0_66), 1bv32)[7:0]), 8bv32)) && ~bvadd64(~zero_extendFrom8To32(~bvadd64(~zero_extendFrom8To32(~bvadd64(~zero_extendFrom8To32(~bvadd64(~zero_extendFrom8To32(~bvadd64(~zero_extendFrom8To32(v_main_~c~0_66), 1bv32)[7:0]), 1bv32)[7:0]), 1bv32)[7:0]), 1bv32)[7:0]), 1bv32)[7:0] == c)) && 5bv8 == y)) || (((37bv8 == x && (\exists v_main_~c~0_40 : bv8 :: ~bvadd64(~zero_extendFrom8To32(v_main_~c~0_40), 1bv32)[7:0] == c && ~bvadd64(~zero_extendFrom8To32(~bvshl32(1bv32, ~zero_extendFrom8To32(v_main_~c~0_40))[7:0]), 5bv32)[7:0] == y)) && 32bv8 == bit) && (\exists v_main_~c~0_66 : bv8 :: ((((((((~bvadd64(~zero_extendFrom8To32(~bvadd64(~zero_extendFrom8To32(~bvadd64(~zero_extendFrom8To32(~bvadd64(~zero_extendFrom8To32(~bvadd64(~zero_extendFrom8To32(~bvadd64(~zero_extendFrom8To32(v_main_~c~0_66), 1bv32)[7:0]), 1bv32)[7:0]), 1bv32)[7:0]), 1bv32)[7:0]), 1bv32)[7:0]), 1bv32)[7:0] == c && ~zero_extendFrom8To32(~bvand32(~zero_extendFrom8To32(x), ~zero_extendFrom8To32(~bvshl32(1bv32, ~zero_extendFrom8To32(~bvadd64(~zero_extendFrom8To32(~bvadd64(~zero_extendFrom8To32(~bvadd64(~zero_extendFrom8To32(v_main_~c~0_66), 1bv32)[7:0]), 1bv32)[7:0]), 1bv32)[7:0]))[7:0]))[7:0]) == 0bv32) && ~bvslt32(~zero_extendFrom8To32(~bvadd64(~zero_extendFrom8To32(~bvadd64(~zero_extendFrom8To32(~bvadd64(~zero_extendFrom8To32(~bvadd64(~zero_extendFrom8To32(v_main_~c~0_66), 1bv32)[7:0]), 1bv32)[7:0]), 1bv32)[7:0]), 1bv32)[7:0]), 8bv32)) && ~bvslt32(~zero_extendFrom8To32(~bvadd64(~zero_extendFrom8To32(~bvadd64(~zero_extendFrom8To32(v_main_~c~0_66), 1bv32)[7:0]), 1bv32)[7:0]), 8bv32)) && ~bvslt32(~zero_extendFrom8To32(~bvadd64(~zero_extendFrom8To32(~bvadd64(~zero_extendFrom8To32(~bvadd64(~zero_extendFrom8To32(v_main_~c~0_66), 1bv32)[7:0]), 1bv32)[7:0]), 1bv32)[7:0]), 8bv32)) && ~bvslt32(~zero_extendFrom8To32(~bvadd64(~zero_extendFrom8To32(~bvadd64(~zero_extendFrom8To32(~bvadd64(~zero_extendFrom8To32(~bvadd64(~zero_extendFrom8To32(~bvadd64(~zero_extendFrom8To32(v_main_~c~0_66), 1bv32)[7:0]), 1bv32)[7:0]), 1bv32)[7:0]), 1bv32)[7:0]), 1bv32)[7:0]), 8bv32)) && !(~zero_extendFrom8To32(~bvand32(~zero_extendFrom8To32(x), ~zero_extendFrom8To32(~bvshl32(1bv32, ~zero_extendFrom8To32(v_main_~c~0_66))[7:0]))[7:0]) == 0bv32)) && 0bv32 == ~zero_extendFrom8To32(~bvand32(~zero_extendFrom8To32(x), ~zero_extendFrom8To32(~bvshl32(1bv32, ~zero_extendFrom8To32(~bvadd64(~zero_extendFrom8To32(~bvadd64(~zero_extendFrom8To32(~bvadd64(~zero_extendFrom8To32(~bvadd64(~zero_extendFrom8To32(v_main_~c~0_66), 1bv32)[7:0]), 1bv32)[7:0]), 1bv32)[7:0]), 1bv32)[7:0]))[7:0]))[7:0])) && 0bv32 == ~zero_extendFrom8To32(~bvand32(~zero_extendFrom8To32(x), ~zero_extendFrom8To32(~bvshl32(1bv32, ~zero_extendFrom8To32(~bvadd64(~zero_extendFrom8To32(v_main_~c~0_66), 1bv32)[7:0]))[7:0]))[7:0])) && ~bvslt32(~zero_extendFrom8To32(~bvadd64(~zero_extendFrom8To32(v_main_~c~0_66), 1bv32)[7:0]), 8bv32)))) || ((0bv8 == c && 37bv8 == x) && 0bv8 == y)) || (((37bv8 == x && !(~zero_extendFrom8To32(bit) == 0bv32)) && 5bv8 == y) && 3bv8 == c)) || (((37bv8 == x && (\exists v_main_~c~0_40 : bv8 :: (~bvadd64(~zero_extendFrom8To32(~bvshl32(1bv32, ~zero_extendFrom8To32(v_main_~c~0_40))[7:0]), 5bv32)[7:0] == y && c == ~bvadd64(~zero_extendFrom8To32(~bvadd64(~zero_extendFrom8To32(~bvadd64(~zero_extendFrom8To32(v_main_~c~0_40), 1bv32)[7:0]), 1bv32)[7:0]), 1bv32)[7:0]) && ~bvslt32(~zero_extendFrom8To32(~bvadd64(~zero_extendFrom8To32(~bvadd64(~zero_extendFrom8To32(v_main_~c~0_40), 1bv32)[7:0]), 1bv32)[7:0]), 8bv32))) && 0bv8 == bit) && (\exists main_~x~0 : bv8, v_main_~c~0_66 : bv8 :: ((((((((((((~zero_extendFrom8To32(~bvand32(~zero_extendFrom8To32(main_~x~0), ~zero_extendFrom8To32(~bvshl32(1bv32, ~zero_extendFrom8To32(~bvadd64(~zero_extendFrom8To32(~bvadd64(~zero_extendFrom8To32(~bvadd64(~zero_extendFrom8To32(v_main_~c~0_66), 1bv32)[7:0]), 1bv32)[7:0]), 1bv32)[7:0]))[7:0]))[7:0]) == 0bv32 && ~bvslt32(~zero_extendFrom8To32(~bvadd64(~zero_extendFrom8To32(~bvadd64(~zero_extendFrom8To32(~bvadd64(~zero_extendFrom8To32(~bvadd64(~zero_extendFrom8To32(v_main_~c~0_66), 1bv32)[7:0]), 1bv32)[7:0]), 1bv32)[7:0]), 1bv32)[7:0]), 8bv32)) && ~bvslt32(~zero_extendFrom8To32(~bvadd64(~zero_extendFrom8To32(~bvadd64(~zero_extendFrom8To32(~bvadd64(~zero_extendFrom8To32(~bvadd64(~zero_extendFrom8To32(~bvadd64(~zero_extendFrom8To32(~bvadd64(~zero_extendFrom8To32(~bvadd64(~zero_extendFrom8To32(v_main_~c~0_66), 1bv32)[7:0]), 1bv32)[7:0]), 1bv32)[7:0]), 1bv32)[7:0]), 1bv32)[7:0]), 1bv32)[7:0]), 1bv32)[7:0]), 8bv32)) && ~zero_extendFrom8To32(~bvand32(~zero_extendFrom8To32(main_~x~0), ~zero_extendFrom8To32(~bvshl32(1bv32, ~zero_extendFrom8To32(~bvadd64(~zero_extendFrom8To32(~bvadd64(~zero_extendFrom8To32(~bvadd64(~zero_extendFrom8To32(~bvadd64(~zero_extendFrom8To32(~bvadd64(~zero_extendFrom8To32(~bvadd64(~zero_extendFrom8To32(v_main_~c~0_66), 1bv32)[7:0]), 1bv32)[7:0]), 1bv32)[7:0]), 1bv32)[7:0]), 1bv32)[7:0]), 1bv32)[7:0]))[7:0]))[7:0]) == 0bv32) && ~bvadd64(~zero_extendFrom8To32(~bvadd64(~zero_extendFrom8To32(~bvadd64(~zero_extendFrom8To32(~bvadd64(~zero_extendFrom8To32(~bvadd64(~zero_extendFrom8To32(~bvadd64(~zero_extendFrom8To32(~bvadd64(~zero_extendFrom8To32(~bvadd64(~zero_extendFrom8To32(v_main_~c~0_66), 1bv32)[7:0]), 1bv32)[7:0]), 1bv32)[7:0]), 1bv32)[7:0]), 1bv32)[7:0]), 1bv32)[7:0]), 1bv32)[7:0]), 1bv32)[7:0] == c) && ~bvslt32(~zero_extendFrom8To32(~bvadd64(~zero_extendFrom8To32(~bvadd64(~zero_extendFrom8To32(v_main_~c~0_66), 1bv32)[7:0]), 1bv32)[7:0]), 8bv32)) && ~bvslt32(~zero_extendFrom8To32(~bvadd64(~zero_extendFrom8To32(~bvadd64(~zero_extendFrom8To32(~bvadd64(~zero_extendFrom8To32(v_main_~c~0_66), 1bv32)[7:0]), 1bv32)[7:0]), 1bv32)[7:0]), 8bv32)) && ~bvslt32(~zero_extendFrom8To32(~bvadd64(~zero_extendFrom8To32(~bvadd64(~zero_extendFrom8To32(~bvadd64(~zero_extendFrom8To32(~bvadd64(~zero_extendFrom8To32(~bvadd64(~zero_extendFrom8To32(v_main_~c~0_66), 1bv32)[7:0]), 1bv32)[7:0]), 1bv32)[7:0]), 1bv32)[7:0]), 1bv32)[7:0]), 8bv32)) && !(~zero_extendFrom8To32(~bvand32(~zero_extendFrom8To32(main_~x~0), ~zero_extendFrom8To32(~bvshl32(1bv32, ~zero_extendFrom8To32(v_main_~c~0_66))[7:0]))[7:0]) == 0bv32)) && 0bv32 == ~zero_extendFrom8To32(~bvand32(~zero_extendFrom8To32(main_~x~0), ~zero_extendFrom8To32(~bvshl32(1bv32, ~zero_extendFrom8To32(~bvadd64(~zero_extendFrom8To32(~bvadd64(~zero_extendFrom8To32(~bvadd64(~zero_extendFrom8To32(~bvadd64(~zero_extendFrom8To32(v_main_~c~0_66), 1bv32)[7:0]), 1bv32)[7:0]), 1bv32)[7:0]), 1bv32)[7:0]))[7:0]))[7:0])) && 0bv32 == ~zero_extendFrom8To32(~bvand32(~zero_extendFrom8To32(main_~x~0), ~zero_extendFrom8To32(~bvshl32(1bv32, ~zero_extendFrom8To32(~bvadd64(~zero_extendFrom8To32(~bvadd64(~zero_extendFrom8To32(~bvadd64(~zero_extendFrom8To32(~bvadd64(~zero_extendFrom8To32(~bvadd64(~zero_extendFrom8To32(~bvadd64(~zero_extendFrom8To32(~bvadd64(~zero_extendFrom8To32(v_main_~c~0_66), 1bv32)[7:0]), 1bv32)[7:0]), 1bv32)[7:0]), 1bv32)[7:0]), 1bv32)[7:0]), 1bv32)[7:0]), 1bv32)[7:0]))[7:0]))[7:0])) && 0bv32 == ~zero_extendFrom8To32(~bvand32(~zero_extendFrom8To32(main_~x~0), ~zero_extendFrom8To32(~bvshl32(1bv32, ~zero_extendFrom8To32(~bvadd64(~zero_extendFrom8To32(v_main_~c~0_66), 1bv32)[7:0]))[7:0]))[7:0])) && ~bvslt32(~zero_extendFrom8To32(~bvadd64(~zero_extendFrom8To32(~bvadd64(~zero_extendFrom8To32(~bvadd64(~zero_extendFrom8To32(~bvadd64(~zero_extendFrom8To32(~bvadd64(~zero_extendFrom8To32(~bvadd64(~zero_extendFrom8To32(v_main_~c~0_66), 1bv32)[7:0]), 1bv32)[7:0]), 1bv32)[7:0]), 1bv32)[7:0]), 1bv32)[7:0]), 1bv32)[7:0]), 8bv32)) && ~bvslt32(~zero_extendFrom8To32(~bvadd64(~zero_extendFrom8To32(v_main_~c~0_66), 1bv32)[7:0]), 8bv32))) [2018-11-23 05:43:13,823 INFO L145 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/working_dir_4becc31a-4406-42a9-ae1e-b055b76278dc/bin-2019/uautomizer/witness.graphml [2018-11-23 05:43:13,823 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-11-23 05:43:13,824 INFO L168 Benchmark]: Toolchain (without parser) took 18197.40 ms. Allocated memory was 1.0 GB in the beginning and 1.3 GB in the end (delta: 319.3 MB). Free memory was 948.6 MB in the beginning and 1.3 GB in the end (delta: -325.4 MB). There was no memory consumed. Max. memory is 11.5 GB. [2018-11-23 05:43:13,824 INFO L168 Benchmark]: CDTParser took 0.14 ms. Allocated memory is still 1.0 GB. Free memory is still 978.7 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-23 05:43:13,825 INFO L168 Benchmark]: CACSL2BoogieTranslator took 202.78 ms. Allocated memory is still 1.0 GB. Free memory was 948.6 MB in the beginning and 937.9 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. [2018-11-23 05:43:13,825 INFO L168 Benchmark]: Boogie Procedure Inliner took 19.49 ms. Allocated memory is still 1.0 GB. Free memory was 937.9 MB in the beginning and 932.5 MB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. [2018-11-23 05:43:13,826 INFO L168 Benchmark]: Boogie Preprocessor took 20.38 ms. Allocated memory is still 1.0 GB. Free memory is still 932.5 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-23 05:43:13,826 INFO L168 Benchmark]: RCFGBuilder took 213.88 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 143.7 MB). Free memory was 932.5 MB in the beginning and 1.1 GB in the end (delta: -191.5 MB). Peak memory consumption was 19.9 MB. Max. memory is 11.5 GB. [2018-11-23 05:43:13,826 INFO L168 Benchmark]: TraceAbstraction took 17681.43 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 175.6 MB). Free memory was 1.1 GB in the beginning and 1.3 GB in the end (delta: -159.7 MB). Peak memory consumption was 431.5 MB. Max. memory is 11.5 GB. [2018-11-23 05:43:13,827 INFO L168 Benchmark]: Witness Printer took 55.56 ms. Allocated memory is still 1.3 GB. Free memory was 1.3 GB in the beginning and 1.3 GB in the end (delta: 9.7 MB). Peak memory consumption was 9.7 MB. Max. memory is 11.5 GB. [2018-11-23 05:43:13,830 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.14 ms. Allocated memory is still 1.0 GB. Free memory is still 978.7 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 202.78 ms. Allocated memory is still 1.0 GB. Free memory was 948.6 MB in the beginning and 937.9 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 19.49 ms. Allocated memory is still 1.0 GB. Free memory was 937.9 MB in the beginning and 932.5 MB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 20.38 ms. Allocated memory is still 1.0 GB. Free memory is still 932.5 MB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 213.88 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 143.7 MB). Free memory was 932.5 MB in the beginning and 1.1 GB in the end (delta: -191.5 MB). Peak memory consumption was 19.9 MB. Max. memory is 11.5 GB. * TraceAbstraction took 17681.43 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 175.6 MB). Free memory was 1.1 GB in the beginning and 1.3 GB in the end (delta: -159.7 MB). Peak memory consumption was 431.5 MB. Max. memory is 11.5 GB. * Witness Printer took 55.56 ms. Allocated memory is still 1.3 GB. Free memory was 1.3 GB in the beginning and 1.3 GB in the end (delta: 9.7 MB). Peak memory consumption was 9.7 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.boogie.preprocessor: - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~c~0_40,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~c~0_40,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~c~0_66,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~c~0_66,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~c~0_66,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~c~0_66,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~c~0_66,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~c~0_66,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~c~0_66,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~c~0_66,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~c~0_66,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~c~0_66,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~c~0_66,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~c~0_66,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~c~0_66,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~c~0_66,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~c~0_66,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~c~0_66,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~c~0_66,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~c~0_66,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~c~0_66,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~c~0_66,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~c~0_66,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~c~0_40,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~c~0_40,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~c~0_66,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~c~0_66,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~c~0_66,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~c~0_66,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~c~0_66,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~c~0_66,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~c~0_66,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~c~0_66,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~c~0_66,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~c~0_66,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~c~0_40,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~c~0_40,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~c~0_40,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~x~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~c~0_66,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~c~0_66,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~c~0_66,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~x~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~c~0_66,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~c~0_66,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~c~0_66,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~c~0_66,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~c~0_66,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~x~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~c~0_66,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~x~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~c~0_66,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~x~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~c~0_66,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~x~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~c~0_66,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~c~0_66,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~c~0_66,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~c~0_40,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~c~0_40,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~c~0_66,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~c~0_66,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~c~0_66,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~c~0_66,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~c~0_66,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~c~0_66,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~c~0_66,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~c~0_66,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~c~0_66,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~c~0_66,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~c~0_66,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~c~0_66,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~c~0_66,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~c~0_66,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~c~0_66,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~c~0_66,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~c~0_66,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~c~0_66,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~c~0_66,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~c~0_66,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~c~0_66,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~c~0_40,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~c~0_40,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~c~0_66,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~c~0_66,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~c~0_66,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~c~0_66,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~c~0_66,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~c~0_66,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~c~0_66,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~c~0_66,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~c~0_66,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~c~0_66,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~c~0_40,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~c~0_40,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~c~0_40,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~x~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~c~0_66,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~c~0_66,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~c~0_66,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~x~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~c~0_66,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~c~0_66,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~c~0_66,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~c~0_66,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~c~0_66,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~x~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~c~0_66,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~x~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~c~0_66,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~x~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~c~0_66,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~x~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~c~0_66,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~c~0_66,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~c~0_66,QUANTIFIED] * 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: 21]: Loop Invariant [2018-11-23 05:43:13,837 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~c~0_40,QUANTIFIED] [2018-11-23 05:43:13,837 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~c~0_40,QUANTIFIED] [2018-11-23 05:43:13,837 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~c~0_66,QUANTIFIED] [2018-11-23 05:43:13,837 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~c~0_66,QUANTIFIED] [2018-11-23 05:43:13,838 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~c~0_66,QUANTIFIED] [2018-11-23 05:43:13,838 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~c~0_66,QUANTIFIED] [2018-11-23 05:43:13,838 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~c~0_66,QUANTIFIED] [2018-11-23 05:43:13,839 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~c~0_66,QUANTIFIED] [2018-11-23 05:43:13,839 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~c~0_66,QUANTIFIED] [2018-11-23 05:43:13,839 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~c~0_66,QUANTIFIED] [2018-11-23 05:43:13,839 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~c~0_66,QUANTIFIED] [2018-11-23 05:43:13,840 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~c~0_66,QUANTIFIED] [2018-11-23 05:43:13,840 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~c~0_66,QUANTIFIED] [2018-11-23 05:43:13,840 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~c~0_66,QUANTIFIED] [2018-11-23 05:43:13,841 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~c~0_66,QUANTIFIED] [2018-11-23 05:43:13,841 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~c~0_66,QUANTIFIED] [2018-11-23 05:43:13,841 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~c~0_66,QUANTIFIED] [2018-11-23 05:43:13,841 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~c~0_66,QUANTIFIED] [2018-11-23 05:43:13,842 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~c~0_66,QUANTIFIED] [2018-11-23 05:43:13,842 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~c~0_66,QUANTIFIED] [2018-11-23 05:43:13,842 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~c~0_66,QUANTIFIED] [2018-11-23 05:43:13,842 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~c~0_66,QUANTIFIED] [2018-11-23 05:43:13,842 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~c~0_66,QUANTIFIED] [2018-11-23 05:43:13,843 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~c~0_40,QUANTIFIED] [2018-11-23 05:43:13,843 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~c~0_40,QUANTIFIED] [2018-11-23 05:43:13,843 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~c~0_66,QUANTIFIED] [2018-11-23 05:43:13,843 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~c~0_66,QUANTIFIED] [2018-11-23 05:43:13,843 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~c~0_66,QUANTIFIED] [2018-11-23 05:43:13,844 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~c~0_66,QUANTIFIED] [2018-11-23 05:43:13,844 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~c~0_66,QUANTIFIED] [2018-11-23 05:43:13,844 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~c~0_66,QUANTIFIED] [2018-11-23 05:43:13,844 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~c~0_66,QUANTIFIED] [2018-11-23 05:43:13,845 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~c~0_66,QUANTIFIED] [2018-11-23 05:43:13,845 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~c~0_66,QUANTIFIED] [2018-11-23 05:43:13,845 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~c~0_66,QUANTIFIED] [2018-11-23 05:43:13,845 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~c~0_40,QUANTIFIED] [2018-11-23 05:43:13,845 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~c~0_40,QUANTIFIED] [2018-11-23 05:43:13,845 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~c~0_40,QUANTIFIED] [2018-11-23 05:43:13,846 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~x~0,QUANTIFIED] [2018-11-23 05:43:13,846 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~c~0_66,QUANTIFIED] [2018-11-23 05:43:13,846 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~c~0_66,QUANTIFIED] [2018-11-23 05:43:13,846 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~c~0_66,QUANTIFIED] [2018-11-23 05:43:13,847 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~x~0,QUANTIFIED] [2018-11-23 05:43:13,847 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~c~0_66,QUANTIFIED] [2018-11-23 05:43:13,847 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~c~0_66,QUANTIFIED] [2018-11-23 05:43:13,847 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~c~0_66,QUANTIFIED] [2018-11-23 05:43:13,848 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~c~0_66,QUANTIFIED] [2018-11-23 05:43:13,848 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~c~0_66,QUANTIFIED] [2018-11-23 05:43:13,848 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~x~0,QUANTIFIED] [2018-11-23 05:43:13,848 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~c~0_66,QUANTIFIED] [2018-11-23 05:43:13,848 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~x~0,QUANTIFIED] [2018-11-23 05:43:13,849 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~c~0_66,QUANTIFIED] [2018-11-23 05:43:13,849 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~x~0,QUANTIFIED] [2018-11-23 05:43:13,849 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~c~0_66,QUANTIFIED] [2018-11-23 05:43:13,849 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~x~0,QUANTIFIED] [2018-11-23 05:43:13,849 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~c~0_66,QUANTIFIED] [2018-11-23 05:43:13,850 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~c~0_66,QUANTIFIED] [2018-11-23 05:43:13,850 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~c~0_66,QUANTIFIED] [2018-11-23 05:43:13,852 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~c~0_40,QUANTIFIED] [2018-11-23 05:43:13,852 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~c~0_40,QUANTIFIED] [2018-11-23 05:43:13,852 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~c~0_66,QUANTIFIED] [2018-11-23 05:43:13,853 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~c~0_66,QUANTIFIED] [2018-11-23 05:43:13,853 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~c~0_66,QUANTIFIED] [2018-11-23 05:43:13,853 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~c~0_66,QUANTIFIED] [2018-11-23 05:43:13,853 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~c~0_66,QUANTIFIED] [2018-11-23 05:43:13,854 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~c~0_66,QUANTIFIED] [2018-11-23 05:43:13,854 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~c~0_66,QUANTIFIED] [2018-11-23 05:43:13,854 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~c~0_66,QUANTIFIED] [2018-11-23 05:43:13,855 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~c~0_66,QUANTIFIED] [2018-11-23 05:43:13,855 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~c~0_66,QUANTIFIED] [2018-11-23 05:43:13,855 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~c~0_66,QUANTIFIED] [2018-11-23 05:43:13,855 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~c~0_66,QUANTIFIED] [2018-11-23 05:43:13,856 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~c~0_66,QUANTIFIED] [2018-11-23 05:43:13,856 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~c~0_66,QUANTIFIED] [2018-11-23 05:43:13,856 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~c~0_66,QUANTIFIED] [2018-11-23 05:43:13,856 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~c~0_66,QUANTIFIED] [2018-11-23 05:43:13,857 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~c~0_66,QUANTIFIED] [2018-11-23 05:43:13,857 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~c~0_66,QUANTIFIED] [2018-11-23 05:43:13,857 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~c~0_66,QUANTIFIED] [2018-11-23 05:43:13,857 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~c~0_66,QUANTIFIED] [2018-11-23 05:43:13,857 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~c~0_66,QUANTIFIED] [2018-11-23 05:43:13,858 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~c~0_40,QUANTIFIED] [2018-11-23 05:43:13,858 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~c~0_40,QUANTIFIED] [2018-11-23 05:43:13,858 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~c~0_66,QUANTIFIED] [2018-11-23 05:43:13,858 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~c~0_66,QUANTIFIED] [2018-11-23 05:43:13,858 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~c~0_66,QUANTIFIED] [2018-11-23 05:43:13,859 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~c~0_66,QUANTIFIED] [2018-11-23 05:43:13,859 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~c~0_66,QUANTIFIED] [2018-11-23 05:43:13,859 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~c~0_66,QUANTIFIED] [2018-11-23 05:43:13,859 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~c~0_66,QUANTIFIED] [2018-11-23 05:43:13,859 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~c~0_66,QUANTIFIED] [2018-11-23 05:43:13,860 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~c~0_66,QUANTIFIED] [2018-11-23 05:43:13,860 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~c~0_66,QUANTIFIED] [2018-11-23 05:43:13,860 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~c~0_40,QUANTIFIED] [2018-11-23 05:43:13,860 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~c~0_40,QUANTIFIED] [2018-11-23 05:43:13,860 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~c~0_40,QUANTIFIED] [2018-11-23 05:43:13,861 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~x~0,QUANTIFIED] [2018-11-23 05:43:13,861 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~c~0_66,QUANTIFIED] [2018-11-23 05:43:13,861 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~c~0_66,QUANTIFIED] [2018-11-23 05:43:13,861 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~c~0_66,QUANTIFIED] [2018-11-23 05:43:13,862 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~x~0,QUANTIFIED] [2018-11-23 05:43:13,862 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~c~0_66,QUANTIFIED] [2018-11-23 05:43:13,862 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~c~0_66,QUANTIFIED] [2018-11-23 05:43:13,862 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~c~0_66,QUANTIFIED] [2018-11-23 05:43:13,863 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~c~0_66,QUANTIFIED] [2018-11-23 05:43:13,863 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~c~0_66,QUANTIFIED] [2018-11-23 05:43:13,863 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~x~0,QUANTIFIED] [2018-11-23 05:43:13,863 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~c~0_66,QUANTIFIED] [2018-11-23 05:43:13,863 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~x~0,QUANTIFIED] [2018-11-23 05:43:13,863 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~c~0_66,QUANTIFIED] [2018-11-23 05:43:13,864 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~x~0,QUANTIFIED] [2018-11-23 05:43:13,864 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~c~0_66,QUANTIFIED] [2018-11-23 05:43:13,864 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~x~0,QUANTIFIED] [2018-11-23 05:43:13,864 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~c~0_66,QUANTIFIED] [2018-11-23 05:43:13,864 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~c~0_66,QUANTIFIED] [2018-11-23 05:43:13,865 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~c~0_66,QUANTIFIED] Derived loop invariant: ((((((((((37bv8 == x && 0bv8 == bit) && (\exists v_main_~c~0_40 : bv8 :: ~bvadd64(~zero_extendFrom8To32(~bvshl32(1bv32, ~zero_extendFrom8To32(v_main_~c~0_40))[7:0]), 5bv32)[7:0] == y && c == ~bvadd64(~zero_extendFrom8To32(~bvadd64(~zero_extendFrom8To32(v_main_~c~0_40), 1bv32)[7:0]), 1bv32)[7:0])) && (\exists v_main_~c~0_66 : bv8 :: ((((((((((~zero_extendFrom8To32(~bvand32(~zero_extendFrom8To32(x), ~zero_extendFrom8To32(~bvshl32(1bv32, ~zero_extendFrom8To32(~bvadd64(~zero_extendFrom8To32(~bvadd64(~zero_extendFrom8To32(~bvadd64(~zero_extendFrom8To32(v_main_~c~0_66), 1bv32)[7:0]), 1bv32)[7:0]), 1bv32)[7:0]))[7:0]))[7:0]) == 0bv32 && ~bvslt32(~zero_extendFrom8To32(~bvadd64(~zero_extendFrom8To32(~bvadd64(~zero_extendFrom8To32(~bvadd64(~zero_extendFrom8To32(~bvadd64(~zero_extendFrom8To32(v_main_~c~0_66), 1bv32)[7:0]), 1bv32)[7:0]), 1bv32)[7:0]), 1bv32)[7:0]), 8bv32)) && ~bvslt32(~zero_extendFrom8To32(~bvadd64(~zero_extendFrom8To32(~bvadd64(~zero_extendFrom8To32(v_main_~c~0_66), 1bv32)[7:0]), 1bv32)[7:0]), 8bv32)) && ~bvadd64(~zero_extendFrom8To32(~bvadd64(~zero_extendFrom8To32(~bvadd64(~zero_extendFrom8To32(~bvadd64(~zero_extendFrom8To32(~bvadd64(~zero_extendFrom8To32(~bvadd64(~zero_extendFrom8To32(~bvadd64(~zero_extendFrom8To32(v_main_~c~0_66), 1bv32)[7:0]), 1bv32)[7:0]), 1bv32)[7:0]), 1bv32)[7:0]), 1bv32)[7:0]), 1bv32)[7:0]), 1bv32)[7:0] == c) && ~bvslt32(~zero_extendFrom8To32(~bvadd64(~zero_extendFrom8To32(~bvadd64(~zero_extendFrom8To32(~bvadd64(~zero_extendFrom8To32(v_main_~c~0_66), 1bv32)[7:0]), 1bv32)[7:0]), 1bv32)[7:0]), 8bv32)) && ~bvslt32(~zero_extendFrom8To32(~bvadd64(~zero_extendFrom8To32(~bvadd64(~zero_extendFrom8To32(~bvadd64(~zero_extendFrom8To32(~bvadd64(~zero_extendFrom8To32(~bvadd64(~zero_extendFrom8To32(v_main_~c~0_66), 1bv32)[7:0]), 1bv32)[7:0]), 1bv32)[7:0]), 1bv32)[7:0]), 1bv32)[7:0]), 8bv32)) && ~zero_extendFrom8To32(~bvand32(~zero_extendFrom8To32(x), ~zero_extendFrom8To32(~bvshl32(1bv32, ~zero_extendFrom8To32(~bvadd64(~zero_extendFrom8To32(~bvadd64(~zero_extendFrom8To32(~bvadd64(~zero_extendFrom8To32(~bvadd64(~zero_extendFrom8To32(~bvadd64(~zero_extendFrom8To32(~bvadd64(~zero_extendFrom8To32(v_main_~c~0_66), 1bv32)[7:0]), 1bv32)[7:0]), 1bv32)[7:0]), 1bv32)[7:0]), 1bv32)[7:0]), 1bv32)[7:0]))[7:0]))[7:0]) == 0bv32) && !(~zero_extendFrom8To32(~bvand32(~zero_extendFrom8To32(x), ~zero_extendFrom8To32(~bvshl32(1bv32, ~zero_extendFrom8To32(v_main_~c~0_66))[7:0]))[7:0]) == 0bv32)) && 0bv32 == ~zero_extendFrom8To32(~bvand32(~zero_extendFrom8To32(x), ~zero_extendFrom8To32(~bvshl32(1bv32, ~zero_extendFrom8To32(~bvadd64(~zero_extendFrom8To32(~bvadd64(~zero_extendFrom8To32(~bvadd64(~zero_extendFrom8To32(~bvadd64(~zero_extendFrom8To32(v_main_~c~0_66), 1bv32)[7:0]), 1bv32)[7:0]), 1bv32)[7:0]), 1bv32)[7:0]))[7:0]))[7:0])) && 0bv32 == ~zero_extendFrom8To32(~bvand32(~zero_extendFrom8To32(x), ~zero_extendFrom8To32(~bvshl32(1bv32, ~zero_extendFrom8To32(~bvadd64(~zero_extendFrom8To32(v_main_~c~0_66), 1bv32)[7:0]))[7:0]))[7:0])) && ~bvslt32(~zero_extendFrom8To32(~bvadd64(~zero_extendFrom8To32(~bvadd64(~zero_extendFrom8To32(~bvadd64(~zero_extendFrom8To32(~bvadd64(~zero_extendFrom8To32(~bvadd64(~zero_extendFrom8To32(~bvadd64(~zero_extendFrom8To32(v_main_~c~0_66), 1bv32)[7:0]), 1bv32)[7:0]), 1bv32)[7:0]), 1bv32)[7:0]), 1bv32)[7:0]), 1bv32)[7:0]), 8bv32)) && ~bvslt32(~zero_extendFrom8To32(~bvadd64(~zero_extendFrom8To32(v_main_~c~0_66), 1bv32)[7:0]), 8bv32))) || (((37bv8 == x && 0bv8 == bit) && 5bv8 == y) && 4bv8 == c)) || (((37bv8 == x && 1bv8 == c) && !(~zero_extendFrom8To32(bit) == 0bv32)) && 1bv8 == y)) || (((37bv8 == x && 0bv8 == bit) && 1bv8 == y) && 2bv8 == c)) || (((0bv8 == bit && 37bv8 == x) && (\exists v_main_~c~0_66 : bv8 :: (((((((~zero_extendFrom8To32(~bvand32(~zero_extendFrom8To32(x), ~zero_extendFrom8To32(~bvshl32(1bv32, ~zero_extendFrom8To32(~bvadd64(~zero_extendFrom8To32(~bvadd64(~zero_extendFrom8To32(~bvadd64(~zero_extendFrom8To32(v_main_~c~0_66), 1bv32)[7:0]), 1bv32)[7:0]), 1bv32)[7:0]))[7:0]))[7:0]) == 0bv32 && ~bvslt32(~zero_extendFrom8To32(~bvadd64(~zero_extendFrom8To32(~bvadd64(~zero_extendFrom8To32(~bvadd64(~zero_extendFrom8To32(~bvadd64(~zero_extendFrom8To32(v_main_~c~0_66), 1bv32)[7:0]), 1bv32)[7:0]), 1bv32)[7:0]), 1bv32)[7:0]), 8bv32)) && ~bvslt32(~zero_extendFrom8To32(~bvadd64(~zero_extendFrom8To32(~bvadd64(~zero_extendFrom8To32(v_main_~c~0_66), 1bv32)[7:0]), 1bv32)[7:0]), 8bv32)) && ~bvslt32(~zero_extendFrom8To32(~bvadd64(~zero_extendFrom8To32(~bvadd64(~zero_extendFrom8To32(~bvadd64(~zero_extendFrom8To32(v_main_~c~0_66), 1bv32)[7:0]), 1bv32)[7:0]), 1bv32)[7:0]), 8bv32)) && !(~zero_extendFrom8To32(~bvand32(~zero_extendFrom8To32(x), ~zero_extendFrom8To32(~bvshl32(1bv32, ~zero_extendFrom8To32(v_main_~c~0_66))[7:0]))[7:0]) == 0bv32)) && 0bv32 == ~zero_extendFrom8To32(~bvand32(~zero_extendFrom8To32(x), ~zero_extendFrom8To32(~bvshl32(1bv32, ~zero_extendFrom8To32(~bvadd64(~zero_extendFrom8To32(~bvadd64(~zero_extendFrom8To32(~bvadd64(~zero_extendFrom8To32(~bvadd64(~zero_extendFrom8To32(v_main_~c~0_66), 1bv32)[7:0]), 1bv32)[7:0]), 1bv32)[7:0]), 1bv32)[7:0]))[7:0]))[7:0])) && 0bv32 == ~zero_extendFrom8To32(~bvand32(~zero_extendFrom8To32(x), ~zero_extendFrom8To32(~bvshl32(1bv32, ~zero_extendFrom8To32(~bvadd64(~zero_extendFrom8To32(v_main_~c~0_66), 1bv32)[7:0]))[7:0]))[7:0])) && ~bvslt32(~zero_extendFrom8To32(~bvadd64(~zero_extendFrom8To32(v_main_~c~0_66), 1bv32)[7:0]), 8bv32)) && ~bvadd64(~zero_extendFrom8To32(~bvadd64(~zero_extendFrom8To32(~bvadd64(~zero_extendFrom8To32(~bvadd64(~zero_extendFrom8To32(~bvadd64(~zero_extendFrom8To32(v_main_~c~0_66), 1bv32)[7:0]), 1bv32)[7:0]), 1bv32)[7:0]), 1bv32)[7:0]), 1bv32)[7:0] == c)) && 5bv8 == y)) || (((37bv8 == x && (\exists v_main_~c~0_40 : bv8 :: ~bvadd64(~zero_extendFrom8To32(v_main_~c~0_40), 1bv32)[7:0] == c && ~bvadd64(~zero_extendFrom8To32(~bvshl32(1bv32, ~zero_extendFrom8To32(v_main_~c~0_40))[7:0]), 5bv32)[7:0] == y)) && 32bv8 == bit) && (\exists v_main_~c~0_66 : bv8 :: ((((((((~bvadd64(~zero_extendFrom8To32(~bvadd64(~zero_extendFrom8To32(~bvadd64(~zero_extendFrom8To32(~bvadd64(~zero_extendFrom8To32(~bvadd64(~zero_extendFrom8To32(~bvadd64(~zero_extendFrom8To32(v_main_~c~0_66), 1bv32)[7:0]), 1bv32)[7:0]), 1bv32)[7:0]), 1bv32)[7:0]), 1bv32)[7:0]), 1bv32)[7:0] == c && ~zero_extendFrom8To32(~bvand32(~zero_extendFrom8To32(x), ~zero_extendFrom8To32(~bvshl32(1bv32, ~zero_extendFrom8To32(~bvadd64(~zero_extendFrom8To32(~bvadd64(~zero_extendFrom8To32(~bvadd64(~zero_extendFrom8To32(v_main_~c~0_66), 1bv32)[7:0]), 1bv32)[7:0]), 1bv32)[7:0]))[7:0]))[7:0]) == 0bv32) && ~bvslt32(~zero_extendFrom8To32(~bvadd64(~zero_extendFrom8To32(~bvadd64(~zero_extendFrom8To32(~bvadd64(~zero_extendFrom8To32(~bvadd64(~zero_extendFrom8To32(v_main_~c~0_66), 1bv32)[7:0]), 1bv32)[7:0]), 1bv32)[7:0]), 1bv32)[7:0]), 8bv32)) && ~bvslt32(~zero_extendFrom8To32(~bvadd64(~zero_extendFrom8To32(~bvadd64(~zero_extendFrom8To32(v_main_~c~0_66), 1bv32)[7:0]), 1bv32)[7:0]), 8bv32)) && ~bvslt32(~zero_extendFrom8To32(~bvadd64(~zero_extendFrom8To32(~bvadd64(~zero_extendFrom8To32(~bvadd64(~zero_extendFrom8To32(v_main_~c~0_66), 1bv32)[7:0]), 1bv32)[7:0]), 1bv32)[7:0]), 8bv32)) && ~bvslt32(~zero_extendFrom8To32(~bvadd64(~zero_extendFrom8To32(~bvadd64(~zero_extendFrom8To32(~bvadd64(~zero_extendFrom8To32(~bvadd64(~zero_extendFrom8To32(~bvadd64(~zero_extendFrom8To32(v_main_~c~0_66), 1bv32)[7:0]), 1bv32)[7:0]), 1bv32)[7:0]), 1bv32)[7:0]), 1bv32)[7:0]), 8bv32)) && !(~zero_extendFrom8To32(~bvand32(~zero_extendFrom8To32(x), ~zero_extendFrom8To32(~bvshl32(1bv32, ~zero_extendFrom8To32(v_main_~c~0_66))[7:0]))[7:0]) == 0bv32)) && 0bv32 == ~zero_extendFrom8To32(~bvand32(~zero_extendFrom8To32(x), ~zero_extendFrom8To32(~bvshl32(1bv32, ~zero_extendFrom8To32(~bvadd64(~zero_extendFrom8To32(~bvadd64(~zero_extendFrom8To32(~bvadd64(~zero_extendFrom8To32(~bvadd64(~zero_extendFrom8To32(v_main_~c~0_66), 1bv32)[7:0]), 1bv32)[7:0]), 1bv32)[7:0]), 1bv32)[7:0]))[7:0]))[7:0])) && 0bv32 == ~zero_extendFrom8To32(~bvand32(~zero_extendFrom8To32(x), ~zero_extendFrom8To32(~bvshl32(1bv32, ~zero_extendFrom8To32(~bvadd64(~zero_extendFrom8To32(v_main_~c~0_66), 1bv32)[7:0]))[7:0]))[7:0])) && ~bvslt32(~zero_extendFrom8To32(~bvadd64(~zero_extendFrom8To32(v_main_~c~0_66), 1bv32)[7:0]), 8bv32)))) || ((0bv8 == c && 37bv8 == x) && 0bv8 == y)) || (((37bv8 == x && !(~zero_extendFrom8To32(bit) == 0bv32)) && 5bv8 == y) && 3bv8 == c)) || (((37bv8 == x && (\exists v_main_~c~0_40 : bv8 :: (~bvadd64(~zero_extendFrom8To32(~bvshl32(1bv32, ~zero_extendFrom8To32(v_main_~c~0_40))[7:0]), 5bv32)[7:0] == y && c == ~bvadd64(~zero_extendFrom8To32(~bvadd64(~zero_extendFrom8To32(~bvadd64(~zero_extendFrom8To32(v_main_~c~0_40), 1bv32)[7:0]), 1bv32)[7:0]), 1bv32)[7:0]) && ~bvslt32(~zero_extendFrom8To32(~bvadd64(~zero_extendFrom8To32(~bvadd64(~zero_extendFrom8To32(v_main_~c~0_40), 1bv32)[7:0]), 1bv32)[7:0]), 8bv32))) && 0bv8 == bit) && (\exists main_~x~0 : bv8, v_main_~c~0_66 : bv8 :: ((((((((((((~zero_extendFrom8To32(~bvand32(~zero_extendFrom8To32(main_~x~0), ~zero_extendFrom8To32(~bvshl32(1bv32, ~zero_extendFrom8To32(~bvadd64(~zero_extendFrom8To32(~bvadd64(~zero_extendFrom8To32(~bvadd64(~zero_extendFrom8To32(v_main_~c~0_66), 1bv32)[7:0]), 1bv32)[7:0]), 1bv32)[7:0]))[7:0]))[7:0]) == 0bv32 && ~bvslt32(~zero_extendFrom8To32(~bvadd64(~zero_extendFrom8To32(~bvadd64(~zero_extendFrom8To32(~bvadd64(~zero_extendFrom8To32(~bvadd64(~zero_extendFrom8To32(v_main_~c~0_66), 1bv32)[7:0]), 1bv32)[7:0]), 1bv32)[7:0]), 1bv32)[7:0]), 8bv32)) && ~bvslt32(~zero_extendFrom8To32(~bvadd64(~zero_extendFrom8To32(~bvadd64(~zero_extendFrom8To32(~bvadd64(~zero_extendFrom8To32(~bvadd64(~zero_extendFrom8To32(~bvadd64(~zero_extendFrom8To32(~bvadd64(~zero_extendFrom8To32(~bvadd64(~zero_extendFrom8To32(v_main_~c~0_66), 1bv32)[7:0]), 1bv32)[7:0]), 1bv32)[7:0]), 1bv32)[7:0]), 1bv32)[7:0]), 1bv32)[7:0]), 1bv32)[7:0]), 8bv32)) && ~zero_extendFrom8To32(~bvand32(~zero_extendFrom8To32(main_~x~0), ~zero_extendFrom8To32(~bvshl32(1bv32, ~zero_extendFrom8To32(~bvadd64(~zero_extendFrom8To32(~bvadd64(~zero_extendFrom8To32(~bvadd64(~zero_extendFrom8To32(~bvadd64(~zero_extendFrom8To32(~bvadd64(~zero_extendFrom8To32(~bvadd64(~zero_extendFrom8To32(v_main_~c~0_66), 1bv32)[7:0]), 1bv32)[7:0]), 1bv32)[7:0]), 1bv32)[7:0]), 1bv32)[7:0]), 1bv32)[7:0]))[7:0]))[7:0]) == 0bv32) && ~bvadd64(~zero_extendFrom8To32(~bvadd64(~zero_extendFrom8To32(~bvadd64(~zero_extendFrom8To32(~bvadd64(~zero_extendFrom8To32(~bvadd64(~zero_extendFrom8To32(~bvadd64(~zero_extendFrom8To32(~bvadd64(~zero_extendFrom8To32(~bvadd64(~zero_extendFrom8To32(v_main_~c~0_66), 1bv32)[7:0]), 1bv32)[7:0]), 1bv32)[7:0]), 1bv32)[7:0]), 1bv32)[7:0]), 1bv32)[7:0]), 1bv32)[7:0]), 1bv32)[7:0] == c) && ~bvslt32(~zero_extendFrom8To32(~bvadd64(~zero_extendFrom8To32(~bvadd64(~zero_extendFrom8To32(v_main_~c~0_66), 1bv32)[7:0]), 1bv32)[7:0]), 8bv32)) && ~bvslt32(~zero_extendFrom8To32(~bvadd64(~zero_extendFrom8To32(~bvadd64(~zero_extendFrom8To32(~bvadd64(~zero_extendFrom8To32(v_main_~c~0_66), 1bv32)[7:0]), 1bv32)[7:0]), 1bv32)[7:0]), 8bv32)) && ~bvslt32(~zero_extendFrom8To32(~bvadd64(~zero_extendFrom8To32(~bvadd64(~zero_extendFrom8To32(~bvadd64(~zero_extendFrom8To32(~bvadd64(~zero_extendFrom8To32(~bvadd64(~zero_extendFrom8To32(v_main_~c~0_66), 1bv32)[7:0]), 1bv32)[7:0]), 1bv32)[7:0]), 1bv32)[7:0]), 1bv32)[7:0]), 8bv32)) && !(~zero_extendFrom8To32(~bvand32(~zero_extendFrom8To32(main_~x~0), ~zero_extendFrom8To32(~bvshl32(1bv32, ~zero_extendFrom8To32(v_main_~c~0_66))[7:0]))[7:0]) == 0bv32)) && 0bv32 == ~zero_extendFrom8To32(~bvand32(~zero_extendFrom8To32(main_~x~0), ~zero_extendFrom8To32(~bvshl32(1bv32, ~zero_extendFrom8To32(~bvadd64(~zero_extendFrom8To32(~bvadd64(~zero_extendFrom8To32(~bvadd64(~zero_extendFrom8To32(~bvadd64(~zero_extendFrom8To32(v_main_~c~0_66), 1bv32)[7:0]), 1bv32)[7:0]), 1bv32)[7:0]), 1bv32)[7:0]))[7:0]))[7:0])) && 0bv32 == ~zero_extendFrom8To32(~bvand32(~zero_extendFrom8To32(main_~x~0), ~zero_extendFrom8To32(~bvshl32(1bv32, ~zero_extendFrom8To32(~bvadd64(~zero_extendFrom8To32(~bvadd64(~zero_extendFrom8To32(~bvadd64(~zero_extendFrom8To32(~bvadd64(~zero_extendFrom8To32(~bvadd64(~zero_extendFrom8To32(~bvadd64(~zero_extendFrom8To32(~bvadd64(~zero_extendFrom8To32(v_main_~c~0_66), 1bv32)[7:0]), 1bv32)[7:0]), 1bv32)[7:0]), 1bv32)[7:0]), 1bv32)[7:0]), 1bv32)[7:0]), 1bv32)[7:0]))[7:0]))[7:0])) && 0bv32 == ~zero_extendFrom8To32(~bvand32(~zero_extendFrom8To32(main_~x~0), ~zero_extendFrom8To32(~bvshl32(1bv32, ~zero_extendFrom8To32(~bvadd64(~zero_extendFrom8To32(v_main_~c~0_66), 1bv32)[7:0]))[7:0]))[7:0])) && ~bvslt32(~zero_extendFrom8To32(~bvadd64(~zero_extendFrom8To32(~bvadd64(~zero_extendFrom8To32(~bvadd64(~zero_extendFrom8To32(~bvadd64(~zero_extendFrom8To32(~bvadd64(~zero_extendFrom8To32(~bvadd64(~zero_extendFrom8To32(v_main_~c~0_66), 1bv32)[7:0]), 1bv32)[7:0]), 1bv32)[7:0]), 1bv32)[7:0]), 1bv32)[7:0]), 1bv32)[7:0]), 8bv32)) && ~bvslt32(~zero_extendFrom8To32(~bvadd64(~zero_extendFrom8To32(v_main_~c~0_66), 1bv32)[7:0]), 8bv32))) - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 20 locations, 1 error locations. SAFE Result, 17.5s OverallTime, 9 OverallIterations, 9 TraceHistogramMax, 8.1s AutomataDifference, 0.0s DeadEndRemovalTime, 1.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 132 SDtfs, 256 SDslu, 790 SDs, 0 SdLazy, 1346 SolverSat, 161 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 1.9s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 474 GetRequests, 280 SyntacticMatches, 2 SemanticMatches, 192 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1622 ImplicationChecksByTransitivity, 13.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=88occurred in iteration=7, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 9 MinimizatonAttempts, 49 StatesRemovedByMinimization, 5 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 7 LocationsWithAnnotation, 15 PreInvPairs, 25 NumberOfFragments, 1236 HoareAnnotationTreeSize, 15 FomulaSimplifications, 404 FormulaSimplificationTreeSizeReduction, 0.1s HoareSimplificationTime, 7 FomulaSimplificationsInter, 1184 FormulaSimplificationTreeSizeReductionInter, 0.9s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 7.6s InterpolantComputationTime, 216 NumberOfCodeBlocks, 206 NumberOfCodeBlocksAsserted, 27 NumberOfCheckSat, 396 ConstructedInterpolants, 46 QuantifiedInterpolants, 289788 SizeOfPredicates, 39 NumberOfNonLiveVariables, 393 ConjunctsInSsa, 90 ConjunctsInUnsatCore, 16 InterpolantComputations, 2 PerfectInterpolantSequences, 397/876 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...