./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.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 635dfa2a Calling Ultimate with: java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_470b1560-4365-47e5-9038-f77a95a54932/bin-2019/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_470b1560-4365-47e5-9038-f77a95a54932/bin-2019/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_470b1560-4365-47e5-9038-f77a95a54932/bin-2019/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_470b1560-4365-47e5-9038-f77a95a54932/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_470b1560-4365-47e5-9038-f77a95a54932/bin-2019/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_470b1560-4365-47e5-9038-f77a95a54932/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_470b1560-4365-47e5-9038-f77a95a54932/bin-2019/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_470b1560-4365-47e5-9038-f77a95a54932/bin-2019/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_470b1560-4365-47e5-9038-f77a95a54932/bin-2019/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_470b1560-4365-47e5-9038-f77a95a54932/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_470b1560-4365-47e5-9038-f77a95a54932/bin-2019/uautomizer/config/svcomp-Reach-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_470b1560-4365-47e5-9038-f77a95a54932/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-635dfa2 [2018-12-02 10:48:22,344 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-12-02 10:48:22,345 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-12-02 10:48:22,353 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-12-02 10:48:22,353 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-12-02 10:48:22,354 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-12-02 10:48:22,355 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-12-02 10:48:22,356 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-12-02 10:48:22,357 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-12-02 10:48:22,358 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-12-02 10:48:22,358 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-12-02 10:48:22,359 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-12-02 10:48:22,359 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-12-02 10:48:22,360 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-12-02 10:48:22,360 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-12-02 10:48:22,361 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-12-02 10:48:22,361 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-12-02 10:48:22,362 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-12-02 10:48:22,363 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-12-02 10:48:22,364 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-12-02 10:48:22,364 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-12-02 10:48:22,365 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-12-02 10:48:22,366 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-12-02 10:48:22,366 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-12-02 10:48:22,366 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-12-02 10:48:22,367 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-12-02 10:48:22,367 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-12-02 10:48:22,368 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-12-02 10:48:22,368 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-12-02 10:48:22,369 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-12-02 10:48:22,369 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-12-02 10:48:22,370 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-12-02 10:48:22,370 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-12-02 10:48:22,370 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-12-02 10:48:22,371 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-12-02 10:48:22,371 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-12-02 10:48:22,371 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_470b1560-4365-47e5-9038-f77a95a54932/bin-2019/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf [2018-12-02 10:48:22,381 INFO L110 SettingsManager]: Loading preferences was successful [2018-12-02 10:48:22,381 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-12-02 10:48:22,382 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-12-02 10:48:22,382 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-12-02 10:48:22,383 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-12-02 10:48:22,383 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-12-02 10:48:22,383 INFO L133 SettingsManager]: * Use SBE=true [2018-12-02 10:48:22,383 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-12-02 10:48:22,383 INFO L133 SettingsManager]: * sizeof long=4 [2018-12-02 10:48:22,383 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-12-02 10:48:22,384 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-12-02 10:48:22,384 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-12-02 10:48:22,384 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-12-02 10:48:22,384 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-12-02 10:48:22,384 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-12-02 10:48:22,384 INFO L133 SettingsManager]: * sizeof long double=12 [2018-12-02 10:48:22,384 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-12-02 10:48:22,385 INFO L133 SettingsManager]: * Use constant arrays=true [2018-12-02 10:48:22,385 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-12-02 10:48:22,385 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-12-02 10:48:22,385 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-12-02 10:48:22,385 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-12-02 10:48:22,385 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-12-02 10:48:22,386 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-12-02 10:48:22,386 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-12-02 10:48:22,386 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-12-02 10:48:22,386 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-12-02 10:48:22,386 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-12-02 10:48:22,386 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-12-02 10:48:22,387 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-12-02 10:48:22,387 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_470b1560-4365-47e5-9038-f77a95a54932/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-12-02 10:48:22,410 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-12-02 10:48:22,419 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-12-02 10:48:22,422 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-12-02 10:48:22,423 INFO L271 PluginConnector]: Initializing CDTParser... [2018-12-02 10:48:22,423 INFO L276 PluginConnector]: CDTParser initialized [2018-12-02 10:48:22,424 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_470b1560-4365-47e5-9038-f77a95a54932/bin-2019/uautomizer/../../sv-benchmarks/c/bitvector/byte_add_false-unreach-call_true-no-overflow_true-termination.i [2018-12-02 10:48:22,464 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_470b1560-4365-47e5-9038-f77a95a54932/bin-2019/uautomizer/data/cbc6eaed4/a8e6d45bf6e04ddb8615eae4e7f65995/FLAG61f781429 [2018-12-02 10:48:22,871 INFO L307 CDTParser]: Found 1 translation units. [2018-12-02 10:48:22,872 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_470b1560-4365-47e5-9038-f77a95a54932/sv-benchmarks/c/bitvector/byte_add_false-unreach-call_true-no-overflow_true-termination.i [2018-12-02 10:48:22,876 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_470b1560-4365-47e5-9038-f77a95a54932/bin-2019/uautomizer/data/cbc6eaed4/a8e6d45bf6e04ddb8615eae4e7f65995/FLAG61f781429 [2018-12-02 10:48:22,886 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_470b1560-4365-47e5-9038-f77a95a54932/bin-2019/uautomizer/data/cbc6eaed4/a8e6d45bf6e04ddb8615eae4e7f65995 [2018-12-02 10:48:22,888 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-12-02 10:48:22,890 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-12-02 10:48:22,890 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-12-02 10:48:22,890 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-12-02 10:48:22,893 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-12-02 10:48:22,894 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.12 10:48:22" (1/1) ... [2018-12-02 10:48:22,896 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@432dabb8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 10:48:22, skipping insertion in model container [2018-12-02 10:48:22,896 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.12 10:48:22" (1/1) ... [2018-12-02 10:48:22,902 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-12-02 10:48:22,918 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-12-02 10:48:23,024 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-02 10:48:23,026 INFO L191 MainTranslator]: Completed pre-run [2018-12-02 10:48:23,045 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-02 10:48:23,053 INFO L195 MainTranslator]: Completed translation [2018-12-02 10:48:23,054 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 10:48:23 WrapperNode [2018-12-02 10:48:23,054 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-12-02 10:48:23,054 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-12-02 10:48:23,054 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-12-02 10:48:23,054 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-12-02 10:48:23,060 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 10:48:23" (1/1) ... [2018-12-02 10:48:23,064 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 10:48:23" (1/1) ... [2018-12-02 10:48:23,068 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-12-02 10:48:23,068 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-12-02 10:48:23,068 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-12-02 10:48:23,068 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-12-02 10:48:23,106 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 10:48:23" (1/1) ... [2018-12-02 10:48:23,107 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 10:48:23" (1/1) ... [2018-12-02 10:48:23,107 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 10:48:23" (1/1) ... [2018-12-02 10:48:23,108 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 10:48:23" (1/1) ... [2018-12-02 10:48:23,111 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 10:48:23" (1/1) ... [2018-12-02 10:48:23,115 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 10:48:23" (1/1) ... [2018-12-02 10:48:23,116 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 10:48:23" (1/1) ... [2018-12-02 10:48:23,117 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-12-02 10:48:23,117 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-12-02 10:48:23,117 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-12-02 10:48:23,117 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-12-02 10:48:23,118 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 10:48:23" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_470b1560-4365-47e5-9038-f77a95a54932/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-12-02 10:48:23,147 INFO L130 BoogieDeclarations]: Found specification of procedure mp_add [2018-12-02 10:48:23,147 INFO L138 BoogieDeclarations]: Found implementation of procedure mp_add [2018-12-02 10:48:23,148 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-12-02 10:48:23,148 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-12-02 10:48:23,148 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-12-02 10:48:23,148 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-12-02 10:48:23,148 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-12-02 10:48:23,148 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-12-02 10:48:23,148 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2018-12-02 10:48:23,148 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2018-12-02 10:48:23,319 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-12-02 10:48:23,319 INFO L280 CfgBuilder]: Removed 2 assue(true) statements. [2018-12-02 10:48:23,319 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.12 10:48:23 BoogieIcfgContainer [2018-12-02 10:48:23,319 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-12-02 10:48:23,320 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-12-02 10:48:23,320 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-12-02 10:48:23,322 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-12-02 10:48:23,322 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 02.12 10:48:22" (1/3) ... [2018-12-02 10:48:23,322 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4b4968b5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.12 10:48:23, skipping insertion in model container [2018-12-02 10:48:23,323 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 10:48:23" (2/3) ... [2018-12-02 10:48:23,323 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4b4968b5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.12 10:48:23, skipping insertion in model container [2018-12-02 10:48:23,323 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.12 10:48:23" (3/3) ... [2018-12-02 10:48:23,324 INFO L112 eAbstractionObserver]: Analyzing ICFG byte_add_false-unreach-call_true-no-overflow_true-termination.i [2018-12-02 10:48:23,329 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-12-02 10:48:23,334 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-12-02 10:48:23,345 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-12-02 10:48:23,362 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-12-02 10:48:23,363 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-12-02 10:48:23,363 INFO L383 AbstractCegarLoop]: Hoare is true [2018-12-02 10:48:23,363 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-12-02 10:48:23,363 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-12-02 10:48:23,363 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-12-02 10:48:23,363 INFO L387 AbstractCegarLoop]: Difference is false [2018-12-02 10:48:23,363 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-12-02 10:48:23,363 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-12-02 10:48:23,373 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states. [2018-12-02 10:48:23,377 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2018-12-02 10:48:23,377 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 10:48:23,377 INFO L402 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-12-02 10:48:23,379 INFO L423 AbstractCegarLoop]: === Iteration 1 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 10:48:23,382 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 10:48:23,382 INFO L82 PathProgramCache]: Analyzing trace with hash 397916932, now seen corresponding path program 1 times [2018-12-02 10:48:23,383 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 10:48:23,383 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 10:48:23,417 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 10:48:23,418 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 10:48:23,418 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 10:48:23,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 10:48:23,471 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 10:48:23,473 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 10:48:23,473 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-12-02 10:48:23,475 INFO L459 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-12-02 10:48:23,483 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-12-02 10:48:23,483 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-12-02 10:48:23,485 INFO L87 Difference]: Start difference. First operand 54 states. Second operand 2 states. [2018-12-02 10:48:23,501 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 10:48:23,501 INFO L93 Difference]: Finished difference Result 76 states and 112 transitions. [2018-12-02 10:48:23,501 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-12-02 10:48:23,502 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 21 [2018-12-02 10:48:23,502 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 10:48:23,508 INFO L225 Difference]: With dead ends: 76 [2018-12-02 10:48:23,508 INFO L226 Difference]: Without dead ends: 47 [2018-12-02 10:48:23,510 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-12-02 10:48:23,520 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2018-12-02 10:48:23,531 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 47. [2018-12-02 10:48:23,532 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47 states. [2018-12-02 10:48:23,533 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 73 transitions. [2018-12-02 10:48:23,534 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 73 transitions. Word has length 21 [2018-12-02 10:48:23,534 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 10:48:23,534 INFO L480 AbstractCegarLoop]: Abstraction has 47 states and 73 transitions. [2018-12-02 10:48:23,534 INFO L481 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-12-02 10:48:23,534 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 73 transitions. [2018-12-02 10:48:23,535 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2018-12-02 10:48:23,535 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 10:48:23,535 INFO L402 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-12-02 10:48:23,535 INFO L423 AbstractCegarLoop]: === Iteration 2 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 10:48:23,536 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 10:48:23,536 INFO L82 PathProgramCache]: Analyzing trace with hash -1531564698, now seen corresponding path program 1 times [2018-12-02 10:48:23,536 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 10:48:23,536 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 10:48:23,537 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 10:48:23,537 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 10:48:23,537 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 10:48:23,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 10:48:23,606 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 10:48:23,609 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 10:48:23,609 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-02 10:48:23,610 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-02 10:48:23,611 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-02 10:48:23,611 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-02 10:48:23,611 INFO L87 Difference]: Start difference. First operand 47 states and 73 transitions. Second operand 3 states. [2018-12-02 10:48:23,698 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 10:48:23,698 INFO L93 Difference]: Finished difference Result 102 states and 169 transitions. [2018-12-02 10:48:23,698 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-02 10:48:23,698 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 21 [2018-12-02 10:48:23,698 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 10:48:23,699 INFO L225 Difference]: With dead ends: 102 [2018-12-02 10:48:23,699 INFO L226 Difference]: Without dead ends: 70 [2018-12-02 10:48:23,700 INFO L631 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-12-02 10:48:23,700 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2018-12-02 10:48:23,703 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 68. [2018-12-02 10:48:23,704 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 68 states. [2018-12-02 10:48:23,704 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 98 transitions. [2018-12-02 10:48:23,704 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 98 transitions. Word has length 21 [2018-12-02 10:48:23,705 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 10:48:23,705 INFO L480 AbstractCegarLoop]: Abstraction has 68 states and 98 transitions. [2018-12-02 10:48:23,705 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-02 10:48:23,705 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 98 transitions. [2018-12-02 10:48:23,705 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2018-12-02 10:48:23,705 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 10:48:23,706 INFO L402 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, 1, 1] [2018-12-02 10:48:23,706 INFO L423 AbstractCegarLoop]: === Iteration 3 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 10:48:23,706 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 10:48:23,706 INFO L82 PathProgramCache]: Analyzing trace with hash -1473767205, now seen corresponding path program 1 times [2018-12-02 10:48:23,706 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 10:48:23,706 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 10:48:23,707 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 10:48:23,707 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 10:48:23,707 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 10:48:23,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 10:48:23,761 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 10:48:23,762 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 10:48:23,762 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-02 10:48:23,762 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-02 10:48:23,762 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-02 10:48:23,762 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-02 10:48:23,763 INFO L87 Difference]: Start difference. First operand 68 states and 98 transitions. Second operand 4 states. [2018-12-02 10:48:23,907 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 10:48:23,907 INFO L93 Difference]: Finished difference Result 159 states and 262 transitions. [2018-12-02 10:48:23,907 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-02 10:48:23,908 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 27 [2018-12-02 10:48:23,908 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 10:48:23,908 INFO L225 Difference]: With dead ends: 159 [2018-12-02 10:48:23,908 INFO L226 Difference]: Without dead ends: 127 [2018-12-02 10:48:23,909 INFO L631 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-12-02 10:48:23,909 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 127 states. [2018-12-02 10:48:23,913 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 127 to 91. [2018-12-02 10:48:23,913 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 91 states. [2018-12-02 10:48:23,914 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 133 transitions. [2018-12-02 10:48:23,914 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 133 transitions. Word has length 27 [2018-12-02 10:48:23,914 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 10:48:23,914 INFO L480 AbstractCegarLoop]: Abstraction has 91 states and 133 transitions. [2018-12-02 10:48:23,914 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-02 10:48:23,915 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 133 transitions. [2018-12-02 10:48:23,915 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2018-12-02 10:48:23,915 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 10:48:23,915 INFO L402 BasicCegarLoop]: trace histogram [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] [2018-12-02 10:48:23,915 INFO L423 AbstractCegarLoop]: === Iteration 4 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 10:48:23,915 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 10:48:23,916 INFO L82 PathProgramCache]: Analyzing trace with hash -13869364, now seen corresponding path program 1 times [2018-12-02 10:48:23,916 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 10:48:23,916 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 10:48:23,916 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 10:48:23,916 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 10:48:23,916 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 10:48:23,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 10:48:23,955 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-12-02 10:48:23,955 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 10:48:23,955 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-02 10:48:23,955 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-02 10:48:23,956 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-02 10:48:23,956 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-02 10:48:23,956 INFO L87 Difference]: Start difference. First operand 91 states and 133 transitions. Second operand 4 states. [2018-12-02 10:48:24,083 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 10:48:24,083 INFO L93 Difference]: Finished difference Result 245 states and 378 transitions. [2018-12-02 10:48:24,083 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-02 10:48:24,083 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 33 [2018-12-02 10:48:24,084 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 10:48:24,085 INFO L225 Difference]: With dead ends: 245 [2018-12-02 10:48:24,085 INFO L226 Difference]: Without dead ends: 174 [2018-12-02 10:48:24,085 INFO L631 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-12-02 10:48:24,085 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 174 states. [2018-12-02 10:48:24,090 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 174 to 124. [2018-12-02 10:48:24,091 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 124 states. [2018-12-02 10:48:24,091 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 124 states to 124 states and 188 transitions. [2018-12-02 10:48:24,091 INFO L78 Accepts]: Start accepts. Automaton has 124 states and 188 transitions. Word has length 33 [2018-12-02 10:48:24,092 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 10:48:24,092 INFO L480 AbstractCegarLoop]: Abstraction has 124 states and 188 transitions. [2018-12-02 10:48:24,092 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-02 10:48:24,092 INFO L276 IsEmpty]: Start isEmpty. Operand 124 states and 188 transitions. [2018-12-02 10:48:24,092 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2018-12-02 10:48:24,093 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 10:48:24,093 INFO L402 BasicCegarLoop]: trace histogram [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] [2018-12-02 10:48:24,093 INFO L423 AbstractCegarLoop]: === Iteration 5 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 10:48:24,093 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 10:48:24,093 INFO L82 PathProgramCache]: Analyzing trace with hash -1417056703, now seen corresponding path program 1 times [2018-12-02 10:48:24,093 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 10:48:24,093 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 10:48:24,094 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 10:48:24,094 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 10:48:24,094 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 10:48:24,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 10:48:24,141 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2018-12-02 10:48:24,141 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 10:48:24,141 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-02 10:48:24,142 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-02 10:48:24,142 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-02 10:48:24,142 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-02 10:48:24,142 INFO L87 Difference]: Start difference. First operand 124 states and 188 transitions. Second operand 5 states. [2018-12-02 10:48:24,295 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 10:48:24,295 INFO L93 Difference]: Finished difference Result 346 states and 527 transitions. [2018-12-02 10:48:24,296 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-02 10:48:24,296 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 39 [2018-12-02 10:48:24,296 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 10:48:24,299 INFO L225 Difference]: With dead ends: 346 [2018-12-02 10:48:24,299 INFO L226 Difference]: Without dead ends: 240 [2018-12-02 10:48:24,300 INFO L631 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-12-02 10:48:24,300 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 240 states. [2018-12-02 10:48:24,310 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 240 to 132. [2018-12-02 10:48:24,310 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 132 states. [2018-12-02 10:48:24,311 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 132 states to 132 states and 197 transitions. [2018-12-02 10:48:24,311 INFO L78 Accepts]: Start accepts. Automaton has 132 states and 197 transitions. Word has length 39 [2018-12-02 10:48:24,311 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 10:48:24,311 INFO L480 AbstractCegarLoop]: Abstraction has 132 states and 197 transitions. [2018-12-02 10:48:24,312 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-02 10:48:24,312 INFO L276 IsEmpty]: Start isEmpty. Operand 132 states and 197 transitions. [2018-12-02 10:48:24,313 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2018-12-02 10:48:24,313 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 10:48:24,313 INFO L402 BasicCegarLoop]: trace histogram [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-12-02 10:48:24,313 INFO L423 AbstractCegarLoop]: === Iteration 6 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 10:48:24,313 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 10:48:24,313 INFO L82 PathProgramCache]: Analyzing trace with hash -1068918534, now seen corresponding path program 1 times [2018-12-02 10:48:24,314 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 10:48:24,314 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 10:48:24,314 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 10:48:24,315 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 10:48:24,315 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 10:48:24,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 10:48:24,371 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2018-12-02 10:48:24,371 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 10:48:24,371 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-02 10:48:24,371 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-02 10:48:24,372 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-02 10:48:24,372 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-02 10:48:24,372 INFO L87 Difference]: Start difference. First operand 132 states and 197 transitions. Second operand 5 states. [2018-12-02 10:48:24,530 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 10:48:24,530 INFO L93 Difference]: Finished difference Result 367 states and 553 transitions. [2018-12-02 10:48:24,531 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-02 10:48:24,531 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 40 [2018-12-02 10:48:24,531 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 10:48:24,532 INFO L225 Difference]: With dead ends: 367 [2018-12-02 10:48:24,532 INFO L226 Difference]: Without dead ends: 260 [2018-12-02 10:48:24,532 INFO L631 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-12-02 10:48:24,533 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 260 states. [2018-12-02 10:48:24,538 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 260 to 142. [2018-12-02 10:48:24,538 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 142 states. [2018-12-02 10:48:24,539 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 142 states to 142 states and 210 transitions. [2018-12-02 10:48:24,539 INFO L78 Accepts]: Start accepts. Automaton has 142 states and 210 transitions. Word has length 40 [2018-12-02 10:48:24,539 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 10:48:24,539 INFO L480 AbstractCegarLoop]: Abstraction has 142 states and 210 transitions. [2018-12-02 10:48:24,539 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-02 10:48:24,539 INFO L276 IsEmpty]: Start isEmpty. Operand 142 states and 210 transitions. [2018-12-02 10:48:24,540 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2018-12-02 10:48:24,540 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 10:48:24,540 INFO L402 BasicCegarLoop]: trace histogram [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-12-02 10:48:24,540 INFO L423 AbstractCegarLoop]: === Iteration 7 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 10:48:24,540 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 10:48:24,540 INFO L82 PathProgramCache]: Analyzing trace with hash 482670800, now seen corresponding path program 1 times [2018-12-02 10:48:24,541 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 10:48:24,541 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 10:48:24,541 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 10:48:24,541 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 10:48:24,541 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 10:48:24,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 10:48:24,576 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 14 proven. 4 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-12-02 10:48:24,576 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 10:48:24,576 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_470b1560-4365-47e5-9038-f77a95a54932/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-12-02 10:48:24,590 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 10:48:24,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 10:48:24,608 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 10:48:24,647 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2018-12-02 10:48:24,661 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-12-02 10:48:24,661 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [5] total 7 [2018-12-02 10:48:24,662 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-02 10:48:24,662 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-02 10:48:24,662 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2018-12-02 10:48:24,662 INFO L87 Difference]: Start difference. First operand 142 states and 210 transitions. Second operand 7 states. [2018-12-02 10:48:25,340 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 10:48:25,340 INFO L93 Difference]: Finished difference Result 335 states and 526 transitions. [2018-12-02 10:48:25,340 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-12-02 10:48:25,340 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 41 [2018-12-02 10:48:25,341 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 10:48:25,341 INFO L225 Difference]: With dead ends: 335 [2018-12-02 10:48:25,341 INFO L226 Difference]: Without dead ends: 227 [2018-12-02 10:48:25,342 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 42 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 [2018-12-02 10:48:25,342 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 227 states. [2018-12-02 10:48:25,349 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 227 to 184. [2018-12-02 10:48:25,349 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 184 states. [2018-12-02 10:48:25,350 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 184 states to 184 states and 244 transitions. [2018-12-02 10:48:25,350 INFO L78 Accepts]: Start accepts. Automaton has 184 states and 244 transitions. Word has length 41 [2018-12-02 10:48:25,350 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 10:48:25,351 INFO L480 AbstractCegarLoop]: Abstraction has 184 states and 244 transitions. [2018-12-02 10:48:25,351 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-02 10:48:25,351 INFO L276 IsEmpty]: Start isEmpty. Operand 184 states and 244 transitions. [2018-12-02 10:48:25,352 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2018-12-02 10:48:25,352 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 10:48:25,352 INFO L402 BasicCegarLoop]: trace histogram [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] [2018-12-02 10:48:25,352 INFO L423 AbstractCegarLoop]: === Iteration 8 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 10:48:25,352 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 10:48:25,352 INFO L82 PathProgramCache]: Analyzing trace with hash 1878612609, now seen corresponding path program 1 times [2018-12-02 10:48:25,353 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 10:48:25,353 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 10:48:25,353 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 10:48:25,353 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 10:48:25,354 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 10:48:25,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 10:48:25,398 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2018-12-02 10:48:25,398 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 10:48:25,398 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-02 10:48:25,399 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-02 10:48:25,399 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-02 10:48:25,399 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-12-02 10:48:25,399 INFO L87 Difference]: Start difference. First operand 184 states and 244 transitions. Second operand 6 states. [2018-12-02 10:48:25,642 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 10:48:25,642 INFO L93 Difference]: Finished difference Result 641 states and 855 transitions. [2018-12-02 10:48:25,643 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-12-02 10:48:25,643 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 47 [2018-12-02 10:48:25,643 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 10:48:25,644 INFO L225 Difference]: With dead ends: 641 [2018-12-02 10:48:25,644 INFO L226 Difference]: Without dead ends: 492 [2018-12-02 10:48:25,645 INFO L631 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-12-02 10:48:25,646 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 492 states. [2018-12-02 10:48:25,654 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 492 to 184. [2018-12-02 10:48:25,654 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 184 states. [2018-12-02 10:48:25,655 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 184 states to 184 states and 244 transitions. [2018-12-02 10:48:25,655 INFO L78 Accepts]: Start accepts. Automaton has 184 states and 244 transitions. Word has length 47 [2018-12-02 10:48:25,655 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 10:48:25,655 INFO L480 AbstractCegarLoop]: Abstraction has 184 states and 244 transitions. [2018-12-02 10:48:25,655 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-02 10:48:25,655 INFO L276 IsEmpty]: Start isEmpty. Operand 184 states and 244 transitions. [2018-12-02 10:48:25,656 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2018-12-02 10:48:25,656 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 10:48:25,656 INFO L402 BasicCegarLoop]: trace histogram [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-12-02 10:48:25,656 INFO L423 AbstractCegarLoop]: === Iteration 9 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 10:48:25,656 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 10:48:25,656 INFO L82 PathProgramCache]: Analyzing trace with hash -1498452256, now seen corresponding path program 1 times [2018-12-02 10:48:25,657 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 10:48:25,657 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 10:48:25,657 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 10:48:25,657 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 10:48:25,658 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 10:48:25,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 10:48:25,708 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2018-12-02 10:48:25,708 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 10:48:25,708 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-02 10:48:25,708 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-02 10:48:25,709 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-02 10:48:25,709 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-12-02 10:48:25,709 INFO L87 Difference]: Start difference. First operand 184 states and 244 transitions. Second operand 6 states. [2018-12-02 10:48:25,953 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 10:48:25,954 INFO L93 Difference]: Finished difference Result 625 states and 835 transitions. [2018-12-02 10:48:25,954 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-12-02 10:48:25,954 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 48 [2018-12-02 10:48:25,954 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 10:48:25,955 INFO L225 Difference]: With dead ends: 625 [2018-12-02 10:48:25,955 INFO L226 Difference]: Without dead ends: 477 [2018-12-02 10:48:25,956 INFO L631 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-12-02 10:48:25,956 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 477 states. [2018-12-02 10:48:25,967 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 477 to 396. [2018-12-02 10:48:25,968 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 396 states. [2018-12-02 10:48:25,969 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 396 states to 396 states and 540 transitions. [2018-12-02 10:48:25,969 INFO L78 Accepts]: Start accepts. Automaton has 396 states and 540 transitions. Word has length 48 [2018-12-02 10:48:25,969 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 10:48:25,969 INFO L480 AbstractCegarLoop]: Abstraction has 396 states and 540 transitions. [2018-12-02 10:48:25,969 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-02 10:48:25,969 INFO L276 IsEmpty]: Start isEmpty. Operand 396 states and 540 transitions. [2018-12-02 10:48:25,970 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2018-12-02 10:48:25,970 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 10:48:25,970 INFO L402 BasicCegarLoop]: trace histogram [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-12-02 10:48:25,970 INFO L423 AbstractCegarLoop]: === Iteration 10 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 10:48:25,970 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 10:48:25,970 INFO L82 PathProgramCache]: Analyzing trace with hash -211268504, now seen corresponding path program 1 times [2018-12-02 10:48:25,971 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 10:48:25,971 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 10:48:25,971 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 10:48:25,971 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 10:48:25,971 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 10:48:25,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 10:48:26,030 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2018-12-02 10:48:26,030 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 10:48:26,030 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-12-02 10:48:26,031 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-12-02 10:48:26,031 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-12-02 10:48:26,031 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2018-12-02 10:48:26,031 INFO L87 Difference]: Start difference. First operand 396 states and 540 transitions. Second operand 8 states. [2018-12-02 10:48:26,623 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 10:48:26,624 INFO L93 Difference]: Finished difference Result 2003 states and 2787 transitions. [2018-12-02 10:48:26,624 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-12-02 10:48:26,624 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 49 [2018-12-02 10:48:26,624 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 10:48:26,629 INFO L225 Difference]: With dead ends: 2003 [2018-12-02 10:48:26,629 INFO L226 Difference]: Without dead ends: 1601 [2018-12-02 10:48:26,630 INFO L631 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-12-02 10:48:26,632 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1601 states. [2018-12-02 10:48:26,669 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1601 to 1231. [2018-12-02 10:48:26,670 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1231 states. [2018-12-02 10:48:26,673 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1231 states to 1231 states and 1711 transitions. [2018-12-02 10:48:26,673 INFO L78 Accepts]: Start accepts. Automaton has 1231 states and 1711 transitions. Word has length 49 [2018-12-02 10:48:26,674 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 10:48:26,674 INFO L480 AbstractCegarLoop]: Abstraction has 1231 states and 1711 transitions. [2018-12-02 10:48:26,674 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-12-02 10:48:26,674 INFO L276 IsEmpty]: Start isEmpty. Operand 1231 states and 1711 transitions. [2018-12-02 10:48:26,675 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2018-12-02 10:48:26,675 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 10:48:26,676 INFO L402 BasicCegarLoop]: trace histogram [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] [2018-12-02 10:48:26,676 INFO L423 AbstractCegarLoop]: === Iteration 11 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 10:48:26,676 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 10:48:26,676 INFO L82 PathProgramCache]: Analyzing trace with hash 968985203, now seen corresponding path program 1 times [2018-12-02 10:48:26,676 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 10:48:26,676 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 10:48:26,677 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 10:48:26,677 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 10:48:26,677 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 10:48:26,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 10:48:26,721 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2018-12-02 10:48:26,721 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 10:48:26,721 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-02 10:48:26,722 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-02 10:48:26,722 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-02 10:48:26,722 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-02 10:48:26,722 INFO L87 Difference]: Start difference. First operand 1231 states and 1711 transitions. Second operand 4 states. [2018-12-02 10:48:26,812 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 10:48:26,812 INFO L93 Difference]: Finished difference Result 1698 states and 2357 transitions. [2018-12-02 10:48:26,813 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-02 10:48:26,813 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 54 [2018-12-02 10:48:26,813 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 10:48:26,815 INFO L225 Difference]: With dead ends: 1698 [2018-12-02 10:48:26,815 INFO L226 Difference]: Without dead ends: 1249 [2018-12-02 10:48:26,816 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 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-12-02 10:48:26,817 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1249 states. [2018-12-02 10:48:26,837 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1249 to 1243. [2018-12-02 10:48:26,837 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1243 states. [2018-12-02 10:48:26,840 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1243 states to 1243 states and 1692 transitions. [2018-12-02 10:48:26,840 INFO L78 Accepts]: Start accepts. Automaton has 1243 states and 1692 transitions. Word has length 54 [2018-12-02 10:48:26,840 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 10:48:26,840 INFO L480 AbstractCegarLoop]: Abstraction has 1243 states and 1692 transitions. [2018-12-02 10:48:26,840 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-02 10:48:26,840 INFO L276 IsEmpty]: Start isEmpty. Operand 1243 states and 1692 transitions. [2018-12-02 10:48:26,841 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2018-12-02 10:48:26,841 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 10:48:26,841 INFO L402 BasicCegarLoop]: trace histogram [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] [2018-12-02 10:48:26,841 INFO L423 AbstractCegarLoop]: === Iteration 12 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 10:48:26,841 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 10:48:26,841 INFO L82 PathProgramCache]: Analyzing trace with hash 752188361, now seen corresponding path program 1 times [2018-12-02 10:48:26,841 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 10:48:26,842 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 10:48:26,842 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 10:48:26,842 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 10:48:26,842 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 10:48:26,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 10:48:26,911 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 7 proven. 1 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2018-12-02 10:48:26,912 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 10:48:26,912 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_470b1560-4365-47e5-9038-f77a95a54932/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-12-02 10:48:26,919 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 10:48:26,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 10:48:26,934 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 10:48:26,987 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2018-12-02 10:48:27,013 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-12-02 10:48:27,013 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [8] total 10 [2018-12-02 10:48:27,013 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-12-02 10:48:27,013 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-12-02 10:48:27,013 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=59, Unknown=0, NotChecked=0, Total=90 [2018-12-02 10:48:27,014 INFO L87 Difference]: Start difference. First operand 1243 states and 1692 transitions. Second operand 10 states. [2018-12-02 10:48:27,619 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 10:48:27,619 INFO L93 Difference]: Finished difference Result 2808 states and 3815 transitions. [2018-12-02 10:48:27,619 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-12-02 10:48:27,619 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 55 [2018-12-02 10:48:27,620 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 10:48:27,622 INFO L225 Difference]: With dead ends: 2808 [2018-12-02 10:48:27,622 INFO L226 Difference]: Without dead ends: 1553 [2018-12-02 10:48:27,624 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 52 SyntacticMatches, 2 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 35 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=75, Invalid=165, Unknown=0, NotChecked=0, Total=240 [2018-12-02 10:48:27,625 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1553 states. [2018-12-02 10:48:27,645 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1553 to 1279. [2018-12-02 10:48:27,645 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1279 states. [2018-12-02 10:48:27,647 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1279 states to 1279 states and 1694 transitions. [2018-12-02 10:48:27,648 INFO L78 Accepts]: Start accepts. Automaton has 1279 states and 1694 transitions. Word has length 55 [2018-12-02 10:48:27,648 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 10:48:27,648 INFO L480 AbstractCegarLoop]: Abstraction has 1279 states and 1694 transitions. [2018-12-02 10:48:27,648 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-12-02 10:48:27,648 INFO L276 IsEmpty]: Start isEmpty. Operand 1279 states and 1694 transitions. [2018-12-02 10:48:27,649 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2018-12-02 10:48:27,649 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 10:48:27,649 INFO L402 BasicCegarLoop]: trace histogram [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] [2018-12-02 10:48:27,649 INFO L423 AbstractCegarLoop]: === Iteration 13 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 10:48:27,650 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 10:48:27,650 INFO L82 PathProgramCache]: Analyzing trace with hash -1415790296, now seen corresponding path program 1 times [2018-12-02 10:48:27,650 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 10:48:27,650 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 10:48:27,650 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 10:48:27,651 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 10:48:27,651 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 10:48:27,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 10:48:27,736 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2018-12-02 10:48:27,736 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 10:48:27,736 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2018-12-02 10:48:27,737 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-12-02 10:48:27,737 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-12-02 10:48:27,737 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2018-12-02 10:48:27,737 INFO L87 Difference]: Start difference. First operand 1279 states and 1694 transitions. Second operand 9 states. [2018-12-02 10:48:28,203 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 10:48:28,203 INFO L93 Difference]: Finished difference Result 2987 states and 3987 transitions. [2018-12-02 10:48:28,204 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-12-02 10:48:28,204 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 56 [2018-12-02 10:48:28,204 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 10:48:28,207 INFO L225 Difference]: With dead ends: 2987 [2018-12-02 10:48:28,207 INFO L226 Difference]: Without dead ends: 1932 [2018-12-02 10:48:28,208 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=42, Invalid=114, Unknown=0, NotChecked=0, Total=156 [2018-12-02 10:48:28,209 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1932 states. [2018-12-02 10:48:28,233 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1932 to 1643. [2018-12-02 10:48:28,233 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1643 states. [2018-12-02 10:48:28,235 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1643 states to 1643 states and 2152 transitions. [2018-12-02 10:48:28,235 INFO L78 Accepts]: Start accepts. Automaton has 1643 states and 2152 transitions. Word has length 56 [2018-12-02 10:48:28,236 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 10:48:28,236 INFO L480 AbstractCegarLoop]: Abstraction has 1643 states and 2152 transitions. [2018-12-02 10:48:28,236 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-12-02 10:48:28,236 INFO L276 IsEmpty]: Start isEmpty. Operand 1643 states and 2152 transitions. [2018-12-02 10:48:28,237 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2018-12-02 10:48:28,237 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 10:48:28,237 INFO L402 BasicCegarLoop]: trace histogram [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] [2018-12-02 10:48:28,237 INFO L423 AbstractCegarLoop]: === Iteration 14 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 10:48:28,237 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 10:48:28,237 INFO L82 PathProgramCache]: Analyzing trace with hash 1038259591, now seen corresponding path program 1 times [2018-12-02 10:48:28,237 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 10:48:28,237 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 10:48:28,238 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 10:48:28,238 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 10:48:28,238 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 10:48:28,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 10:48:28,278 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2018-12-02 10:48:28,278 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 10:48:28,278 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-02 10:48:28,278 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-02 10:48:28,278 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-02 10:48:28,278 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-02 10:48:28,278 INFO L87 Difference]: Start difference. First operand 1643 states and 2152 transitions. Second operand 4 states. [2018-12-02 10:48:28,361 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 10:48:28,361 INFO L93 Difference]: Finished difference Result 2184 states and 2863 transitions. [2018-12-02 10:48:28,362 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-02 10:48:28,362 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 58 [2018-12-02 10:48:28,362 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 10:48:28,365 INFO L225 Difference]: With dead ends: 2184 [2018-12-02 10:48:28,365 INFO L226 Difference]: Without dead ends: 1678 [2018-12-02 10:48:28,366 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 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-12-02 10:48:28,368 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1678 states. [2018-12-02 10:48:28,394 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1678 to 1644. [2018-12-02 10:48:28,394 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1644 states. [2018-12-02 10:48:28,396 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1644 states to 1644 states and 2133 transitions. [2018-12-02 10:48:28,396 INFO L78 Accepts]: Start accepts. Automaton has 1644 states and 2133 transitions. Word has length 58 [2018-12-02 10:48:28,396 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 10:48:28,396 INFO L480 AbstractCegarLoop]: Abstraction has 1644 states and 2133 transitions. [2018-12-02 10:48:28,396 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-02 10:48:28,397 INFO L276 IsEmpty]: Start isEmpty. Operand 1644 states and 2133 transitions. [2018-12-02 10:48:28,397 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2018-12-02 10:48:28,397 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 10:48:28,398 INFO L402 BasicCegarLoop]: trace histogram [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-12-02 10:48:28,398 INFO L423 AbstractCegarLoop]: === Iteration 15 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 10:48:28,398 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 10:48:28,398 INFO L82 PathProgramCache]: Analyzing trace with hash 1793263524, now seen corresponding path program 1 times [2018-12-02 10:48:28,398 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 10:48:28,398 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 10:48:28,398 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 10:48:28,399 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 10:48:28,399 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 10:48:28,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 10:48:28,460 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 7 proven. 1 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2018-12-02 10:48:28,460 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 10:48:28,460 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_470b1560-4365-47e5-9038-f77a95a54932/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-12-02 10:48:28,469 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 10:48:28,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 10:48:28,488 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 10:48:28,550 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2018-12-02 10:48:28,566 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-12-02 10:48:28,566 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [8] total 10 [2018-12-02 10:48:28,566 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-12-02 10:48:28,567 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-12-02 10:48:28,567 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2018-12-02 10:48:28,567 INFO L87 Difference]: Start difference. First operand 1644 states and 2133 transitions. Second operand 10 states. [2018-12-02 10:48:29,240 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 10:48:29,240 INFO L93 Difference]: Finished difference Result 2532 states and 3267 transitions. [2018-12-02 10:48:29,240 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2018-12-02 10:48:29,240 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 59 [2018-12-02 10:48:29,240 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 10:48:29,242 INFO L225 Difference]: With dead ends: 2532 [2018-12-02 10:48:29,242 INFO L226 Difference]: Without dead ends: 1883 [2018-12-02 10:48:29,243 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 81 GetRequests, 56 SyntacticMatches, 2 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 123 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=155, Invalid=445, Unknown=0, NotChecked=0, Total=600 [2018-12-02 10:48:29,244 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1883 states. [2018-12-02 10:48:29,266 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1883 to 1651. [2018-12-02 10:48:29,266 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1651 states. [2018-12-02 10:48:29,268 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1651 states to 1651 states and 2121 transitions. [2018-12-02 10:48:29,268 INFO L78 Accepts]: Start accepts. Automaton has 1651 states and 2121 transitions. Word has length 59 [2018-12-02 10:48:29,268 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 10:48:29,268 INFO L480 AbstractCegarLoop]: Abstraction has 1651 states and 2121 transitions. [2018-12-02 10:48:29,268 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-12-02 10:48:29,268 INFO L276 IsEmpty]: Start isEmpty. Operand 1651 states and 2121 transitions. [2018-12-02 10:48:29,269 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2018-12-02 10:48:29,269 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 10:48:29,269 INFO L402 BasicCegarLoop]: trace histogram [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, 1] [2018-12-02 10:48:29,270 INFO L423 AbstractCegarLoop]: === Iteration 16 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 10:48:29,270 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 10:48:29,270 INFO L82 PathProgramCache]: Analyzing trace with hash -313662180, now seen corresponding path program 1 times [2018-12-02 10:48:29,270 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 10:48:29,270 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 10:48:29,270 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 10:48:29,270 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 10:48:29,270 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 10:48:29,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 10:48:29,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 10:48:29,296 INFO L469 BasicCegarLoop]: Counterexample might be feasible [2018-12-02 10:48:29,327 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 02.12 10:48:29 BoogieIcfgContainer [2018-12-02 10:48:29,327 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-12-02 10:48:29,328 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-12-02 10:48:29,328 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-12-02 10:48:29,328 INFO L276 PluginConnector]: Witness Printer initialized [2018-12-02 10:48:29,328 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.12 10:48:23" (3/4) ... [2018-12-02 10:48:29,331 INFO L147 WitnessPrinter]: No result that supports witness generation found [2018-12-02 10:48:29,331 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-12-02 10:48:29,331 INFO L168 Benchmark]: Toolchain (without parser) took 6442.32 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 175.1 MB). Free memory was 957.1 MB in the beginning and 973.0 MB in the end (delta: -15.9 MB). Peak memory consumption was 159.2 MB. Max. memory is 11.5 GB. [2018-12-02 10:48:29,332 INFO L168 Benchmark]: CDTParser took 0.14 ms. Allocated memory is still 1.0 GB. Free memory is still 976.9 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-02 10:48:29,332 INFO L168 Benchmark]: CACSL2BoogieTranslator took 163.64 ms. Allocated memory is still 1.0 GB. Free memory was 957.1 MB in the beginning and 939.9 MB in the end (delta: 17.2 MB). Peak memory consumption was 17.2 MB. Max. memory is 11.5 GB. [2018-12-02 10:48:29,332 INFO L168 Benchmark]: Boogie Procedure Inliner took 13.97 ms. Allocated memory is still 1.0 GB. Free memory is still 939.9 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-02 10:48:29,333 INFO L168 Benchmark]: Boogie Preprocessor took 48.68 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 102.2 MB). Free memory was 939.9 MB in the beginning and 1.1 GB in the end (delta: -157.7 MB). Peak memory consumption was 12.9 MB. Max. memory is 11.5 GB. [2018-12-02 10:48:29,333 INFO L168 Benchmark]: RCFGBuilder took 202.08 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 19.7 MB). Peak memory consumption was 19.7 MB. Max. memory is 11.5 GB. [2018-12-02 10:48:29,333 INFO L168 Benchmark]: TraceAbstraction took 6007.96 ms. Allocated memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: 72.9 MB). Free memory was 1.1 GB in the beginning and 973.0 MB in the end (delta: 104.9 MB). Peak memory consumption was 177.8 MB. Max. memory is 11.5 GB. [2018-12-02 10:48:29,333 INFO L168 Benchmark]: Witness Printer took 2.94 ms. Allocated memory is still 1.2 GB. Free memory is still 973.0 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-02 10:48:29,335 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 976.9 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 163.64 ms. Allocated memory is still 1.0 GB. Free memory was 957.1 MB in the beginning and 939.9 MB in the end (delta: 17.2 MB). Peak memory consumption was 17.2 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 13.97 ms. Allocated memory is still 1.0 GB. Free memory is still 939.9 MB. There was no memory consumed. Max. memory is 11.5 GB. * Boogie Preprocessor took 48.68 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 102.2 MB). Free memory was 939.9 MB in the beginning and 1.1 GB in the end (delta: -157.7 MB). Peak memory consumption was 12.9 MB. Max. memory is 11.5 GB. * RCFGBuilder took 202.08 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 19.7 MB). Peak memory consumption was 19.7 MB. Max. memory is 11.5 GB. * TraceAbstraction took 6007.96 ms. Allocated memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: 72.9 MB). Free memory was 1.1 GB in the beginning and 973.0 MB in the end (delta: 104.9 MB). Peak memory consumption was 177.8 MB. Max. memory is 11.5 GB. * Witness Printer took 2.94 ms. Allocated memory is still 1.2 GB. Free memory is still 973.0 MB. There was no memory consumed. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - UnprovableResult [Line: 6]: Unable to prove that call of __VERIFIER_error() unreachable Unable to prove that call of __VERIFIER_error() unreachable Reason: overapproximation of bitwiseOr at line 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] 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] RET, 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, 54 locations, 1 error locations. UNSAFE Result, 5.9s OverallTime, 16 OverallIterations, 4 TraceHistogramMax, 4.4s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 1244 SDtfs, 2646 SDslu, 2753 SDs, 0 SdLazy, 5130 SolverSat, 502 SolverUnsat, 2 SolverUnknown, 0 SolverNotchecked, 3.1s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 285 GetRequests, 176 SyntacticMatches, 11 SemanticMatches, 98 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 177 ImplicationChecksByTransitivity, 0.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1651occurred in iteration=15, 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.2s AutomataMinimizationTime, 15 MinimizatonAttempts, 1951 StatesRemovedByMinimization, 14 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.7s InterpolantComputationTime, 863 NumberOfCodeBlocks, 863 NumberOfCodeBlocksAsserted, 19 NumberOfCheckSat, 785 ConstructedInterpolants, 41 QuantifiedInterpolants, 159396 SizeOfPredicates, 7 NumberOfNonLiveVariables, 396 ConjunctsInSsa, 35 ConjunctsInUnsatCore, 18 InterpolantComputations, 15 PerfectInterpolantSequences, 361/367 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-635dfa2 [2018-12-02 10:48:30,564 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-12-02 10:48:30,565 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-12-02 10:48:30,571 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-12-02 10:48:30,571 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-12-02 10:48:30,571 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-12-02 10:48:30,572 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-12-02 10:48:30,573 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-12-02 10:48:30,574 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-12-02 10:48:30,575 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-12-02 10:48:30,576 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-12-02 10:48:30,576 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-12-02 10:48:30,576 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-12-02 10:48:30,577 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-12-02 10:48:30,578 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-12-02 10:48:30,578 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-12-02 10:48:30,579 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-12-02 10:48:30,580 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-12-02 10:48:30,581 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-12-02 10:48:30,582 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-12-02 10:48:30,582 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-12-02 10:48:30,583 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-12-02 10:48:30,585 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-12-02 10:48:30,585 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-12-02 10:48:30,585 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-12-02 10:48:30,586 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-12-02 10:48:30,586 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-12-02 10:48:30,586 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-12-02 10:48:30,587 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-12-02 10:48:30,587 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-12-02 10:48:30,587 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-12-02 10:48:30,588 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-12-02 10:48:30,588 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-12-02 10:48:30,588 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-12-02 10:48:30,588 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-12-02 10:48:30,589 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-12-02 10:48:30,589 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_470b1560-4365-47e5-9038-f77a95a54932/bin-2019/uautomizer/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2018-12-02 10:48:30,598 INFO L110 SettingsManager]: Loading preferences was successful [2018-12-02 10:48:30,598 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-12-02 10:48:30,599 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-12-02 10:48:30,599 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-12-02 10:48:30,599 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-12-02 10:48:30,600 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-12-02 10:48:30,600 INFO L133 SettingsManager]: * Use SBE=true [2018-12-02 10:48:30,600 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-12-02 10:48:30,600 INFO L133 SettingsManager]: * sizeof long=4 [2018-12-02 10:48:30,600 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-12-02 10:48:30,600 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-12-02 10:48:30,601 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-12-02 10:48:30,601 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-12-02 10:48:30,601 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-12-02 10:48:30,601 INFO L133 SettingsManager]: * Use bitvectors instead of ints=true [2018-12-02 10:48:30,601 INFO L133 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2018-12-02 10:48:30,601 INFO L133 SettingsManager]: * sizeof long double=12 [2018-12-02 10:48:30,601 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-12-02 10:48:30,602 INFO L133 SettingsManager]: * Use constant arrays=true [2018-12-02 10:48:30,602 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-12-02 10:48:30,602 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-12-02 10:48:30,602 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-12-02 10:48:30,602 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-12-02 10:48:30,602 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-12-02 10:48:30,603 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-12-02 10:48:30,603 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-12-02 10:48:30,603 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-12-02 10:48:30,603 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-12-02 10:48:30,603 INFO L133 SettingsManager]: * Trace refinement strategy=WOLF [2018-12-02 10:48:30,603 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-12-02 10:48:30,603 INFO L133 SettingsManager]: * Command for external solver=cvc4 --incremental --rewrite-divk --print-success --lang smt [2018-12-02 10:48:30,604 INFO L133 SettingsManager]: * Logic for external solver=AUFBV [2018-12-02 10:48:30,604 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_470b1560-4365-47e5-9038-f77a95a54932/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-12-02 10:48:30,627 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-12-02 10:48:30,634 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-12-02 10:48:30,636 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-12-02 10:48:30,637 INFO L271 PluginConnector]: Initializing CDTParser... [2018-12-02 10:48:30,637 INFO L276 PluginConnector]: CDTParser initialized [2018-12-02 10:48:30,637 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_470b1560-4365-47e5-9038-f77a95a54932/bin-2019/uautomizer/../../sv-benchmarks/c/bitvector/byte_add_false-unreach-call_true-no-overflow_true-termination.i [2018-12-02 10:48:30,672 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_470b1560-4365-47e5-9038-f77a95a54932/bin-2019/uautomizer/data/dcd2dd6db/32a1aed0b2fd439c894bb30f9c327111/FLAGf6d226bc2 [2018-12-02 10:48:31,108 INFO L307 CDTParser]: Found 1 translation units. [2018-12-02 10:48:31,109 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_470b1560-4365-47e5-9038-f77a95a54932/sv-benchmarks/c/bitvector/byte_add_false-unreach-call_true-no-overflow_true-termination.i [2018-12-02 10:48:31,113 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_470b1560-4365-47e5-9038-f77a95a54932/bin-2019/uautomizer/data/dcd2dd6db/32a1aed0b2fd439c894bb30f9c327111/FLAGf6d226bc2 [2018-12-02 10:48:31,123 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_470b1560-4365-47e5-9038-f77a95a54932/bin-2019/uautomizer/data/dcd2dd6db/32a1aed0b2fd439c894bb30f9c327111 [2018-12-02 10:48:31,125 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-12-02 10:48:31,126 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-12-02 10:48:31,127 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-12-02 10:48:31,127 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-12-02 10:48:31,129 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-12-02 10:48:31,130 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.12 10:48:31" (1/1) ... [2018-12-02 10:48:31,131 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@8f4428e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 10:48:31, skipping insertion in model container [2018-12-02 10:48:31,132 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.12 10:48:31" (1/1) ... [2018-12-02 10:48:31,138 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-12-02 10:48:31,153 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-12-02 10:48:31,269 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-02 10:48:31,272 INFO L191 MainTranslator]: Completed pre-run [2018-12-02 10:48:31,295 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-02 10:48:31,304 INFO L195 MainTranslator]: Completed translation [2018-12-02 10:48:31,305 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 10:48:31 WrapperNode [2018-12-02 10:48:31,305 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-12-02 10:48:31,305 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-12-02 10:48:31,306 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-12-02 10:48:31,306 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-12-02 10:48:31,311 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 10:48:31" (1/1) ... [2018-12-02 10:48:31,316 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 10:48:31" (1/1) ... [2018-12-02 10:48:31,320 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-12-02 10:48:31,320 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-12-02 10:48:31,321 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-12-02 10:48:31,321 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-12-02 10:48:31,326 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 10:48:31" (1/1) ... [2018-12-02 10:48:31,326 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 10:48:31" (1/1) ... [2018-12-02 10:48:31,327 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 10:48:31" (1/1) ... [2018-12-02 10:48:31,327 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 10:48:31" (1/1) ... [2018-12-02 10:48:31,332 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 10:48:31" (1/1) ... [2018-12-02 10:48:31,336 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 10:48:31" (1/1) ... [2018-12-02 10:48:31,338 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 10:48:31" (1/1) ... [2018-12-02 10:48:31,339 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-12-02 10:48:31,339 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-12-02 10:48:31,339 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-12-02 10:48:31,339 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-12-02 10:48:31,340 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 10:48:31" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_470b1560-4365-47e5-9038-f77a95a54932/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-12-02 10:48:31,407 INFO L130 BoogieDeclarations]: Found specification of procedure mp_add [2018-12-02 10:48:31,407 INFO L138 BoogieDeclarations]: Found implementation of procedure mp_add [2018-12-02 10:48:31,408 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-12-02 10:48:31,408 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-12-02 10:48:31,408 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-12-02 10:48:31,408 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-12-02 10:48:31,408 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-12-02 10:48:31,408 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-12-02 10:48:31,408 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2018-12-02 10:48:31,408 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2018-12-02 10:48:31,583 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-12-02 10:48:31,583 INFO L280 CfgBuilder]: Removed 2 assue(true) statements. [2018-12-02 10:48:31,584 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.12 10:48:31 BoogieIcfgContainer [2018-12-02 10:48:31,584 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-12-02 10:48:31,584 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-12-02 10:48:31,584 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-12-02 10:48:31,586 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-12-02 10:48:31,586 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 02.12 10:48:31" (1/3) ... [2018-12-02 10:48:31,587 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@afe5d3e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.12 10:48:31, skipping insertion in model container [2018-12-02 10:48:31,587 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 10:48:31" (2/3) ... [2018-12-02 10:48:31,587 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@afe5d3e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.12 10:48:31, skipping insertion in model container [2018-12-02 10:48:31,587 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.12 10:48:31" (3/3) ... [2018-12-02 10:48:31,588 INFO L112 eAbstractionObserver]: Analyzing ICFG byte_add_false-unreach-call_true-no-overflow_true-termination.i [2018-12-02 10:48:31,594 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-12-02 10:48:31,600 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-12-02 10:48:31,609 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-12-02 10:48:31,626 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-12-02 10:48:31,626 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-12-02 10:48:31,626 INFO L383 AbstractCegarLoop]: Hoare is true [2018-12-02 10:48:31,627 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-12-02 10:48:31,627 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-12-02 10:48:31,627 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-12-02 10:48:31,627 INFO L387 AbstractCegarLoop]: Difference is false [2018-12-02 10:48:31,627 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-12-02 10:48:31,627 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-12-02 10:48:31,637 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states. [2018-12-02 10:48:31,641 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2018-12-02 10:48:31,641 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 10:48:31,641 INFO L402 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-12-02 10:48:31,642 INFO L423 AbstractCegarLoop]: === Iteration 1 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 10:48:31,645 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 10:48:31,646 INFO L82 PathProgramCache]: Analyzing trace with hash 397916932, now seen corresponding path program 1 times [2018-12-02 10:48:31,648 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-12-02 10:48:31,648 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_470b1560-4365-47e5-9038-f77a95a54932/bin-2019/uautomizer/cvc4 Starting monitored process 2 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2018-12-02 10:48:31,662 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 10:48:31,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 10:48:31,691 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 10:48:31,701 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 10:48:31,701 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-12-02 10:48:31,704 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 10:48:31,704 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-12-02 10:48:31,706 INFO L459 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-12-02 10:48:31,714 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-12-02 10:48:31,714 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-12-02 10:48:31,716 INFO L87 Difference]: Start difference. First operand 54 states. Second operand 2 states. [2018-12-02 10:48:31,730 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 10:48:31,730 INFO L93 Difference]: Finished difference Result 76 states and 112 transitions. [2018-12-02 10:48:31,730 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-12-02 10:48:31,731 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 21 [2018-12-02 10:48:31,731 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 10:48:31,736 INFO L225 Difference]: With dead ends: 76 [2018-12-02 10:48:31,736 INFO L226 Difference]: Without dead ends: 47 [2018-12-02 10:48:31,738 INFO L631 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-12-02 10:48:31,748 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2018-12-02 10:48:31,758 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 47. [2018-12-02 10:48:31,758 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47 states. [2018-12-02 10:48:31,759 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 73 transitions. [2018-12-02 10:48:31,760 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 73 transitions. Word has length 21 [2018-12-02 10:48:31,760 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 10:48:31,760 INFO L480 AbstractCegarLoop]: Abstraction has 47 states and 73 transitions. [2018-12-02 10:48:31,760 INFO L481 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-12-02 10:48:31,760 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 73 transitions. [2018-12-02 10:48:31,761 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2018-12-02 10:48:31,761 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 10:48:31,761 INFO L402 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-12-02 10:48:31,761 INFO L423 AbstractCegarLoop]: === Iteration 2 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 10:48:31,761 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 10:48:31,761 INFO L82 PathProgramCache]: Analyzing trace with hash -1531564698, now seen corresponding path program 1 times [2018-12-02 10:48:31,762 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-12-02 10:48:31,762 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_470b1560-4365-47e5-9038-f77a95a54932/bin-2019/uautomizer/cvc4 Starting monitored process 3 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2018-12-02 10:48:31,777 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 10:48:31,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 10:48:31,808 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 10:48:31,831 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 10:48:31,831 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-12-02 10:48:31,832 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 10:48:31,833 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-02 10:48:31,833 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-02 10:48:31,834 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-02 10:48:31,834 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-12-02 10:48:31,834 INFO L87 Difference]: Start difference. First operand 47 states and 73 transitions. Second operand 4 states. [2018-12-02 10:48:31,939 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 10:48:31,939 INFO L93 Difference]: Finished difference Result 127 states and 213 transitions. [2018-12-02 10:48:31,940 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-02 10:48:31,940 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 21 [2018-12-02 10:48:31,940 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 10:48:31,942 INFO L225 Difference]: With dead ends: 127 [2018-12-02 10:48:31,943 INFO L226 Difference]: Without dead ends: 95 [2018-12-02 10:48:31,943 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 18 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-12-02 10:48:31,944 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95 states. [2018-12-02 10:48:31,952 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95 to 90. [2018-12-02 10:48:31,952 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 90 states. [2018-12-02 10:48:31,954 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 139 transitions. [2018-12-02 10:48:31,954 INFO L78 Accepts]: Start accepts. Automaton has 90 states and 139 transitions. Word has length 21 [2018-12-02 10:48:31,954 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 10:48:31,954 INFO L480 AbstractCegarLoop]: Abstraction has 90 states and 139 transitions. [2018-12-02 10:48:31,954 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-02 10:48:31,955 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 139 transitions. [2018-12-02 10:48:31,955 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-12-02 10:48:31,955 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 10:48:31,955 INFO L402 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] [2018-12-02 10:48:31,956 INFO L423 AbstractCegarLoop]: === Iteration 3 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 10:48:31,956 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 10:48:31,956 INFO L82 PathProgramCache]: Analyzing trace with hash -1988705185, now seen corresponding path program 1 times [2018-12-02 10:48:31,956 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-12-02 10:48:31,957 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_470b1560-4365-47e5-9038-f77a95a54932/bin-2019/uautomizer/cvc4 Starting monitored process 4 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2018-12-02 10:48:31,970 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 10:48:31,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 10:48:32,000 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 10:48:32,020 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 10:48:32,021 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-12-02 10:48:32,022 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 10:48:32,022 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-02 10:48:32,022 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-02 10:48:32,023 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-02 10:48:32,023 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2018-12-02 10:48:32,023 INFO L87 Difference]: Start difference. First operand 90 states and 139 transitions. Second operand 5 states. [2018-12-02 10:48:32,206 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 10:48:32,206 INFO L93 Difference]: Finished difference Result 173 states and 282 transitions. [2018-12-02 10:48:32,206 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-02 10:48:32,207 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 22 [2018-12-02 10:48:32,207 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 10:48:32,208 INFO L225 Difference]: With dead ends: 173 [2018-12-02 10:48:32,208 INFO L226 Difference]: Without dead ends: 141 [2018-12-02 10:48:32,208 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 18 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-12-02 10:48:32,208 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 141 states. [2018-12-02 10:48:32,213 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 141 to 90. [2018-12-02 10:48:32,213 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 90 states. [2018-12-02 10:48:32,214 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 139 transitions. [2018-12-02 10:48:32,214 INFO L78 Accepts]: Start accepts. Automaton has 90 states and 139 transitions. Word has length 22 [2018-12-02 10:48:32,214 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 10:48:32,214 INFO L480 AbstractCegarLoop]: Abstraction has 90 states and 139 transitions. [2018-12-02 10:48:32,215 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-02 10:48:32,215 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 139 transitions. [2018-12-02 10:48:32,215 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-12-02 10:48:32,215 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 10:48:32,215 INFO L402 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-12-02 10:48:32,215 INFO L423 AbstractCegarLoop]: === Iteration 4 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 10:48:32,216 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 10:48:32,216 INFO L82 PathProgramCache]: Analyzing trace with hash -1386022735, now seen corresponding path program 1 times [2018-12-02 10:48:32,216 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-12-02 10:48:32,216 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_470b1560-4365-47e5-9038-f77a95a54932/bin-2019/uautomizer/cvc4 Starting monitored process 5 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2018-12-02 10:48:32,229 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 10:48:32,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 10:48:32,251 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 10:48:32,274 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 10:48:32,274 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-12-02 10:48:32,275 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 10:48:32,276 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-12-02 10:48:32,276 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-02 10:48:32,276 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-02 10:48:32,276 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2018-12-02 10:48:32,276 INFO L87 Difference]: Start difference. First operand 90 states and 139 transitions. Second operand 7 states. [2018-12-02 10:48:32,402 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 10:48:32,402 INFO L93 Difference]: Finished difference Result 215 states and 343 transitions. [2018-12-02 10:48:32,402 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-02 10:48:32,402 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 23 [2018-12-02 10:48:32,403 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 10:48:32,404 INFO L225 Difference]: With dead ends: 215 [2018-12-02 10:48:32,404 INFO L226 Difference]: Without dead ends: 183 [2018-12-02 10:48:32,404 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 17 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-12-02 10:48:32,404 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 183 states. [2018-12-02 10:48:32,410 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 183 to 120. [2018-12-02 10:48:32,410 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 120 states. [2018-12-02 10:48:32,411 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 120 states to 120 states and 183 transitions. [2018-12-02 10:48:32,411 INFO L78 Accepts]: Start accepts. Automaton has 120 states and 183 transitions. Word has length 23 [2018-12-02 10:48:32,411 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 10:48:32,411 INFO L480 AbstractCegarLoop]: Abstraction has 120 states and 183 transitions. [2018-12-02 10:48:32,411 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-02 10:48:32,411 INFO L276 IsEmpty]: Start isEmpty. Operand 120 states and 183 transitions. [2018-12-02 10:48:32,412 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-12-02 10:48:32,412 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 10:48:32,412 INFO L402 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-12-02 10:48:32,412 INFO L423 AbstractCegarLoop]: === Iteration 5 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 10:48:32,412 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 10:48:32,413 INFO L82 PathProgramCache]: Analyzing trace with hash -1127857297, now seen corresponding path program 1 times [2018-12-02 10:48:32,413 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-12-02 10:48:32,413 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_470b1560-4365-47e5-9038-f77a95a54932/bin-2019/uautomizer/cvc4 Starting monitored process 6 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2018-12-02 10:48:32,426 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 10:48:32,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 10:48:32,447 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 10:48:32,464 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 10:48:32,465 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-12-02 10:48:32,466 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 10:48:32,466 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-02 10:48:32,466 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-02 10:48:32,466 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-02 10:48:32,466 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2018-12-02 10:48:32,466 INFO L87 Difference]: Start difference. First operand 120 states and 183 transitions. Second operand 6 states. [2018-12-02 10:48:32,614 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 10:48:32,614 INFO L93 Difference]: Finished difference Result 234 states and 364 transitions. [2018-12-02 10:48:32,614 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-12-02 10:48:32,615 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 23 [2018-12-02 10:48:32,615 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 10:48:32,615 INFO L225 Difference]: With dead ends: 234 [2018-12-02 10:48:32,616 INFO L226 Difference]: Without dead ends: 202 [2018-12-02 10:48:32,616 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 18 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-12-02 10:48:32,616 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 202 states. [2018-12-02 10:48:32,621 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 202 to 96. [2018-12-02 10:48:32,621 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 96 states. [2018-12-02 10:48:32,621 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 138 transitions. [2018-12-02 10:48:32,621 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 138 transitions. Word has length 23 [2018-12-02 10:48:32,622 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 10:48:32,622 INFO L480 AbstractCegarLoop]: Abstraction has 96 states and 138 transitions. [2018-12-02 10:48:32,622 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-02 10:48:32,622 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 138 transitions. [2018-12-02 10:48:32,622 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2018-12-02 10:48:32,622 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 10:48:32,623 INFO L402 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, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 10:48:32,623 INFO L423 AbstractCegarLoop]: === Iteration 6 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 10:48:32,623 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 10:48:32,623 INFO L82 PathProgramCache]: Analyzing trace with hash 214387631, now seen corresponding path program 1 times [2018-12-02 10:48:32,623 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-12-02 10:48:32,623 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_470b1560-4365-47e5-9038-f77a95a54932/bin-2019/uautomizer/cvc4 Starting monitored process 7 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2018-12-02 10:48:32,636 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 10:48:32,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 10:48:32,658 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 10:48:32,667 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 10:48:32,667 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-12-02 10:48:32,668 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 10:48:32,668 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-02 10:48:32,669 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-02 10:48:32,669 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-02 10:48:32,669 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-12-02 10:48:32,669 INFO L87 Difference]: Start difference. First operand 96 states and 138 transitions. Second operand 4 states. [2018-12-02 10:48:32,748 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 10:48:32,748 INFO L93 Difference]: Finished difference Result 254 states and 370 transitions. [2018-12-02 10:48:32,748 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-02 10:48:32,748 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 34 [2018-12-02 10:48:32,748 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 10:48:32,749 INFO L225 Difference]: With dead ends: 254 [2018-12-02 10:48:32,749 INFO L226 Difference]: Without dead ends: 180 [2018-12-02 10:48:32,749 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 31 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-12-02 10:48:32,750 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 180 states. [2018-12-02 10:48:32,754 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 180 to 106. [2018-12-02 10:48:32,754 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 106 states. [2018-12-02 10:48:32,755 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106 states to 106 states and 151 transitions. [2018-12-02 10:48:32,755 INFO L78 Accepts]: Start accepts. Automaton has 106 states and 151 transitions. Word has length 34 [2018-12-02 10:48:32,755 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 10:48:32,755 INFO L480 AbstractCegarLoop]: Abstraction has 106 states and 151 transitions. [2018-12-02 10:48:32,755 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-02 10:48:32,755 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 151 transitions. [2018-12-02 10:48:32,756 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2018-12-02 10:48:32,756 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 10:48:32,756 INFO L402 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 10:48:32,756 INFO L423 AbstractCegarLoop]: === Iteration 7 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 10:48:32,756 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 10:48:32,756 INFO L82 PathProgramCache]: Analyzing trace with hash -1041972219, now seen corresponding path program 1 times [2018-12-02 10:48:32,756 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-12-02 10:48:32,756 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_470b1560-4365-47e5-9038-f77a95a54932/bin-2019/uautomizer/cvc4 Starting monitored process 8 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2018-12-02 10:48:32,780 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 10:48:32,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 10:48:32,810 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 10:48:32,824 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 10:48:32,824 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-12-02 10:48:32,826 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 10:48:32,826 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-02 10:48:32,826 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-02 10:48:32,826 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-02 10:48:32,826 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2018-12-02 10:48:32,826 INFO L87 Difference]: Start difference. First operand 106 states and 151 transitions. Second operand 5 states. [2018-12-02 10:48:32,904 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 10:48:32,904 INFO L93 Difference]: Finished difference Result 334 states and 488 transitions. [2018-12-02 10:48:32,905 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-02 10:48:32,905 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 35 [2018-12-02 10:48:32,905 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 10:48:32,906 INFO L225 Difference]: With dead ends: 334 [2018-12-02 10:48:32,906 INFO L226 Difference]: Without dead ends: 260 [2018-12-02 10:48:32,906 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 31 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-12-02 10:48:32,907 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 260 states. [2018-12-02 10:48:32,914 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 260 to 106. [2018-12-02 10:48:32,914 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 106 states. [2018-12-02 10:48:32,915 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106 states to 106 states and 151 transitions. [2018-12-02 10:48:32,915 INFO L78 Accepts]: Start accepts. Automaton has 106 states and 151 transitions. Word has length 35 [2018-12-02 10:48:32,915 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 10:48:32,915 INFO L480 AbstractCegarLoop]: Abstraction has 106 states and 151 transitions. [2018-12-02 10:48:32,915 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-02 10:48:32,916 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 151 transitions. [2018-12-02 10:48:32,916 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2018-12-02 10:48:32,916 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 10:48:32,917 INFO L402 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 10:48:32,917 INFO L423 AbstractCegarLoop]: === Iteration 8 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 10:48:32,917 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 10:48:32,917 INFO L82 PathProgramCache]: Analyzing trace with hash 919023332, now seen corresponding path program 1 times [2018-12-02 10:48:32,917 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-12-02 10:48:32,918 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_470b1560-4365-47e5-9038-f77a95a54932/bin-2019/uautomizer/cvc4 Starting monitored process 9 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2018-12-02 10:48:32,931 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 10:48:32,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 10:48:32,955 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 10:48:32,988 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 10:48:32,988 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-12-02 10:48:32,990 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 10:48:32,990 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-12-02 10:48:32,990 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-02 10:48:32,990 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-02 10:48:32,990 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2018-12-02 10:48:32,991 INFO L87 Difference]: Start difference. First operand 106 states and 151 transitions. Second operand 7 states. [2018-12-02 10:48:33,083 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 10:48:33,084 INFO L93 Difference]: Finished difference Result 408 states and 594 transitions. [2018-12-02 10:48:33,084 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-02 10:48:33,084 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 36 [2018-12-02 10:48:33,084 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 10:48:33,085 INFO L225 Difference]: With dead ends: 408 [2018-12-02 10:48:33,085 INFO L226 Difference]: Without dead ends: 334 [2018-12-02 10:48:33,086 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 30 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-12-02 10:48:33,086 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 334 states. [2018-12-02 10:48:33,094 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 334 to 166. [2018-12-02 10:48:33,094 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 166 states. [2018-12-02 10:48:33,095 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 166 states to 166 states and 236 transitions. [2018-12-02 10:48:33,095 INFO L78 Accepts]: Start accepts. Automaton has 166 states and 236 transitions. Word has length 36 [2018-12-02 10:48:33,095 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 10:48:33,096 INFO L480 AbstractCegarLoop]: Abstraction has 166 states and 236 transitions. [2018-12-02 10:48:33,096 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-02 10:48:33,096 INFO L276 IsEmpty]: Start isEmpty. Operand 166 states and 236 transitions. [2018-12-02 10:48:33,096 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2018-12-02 10:48:33,096 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 10:48:33,097 INFO L402 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 10:48:33,097 INFO L423 AbstractCegarLoop]: === Iteration 9 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 10:48:33,097 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 10:48:33,097 INFO L82 PathProgramCache]: Analyzing trace with hash -1452715930, now seen corresponding path program 1 times [2018-12-02 10:48:33,097 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-12-02 10:48:33,097 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_470b1560-4365-47e5-9038-f77a95a54932/bin-2019/uautomizer/cvc4 Starting monitored process 10 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2018-12-02 10:48:33,116 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 10:48:33,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 10:48:33,143 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 10:48:33,156 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 10:48:33,156 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-12-02 10:48:33,157 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 10:48:33,157 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-02 10:48:33,158 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-02 10:48:33,158 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-02 10:48:33,158 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2018-12-02 10:48:33,158 INFO L87 Difference]: Start difference. First operand 166 states and 236 transitions. Second operand 6 states. [2018-12-02 10:48:33,292 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 10:48:33,292 INFO L93 Difference]: Finished difference Result 406 states and 588 transitions. [2018-12-02 10:48:33,292 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-12-02 10:48:33,292 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 36 [2018-12-02 10:48:33,292 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 10:48:33,293 INFO L225 Difference]: With dead ends: 406 [2018-12-02 10:48:33,293 INFO L226 Difference]: Without dead ends: 332 [2018-12-02 10:48:33,293 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 31 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-12-02 10:48:33,294 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 332 states. [2018-12-02 10:48:33,300 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 332 to 156. [2018-12-02 10:48:33,300 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 156 states. [2018-12-02 10:48:33,300 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 156 states to 156 states and 221 transitions. [2018-12-02 10:48:33,300 INFO L78 Accepts]: Start accepts. Automaton has 156 states and 221 transitions. Word has length 36 [2018-12-02 10:48:33,301 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 10:48:33,301 INFO L480 AbstractCegarLoop]: Abstraction has 156 states and 221 transitions. [2018-12-02 10:48:33,301 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-02 10:48:33,301 INFO L276 IsEmpty]: Start isEmpty. Operand 156 states and 221 transitions. [2018-12-02 10:48:33,301 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2018-12-02 10:48:33,301 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 10:48:33,301 INFO L402 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 10:48:33,302 INFO L423 AbstractCegarLoop]: === Iteration 10 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 10:48:33,302 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 10:48:33,302 INFO L82 PathProgramCache]: Analyzing trace with hash 617124283, now seen corresponding path program 1 times [2018-12-02 10:48:33,302 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-12-02 10:48:33,302 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_470b1560-4365-47e5-9038-f77a95a54932/bin-2019/uautomizer/cvc4 Starting monitored process 11 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2018-12-02 10:48:33,314 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 10:48:33,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 10:48:33,337 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 10:48:33,360 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 10:48:33,360 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-02 10:48:33,389 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 10:48:33,390 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-02 10:48:33,390 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 8 [2018-12-02 10:48:33,390 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-12-02 10:48:33,390 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-12-02 10:48:33,390 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2018-12-02 10:48:33,390 INFO L87 Difference]: Start difference. First operand 156 states and 221 transitions. Second operand 8 states. [2018-12-02 10:48:33,774 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 10:48:33,774 INFO L93 Difference]: Finished difference Result 531 states and 806 transitions. [2018-12-02 10:48:33,774 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-12-02 10:48:33,774 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 38 [2018-12-02 10:48:33,774 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 10:48:33,775 INFO L225 Difference]: With dead ends: 531 [2018-12-02 10:48:33,775 INFO L226 Difference]: Without dead ends: 455 [2018-12-02 10:48:33,776 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 79 GetRequests, 69 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-12-02 10:48:33,776 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 455 states. [2018-12-02 10:48:33,786 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 455 to 395. [2018-12-02 10:48:33,786 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 395 states. [2018-12-02 10:48:33,787 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 395 states to 395 states and 566 transitions. [2018-12-02 10:48:33,787 INFO L78 Accepts]: Start accepts. Automaton has 395 states and 566 transitions. Word has length 38 [2018-12-02 10:48:33,787 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 10:48:33,787 INFO L480 AbstractCegarLoop]: Abstraction has 395 states and 566 transitions. [2018-12-02 10:48:33,788 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-12-02 10:48:33,788 INFO L276 IsEmpty]: Start isEmpty. Operand 395 states and 566 transitions. [2018-12-02 10:48:33,788 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2018-12-02 10:48:33,788 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 10:48:33,788 INFO L402 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 10:48:33,789 INFO L423 AbstractCegarLoop]: === Iteration 11 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 10:48:33,789 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 10:48:33,789 INFO L82 PathProgramCache]: Analyzing trace with hash 1319658960, now seen corresponding path program 1 times [2018-12-02 10:48:33,789 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-12-02 10:48:33,789 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_470b1560-4365-47e5-9038-f77a95a54932/bin-2019/uautomizer/cvc4 Starting monitored process 12 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2018-12-02 10:48:33,809 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 10:48:33,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 10:48:33,835 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 10:48:33,848 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 10:48:33,848 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-02 10:48:33,874 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 10:48:33,876 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-02 10:48:33,876 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 8 [2018-12-02 10:48:33,876 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-12-02 10:48:33,876 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-12-02 10:48:33,877 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2018-12-02 10:48:33,877 INFO L87 Difference]: Start difference. First operand 395 states and 566 transitions. Second operand 8 states. [2018-12-02 10:48:34,220 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 10:48:34,220 INFO L93 Difference]: Finished difference Result 1332 states and 1992 transitions. [2018-12-02 10:48:34,221 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-12-02 10:48:34,221 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 40 [2018-12-02 10:48:34,221 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 10:48:34,224 INFO L225 Difference]: With dead ends: 1332 [2018-12-02 10:48:34,224 INFO L226 Difference]: Without dead ends: 1122 [2018-12-02 10:48:34,224 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 83 GetRequests, 73 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-12-02 10:48:34,225 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1122 states. [2018-12-02 10:48:34,257 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1122 to 885. [2018-12-02 10:48:34,257 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 885 states. [2018-12-02 10:48:34,259 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 885 states to 885 states and 1279 transitions. [2018-12-02 10:48:34,259 INFO L78 Accepts]: Start accepts. Automaton has 885 states and 1279 transitions. Word has length 40 [2018-12-02 10:48:34,259 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 10:48:34,259 INFO L480 AbstractCegarLoop]: Abstraction has 885 states and 1279 transitions. [2018-12-02 10:48:34,259 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-12-02 10:48:34,259 INFO L276 IsEmpty]: Start isEmpty. Operand 885 states and 1279 transitions. [2018-12-02 10:48:34,260 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2018-12-02 10:48:34,261 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 10:48:34,261 INFO L402 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 10:48:34,261 INFO L423 AbstractCegarLoop]: === Iteration 12 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 10:48:34,261 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 10:48:34,261 INFO L82 PathProgramCache]: Analyzing trace with hash -677622459, now seen corresponding path program 1 times [2018-12-02 10:48:34,261 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-12-02 10:48:34,261 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_470b1560-4365-47e5-9038-f77a95a54932/bin-2019/uautomizer/cvc4 Starting monitored process 13 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2018-12-02 10:48:34,281 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 10:48:34,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 10:48:34,316 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 10:48:34,327 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 10:48:34,327 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-02 10:48:34,352 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 10:48:34,353 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-02 10:48:34,354 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 6 [2018-12-02 10:48:34,354 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-02 10:48:34,354 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-02 10:48:34,354 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2018-12-02 10:48:34,354 INFO L87 Difference]: Start difference. First operand 885 states and 1279 transitions. Second operand 6 states. [2018-12-02 10:48:34,568 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 10:48:34,568 INFO L93 Difference]: Finished difference Result 1637 states and 2529 transitions. [2018-12-02 10:48:34,569 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-12-02 10:48:34,569 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 42 [2018-12-02 10:48:34,569 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 10:48:34,573 INFO L225 Difference]: With dead ends: 1637 [2018-12-02 10:48:34,573 INFO L226 Difference]: Without dead ends: 1359 [2018-12-02 10:48:34,574 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 84 GetRequests, 79 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-12-02 10:48:34,575 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1359 states. [2018-12-02 10:48:34,622 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1359 to 1180. [2018-12-02 10:48:34,622 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1180 states. [2018-12-02 10:48:34,625 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1180 states to 1180 states and 1770 transitions. [2018-12-02 10:48:34,625 INFO L78 Accepts]: Start accepts. Automaton has 1180 states and 1770 transitions. Word has length 42 [2018-12-02 10:48:34,625 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 10:48:34,625 INFO L480 AbstractCegarLoop]: Abstraction has 1180 states and 1770 transitions. [2018-12-02 10:48:34,625 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-02 10:48:34,625 INFO L276 IsEmpty]: Start isEmpty. Operand 1180 states and 1770 transitions. [2018-12-02 10:48:34,626 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2018-12-02 10:48:34,626 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 10:48:34,627 INFO L402 BasicCegarLoop]: trace histogram [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, 1] [2018-12-02 10:48:34,627 INFO L423 AbstractCegarLoop]: === Iteration 13 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 10:48:34,627 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 10:48:34,627 INFO L82 PathProgramCache]: Analyzing trace with hash -313662180, now seen corresponding path program 1 times [2018-12-02 10:48:34,627 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-12-02 10:48:34,627 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_470b1560-4365-47e5-9038-f77a95a54932/bin-2019/uautomizer/cvc4 Starting monitored process 14 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 14 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2018-12-02 10:48:34,640 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 10:48:34,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 10:48:34,682 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 10:48:35,653 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 19 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-12-02 10:48:35,653 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-02 10:48:36,037 WARN L180 SmtUtils]: Spent 120.00 ms on a formula simplification that was a NOOP. DAG size: 101 [2018-12-02 10:48:36,280 WARN L180 SmtUtils]: Spent 108.00 ms on a formula simplification that was a NOOP. DAG size: 98 [2018-12-02 10:48:38,407 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-12-02 10:48:38,408 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-02 10:48:38,409 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 23] total 44 [2018-12-02 10:48:38,409 INFO L459 AbstractCegarLoop]: Interpolant automaton has 44 states [2018-12-02 10:48:38,409 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 44 interpolants. [2018-12-02 10:48:38,409 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=179, Invalid=1713, Unknown=0, NotChecked=0, Total=1892 [2018-12-02 10:48:38,410 INFO L87 Difference]: Start difference. First operand 1180 states and 1770 transitions. Second operand 44 states. [2018-12-02 10:48:58,737 WARN L180 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 82 DAG size of output: 69 [2018-12-02 10:48:59,271 WARN L180 SmtUtils]: Spent 133.00 ms on a formula simplification. DAG size of input: 92 DAG size of output: 79 [2018-12-02 10:49:01,264 WARN L180 SmtUtils]: Spent 118.00 ms on a formula simplification. DAG size of input: 88 DAG size of output: 75 [2018-12-02 10:49:02,063 WARN L180 SmtUtils]: Spent 122.00 ms on a formula simplification. DAG size of input: 94 DAG size of output: 81 [2018-12-02 10:49:02,682 WARN L180 SmtUtils]: Spent 119.00 ms on a formula simplification. DAG size of input: 90 DAG size of output: 77 [2018-12-02 10:49:06,324 WARN L180 SmtUtils]: Spent 120.00 ms on a formula simplification. DAG size of input: 96 DAG size of output: 83 [2018-12-02 10:49:06,975 WARN L180 SmtUtils]: Spent 115.00 ms on a formula simplification. DAG size of input: 92 DAG size of output: 79 [2018-12-02 10:49:07,301 WARN L180 SmtUtils]: Spent 133.00 ms on a formula simplification. DAG size of input: 98 DAG size of output: 85 [2018-12-02 10:49:07,934 WARN L180 SmtUtils]: Spent 134.00 ms on a formula simplification. DAG size of input: 93 DAG size of output: 80 [2018-12-02 10:49:08,288 WARN L180 SmtUtils]: Spent 175.00 ms on a formula simplification. DAG size of input: 107 DAG size of output: 94 [2018-12-02 10:49:09,169 WARN L180 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 99 DAG size of output: 86 [2018-12-02 10:49:09,605 WARN L180 SmtUtils]: Spent 115.00 ms on a formula simplification. DAG size of input: 94 DAG size of output: 81 [2018-12-02 10:49:10,106 WARN L180 SmtUtils]: Spent 129.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 76 [2018-12-02 10:49:10,402 WARN L180 SmtUtils]: Spent 133.00 ms on a formula simplification. DAG size of input: 103 DAG size of output: 90 [2018-12-02 10:49:10,824 WARN L180 SmtUtils]: Spent 124.00 ms on a formula simplification. DAG size of input: 95 DAG size of output: 82 [2018-12-02 10:49:11,688 WARN L180 SmtUtils]: Spent 146.00 ms on a formula simplification. DAG size of input: 109 DAG size of output: 96 [2018-12-02 10:49:12,614 WARN L180 SmtUtils]: Spent 129.00 ms on a formula simplification. DAG size of input: 91 DAG size of output: 78 [2018-12-02 10:49:12,962 WARN L180 SmtUtils]: Spent 142.00 ms on a formula simplification. DAG size of input: 105 DAG size of output: 92 [2018-12-02 10:49:14,217 WARN L180 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 74 [2018-12-02 10:49:14,598 WARN L180 SmtUtils]: Spent 124.00 ms on a formula simplification. DAG size of input: 97 DAG size of output: 84 [2018-12-02 10:49:15,575 WARN L180 SmtUtils]: Spent 116.00 ms on a formula simplification. DAG size of input: 94 DAG size of output: 81 [2018-12-02 10:49:17,495 WARN L180 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 90 DAG size of output: 77 [2018-12-02 10:49:17,944 WARN L180 SmtUtils]: Spent 127.00 ms on a formula simplification. DAG size of input: 96 DAG size of output: 83 [2018-12-02 10:49:19,941 WARN L180 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 105 DAG size of output: 89 [2018-12-02 10:49:20,366 WARN L180 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 92 DAG size of output: 79 [2018-12-02 10:49:20,928 WARN L180 SmtUtils]: Spent 199.00 ms on a formula simplification. DAG size of input: 120 DAG size of output: 108 [2018-12-02 10:49:22,310 WARN L180 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 93 DAG size of output: 77 [2018-12-02 10:49:22,629 WARN L180 SmtUtils]: Spent 128.00 ms on a formula simplification. DAG size of input: 114 DAG size of output: 101 [2018-12-02 10:49:23,735 WARN L180 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 103 DAG size of output: 87 [2018-12-02 10:49:25,438 WARN L180 SmtUtils]: Spent 152.00 ms on a formula simplification. DAG size of input: 103 DAG size of output: 90 [2018-12-02 10:49:25,827 WARN L180 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 91 DAG size of output: 75 [2018-12-02 10:49:26,172 WARN L180 SmtUtils]: Spent 130.00 ms on a formula simplification. DAG size of input: 112 DAG size of output: 99 [2018-12-02 10:49:26,778 WARN L180 SmtUtils]: Spent 161.00 ms on a formula simplification. DAG size of input: 113 DAG size of output: 109 [2018-12-02 10:49:28,527 WARN L180 SmtUtils]: Spent 119.00 ms on a formula simplification. DAG size of input: 110 DAG size of output: 92 [2018-12-02 10:49:30,048 WARN L180 SmtUtils]: Spent 115.00 ms on a formula simplification. DAG size of input: 98 DAG size of output: 80 [2018-12-02 10:49:30,430 WARN L180 SmtUtils]: Spent 132.00 ms on a formula simplification. DAG size of input: 101 DAG size of output: 88 [2018-12-02 10:49:30,812 WARN L180 SmtUtils]: Spent 147.00 ms on a formula simplification. DAG size of input: 120 DAG size of output: 104 [2018-12-02 10:49:32,392 WARN L180 SmtUtils]: Spent 213.00 ms on a formula simplification. DAG size of input: 127 DAG size of output: 117 [2018-12-02 10:49:33,021 WARN L180 SmtUtils]: Spent 132.00 ms on a formula simplification. DAG size of input: 112 DAG size of output: 94 [2018-12-02 10:49:33,391 WARN L180 SmtUtils]: Spent 116.00 ms on a formula simplification. DAG size of input: 108 DAG size of output: 90 [2018-12-02 10:49:34,332 WARN L180 SmtUtils]: Spent 140.00 ms on a formula simplification. DAG size of input: 109 DAG size of output: 93 [2018-12-02 10:49:34,922 WARN L180 SmtUtils]: Spent 116.00 ms on a formula simplification. DAG size of input: 96 DAG size of output: 78 [2018-12-02 10:49:35,672 WARN L180 SmtUtils]: Spent 149.00 ms on a formula simplification. DAG size of input: 118 DAG size of output: 102 [2018-12-02 10:49:36,101 WARN L180 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 92 DAG size of output: 83 [2018-12-02 10:49:36,573 WARN L180 SmtUtils]: Spent 144.00 ms on a formula simplification. DAG size of input: 110 DAG size of output: 92 [2018-12-02 10:49:37,242 WARN L180 SmtUtils]: Spent 152.00 ms on a formula simplification. DAG size of input: 107 DAG size of output: 91 [2018-12-02 10:49:38,004 WARN L180 SmtUtils]: Spent 186.00 ms on a formula simplification. DAG size of input: 120 DAG size of output: 116 [2018-12-02 10:49:39,704 WARN L180 SmtUtils]: Spent 156.00 ms on a formula simplification. DAG size of input: 125 DAG size of output: 107 [2018-12-02 10:49:40,228 WARN L180 SmtUtils]: Spent 131.00 ms on a formula simplification. DAG size of input: 114 DAG size of output: 96 [2018-12-02 10:49:41,333 WARN L180 SmtUtils]: Spent 227.00 ms on a formula simplification. DAG size of input: 133 DAG size of output: 120 [2018-12-02 10:49:41,953 WARN L180 SmtUtils]: Spent 208.00 ms on a formula simplification. DAG size of input: 127 DAG size of output: 109 [2018-12-02 10:49:42,291 WARN L180 SmtUtils]: Spent 147.00 ms on a formula simplification. DAG size of input: 123 DAG size of output: 105 [2018-12-02 10:49:43,227 WARN L180 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 112 DAG size of output: 94 [2018-12-02 10:49:43,538 WARN L180 SmtUtils]: Spent 116.00 ms on a formula simplification. DAG size of input: 95 DAG size of output: 82 [2018-12-02 10:49:43,971 WARN L180 SmtUtils]: Spent 147.00 ms on a formula simplification. DAG size of input: 101 DAG size of output: 88 [2018-12-02 10:49:45,090 WARN L180 SmtUtils]: Spent 177.00 ms on a formula simplification. DAG size of input: 125 DAG size of output: 107 [2018-12-02 10:49:45,997 WARN L180 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 70 [2018-12-02 10:49:46,481 WARN L180 SmtUtils]: Spent 124.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 76 [2018-12-02 10:49:47,257 WARN L180 SmtUtils]: Spent 169.00 ms on a formula simplification. DAG size of input: 126 DAG size of output: 119 [2018-12-02 10:49:49,693 WARN L180 SmtUtils]: Spent 129.00 ms on a formula simplification. DAG size of input: 101 DAG size of output: 85 [2018-12-02 10:49:50,166 WARN L180 SmtUtils]: Spent 129.00 ms on a formula simplification. DAG size of input: 107 DAG size of output: 91 [2018-12-02 10:49:51,322 WARN L180 SmtUtils]: Spent 261.00 ms on a formula simplification. DAG size of input: 138 DAG size of output: 123 [2018-12-02 10:49:52,189 WARN L180 SmtUtils]: Spent 141.00 ms on a formula simplification. DAG size of input: 110 DAG size of output: 97 [2018-12-02 10:49:52,595 WARN L180 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 95 DAG size of output: 79 [2018-12-02 10:49:53,064 WARN L180 SmtUtils]: Spent 151.00 ms on a formula simplification. DAG size of input: 116 DAG size of output: 103 [2018-12-02 10:49:54,629 WARN L180 SmtUtils]: Spent 136.00 ms on a formula simplification. DAG size of input: 99 DAG size of output: 86 [2018-12-02 10:49:55,122 WARN L180 SmtUtils]: Spent 140.00 ms on a formula simplification. DAG size of input: 105 DAG size of output: 92 [2018-12-02 10:49:55,932 WARN L180 SmtUtils]: Spent 196.00 ms on a formula simplification. DAG size of input: 131 DAG size of output: 122 [2018-12-02 10:49:56,637 WARN L180 SmtUtils]: Spent 119.00 ms on a formula simplification. DAG size of input: 106 DAG size of output: 88 [2018-12-02 10:49:57,076 WARN L180 SmtUtils]: Spent 142.00 ms on a formula simplification. DAG size of input: 112 DAG size of output: 94 [2018-12-02 10:49:57,942 WARN L180 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 100 DAG size of output: 82 [2018-12-02 10:49:58,320 WARN L180 SmtUtils]: Spent 144.00 ms on a formula simplification. DAG size of input: 116 DAG size of output: 100 [2018-12-02 10:49:58,772 WARN L180 SmtUtils]: Spent 154.00 ms on a formula simplification. DAG size of input: 122 DAG size of output: 106 [2018-12-02 10:49:59,562 WARN L180 SmtUtils]: Spent 146.00 ms on a formula simplification. DAG size of input: 108 DAG size of output: 90 [2018-12-02 10:49:59,883 WARN L180 SmtUtils]: Spent 140.00 ms on a formula simplification. DAG size of input: 114 DAG size of output: 96 [2018-12-02 10:50:00,374 WARN L180 SmtUtils]: Spent 121.00 ms on a formula simplification. DAG size of input: 105 DAG size of output: 89 [2018-12-02 10:50:00,932 WARN L180 SmtUtils]: Spent 138.00 ms on a formula simplification. DAG size of input: 111 DAG size of output: 95 [2018-12-02 10:50:01,459 WARN L180 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 109 DAG size of output: 100 [2018-12-02 10:50:02,878 WARN L180 SmtUtils]: Spent 174.00 ms on a formula simplification. DAG size of input: 121 DAG size of output: 103 [2018-12-02 10:50:03,341 WARN L180 SmtUtils]: Spent 157.00 ms on a formula simplification. DAG size of input: 127 DAG size of output: 109 [2018-12-02 10:50:03,770 WARN L180 SmtUtils]: Spent 129.00 ms on a formula simplification. DAG size of input: 110 DAG size of output: 92 [2018-12-02 10:50:04,335 WARN L180 SmtUtils]: Spent 161.00 ms on a formula simplification. DAG size of input: 116 DAG size of output: 98 [2018-12-02 10:50:05,046 WARN L180 SmtUtils]: Spent 189.00 ms on a formula simplification. DAG size of input: 114 DAG size of output: 108 [2018-12-02 10:50:05,440 WARN L180 SmtUtils]: Spent 176.00 ms on a formula simplification. DAG size of input: 123 DAG size of output: 105 [2018-12-02 10:50:05,894 WARN L180 SmtUtils]: Spent 206.00 ms on a formula simplification. DAG size of input: 129 DAG size of output: 111 [2018-12-02 10:50:05,968 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 10:50:05,968 INFO L93 Difference]: Finished difference Result 10401 states and 15820 transitions. [2018-12-02 10:50:05,969 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 264 states. [2018-12-02 10:50:05,969 INFO L78 Accepts]: Start accepts. Automaton has 44 states. Word has length 60 [2018-12-02 10:50:05,969 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 10:50:05,995 INFO L225 Difference]: With dead ends: 10401 [2018-12-02 10:50:05,996 INFO L226 Difference]: Without dead ends: 10205 [2018-12-02 10:50:06,005 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 375 GetRequests, 76 SyntacticMatches, 1 SemanticMatches, 298 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32087 ImplicationChecksByTransitivity, 71.2s TimeCoverageRelationStatistics Valid=18847, Invalid=70853, Unknown=0, NotChecked=0, Total=89700 [2018-12-02 10:50:06,010 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10205 states. [2018-12-02 10:50:06,191 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10205 to 4459. [2018-12-02 10:50:06,191 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4459 states. [2018-12-02 10:50:06,197 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4459 states to 4459 states and 6911 transitions. [2018-12-02 10:50:06,198 INFO L78 Accepts]: Start accepts. Automaton has 4459 states and 6911 transitions. Word has length 60 [2018-12-02 10:50:06,198 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 10:50:06,198 INFO L480 AbstractCegarLoop]: Abstraction has 4459 states and 6911 transitions. [2018-12-02 10:50:06,198 INFO L481 AbstractCegarLoop]: Interpolant automaton has 44 states. [2018-12-02 10:50:06,198 INFO L276 IsEmpty]: Start isEmpty. Operand 4459 states and 6911 transitions. [2018-12-02 10:50:06,199 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2018-12-02 10:50:06,199 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 10:50:06,200 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 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-12-02 10:50:06,200 INFO L423 AbstractCegarLoop]: === Iteration 14 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 10:50:06,200 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 10:50:06,200 INFO L82 PathProgramCache]: Analyzing trace with hash 1987160410, now seen corresponding path program 1 times [2018-12-02 10:50:06,200 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-12-02 10:50:06,200 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_470b1560-4365-47e5-9038-f77a95a54932/bin-2019/uautomizer/cvc4 Starting monitored process 15 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 15 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2018-12-02 10:50:06,213 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 10:50:06,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 10:50:06,238 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 10:50:06,278 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 14 proven. 5 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-12-02 10:50:06,278 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-02 10:50:06,300 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 14 proven. 5 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-12-02 10:50:06,302 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-02 10:50:06,302 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 5] total 8 [2018-12-02 10:50:06,303 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-12-02 10:50:06,303 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-12-02 10:50:06,303 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2018-12-02 10:50:06,303 INFO L87 Difference]: Start difference. First operand 4459 states and 6911 transitions. Second operand 8 states. [2018-12-02 10:50:07,005 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 10:50:07,005 INFO L93 Difference]: Finished difference Result 10009 states and 15546 transitions. [2018-12-02 10:50:07,006 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-12-02 10:50:07,006 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 60 [2018-12-02 10:50:07,006 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 10:50:07,014 INFO L225 Difference]: With dead ends: 10009 [2018-12-02 10:50:07,014 INFO L226 Difference]: Without dead ends: 5616 [2018-12-02 10:50:07,019 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 128 GetRequests, 110 SyntacticMatches, 3 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 36 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=49, Invalid=223, Unknown=0, NotChecked=0, Total=272 [2018-12-02 10:50:07,023 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5616 states. [2018-12-02 10:50:07,193 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5616 to 4815. [2018-12-02 10:50:07,193 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4815 states. [2018-12-02 10:50:07,198 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4815 states to 4815 states and 7218 transitions. [2018-12-02 10:50:07,198 INFO L78 Accepts]: Start accepts. Automaton has 4815 states and 7218 transitions. Word has length 60 [2018-12-02 10:50:07,198 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 10:50:07,198 INFO L480 AbstractCegarLoop]: Abstraction has 4815 states and 7218 transitions. [2018-12-02 10:50:07,198 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-12-02 10:50:07,198 INFO L276 IsEmpty]: Start isEmpty. Operand 4815 states and 7218 transitions. [2018-12-02 10:50:07,199 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2018-12-02 10:50:07,199 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 10:50:07,199 INFO L402 BasicCegarLoop]: trace histogram [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, 1] [2018-12-02 10:50:07,199 INFO L423 AbstractCegarLoop]: === Iteration 15 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 10:50:07,200 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 10:50:07,200 INFO L82 PathProgramCache]: Analyzing trace with hash 1930321118, now seen corresponding path program 1 times [2018-12-02 10:50:07,200 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-12-02 10:50:07,200 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_470b1560-4365-47e5-9038-f77a95a54932/bin-2019/uautomizer/cvc4 Starting monitored process 16 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 16 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2018-12-02 10:50:07,213 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 10:50:07,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 10:50:07,232 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 10:50:07,236 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2018-12-02 10:50:07,237 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-12-02 10:50:07,238 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 10:50:07,238 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-02 10:50:07,238 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-02 10:50:07,239 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-02 10:50:07,239 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-02 10:50:07,239 INFO L87 Difference]: Start difference. First operand 4815 states and 7218 transitions. Second operand 3 states. [2018-12-02 10:50:07,395 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 10:50:07,395 INFO L93 Difference]: Finished difference Result 5669 states and 8305 transitions. [2018-12-02 10:50:07,396 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-02 10:50:07,396 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 60 [2018-12-02 10:50:07,396 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 10:50:07,403 INFO L225 Difference]: With dead ends: 5669 [2018-12-02 10:50:07,403 INFO L226 Difference]: Without dead ends: 5610 [2018-12-02 10:50:07,405 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 58 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-12-02 10:50:07,408 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5610 states. [2018-12-02 10:50:07,567 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5610 to 5123. [2018-12-02 10:50:07,567 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5123 states. [2018-12-02 10:50:07,571 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5123 states to 5123 states and 7636 transitions. [2018-12-02 10:50:07,571 INFO L78 Accepts]: Start accepts. Automaton has 5123 states and 7636 transitions. Word has length 60 [2018-12-02 10:50:07,571 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 10:50:07,571 INFO L480 AbstractCegarLoop]: Abstraction has 5123 states and 7636 transitions. [2018-12-02 10:50:07,572 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-02 10:50:07,572 INFO L276 IsEmpty]: Start isEmpty. Operand 5123 states and 7636 transitions. [2018-12-02 10:50:07,573 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2018-12-02 10:50:07,573 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 10:50:07,573 INFO L402 BasicCegarLoop]: trace histogram [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, 1] [2018-12-02 10:50:07,573 INFO L423 AbstractCegarLoop]: === Iteration 16 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 10:50:07,574 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 10:50:07,574 INFO L82 PathProgramCache]: Analyzing trace with hash -666750562, now seen corresponding path program 1 times [2018-12-02 10:50:07,574 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-12-02 10:50:07,574 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_470b1560-4365-47e5-9038-f77a95a54932/bin-2019/uautomizer/cvc4 Starting monitored process 17 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 17 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2018-12-02 10:50:07,589 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 10:50:07,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 10:50:07,620 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 10:50:07,661 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2018-12-02 10:50:07,661 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-02 10:50:07,706 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2018-12-02 10:50:07,708 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-02 10:50:07,708 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 12 [2018-12-02 10:50:07,708 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-12-02 10:50:07,708 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-12-02 10:50:07,708 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=98, Unknown=0, NotChecked=0, Total=132 [2018-12-02 10:50:07,708 INFO L87 Difference]: Start difference. First operand 5123 states and 7636 transitions. Second operand 12 states. [2018-12-02 10:50:08,380 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 10:50:08,380 INFO L93 Difference]: Finished difference Result 8814 states and 13182 transitions. [2018-12-02 10:50:08,380 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-12-02 10:50:08,380 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 60 [2018-12-02 10:50:08,380 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 10:50:08,391 INFO L225 Difference]: With dead ends: 8814 [2018-12-02 10:50:08,391 INFO L226 Difference]: Without dead ends: 6065 [2018-12-02 10:50:08,396 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 125 GetRequests, 109 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-12-02 10:50:08,400 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6065 states. [2018-12-02 10:50:08,573 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6065 to 5218. [2018-12-02 10:50:08,573 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5218 states. [2018-12-02 10:50:08,577 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5218 states to 5218 states and 7607 transitions. [2018-12-02 10:50:08,577 INFO L78 Accepts]: Start accepts. Automaton has 5218 states and 7607 transitions. Word has length 60 [2018-12-02 10:50:08,577 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 10:50:08,577 INFO L480 AbstractCegarLoop]: Abstraction has 5218 states and 7607 transitions. [2018-12-02 10:50:08,577 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-12-02 10:50:08,578 INFO L276 IsEmpty]: Start isEmpty. Operand 5218 states and 7607 transitions. [2018-12-02 10:50:08,579 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2018-12-02 10:50:08,579 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 10:50:08,579 INFO L402 BasicCegarLoop]: trace histogram [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-12-02 10:50:08,579 INFO L423 AbstractCegarLoop]: === Iteration 17 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 10:50:08,579 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 10:50:08,579 INFO L82 PathProgramCache]: Analyzing trace with hash -1543067804, now seen corresponding path program 1 times [2018-12-02 10:50:08,580 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-12-02 10:50:08,580 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_470b1560-4365-47e5-9038-f77a95a54932/bin-2019/uautomizer/cvc4 Starting monitored process 18 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 18 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2018-12-02 10:50:08,592 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 10:50:08,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 10:50:08,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 10:50:08,686 INFO L469 BasicCegarLoop]: Counterexample might be feasible [2018-12-02 10:50:08,734 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 02.12 10:50:08 BoogieIcfgContainer [2018-12-02 10:50:08,734 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-12-02 10:50:08,734 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-12-02 10:50:08,734 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-12-02 10:50:08,734 INFO L276 PluginConnector]: Witness Printer initialized [2018-12-02 10:50:08,735 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.12 10:48:31" (3/4) ... [2018-12-02 10:50:08,736 INFO L138 WitnessPrinter]: Generating witness for reachability counterexample [2018-12-02 10:50:08,793 INFO L145 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/working_dir_470b1560-4365-47e5-9038-f77a95a54932/bin-2019/uautomizer/witness.graphml [2018-12-02 10:50:08,794 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-12-02 10:50:08,794 INFO L168 Benchmark]: Toolchain (without parser) took 97668.48 ms. Allocated memory was 1.0 GB in the beginning and 1.3 GB in the end (delta: 304.1 MB). Free memory was 944.7 MB in the beginning and 794.2 MB in the end (delta: 150.5 MB). Peak memory consumption was 454.6 MB. Max. memory is 11.5 GB. [2018-12-02 10:50:08,794 INFO L168 Benchmark]: CDTParser took 0.12 ms. Allocated memory is still 1.0 GB. Free memory is still 972.9 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-02 10:50:08,795 INFO L168 Benchmark]: CACSL2BoogieTranslator took 178.18 ms. Allocated memory is still 1.0 GB. Free memory was 944.7 MB in the beginning and 928.6 MB in the end (delta: 16.1 MB). Peak memory consumption was 16.1 MB. Max. memory is 11.5 GB. [2018-12-02 10:50:08,795 INFO L168 Benchmark]: Boogie Procedure Inliner took 14.91 ms. Allocated memory is still 1.0 GB. Free memory is still 928.6 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-02 10:50:08,795 INFO L168 Benchmark]: Boogie Preprocessor took 18.61 ms. Allocated memory is still 1.0 GB. Free memory is still 928.6 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-02 10:50:08,795 INFO L168 Benchmark]: RCFGBuilder took 244.63 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 147.3 MB). Free memory was 928.6 MB in the beginning and 1.1 GB in the end (delta: -189.3 MB). Peak memory consumption was 14.1 MB. Max. memory is 11.5 GB. [2018-12-02 10:50:08,795 INFO L168 Benchmark]: TraceAbstraction took 97149.43 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 156.8 MB). Free memory was 1.1 GB in the beginning and 804.1 MB in the end (delta: 313.8 MB). Peak memory consumption was 470.6 MB. Max. memory is 11.5 GB. [2018-12-02 10:50:08,795 INFO L168 Benchmark]: Witness Printer took 59.61 ms. Allocated memory is still 1.3 GB. Free memory was 804.1 MB in the beginning and 794.2 MB in the end (delta: 9.9 MB). Peak memory consumption was 9.9 MB. Max. memory is 11.5 GB. [2018-12-02 10:50:08,796 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.12 ms. Allocated memory is still 1.0 GB. Free memory is still 972.9 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 178.18 ms. Allocated memory is still 1.0 GB. Free memory was 944.7 MB in the beginning and 928.6 MB in the end (delta: 16.1 MB). Peak memory consumption was 16.1 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 14.91 ms. Allocated memory is still 1.0 GB. Free memory is still 928.6 MB. There was no memory consumed. Max. memory is 11.5 GB. * Boogie Preprocessor took 18.61 ms. Allocated memory is still 1.0 GB. Free memory is still 928.6 MB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 244.63 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 147.3 MB). Free memory was 928.6 MB in the beginning and 1.1 GB in the end (delta: -189.3 MB). Peak memory consumption was 14.1 MB. Max. memory is 11.5 GB. * TraceAbstraction took 97149.43 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 156.8 MB). Free memory was 1.1 GB in the beginning and 804.1 MB in the end (delta: 313.8 MB). Peak memory consumption was 470.6 MB. Max. memory is 11.5 GB. * Witness Printer took 59.61 ms. Allocated memory is still 1.3 GB. Free memory was 804.1 MB in the beginning and 794.2 MB in the end (delta: 9.9 MB). Peak memory consumption was 9.9 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)=35, \old(b)=220] [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)=35, \old(b)=220, a=35, a0=35, a1=0, a2=0, a3=0, b=220, b0=-36, b1=0, b2=0, b3=0, na=4] [L40] COND TRUE a3 == (unsigned char)0 [L41] na = na - 1 VAL [\old(a)=35, \old(b)=220, a=35, a0=35, a1=0, a2=0, a3=0, b=220, b0=-36, b1=0, b2=0, b3=0, na=3] [L42] COND TRUE a2 == (unsigned char)0 [L43] na = na - 1 VAL [\old(a)=35, \old(b)=220, a=35, a0=35, a1=0, a2=0, a3=0, b=220, b0=-36, b1=0, b2=0, b3=0, na=2] [L44] COND TRUE a1 == (unsigned char)0 [L45] na = na - 1 VAL [\old(a)=35, \old(b)=220, a=35, a0=35, a1=0, a2=0, a3=0, b=220, b0=-36, b1=0, b2=0, b3=0, na=1] [L49] nb = (unsigned char)4 VAL [\old(a)=35, \old(b)=220, a=35, a0=35, a1=0, a2=0, a3=0, b=220, b0=-36, b1=0, b2=0, b3=0, na=1, nb=4] [L50] COND TRUE b3 == (unsigned char)0 [L51] nb = nb - 1 VAL [\old(a)=35, \old(b)=220, a=35, a0=35, a1=0, a2=0, a3=0, b=220, b0=-36, b1=0, b2=0, b3=0, na=1, nb=3] [L52] COND TRUE b2 == (unsigned char)0 [L53] nb = nb - 1 VAL [\old(a)=35, \old(b)=220, a=35, a0=35, a1=0, a2=0, a3=0, b=220, b0=-36, b1=0, b2=0, b3=0, na=1, nb=2] [L54] COND TRUE b1 == (unsigned char)0 [L55] nb = nb - 1 VAL [\old(a)=35, \old(b)=220, a=35, a0=35, a1=0, a2=0, a3=0, b=220, b0=-36, b1=0, b2=0, b3=0, na=1, nb=1] [L59] carry = (unsigned short)0 [L60] i = (unsigned char)0 VAL [\old(a)=35, \old(b)=220, a=35, a0=35, a1=0, a2=0, a3=0, b=220, b0=-36, 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)=35, \old(b)=220, a=35, a0=35, a1=0, a2=0, a3=0, b=220, b0=-36, 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)=35, \old(b)=220, a=35, a0=35, a1=0, a2=0, a3=0, b=220, b0=-36, 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)=35, \old(b)=220, a=35, a0=35, a1=0, a2=0, a3=0, b=220, b0=-36, b1=0, b2=0, b3=0, carry=0, i=0, na=1, nb=1, partial_sum=35] [L66] COND FALSE !(i == (unsigned char)1) VAL [\old(a)=35, \old(b)=220, a=35, a0=35, a1=0, a2=0, a3=0, b=220, b0=-36, b1=0, b2=0, b3=0, carry=0, i=0, na=1, nb=1, partial_sum=35] [L67] COND FALSE !(i == (unsigned char)2) VAL [\old(a)=35, \old(b)=220, a=35, a0=35, a1=0, a2=0, a3=0, b=220, b0=-36, b1=0, b2=0, b3=0, carry=0, i=0, na=1, nb=1, partial_sum=35] [L68] COND FALSE !(i == (unsigned char)3) VAL [\old(a)=35, \old(b)=220, a=35, a0=35, a1=0, a2=0, a3=0, b=220, b0=-36, b1=0, b2=0, b3=0, carry=0, i=0, na=1, nb=1, partial_sum=35] [L70] COND TRUE i < nb VAL [\old(a)=35, \old(b)=220, a=35, a0=35, a1=0, a2=0, a3=0, b=220, b0=-36, b1=0, b2=0, b3=0, carry=0, i=0, na=1, nb=1, partial_sum=35] [L71] COND TRUE i == (unsigned char)0 [L71] partial_sum = partial_sum + b0 VAL [\old(a)=35, \old(b)=220, a=35, a0=35, a1=0, a2=0, a3=0, b=220, b0=-36, 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)=35, \old(b)=220, a=35, a0=35, a1=0, a2=0, a3=0, b=220, b0=-36, 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)=35, \old(b)=220, a=35, a0=35, a1=0, a2=0, a3=0, b=220, b0=-36, 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)=35, \old(b)=220, a=35, a0=35, a1=0, a2=0, a3=0, b=220, b0=-36, 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)=35, \old(b)=220, a=35, a0=35, a1=0, a2=0, a3=0, b=220, b0=-36, 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)=35, \old(b)=220, a=35, a0=35, a1=0, a2=0, a3=0, b=220, b0=-36, 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)=35, \old(b)=220, a=35, a0=35, a1=0, a2=0, a3=0, b=220, b0=-36, 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)=35, \old(b)=220, a=35, a0=35, a1=0, a2=0, a3=0, b=220, b0=-36, 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)=35, \old(b)=220, a=35, a0=35, a1=0, a2=0, a3=0, b=220, b0=-36, 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)=35, \old(b)=220, a=35, a0=35, a1=0, a2=0, a3=0, b=220, b0=-36, 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)=35, \old(b)=220, a=35, a0=35, a1=0, a2=0, a3=0, b=220, b0=-36, 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)=35, \old(b)=220, a=35, a0=35, a1=0, a2=0, a3=0, b=220, b0=-36, 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)=35, \old(b)=220, a=35, a0=35, a1=0, a2=0, a3=0, b=220, b0=-36, 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)=35, \old(b)=220, a=35, a0=35, a1=0, a2=0, a3=0, b=220, b0=-36, 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)=35, \old(b)=220, a=35, a0=35, a1=0, a2=0, a3=0, b=220, b0=-36, 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)=35, \old(b)=220, a=35, a0=35, a1=0, a2=0, a3=0, b=220, b0=-36, 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)=35, \old(b)=220, a=35, a0=35, a1=0, a2=0, a3=0, b=220, b0=-36, 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)=35, \old(b)=220, a=35, a0=35, a1=0, a2=0, a3=0, b=220, b0=-36, 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)=35, \old(b)=220, a=35, a0=35, a1=0, a2=0, a3=0, b=220, b0=-36, 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)=35, \old(b)=220, a=35, a0=35, a1=0, a2=0, a3=0, b=220, b0=-36, 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)=35, \old(b)=220, a=35, a0=35, a1=0, a2=0, a3=0, b=220, b0=-36, 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)=35, \old(b)=220, a=35, a0=35, a1=0, a2=0, a3=0, b=220, b0=-36, 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)=35, \old(b)=220, a=35, a0=35, a1=0, a2=0, a3=0, b=220, b0=-36, 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)=35, \old(b)=220, a=35, a0=35, a1=0, a2=0, a3=0, b=220, b0=-36, 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)=35, \old(b)=220, a=35, a0=35, a1=0, a2=0, a3=0, b=220, b0=-36, 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)=35, \old(b)=220, a=35, a0=35, a1=0, a2=0, a3=0, b=220, b0=-36, 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)=35, \old(b)=220, a=35, a0=35, a1=0, a2=0, a3=0, b=220, b0=-36, 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)=35, \old(b)=220, a=35, a0=35, a1=0, a2=0, a3=0, b=220, b0=-36, 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)=35, \old(b)=220, a=35, a0=35, a1=0, a2=0, a3=0, b=220, b0=-36, 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)=35, \old(b)=220, a=35, a0=35, a1=0, a2=0, a3=0, b=220, b0=-36, 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)=35, \old(b)=220, a=35, a0=35, a1=0, a2=0, a3=0, b=220, b0=-36, 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)=35, \old(b)=220, a=35, a0=35, a1=0, a2=0, a3=0, b=220, b0=-36, 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)=35, \old(b)=220, a=35, a0=35, a1=0, a2=0, a3=0, b=220, b0=-36, 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] return r; VAL [\old(a)=35, \old(b)=220, \result=511, a=35, a0=35, a1=0, a2=0, a3=0, b=220, b0=-36, 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] RET, EXPR mp_add(a, b) VAL [a=35, b=220, 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, 54 locations, 1 error locations. UNSAFE Result, 97.1s OverallTime, 17 OverallIterations, 3 TraceHistogramMax, 91.1s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 1916 SDtfs, 6254 SDslu, 9707 SDs, 0 SdLazy, 15633 SolverSat, 1216 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 18.2s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 1175 GetRequests, 788 SyntacticMatches, 4 SemanticMatches, 383 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32199 ImplicationChecksByTransitivity, 71.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=5218occurred 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.8s AutomataMinimizationTime, 16 MinimizatonAttempts, 9154 StatesRemovedByMinimization, 15 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 4.2s InterpolantComputationTime, 674 NumberOfCodeBlocks, 674 NumberOfCodeBlocksAsserted, 17 NumberOfCheckSat, 889 ConstructedInterpolants, 0 QuantifiedInterpolants, 363706 SizeOfPredicates, 48 NumberOfNonLiveVariables, 1133 ConjunctsInSsa, 100 ConjunctsInUnsatCore, 22 InterpolantComputations, 10 PerfectInterpolantSequences, 125/164 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! Received shutdown request...