./Ultimate.py --spec ../../sv-benchmarks/c/ReachSafety.prp --file ../../sv-benchmarks/c/bitvector/byte_add_false-unreach-call_true-no-overflow_true-termination.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 1dbac8bc Calling Ultimate with: java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_bb43665f-ba4e-4261-8e93-009ab10ba1c6/bin-2019/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_bb43665f-ba4e-4261-8e93-009ab10ba1c6/bin-2019/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_bb43665f-ba4e-4261-8e93-009ab10ba1c6/bin-2019/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_bb43665f-ba4e-4261-8e93-009ab10ba1c6/bin-2019/uautomizer/config/AutomizerReach.xml -i ../../sv-benchmarks/c/bitvector/byte_add_false-unreach-call_true-no-overflow_true-termination.i -s /tmp/vcloud-vcloud-master/worker/working_dir_bb43665f-ba4e-4261-8e93-009ab10ba1c6/bin-2019/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_bb43665f-ba4e-4261-8e93-009ab10ba1c6/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 a2c46755d0cb80f6b2e7b990e0a1bd9a49737b84 .......................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... 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_bb43665f-ba4e-4261-8e93-009ab10ba1c6/bin-2019/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_bb43665f-ba4e-4261-8e93-009ab10ba1c6/bin-2019/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_bb43665f-ba4e-4261-8e93-009ab10ba1c6/bin-2019/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_bb43665f-ba4e-4261-8e93-009ab10ba1c6/bin-2019/uautomizer/config/AutomizerReach.xml -i ../../sv-benchmarks/c/bitvector/byte_add_false-unreach-call_true-no-overflow_true-termination.i -s /tmp/vcloud-vcloud-master/worker/working_dir_bb43665f-ba4e-4261-8e93-009ab10ba1c6/bin-2019/uautomizer/config/svcomp-Reach-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_bb43665f-ba4e-4261-8e93-009ab10ba1c6/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 a2c46755d0cb80f6b2e7b990e0a1bd9a49737b84 .................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE --- Real Ultimate output --- This is Ultimate 0.1.23-1dbac8b [2018-11-10 12:55:43,355 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-10 12:55:43,357 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-10 12:55:43,365 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-10 12:55:43,366 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-10 12:55:43,366 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-10 12:55:43,367 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-10 12:55:43,368 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-10 12:55:43,369 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-10 12:55:43,370 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-10 12:55:43,371 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-10 12:55:43,371 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-10 12:55:43,372 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-10 12:55:43,372 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-10 12:55:43,373 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-10 12:55:43,374 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-10 12:55:43,374 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-10 12:55:43,375 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-10 12:55:43,377 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-10 12:55:43,378 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-10 12:55:43,378 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-10 12:55:43,379 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-10 12:55:43,381 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-10 12:55:43,381 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-10 12:55:43,381 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-10 12:55:43,382 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-10 12:55:43,383 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-10 12:55:43,383 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-10 12:55:43,384 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-10 12:55:43,385 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-10 12:55:43,385 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-10 12:55:43,385 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-10 12:55:43,385 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-10 12:55:43,386 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-10 12:55:43,386 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-10 12:55:43,386 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-10 12:55:43,387 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_bb43665f-ba4e-4261-8e93-009ab10ba1c6/bin-2019/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf [2018-11-10 12:55:43,397 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-10 12:55:43,397 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-10 12:55:43,398 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-10 12:55:43,398 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-11-10 12:55:43,399 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-10 12:55:43,399 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-10 12:55:43,399 INFO L133 SettingsManager]: * Use SBE=true [2018-11-10 12:55:43,399 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-10 12:55:43,399 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-10 12:55:43,399 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-10 12:55:43,399 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-10 12:55:43,400 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-10 12:55:43,400 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-10 12:55:43,400 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-10 12:55:43,400 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-10 12:55:43,400 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-10 12:55:43,400 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-10 12:55:43,400 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-10 12:55:43,400 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-10 12:55:43,401 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-10 12:55:43,401 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-10 12:55:43,401 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-10 12:55:43,401 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-10 12:55:43,401 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-10 12:55:43,401 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-10 12:55:43,401 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-10 12:55:43,401 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-11-10 12:55:43,402 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-10 12:55:43,402 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-11-10 12:55:43,402 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_bb43665f-ba4e-4261-8e93-009ab10ba1c6/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 -> a2c46755d0cb80f6b2e7b990e0a1bd9a49737b84 [2018-11-10 12:55:43,427 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-10 12:55:43,436 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-10 12:55:43,439 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-10 12:55:43,440 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-10 12:55:43,440 INFO L276 PluginConnector]: CDTParser initialized [2018-11-10 12:55:43,441 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_bb43665f-ba4e-4261-8e93-009ab10ba1c6/bin-2019/uautomizer/../../sv-benchmarks/c/bitvector/byte_add_false-unreach-call_true-no-overflow_true-termination.i [2018-11-10 12:55:43,485 INFO L218 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_bb43665f-ba4e-4261-8e93-009ab10ba1c6/bin-2019/uautomizer/data/ceb88cdbe/a57e7368126f4471978c369834ee11b5/FLAG697880913 [2018-11-10 12:55:43,794 INFO L298 CDTParser]: Found 1 translation units. [2018-11-10 12:55:43,795 INFO L158 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_bb43665f-ba4e-4261-8e93-009ab10ba1c6/sv-benchmarks/c/bitvector/byte_add_false-unreach-call_true-no-overflow_true-termination.i [2018-11-10 12:55:43,800 INFO L346 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_bb43665f-ba4e-4261-8e93-009ab10ba1c6/bin-2019/uautomizer/data/ceb88cdbe/a57e7368126f4471978c369834ee11b5/FLAG697880913 [2018-11-10 12:55:43,808 INFO L354 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_bb43665f-ba4e-4261-8e93-009ab10ba1c6/bin-2019/uautomizer/data/ceb88cdbe/a57e7368126f4471978c369834ee11b5 [2018-11-10 12:55:43,810 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-10 12:55:43,811 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2018-11-10 12:55:43,812 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-10 12:55:43,812 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-10 12:55:43,815 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-10 12:55:43,815 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 12:55:43" (1/1) ... [2018-11-10 12:55:43,817 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1dc2202b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 12:55:43, skipping insertion in model container [2018-11-10 12:55:43,818 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 12:55:43" (1/1) ... [2018-11-10 12:55:43,824 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-10 12:55:43,842 INFO L174 MainTranslator]: Built tables and reachable declarations [2018-11-10 12:55:43,948 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-11-10 12:55:43,950 INFO L189 MainTranslator]: Completed pre-run [2018-11-10 12:55:43,973 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-11-10 12:55:43,984 INFO L193 MainTranslator]: Completed translation [2018-11-10 12:55:43,984 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 12:55:43 WrapperNode [2018-11-10 12:55:43,984 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-10 12:55:43,985 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-10 12:55:43,985 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-10 12:55:43,985 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-10 12:55:43,993 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 12:55:43" (1/1) ... [2018-11-10 12:55:43,993 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 12:55:43" (1/1) ... [2018-11-10 12:55:43,998 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 12:55:43" (1/1) ... [2018-11-10 12:55:43,998 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 12:55:43" (1/1) ... [2018-11-10 12:55:44,002 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 12:55:43" (1/1) ... [2018-11-10 12:55:44,008 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 12:55:43" (1/1) ... [2018-11-10 12:55:44,009 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 12:55:43" (1/1) ... [2018-11-10 12:55:44,011 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-10 12:55:44,011 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-10 12:55:44,011 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-10 12:55:44,011 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-10 12:55:44,012 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 12:55:43" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_bb43665f-ba4e-4261-8e93-009ab10ba1c6/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-10 12:55:44,083 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-10 12:55:44,083 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-10 12:55:44,083 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2018-11-10 12:55:44,084 INFO L138 BoogieDeclarations]: Found implementation of procedure mp_add [2018-11-10 12:55:44,084 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-10 12:55:44,084 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2018-11-10 12:55:44,084 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_uint [2018-11-10 12:55:44,084 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2018-11-10 12:55:44,084 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2018-11-10 12:55:44,084 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_perror_fail [2018-11-10 12:55:44,084 INFO L130 BoogieDeclarations]: Found specification of procedure __assert [2018-11-10 12:55:44,084 INFO L130 BoogieDeclarations]: Found specification of procedure mp_add [2018-11-10 12:55:44,084 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-10 12:55:44,084 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-10 12:55:44,085 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-10 12:55:44,289 INFO L341 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-10 12:55:44,289 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.11 12:55:44 BoogieIcfgContainer [2018-11-10 12:55:44,289 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-10 12:55:44,290 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-10 12:55:44,290 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-10 12:55:44,293 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-10 12:55:44,293 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.11 12:55:43" (1/3) ... [2018-11-10 12:55:44,294 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1e418615 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.11 12:55:44, skipping insertion in model container [2018-11-10 12:55:44,294 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 12:55:43" (2/3) ... [2018-11-10 12:55:44,294 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1e418615 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.11 12:55:44, skipping insertion in model container [2018-11-10 12:55:44,294 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.11 12:55:44" (3/3) ... [2018-11-10 12:55:44,296 INFO L112 eAbstractionObserver]: Analyzing ICFG byte_add_false-unreach-call_true-no-overflow_true-termination.i [2018-11-10 12:55:44,302 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-10 12:55:44,307 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-11-10 12:55:44,319 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-11-10 12:55:44,338 INFO L135 ementStrategyFactory]: Using default assertion order modulation [2018-11-10 12:55:44,339 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-10 12:55:44,339 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-10 12:55:44,339 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-10 12:55:44,339 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-10 12:55:44,339 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-10 12:55:44,339 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-10 12:55:44,339 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-10 12:55:44,339 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-10 12:55:44,350 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states. [2018-11-10 12:55:44,354 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2018-11-10 12:55:44,354 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 12:55:44,355 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 12:55:44,357 INFO L424 AbstractCegarLoop]: === Iteration 1 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 12:55:44,361 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 12:55:44,361 INFO L82 PathProgramCache]: Analyzing trace with hash -486194587, now seen corresponding path program 1 times [2018-11-10 12:55:44,363 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 12:55:44,363 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 12:55:44,396 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 12:55:44,396 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 12:55:44,396 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 12:55:44,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 12:55:44,445 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-10 12:55:44,447 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 12:55:44,447 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-10 12:55:44,451 INFO L460 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-11-10 12:55:44,462 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-11-10 12:55:44,462 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-11-10 12:55:44,464 INFO L87 Difference]: Start difference. First operand 56 states. Second operand 2 states. [2018-11-10 12:55:44,479 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 12:55:44,479 INFO L93 Difference]: Finished difference Result 79 states and 115 transitions. [2018-11-10 12:55:44,479 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-11-10 12:55:44,480 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 21 [2018-11-10 12:55:44,480 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 12:55:44,486 INFO L225 Difference]: With dead ends: 79 [2018-11-10 12:55:44,486 INFO L226 Difference]: Without dead ends: 49 [2018-11-10 12:55:44,488 INFO L605 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-10 12:55:44,498 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2018-11-10 12:55:44,509 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 49. [2018-11-10 12:55:44,510 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 49 states. [2018-11-10 12:55:44,511 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 75 transitions. [2018-11-10 12:55:44,512 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 75 transitions. Word has length 21 [2018-11-10 12:55:44,512 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 12:55:44,512 INFO L481 AbstractCegarLoop]: Abstraction has 49 states and 75 transitions. [2018-11-10 12:55:44,512 INFO L482 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-11-10 12:55:44,512 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 75 transitions. [2018-11-10 12:55:44,513 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-11-10 12:55:44,513 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 12:55:44,513 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 12:55:44,514 INFO L424 AbstractCegarLoop]: === Iteration 2 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 12:55:44,514 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 12:55:44,514 INFO L82 PathProgramCache]: Analyzing trace with hash -1212978296, now seen corresponding path program 1 times [2018-11-10 12:55:44,514 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 12:55:44,514 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 12:55:44,515 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 12:55:44,515 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 12:55:44,515 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 12:55:44,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 12:55:44,592 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-10 12:55:44,593 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 12:55:44,593 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-10 12:55:44,594 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-10 12:55:44,594 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-10 12:55:44,594 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-10 12:55:44,594 INFO L87 Difference]: Start difference. First operand 49 states and 75 transitions. Second operand 3 states. [2018-11-10 12:55:44,732 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 12:55:44,732 INFO L93 Difference]: Finished difference Result 108 states and 175 transitions. [2018-11-10 12:55:44,733 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-10 12:55:44,733 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 23 [2018-11-10 12:55:44,733 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 12:55:44,734 INFO L225 Difference]: With dead ends: 108 [2018-11-10 12:55:44,734 INFO L226 Difference]: Without dead ends: 74 [2018-11-10 12:55:44,735 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-10 12:55:44,735 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states. [2018-11-10 12:55:44,739 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 72. [2018-11-10 12:55:44,739 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 72 states. [2018-11-10 12:55:44,740 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 102 transitions. [2018-11-10 12:55:44,740 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 102 transitions. Word has length 23 [2018-11-10 12:55:44,740 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 12:55:44,741 INFO L481 AbstractCegarLoop]: Abstraction has 72 states and 102 transitions. [2018-11-10 12:55:44,741 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-10 12:55:44,741 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 102 transitions. [2018-11-10 12:55:44,741 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2018-11-10 12:55:44,741 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 12:55:44,742 INFO L375 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 12:55:44,742 INFO L424 AbstractCegarLoop]: === Iteration 3 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 12:55:44,742 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 12:55:44,742 INFO L82 PathProgramCache]: Analyzing trace with hash -2067837576, now seen corresponding path program 1 times [2018-11-10 12:55:44,742 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 12:55:44,742 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 12:55:44,743 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 12:55:44,743 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 12:55:44,743 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 12:55:44,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 12:55:44,810 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 12:55:44,810 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 12:55:44,810 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-10 12:55:44,810 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-10 12:55:44,811 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-10 12:55:44,811 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-10 12:55:44,811 INFO L87 Difference]: Start difference. First operand 72 states and 102 transitions. Second operand 4 states. [2018-11-10 12:55:44,980 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 12:55:44,980 INFO L93 Difference]: Finished difference Result 149 states and 236 transitions. [2018-11-10 12:55:44,980 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-10 12:55:44,980 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 30 [2018-11-10 12:55:44,980 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 12:55:44,981 INFO L225 Difference]: With dead ends: 149 [2018-11-10 12:55:44,982 INFO L226 Difference]: Without dead ends: 115 [2018-11-10 12:55:44,982 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-10 12:55:44,982 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 115 states. [2018-11-10 12:55:44,989 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 115 to 97. [2018-11-10 12:55:44,989 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 97 states. [2018-11-10 12:55:44,990 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 131 transitions. [2018-11-10 12:55:44,990 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 131 transitions. Word has length 30 [2018-11-10 12:55:44,990 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 12:55:44,990 INFO L481 AbstractCegarLoop]: Abstraction has 97 states and 131 transitions. [2018-11-10 12:55:44,991 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-10 12:55:44,991 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 131 transitions. [2018-11-10 12:55:44,991 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2018-11-10 12:55:44,992 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 12:55:44,992 INFO L375 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 12:55:44,992 INFO L424 AbstractCegarLoop]: === Iteration 4 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 12:55:44,992 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 12:55:44,992 INFO L82 PathProgramCache]: Analyzing trace with hash 1088003788, now seen corresponding path program 1 times [2018-11-10 12:55:44,992 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 12:55:44,992 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 12:55:44,993 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 12:55:44,993 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 12:55:44,993 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 12:55:45,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 12:55:45,073 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-11-10 12:55:45,073 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 12:55:45,073 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-10 12:55:45,074 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-10 12:55:45,074 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-10 12:55:45,074 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-10 12:55:45,075 INFO L87 Difference]: Start difference. First operand 97 states and 131 transitions. Second operand 4 states. [2018-11-10 12:55:45,260 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 12:55:45,260 INFO L93 Difference]: Finished difference Result 235 states and 346 transitions. [2018-11-10 12:55:45,261 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-10 12:55:45,261 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 37 [2018-11-10 12:55:45,261 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 12:55:45,262 INFO L225 Difference]: With dead ends: 235 [2018-11-10 12:55:45,262 INFO L226 Difference]: Without dead ends: 160 [2018-11-10 12:55:45,263 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-11-10 12:55:45,263 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 160 states. [2018-11-10 12:55:45,270 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 160 to 132. [2018-11-10 12:55:45,271 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 132 states. [2018-11-10 12:55:45,272 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 132 states to 132 states and 184 transitions. [2018-11-10 12:55:45,272 INFO L78 Accepts]: Start accepts. Automaton has 132 states and 184 transitions. Word has length 37 [2018-11-10 12:55:45,272 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 12:55:45,272 INFO L481 AbstractCegarLoop]: Abstraction has 132 states and 184 transitions. [2018-11-10 12:55:45,273 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-10 12:55:45,273 INFO L276 IsEmpty]: Start isEmpty. Operand 132 states and 184 transitions. [2018-11-10 12:55:45,273 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2018-11-10 12:55:45,273 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 12:55:45,274 INFO L375 BasicCegarLoop]: trace histogram [4, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 12:55:45,274 INFO L424 AbstractCegarLoop]: === Iteration 5 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 12:55:45,274 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 12:55:45,274 INFO L82 PathProgramCache]: Analyzing trace with hash -817205964, now seen corresponding path program 1 times [2018-11-10 12:55:45,274 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 12:55:45,274 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 12:55:45,275 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 12:55:45,275 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 12:55:45,275 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 12:55:45,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 12:55:45,343 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2018-11-10 12:55:45,343 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 12:55:45,343 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-10 12:55:45,344 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-10 12:55:45,344 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-10 12:55:45,344 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-10 12:55:45,344 INFO L87 Difference]: Start difference. First operand 132 states and 184 transitions. Second operand 5 states. [2018-11-10 12:55:45,502 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 12:55:45,503 INFO L93 Difference]: Finished difference Result 372 states and 520 transitions. [2018-11-10 12:55:45,503 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-10 12:55:45,503 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 44 [2018-11-10 12:55:45,504 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 12:55:45,506 INFO L225 Difference]: With dead ends: 372 [2018-11-10 12:55:45,506 INFO L226 Difference]: Without dead ends: 259 [2018-11-10 12:55:45,507 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-11-10 12:55:45,507 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 259 states. [2018-11-10 12:55:45,517 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 259 to 140. [2018-11-10 12:55:45,517 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 140 states. [2018-11-10 12:55:45,518 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 140 states to 140 states and 195 transitions. [2018-11-10 12:55:45,519 INFO L78 Accepts]: Start accepts. Automaton has 140 states and 195 transitions. Word has length 44 [2018-11-10 12:55:45,519 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 12:55:45,519 INFO L481 AbstractCegarLoop]: Abstraction has 140 states and 195 transitions. [2018-11-10 12:55:45,519 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-10 12:55:45,519 INFO L276 IsEmpty]: Start isEmpty. Operand 140 states and 195 transitions. [2018-11-10 12:55:45,520 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2018-11-10 12:55:45,520 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 12:55:45,520 INFO L375 BasicCegarLoop]: trace histogram [4, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 12:55:45,521 INFO L424 AbstractCegarLoop]: === Iteration 6 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 12:55:45,521 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 12:55:45,521 INFO L82 PathProgramCache]: Analyzing trace with hash 1610975370, now seen corresponding path program 1 times [2018-11-10 12:55:45,521 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 12:55:45,521 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 12:55:45,522 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 12:55:45,522 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 12:55:45,522 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 12:55:45,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 12:55:45,574 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2018-11-10 12:55:45,575 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 12:55:45,575 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-10 12:55:45,575 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-10 12:55:45,575 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-10 12:55:45,575 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-10 12:55:45,576 INFO L87 Difference]: Start difference. First operand 140 states and 195 transitions. Second operand 5 states. [2018-11-10 12:55:45,711 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 12:55:45,711 INFO L93 Difference]: Finished difference Result 380 states and 528 transitions. [2018-11-10 12:55:45,711 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-10 12:55:45,711 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 45 [2018-11-10 12:55:45,712 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 12:55:45,712 INFO L225 Difference]: With dead ends: 380 [2018-11-10 12:55:45,712 INFO L226 Difference]: Without dead ends: 267 [2018-11-10 12:55:45,713 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-11-10 12:55:45,713 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 267 states. [2018-11-10 12:55:45,720 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 267 to 153. [2018-11-10 12:55:45,720 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 153 states. [2018-11-10 12:55:45,720 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 153 states to 153 states and 209 transitions. [2018-11-10 12:55:45,721 INFO L78 Accepts]: Start accepts. Automaton has 153 states and 209 transitions. Word has length 45 [2018-11-10 12:55:45,721 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 12:55:45,721 INFO L481 AbstractCegarLoop]: Abstraction has 153 states and 209 transitions. [2018-11-10 12:55:45,721 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-10 12:55:45,721 INFO L276 IsEmpty]: Start isEmpty. Operand 153 states and 209 transitions. [2018-11-10 12:55:45,722 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2018-11-10 12:55:45,722 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 12:55:45,722 INFO L375 BasicCegarLoop]: trace histogram [4, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 12:55:45,722 INFO L424 AbstractCegarLoop]: === Iteration 7 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 12:55:45,723 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 12:55:45,723 INFO L82 PathProgramCache]: Analyzing trace with hash -1012075515, now seen corresponding path program 1 times [2018-11-10 12:55:45,723 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 12:55:45,723 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 12:55:45,724 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 12:55:45,724 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 12:55:45,724 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 12:55:45,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 12:55:45,784 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 18 proven. 5 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-11-10 12:55:45,784 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 12:55:45,784 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_bb43665f-ba4e-4261-8e93-009ab10ba1c6/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-10 12:55:45,798 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 12:55:45,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 12:55:45,829 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 12:55:45,891 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2018-11-10 12:55:45,907 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-10 12:55:45,907 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [5] total 7 [2018-11-10 12:55:45,908 INFO L460 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-11-10 12:55:45,908 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-11-10 12:55:45,908 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2018-11-10 12:55:45,908 INFO L87 Difference]: Start difference. First operand 153 states and 209 transitions. Second operand 7 states. [2018-11-10 12:55:46,454 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 12:55:46,455 INFO L93 Difference]: Finished difference Result 343 states and 496 transitions. [2018-11-10 12:55:46,455 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-11-10 12:55:46,455 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 46 [2018-11-10 12:55:46,456 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 12:55:46,456 INFO L225 Difference]: With dead ends: 343 [2018-11-10 12:55:46,456 INFO L226 Difference]: Without dead ends: 233 [2018-11-10 12:55:46,457 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 47 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2018-11-10 12:55:46,457 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 233 states. [2018-11-10 12:55:46,465 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 233 to 209. [2018-11-10 12:55:46,465 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 209 states. [2018-11-10 12:55:46,466 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 209 states to 209 states and 275 transitions. [2018-11-10 12:55:46,466 INFO L78 Accepts]: Start accepts. Automaton has 209 states and 275 transitions. Word has length 46 [2018-11-10 12:55:46,467 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 12:55:46,467 INFO L481 AbstractCegarLoop]: Abstraction has 209 states and 275 transitions. [2018-11-10 12:55:46,468 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-11-10 12:55:46,468 INFO L276 IsEmpty]: Start isEmpty. Operand 209 states and 275 transitions. [2018-11-10 12:55:46,469 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2018-11-10 12:55:46,469 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 12:55:46,469 INFO L375 BasicCegarLoop]: trace histogram [5, 4, 4, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 12:55:46,469 INFO L424 AbstractCegarLoop]: === Iteration 8 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 12:55:46,469 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 12:55:46,470 INFO L82 PathProgramCache]: Analyzing trace with hash -1144834017, now seen corresponding path program 1 times [2018-11-10 12:55:46,470 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 12:55:46,470 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 12:55:46,470 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 12:55:46,471 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 12:55:46,471 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 12:55:46,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 12:55:46,542 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2018-11-10 12:55:46,542 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 12:55:46,542 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-11-10 12:55:46,543 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-10 12:55:46,545 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-10 12:55:46,545 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-11-10 12:55:46,545 INFO L87 Difference]: Start difference. First operand 209 states and 275 transitions. Second operand 6 states. [2018-11-10 12:55:46,902 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 12:55:46,903 INFO L93 Difference]: Finished difference Result 729 states and 967 transitions. [2018-11-10 12:55:46,903 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-10 12:55:46,903 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 53 [2018-11-10 12:55:46,903 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 12:55:46,905 INFO L225 Difference]: With dead ends: 729 [2018-11-10 12:55:46,905 INFO L226 Difference]: Without dead ends: 559 [2018-11-10 12:55:46,905 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2018-11-10 12:55:46,906 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 559 states. [2018-11-10 12:55:46,913 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 559 to 346. [2018-11-10 12:55:46,913 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 346 states. [2018-11-10 12:55:46,914 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 346 states to 346 states and 460 transitions. [2018-11-10 12:55:46,914 INFO L78 Accepts]: Start accepts. Automaton has 346 states and 460 transitions. Word has length 53 [2018-11-10 12:55:46,914 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 12:55:46,914 INFO L481 AbstractCegarLoop]: Abstraction has 346 states and 460 transitions. [2018-11-10 12:55:46,914 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-10 12:55:46,914 INFO L276 IsEmpty]: Start isEmpty. Operand 346 states and 460 transitions. [2018-11-10 12:55:46,915 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2018-11-10 12:55:46,916 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 12:55:46,916 INFO L375 BasicCegarLoop]: trace histogram [5, 4, 4, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 12:55:46,916 INFO L424 AbstractCegarLoop]: === Iteration 9 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 12:55:46,916 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 12:55:46,916 INFO L82 PathProgramCache]: Analyzing trace with hash -257162562, now seen corresponding path program 1 times [2018-11-10 12:55:46,916 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 12:55:46,916 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 12:55:46,917 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 12:55:46,917 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 12:55:46,917 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 12:55:46,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 12:55:46,962 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2018-11-10 12:55:46,962 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 12:55:46,962 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-11-10 12:55:46,962 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-10 12:55:46,963 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-10 12:55:46,963 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-11-10 12:55:46,963 INFO L87 Difference]: Start difference. First operand 346 states and 460 transitions. Second operand 6 states. [2018-11-10 12:55:47,595 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 12:55:47,595 INFO L93 Difference]: Finished difference Result 1218 states and 1637 transitions. [2018-11-10 12:55:47,595 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-10 12:55:47,595 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 54 [2018-11-10 12:55:47,595 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 12:55:47,598 INFO L225 Difference]: With dead ends: 1218 [2018-11-10 12:55:47,598 INFO L226 Difference]: Without dead ends: 930 [2018-11-10 12:55:47,599 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2018-11-10 12:55:47,599 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 930 states. [2018-11-10 12:55:47,620 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 930 to 709. [2018-11-10 12:55:47,620 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 709 states. [2018-11-10 12:55:47,623 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 709 states to 709 states and 960 transitions. [2018-11-10 12:55:47,623 INFO L78 Accepts]: Start accepts. Automaton has 709 states and 960 transitions. Word has length 54 [2018-11-10 12:55:47,623 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 12:55:47,623 INFO L481 AbstractCegarLoop]: Abstraction has 709 states and 960 transitions. [2018-11-10 12:55:47,623 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-10 12:55:47,623 INFO L276 IsEmpty]: Start isEmpty. Operand 709 states and 960 transitions. [2018-11-10 12:55:47,624 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2018-11-10 12:55:47,624 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 12:55:47,625 INFO L375 BasicCegarLoop]: trace histogram [5, 4, 4, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 12:55:47,625 INFO L424 AbstractCegarLoop]: === Iteration 10 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 12:55:47,625 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 12:55:47,625 INFO L82 PathProgramCache]: Analyzing trace with hash 40898758, now seen corresponding path program 1 times [2018-11-10 12:55:47,625 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 12:55:47,625 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 12:55:47,626 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 12:55:47,626 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 12:55:47,626 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 12:55:47,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 12:55:47,706 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2018-11-10 12:55:47,707 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 12:55:47,707 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-11-10 12:55:47,707 INFO L460 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-11-10 12:55:47,707 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-11-10 12:55:47,708 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2018-11-10 12:55:47,708 INFO L87 Difference]: Start difference. First operand 709 states and 960 transitions. Second operand 8 states. [2018-11-10 12:55:52,305 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 12:55:52,305 INFO L93 Difference]: Finished difference Result 2362 states and 3189 transitions. [2018-11-10 12:55:52,305 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-11-10 12:55:52,306 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 55 [2018-11-10 12:55:52,306 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 12:55:52,311 INFO L225 Difference]: With dead ends: 2362 [2018-11-10 12:55:52,311 INFO L226 Difference]: Without dead ends: 1703 [2018-11-10 12:55:52,313 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=29, Invalid=103, Unknown=0, NotChecked=0, Total=132 [2018-11-10 12:55:52,314 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1703 states. [2018-11-10 12:55:52,354 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1703 to 1345. [2018-11-10 12:55:52,354 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1345 states. [2018-11-10 12:55:52,357 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1345 states to 1345 states and 1813 transitions. [2018-11-10 12:55:52,358 INFO L78 Accepts]: Start accepts. Automaton has 1345 states and 1813 transitions. Word has length 55 [2018-11-10 12:55:52,358 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 12:55:52,358 INFO L481 AbstractCegarLoop]: Abstraction has 1345 states and 1813 transitions. [2018-11-10 12:55:52,358 INFO L482 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-11-10 12:55:52,358 INFO L276 IsEmpty]: Start isEmpty. Operand 1345 states and 1813 transitions. [2018-11-10 12:55:52,360 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2018-11-10 12:55:52,360 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 12:55:52,360 INFO L375 BasicCegarLoop]: trace histogram [5, 4, 4, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 12:55:52,360 INFO L424 AbstractCegarLoop]: === Iteration 11 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 12:55:52,360 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 12:55:52,361 INFO L82 PathProgramCache]: Analyzing trace with hash 1969171460, now seen corresponding path program 1 times [2018-11-10 12:55:52,361 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 12:55:52,361 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 12:55:52,362 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 12:55:52,362 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 12:55:52,362 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 12:55:52,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 12:55:52,437 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2018-11-10 12:55:52,437 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 12:55:52,438 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-11-10 12:55:52,438 INFO L460 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-11-10 12:55:52,438 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-11-10 12:55:52,438 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-11-10 12:55:52,438 INFO L87 Difference]: Start difference. First operand 1345 states and 1813 transitions. Second operand 7 states. [2018-11-10 12:55:53,340 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 12:55:53,340 INFO L93 Difference]: Finished difference Result 2278 states and 3054 transitions. [2018-11-10 12:55:53,340 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-11-10 12:55:53,341 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 55 [2018-11-10 12:55:53,341 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 12:55:53,346 INFO L225 Difference]: With dead ends: 2278 [2018-11-10 12:55:53,346 INFO L226 Difference]: Without dead ends: 1631 [2018-11-10 12:55:53,348 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2018-11-10 12:55:53,349 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1631 states. [2018-11-10 12:55:53,390 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1631 to 1086. [2018-11-10 12:55:53,390 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1086 states. [2018-11-10 12:55:53,392 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1086 states to 1086 states and 1450 transitions. [2018-11-10 12:55:53,393 INFO L78 Accepts]: Start accepts. Automaton has 1086 states and 1450 transitions. Word has length 55 [2018-11-10 12:55:53,393 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 12:55:53,393 INFO L481 AbstractCegarLoop]: Abstraction has 1086 states and 1450 transitions. [2018-11-10 12:55:53,393 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-11-10 12:55:53,393 INFO L276 IsEmpty]: Start isEmpty. Operand 1086 states and 1450 transitions. [2018-11-10 12:55:53,395 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2018-11-10 12:55:53,395 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 12:55:53,395 INFO L375 BasicCegarLoop]: trace histogram [4, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 12:55:53,395 INFO L424 AbstractCegarLoop]: === Iteration 12 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 12:55:53,395 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 12:55:53,396 INFO L82 PathProgramCache]: Analyzing trace with hash 869926361, now seen corresponding path program 1 times [2018-11-10 12:55:53,396 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 12:55:53,396 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 12:55:53,396 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 12:55:53,397 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 12:55:53,397 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 12:55:53,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 12:55:53,470 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 10 proven. 2 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2018-11-10 12:55:53,471 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 12:55:53,471 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_bb43665f-ba4e-4261-8e93-009ab10ba1c6/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-10 12:55:53,476 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 12:55:53,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 12:55:53,493 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 12:55:53,523 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2018-11-10 12:55:53,542 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-10 12:55:53,542 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [5] total 5 [2018-11-10 12:55:53,542 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-10 12:55:53,542 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-10 12:55:53,542 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2018-11-10 12:55:53,542 INFO L87 Difference]: Start difference. First operand 1086 states and 1450 transitions. Second operand 5 states. [2018-11-10 12:55:53,663 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 12:55:53,663 INFO L93 Difference]: Finished difference Result 1578 states and 2110 transitions. [2018-11-10 12:55:53,664 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-10 12:55:53,664 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 60 [2018-11-10 12:55:53,664 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 12:55:53,667 INFO L225 Difference]: With dead ends: 1578 [2018-11-10 12:55:53,667 INFO L226 Difference]: Without dead ends: 1105 [2018-11-10 12:55:53,668 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 59 SyntacticMatches, 2 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2018-11-10 12:55:53,669 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1105 states. [2018-11-10 12:55:53,696 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1105 to 1099. [2018-11-10 12:55:53,696 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1099 states. [2018-11-10 12:55:53,698 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1099 states to 1099 states and 1432 transitions. [2018-11-10 12:55:53,698 INFO L78 Accepts]: Start accepts. Automaton has 1099 states and 1432 transitions. Word has length 60 [2018-11-10 12:55:53,698 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 12:55:53,699 INFO L481 AbstractCegarLoop]: Abstraction has 1099 states and 1432 transitions. [2018-11-10 12:55:53,699 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-10 12:55:53,699 INFO L276 IsEmpty]: Start isEmpty. Operand 1099 states and 1432 transitions. [2018-11-10 12:55:53,700 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2018-11-10 12:55:53,700 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 12:55:53,700 INFO L375 BasicCegarLoop]: trace histogram [4, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 12:55:53,700 INFO L424 AbstractCegarLoop]: === Iteration 13 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 12:55:53,700 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 12:55:53,700 INFO L82 PathProgramCache]: Analyzing trace with hash -233851601, now seen corresponding path program 1 times [2018-11-10 12:55:53,701 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 12:55:53,701 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 12:55:53,701 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 12:55:53,701 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 12:55:53,701 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 12:55:53,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 12:55:53,802 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 10 proven. 2 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2018-11-10 12:55:53,802 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 12:55:53,802 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_bb43665f-ba4e-4261-8e93-009ab10ba1c6/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-10 12:55:53,813 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 12:55:53,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 12:55:53,837 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 12:55:53,969 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2018-11-10 12:55:53,996 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-10 12:55:53,996 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [8] total 10 [2018-11-10 12:55:53,996 INFO L460 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-11-10 12:55:53,996 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-11-10 12:55:53,997 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=59, Unknown=0, NotChecked=0, Total=90 [2018-11-10 12:55:53,997 INFO L87 Difference]: Start difference. First operand 1099 states and 1432 transitions. Second operand 10 states. [2018-11-10 12:55:56,534 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 12:55:56,534 INFO L93 Difference]: Finished difference Result 2230 states and 2929 transitions. [2018-11-10 12:55:56,535 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-11-10 12:55:56,535 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 61 [2018-11-10 12:55:56,535 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 12:55:56,538 INFO L225 Difference]: With dead ends: 2230 [2018-11-10 12:55:56,539 INFO L226 Difference]: Without dead ends: 1504 [2018-11-10 12:55:56,540 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 73 GetRequests, 58 SyntacticMatches, 2 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 31 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=66, Invalid=144, Unknown=0, NotChecked=0, Total=210 [2018-11-10 12:55:56,541 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1504 states. [2018-11-10 12:55:56,573 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1504 to 1215. [2018-11-10 12:55:56,573 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1215 states. [2018-11-10 12:55:56,575 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1215 states to 1215 states and 1571 transitions. [2018-11-10 12:55:56,576 INFO L78 Accepts]: Start accepts. Automaton has 1215 states and 1571 transitions. Word has length 61 [2018-11-10 12:55:56,576 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 12:55:56,576 INFO L481 AbstractCegarLoop]: Abstraction has 1215 states and 1571 transitions. [2018-11-10 12:55:56,576 INFO L482 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-11-10 12:55:56,576 INFO L276 IsEmpty]: Start isEmpty. Operand 1215 states and 1571 transitions. [2018-11-10 12:55:56,577 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2018-11-10 12:55:56,577 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 12:55:56,578 INFO L375 BasicCegarLoop]: trace histogram [4, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 12:55:56,578 INFO L424 AbstractCegarLoop]: === Iteration 14 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 12:55:56,578 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 12:55:56,578 INFO L82 PathProgramCache]: Analyzing trace with hash -720408370, now seen corresponding path program 1 times [2018-11-10 12:55:56,578 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 12:55:56,578 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 12:55:56,579 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 12:55:56,579 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 12:55:56,579 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 12:55:56,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 12:55:56,693 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2018-11-10 12:55:56,693 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 12:55:56,694 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2018-11-10 12:55:56,694 INFO L460 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-11-10 12:55:56,694 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-11-10 12:55:56,694 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2018-11-10 12:55:56,694 INFO L87 Difference]: Start difference. First operand 1215 states and 1571 transitions. Second operand 9 states. [2018-11-10 12:56:01,570 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 12:56:01,570 INFO L93 Difference]: Finished difference Result 2757 states and 3583 transitions. [2018-11-10 12:56:01,571 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-11-10 12:56:01,571 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 62 [2018-11-10 12:56:01,571 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 12:56:01,573 INFO L225 Difference]: With dead ends: 2757 [2018-11-10 12:56:01,573 INFO L226 Difference]: Without dead ends: 1572 [2018-11-10 12:56:01,575 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=71, Invalid=271, Unknown=0, NotChecked=0, Total=342 [2018-11-10 12:56:01,576 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1572 states. [2018-11-10 12:56:01,594 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1572 to 1302. [2018-11-10 12:56:01,594 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1302 states. [2018-11-10 12:56:01,596 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1302 states to 1302 states and 1663 transitions. [2018-11-10 12:56:01,596 INFO L78 Accepts]: Start accepts. Automaton has 1302 states and 1663 transitions. Word has length 62 [2018-11-10 12:56:01,596 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 12:56:01,596 INFO L481 AbstractCegarLoop]: Abstraction has 1302 states and 1663 transitions. [2018-11-10 12:56:01,596 INFO L482 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-11-10 12:56:01,596 INFO L276 IsEmpty]: Start isEmpty. Operand 1302 states and 1663 transitions. [2018-11-10 12:56:01,597 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2018-11-10 12:56:01,598 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 12:56:01,598 INFO L375 BasicCegarLoop]: trace histogram [4, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 12:56:01,598 INFO L424 AbstractCegarLoop]: === Iteration 15 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 12:56:01,598 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 12:56:01,598 INFO L82 PathProgramCache]: Analyzing trace with hash -83266330, now seen corresponding path program 1 times [2018-11-10 12:56:01,598 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 12:56:01,598 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 12:56:01,599 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 12:56:01,599 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 12:56:01,599 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 12:56:01,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 12:56:01,642 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 10 proven. 2 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2018-11-10 12:56:01,643 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 12:56:01,643 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_bb43665f-ba4e-4261-8e93-009ab10ba1c6/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-10 12:56:01,660 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 12:56:01,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 12:56:01,689 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 12:56:01,715 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2018-11-10 12:56:01,732 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-10 12:56:01,732 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [5] total 5 [2018-11-10 12:56:01,732 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-10 12:56:01,733 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-10 12:56:01,733 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2018-11-10 12:56:01,733 INFO L87 Difference]: Start difference. First operand 1302 states and 1663 transitions. Second operand 5 states. [2018-11-10 12:56:01,819 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 12:56:01,819 INFO L93 Difference]: Finished difference Result 1728 states and 2208 transitions. [2018-11-10 12:56:01,819 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-10 12:56:01,819 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 63 [2018-11-10 12:56:01,820 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 12:56:01,821 INFO L225 Difference]: With dead ends: 1728 [2018-11-10 12:56:01,822 INFO L226 Difference]: Without dead ends: 1326 [2018-11-10 12:56:01,822 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 62 SyntacticMatches, 2 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2018-11-10 12:56:01,823 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1326 states. [2018-11-10 12:56:01,844 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1326 to 1304. [2018-11-10 12:56:01,845 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1304 states. [2018-11-10 12:56:01,847 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1304 states to 1304 states and 1646 transitions. [2018-11-10 12:56:01,847 INFO L78 Accepts]: Start accepts. Automaton has 1304 states and 1646 transitions. Word has length 63 [2018-11-10 12:56:01,847 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 12:56:01,848 INFO L481 AbstractCegarLoop]: Abstraction has 1304 states and 1646 transitions. [2018-11-10 12:56:01,848 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-10 12:56:01,848 INFO L276 IsEmpty]: Start isEmpty. Operand 1304 states and 1646 transitions. [2018-11-10 12:56:01,849 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2018-11-10 12:56:01,849 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 12:56:01,850 INFO L375 BasicCegarLoop]: trace histogram [4, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 12:56:01,850 INFO L424 AbstractCegarLoop]: === Iteration 16 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 12:56:01,850 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 12:56:01,850 INFO L82 PathProgramCache]: Analyzing trace with hash 1789466529, now seen corresponding path program 1 times [2018-11-10 12:56:01,850 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 12:56:01,850 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 12:56:01,851 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 12:56:01,851 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 12:56:01,851 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 12:56:01,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 12:56:01,940 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 10 proven. 2 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2018-11-10 12:56:01,940 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 12:56:01,941 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_bb43665f-ba4e-4261-8e93-009ab10ba1c6/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-10 12:56:01,947 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 12:56:01,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 12:56:01,966 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 12:56:02,012 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2018-11-10 12:56:02,029 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-10 12:56:02,029 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [8] total 10 [2018-11-10 12:56:02,030 INFO L460 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-11-10 12:56:02,030 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-11-10 12:56:02,030 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2018-11-10 12:56:02,030 INFO L87 Difference]: Start difference. First operand 1304 states and 1646 transitions. Second operand 10 states. [2018-11-10 12:56:04,562 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 12:56:04,562 INFO L93 Difference]: Finished difference Result 3010 states and 3825 transitions. [2018-11-10 12:56:04,563 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2018-11-10 12:56:04,563 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 64 [2018-11-10 12:56:04,563 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 12:56:04,565 INFO L225 Difference]: With dead ends: 3010 [2018-11-10 12:56:04,566 INFO L226 Difference]: Without dead ends: 2215 [2018-11-10 12:56:04,567 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 91 GetRequests, 61 SyntacticMatches, 2 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 198 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=180, Invalid=690, Unknown=0, NotChecked=0, Total=870 [2018-11-10 12:56:04,568 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2215 states. [2018-11-10 12:56:04,608 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2215 to 1762. [2018-11-10 12:56:04,608 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1762 states. [2018-11-10 12:56:04,611 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1762 states to 1762 states and 2185 transitions. [2018-11-10 12:56:04,611 INFO L78 Accepts]: Start accepts. Automaton has 1762 states and 2185 transitions. Word has length 64 [2018-11-10 12:56:04,611 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 12:56:04,611 INFO L481 AbstractCegarLoop]: Abstraction has 1762 states and 2185 transitions. [2018-11-10 12:56:04,611 INFO L482 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-11-10 12:56:04,611 INFO L276 IsEmpty]: Start isEmpty. Operand 1762 states and 2185 transitions. [2018-11-10 12:56:04,613 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2018-11-10 12:56:04,613 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 12:56:04,613 INFO L375 BasicCegarLoop]: trace histogram [4, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 12:56:04,614 INFO L424 AbstractCegarLoop]: === Iteration 17 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 12:56:04,614 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 12:56:04,614 INFO L82 PathProgramCache]: Analyzing trace with hash 1760043162, now seen corresponding path program 1 times [2018-11-10 12:56:04,614 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 12:56:04,614 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 12:56:04,614 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 12:56:04,615 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 12:56:04,615 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 12:56:04,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 12:56:04,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 12:56:04,654 INFO L442 BasicCegarLoop]: Counterexample might be feasible [2018-11-10 12:56:04,695 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 10.11 12:56:04 BoogieIcfgContainer [2018-11-10 12:56:04,695 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-11-10 12:56:04,695 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-11-10 12:56:04,695 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-11-10 12:56:04,696 INFO L276 PluginConnector]: Witness Printer initialized [2018-11-10 12:56:04,696 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.11 12:55:44" (3/4) ... [2018-11-10 12:56:04,700 INFO L147 WitnessPrinter]: No result that supports witness generation found [2018-11-10 12:56:04,701 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-11-10 12:56:04,701 INFO L168 Benchmark]: Toolchain (without parser) took 20890.77 ms. Allocated memory was 1.0 GB in the beginning and 1.3 GB in the end (delta: 314.0 MB). Free memory was 959.2 MB in the beginning and 1.0 GB in the end (delta: -50.0 MB). Peak memory consumption was 264.0 MB. Max. memory is 11.5 GB. [2018-11-10 12:56:04,702 INFO L168 Benchmark]: CDTParser took 0.14 ms. Allocated memory is still 1.0 GB. Free memory is still 985.6 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-10 12:56:04,703 INFO L168 Benchmark]: CACSL2BoogieTranslator took 172.96 ms. Allocated memory is still 1.0 GB. Free memory was 959.2 MB in the beginning and 945.8 MB in the end (delta: 13.4 MB). Peak memory consumption was 13.4 MB. Max. memory is 11.5 GB. [2018-11-10 12:56:04,704 INFO L168 Benchmark]: Boogie Preprocessor took 25.75 ms. Allocated memory is still 1.0 GB. Free memory is still 945.8 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-10 12:56:04,705 INFO L168 Benchmark]: RCFGBuilder took 278.65 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 134.2 MB). Free memory was 945.8 MB in the beginning and 1.1 GB in the end (delta: -160.8 MB). Peak memory consumption was 17.1 MB. Max. memory is 11.5 GB. [2018-11-10 12:56:04,705 INFO L168 Benchmark]: TraceAbstraction took 20404.97 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 179.8 MB). Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 97.4 MB). Peak memory consumption was 277.3 MB. Max. memory is 11.5 GB. [2018-11-10 12:56:04,706 INFO L168 Benchmark]: Witness Printer took 5.28 ms. Allocated memory is still 1.3 GB. Free memory is still 1.0 GB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-10 12:56:04,708 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 985.6 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 172.96 ms. Allocated memory is still 1.0 GB. Free memory was 959.2 MB in the beginning and 945.8 MB in the end (delta: 13.4 MB). Peak memory consumption was 13.4 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 25.75 ms. Allocated memory is still 1.0 GB. Free memory is still 945.8 MB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 278.65 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 134.2 MB). Free memory was 945.8 MB in the beginning and 1.1 GB in the end (delta: -160.8 MB). Peak memory consumption was 17.1 MB. Max. memory is 11.5 GB. * TraceAbstraction took 20404.97 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 179.8 MB). Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 97.4 MB). Peak memory consumption was 277.3 MB. Max. memory is 11.5 GB. * Witness Printer took 5.28 ms. Allocated memory is still 1.3 GB. Free memory is still 1.0 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 bitwiseOr at line 97. Possible FailurePath: [L105] unsigned int a, b, r; [L107] a = __VERIFIER_nondet_uint() [L108] b = __VERIFIER_nondet_uint() [L110] CALL, EXPR mp_add(a, b) VAL [\old(a)=0, \old(b)=0] [L23] unsigned char a0, a1, a2, a3; [L24] unsigned char b0, b1, b2, b3; [L25] unsigned char r0, r1, r2, r3; [L26] unsigned short carry; [L27] unsigned short partial_sum; [L28] unsigned int r; [L29] unsigned char i; [L30] unsigned char na, nb; [L31] a0 = a [L32] a1 = a >> 8 [L33] a2 = a >> 16U [L34] a3 = a >> 24U [L35] b0 = b [L36] b1 = b >> 8U [L37] b2 = b >> 16U [L38] b3 = b >> 24U [L39] na = (unsigned char)4 VAL [\old(a)=0, \old(b)=0, a=0, a0=0, a1=0, a2=0, a3=0, b=0, b0=0, b1=0, b2=0, b3=0, na=4] [L40] COND TRUE a3 == (unsigned char)0 [L41] na = na - 1 VAL [\old(a)=0, \old(b)=0, a=0, a0=0, a1=0, a2=0, a3=0, b=0, b0=0, b1=0, b2=0, b3=0, na=3] [L42] COND TRUE a2 == (unsigned char)0 [L43] na = na - 1 VAL [\old(a)=0, \old(b)=0, a=0, a0=0, a1=0, a2=0, a3=0, b=0, b0=0, b1=0, b2=0, b3=0, na=2] [L44] COND TRUE a1 == (unsigned char)0 [L45] na = na - 1 VAL [\old(a)=0, \old(b)=0, a=0, a0=0, a1=0, a2=0, a3=0, b=0, b0=0, b1=0, b2=0, b3=0, na=1] [L49] nb = (unsigned char)4 VAL [\old(a)=0, \old(b)=0, a=0, a0=0, a1=0, a2=0, a3=0, b=0, b0=0, b1=0, b2=0, b3=0, na=1, nb=4] [L50] COND TRUE b3 == (unsigned char)0 [L51] nb = nb - 1 VAL [\old(a)=0, \old(b)=0, a=0, a0=0, a1=0, a2=0, a3=0, b=0, b0=0, b1=0, b2=0, b3=0, na=1, nb=3] [L52] COND TRUE b2 == (unsigned char)0 [L53] nb = nb - 1 VAL [\old(a)=0, \old(b)=0, a=0, a0=0, a1=0, a2=0, a3=0, b=0, b0=0, b1=0, b2=0, b3=0, na=1, nb=2] [L54] COND TRUE b1 == (unsigned char)0 [L55] nb = nb - 1 VAL [\old(a)=0, \old(b)=0, a=0, a0=0, a1=0, a2=0, a3=0, b=0, b0=0, b1=0, b2=0, b3=0, na=1, nb=1] [L59] carry = (unsigned short)0 [L60] i = (unsigned char)0 VAL [\old(a)=0, \old(b)=0, a=0, a0=0, a1=0, a2=0, a3=0, b=0, b0=0, b1=0, b2=0, b3=0, carry=0, i=0, na=1, nb=1] [L61] COND TRUE (i < na) || (i < nb) || (carry != (unsigned short)0) [L62] partial_sum = carry [L63] carry = (unsigned short)0 VAL [\old(a)=0, \old(b)=0, a=0, a0=0, a1=0, a2=0, a3=0, b=0, b0=0, b1=0, b2=0, b3=0, carry=0, i=0, na=1, nb=1, partial_sum=0] [L64] COND TRUE i < na VAL [\old(a)=0, \old(b)=0, a=0, a0=0, a1=0, a2=0, a3=0, b=0, b0=0, b1=0, b2=0, b3=0, carry=0, i=0, na=1, nb=1, partial_sum=0] [L65] COND TRUE i == (unsigned char)0 [L65] partial_sum = partial_sum + a0 VAL [\old(a)=0, \old(b)=0, a=0, a0=0, a1=0, a2=0, a3=0, b=0, b0=0, b1=0, b2=0, b3=0, carry=0, i=0, na=1, nb=1, partial_sum=0] [L66] COND FALSE !(i == (unsigned char)1) VAL [\old(a)=0, \old(b)=0, a=0, a0=0, a1=0, a2=0, a3=0, b=0, b0=0, b1=0, b2=0, b3=0, carry=0, i=0, na=1, nb=1, partial_sum=0] [L67] COND FALSE !(i == (unsigned char)2) VAL [\old(a)=0, \old(b)=0, a=0, a0=0, a1=0, a2=0, a3=0, b=0, b0=0, b1=0, b2=0, b3=0, carry=0, i=0, na=1, nb=1, partial_sum=0] [L68] COND FALSE !(i == (unsigned char)3) VAL [\old(a)=0, \old(b)=0, a=0, a0=0, a1=0, a2=0, a3=0, b=0, b0=0, b1=0, b2=0, b3=0, carry=0, i=0, na=1, nb=1, partial_sum=0] [L70] COND TRUE i < nb VAL [\old(a)=0, \old(b)=0, a=0, a0=0, a1=0, a2=0, a3=0, b=0, b0=0, b1=0, b2=0, b3=0, carry=0, i=0, na=1, nb=1, partial_sum=0] [L71] COND TRUE i == (unsigned char)0 [L71] partial_sum = partial_sum + b0 VAL [\old(a)=0, \old(b)=0, a=0, a0=0, a1=0, a2=0, a3=0, b=0, b0=0, b1=0, b2=0, b3=0, carry=0, i=0, na=1, nb=1, partial_sum=0] [L72] COND FALSE !(i == (unsigned char)1) VAL [\old(a)=0, \old(b)=0, a=0, a0=0, a1=0, a2=0, a3=0, b=0, b0=0, b1=0, b2=0, b3=0, carry=0, i=0, na=1, nb=1, partial_sum=0] [L73] COND FALSE !(i == (unsigned char)2) VAL [\old(a)=0, \old(b)=0, a=0, a0=0, a1=0, a2=0, a3=0, b=0, b0=0, b1=0, b2=0, b3=0, carry=0, i=0, na=1, nb=1, partial_sum=0] [L74] COND FALSE !(i == (unsigned char)3) VAL [\old(a)=0, \old(b)=0, a=0, a0=0, a1=0, a2=0, a3=0, b=0, b0=0, b1=0, b2=0, b3=0, carry=0, i=0, na=1, nb=1, partial_sum=0] [L76] COND FALSE !(partial_sum > ((unsigned char)254)) VAL [\old(a)=0, \old(b)=0, a=0, a0=0, a1=0, a2=0, a3=0, b=0, b0=0, b1=0, b2=0, b3=0, carry=0, i=0, na=1, nb=1, partial_sum=0] [L80] COND TRUE i == (unsigned char)0 [L80] r0 = (unsigned char)partial_sum VAL [\old(a)=0, \old(b)=0, a=0, a0=0, a1=0, a2=0, a3=0, b=0, b0=0, b1=0, b2=0, b3=0, carry=0, i=0, na=1, nb=1, partial_sum=0, r0=0] [L81] COND FALSE !(i == (unsigned char)1) VAL [\old(a)=0, \old(b)=0, a=0, a0=0, a1=0, a2=0, a3=0, b=0, b0=0, b1=0, b2=0, b3=0, carry=0, i=0, na=1, nb=1, partial_sum=0, r0=0] [L82] COND FALSE !(i == (unsigned char)2) VAL [\old(a)=0, \old(b)=0, a=0, a0=0, a1=0, a2=0, a3=0, b=0, b0=0, b1=0, b2=0, b3=0, carry=0, i=0, na=1, nb=1, partial_sum=0, r0=0] [L83] COND FALSE !(i == (unsigned char)3) VAL [\old(a)=0, \old(b)=0, a=0, a0=0, a1=0, a2=0, a3=0, b=0, b0=0, b1=0, b2=0, b3=0, carry=0, i=0, na=1, nb=1, partial_sum=0, r0=0] [L85] i = i + (unsigned char)1 VAL [\old(a)=0, \old(b)=0, a=0, a0=0, a1=0, a2=0, a3=0, b=0, b0=0, b1=0, b2=0, b3=0, carry=0, i=1, na=1, nb=1, partial_sum=0, r0=0] [L61] COND FALSE !((i < na) || (i < nb) || (carry != (unsigned short)0)) VAL [\old(a)=0, \old(b)=0, a=0, a0=0, a1=0, a2=0, a3=0, b=0, b0=0, b1=0, b2=0, b3=0, carry=0, i=1, na=1, nb=1, partial_sum=0, r0=0] [L88] COND TRUE i < (unsigned char)4 VAL [\old(a)=0, \old(b)=0, a=0, a0=0, a1=0, a2=0, a3=0, b=0, b0=0, b1=0, b2=0, b3=0, carry=0, i=1, na=1, nb=1, partial_sum=0, r0=0] [L89] COND FALSE !(i == (unsigned char)0) VAL [\old(a)=0, \old(b)=0, a=0, a0=0, a1=0, a2=0, a3=0, b=0, b0=0, b1=0, b2=0, b3=0, carry=0, i=1, na=1, nb=1, partial_sum=0, r0=0] [L90] COND TRUE i == (unsigned char)1 [L90] r1 = (unsigned char)0 VAL [\old(a)=0, \old(b)=0, a=0, a0=0, a1=0, a2=0, a3=0, b=0, b0=0, b1=0, b2=0, b3=0, carry=0, i=1, na=1, nb=1, partial_sum=0, r0=0, r1=0] [L91] COND FALSE !(i == (unsigned char)2) VAL [\old(a)=0, \old(b)=0, a=0, a0=0, a1=0, a2=0, a3=0, b=0, b0=0, b1=0, b2=0, b3=0, carry=0, i=1, na=1, nb=1, partial_sum=0, r0=0, r1=0] [L92] COND FALSE !(i == (unsigned char)3) VAL [\old(a)=0, \old(b)=0, a=0, a0=0, a1=0, a2=0, a3=0, b=0, b0=0, b1=0, b2=0, b3=0, carry=0, i=1, na=1, nb=1, partial_sum=0, r0=0, r1=0] [L94] i = i + (unsigned char)1 VAL [\old(a)=0, \old(b)=0, a=0, a0=0, a1=0, a2=0, a3=0, b=0, b0=0, b1=0, b2=0, b3=0, carry=0, i=2, na=1, nb=1, partial_sum=0, r0=0, r1=0] [L88] COND TRUE i < (unsigned char)4 VAL [\old(a)=0, \old(b)=0, a=0, a0=0, a1=0, a2=0, a3=0, b=0, b0=0, b1=0, b2=0, b3=0, carry=0, i=2, na=1, nb=1, partial_sum=0, r0=0, r1=0] [L89] COND FALSE !(i == (unsigned char)0) VAL [\old(a)=0, \old(b)=0, a=0, a0=0, a1=0, a2=0, a3=0, b=0, b0=0, b1=0, b2=0, b3=0, carry=0, i=2, na=1, nb=1, partial_sum=0, r0=0, r1=0] [L90] COND FALSE !(i == (unsigned char)1) VAL [\old(a)=0, \old(b)=0, a=0, a0=0, a1=0, a2=0, a3=0, b=0, b0=0, b1=0, b2=0, b3=0, carry=0, i=2, na=1, nb=1, partial_sum=0, r0=0, r1=0] [L91] COND TRUE i == (unsigned char)2 [L91] r2 = (unsigned char)0 VAL [\old(a)=0, \old(b)=0, a=0, a0=0, a1=0, a2=0, a3=0, b=0, b0=0, b1=0, b2=0, b3=0, carry=0, i=2, na=1, nb=1, partial_sum=0, r0=0, r1=0, r2=0] [L92] COND FALSE !(i == (unsigned char)3) VAL [\old(a)=0, \old(b)=0, a=0, a0=0, a1=0, a2=0, a3=0, b=0, b0=0, b1=0, b2=0, b3=0, carry=0, i=2, na=1, nb=1, partial_sum=0, r0=0, r1=0, r2=0] [L94] i = i + (unsigned char)1 VAL [\old(a)=0, \old(b)=0, a=0, a0=0, a1=0, a2=0, a3=0, b=0, b0=0, b1=0, b2=0, b3=0, carry=0, i=3, na=1, nb=1, partial_sum=0, r0=0, r1=0, r2=0] [L88] COND TRUE i < (unsigned char)4 VAL [\old(a)=0, \old(b)=0, a=0, a0=0, a1=0, a2=0, a3=0, b=0, b0=0, b1=0, b2=0, b3=0, carry=0, i=3, na=1, nb=1, partial_sum=0, r0=0, r1=0, r2=0] [L89] COND FALSE !(i == (unsigned char)0) VAL [\old(a)=0, \old(b)=0, a=0, a0=0, a1=0, a2=0, a3=0, b=0, b0=0, b1=0, b2=0, b3=0, carry=0, i=3, na=1, nb=1, partial_sum=0, r0=0, r1=0, r2=0] [L90] COND FALSE !(i == (unsigned char)1) VAL [\old(a)=0, \old(b)=0, a=0, a0=0, a1=0, a2=0, a3=0, b=0, b0=0, b1=0, b2=0, b3=0, carry=0, i=3, na=1, nb=1, partial_sum=0, r0=0, r1=0, r2=0] [L91] COND FALSE !(i == (unsigned char)2) VAL [\old(a)=0, \old(b)=0, a=0, a0=0, a1=0, a2=0, a3=0, b=0, b0=0, b1=0, b2=0, b3=0, carry=0, i=3, na=1, nb=1, partial_sum=0, r0=0, r1=0, r2=0] [L92] COND TRUE i == (unsigned char)3 [L92] r3 = (unsigned char)0 VAL [\old(a)=0, \old(b)=0, a=0, a0=0, a1=0, a2=0, a3=0, b=0, b0=0, b1=0, b2=0, b3=0, carry=0, i=3, na=1, nb=1, partial_sum=0, r0=0, r1=0, r2=0, r3=0] [L94] i = i + (unsigned char)1 VAL [\old(a)=0, \old(b)=0, a=0, a0=0, a1=0, a2=0, a3=0, b=0, b0=0, b1=0, b2=0, b3=0, carry=0, i=4, na=1, nb=1, partial_sum=0, r0=0, r1=0, r2=0, r3=0] [L88] COND FALSE !(i < (unsigned char)4) VAL [\old(a)=0, \old(b)=0, a=0, a0=0, a1=0, a2=0, a3=0, b=0, b0=0, b1=0, b2=0, b3=0, carry=0, i=4, na=1, nb=1, partial_sum=0, r0=0, r1=0, r2=0, r3=0] [L97] r = r0 | (r1 << 8U) | (r2 << 16U) | ((unsigned int)r3 << 24U) [L99] RET return r; VAL [\old(a)=0, \old(b)=0, \result=1, a=0, a0=0, a1=0, a2=0, a3=0, b=0, b0=0, b1=0, b2=0, b3=0, carry=0, i=4, na=1, nb=1, partial_sum=0, r=1, r0=0, r1=0, r2=0, r3=0] [L110] EXPR mp_add(a, b) VAL [a=0, b=0, mp_add(a, b)=1] [L110] r = mp_add(a, b) [L112] CALL __VERIFIER_assert(r == a + b) 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 5 procedures, 56 locations, 1 error locations. UNSAFE Result, 20.3s OverallTime, 17 OverallIterations, 5 TraceHistogramMax, 18.0s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 1662 SDtfs, 2856 SDslu, 4145 SDs, 0 SdLazy, 6324 SolverSat, 482 SolverUnsat, 3 SolverUnknown, 0 SolverNotchecked, 16.4s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 440 GetRequests, 310 SyntacticMatches, 13 SemanticMatches, 117 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 293 ImplicationChecksByTransitivity, 1.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1762occurred in iteration=16, 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.3s AutomataMinimizationTime, 16 MinimizatonAttempts, 2682 StatesRemovedByMinimization, 15 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 1.2s InterpolantComputationTime, 1133 NumberOfCodeBlocks, 1133 NumberOfCodeBlocksAsserted, 22 NumberOfCheckSat, 1046 ConstructedInterpolants, 24 QuantifiedInterpolants, 208560 SizeOfPredicates, 12 NumberOfNonLiveVariables, 690 ConjunctsInSsa, 55 ConjunctsInUnsatCore, 21 InterpolantComputations, 16 PerfectInterpolantSequences, 569/582 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-1dbac8b [2018-11-10 12:56:06,141 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-10 12:56:06,143 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-10 12:56:06,151 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-10 12:56:06,151 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-10 12:56:06,152 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-10 12:56:06,153 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-10 12:56:06,154 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-10 12:56:06,155 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-10 12:56:06,156 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-10 12:56:06,156 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-10 12:56:06,156 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-10 12:56:06,157 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-10 12:56:06,157 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-10 12:56:06,158 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-10 12:56:06,159 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-10 12:56:06,160 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-10 12:56:06,161 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-10 12:56:06,162 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-10 12:56:06,164 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-10 12:56:06,164 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-10 12:56:06,165 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-10 12:56:06,167 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-10 12:56:06,167 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-10 12:56:06,171 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-10 12:56:06,172 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-10 12:56:06,172 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-10 12:56:06,173 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-10 12:56:06,173 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-10 12:56:06,174 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-10 12:56:06,174 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-10 12:56:06,175 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-10 12:56:06,175 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-10 12:56:06,176 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-10 12:56:06,176 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-10 12:56:06,177 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-10 12:56:06,177 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_bb43665f-ba4e-4261-8e93-009ab10ba1c6/bin-2019/uautomizer/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2018-11-10 12:56:06,187 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-10 12:56:06,187 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-10 12:56:06,188 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-10 12:56:06,188 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-11-10 12:56:06,188 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-10 12:56:06,189 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-10 12:56:06,189 INFO L133 SettingsManager]: * Use SBE=true [2018-11-10 12:56:06,189 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-10 12:56:06,189 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-10 12:56:06,189 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-10 12:56:06,189 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-10 12:56:06,189 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-10 12:56:06,190 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-10 12:56:06,190 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-10 12:56:06,190 INFO L133 SettingsManager]: * Use bitvectors instead of ints=true [2018-11-10 12:56:06,190 INFO L133 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2018-11-10 12:56:06,190 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-10 12:56:06,190 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-10 12:56:06,190 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-10 12:56:06,191 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-10 12:56:06,191 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-10 12:56:06,191 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-10 12:56:06,192 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-10 12:56:06,193 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-10 12:56:06,193 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-10 12:56:06,193 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-10 12:56:06,193 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-10 12:56:06,193 INFO L133 SettingsManager]: * Trace refinement strategy=WOLF [2018-11-10 12:56:06,193 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-10 12:56:06,193 INFO L133 SettingsManager]: * Command for external solver=cvc4nyu --tear-down-incremental --rewrite-divk --print-success --lang smt [2018-11-10 12:56:06,194 INFO L133 SettingsManager]: * Logic for external solver=AUFBV [2018-11-10 12:56:06,194 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_bb43665f-ba4e-4261-8e93-009ab10ba1c6/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 -> a2c46755d0cb80f6b2e7b990e0a1bd9a49737b84 [2018-11-10 12:56:06,221 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-10 12:56:06,231 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-10 12:56:06,234 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-10 12:56:06,235 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-10 12:56:06,235 INFO L276 PluginConnector]: CDTParser initialized [2018-11-10 12:56:06,236 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_bb43665f-ba4e-4261-8e93-009ab10ba1c6/bin-2019/uautomizer/../../sv-benchmarks/c/bitvector/byte_add_false-unreach-call_true-no-overflow_true-termination.i [2018-11-10 12:56:06,272 INFO L218 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_bb43665f-ba4e-4261-8e93-009ab10ba1c6/bin-2019/uautomizer/data/50882ca64/5cf90541a32842c6a0a93c7ad73e7bf3/FLAGcd7f6e862 [2018-11-10 12:56:06,592 INFO L298 CDTParser]: Found 1 translation units. [2018-11-10 12:56:06,592 INFO L158 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_bb43665f-ba4e-4261-8e93-009ab10ba1c6/sv-benchmarks/c/bitvector/byte_add_false-unreach-call_true-no-overflow_true-termination.i [2018-11-10 12:56:06,597 INFO L346 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_bb43665f-ba4e-4261-8e93-009ab10ba1c6/bin-2019/uautomizer/data/50882ca64/5cf90541a32842c6a0a93c7ad73e7bf3/FLAGcd7f6e862 [2018-11-10 12:56:06,607 INFO L354 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_bb43665f-ba4e-4261-8e93-009ab10ba1c6/bin-2019/uautomizer/data/50882ca64/5cf90541a32842c6a0a93c7ad73e7bf3 [2018-11-10 12:56:06,609 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-10 12:56:06,610 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2018-11-10 12:56:06,610 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-10 12:56:06,610 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-10 12:56:06,613 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-10 12:56:06,614 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 12:56:06" (1/1) ... [2018-11-10 12:56:06,616 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@51c9978e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 12:56:06, skipping insertion in model container [2018-11-10 12:56:06,616 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 12:56:06" (1/1) ... [2018-11-10 12:56:06,625 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-10 12:56:06,641 INFO L174 MainTranslator]: Built tables and reachable declarations [2018-11-10 12:56:06,772 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-11-10 12:56:06,775 INFO L189 MainTranslator]: Completed pre-run [2018-11-10 12:56:06,806 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-11-10 12:56:06,818 INFO L193 MainTranslator]: Completed translation [2018-11-10 12:56:06,818 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 12:56:06 WrapperNode [2018-11-10 12:56:06,818 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-10 12:56:06,819 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-10 12:56:06,819 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-10 12:56:06,819 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-10 12:56:06,830 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 12:56:06" (1/1) ... [2018-11-10 12:56:06,830 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 12:56:06" (1/1) ... [2018-11-10 12:56:06,838 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 12:56:06" (1/1) ... [2018-11-10 12:56:06,838 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 12:56:06" (1/1) ... [2018-11-10 12:56:06,844 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 12:56:06" (1/1) ... [2018-11-10 12:56:06,850 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 12:56:06" (1/1) ... [2018-11-10 12:56:06,851 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 12:56:06" (1/1) ... [2018-11-10 12:56:06,854 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-10 12:56:06,854 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-10 12:56:06,854 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-10 12:56:06,854 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-10 12:56:06,856 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 12:56:06" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_bb43665f-ba4e-4261-8e93-009ab10ba1c6/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-10 12:56:06,938 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-10 12:56:06,938 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-10 12:56:06,938 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2018-11-10 12:56:06,939 INFO L138 BoogieDeclarations]: Found implementation of procedure mp_add [2018-11-10 12:56:06,939 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-10 12:56:06,939 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2018-11-10 12:56:06,939 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_uint [2018-11-10 12:56:06,939 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2018-11-10 12:56:06,939 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2018-11-10 12:56:06,939 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_perror_fail [2018-11-10 12:56:06,939 INFO L130 BoogieDeclarations]: Found specification of procedure __assert [2018-11-10 12:56:06,940 INFO L130 BoogieDeclarations]: Found specification of procedure mp_add [2018-11-10 12:56:06,940 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-10 12:56:06,940 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-10 12:56:06,940 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-10 12:56:07,164 INFO L341 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-10 12:56:07,164 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.11 12:56:07 BoogieIcfgContainer [2018-11-10 12:56:07,164 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-10 12:56:07,165 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-10 12:56:07,165 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-10 12:56:07,168 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-10 12:56:07,168 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.11 12:56:06" (1/3) ... [2018-11-10 12:56:07,169 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@528886de and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.11 12:56:07, skipping insertion in model container [2018-11-10 12:56:07,169 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 12:56:06" (2/3) ... [2018-11-10 12:56:07,169 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@528886de and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.11 12:56:07, skipping insertion in model container [2018-11-10 12:56:07,170 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.11 12:56:07" (3/3) ... [2018-11-10 12:56:07,172 INFO L112 eAbstractionObserver]: Analyzing ICFG byte_add_false-unreach-call_true-no-overflow_true-termination.i [2018-11-10 12:56:07,181 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-10 12:56:07,188 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-11-10 12:56:07,199 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-11-10 12:56:07,219 INFO L135 ementStrategyFactory]: Using default assertion order modulation [2018-11-10 12:56:07,219 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-10 12:56:07,219 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-10 12:56:07,219 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-10 12:56:07,219 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-10 12:56:07,219 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-10 12:56:07,220 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-10 12:56:07,220 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-10 12:56:07,220 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-10 12:56:07,234 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states. [2018-11-10 12:56:07,238 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2018-11-10 12:56:07,238 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 12:56:07,239 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 12:56:07,241 INFO L424 AbstractCegarLoop]: === Iteration 1 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 12:56:07,244 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 12:56:07,244 INFO L82 PathProgramCache]: Analyzing trace with hash -486194587, now seen corresponding path program 1 times [2018-11-10 12:56:07,247 INFO L225 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-10 12:56:07,247 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_bb43665f-ba4e-4261-8e93-009ab10ba1c6/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-10 12:56:07,267 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 12:56:07,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 12:56:07,309 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 12:56:07,320 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-10 12:56:07,320 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-10 12:56:07,324 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 12:56:07,324 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-10 12:56:07,327 INFO L460 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-11-10 12:56:07,334 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-11-10 12:56:07,335 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-11-10 12:56:07,336 INFO L87 Difference]: Start difference. First operand 56 states. Second operand 2 states. [2018-11-10 12:56:07,354 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 12:56:07,354 INFO L93 Difference]: Finished difference Result 79 states and 115 transitions. [2018-11-10 12:56:07,354 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-11-10 12:56:07,355 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 21 [2018-11-10 12:56:07,355 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 12:56:07,362 INFO L225 Difference]: With dead ends: 79 [2018-11-10 12:56:07,362 INFO L226 Difference]: Without dead ends: 49 [2018-11-10 12:56:07,364 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 20 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-10 12:56:07,374 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2018-11-10 12:56:07,386 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 49. [2018-11-10 12:56:07,388 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 49 states. [2018-11-10 12:56:07,389 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 75 transitions. [2018-11-10 12:56:07,390 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 75 transitions. Word has length 21 [2018-11-10 12:56:07,390 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 12:56:07,390 INFO L481 AbstractCegarLoop]: Abstraction has 49 states and 75 transitions. [2018-11-10 12:56:07,390 INFO L482 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-11-10 12:56:07,390 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 75 transitions. [2018-11-10 12:56:07,391 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-11-10 12:56:07,391 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 12:56:07,392 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 12:56:07,392 INFO L424 AbstractCegarLoop]: === Iteration 2 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 12:56:07,392 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 12:56:07,392 INFO L82 PathProgramCache]: Analyzing trace with hash -1212978296, now seen corresponding path program 1 times [2018-11-10 12:56:07,393 INFO L225 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-10 12:56:07,393 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_bb43665f-ba4e-4261-8e93-009ab10ba1c6/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-10 12:56:07,414 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 12:56:07,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 12:56:07,443 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 12:56:07,479 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-10 12:56:07,480 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-10 12:56:07,484 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 12:56:07,484 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-10 12:56:07,485 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-10 12:56:07,485 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-10 12:56:07,485 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-11-10 12:56:07,485 INFO L87 Difference]: Start difference. First operand 49 states and 75 transitions. Second operand 4 states. [2018-11-10 12:56:07,691 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 12:56:07,691 INFO L93 Difference]: Finished difference Result 138 states and 227 transitions. [2018-11-10 12:56:07,692 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-10 12:56:07,692 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 23 [2018-11-10 12:56:07,692 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 12:56:07,694 INFO L225 Difference]: With dead ends: 138 [2018-11-10 12:56:07,695 INFO L226 Difference]: Without dead ends: 104 [2018-11-10 12:56:07,695 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-11-10 12:56:07,696 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104 states. [2018-11-10 12:56:07,704 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104 to 99. [2018-11-10 12:56:07,705 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 99 states. [2018-11-10 12:56:07,706 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 151 transitions. [2018-11-10 12:56:07,706 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 151 transitions. Word has length 23 [2018-11-10 12:56:07,707 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 12:56:07,707 INFO L481 AbstractCegarLoop]: Abstraction has 99 states and 151 transitions. [2018-11-10 12:56:07,707 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-10 12:56:07,707 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 151 transitions. [2018-11-10 12:56:07,708 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-11-10 12:56:07,708 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 12:56:07,709 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 12:56:07,709 INFO L424 AbstractCegarLoop]: === Iteration 3 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 12:56:07,709 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 12:56:07,709 INFO L82 PathProgramCache]: Analyzing trace with hash -1536350606, now seen corresponding path program 1 times [2018-11-10 12:56:07,709 INFO L225 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-10 12:56:07,710 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_bb43665f-ba4e-4261-8e93-009ab10ba1c6/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-10 12:56:07,733 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 12:56:07,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 12:56:07,758 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 12:56:07,779 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-10 12:56:07,779 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-10 12:56:07,782 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 12:56:07,782 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-10 12:56:07,783 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-10 12:56:07,783 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-10 12:56:07,783 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2018-11-10 12:56:07,783 INFO L87 Difference]: Start difference. First operand 99 states and 151 transitions. Second operand 5 states. [2018-11-10 12:56:07,978 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 12:56:07,978 INFO L93 Difference]: Finished difference Result 191 states and 306 transitions. [2018-11-10 12:56:07,979 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-10 12:56:07,979 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 24 [2018-11-10 12:56:07,979 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 12:56:07,981 INFO L225 Difference]: With dead ends: 191 [2018-11-10 12:56:07,981 INFO L226 Difference]: Without dead ends: 157 [2018-11-10 12:56:07,982 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2018-11-10 12:56:07,982 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 157 states. [2018-11-10 12:56:07,991 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 157 to 99. [2018-11-10 12:56:07,991 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 99 states. [2018-11-10 12:56:07,992 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 151 transitions. [2018-11-10 12:56:07,992 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 151 transitions. Word has length 24 [2018-11-10 12:56:07,992 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 12:56:07,992 INFO L481 AbstractCegarLoop]: Abstraction has 99 states and 151 transitions. [2018-11-10 12:56:07,993 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-10 12:56:07,993 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 151 transitions. [2018-11-10 12:56:07,993 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-11-10 12:56:07,993 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 12:56:07,994 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 12:56:07,994 INFO L424 AbstractCegarLoop]: === Iteration 4 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 12:56:07,994 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 12:56:07,994 INFO L82 PathProgramCache]: Analyzing trace with hash -888363149, now seen corresponding path program 1 times [2018-11-10 12:56:07,995 INFO L225 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-10 12:56:07,995 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_bb43665f-ba4e-4261-8e93-009ab10ba1c6/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-10 12:56:08,018 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 12:56:08,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 12:56:08,046 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 12:56:08,084 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-10 12:56:08,084 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-10 12:56:08,088 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 12:56:08,088 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-11-10 12:56:08,088 INFO L460 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-11-10 12:56:08,088 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-11-10 12:56:08,089 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2018-11-10 12:56:08,089 INFO L87 Difference]: Start difference. First operand 99 states and 151 transitions. Second operand 7 states. [2018-11-10 12:56:08,216 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 12:56:08,216 INFO L93 Difference]: Finished difference Result 240 states and 377 transitions. [2018-11-10 12:56:08,217 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-10 12:56:08,217 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 25 [2018-11-10 12:56:08,217 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 12:56:08,219 INFO L225 Difference]: With dead ends: 240 [2018-11-10 12:56:08,219 INFO L226 Difference]: Without dead ends: 206 [2018-11-10 12:56:08,219 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2018-11-10 12:56:08,220 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 206 states. [2018-11-10 12:56:08,229 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 206 to 135. [2018-11-10 12:56:08,230 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 135 states. [2018-11-10 12:56:08,231 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 135 states to 135 states and 204 transitions. [2018-11-10 12:56:08,231 INFO L78 Accepts]: Start accepts. Automaton has 135 states and 204 transitions. Word has length 25 [2018-11-10 12:56:08,232 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 12:56:08,232 INFO L481 AbstractCegarLoop]: Abstraction has 135 states and 204 transitions. [2018-11-10 12:56:08,232 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-11-10 12:56:08,232 INFO L276 IsEmpty]: Start isEmpty. Operand 135 states and 204 transitions. [2018-11-10 12:56:08,233 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-11-10 12:56:08,233 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 12:56:08,233 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 12:56:08,233 INFO L424 AbstractCegarLoop]: === Iteration 5 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 12:56:08,234 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 12:56:08,234 INFO L82 PathProgramCache]: Analyzing trace with hash -1909431503, now seen corresponding path program 1 times [2018-11-10 12:56:08,234 INFO L225 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-10 12:56:08,235 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_bb43665f-ba4e-4261-8e93-009ab10ba1c6/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-10 12:56:08,259 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 12:56:08,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 12:56:08,282 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 12:56:08,305 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-10 12:56:08,305 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-10 12:56:08,309 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 12:56:08,309 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-11-10 12:56:08,310 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-10 12:56:08,310 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-10 12:56:08,310 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2018-11-10 12:56:08,310 INFO L87 Difference]: Start difference. First operand 135 states and 204 transitions. Second operand 6 states. [2018-11-10 12:56:08,527 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 12:56:08,527 INFO L93 Difference]: Finished difference Result 260 states and 399 transitions. [2018-11-10 12:56:08,528 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-10 12:56:08,528 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 25 [2018-11-10 12:56:08,528 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 12:56:08,529 INFO L225 Difference]: With dead ends: 260 [2018-11-10 12:56:08,529 INFO L226 Difference]: Without dead ends: 226 [2018-11-10 12:56:08,529 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2018-11-10 12:56:08,530 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 226 states. [2018-11-10 12:56:08,537 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 226 to 105. [2018-11-10 12:56:08,538 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 105 states. [2018-11-10 12:56:08,539 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 150 transitions. [2018-11-10 12:56:08,539 INFO L78 Accepts]: Start accepts. Automaton has 105 states and 150 transitions. Word has length 25 [2018-11-10 12:56:08,539 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 12:56:08,539 INFO L481 AbstractCegarLoop]: Abstraction has 105 states and 150 transitions. [2018-11-10 12:56:08,539 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-10 12:56:08,539 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 150 transitions. [2018-11-10 12:56:08,540 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2018-11-10 12:56:08,540 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 12:56:08,541 INFO L375 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 12:56:08,541 INFO L424 AbstractCegarLoop]: === Iteration 6 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 12:56:08,541 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 12:56:08,541 INFO L82 PathProgramCache]: Analyzing trace with hash 90534596, now seen corresponding path program 1 times [2018-11-10 12:56:08,541 INFO L225 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-10 12:56:08,541 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_bb43665f-ba4e-4261-8e93-009ab10ba1c6/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-10 12:56:08,553 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 12:56:08,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 12:56:08,576 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 12:56:08,587 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 12:56:08,587 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-10 12:56:08,591 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 12:56:08,591 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-10 12:56:08,592 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-10 12:56:08,592 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-10 12:56:08,592 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-11-10 12:56:08,592 INFO L87 Difference]: Start difference. First operand 105 states and 150 transitions. Second operand 4 states. [2018-11-10 12:56:08,680 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 12:56:08,680 INFO L93 Difference]: Finished difference Result 268 states and 386 transitions. [2018-11-10 12:56:08,680 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-10 12:56:08,680 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 37 [2018-11-10 12:56:08,680 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 12:56:08,681 INFO L225 Difference]: With dead ends: 268 [2018-11-10 12:56:08,681 INFO L226 Difference]: Without dead ends: 190 [2018-11-10 12:56:08,682 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-11-10 12:56:08,682 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 190 states. [2018-11-10 12:56:08,690 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 190 to 173. [2018-11-10 12:56:08,690 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 173 states. [2018-11-10 12:56:08,691 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 173 states to 173 states and 248 transitions. [2018-11-10 12:56:08,691 INFO L78 Accepts]: Start accepts. Automaton has 173 states and 248 transitions. Word has length 37 [2018-11-10 12:56:08,692 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 12:56:08,692 INFO L481 AbstractCegarLoop]: Abstraction has 173 states and 248 transitions. [2018-11-10 12:56:08,692 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-10 12:56:08,692 INFO L276 IsEmpty]: Start isEmpty. Operand 173 states and 248 transitions. [2018-11-10 12:56:08,694 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2018-11-10 12:56:08,694 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 12:56:08,694 INFO L375 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 12:56:08,694 INFO L424 AbstractCegarLoop]: === Iteration 7 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 12:56:08,694 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 12:56:08,694 INFO L82 PathProgramCache]: Analyzing trace with hash 431468861, now seen corresponding path program 1 times [2018-11-10 12:56:08,695 INFO L225 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-10 12:56:08,695 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_bb43665f-ba4e-4261-8e93-009ab10ba1c6/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-10 12:56:08,718 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 12:56:08,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 12:56:08,747 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 12:56:08,773 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 12:56:08,773 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-10 12:56:08,774 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 12:56:08,774 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-10 12:56:08,774 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-10 12:56:08,775 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-10 12:56:08,775 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2018-11-10 12:56:08,775 INFO L87 Difference]: Start difference. First operand 173 states and 248 transitions. Second operand 5 states. [2018-11-10 12:56:08,895 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 12:56:08,895 INFO L93 Difference]: Finished difference Result 349 states and 502 transitions. [2018-11-10 12:56:08,895 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-10 12:56:08,895 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 38 [2018-11-10 12:56:08,896 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 12:56:08,897 INFO L225 Difference]: With dead ends: 349 [2018-11-10 12:56:08,897 INFO L226 Difference]: Without dead ends: 271 [2018-11-10 12:56:08,897 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2018-11-10 12:56:08,898 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 271 states. [2018-11-10 12:56:08,907 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 271 to 173. [2018-11-10 12:56:08,907 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 173 states. [2018-11-10 12:56:08,908 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 173 states to 173 states and 248 transitions. [2018-11-10 12:56:08,908 INFO L78 Accepts]: Start accepts. Automaton has 173 states and 248 transitions. Word has length 38 [2018-11-10 12:56:08,909 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 12:56:08,909 INFO L481 AbstractCegarLoop]: Abstraction has 173 states and 248 transitions. [2018-11-10 12:56:08,909 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-10 12:56:08,909 INFO L276 IsEmpty]: Start isEmpty. Operand 173 states and 248 transitions. [2018-11-10 12:56:08,910 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2018-11-10 12:56:08,910 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 12:56:08,910 INFO L375 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 12:56:08,910 INFO L424 AbstractCegarLoop]: === Iteration 8 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 12:56:08,911 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 12:56:08,912 INFO L82 PathProgramCache]: Analyzing trace with hash -747145201, now seen corresponding path program 1 times [2018-11-10 12:56:08,912 INFO L225 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-10 12:56:08,913 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_bb43665f-ba4e-4261-8e93-009ab10ba1c6/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-10 12:56:08,940 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 12:56:08,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 12:56:08,965 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 12:56:08,994 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 12:56:08,995 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-10 12:56:08,996 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 12:56:08,996 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-11-10 12:56:08,996 INFO L460 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-11-10 12:56:08,996 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-11-10 12:56:08,996 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2018-11-10 12:56:08,997 INFO L87 Difference]: Start difference. First operand 173 states and 248 transitions. Second operand 7 states. [2018-11-10 12:56:09,099 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 12:56:09,100 INFO L93 Difference]: Finished difference Result 424 states and 606 transitions. [2018-11-10 12:56:09,100 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-10 12:56:09,100 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 39 [2018-11-10 12:56:09,100 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 12:56:09,101 INFO L225 Difference]: With dead ends: 424 [2018-11-10 12:56:09,101 INFO L226 Difference]: Without dead ends: 346 [2018-11-10 12:56:09,102 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 33 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2018-11-10 12:56:09,102 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 346 states. [2018-11-10 12:56:09,111 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 346 to 233. [2018-11-10 12:56:09,111 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 233 states. [2018-11-10 12:56:09,111 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 233 states to 233 states and 330 transitions. [2018-11-10 12:56:09,112 INFO L78 Accepts]: Start accepts. Automaton has 233 states and 330 transitions. Word has length 39 [2018-11-10 12:56:09,112 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 12:56:09,112 INFO L481 AbstractCegarLoop]: Abstraction has 233 states and 330 transitions. [2018-11-10 12:56:09,112 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-11-10 12:56:09,112 INFO L276 IsEmpty]: Start isEmpty. Operand 233 states and 330 transitions. [2018-11-10 12:56:09,113 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2018-11-10 12:56:09,113 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 12:56:09,113 INFO L375 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 12:56:09,115 INFO L424 AbstractCegarLoop]: === Iteration 9 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 12:56:09,115 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 12:56:09,115 INFO L82 PathProgramCache]: Analyzing trace with hash -1256618291, now seen corresponding path program 1 times [2018-11-10 12:56:09,115 INFO L225 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-10 12:56:09,115 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_bb43665f-ba4e-4261-8e93-009ab10ba1c6/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-10 12:56:09,128 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 12:56:09,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 12:56:09,149 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 12:56:09,177 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 12:56:09,177 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-10 12:56:09,179 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 12:56:09,179 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-11-10 12:56:09,179 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-10 12:56:09,179 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-10 12:56:09,179 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2018-11-10 12:56:09,180 INFO L87 Difference]: Start difference. First operand 233 states and 330 transitions. Second operand 6 states. [2018-11-10 12:56:09,256 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 12:56:09,256 INFO L93 Difference]: Finished difference Result 422 states and 600 transitions. [2018-11-10 12:56:09,256 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-10 12:56:09,257 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 39 [2018-11-10 12:56:09,257 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 12:56:09,258 INFO L225 Difference]: With dead ends: 422 [2018-11-10 12:56:09,258 INFO L226 Difference]: Without dead ends: 344 [2018-11-10 12:56:09,258 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2018-11-10 12:56:09,258 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 344 states. [2018-11-10 12:56:09,263 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 344 to 165. [2018-11-10 12:56:09,263 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 165 states. [2018-11-10 12:56:09,264 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 165 states to 165 states and 230 transitions. [2018-11-10 12:56:09,264 INFO L78 Accepts]: Start accepts. Automaton has 165 states and 230 transitions. Word has length 39 [2018-11-10 12:56:09,264 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 12:56:09,264 INFO L481 AbstractCegarLoop]: Abstraction has 165 states and 230 transitions. [2018-11-10 12:56:09,264 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-10 12:56:09,264 INFO L276 IsEmpty]: Start isEmpty. Operand 165 states and 230 transitions. [2018-11-10 12:56:09,265 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2018-11-10 12:56:09,265 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 12:56:09,265 INFO L375 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 12:56:09,265 INFO L424 AbstractCegarLoop]: === Iteration 10 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 12:56:09,265 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 12:56:09,265 INFO L82 PathProgramCache]: Analyzing trace with hash -459438472, now seen corresponding path program 1 times [2018-11-10 12:56:09,266 INFO L225 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-10 12:56:09,266 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_bb43665f-ba4e-4261-8e93-009ab10ba1c6/bin-2019/uautomizer/cvc4nyu Starting monitored process 11 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 11 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-10 12:56:09,285 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 12:56:09,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 12:56:09,308 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 12:56:09,347 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 12:56:09,348 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-10 12:56:09,374 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 12:56:09,376 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-10 12:56:09,376 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 8 [2018-11-10 12:56:09,376 INFO L460 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-11-10 12:56:09,376 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-11-10 12:56:09,376 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2018-11-10 12:56:09,376 INFO L87 Difference]: Start difference. First operand 165 states and 230 transitions. Second operand 8 states. [2018-11-10 12:56:09,762 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 12:56:09,762 INFO L93 Difference]: Finished difference Result 594 states and 879 transitions. [2018-11-10 12:56:09,762 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-11-10 12:56:09,762 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 41 [2018-11-10 12:56:09,763 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 12:56:09,764 INFO L225 Difference]: With dead ends: 594 [2018-11-10 12:56:09,764 INFO L226 Difference]: Without dead ends: 516 [2018-11-10 12:56:09,764 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 85 GetRequests, 75 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=55, Invalid=77, Unknown=0, NotChecked=0, Total=132 [2018-11-10 12:56:09,765 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 516 states. [2018-11-10 12:56:09,774 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 516 to 426. [2018-11-10 12:56:09,774 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 426 states. [2018-11-10 12:56:09,776 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 426 states to 426 states and 597 transitions. [2018-11-10 12:56:09,776 INFO L78 Accepts]: Start accepts. Automaton has 426 states and 597 transitions. Word has length 41 [2018-11-10 12:56:09,776 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 12:56:09,776 INFO L481 AbstractCegarLoop]: Abstraction has 426 states and 597 transitions. [2018-11-10 12:56:09,776 INFO L482 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-11-10 12:56:09,777 INFO L276 IsEmpty]: Start isEmpty. Operand 426 states and 597 transitions. [2018-11-10 12:56:09,777 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2018-11-10 12:56:09,777 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 12:56:09,778 INFO L375 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 12:56:09,778 INFO L424 AbstractCegarLoop]: === Iteration 11 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 12:56:09,778 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 12:56:09,778 INFO L82 PathProgramCache]: Analyzing trace with hash 1134935459, now seen corresponding path program 1 times [2018-11-10 12:56:09,778 INFO L225 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-10 12:56:09,778 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_bb43665f-ba4e-4261-8e93-009ab10ba1c6/bin-2019/uautomizer/cvc4nyu Starting monitored process 12 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 12 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-10 12:56:09,793 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 12:56:09,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 12:56:09,818 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 12:56:09,862 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 12:56:09,862 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-10 12:56:09,888 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 12:56:09,889 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-10 12:56:09,889 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 8 [2018-11-10 12:56:09,889 INFO L460 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-11-10 12:56:09,889 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-11-10 12:56:09,889 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2018-11-10 12:56:09,890 INFO L87 Difference]: Start difference. First operand 426 states and 597 transitions. Second operand 8 states. [2018-11-10 12:56:10,392 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 12:56:10,392 INFO L93 Difference]: Finished difference Result 1359 states and 1989 transitions. [2018-11-10 12:56:10,393 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-11-10 12:56:10,393 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 43 [2018-11-10 12:56:10,393 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 12:56:10,396 INFO L225 Difference]: With dead ends: 1359 [2018-11-10 12:56:10,396 INFO L226 Difference]: Without dead ends: 1140 [2018-11-10 12:56:10,397 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 89 GetRequests, 79 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=55, Invalid=77, Unknown=0, NotChecked=0, Total=132 [2018-11-10 12:56:10,398 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1140 states. [2018-11-10 12:56:10,444 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1140 to 950. [2018-11-10 12:56:10,444 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 950 states. [2018-11-10 12:56:10,447 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 950 states to 950 states and 1344 transitions. [2018-11-10 12:56:10,447 INFO L78 Accepts]: Start accepts. Automaton has 950 states and 1344 transitions. Word has length 43 [2018-11-10 12:56:10,448 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 12:56:10,448 INFO L481 AbstractCegarLoop]: Abstraction has 950 states and 1344 transitions. [2018-11-10 12:56:10,448 INFO L482 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-11-10 12:56:10,448 INFO L276 IsEmpty]: Start isEmpty. Operand 950 states and 1344 transitions. [2018-11-10 12:56:10,449 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2018-11-10 12:56:10,449 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 12:56:10,449 INFO L375 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 12:56:10,449 INFO L424 AbstractCegarLoop]: === Iteration 12 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 12:56:10,449 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 12:56:10,450 INFO L82 PathProgramCache]: Analyzing trace with hash 1646069422, now seen corresponding path program 1 times [2018-11-10 12:56:10,450 INFO L225 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-10 12:56:10,450 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_bb43665f-ba4e-4261-8e93-009ab10ba1c6/bin-2019/uautomizer/cvc4nyu Starting monitored process 13 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 13 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-10 12:56:10,470 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 12:56:10,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 12:56:10,508 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 12:56:10,521 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 12:56:10,521 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-10 12:56:10,547 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 12:56:10,549 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-10 12:56:10,549 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 6 [2018-11-10 12:56:10,550 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-10 12:56:10,550 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-10 12:56:10,550 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2018-11-10 12:56:10,551 INFO L87 Difference]: Start difference. First operand 950 states and 1344 transitions. Second operand 6 states. [2018-11-10 12:56:10,828 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 12:56:10,828 INFO L93 Difference]: Finished difference Result 1749 states and 2641 transitions. [2018-11-10 12:56:10,829 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-10 12:56:10,829 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 45 [2018-11-10 12:56:10,829 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 12:56:10,834 INFO L225 Difference]: With dead ends: 1749 [2018-11-10 12:56:10,835 INFO L226 Difference]: Without dead ends: 1456 [2018-11-10 12:56:10,836 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 90 GetRequests, 85 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-10 12:56:10,837 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1456 states. [2018-11-10 12:56:10,902 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1456 to 1266. [2018-11-10 12:56:10,903 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1266 states. [2018-11-10 12:56:10,906 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1266 states to 1266 states and 1856 transitions. [2018-11-10 12:56:10,906 INFO L78 Accepts]: Start accepts. Automaton has 1266 states and 1856 transitions. Word has length 45 [2018-11-10 12:56:10,907 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 12:56:10,907 INFO L481 AbstractCegarLoop]: Abstraction has 1266 states and 1856 transitions. [2018-11-10 12:56:10,907 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-10 12:56:10,907 INFO L276 IsEmpty]: Start isEmpty. Operand 1266 states and 1856 transitions. [2018-11-10 12:56:10,909 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2018-11-10 12:56:10,909 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 12:56:10,910 INFO L375 BasicCegarLoop]: trace histogram [4, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 12:56:10,910 INFO L424 AbstractCegarLoop]: === Iteration 13 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 12:56:10,910 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 12:56:10,910 INFO L82 PathProgramCache]: Analyzing trace with hash 1760043162, now seen corresponding path program 1 times [2018-11-10 12:56:10,910 INFO L225 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-10 12:56:10,910 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_bb43665f-ba4e-4261-8e93-009ab10ba1c6/bin-2019/uautomizer/cvc4nyu Starting monitored process 14 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 14 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-10 12:56:10,930 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 12:56:10,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 12:56:10,987 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 12:56:12,034 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 25 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-11-10 12:56:12,034 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-10 12:56:14,250 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 0 proven. 27 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-11-10 12:56:14,252 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-10 12:56:14,252 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 23] total 44 [2018-11-10 12:56:14,252 INFO L460 AbstractCegarLoop]: Interpolant automaton has 44 states [2018-11-10 12:56:14,253 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 44 interpolants. [2018-11-10 12:56:14,254 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=179, Invalid=1713, Unknown=0, NotChecked=0, Total=1892 [2018-11-10 12:56:14,254 INFO L87 Difference]: Start difference. First operand 1266 states and 1856 transitions. Second operand 44 states. [2018-11-10 12:56:36,037 WARN L179 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 99 DAG size of output: 86 [2018-11-10 12:56:39,835 WARN L179 SmtUtils]: Spent 127.00 ms on a formula simplification. DAG size of input: 104 DAG size of output: 91 [2018-11-10 12:56:40,448 WARN L179 SmtUtils]: Spent 116.00 ms on a formula simplification. DAG size of input: 105 DAG size of output: 92 [2018-11-10 12:56:41,545 WARN L179 SmtUtils]: Spent 123.00 ms on a formula simplification. DAG size of input: 100 DAG size of output: 87 [2018-11-10 12:56:42,223 WARN L179 SmtUtils]: Spent 132.00 ms on a formula simplification. DAG size of input: 106 DAG size of output: 93 [2018-11-10 12:56:42,773 WARN L179 SmtUtils]: Spent 123.00 ms on a formula simplification. DAG size of input: 102 DAG size of output: 89 [2018-11-10 12:56:46,367 WARN L179 SmtUtils]: Spent 132.00 ms on a formula simplification. DAG size of input: 96 DAG size of output: 83 [2018-11-10 12:56:46,923 WARN L179 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 92 DAG size of output: 79 [2018-11-10 12:56:47,242 WARN L179 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 98 DAG size of output: 85 [2018-11-10 12:56:47,916 WARN L179 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 97 DAG size of output: 84 [2018-11-10 12:56:48,269 WARN L179 SmtUtils]: Spent 166.00 ms on a formula simplification. DAG size of input: 118 DAG size of output: 105 [2018-11-10 12:56:49,096 WARN L179 SmtUtils]: Spent 131.00 ms on a formula simplification. DAG size of input: 94 DAG size of output: 81 [2018-11-10 12:56:49,947 WARN L179 SmtUtils]: Spent 199.00 ms on a formula simplification. DAG size of input: 114 DAG size of output: 101 [2018-11-10 12:56:50,373 WARN L179 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 99 DAG size of output: 86 [2018-11-10 12:56:51,464 WARN L179 SmtUtils]: Spent 143.00 ms on a formula simplification. DAG size of input: 111 DAG size of output: 98 [2018-11-10 12:56:51,901 WARN L179 SmtUtils]: Spent 184.00 ms on a formula simplification. DAG size of input: 120 DAG size of output: 107 [2018-11-10 12:56:52,355 WARN L179 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 93 DAG size of output: 75 [2018-11-10 12:56:52,915 WARN L179 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 95 DAG size of output: 82 [2018-11-10 12:56:53,291 WARN L179 SmtUtils]: Spent 174.00 ms on a formula simplification. DAG size of input: 116 DAG size of output: 103 [2018-11-10 12:56:55,545 WARN L179 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 94 DAG size of output: 81 [2018-11-10 12:56:56,529 WARN L179 SmtUtils]: Spent 154.00 ms on a formula simplification. DAG size of input: 109 DAG size of output: 96 [2018-11-10 12:56:58,268 WARN L179 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 90 DAG size of output: 77 [2018-11-10 12:56:58,812 WARN L179 SmtUtils]: Spent 119.00 ms on a formula simplification. DAG size of input: 96 DAG size of output: 83 [2018-11-10 12:57:00,356 WARN L179 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 92 DAG size of output: 79 [2018-11-10 12:57:01,289 WARN L179 SmtUtils]: Spent 176.00 ms on a formula simplification. DAG size of input: 120 DAG size of output: 108 [2018-11-10 12:57:02,020 WARN L179 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 92 DAG size of output: 79 [2018-11-10 12:57:03,030 WARN L179 SmtUtils]: Spent 153.00 ms on a formula simplification. DAG size of input: 117 DAG size of output: 101 [2018-11-10 12:57:04,242 WARN L179 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 94 DAG size of output: 81 [2018-11-10 12:57:05,118 WARN L179 SmtUtils]: Spent 160.00 ms on a formula simplification. DAG size of input: 125 DAG size of output: 112 [2018-11-10 12:57:05,685 WARN L179 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 93 DAG size of output: 77 [2018-11-10 12:57:06,417 WARN L179 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 90 DAG size of output: 77 [2018-11-10 12:57:07,862 WARN L179 SmtUtils]: Spent 142.00 ms on a formula simplification. DAG size of input: 115 DAG size of output: 99 [2018-11-10 12:57:08,592 WARN L179 SmtUtils]: Spent 153.00 ms on a formula simplification. DAG size of input: 113 DAG size of output: 109 [2018-11-10 12:57:10,582 WARN L179 SmtUtils]: Spent 123.00 ms on a formula simplification. DAG size of input: 103 DAG size of output: 90 [2018-11-10 12:57:11,009 WARN L179 SmtUtils]: Spent 169.00 ms on a formula simplification. DAG size of input: 123 DAG size of output: 110 [2018-11-10 12:57:11,799 WARN L179 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 91 DAG size of output: 75 [2018-11-10 12:57:13,909 WARN L179 SmtUtils]: Spent 117.00 ms on a formula simplification. DAG size of input: 103 DAG size of output: 94 [2018-11-10 12:57:14,437 WARN L179 SmtUtils]: Spent 203.00 ms on a formula simplification. DAG size of input: 122 DAG size of output: 104 [2018-11-10 12:57:14,877 WARN L179 SmtUtils]: Spent 188.00 ms on a formula simplification. DAG size of input: 101 DAG size of output: 88 [2018-11-10 12:57:15,324 WARN L179 SmtUtils]: Spent 139.00 ms on a formula simplification. DAG size of input: 100 DAG size of output: 96 [2018-11-10 12:57:15,794 WARN L179 SmtUtils]: Spent 197.00 ms on a formula simplification. DAG size of input: 127 DAG size of output: 117 [2018-11-10 12:57:16,779 WARN L179 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 98 DAG size of output: 80 [2018-11-10 12:57:17,722 WARN L179 SmtUtils]: Spent 223.00 ms on a formula simplification. DAG size of input: 131 DAG size of output: 115 [2018-11-10 12:57:18,582 WARN L179 SmtUtils]: Spent 127.00 ms on a formula simplification. DAG size of input: 104 DAG size of output: 81 [2018-11-10 12:57:19,150 WARN L179 SmtUtils]: Spent 203.00 ms on a formula simplification. DAG size of input: 120 DAG size of output: 102 [2018-11-10 12:57:20,056 WARN L179 SmtUtils]: Spent 132.00 ms on a formula simplification. DAG size of input: 105 DAG size of output: 96 [2018-11-10 12:57:20,695 WARN L179 SmtUtils]: Spent 140.00 ms on a formula simplification. DAG size of input: 109 DAG size of output: 93 [2018-11-10 12:57:21,148 WARN L179 SmtUtils]: Spent 169.00 ms on a formula simplification. DAG size of input: 124 DAG size of output: 106 [2018-11-10 12:57:22,046 WARN L179 SmtUtils]: Spent 149.00 ms on a formula simplification. DAG size of input: 96 DAG size of output: 78 [2018-11-10 12:57:22,937 WARN L179 SmtUtils]: Spent 195.00 ms on a formula simplification. DAG size of input: 129 DAG size of output: 113 [2018-11-10 12:57:23,498 WARN L179 SmtUtils]: Spent 168.00 ms on a formula simplification. DAG size of input: 120 DAG size of output: 116 [2018-11-10 12:57:25,728 WARN L179 SmtUtils]: Spent 134.00 ms on a formula simplification. DAG size of input: 107 DAG size of output: 91 [2018-11-10 12:57:26,312 WARN L179 SmtUtils]: Spent 150.00 ms on a formula simplification. DAG size of input: 122 DAG size of output: 104 [2018-11-10 12:57:27,724 WARN L179 SmtUtils]: Spent 210.00 ms on a formula simplification. DAG size of input: 136 DAG size of output: 118 [2018-11-10 12:57:28,164 WARN L179 SmtUtils]: Spent 131.00 ms on a formula simplification. DAG size of input: 107 DAG size of output: 103 [2018-11-10 12:57:28,842 WARN L179 SmtUtils]: Spent 208.00 ms on a formula simplification. DAG size of input: 133 DAG size of output: 120 [2018-11-10 12:57:29,559 WARN L179 SmtUtils]: Spent 160.00 ms on a formula simplification. DAG size of input: 114 DAG size of output: 96 [2018-11-10 12:57:31,016 WARN L179 SmtUtils]: Spent 245.00 ms on a formula simplification. DAG size of input: 134 DAG size of output: 116 [2018-11-10 12:57:31,382 WARN L179 SmtUtils]: Spent 137.00 ms on a formula simplification. DAG size of input: 107 DAG size of output: 94 [2018-11-10 12:57:31,806 WARN L179 SmtUtils]: Spent 164.00 ms on a formula simplification. DAG size of input: 113 DAG size of output: 100 [2018-11-10 12:57:32,753 WARN L179 SmtUtils]: Spent 262.00 ms on a formula simplification. DAG size of input: 138 DAG size of output: 120 [2018-11-10 12:57:33,721 WARN L179 SmtUtils]: Spent 173.00 ms on a formula simplification. DAG size of input: 112 DAG size of output: 94 [2018-11-10 12:57:35,264 WARN L179 SmtUtils]: Spent 176.00 ms on a formula simplification. DAG size of input: 126 DAG size of output: 119 [2018-11-10 12:57:36,540 WARN L179 SmtUtils]: Spent 122.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 76 [2018-11-10 12:57:37,104 WARN L179 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 96 DAG size of output: 81 [2018-11-10 12:57:38,073 WARN L179 SmtUtils]: Spent 188.00 ms on a formula simplification. DAG size of input: 136 DAG size of output: 118 [2018-11-10 12:57:40,044 WARN L179 SmtUtils]: Spent 182.00 ms on a formula simplification. DAG size of input: 113 DAG size of output: 106 [2018-11-10 12:57:40,717 WARN L179 SmtUtils]: Spent 227.00 ms on a formula simplification. DAG size of input: 138 DAG size of output: 123 [2018-11-10 12:57:41,321 WARN L179 SmtUtils]: Spent 172.00 ms on a formula simplification. DAG size of input: 113 DAG size of output: 97 [2018-11-10 12:57:41,958 WARN L179 SmtUtils]: Spent 205.00 ms on a formula simplification. DAG size of input: 119 DAG size of output: 103 [2018-11-10 12:57:42,574 WARN L179 SmtUtils]: Spent 207.00 ms on a formula simplification. DAG size of input: 121 DAG size of output: 108 [2018-11-10 12:57:43,424 WARN L179 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 73 [2018-11-10 12:57:43,946 WARN L179 SmtUtils]: Spent 185.00 ms on a formula simplification. DAG size of input: 127 DAG size of output: 114 [2018-11-10 12:57:44,667 WARN L179 SmtUtils]: Spent 129.00 ms on a formula simplification. DAG size of input: 95 DAG size of output: 79 [2018-11-10 12:57:46,551 WARN L179 SmtUtils]: Spent 198.00 ms on a formula simplification. DAG size of input: 131 DAG size of output: 122 [2018-11-10 12:57:47,029 WARN L179 SmtUtils]: Spent 143.00 ms on a formula simplification. DAG size of input: 99 DAG size of output: 86 [2018-11-10 12:57:47,553 WARN L179 SmtUtils]: Spent 140.00 ms on a formula simplification. DAG size of input: 105 DAG size of output: 92 [2018-11-10 12:57:48,148 WARN L179 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 96 DAG size of output: 87 [2018-11-10 12:57:48,804 WARN L179 SmtUtils]: Spent 175.00 ms on a formula simplification. DAG size of input: 118 DAG size of output: 100 [2018-11-10 12:57:49,442 WARN L179 SmtUtils]: Spent 153.00 ms on a formula simplification. DAG size of input: 124 DAG size of output: 106 [2018-11-10 12:57:50,503 WARN L179 SmtUtils]: Spent 118.00 ms on a formula simplification. DAG size of input: 94 DAG size of output: 76 [2018-11-10 12:57:51,386 WARN L179 SmtUtils]: Spent 122.00 ms on a formula simplification. DAG size of input: 100 DAG size of output: 82 [2018-11-10 12:57:52,066 WARN L179 SmtUtils]: Spent 138.00 ms on a formula simplification. DAG size of input: 118 DAG size of output: 109 [2018-11-10 12:57:52,885 WARN L179 SmtUtils]: Spent 235.00 ms on a formula simplification. DAG size of input: 127 DAG size of output: 111 [2018-11-10 12:57:53,673 WARN L179 SmtUtils]: Spent 207.00 ms on a formula simplification. DAG size of input: 133 DAG size of output: 117 [2018-11-10 12:57:54,570 WARN L179 SmtUtils]: Spent 135.00 ms on a formula simplification. DAG size of input: 105 DAG size of output: 89 [2018-11-10 12:57:55,277 WARN L179 SmtUtils]: Spent 161.00 ms on a formula simplification. DAG size of input: 120 DAG size of output: 102 [2018-11-10 12:57:56,201 WARN L179 SmtUtils]: Spent 144.00 ms on a formula simplification. DAG size of input: 111 DAG size of output: 95 [2018-11-10 12:57:56,938 WARN L179 SmtUtils]: Spent 196.00 ms on a formula simplification. DAG size of input: 126 DAG size of output: 108 [2018-11-10 12:57:58,502 WARN L179 SmtUtils]: Spent 149.00 ms on a formula simplification. DAG size of input: 120 DAG size of output: 111 [2018-11-10 12:57:58,976 WARN L179 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 100 DAG size of output: 91 [2018-11-10 12:57:59,901 WARN L179 SmtUtils]: Spent 249.00 ms on a formula simplification. DAG size of input: 132 DAG size of output: 114 [2018-11-10 12:58:00,660 WARN L179 SmtUtils]: Spent 209.00 ms on a formula simplification. DAG size of input: 138 DAG size of output: 120 [2018-11-10 12:58:01,747 WARN L179 SmtUtils]: Spent 163.00 ms on a formula simplification. DAG size of input: 110 DAG size of output: 92 [2018-11-10 12:58:02,720 WARN L179 SmtUtils]: Spent 233.00 ms on a formula simplification. DAG size of input: 116 DAG size of output: 98 [2018-11-10 12:58:03,897 WARN L179 SmtUtils]: Spent 231.00 ms on a formula simplification. DAG size of input: 134 DAG size of output: 116 [2018-11-10 12:58:04,592 WARN L179 SmtUtils]: Spent 196.00 ms on a formula simplification. DAG size of input: 140 DAG size of output: 122 [2018-11-10 12:58:04,659 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 12:58:04,659 INFO L93 Difference]: Finished difference Result 11117 states and 16413 transitions. [2018-11-10 12:58:04,660 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 291 states. [2018-11-10 12:58:04,660 INFO L78 Accepts]: Start accepts. Automaton has 44 states. Word has length 66 [2018-11-10 12:58:04,660 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 12:58:04,690 INFO L225 Difference]: With dead ends: 11117 [2018-11-10 12:58:04,690 INFO L226 Difference]: Without dead ends: 10912 [2018-11-10 12:58:04,705 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 414 GetRequests, 88 SyntacticMatches, 1 SemanticMatches, 325 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 39893 ImplicationChecksByTransitivity, 93.8s TimeCoverageRelationStatistics Valid=21910, Invalid=84692, Unknown=0, NotChecked=0, Total=106602 [2018-11-10 12:58:04,711 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10912 states. [2018-11-10 12:58:05,006 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10912 to 4595. [2018-11-10 12:58:05,006 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4595 states. [2018-11-10 12:58:05,015 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4595 states to 4595 states and 6961 transitions. [2018-11-10 12:58:05,015 INFO L78 Accepts]: Start accepts. Automaton has 4595 states and 6961 transitions. Word has length 66 [2018-11-10 12:58:05,015 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 12:58:05,015 INFO L481 AbstractCegarLoop]: Abstraction has 4595 states and 6961 transitions. [2018-11-10 12:58:05,015 INFO L482 AbstractCegarLoop]: Interpolant automaton has 44 states. [2018-11-10 12:58:05,015 INFO L276 IsEmpty]: Start isEmpty. Operand 4595 states and 6961 transitions. [2018-11-10 12:58:05,018 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2018-11-10 12:58:05,018 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 12:58:05,018 INFO L375 BasicCegarLoop]: trace histogram [4, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 12:58:05,018 INFO L424 AbstractCegarLoop]: === Iteration 14 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 12:58:05,019 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 12:58:05,019 INFO L82 PathProgramCache]: Analyzing trace with hash 942394712, now seen corresponding path program 1 times [2018-11-10 12:58:05,019 INFO L225 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-10 12:58:05,019 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_bb43665f-ba4e-4261-8e93-009ab10ba1c6/bin-2019/uautomizer/cvc4nyu Starting monitored process 15 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 15 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-10 12:58:05,038 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 12:58:05,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 12:58:05,064 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 12:58:05,112 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 18 proven. 7 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-11-10 12:58:05,113 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-10 12:58:05,156 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 18 proven. 7 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-11-10 12:58:05,157 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-10 12:58:05,157 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 5] total 8 [2018-11-10 12:58:05,158 INFO L460 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-11-10 12:58:05,158 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-11-10 12:58:05,158 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2018-11-10 12:58:05,158 INFO L87 Difference]: Start difference. First operand 4595 states and 6961 transitions. Second operand 8 states. [2018-11-10 12:58:06,051 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 12:58:06,051 INFO L93 Difference]: Finished difference Result 10352 states and 15745 transitions. [2018-11-10 12:58:06,052 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-11-10 12:58:06,052 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 66 [2018-11-10 12:58:06,052 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 12:58:06,066 INFO L225 Difference]: With dead ends: 10352 [2018-11-10 12:58:06,066 INFO L226 Difference]: Without dead ends: 5838 [2018-11-10 12:58:06,073 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 140 GetRequests, 122 SyntacticMatches, 3 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 36 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=49, Invalid=223, Unknown=0, NotChecked=0, Total=272 [2018-11-10 12:58:06,078 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5838 states. [2018-11-10 12:58:06,259 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5838 to 4999. [2018-11-10 12:58:06,259 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4999 states. [2018-11-10 12:58:06,263 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4999 states to 4999 states and 7364 transitions. [2018-11-10 12:58:06,264 INFO L78 Accepts]: Start accepts. Automaton has 4999 states and 7364 transitions. Word has length 66 [2018-11-10 12:58:06,264 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 12:58:06,264 INFO L481 AbstractCegarLoop]: Abstraction has 4999 states and 7364 transitions. [2018-11-10 12:58:06,264 INFO L482 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-11-10 12:58:06,264 INFO L276 IsEmpty]: Start isEmpty. Operand 4999 states and 7364 transitions. [2018-11-10 12:58:06,265 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2018-11-10 12:58:06,265 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 12:58:06,265 INFO L375 BasicCegarLoop]: trace histogram [4, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 12:58:06,266 INFO L424 AbstractCegarLoop]: === Iteration 15 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 12:58:06,266 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 12:58:06,266 INFO L82 PathProgramCache]: Analyzing trace with hash -689556968, now seen corresponding path program 1 times [2018-11-10 12:58:06,266 INFO L225 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-10 12:58:06,266 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_bb43665f-ba4e-4261-8e93-009ab10ba1c6/bin-2019/uautomizer/cvc4nyu Starting monitored process 16 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 16 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-10 12:58:06,278 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 12:58:06,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 12:58:06,296 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 12:58:06,310 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2018-11-10 12:58:06,310 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-10 12:58:06,316 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 12:58:06,316 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-10 12:58:06,316 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-10 12:58:06,316 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-10 12:58:06,316 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-10 12:58:06,317 INFO L87 Difference]: Start difference. First operand 4999 states and 7364 transitions. Second operand 3 states. [2018-11-10 12:58:06,507 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 12:58:06,507 INFO L93 Difference]: Finished difference Result 5977 states and 8575 transitions. [2018-11-10 12:58:06,508 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-10 12:58:06,508 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 66 [2018-11-10 12:58:06,508 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 12:58:06,517 INFO L225 Difference]: With dead ends: 5977 [2018-11-10 12:58:06,517 INFO L226 Difference]: Without dead ends: 5909 [2018-11-10 12:58:06,518 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 64 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-10 12:58:06,522 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5909 states. [2018-11-10 12:58:06,667 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5909 to 5342. [2018-11-10 12:58:06,667 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5342 states. [2018-11-10 12:58:06,671 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5342 states to 5342 states and 7817 transitions. [2018-11-10 12:58:06,671 INFO L78 Accepts]: Start accepts. Automaton has 5342 states and 7817 transitions. Word has length 66 [2018-11-10 12:58:06,671 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 12:58:06,672 INFO L481 AbstractCegarLoop]: Abstraction has 5342 states and 7817 transitions. [2018-11-10 12:58:06,672 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-10 12:58:06,672 INFO L276 IsEmpty]: Start isEmpty. Operand 5342 states and 7817 transitions. [2018-11-10 12:58:06,674 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2018-11-10 12:58:06,674 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 12:58:06,674 INFO L375 BasicCegarLoop]: trace histogram [4, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 12:58:06,674 INFO L424 AbstractCegarLoop]: === Iteration 16 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 12:58:06,674 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 12:58:06,674 INFO L82 PathProgramCache]: Analyzing trace with hash -2091023460, now seen corresponding path program 1 times [2018-11-10 12:58:06,675 INFO L225 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-10 12:58:06,675 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_bb43665f-ba4e-4261-8e93-009ab10ba1c6/bin-2019/uautomizer/cvc4nyu Starting monitored process 17 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 17 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-10 12:58:06,695 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 12:58:06,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 12:58:06,733 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 12:58:06,764 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2018-11-10 12:58:06,764 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-10 12:58:06,814 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2018-11-10 12:58:06,815 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-10 12:58:06,816 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 12 [2018-11-10 12:58:06,816 INFO L460 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-11-10 12:58:06,816 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-11-10 12:58:06,816 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=98, Unknown=0, NotChecked=0, Total=132 [2018-11-10 12:58:06,816 INFO L87 Difference]: Start difference. First operand 5342 states and 7817 transitions. Second operand 12 states. [2018-11-10 12:58:07,484 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 12:58:07,484 INFO L93 Difference]: Finished difference Result 9141 states and 13413 transitions. [2018-11-10 12:58:07,484 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-11-10 12:58:07,485 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 66 [2018-11-10 12:58:07,485 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 12:58:07,494 INFO L225 Difference]: With dead ends: 9141 [2018-11-10 12:58:07,494 INFO L226 Difference]: Without dead ends: 6343 [2018-11-10 12:58:07,498 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 137 GetRequests, 121 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=77, Invalid=229, Unknown=0, NotChecked=0, Total=306 [2018-11-10 12:58:07,501 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6343 states. [2018-11-10 12:58:07,683 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6343 to 5466. [2018-11-10 12:58:07,683 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5466 states. [2018-11-10 12:58:07,687 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5466 states to 5466 states and 7836 transitions. [2018-11-10 12:58:07,687 INFO L78 Accepts]: Start accepts. Automaton has 5466 states and 7836 transitions. Word has length 66 [2018-11-10 12:58:07,688 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 12:58:07,688 INFO L481 AbstractCegarLoop]: Abstraction has 5466 states and 7836 transitions. [2018-11-10 12:58:07,688 INFO L482 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-11-10 12:58:07,688 INFO L276 IsEmpty]: Start isEmpty. Operand 5466 states and 7836 transitions. [2018-11-10 12:58:07,689 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2018-11-10 12:58:07,689 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 12:58:07,689 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 12:58:07,690 INFO L424 AbstractCegarLoop]: === Iteration 17 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 12:58:07,690 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 12:58:07,690 INFO L82 PathProgramCache]: Analyzing trace with hash -1119117464, now seen corresponding path program 1 times [2018-11-10 12:58:07,690 INFO L225 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-10 12:58:07,690 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_bb43665f-ba4e-4261-8e93-009ab10ba1c6/bin-2019/uautomizer/cvc4nyu Starting monitored process 18 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 18 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-10 12:58:07,713 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 12:58:07,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 12:58:07,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 12:58:07,811 INFO L442 BasicCegarLoop]: Counterexample might be feasible [2018-11-10 12:58:07,856 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 10.11 12:58:07 BoogieIcfgContainer [2018-11-10 12:58:07,856 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-11-10 12:58:07,856 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-11-10 12:58:07,856 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-11-10 12:58:07,856 INFO L276 PluginConnector]: Witness Printer initialized [2018-11-10 12:58:07,857 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.11 12:56:07" (3/4) ... [2018-11-10 12:58:07,859 INFO L138 WitnessPrinter]: Generating witness for reachability counterexample [2018-11-10 12:58:07,940 INFO L145 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/working_dir_bb43665f-ba4e-4261-8e93-009ab10ba1c6/bin-2019/uautomizer/witness.graphml [2018-11-10 12:58:07,940 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-11-10 12:58:07,941 INFO L168 Benchmark]: Toolchain (without parser) took 121331.95 ms. Allocated memory was 1.0 GB in the beginning and 1.4 GB in the end (delta: 353.9 MB). Free memory was 949.7 MB in the beginning and 1.2 GB in the end (delta: -203.1 MB). Peak memory consumption was 150.8 MB. Max. memory is 11.5 GB. [2018-11-10 12:58:07,942 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-10 12:58:07,942 INFO L168 Benchmark]: CACSL2BoogieTranslator took 208.35 ms. Allocated memory is still 1.0 GB. Free memory was 949.7 MB in the beginning and 933.6 MB in the end (delta: 16.1 MB). Peak memory consumption was 16.1 MB. Max. memory is 11.5 GB. [2018-11-10 12:58:07,942 INFO L168 Benchmark]: Boogie Preprocessor took 34.98 ms. Allocated memory is still 1.0 GB. Free memory was 933.6 MB in the beginning and 928.3 MB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. [2018-11-10 12:58:07,943 INFO L168 Benchmark]: RCFGBuilder took 310.19 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 140.5 MB). Free memory was 928.3 MB in the beginning and 1.1 GB in the end (delta: -183.7 MB). Peak memory consumption was 20.7 MB. Max. memory is 11.5 GB. [2018-11-10 12:58:07,943 INFO L168 Benchmark]: TraceAbstraction took 120691.10 ms. Allocated memory was 1.2 GB in the beginning and 1.4 GB in the end (delta: 213.4 MB). Free memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: -53.1 MB). Peak memory consumption was 160.3 MB. Max. memory is 11.5 GB. [2018-11-10 12:58:07,946 INFO L168 Benchmark]: Witness Printer took 84.15 ms. Allocated memory is still 1.4 GB. Free memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 12.2 MB). Peak memory consumption was 12.2 MB. Max. memory is 11.5 GB. [2018-11-10 12:58:07,947 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 208.35 ms. Allocated memory is still 1.0 GB. Free memory was 949.7 MB in the beginning and 933.6 MB in the end (delta: 16.1 MB). Peak memory consumption was 16.1 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 34.98 ms. Allocated memory is still 1.0 GB. Free memory was 933.6 MB in the beginning and 928.3 MB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. * RCFGBuilder took 310.19 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 140.5 MB). Free memory was 928.3 MB in the beginning and 1.1 GB in the end (delta: -183.7 MB). Peak memory consumption was 20.7 MB. Max. memory is 11.5 GB. * TraceAbstraction took 120691.10 ms. Allocated memory was 1.2 GB in the beginning and 1.4 GB in the end (delta: 213.4 MB). Free memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: -53.1 MB). Peak memory consumption was 160.3 MB. Max. memory is 11.5 GB. * Witness Printer took 84.15 ms. Allocated memory is still 1.4 GB. Free memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 12.2 MB). Peak memory consumption was 12.2 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 6]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L105] unsigned int a, b, r; [L107] a = __VERIFIER_nondet_uint() [L108] b = __VERIFIER_nondet_uint() [L110] CALL, EXPR mp_add(a, b) VAL [\old(a)=149, \old(b)=106] [L23] unsigned char a0, a1, a2, a3; [L24] unsigned char b0, b1, b2, b3; [L25] unsigned char r0, r1, r2, r3; [L26] unsigned short carry; [L27] unsigned short partial_sum; [L28] unsigned int r; [L29] unsigned char i; [L30] unsigned char na, nb; [L31] a0 = a [L32] a1 = a >> 8 [L33] a2 = a >> 16U [L34] a3 = a >> 24U [L35] b0 = b [L36] b1 = b >> 8U [L37] b2 = b >> 16U [L38] b3 = b >> 24U [L39] na = (unsigned char)4 VAL [\old(a)=149, \old(b)=106, a=149, a0=-107, a1=0, a2=0, a3=0, b=106, b0=106, b1=0, b2=0, b3=0, na=4] [L40] COND TRUE a3 == (unsigned char)0 [L41] na = na - 1 VAL [\old(a)=149, \old(b)=106, a=149, a0=-107, a1=0, a2=0, a3=0, b=106, b0=106, b1=0, b2=0, b3=0, na=3] [L42] COND TRUE a2 == (unsigned char)0 [L43] na = na - 1 VAL [\old(a)=149, \old(b)=106, a=149, a0=-107, a1=0, a2=0, a3=0, b=106, b0=106, b1=0, b2=0, b3=0, na=2] [L44] COND TRUE a1 == (unsigned char)0 [L45] na = na - 1 VAL [\old(a)=149, \old(b)=106, a=149, a0=-107, a1=0, a2=0, a3=0, b=106, b0=106, b1=0, b2=0, b3=0, na=1] [L49] nb = (unsigned char)4 VAL [\old(a)=149, \old(b)=106, a=149, a0=-107, a1=0, a2=0, a3=0, b=106, b0=106, b1=0, b2=0, b3=0, na=1, nb=4] [L50] COND TRUE b3 == (unsigned char)0 [L51] nb = nb - 1 VAL [\old(a)=149, \old(b)=106, a=149, a0=-107, a1=0, a2=0, a3=0, b=106, b0=106, b1=0, b2=0, b3=0, na=1, nb=3] [L52] COND TRUE b2 == (unsigned char)0 [L53] nb = nb - 1 VAL [\old(a)=149, \old(b)=106, a=149, a0=-107, a1=0, a2=0, a3=0, b=106, b0=106, b1=0, b2=0, b3=0, na=1, nb=2] [L54] COND TRUE b1 == (unsigned char)0 [L55] nb = nb - 1 VAL [\old(a)=149, \old(b)=106, a=149, a0=-107, a1=0, a2=0, a3=0, b=106, b0=106, b1=0, b2=0, b3=0, na=1, nb=1] [L59] carry = (unsigned short)0 [L60] i = (unsigned char)0 VAL [\old(a)=149, \old(b)=106, a=149, a0=-107, a1=0, a2=0, a3=0, b=106, b0=106, b1=0, b2=0, b3=0, carry=0, i=0, na=1, nb=1] [L61] COND TRUE (i < na) || (i < nb) || (carry != (unsigned short)0) [L62] partial_sum = carry [L63] carry = (unsigned short)0 VAL [\old(a)=149, \old(b)=106, a=149, a0=-107, a1=0, a2=0, a3=0, b=106, b0=106, b1=0, b2=0, b3=0, carry=0, i=0, na=1, nb=1, partial_sum=0] [L64] COND TRUE i < na VAL [\old(a)=149, \old(b)=106, a=149, a0=-107, a1=0, a2=0, a3=0, b=106, b0=106, b1=0, b2=0, b3=0, carry=0, i=0, na=1, nb=1, partial_sum=0] [L65] COND TRUE i == (unsigned char)0 [L65] partial_sum = partial_sum + a0 VAL [\old(a)=149, \old(b)=106, a=149, a0=-107, a1=0, a2=0, a3=0, b=106, b0=106, b1=0, b2=0, b3=0, carry=0, i=0, na=1, nb=1, partial_sum=149] [L66] COND FALSE !(i == (unsigned char)1) VAL [\old(a)=149, \old(b)=106, a=149, a0=-107, a1=0, a2=0, a3=0, b=106, b0=106, b1=0, b2=0, b3=0, carry=0, i=0, na=1, nb=1, partial_sum=149] [L67] COND FALSE !(i == (unsigned char)2) VAL [\old(a)=149, \old(b)=106, a=149, a0=-107, a1=0, a2=0, a3=0, b=106, b0=106, b1=0, b2=0, b3=0, carry=0, i=0, na=1, nb=1, partial_sum=149] [L68] COND FALSE !(i == (unsigned char)3) VAL [\old(a)=149, \old(b)=106, a=149, a0=-107, a1=0, a2=0, a3=0, b=106, b0=106, b1=0, b2=0, b3=0, carry=0, i=0, na=1, nb=1, partial_sum=149] [L70] COND TRUE i < nb VAL [\old(a)=149, \old(b)=106, a=149, a0=-107, a1=0, a2=0, a3=0, b=106, b0=106, b1=0, b2=0, b3=0, carry=0, i=0, na=1, nb=1, partial_sum=149] [L71] COND TRUE i == (unsigned char)0 [L71] partial_sum = partial_sum + b0 VAL [\old(a)=149, \old(b)=106, a=149, a0=-107, a1=0, a2=0, a3=0, b=106, b0=106, b1=0, b2=0, b3=0, carry=0, i=0, na=1, nb=1, partial_sum=255] [L72] COND FALSE !(i == (unsigned char)1) VAL [\old(a)=149, \old(b)=106, a=149, a0=-107, a1=0, a2=0, a3=0, b=106, b0=106, b1=0, b2=0, b3=0, carry=0, i=0, na=1, nb=1, partial_sum=255] [L73] COND FALSE !(i == (unsigned char)2) VAL [\old(a)=149, \old(b)=106, a=149, a0=-107, a1=0, a2=0, a3=0, b=106, b0=106, b1=0, b2=0, b3=0, carry=0, i=0, na=1, nb=1, partial_sum=255] [L74] COND FALSE !(i == (unsigned char)3) VAL [\old(a)=149, \old(b)=106, a=149, a0=-107, a1=0, a2=0, a3=0, b=106, b0=106, b1=0, b2=0, b3=0, carry=0, i=0, na=1, nb=1, partial_sum=255] [L76] COND TRUE partial_sum > ((unsigned char)254) [L77] partial_sum = partial_sum & ((unsigned char)255) [L78] carry = (unsigned short)1 VAL [\old(a)=149, \old(b)=106, a=149, a0=-107, a1=0, a2=0, a3=0, b=106, b0=106, b1=0, b2=0, b3=0, carry=1, i=0, na=1, nb=1, partial_sum=255] [L80] COND TRUE i == (unsigned char)0 [L80] r0 = (unsigned char)partial_sum VAL [\old(a)=149, \old(b)=106, a=149, a0=-107, a1=0, a2=0, a3=0, b=106, b0=106, b1=0, b2=0, b3=0, carry=1, i=0, na=1, nb=1, partial_sum=255, r0=-1] [L81] COND FALSE !(i == (unsigned char)1) VAL [\old(a)=149, \old(b)=106, a=149, a0=-107, a1=0, a2=0, a3=0, b=106, b0=106, b1=0, b2=0, b3=0, carry=1, i=0, na=1, nb=1, partial_sum=255, r0=-1] [L82] COND FALSE !(i == (unsigned char)2) VAL [\old(a)=149, \old(b)=106, a=149, a0=-107, a1=0, a2=0, a3=0, b=106, b0=106, b1=0, b2=0, b3=0, carry=1, i=0, na=1, nb=1, partial_sum=255, r0=-1] [L83] COND FALSE !(i == (unsigned char)3) VAL [\old(a)=149, \old(b)=106, a=149, a0=-107, a1=0, a2=0, a3=0, b=106, b0=106, b1=0, b2=0, b3=0, carry=1, i=0, na=1, nb=1, partial_sum=255, r0=-1] [L85] i = i + (unsigned char)1 VAL [\old(a)=149, \old(b)=106, a=149, a0=-107, a1=0, a2=0, a3=0, b=106, b0=106, b1=0, b2=0, b3=0, carry=1, i=1, na=1, nb=1, partial_sum=255, r0=-1] [L61] COND TRUE (i < na) || (i < nb) || (carry != (unsigned short)0) [L62] partial_sum = carry [L63] carry = (unsigned short)0 VAL [\old(a)=149, \old(b)=106, a=149, a0=-107, a1=0, a2=0, a3=0, b=106, b0=106, b1=0, b2=0, b3=0, carry=0, i=1, na=1, nb=1, partial_sum=1, r0=-1] [L64] COND FALSE !(i < na) VAL [\old(a)=149, \old(b)=106, a=149, a0=-107, a1=0, a2=0, a3=0, b=106, b0=106, b1=0, b2=0, b3=0, carry=0, i=1, na=1, nb=1, partial_sum=1, r0=-1] [L70] COND FALSE !(i < nb) VAL [\old(a)=149, \old(b)=106, a=149, a0=-107, a1=0, a2=0, a3=0, b=106, b0=106, b1=0, b2=0, b3=0, carry=0, i=1, na=1, nb=1, partial_sum=1, r0=-1] [L76] COND FALSE !(partial_sum > ((unsigned char)254)) VAL [\old(a)=149, \old(b)=106, a=149, a0=-107, a1=0, a2=0, a3=0, b=106, b0=106, b1=0, b2=0, b3=0, carry=0, i=1, na=1, nb=1, partial_sum=1, r0=-1] [L80] COND FALSE !(i == (unsigned char)0) VAL [\old(a)=149, \old(b)=106, a=149, a0=-107, a1=0, a2=0, a3=0, b=106, b0=106, b1=0, b2=0, b3=0, carry=0, i=1, na=1, nb=1, partial_sum=1, r0=-1] [L81] COND TRUE i == (unsigned char)1 [L81] r1 = (unsigned char)partial_sum VAL [\old(a)=149, \old(b)=106, a=149, a0=-107, a1=0, a2=0, a3=0, b=106, b0=106, b1=0, b2=0, b3=0, carry=0, i=1, na=1, nb=1, partial_sum=1, r0=-1, r1=1] [L82] COND FALSE !(i == (unsigned char)2) VAL [\old(a)=149, \old(b)=106, a=149, a0=-107, a1=0, a2=0, a3=0, b=106, b0=106, b1=0, b2=0, b3=0, carry=0, i=1, na=1, nb=1, partial_sum=1, r0=-1, r1=1] [L83] COND FALSE !(i == (unsigned char)3) VAL [\old(a)=149, \old(b)=106, a=149, a0=-107, a1=0, a2=0, a3=0, b=106, b0=106, b1=0, b2=0, b3=0, carry=0, i=1, na=1, nb=1, partial_sum=1, r0=-1, r1=1] [L85] i = i + (unsigned char)1 VAL [\old(a)=149, \old(b)=106, a=149, a0=-107, a1=0, a2=0, a3=0, b=106, b0=106, b1=0, b2=0, b3=0, carry=0, i=2, na=1, nb=1, partial_sum=1, r0=-1, r1=1] [L61] COND FALSE !((i < na) || (i < nb) || (carry != (unsigned short)0)) VAL [\old(a)=149, \old(b)=106, a=149, a0=-107, a1=0, a2=0, a3=0, b=106, b0=106, b1=0, b2=0, b3=0, carry=0, i=2, na=1, nb=1, partial_sum=1, r0=-1, r1=1] [L88] COND TRUE i < (unsigned char)4 VAL [\old(a)=149, \old(b)=106, a=149, a0=-107, a1=0, a2=0, a3=0, b=106, b0=106, b1=0, b2=0, b3=0, carry=0, i=2, na=1, nb=1, partial_sum=1, r0=-1, r1=1] [L89] COND FALSE !(i == (unsigned char)0) VAL [\old(a)=149, \old(b)=106, a=149, a0=-107, a1=0, a2=0, a3=0, b=106, b0=106, b1=0, b2=0, b3=0, carry=0, i=2, na=1, nb=1, partial_sum=1, r0=-1, r1=1] [L90] COND FALSE !(i == (unsigned char)1) VAL [\old(a)=149, \old(b)=106, a=149, a0=-107, a1=0, a2=0, a3=0, b=106, b0=106, b1=0, b2=0, b3=0, carry=0, i=2, na=1, nb=1, partial_sum=1, r0=-1, r1=1] [L91] COND TRUE i == (unsigned char)2 [L91] r2 = (unsigned char)0 VAL [\old(a)=149, \old(b)=106, a=149, a0=-107, a1=0, a2=0, a3=0, b=106, b0=106, b1=0, b2=0, b3=0, carry=0, i=2, na=1, nb=1, partial_sum=1, r0=-1, r1=1, r2=0] [L92] COND FALSE !(i == (unsigned char)3) VAL [\old(a)=149, \old(b)=106, a=149, a0=-107, a1=0, a2=0, a3=0, b=106, b0=106, b1=0, b2=0, b3=0, carry=0, i=2, na=1, nb=1, partial_sum=1, r0=-1, r1=1, r2=0] [L94] i = i + (unsigned char)1 VAL [\old(a)=149, \old(b)=106, a=149, a0=-107, a1=0, a2=0, a3=0, b=106, b0=106, b1=0, b2=0, b3=0, carry=0, i=3, na=1, nb=1, partial_sum=1, r0=-1, r1=1, r2=0] [L88] COND TRUE i < (unsigned char)4 VAL [\old(a)=149, \old(b)=106, a=149, a0=-107, a1=0, a2=0, a3=0, b=106, b0=106, b1=0, b2=0, b3=0, carry=0, i=3, na=1, nb=1, partial_sum=1, r0=-1, r1=1, r2=0] [L89] COND FALSE !(i == (unsigned char)0) VAL [\old(a)=149, \old(b)=106, a=149, a0=-107, a1=0, a2=0, a3=0, b=106, b0=106, b1=0, b2=0, b3=0, carry=0, i=3, na=1, nb=1, partial_sum=1, r0=-1, r1=1, r2=0] [L90] COND FALSE !(i == (unsigned char)1) VAL [\old(a)=149, \old(b)=106, a=149, a0=-107, a1=0, a2=0, a3=0, b=106, b0=106, b1=0, b2=0, b3=0, carry=0, i=3, na=1, nb=1, partial_sum=1, r0=-1, r1=1, r2=0] [L91] COND FALSE !(i == (unsigned char)2) VAL [\old(a)=149, \old(b)=106, a=149, a0=-107, a1=0, a2=0, a3=0, b=106, b0=106, b1=0, b2=0, b3=0, carry=0, i=3, na=1, nb=1, partial_sum=1, r0=-1, r1=1, r2=0] [L92] COND TRUE i == (unsigned char)3 [L92] r3 = (unsigned char)0 VAL [\old(a)=149, \old(b)=106, a=149, a0=-107, a1=0, a2=0, a3=0, b=106, b0=106, b1=0, b2=0, b3=0, carry=0, i=3, na=1, nb=1, partial_sum=1, r0=-1, r1=1, r2=0, r3=0] [L94] i = i + (unsigned char)1 VAL [\old(a)=149, \old(b)=106, a=149, a0=-107, a1=0, a2=0, a3=0, b=106, b0=106, b1=0, b2=0, b3=0, carry=0, i=4, na=1, nb=1, partial_sum=1, r0=-1, r1=1, r2=0, r3=0] [L88] COND FALSE !(i < (unsigned char)4) VAL [\old(a)=149, \old(b)=106, a=149, a0=-107, a1=0, a2=0, a3=0, b=106, b0=106, b1=0, b2=0, b3=0, carry=0, i=4, na=1, nb=1, partial_sum=1, r0=-1, r1=1, r2=0, r3=0] [L97] r = r0 | (r1 << 8U) | (r2 << 16U) | ((unsigned int)r3 << 24U) [L99] RET return r; VAL [\old(a)=149, \old(b)=106, \result=511, a=149, a0=-107, a1=0, a2=0, a3=0, b=106, b0=106, b1=0, b2=0, b3=0, carry=0, i=4, na=1, nb=1, partial_sum=1, r=511, r0=-1, r1=1, r2=0, r3=0] [L110] EXPR mp_add(a, b) VAL [a=149, b=106, mp_add(a, b)=511] [L110] r = mp_add(a, b) [L112] CALL __VERIFIER_assert(r == a + b) 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 5 procedures, 56 locations, 1 error locations. UNSAFE Result, 120.6s OverallTime, 17 OverallIterations, 4 TraceHistogramMax, 114.6s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 1994 SDtfs, 6842 SDslu, 10315 SDs, 0 SdLazy, 16413 SolverSat, 1315 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 19.0s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 1282 GetRequests, 868 SyntacticMatches, 4 SemanticMatches, 410 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 40005 ImplicationChecksByTransitivity, 94.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=5466occurred in iteration=16, 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: 1.0s AutomataMinimizationTime, 16 MinimizatonAttempts, 9732 StatesRemovedByMinimization, 15 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 3.9s InterpolantComputationTime, 733 NumberOfCodeBlocks, 733 NumberOfCodeBlocksAsserted, 17 NumberOfCheckSat, 969 ConstructedInterpolants, 0 QuantifiedInterpolants, 455084 SizeOfPredicates, 48 NumberOfNonLiveVariables, 1186 ConjunctsInSsa, 100 ConjunctsInUnsatCore, 22 InterpolantComputations, 10 PerfectInterpolantSequences, 164/223 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! Received shutdown request...