./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/bitvector/s3_clnt_2.BV.c.cil-1a.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version cad46833 Calling Ultimate with: /usr/lib/jvm/java-8-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/run_dir_0b2d4ff1-9604-4d9d-a3bc-02e1265a2173/bin/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/run_dir_0b2d4ff1-9604-4d9d-a3bc-02e1265a2173/bin/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_0b2d4ff1-9604-4d9d-a3bc-02e1265a2173/bin/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_0b2d4ff1-9604-4d9d-a3bc-02e1265a2173/bin/uautomizer/config/AutomizerReach.xml -i ../../sv-benchmarks/c/bitvector/s3_clnt_2.BV.c.cil-1a.c -s /tmp/vcloud-vcloud-master/worker/run_dir_0b2d4ff1-9604-4d9d-a3bc-02e1265a2173/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_0b2d4ff1-9604-4d9d-a3bc-02e1265a2173/bin/uautomizer --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(__VERIFIER_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 1e9943d2199c95030d170f0541cc4df722deb62f ..................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis Calling Ultimate with: /usr/lib/jvm/java-8-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/run_dir_0b2d4ff1-9604-4d9d-a3bc-02e1265a2173/bin/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/run_dir_0b2d4ff1-9604-4d9d-a3bc-02e1265a2173/bin/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_0b2d4ff1-9604-4d9d-a3bc-02e1265a2173/bin/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_0b2d4ff1-9604-4d9d-a3bc-02e1265a2173/bin/uautomizer/config/AutomizerReach.xml -i ../../sv-benchmarks/c/bitvector/s3_clnt_2.BV.c.cil-1a.c -s /tmp/vcloud-vcloud-master/worker/run_dir_0b2d4ff1-9604-4d9d-a3bc-02e1265a2173/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_0b2d4ff1-9604-4d9d-a3bc-02e1265a2173/bin/uautomizer --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(__VERIFIER_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 1e9943d2199c95030d170f0541cc4df722deb62f ............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................. Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.24-cad4683 [2019-11-16 00:22:36,628 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-16 00:22:36,630 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-16 00:22:36,641 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-16 00:22:36,641 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-16 00:22:36,642 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-16 00:22:36,643 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-16 00:22:36,645 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-16 00:22:36,647 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-16 00:22:36,648 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-16 00:22:36,649 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-16 00:22:36,650 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-16 00:22:36,650 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-16 00:22:36,651 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-16 00:22:36,652 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-16 00:22:36,653 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-16 00:22:36,654 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-16 00:22:36,655 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-16 00:22:36,656 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-16 00:22:36,658 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-16 00:22:36,659 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-16 00:22:36,660 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-16 00:22:36,661 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-16 00:22:36,662 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-16 00:22:36,664 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-16 00:22:36,664 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-16 00:22:36,665 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-16 00:22:36,665 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-16 00:22:36,666 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-16 00:22:36,667 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-16 00:22:36,667 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-16 00:22:36,668 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-16 00:22:36,668 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-16 00:22:36,669 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-16 00:22:36,670 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-16 00:22:36,670 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-16 00:22:36,670 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-16 00:22:36,671 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-16 00:22:36,671 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-16 00:22:36,672 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-16 00:22:36,672 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-16 00:22:36,673 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_0b2d4ff1-9604-4d9d-a3bc-02e1265a2173/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf [2019-11-16 00:22:36,685 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-16 00:22:36,685 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-16 00:22:36,688 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-16 00:22:36,688 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-16 00:22:36,688 INFO L138 SettingsManager]: * Use SBE=true [2019-11-16 00:22:36,688 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-16 00:22:36,689 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-16 00:22:36,689 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-16 00:22:36,689 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-16 00:22:36,689 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-16 00:22:36,690 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-11-16 00:22:36,691 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-16 00:22:36,691 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-11-16 00:22:36,691 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-16 00:22:36,691 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-16 00:22:36,691 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-16 00:22:36,692 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-11-16 00:22:36,692 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-16 00:22:36,692 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-16 00:22:36,692 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-16 00:22:36,693 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-16 00:22:36,693 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-16 00:22:36,693 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-16 00:22:36,693 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-16 00:22:36,694 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-11-16 00:22:36,694 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-11-16 00:22:36,694 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-11-16 00:22:36,694 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-11-16 00:22:36,695 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /tmp/vcloud-vcloud-master/worker/run_dir_0b2d4ff1-9604-4d9d-a3bc-02e1265a2173/bin/uautomizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(__VERIFIER_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 1e9943d2199c95030d170f0541cc4df722deb62f [2019-11-16 00:22:36,736 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-16 00:22:36,747 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-16 00:22:36,750 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-16 00:22:36,751 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-16 00:22:36,751 INFO L275 PluginConnector]: CDTParser initialized [2019-11-16 00:22:36,752 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_0b2d4ff1-9604-4d9d-a3bc-02e1265a2173/bin/uautomizer/../../sv-benchmarks/c/bitvector/s3_clnt_2.BV.c.cil-1a.c [2019-11-16 00:22:36,804 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_0b2d4ff1-9604-4d9d-a3bc-02e1265a2173/bin/uautomizer/data/cd731e311/439070978cd041d19ab07368c983d49b/FLAG48a1567be [2019-11-16 00:22:37,221 INFO L306 CDTParser]: Found 1 translation units. [2019-11-16 00:22:37,222 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_0b2d4ff1-9604-4d9d-a3bc-02e1265a2173/sv-benchmarks/c/bitvector/s3_clnt_2.BV.c.cil-1a.c [2019-11-16 00:22:37,237 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_0b2d4ff1-9604-4d9d-a3bc-02e1265a2173/bin/uautomizer/data/cd731e311/439070978cd041d19ab07368c983d49b/FLAG48a1567be [2019-11-16 00:22:37,550 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_0b2d4ff1-9604-4d9d-a3bc-02e1265a2173/bin/uautomizer/data/cd731e311/439070978cd041d19ab07368c983d49b [2019-11-16 00:22:37,552 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-16 00:22:37,554 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-11-16 00:22:37,555 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-16 00:22:37,555 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-16 00:22:37,558 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-16 00:22:37,558 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.11 12:22:37" (1/1) ... [2019-11-16 00:22:37,560 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@53ceb6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:22:37, skipping insertion in model container [2019-11-16 00:22:37,560 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.11 12:22:37" (1/1) ... [2019-11-16 00:22:37,567 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-11-16 00:22:37,600 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-11-16 00:22:37,901 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-16 00:22:37,905 INFO L188 MainTranslator]: Completed pre-run [2019-11-16 00:22:37,959 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-16 00:22:37,980 INFO L192 MainTranslator]: Completed translation [2019-11-16 00:22:37,981 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:22:37 WrapperNode [2019-11-16 00:22:37,982 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-16 00:22:37,983 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-11-16 00:22:37,983 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-11-16 00:22:37,983 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-11-16 00:22:37,991 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:22:37" (1/1) ... [2019-11-16 00:22:38,007 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:22:37" (1/1) ... [2019-11-16 00:22:38,039 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-11-16 00:22:38,039 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-16 00:22:38,040 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-16 00:22:38,040 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-16 00:22:38,050 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:22:37" (1/1) ... [2019-11-16 00:22:38,050 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:22:37" (1/1) ... [2019-11-16 00:22:38,053 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:22:37" (1/1) ... [2019-11-16 00:22:38,053 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:22:37" (1/1) ... [2019-11-16 00:22:38,061 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:22:37" (1/1) ... [2019-11-16 00:22:38,076 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:22:37" (1/1) ... [2019-11-16 00:22:38,079 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:22:37" (1/1) ... [2019-11-16 00:22:38,082 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-16 00:22:38,083 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-16 00:22:38,083 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-16 00:22:38,083 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-16 00:22:38,084 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:22:37" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_0b2d4ff1-9604-4d9d-a3bc-02e1265a2173/bin/uautomizer/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-16 00:22:38,161 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-16 00:22:38,161 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-16 00:22:38,279 WARN L732 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-11-16 00:22:38,831 INFO L685 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##85: assume !false; [2019-11-16 00:22:38,831 INFO L685 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##84: assume false; [2019-11-16 00:22:38,832 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-16 00:22:38,833 INFO L284 CfgBuilder]: Removed 7 assume(true) statements. [2019-11-16 00:22:38,834 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.11 12:22:38 BoogieIcfgContainer [2019-11-16 00:22:38,834 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-16 00:22:38,835 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-16 00:22:38,835 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-16 00:22:38,838 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-16 00:22:38,838 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 16.11 12:22:37" (1/3) ... [2019-11-16 00:22:38,839 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@53136227 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.11 12:22:38, skipping insertion in model container [2019-11-16 00:22:38,840 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:22:37" (2/3) ... [2019-11-16 00:22:38,840 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@53136227 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.11 12:22:38, skipping insertion in model container [2019-11-16 00:22:38,840 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.11 12:22:38" (3/3) ... [2019-11-16 00:22:38,842 INFO L109 eAbstractionObserver]: Analyzing ICFG s3_clnt_2.BV.c.cil-1a.c [2019-11-16 00:22:38,851 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-16 00:22:38,862 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-11-16 00:22:38,873 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-11-16 00:22:38,914 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-16 00:22:38,914 INFO L374 AbstractCegarLoop]: Hoare is true [2019-11-16 00:22:38,914 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-16 00:22:38,914 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-16 00:22:38,915 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-16 00:22:38,915 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-16 00:22:38,915 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-16 00:22:38,916 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-16 00:22:38,939 INFO L276 IsEmpty]: Start isEmpty. Operand 124 states. [2019-11-16 00:22:38,948 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2019-11-16 00:22:38,948 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:22:38,949 INFO L380 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] [2019-11-16 00:22:38,951 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:22:38,957 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:22:38,957 INFO L82 PathProgramCache]: Analyzing trace with hash -1449578949, now seen corresponding path program 1 times [2019-11-16 00:22:38,965 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:22:38,966 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [266577250] [2019-11-16 00:22:38,966 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:22:38,966 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:22:38,966 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:22:39,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:22:39,154 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-16 00:22:39,154 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [266577250] [2019-11-16 00:22:39,155 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:22:39,155 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-16 00:22:39,155 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1376426502] [2019-11-16 00:22:39,159 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-16 00:22:39,159 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:22:39,172 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-16 00:22:39,173 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-16 00:22:39,175 INFO L87 Difference]: Start difference. First operand 124 states. Second operand 3 states. [2019-11-16 00:22:39,406 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:22:39,406 INFO L93 Difference]: Finished difference Result 245 states and 420 transitions. [2019-11-16 00:22:39,407 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-16 00:22:39,408 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 23 [2019-11-16 00:22:39,409 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:22:39,420 INFO L225 Difference]: With dead ends: 245 [2019-11-16 00:22:39,420 INFO L226 Difference]: Without dead ends: 111 [2019-11-16 00:22:39,426 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-16 00:22:39,443 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111 states. [2019-11-16 00:22:39,481 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111 to 111. [2019-11-16 00:22:39,483 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 111 states. [2019-11-16 00:22:39,490 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111 states to 111 states and 168 transitions. [2019-11-16 00:22:39,491 INFO L78 Accepts]: Start accepts. Automaton has 111 states and 168 transitions. Word has length 23 [2019-11-16 00:22:39,492 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:22:39,492 INFO L462 AbstractCegarLoop]: Abstraction has 111 states and 168 transitions. [2019-11-16 00:22:39,493 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-16 00:22:39,493 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 168 transitions. [2019-11-16 00:22:39,496 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2019-11-16 00:22:39,496 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:22:39,496 INFO L380 BasicCegarLoop]: trace histogram [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] [2019-11-16 00:22:39,497 INFO L410 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:22:39,497 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:22:39,497 INFO L82 PathProgramCache]: Analyzing trace with hash 800883515, now seen corresponding path program 1 times [2019-11-16 00:22:39,497 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:22:39,498 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [141658002] [2019-11-16 00:22:39,498 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:22:39,498 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:22:39,499 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:22:39,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:22:39,627 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-16 00:22:39,627 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [141658002] [2019-11-16 00:22:39,628 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:22:39,628 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-16 00:22:39,628 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [646349673] [2019-11-16 00:22:39,630 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-16 00:22:39,630 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:22:39,630 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-16 00:22:39,631 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-16 00:22:39,631 INFO L87 Difference]: Start difference. First operand 111 states and 168 transitions. Second operand 3 states. [2019-11-16 00:22:39,781 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:22:39,781 INFO L93 Difference]: Finished difference Result 232 states and 355 transitions. [2019-11-16 00:22:39,782 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-16 00:22:39,782 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 35 [2019-11-16 00:22:39,782 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:22:39,784 INFO L225 Difference]: With dead ends: 232 [2019-11-16 00:22:39,784 INFO L226 Difference]: Without dead ends: 130 [2019-11-16 00:22:39,785 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-16 00:22:39,786 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 130 states. [2019-11-16 00:22:39,796 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 130 to 126. [2019-11-16 00:22:39,796 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 126 states. [2019-11-16 00:22:39,797 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 126 states to 126 states and 188 transitions. [2019-11-16 00:22:39,797 INFO L78 Accepts]: Start accepts. Automaton has 126 states and 188 transitions. Word has length 35 [2019-11-16 00:22:39,797 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:22:39,797 INFO L462 AbstractCegarLoop]: Abstraction has 126 states and 188 transitions. [2019-11-16 00:22:39,797 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-16 00:22:39,798 INFO L276 IsEmpty]: Start isEmpty. Operand 126 states and 188 transitions. [2019-11-16 00:22:39,799 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2019-11-16 00:22:39,799 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:22:39,799 INFO L380 BasicCegarLoop]: trace histogram [3, 3, 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] [2019-11-16 00:22:39,800 INFO L410 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:22:39,800 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:22:39,800 INFO L82 PathProgramCache]: Analyzing trace with hash 1711238340, now seen corresponding path program 1 times [2019-11-16 00:22:39,800 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:22:39,801 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2106636421] [2019-11-16 00:22:39,801 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:22:39,801 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:22:39,801 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:22:39,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:22:39,909 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 13 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-11-16 00:22:39,909 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2106636421] [2019-11-16 00:22:39,909 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:22:39,910 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-16 00:22:39,910 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [389661413] [2019-11-16 00:22:39,911 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-16 00:22:39,911 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:22:39,911 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-16 00:22:39,911 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-16 00:22:39,912 INFO L87 Difference]: Start difference. First operand 126 states and 188 transitions. Second operand 3 states. [2019-11-16 00:22:40,070 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:22:40,070 INFO L93 Difference]: Finished difference Result 264 states and 399 transitions. [2019-11-16 00:22:40,071 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-16 00:22:40,071 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 49 [2019-11-16 00:22:40,071 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:22:40,073 INFO L225 Difference]: With dead ends: 264 [2019-11-16 00:22:40,073 INFO L226 Difference]: Without dead ends: 147 [2019-11-16 00:22:40,074 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-16 00:22:40,075 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 147 states. [2019-11-16 00:22:40,087 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 147 to 143. [2019-11-16 00:22:40,088 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 143 states. [2019-11-16 00:22:40,088 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 143 states to 143 states and 210 transitions. [2019-11-16 00:22:40,089 INFO L78 Accepts]: Start accepts. Automaton has 143 states and 210 transitions. Word has length 49 [2019-11-16 00:22:40,089 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:22:40,089 INFO L462 AbstractCegarLoop]: Abstraction has 143 states and 210 transitions. [2019-11-16 00:22:40,090 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-16 00:22:40,090 INFO L276 IsEmpty]: Start isEmpty. Operand 143 states and 210 transitions. [2019-11-16 00:22:40,098 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-11-16 00:22:40,098 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:22:40,099 INFO L380 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 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] [2019-11-16 00:22:40,099 INFO L410 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:22:40,099 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:22:40,099 INFO L82 PathProgramCache]: Analyzing trace with hash -1841896084, now seen corresponding path program 1 times [2019-11-16 00:22:40,100 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:22:40,100 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1628905886] [2019-11-16 00:22:40,100 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:22:40,100 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:22:40,100 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:22:40,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:22:40,200 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 38 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-11-16 00:22:40,200 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1628905886] [2019-11-16 00:22:40,200 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:22:40,201 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-16 00:22:40,201 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2050817174] [2019-11-16 00:22:40,201 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-16 00:22:40,203 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:22:40,203 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-16 00:22:40,203 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-16 00:22:40,203 INFO L87 Difference]: Start difference. First operand 143 states and 210 transitions. Second operand 3 states. [2019-11-16 00:22:40,229 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:22:40,229 INFO L93 Difference]: Finished difference Result 298 states and 435 transitions. [2019-11-16 00:22:40,230 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-16 00:22:40,230 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 66 [2019-11-16 00:22:40,230 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:22:40,232 INFO L225 Difference]: With dead ends: 298 [2019-11-16 00:22:40,232 INFO L226 Difference]: Without dead ends: 164 [2019-11-16 00:22:40,233 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-16 00:22:40,234 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 164 states. [2019-11-16 00:22:40,250 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 164 to 164. [2019-11-16 00:22:40,251 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 164 states. [2019-11-16 00:22:40,251 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 164 states to 164 states and 237 transitions. [2019-11-16 00:22:40,252 INFO L78 Accepts]: Start accepts. Automaton has 164 states and 237 transitions. Word has length 66 [2019-11-16 00:22:40,252 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:22:40,252 INFO L462 AbstractCegarLoop]: Abstraction has 164 states and 237 transitions. [2019-11-16 00:22:40,252 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-16 00:22:40,253 INFO L276 IsEmpty]: Start isEmpty. Operand 164 states and 237 transitions. [2019-11-16 00:22:40,257 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-11-16 00:22:40,257 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:22:40,258 INFO L380 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 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] [2019-11-16 00:22:40,259 INFO L410 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:22:40,260 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:22:40,260 INFO L82 PathProgramCache]: Analyzing trace with hash -1982444694, now seen corresponding path program 1 times [2019-11-16 00:22:40,260 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:22:40,260 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1746701819] [2019-11-16 00:22:40,261 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:22:40,261 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:22:40,261 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:22:40,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:22:40,355 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 25 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2019-11-16 00:22:40,356 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1746701819] [2019-11-16 00:22:40,356 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:22:40,356 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-16 00:22:40,357 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1843399681] [2019-11-16 00:22:40,357 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-16 00:22:40,357 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:22:40,360 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-16 00:22:40,361 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-16 00:22:40,362 INFO L87 Difference]: Start difference. First operand 164 states and 237 transitions. Second operand 3 states. [2019-11-16 00:22:40,569 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:22:40,570 INFO L93 Difference]: Finished difference Result 369 states and 549 transitions. [2019-11-16 00:22:40,570 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-16 00:22:40,570 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 66 [2019-11-16 00:22:40,571 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:22:40,572 INFO L225 Difference]: With dead ends: 369 [2019-11-16 00:22:40,572 INFO L226 Difference]: Without dead ends: 213 [2019-11-16 00:22:40,574 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-16 00:22:40,574 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 213 states. [2019-11-16 00:22:40,583 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 213 to 205. [2019-11-16 00:22:40,583 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 205 states. [2019-11-16 00:22:40,584 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 205 states to 205 states and 287 transitions. [2019-11-16 00:22:40,584 INFO L78 Accepts]: Start accepts. Automaton has 205 states and 287 transitions. Word has length 66 [2019-11-16 00:22:40,585 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:22:40,585 INFO L462 AbstractCegarLoop]: Abstraction has 205 states and 287 transitions. [2019-11-16 00:22:40,585 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-16 00:22:40,585 INFO L276 IsEmpty]: Start isEmpty. Operand 205 states and 287 transitions. [2019-11-16 00:22:40,587 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-11-16 00:22:40,587 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:22:40,587 INFO L380 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 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] [2019-11-16 00:22:40,587 INFO L410 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:22:40,587 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:22:40,588 INFO L82 PathProgramCache]: Analyzing trace with hash 507084268, now seen corresponding path program 1 times [2019-11-16 00:22:40,588 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:22:40,588 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [362527142] [2019-11-16 00:22:40,588 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:22:40,588 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:22:40,589 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:22:40,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:22:40,647 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 25 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2019-11-16 00:22:40,647 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [362527142] [2019-11-16 00:22:40,647 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:22:40,648 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-16 00:22:40,648 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [328648249] [2019-11-16 00:22:40,648 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-16 00:22:40,649 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:22:40,649 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-16 00:22:40,649 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-16 00:22:40,649 INFO L87 Difference]: Start difference. First operand 205 states and 287 transitions. Second operand 3 states. [2019-11-16 00:22:40,794 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:22:40,794 INFO L93 Difference]: Finished difference Result 424 states and 601 transitions. [2019-11-16 00:22:40,794 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-16 00:22:40,794 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 66 [2019-11-16 00:22:40,795 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:22:40,796 INFO L225 Difference]: With dead ends: 424 [2019-11-16 00:22:40,796 INFO L226 Difference]: Without dead ends: 228 [2019-11-16 00:22:40,797 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-16 00:22:40,798 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 228 states. [2019-11-16 00:22:40,810 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 228 to 224. [2019-11-16 00:22:40,810 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 224 states. [2019-11-16 00:22:40,811 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 224 states to 224 states and 311 transitions. [2019-11-16 00:22:40,812 INFO L78 Accepts]: Start accepts. Automaton has 224 states and 311 transitions. Word has length 66 [2019-11-16 00:22:40,812 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:22:40,812 INFO L462 AbstractCegarLoop]: Abstraction has 224 states and 311 transitions. [2019-11-16 00:22:40,812 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-16 00:22:40,812 INFO L276 IsEmpty]: Start isEmpty. Operand 224 states and 311 transitions. [2019-11-16 00:22:40,813 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2019-11-16 00:22:40,813 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:22:40,819 INFO L380 BasicCegarLoop]: trace histogram [5, 5, 4, 4, 4, 4, 4, 4, 4, 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] [2019-11-16 00:22:40,820 INFO L410 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:22:40,820 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:22:40,820 INFO L82 PathProgramCache]: Analyzing trace with hash -374488382, now seen corresponding path program 1 times [2019-11-16 00:22:40,820 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:22:40,821 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2036388121] [2019-11-16 00:22:40,821 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:22:40,821 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:22:40,821 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:22:40,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:22:40,894 INFO L134 CoverageAnalysis]: Checked inductivity of 80 backedges. 39 proven. 0 refuted. 0 times theorem prover too weak. 41 trivial. 0 not checked. [2019-11-16 00:22:40,894 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2036388121] [2019-11-16 00:22:40,895 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:22:40,895 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-16 00:22:40,895 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2071732479] [2019-11-16 00:22:40,896 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-16 00:22:40,896 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:22:40,896 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-16 00:22:40,896 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-16 00:22:40,896 INFO L87 Difference]: Start difference. First operand 224 states and 311 transitions. Second operand 3 states. [2019-11-16 00:22:41,070 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:22:41,070 INFO L93 Difference]: Finished difference Result 463 states and 651 transitions. [2019-11-16 00:22:41,070 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-16 00:22:41,070 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 82 [2019-11-16 00:22:41,071 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:22:41,072 INFO L225 Difference]: With dead ends: 463 [2019-11-16 00:22:41,073 INFO L226 Difference]: Without dead ends: 248 [2019-11-16 00:22:41,073 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-16 00:22:41,074 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 248 states. [2019-11-16 00:22:41,080 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 248 to 245. [2019-11-16 00:22:41,081 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 245 states. [2019-11-16 00:22:41,084 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 245 states to 245 states and 337 transitions. [2019-11-16 00:22:41,084 INFO L78 Accepts]: Start accepts. Automaton has 245 states and 337 transitions. Word has length 82 [2019-11-16 00:22:41,085 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:22:41,086 INFO L462 AbstractCegarLoop]: Abstraction has 245 states and 337 transitions. [2019-11-16 00:22:41,086 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-16 00:22:41,086 INFO L276 IsEmpty]: Start isEmpty. Operand 245 states and 337 transitions. [2019-11-16 00:22:41,087 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2019-11-16 00:22:41,087 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:22:41,088 INFO L380 BasicCegarLoop]: trace histogram [6, 6, 5, 5, 5, 5, 5, 5, 5, 4, 4, 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] [2019-11-16 00:22:41,088 INFO L410 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:22:41,088 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:22:41,088 INFO L82 PathProgramCache]: Analyzing trace with hash -272398982, now seen corresponding path program 1 times [2019-11-16 00:22:41,089 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:22:41,089 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1436623510] [2019-11-16 00:22:41,089 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:22:41,089 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:22:41,089 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:22:41,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:22:41,178 INFO L134 CoverageAnalysis]: Checked inductivity of 135 backedges. 105 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2019-11-16 00:22:41,178 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1436623510] [2019-11-16 00:22:41,178 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:22:41,178 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-16 00:22:41,179 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [61197666] [2019-11-16 00:22:41,179 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-16 00:22:41,179 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:22:41,180 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-16 00:22:41,180 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-16 00:22:41,180 INFO L87 Difference]: Start difference. First operand 245 states and 337 transitions. Second operand 3 states. [2019-11-16 00:22:41,243 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:22:41,243 INFO L93 Difference]: Finished difference Result 694 states and 957 transitions. [2019-11-16 00:22:41,244 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-16 00:22:41,244 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 102 [2019-11-16 00:22:41,244 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:22:41,246 INFO L225 Difference]: With dead ends: 694 [2019-11-16 00:22:41,246 INFO L226 Difference]: Without dead ends: 458 [2019-11-16 00:22:41,247 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-16 00:22:41,248 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 458 states. [2019-11-16 00:22:41,257 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 458 to 458. [2019-11-16 00:22:41,257 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 458 states. [2019-11-16 00:22:41,259 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 458 states to 458 states and 630 transitions. [2019-11-16 00:22:41,259 INFO L78 Accepts]: Start accepts. Automaton has 458 states and 630 transitions. Word has length 102 [2019-11-16 00:22:41,259 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:22:41,259 INFO L462 AbstractCegarLoop]: Abstraction has 458 states and 630 transitions. [2019-11-16 00:22:41,259 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-16 00:22:41,260 INFO L276 IsEmpty]: Start isEmpty. Operand 458 states and 630 transitions. [2019-11-16 00:22:41,261 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2019-11-16 00:22:41,261 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:22:41,261 INFO L380 BasicCegarLoop]: trace histogram [6, 6, 5, 5, 5, 5, 5, 5, 5, 4, 4, 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] [2019-11-16 00:22:41,261 INFO L410 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:22:41,262 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:22:41,262 INFO L82 PathProgramCache]: Analyzing trace with hash -1688750428, now seen corresponding path program 1 times [2019-11-16 00:22:41,262 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:22:41,262 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1155257670] [2019-11-16 00:22:41,262 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:22:41,263 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:22:41,263 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:22:41,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:22:41,304 INFO L134 CoverageAnalysis]: Checked inductivity of 135 backedges. 55 proven. 0 refuted. 0 times theorem prover too weak. 80 trivial. 0 not checked. [2019-11-16 00:22:41,304 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1155257670] [2019-11-16 00:22:41,304 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:22:41,304 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-16 00:22:41,305 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1140567377] [2019-11-16 00:22:41,305 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-16 00:22:41,305 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:22:41,305 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-16 00:22:41,306 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-16 00:22:41,306 INFO L87 Difference]: Start difference. First operand 458 states and 630 transitions. Second operand 3 states. [2019-11-16 00:22:41,342 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:22:41,342 INFO L93 Difference]: Finished difference Result 673 states and 927 transitions. [2019-11-16 00:22:41,342 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-16 00:22:41,342 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 104 [2019-11-16 00:22:41,343 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:22:41,346 INFO L225 Difference]: With dead ends: 673 [2019-11-16 00:22:41,347 INFO L226 Difference]: Without dead ends: 671 [2019-11-16 00:22:41,347 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-16 00:22:41,348 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 671 states. [2019-11-16 00:22:41,360 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 671 to 671. [2019-11-16 00:22:41,360 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 671 states. [2019-11-16 00:22:41,363 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 671 states to 671 states and 925 transitions. [2019-11-16 00:22:41,363 INFO L78 Accepts]: Start accepts. Automaton has 671 states and 925 transitions. Word has length 104 [2019-11-16 00:22:41,363 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:22:41,363 INFO L462 AbstractCegarLoop]: Abstraction has 671 states and 925 transitions. [2019-11-16 00:22:41,364 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-16 00:22:41,364 INFO L276 IsEmpty]: Start isEmpty. Operand 671 states and 925 transitions. [2019-11-16 00:22:41,366 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 173 [2019-11-16 00:22:41,366 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:22:41,367 INFO L380 BasicCegarLoop]: trace histogram [10, 10, 9, 9, 9, 9, 9, 9, 9, 7, 7, 5, 5, 3, 3, 2, 2, 2, 2, 2, 2, 2, 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] [2019-11-16 00:22:41,367 INFO L410 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:22:41,367 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:22:41,367 INFO L82 PathProgramCache]: Analyzing trace with hash 439361019, now seen corresponding path program 1 times [2019-11-16 00:22:41,367 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:22:41,368 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1111133158] [2019-11-16 00:22:41,368 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:22:41,368 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:22:41,368 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:22:41,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:22:41,432 INFO L134 CoverageAnalysis]: Checked inductivity of 470 backedges. 310 proven. 0 refuted. 0 times theorem prover too weak. 160 trivial. 0 not checked. [2019-11-16 00:22:41,441 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1111133158] [2019-11-16 00:22:41,442 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:22:41,443 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-16 00:22:41,443 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1802835297] [2019-11-16 00:22:41,444 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-16 00:22:41,445 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:22:41,445 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-16 00:22:41,445 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-16 00:22:41,445 INFO L87 Difference]: Start difference. First operand 671 states and 925 transitions. Second operand 3 states. [2019-11-16 00:22:41,627 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:22:41,627 INFO L93 Difference]: Finished difference Result 1483 states and 2101 transitions. [2019-11-16 00:22:41,628 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-16 00:22:41,628 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 172 [2019-11-16 00:22:41,628 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:22:41,635 INFO L225 Difference]: With dead ends: 1483 [2019-11-16 00:22:41,636 INFO L226 Difference]: Without dead ends: 818 [2019-11-16 00:22:41,641 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-16 00:22:41,643 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 818 states. [2019-11-16 00:22:41,659 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 818 to 788. [2019-11-16 00:22:41,659 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 788 states. [2019-11-16 00:22:41,663 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 788 states to 788 states and 1114 transitions. [2019-11-16 00:22:41,664 INFO L78 Accepts]: Start accepts. Automaton has 788 states and 1114 transitions. Word has length 172 [2019-11-16 00:22:41,664 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:22:41,664 INFO L462 AbstractCegarLoop]: Abstraction has 788 states and 1114 transitions. [2019-11-16 00:22:41,664 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-16 00:22:41,664 INFO L276 IsEmpty]: Start isEmpty. Operand 788 states and 1114 transitions. [2019-11-16 00:22:41,667 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 185 [2019-11-16 00:22:41,667 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:22:41,668 INFO L380 BasicCegarLoop]: trace histogram [11, 11, 10, 10, 9, 9, 9, 9, 9, 7, 7, 5, 5, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2019-11-16 00:22:41,668 INFO L410 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:22:41,668 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:22:41,668 INFO L82 PathProgramCache]: Analyzing trace with hash 1597857147, now seen corresponding path program 2 times [2019-11-16 00:22:41,669 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:22:41,669 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [313187909] [2019-11-16 00:22:41,669 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:22:41,669 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:22:41,669 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:22:41,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:22:41,741 INFO L134 CoverageAnalysis]: Checked inductivity of 525 backedges. 325 proven. 0 refuted. 0 times theorem prover too weak. 200 trivial. 0 not checked. [2019-11-16 00:22:41,741 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [313187909] [2019-11-16 00:22:41,742 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:22:41,742 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-16 00:22:41,742 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [67160572] [2019-11-16 00:22:41,743 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-16 00:22:41,743 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:22:41,743 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-16 00:22:41,743 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-16 00:22:41,743 INFO L87 Difference]: Start difference. First operand 788 states and 1114 transitions. Second operand 3 states. [2019-11-16 00:22:41,936 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:22:41,936 INFO L93 Difference]: Finished difference Result 1845 states and 2682 transitions. [2019-11-16 00:22:41,937 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-16 00:22:41,937 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 184 [2019-11-16 00:22:41,937 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:22:41,943 INFO L225 Difference]: With dead ends: 1845 [2019-11-16 00:22:41,943 INFO L226 Difference]: Without dead ends: 1015 [2019-11-16 00:22:41,944 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-16 00:22:41,946 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1015 states. [2019-11-16 00:22:41,965 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1015 to 977. [2019-11-16 00:22:41,966 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 977 states. [2019-11-16 00:22:41,969 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 977 states to 977 states and 1366 transitions. [2019-11-16 00:22:41,970 INFO L78 Accepts]: Start accepts. Automaton has 977 states and 1366 transitions. Word has length 184 [2019-11-16 00:22:41,970 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:22:41,970 INFO L462 AbstractCegarLoop]: Abstraction has 977 states and 1366 transitions. [2019-11-16 00:22:41,970 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-16 00:22:41,970 INFO L276 IsEmpty]: Start isEmpty. Operand 977 states and 1366 transitions. [2019-11-16 00:22:41,974 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 194 [2019-11-16 00:22:41,974 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:22:41,974 INFO L380 BasicCegarLoop]: trace histogram [11, 11, 10, 10, 10, 10, 10, 10, 10, 8, 8, 6, 6, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2019-11-16 00:22:41,974 INFO L410 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:22:41,975 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:22:41,975 INFO L82 PathProgramCache]: Analyzing trace with hash -1444142562, now seen corresponding path program 1 times [2019-11-16 00:22:41,975 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:22:41,975 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [784150624] [2019-11-16 00:22:41,975 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:22:41,976 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:22:41,976 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:22:41,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:22:42,103 INFO L134 CoverageAnalysis]: Checked inductivity of 597 backedges. 420 proven. 0 refuted. 0 times theorem prover too weak. 177 trivial. 0 not checked. [2019-11-16 00:22:42,104 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [784150624] [2019-11-16 00:22:42,104 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:22:42,104 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-16 00:22:42,104 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1404008900] [2019-11-16 00:22:42,105 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-16 00:22:42,105 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:22:42,105 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-16 00:22:42,105 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-16 00:22:42,106 INFO L87 Difference]: Start difference. First operand 977 states and 1366 transitions. Second operand 3 states. [2019-11-16 00:22:42,142 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:22:42,143 INFO L93 Difference]: Finished difference Result 2279 states and 3183 transitions. [2019-11-16 00:22:42,143 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-16 00:22:42,143 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 193 [2019-11-16 00:22:42,144 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:22:42,151 INFO L225 Difference]: With dead ends: 2279 [2019-11-16 00:22:42,151 INFO L226 Difference]: Without dead ends: 1311 [2019-11-16 00:22:42,153 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-16 00:22:42,154 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1311 states. [2019-11-16 00:22:42,182 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1311 to 1311. [2019-11-16 00:22:42,182 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1311 states. [2019-11-16 00:22:42,186 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1311 states to 1311 states and 1827 transitions. [2019-11-16 00:22:42,187 INFO L78 Accepts]: Start accepts. Automaton has 1311 states and 1827 transitions. Word has length 193 [2019-11-16 00:22:42,187 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:22:42,187 INFO L462 AbstractCegarLoop]: Abstraction has 1311 states and 1827 transitions. [2019-11-16 00:22:42,187 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-16 00:22:42,188 INFO L276 IsEmpty]: Start isEmpty. Operand 1311 states and 1827 transitions. [2019-11-16 00:22:42,192 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 196 [2019-11-16 00:22:42,192 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:22:42,192 INFO L380 BasicCegarLoop]: trace histogram [10, 10, 9, 9, 9, 9, 9, 9, 9, 7, 7, 5, 5, 4, 4, 3, 3, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1] [2019-11-16 00:22:42,192 INFO L410 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:22:42,193 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:22:42,193 INFO L82 PathProgramCache]: Analyzing trace with hash -1661550404, now seen corresponding path program 1 times [2019-11-16 00:22:42,193 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:22:42,193 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1413287373] [2019-11-16 00:22:42,194 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:22:42,194 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:22:42,194 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:22:42,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:22:42,294 INFO L134 CoverageAnalysis]: Checked inductivity of 478 backedges. 324 proven. 0 refuted. 0 times theorem prover too weak. 154 trivial. 0 not checked. [2019-11-16 00:22:42,294 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1413287373] [2019-11-16 00:22:42,295 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:22:42,295 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-16 00:22:42,295 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [284715687] [2019-11-16 00:22:42,296 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-16 00:22:42,296 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:22:42,296 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-16 00:22:42,296 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-16 00:22:42,297 INFO L87 Difference]: Start difference. First operand 1311 states and 1827 transitions. Second operand 3 states. [2019-11-16 00:22:42,351 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:22:42,352 INFO L93 Difference]: Finished difference Result 3667 states and 5151 transitions. [2019-11-16 00:22:42,352 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-16 00:22:42,352 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 195 [2019-11-16 00:22:42,353 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:22:42,366 INFO L225 Difference]: With dead ends: 3667 [2019-11-16 00:22:42,366 INFO L226 Difference]: Without dead ends: 2365 [2019-11-16 00:22:42,368 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-16 00:22:42,372 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2365 states. [2019-11-16 00:22:42,457 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2365 to 2363. [2019-11-16 00:22:42,457 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2363 states. [2019-11-16 00:22:42,465 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2363 states to 2363 states and 3324 transitions. [2019-11-16 00:22:42,465 INFO L78 Accepts]: Start accepts. Automaton has 2363 states and 3324 transitions. Word has length 195 [2019-11-16 00:22:42,466 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:22:42,466 INFO L462 AbstractCegarLoop]: Abstraction has 2363 states and 3324 transitions. [2019-11-16 00:22:42,466 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-16 00:22:42,466 INFO L276 IsEmpty]: Start isEmpty. Operand 2363 states and 3324 transitions. [2019-11-16 00:22:42,471 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 196 [2019-11-16 00:22:42,471 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:22:42,472 INFO L380 BasicCegarLoop]: trace histogram [11, 11, 10, 10, 10, 10, 10, 10, 10, 8, 8, 6, 6, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2019-11-16 00:22:42,472 INFO L410 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:22:42,472 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:22:42,472 INFO L82 PathProgramCache]: Analyzing trace with hash -403372922, now seen corresponding path program 1 times [2019-11-16 00:22:42,473 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:22:42,473 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2029590666] [2019-11-16 00:22:42,473 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:22:42,473 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:22:42,473 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:22:42,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-16 00:22:42,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-16 00:22:42,629 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-16 00:22:42,629 INFO L445 BasicCegarLoop]: Counterexample might be feasible [2019-11-16 00:22:42,714 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 16.11 12:22:42 BoogieIcfgContainer [2019-11-16 00:22:42,714 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-11-16 00:22:42,714 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-11-16 00:22:42,714 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-11-16 00:22:42,715 INFO L275 PluginConnector]: Witness Printer initialized [2019-11-16 00:22:42,715 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.11 12:22:38" (3/4) ... [2019-11-16 00:22:42,718 INFO L140 WitnessPrinter]: No result that supports witness generation found [2019-11-16 00:22:42,718 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-11-16 00:22:42,720 INFO L168 Benchmark]: Toolchain (without parser) took 5165.92 ms. Allocated memory was 1.0 GB in the beginning and 1.3 GB in the end (delta: 310.4 MB). Free memory was 951.6 MB in the beginning and 1.3 GB in the end (delta: -304.3 MB). Peak memory consumption was 6.1 MB. Max. memory is 11.5 GB. [2019-11-16 00:22:42,721 INFO L168 Benchmark]: CDTParser took 0.18 ms. Allocated memory is still 1.0 GB. Free memory is still 967.7 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-16 00:22:42,721 INFO L168 Benchmark]: CACSL2BoogieTranslator took 427.12 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 126.9 MB). Free memory was 951.6 MB in the beginning and 1.1 GB in the end (delta: -164.8 MB). Peak memory consumption was 23.7 MB. Max. memory is 11.5 GB. [2019-11-16 00:22:42,722 INFO L168 Benchmark]: Boogie Procedure Inliner took 56.70 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.8 MB). Peak memory consumption was 6.8 MB. Max. memory is 11.5 GB. [2019-11-16 00:22:42,722 INFO L168 Benchmark]: Boogie Preprocessor took 42.73 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-16 00:22:42,723 INFO L168 Benchmark]: RCFGBuilder took 751.86 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 48.9 MB). Peak memory consumption was 48.9 MB. Max. memory is 11.5 GB. [2019-11-16 00:22:42,723 INFO L168 Benchmark]: TraceAbstraction took 3878.75 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 183.5 MB). Free memory was 1.1 GB in the beginning and 1.3 GB in the end (delta: -195.3 MB). There was no memory consumed. Max. memory is 11.5 GB. [2019-11-16 00:22:42,723 INFO L168 Benchmark]: Witness Printer took 4.16 ms. Allocated memory is still 1.3 GB. Free memory is still 1.3 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-16 00:22:42,726 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.18 ms. Allocated memory is still 1.0 GB. Free memory is still 967.7 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 427.12 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 126.9 MB). Free memory was 951.6 MB in the beginning and 1.1 GB in the end (delta: -164.8 MB). Peak memory consumption was 23.7 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 56.70 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.8 MB). Peak memory consumption was 6.8 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 42.73 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 751.86 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 48.9 MB). Peak memory consumption was 48.9 MB. Max. memory is 11.5 GB. * TraceAbstraction took 3878.75 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 183.5 MB). Free memory was 1.1 GB in the beginning and 1.3 GB in the end (delta: -195.3 MB). There was no memory consumed. Max. memory is 11.5 GB. * Witness Printer took 4.16 ms. Allocated memory is still 1.3 GB. Free memory is still 1.3 GB. There was no memory consumed. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - UnprovableResult [Line: 608]: Unable to prove that call of __VERIFIER_error() unreachable Unable to prove that call of __VERIFIER_error() unreachable Reason: overapproximation of bitwiseXor at line 356. Possible FailurePath: [L617] int __retres1 ; [L9] int s__info_callback = __VERIFIER_nondet_int(); [L10] unsigned int s__in_handshake = __VERIFIER_nondet_uint(); [L11] int s__state ; [L12] int s__new_session ; [L13] int s__server ; [L14] unsigned int s__version = __VERIFIER_nondet_uint(); [L15] int s__type ; [L16] int s__init_num ; [L17] int s__bbio = __VERIFIER_nondet_int(); [L18] int s__wbio = __VERIFIER_nondet_int(); [L19] int s__hit = __VERIFIER_nondet_int(); [L20] int s__rwstate ; [L21] int s__init_buf___0 ; [L22] int s__debug = __VERIFIER_nondet_int(); [L23] int s__shutdown ; [L24] int s__ctx__info_callback = __VERIFIER_nondet_int(); [L25] unsigned int s__ctx__stats__sess_connect_renegotiate = __VERIFIER_nondet_uint(); [L26] unsigned int s__ctx__stats__sess_connect ; [L27] unsigned int s__ctx__stats__sess_hit = __VERIFIER_nondet_uint(); [L28] unsigned int s__ctx__stats__sess_connect_good = __VERIFIER_nondet_uint(); [L29] int s__s3__change_cipher_spec ; [L30] int s__s3__flags ; [L31] int s__s3__delay_buf_pop_ret ; [L32] int s__s3__tmp__cert_req = __VERIFIER_nondet_int(); [L33] int s__s3__tmp__new_compression = __VERIFIER_nondet_int(); [L34] int s__s3__tmp__reuse_message = __VERIFIER_nondet_int(); [L35] int s__s3__tmp__new_cipher = __VERIFIER_nondet_int(); [L36] int s__s3__tmp__new_cipher__algorithms = __VERIFIER_nondet_int(); [L37] int s__s3__tmp__next_state___0 ; [L38] int s__s3__tmp__new_compression__id = __VERIFIER_nondet_int(); [L39] int s__session__cipher ; [L40] int s__session__compress_meth ; [L41] int buf ; [L42] unsigned long tmp ; [L43] unsigned long l ; [L44] int num1 ; [L45] int cb ; [L46] int ret ; [L47] int new_state ; [L48] int state ; [L49] int skip ; [L50] int tmp___0 ; [L51] unsigned int tmp___1 = __VERIFIER_nondet_uint(); [L52] unsigned int tmp___2 = __VERIFIER_nondet_uint(); [L53] int tmp___3 = __VERIFIER_nondet_int(); [L54] int tmp___4 = __VERIFIER_nondet_int(); [L55] int tmp___5 = __VERIFIER_nondet_int(); [L56] int tmp___6 = __VERIFIER_nondet_int(); [L57] int tmp___7 = __VERIFIER_nondet_int(); [L58] int tmp___8 = __VERIFIER_nondet_int(); [L59] int tmp___9 = __VERIFIER_nondet_int(); [L60] int blastFlag ; [L61] int ag_X ; [L62] int ag_Y ; [L63] int __retres59 ; [L66] s__state = 12292 [L67] blastFlag = 0 [L68] tmp = __VERIFIER_nondet_int() [L69] cb = 0 [L70] ret = -1 [L71] skip = 0 [L72] tmp___0 = 0 [L73] COND TRUE s__info_callback != 0 [L74] cb = s__info_callback [L82] s__in_handshake = s__in_handshake + 1 [L83] COND FALSE !(tmp___1 - 12288) [L93] COND TRUE 1 [L95] state = s__state [L96] COND TRUE s__state == 12292 [L199] s__new_session = 1 [L200] s__state = 4096 [L201] s__ctx__stats__sess_connect_renegotiate = s__ctx__stats__sess_connect_renegotiate + 1 [L206] s__server = 0 [L207] COND TRUE cb != 0 [L212] COND FALSE !(s__version - 65280 != 768) [L218] s__type = 4096 [L219] COND FALSE !(s__init_buf___0 == 0) [L237] COND FALSE !(! tmp___4) [L243] COND FALSE !(! tmp___5) [L249] s__state = 4368 [L250] s__ctx__stats__sess_connect = s__ctx__stats__sess_connect + 1 [L251] s__init_num = 0 [L566] COND FALSE !(! s__s3__tmp__reuse_message) [L595] skip = 0 [L93] COND TRUE 1 [L95] state = s__state [L96] COND FALSE !(s__state == 12292) [L99] COND FALSE !(s__state == 16384) [L102] COND FALSE !(s__state == 4096) [L105] COND FALSE !(s__state == 20480) [L108] COND FALSE !(s__state == 4099) [L111] COND TRUE s__state == 4368 [L255] s__shutdown = 0 [L256] ret = __VERIFIER_nondet_int() [L257] COND TRUE blastFlag == 0 [L258] blastFlag = 1 [L266] COND FALSE !(ret <= 0) [L271] s__state = 4384 [L272] s__init_num = 0 [L273] COND TRUE s__bbio != s__wbio [L566] COND FALSE !(! s__s3__tmp__reuse_message) [L595] skip = 0 [L93] COND TRUE 1 [L95] state = s__state [L96] COND FALSE !(s__state == 12292) [L99] COND FALSE !(s__state == 16384) [L102] COND FALSE !(s__state == 4096) [L105] COND FALSE !(s__state == 20480) [L108] COND FALSE !(s__state == 4099) [L111] COND FALSE !(s__state == 4368) [L114] COND FALSE !(s__state == 4369) [L117] COND TRUE s__state == 4384 [L281] ret = __VERIFIER_nondet_int() [L282] COND TRUE blastFlag == 1 [L283] blastFlag = 2 [L287] COND FALSE !(ret <= 0) [L292] COND FALSE !(\read(s__hit)) [L295] s__state = 4400 [L297] s__init_num = 0 [L566] COND FALSE !(! s__s3__tmp__reuse_message) [L595] skip = 0 [L93] COND TRUE 1 [L95] state = s__state [L96] COND FALSE !(s__state == 12292) [L99] COND FALSE !(s__state == 16384) [L102] COND FALSE !(s__state == 4096) [L105] COND FALSE !(s__state == 20480) [L108] COND FALSE !(s__state == 4099) [L111] COND FALSE !(s__state == 4368) [L114] COND FALSE !(s__state == 4369) [L117] COND FALSE !(s__state == 4384) [L120] COND FALSE !(s__state == 4385) [L123] COND TRUE s__state == 4400 [L301] COND FALSE !((unsigned long )s__s3__tmp__new_cipher__algorithms - 256UL) [L304] ret = __VERIFIER_nondet_int() [L305] COND TRUE blastFlag == 2 [L306] blastFlag = 3 [L310] COND FALSE !(ret <= 0) [L316] ag_Y = 61087 [L317] s__state = 4416 [L318] s__init_num = 0 [L566] COND FALSE !(! s__s3__tmp__reuse_message) [L595] skip = 0 [L93] COND TRUE 1 [L95] state = s__state [L96] COND FALSE !(s__state == 12292) [L99] COND FALSE !(s__state == 16384) [L102] COND FALSE !(s__state == 4096) [L105] COND FALSE !(s__state == 20480) [L108] COND FALSE !(s__state == 4099) [L111] COND FALSE !(s__state == 4368) [L114] COND FALSE !(s__state == 4369) [L117] COND FALSE !(s__state == 4384) [L120] COND FALSE !(s__state == 4385) [L123] COND FALSE !(s__state == 4400) [L126] COND FALSE !(s__state == 4401) [L129] COND TRUE s__state == 4416 [L322] ret = __VERIFIER_nondet_int() [L323] COND TRUE blastFlag == 3 [L324] blastFlag = 4 [L328] COND FALSE !(ret <= 0) [L333] s__state = 4432 [L334] ag_X = (unsigned short)65535 [L335] s__init_num = 0 [L336] COND FALSE !(! tmp___6) [L566] COND FALSE !(! s__s3__tmp__reuse_message) [L595] skip = 0 [L93] COND TRUE 1 [L95] state = s__state [L96] COND FALSE !(s__state == 12292) [L99] COND FALSE !(s__state == 16384) [L102] COND FALSE !(s__state == 4096) [L105] COND FALSE !(s__state == 20480) [L108] COND FALSE !(s__state == 4099) [L111] COND FALSE !(s__state == 4368) [L114] COND FALSE !(s__state == 4369) [L117] COND FALSE !(s__state == 4384) [L120] COND FALSE !(s__state == 4385) [L123] COND FALSE !(s__state == 4400) [L126] COND FALSE !(s__state == 4401) [L129] COND FALSE !(s__state == 4416) [L132] COND FALSE !(s__state == 4417) [L135] COND TRUE s__state == 4432 [L345] ret = __VERIFIER_nondet_int() [L346] COND FALSE !(blastFlag == 5) [L351] COND FALSE !(ret <= 0) [L356] s__state = ag_X ^ ag_Y [L357] s__init_num = 0 [L566] COND FALSE !(! s__s3__tmp__reuse_message) [L595] skip = 0 [L93] COND TRUE 1 [L95] state = s__state [L96] COND FALSE !(s__state == 12292) [L99] COND FALSE !(s__state == 16384) [L102] COND FALSE !(s__state == 4096) [L105] COND FALSE !(s__state == 20480) [L108] COND FALSE !(s__state == 4099) [L111] COND TRUE s__state == 4368 [L255] s__shutdown = 0 [L256] ret = __VERIFIER_nondet_int() [L257] COND FALSE !(blastFlag == 0) [L260] COND TRUE blastFlag == 4 [L261] blastFlag = 5 [L266] COND FALSE !(ret <= 0) [L271] s__state = 4384 [L272] s__init_num = 0 [L273] COND TRUE s__bbio != s__wbio [L566] COND FALSE !(! s__s3__tmp__reuse_message) [L595] skip = 0 [L93] COND TRUE 1 [L95] state = s__state [L96] COND FALSE !(s__state == 12292) [L99] COND FALSE !(s__state == 16384) [L102] COND FALSE !(s__state == 4096) [L105] COND FALSE !(s__state == 20480) [L108] COND FALSE !(s__state == 4099) [L111] COND FALSE !(s__state == 4368) [L114] COND FALSE !(s__state == 4369) [L117] COND TRUE s__state == 4384 [L281] ret = __VERIFIER_nondet_int() [L282] COND FALSE !(blastFlag == 1) [L287] COND FALSE !(ret <= 0) [L292] COND FALSE !(\read(s__hit)) [L295] s__state = 4400 [L297] s__init_num = 0 [L566] COND FALSE !(! s__s3__tmp__reuse_message) [L595] skip = 0 [L93] COND TRUE 1 [L95] state = s__state [L96] COND FALSE !(s__state == 12292) [L99] COND FALSE !(s__state == 16384) [L102] COND FALSE !(s__state == 4096) [L105] COND FALSE !(s__state == 20480) [L108] COND FALSE !(s__state == 4099) [L111] COND FALSE !(s__state == 4368) [L114] COND FALSE !(s__state == 4369) [L117] COND FALSE !(s__state == 4384) [L120] COND FALSE !(s__state == 4385) [L123] COND TRUE s__state == 4400 [L301] COND FALSE !((unsigned long )s__s3__tmp__new_cipher__algorithms - 256UL) [L304] ret = __VERIFIER_nondet_int() [L305] COND FALSE !(blastFlag == 2) [L310] COND FALSE !(ret <= 0) [L316] ag_Y = 61087 [L317] s__state = 4416 [L318] s__init_num = 0 [L566] COND FALSE !(! s__s3__tmp__reuse_message) [L595] skip = 0 [L93] COND TRUE 1 [L95] state = s__state [L96] COND FALSE !(s__state == 12292) [L99] COND FALSE !(s__state == 16384) [L102] COND FALSE !(s__state == 4096) [L105] COND FALSE !(s__state == 20480) [L108] COND FALSE !(s__state == 4099) [L111] COND FALSE !(s__state == 4368) [L114] COND FALSE !(s__state == 4369) [L117] COND FALSE !(s__state == 4384) [L120] COND FALSE !(s__state == 4385) [L123] COND FALSE !(s__state == 4400) [L126] COND FALSE !(s__state == 4401) [L129] COND TRUE s__state == 4416 [L322] ret = __VERIFIER_nondet_int() [L323] COND FALSE !(blastFlag == 3) [L328] COND FALSE !(ret <= 0) [L333] s__state = 4432 [L334] ag_X = (unsigned short)65535 [L335] s__init_num = 0 [L336] COND FALSE !(! tmp___6) [L566] COND FALSE !(! s__s3__tmp__reuse_message) [L595] skip = 0 [L93] COND TRUE 1 [L95] state = s__state [L96] COND FALSE !(s__state == 12292) [L99] COND FALSE !(s__state == 16384) [L102] COND FALSE !(s__state == 4096) [L105] COND FALSE !(s__state == 20480) [L108] COND FALSE !(s__state == 4099) [L111] COND FALSE !(s__state == 4368) [L114] COND FALSE !(s__state == 4369) [L117] COND FALSE !(s__state == 4384) [L120] COND FALSE !(s__state == 4385) [L123] COND FALSE !(s__state == 4400) [L126] COND FALSE !(s__state == 4401) [L129] COND FALSE !(s__state == 4416) [L132] COND FALSE !(s__state == 4417) [L135] COND TRUE s__state == 4432 [L345] ret = __VERIFIER_nondet_int() [L346] COND TRUE blastFlag == 5 [L608] __VERIFIER_error() - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 124 locations, 1 error locations. Result: UNSAFE, OverallTime: 3.7s, OverallIterations: 14, TraceHistogramMax: 11, AutomataDifference: 1.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 2411 SDtfs, 803 SDslu, 1336 SDs, 0 SdLazy, 884 SolverSat, 173 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 1.0s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 38 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=2363occurred in iteration=13, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.3s AutomataMinimizationTime, 13 MinimizatonAttempts, 93 StatesRemovedByMinimization, 8 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 0.6s InterpolantComputationTime, 1532 NumberOfCodeBlocks, 1532 NumberOfCodeBlocksAsserted, 14 NumberOfCheckSat, 1324 ConstructedInterpolants, 0 QuantifiedInterpolants, 420496 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 13 InterpolantComputations, 13 PerfectInterpolantSequences, 2562/2562 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces Received shutdown request... ### Bit-precise run ### This is Ultimate 0.1.24-cad4683 [2019-11-16 00:22:45,130 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-16 00:22:45,132 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-16 00:22:45,144 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-16 00:22:45,145 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-16 00:22:45,146 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-16 00:22:45,147 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-16 00:22:45,150 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-16 00:22:45,152 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-16 00:22:45,153 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-16 00:22:45,154 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-16 00:22:45,155 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-16 00:22:45,156 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-16 00:22:45,157 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-16 00:22:45,158 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-16 00:22:45,159 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-16 00:22:45,160 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-16 00:22:45,161 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-16 00:22:45,163 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-16 00:22:45,165 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-16 00:22:45,171 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-16 00:22:45,172 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-16 00:22:45,174 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-16 00:22:45,177 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-16 00:22:45,181 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-16 00:22:45,183 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-16 00:22:45,184 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-16 00:22:45,185 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-16 00:22:45,186 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-16 00:22:45,188 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-16 00:22:45,188 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-16 00:22:45,189 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-16 00:22:45,190 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-16 00:22:45,191 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-16 00:22:45,194 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-16 00:22:45,195 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-16 00:22:45,196 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-16 00:22:45,196 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-16 00:22:45,197 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-16 00:22:45,200 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-16 00:22:45,202 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-16 00:22:45,203 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_0b2d4ff1-9604-4d9d-a3bc-02e1265a2173/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2019-11-16 00:22:45,227 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-16 00:22:45,228 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-16 00:22:45,229 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-16 00:22:45,230 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-16 00:22:45,230 INFO L138 SettingsManager]: * Use SBE=true [2019-11-16 00:22:45,230 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-16 00:22:45,231 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-16 00:22:45,231 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-16 00:22:45,231 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-16 00:22:45,232 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-11-16 00:22:45,233 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-16 00:22:45,233 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-11-16 00:22:45,233 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2019-11-16 00:22:45,234 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2019-11-16 00:22:45,234 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-16 00:22:45,234 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-16 00:22:45,235 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-16 00:22:45,235 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-11-16 00:22:45,235 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-16 00:22:45,236 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-16 00:22:45,236 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-16 00:22:45,236 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-16 00:22:45,236 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-16 00:22:45,237 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-16 00:22:45,237 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-16 00:22:45,237 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-11-16 00:22:45,238 INFO L138 SettingsManager]: * Trace refinement strategy=WOLF [2019-11-16 00:22:45,238 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --rewrite-divk --print-success --lang smt [2019-11-16 00:22:45,238 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-11-16 00:22:45,238 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-11-16 00:22:45,239 INFO L138 SettingsManager]: * Logic for external solver=AUFBV Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /tmp/vcloud-vcloud-master/worker/run_dir_0b2d4ff1-9604-4d9d-a3bc-02e1265a2173/bin/uautomizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(__VERIFIER_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 1e9943d2199c95030d170f0541cc4df722deb62f [2019-11-16 00:22:45,318 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-16 00:22:45,329 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-16 00:22:45,334 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-16 00:22:45,336 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-16 00:22:45,336 INFO L275 PluginConnector]: CDTParser initialized [2019-11-16 00:22:45,338 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_0b2d4ff1-9604-4d9d-a3bc-02e1265a2173/bin/uautomizer/../../sv-benchmarks/c/bitvector/s3_clnt_2.BV.c.cil-1a.c [2019-11-16 00:22:45,405 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_0b2d4ff1-9604-4d9d-a3bc-02e1265a2173/bin/uautomizer/data/2144f2643/02c3d7f2bb964a76b078dfec9185e1ad/FLAG2707cdacc [2019-11-16 00:22:45,798 INFO L306 CDTParser]: Found 1 translation units. [2019-11-16 00:22:45,799 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_0b2d4ff1-9604-4d9d-a3bc-02e1265a2173/sv-benchmarks/c/bitvector/s3_clnt_2.BV.c.cil-1a.c [2019-11-16 00:22:45,809 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_0b2d4ff1-9604-4d9d-a3bc-02e1265a2173/bin/uautomizer/data/2144f2643/02c3d7f2bb964a76b078dfec9185e1ad/FLAG2707cdacc [2019-11-16 00:22:46,204 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_0b2d4ff1-9604-4d9d-a3bc-02e1265a2173/bin/uautomizer/data/2144f2643/02c3d7f2bb964a76b078dfec9185e1ad [2019-11-16 00:22:46,206 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-16 00:22:46,207 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-11-16 00:22:46,208 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-16 00:22:46,208 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-16 00:22:46,211 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-16 00:22:46,212 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.11 12:22:46" (1/1) ... [2019-11-16 00:22:46,214 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1d7b0951 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:22:46, skipping insertion in model container [2019-11-16 00:22:46,215 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.11 12:22:46" (1/1) ... [2019-11-16 00:22:46,221 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-11-16 00:22:46,273 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-11-16 00:22:46,472 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-16 00:22:46,475 INFO L188 MainTranslator]: Completed pre-run [2019-11-16 00:22:46,607 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-16 00:22:46,623 INFO L192 MainTranslator]: Completed translation [2019-11-16 00:22:46,623 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:22:46 WrapperNode [2019-11-16 00:22:46,623 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-16 00:22:46,624 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-11-16 00:22:46,624 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-11-16 00:22:46,624 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-11-16 00:22:46,631 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:22:46" (1/1) ... [2019-11-16 00:22:46,640 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:22:46" (1/1) ... [2019-11-16 00:22:46,676 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-11-16 00:22:46,676 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-16 00:22:46,676 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-16 00:22:46,676 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-16 00:22:46,685 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:22:46" (1/1) ... [2019-11-16 00:22:46,685 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:22:46" (1/1) ... [2019-11-16 00:22:46,689 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:22:46" (1/1) ... [2019-11-16 00:22:46,689 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:22:46" (1/1) ... [2019-11-16 00:22:46,699 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:22:46" (1/1) ... [2019-11-16 00:22:46,707 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:22:46" (1/1) ... [2019-11-16 00:22:46,716 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:22:46" (1/1) ... [2019-11-16 00:22:46,719 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-16 00:22:46,720 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-16 00:22:46,726 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-16 00:22:46,726 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-16 00:22:46,727 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:22:46" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_0b2d4ff1-9604-4d9d-a3bc-02e1265a2173/bin/uautomizer/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-16 00:22:46,777 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-16 00:22:46,777 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-16 00:22:46,884 WARN L732 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-11-16 00:22:47,490 INFO L685 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##85: assume !false; [2019-11-16 00:22:47,490 INFO L685 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##84: assume false; [2019-11-16 00:22:47,492 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-16 00:22:47,492 INFO L284 CfgBuilder]: Removed 7 assume(true) statements. [2019-11-16 00:22:47,493 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.11 12:22:47 BoogieIcfgContainer [2019-11-16 00:22:47,494 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-16 00:22:47,495 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-16 00:22:47,495 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-16 00:22:47,498 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-16 00:22:47,499 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 16.11 12:22:46" (1/3) ... [2019-11-16 00:22:47,500 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2762023b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.11 12:22:47, skipping insertion in model container [2019-11-16 00:22:47,500 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:22:46" (2/3) ... [2019-11-16 00:22:47,500 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2762023b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.11 12:22:47, skipping insertion in model container [2019-11-16 00:22:47,501 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.11 12:22:47" (3/3) ... [2019-11-16 00:22:47,502 INFO L109 eAbstractionObserver]: Analyzing ICFG s3_clnt_2.BV.c.cil-1a.c [2019-11-16 00:22:47,513 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-16 00:22:47,521 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-11-16 00:22:47,533 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-11-16 00:22:47,560 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-16 00:22:47,561 INFO L374 AbstractCegarLoop]: Hoare is true [2019-11-16 00:22:47,561 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-16 00:22:47,562 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-16 00:22:47,562 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-16 00:22:47,562 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-16 00:22:47,562 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-16 00:22:47,563 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-16 00:22:47,583 INFO L276 IsEmpty]: Start isEmpty. Operand 124 states. [2019-11-16 00:22:47,591 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2019-11-16 00:22:47,591 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:22:47,592 INFO L380 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] [2019-11-16 00:22:47,594 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:22:47,599 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:22:47,600 INFO L82 PathProgramCache]: Analyzing trace with hash -1449578949, now seen corresponding path program 1 times [2019-11-16 00:22:47,610 INFO L157 tionRefinementEngine]: Executing refinement strategy WOLF [2019-11-16 00:22:47,610 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [374900659] [2019-11-16 00:22:47,611 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_0b2d4ff1-9604-4d9d-a3bc-02e1265a2173/bin/uautomizer/cvc4 Starting monitored process 2 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-16 00:22:47,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:22:47,741 INFO L256 TraceCheckSpWp]: Trace formula consists of 58 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-16 00:22:47,747 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-16 00:22:47,803 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-16 00:22:47,804 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-11-16 00:22:47,819 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-16 00:22:47,821 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [374900659] [2019-11-16 00:22:47,821 INFO L223 tionRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:22:47,822 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [2, 2] imperfect sequences [] total 2 [2019-11-16 00:22:47,822 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [484841047] [2019-11-16 00:22:47,828 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-16 00:22:47,829 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-16 00:22:47,842 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-16 00:22:47,843 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-16 00:22:47,846 INFO L87 Difference]: Start difference. First operand 124 states. Second operand 3 states. [2019-11-16 00:22:48,078 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:22:48,078 INFO L93 Difference]: Finished difference Result 245 states and 420 transitions. [2019-11-16 00:22:48,078 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-16 00:22:48,079 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 23 [2019-11-16 00:22:48,080 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:22:48,089 INFO L225 Difference]: With dead ends: 245 [2019-11-16 00:22:48,089 INFO L226 Difference]: Without dead ends: 111 [2019-11-16 00:22:48,093 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 43 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-16 00:22:48,110 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111 states. [2019-11-16 00:22:48,131 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111 to 111. [2019-11-16 00:22:48,133 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 111 states. [2019-11-16 00:22:48,134 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111 states to 111 states and 168 transitions. [2019-11-16 00:22:48,136 INFO L78 Accepts]: Start accepts. Automaton has 111 states and 168 transitions. Word has length 23 [2019-11-16 00:22:48,136 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:22:48,136 INFO L462 AbstractCegarLoop]: Abstraction has 111 states and 168 transitions. [2019-11-16 00:22:48,137 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-16 00:22:48,137 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 168 transitions. [2019-11-16 00:22:48,139 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2019-11-16 00:22:48,139 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:22:48,139 INFO L380 BasicCegarLoop]: trace histogram [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] [2019-11-16 00:22:48,341 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-16 00:22:48,341 INFO L410 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:22:48,341 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:22:48,342 INFO L82 PathProgramCache]: Analyzing trace with hash 800883515, now seen corresponding path program 1 times [2019-11-16 00:22:48,342 INFO L157 tionRefinementEngine]: Executing refinement strategy WOLF [2019-11-16 00:22:48,343 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [670577065] [2019-11-16 00:22:48,343 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_0b2d4ff1-9604-4d9d-a3bc-02e1265a2173/bin/uautomizer/cvc4 Starting monitored process 3 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-16 00:22:48,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:22:48,441 INFO L256 TraceCheckSpWp]: Trace formula consists of 76 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-16 00:22:48,443 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-16 00:22:48,456 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-16 00:22:48,456 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-11-16 00:22:48,461 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-16 00:22:48,461 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [670577065] [2019-11-16 00:22:48,462 INFO L223 tionRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:22:48,462 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 3 [2019-11-16 00:22:48,462 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [138932750] [2019-11-16 00:22:48,464 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-16 00:22:48,464 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-16 00:22:48,464 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-16 00:22:48,464 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-16 00:22:48,465 INFO L87 Difference]: Start difference. First operand 111 states and 168 transitions. Second operand 3 states. [2019-11-16 00:22:48,658 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:22:48,658 INFO L93 Difference]: Finished difference Result 232 states and 355 transitions. [2019-11-16 00:22:48,659 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-16 00:22:48,659 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 35 [2019-11-16 00:22:48,659 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:22:48,661 INFO L225 Difference]: With dead ends: 232 [2019-11-16 00:22:48,661 INFO L226 Difference]: Without dead ends: 130 [2019-11-16 00:22:48,663 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 67 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-16 00:22:48,663 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 130 states. [2019-11-16 00:22:48,686 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 130 to 126. [2019-11-16 00:22:48,687 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 126 states. [2019-11-16 00:22:48,690 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 126 states to 126 states and 188 transitions. [2019-11-16 00:22:48,691 INFO L78 Accepts]: Start accepts. Automaton has 126 states and 188 transitions. Word has length 35 [2019-11-16 00:22:48,691 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:22:48,692 INFO L462 AbstractCegarLoop]: Abstraction has 126 states and 188 transitions. [2019-11-16 00:22:48,692 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-16 00:22:48,693 INFO L276 IsEmpty]: Start isEmpty. Operand 126 states and 188 transitions. [2019-11-16 00:22:48,696 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2019-11-16 00:22:48,697 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:22:48,697 INFO L380 BasicCegarLoop]: trace histogram [3, 3, 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] [2019-11-16 00:22:48,907 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-16 00:22:48,908 INFO L410 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:22:48,911 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:22:48,912 INFO L82 PathProgramCache]: Analyzing trace with hash 1711238340, now seen corresponding path program 1 times [2019-11-16 00:22:48,912 INFO L157 tionRefinementEngine]: Executing refinement strategy WOLF [2019-11-16 00:22:48,913 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [1808831841] [2019-11-16 00:22:48,914 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_0b2d4ff1-9604-4d9d-a3bc-02e1265a2173/bin/uautomizer/cvc4 Starting monitored process 4 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-16 00:22:49,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:22:49,022 INFO L256 TraceCheckSpWp]: Trace formula consists of 94 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-16 00:22:49,025 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-16 00:22:49,041 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 13 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-11-16 00:22:49,043 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-11-16 00:22:49,053 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 13 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-11-16 00:22:49,055 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1808831841] [2019-11-16 00:22:49,055 INFO L223 tionRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:22:49,056 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 3 [2019-11-16 00:22:49,056 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2074390314] [2019-11-16 00:22:49,058 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-16 00:22:49,058 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-16 00:22:49,058 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-16 00:22:49,066 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-16 00:22:49,067 INFO L87 Difference]: Start difference. First operand 126 states and 188 transitions. Second operand 3 states. [2019-11-16 00:22:49,244 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:22:49,244 INFO L93 Difference]: Finished difference Result 264 states and 399 transitions. [2019-11-16 00:22:49,244 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-16 00:22:49,245 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 49 [2019-11-16 00:22:49,245 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:22:49,247 INFO L225 Difference]: With dead ends: 264 [2019-11-16 00:22:49,247 INFO L226 Difference]: Without dead ends: 147 [2019-11-16 00:22:49,248 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 96 GetRequests, 95 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-16 00:22:49,252 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 147 states. [2019-11-16 00:22:49,268 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 147 to 143. [2019-11-16 00:22:49,269 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 143 states. [2019-11-16 00:22:49,270 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 143 states to 143 states and 210 transitions. [2019-11-16 00:22:49,270 INFO L78 Accepts]: Start accepts. Automaton has 143 states and 210 transitions. Word has length 49 [2019-11-16 00:22:49,271 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:22:49,271 INFO L462 AbstractCegarLoop]: Abstraction has 143 states and 210 transitions. [2019-11-16 00:22:49,271 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-16 00:22:49,271 INFO L276 IsEmpty]: Start isEmpty. Operand 143 states and 210 transitions. [2019-11-16 00:22:49,277 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-11-16 00:22:49,279 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:22:49,279 INFO L380 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 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] [2019-11-16 00:22:49,479 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-16 00:22:49,480 INFO L410 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:22:49,480 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:22:49,480 INFO L82 PathProgramCache]: Analyzing trace with hash -1841896084, now seen corresponding path program 1 times [2019-11-16 00:22:49,480 INFO L157 tionRefinementEngine]: Executing refinement strategy WOLF [2019-11-16 00:22:49,481 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [2049071250] [2019-11-16 00:22:49,481 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_0b2d4ff1-9604-4d9d-a3bc-02e1265a2173/bin/uautomizer/cvc4 Starting monitored process 5 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-16 00:22:49,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:22:49,577 INFO L256 TraceCheckSpWp]: Trace formula consists of 112 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-16 00:22:49,580 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-16 00:22:49,602 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 38 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-11-16 00:22:49,602 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-11-16 00:22:49,613 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 38 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-11-16 00:22:49,613 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [2049071250] [2019-11-16 00:22:49,614 INFO L223 tionRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:22:49,614 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 3 [2019-11-16 00:22:49,614 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [262438159] [2019-11-16 00:22:49,615 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-16 00:22:49,615 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-16 00:22:49,615 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-16 00:22:49,616 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-16 00:22:49,616 INFO L87 Difference]: Start difference. First operand 143 states and 210 transitions. Second operand 3 states. [2019-11-16 00:22:49,644 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:22:49,644 INFO L93 Difference]: Finished difference Result 298 states and 435 transitions. [2019-11-16 00:22:49,645 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-16 00:22:49,645 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 66 [2019-11-16 00:22:49,645 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:22:49,647 INFO L225 Difference]: With dead ends: 298 [2019-11-16 00:22:49,647 INFO L226 Difference]: Without dead ends: 164 [2019-11-16 00:22:49,648 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 130 GetRequests, 129 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-16 00:22:49,649 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 164 states. [2019-11-16 00:22:49,661 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 164 to 164. [2019-11-16 00:22:49,661 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 164 states. [2019-11-16 00:22:49,662 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 164 states to 164 states and 237 transitions. [2019-11-16 00:22:49,662 INFO L78 Accepts]: Start accepts. Automaton has 164 states and 237 transitions. Word has length 66 [2019-11-16 00:22:49,663 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:22:49,663 INFO L462 AbstractCegarLoop]: Abstraction has 164 states and 237 transitions. [2019-11-16 00:22:49,663 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-16 00:22:49,663 INFO L276 IsEmpty]: Start isEmpty. Operand 164 states and 237 transitions. [2019-11-16 00:22:49,665 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-11-16 00:22:49,665 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:22:49,665 INFO L380 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 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] [2019-11-16 00:22:49,867 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-16 00:22:49,867 INFO L410 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:22:49,867 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:22:49,867 INFO L82 PathProgramCache]: Analyzing trace with hash -1982444694, now seen corresponding path program 1 times [2019-11-16 00:22:49,868 INFO L157 tionRefinementEngine]: Executing refinement strategy WOLF [2019-11-16 00:22:49,868 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [1447769941] [2019-11-16 00:22:49,868 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_0b2d4ff1-9604-4d9d-a3bc-02e1265a2173/bin/uautomizer/cvc4 Starting monitored process 6 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-16 00:22:49,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:22:49,966 INFO L256 TraceCheckSpWp]: Trace formula consists of 113 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-16 00:22:49,969 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-16 00:22:49,982 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 25 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2019-11-16 00:22:49,983 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-11-16 00:22:49,999 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 25 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2019-11-16 00:22:50,000 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1447769941] [2019-11-16 00:22:50,000 INFO L223 tionRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:22:50,000 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 4 [2019-11-16 00:22:50,001 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [715194781] [2019-11-16 00:22:50,001 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-16 00:22:50,001 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-16 00:22:50,002 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-16 00:22:50,002 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-16 00:22:50,002 INFO L87 Difference]: Start difference. First operand 164 states and 237 transitions. Second operand 4 states. [2019-11-16 00:22:50,075 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:22:50,075 INFO L93 Difference]: Finished difference Result 581 states and 851 transitions. [2019-11-16 00:22:50,076 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-16 00:22:50,076 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 66 [2019-11-16 00:22:50,077 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:22:50,080 INFO L225 Difference]: With dead ends: 581 [2019-11-16 00:22:50,080 INFO L226 Difference]: Without dead ends: 426 [2019-11-16 00:22:50,081 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 130 GetRequests, 128 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-16 00:22:50,082 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 426 states. [2019-11-16 00:22:50,104 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 426 to 426. [2019-11-16 00:22:50,104 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 426 states. [2019-11-16 00:22:50,106 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 426 states to 426 states and 620 transitions. [2019-11-16 00:22:50,107 INFO L78 Accepts]: Start accepts. Automaton has 426 states and 620 transitions. Word has length 66 [2019-11-16 00:22:50,107 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:22:50,108 INFO L462 AbstractCegarLoop]: Abstraction has 426 states and 620 transitions. [2019-11-16 00:22:50,108 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-16 00:22:50,108 INFO L276 IsEmpty]: Start isEmpty. Operand 426 states and 620 transitions. [2019-11-16 00:22:50,109 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-11-16 00:22:50,109 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:22:50,110 INFO L380 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 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] [2019-11-16 00:22:50,312 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-16 00:22:50,313 INFO L410 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:22:50,313 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:22:50,313 INFO L82 PathProgramCache]: Analyzing trace with hash -942138300, now seen corresponding path program 1 times [2019-11-16 00:22:50,313 INFO L157 tionRefinementEngine]: Executing refinement strategy WOLF [2019-11-16 00:22:50,313 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [664484393] [2019-11-16 00:22:50,314 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_0b2d4ff1-9604-4d9d-a3bc-02e1265a2173/bin/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 [2019-11-16 00:22:50,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:22:50,398 INFO L256 TraceCheckSpWp]: Trace formula consists of 113 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-16 00:22:50,401 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-16 00:22:50,441 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 26 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2019-11-16 00:22:50,441 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-11-16 00:22:50,452 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 26 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2019-11-16 00:22:50,453 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [664484393] [2019-11-16 00:22:50,453 INFO L223 tionRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:22:50,453 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [2, 2] imperfect sequences [] total 2 [2019-11-16 00:22:50,453 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2124748971] [2019-11-16 00:22:50,454 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-16 00:22:50,454 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-16 00:22:50,454 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-16 00:22:50,455 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-16 00:22:50,455 INFO L87 Difference]: Start difference. First operand 426 states and 620 transitions. Second operand 3 states. [2019-11-16 00:22:50,488 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:22:50,488 INFO L93 Difference]: Finished difference Result 869 states and 1261 transitions. [2019-11-16 00:22:50,489 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-16 00:22:50,489 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 67 [2019-11-16 00:22:50,489 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:22:50,492 INFO L225 Difference]: With dead ends: 869 [2019-11-16 00:22:50,492 INFO L226 Difference]: Without dead ends: 452 [2019-11-16 00:22:50,493 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 132 GetRequests, 131 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-16 00:22:50,494 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 452 states. [2019-11-16 00:22:50,509 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 452 to 452. [2019-11-16 00:22:50,509 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 452 states. [2019-11-16 00:22:50,511 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 452 states to 452 states and 653 transitions. [2019-11-16 00:22:50,512 INFO L78 Accepts]: Start accepts. Automaton has 452 states and 653 transitions. Word has length 67 [2019-11-16 00:22:50,512 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:22:50,512 INFO L462 AbstractCegarLoop]: Abstraction has 452 states and 653 transitions. [2019-11-16 00:22:50,512 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-16 00:22:50,512 INFO L276 IsEmpty]: Start isEmpty. Operand 452 states and 653 transitions. [2019-11-16 00:22:50,514 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2019-11-16 00:22:50,514 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:22:50,515 INFO L380 BasicCegarLoop]: trace histogram [7, 7, 6, 6, 6, 6, 6, 6, 6, 4, 4, 2, 2, 2, 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] [2019-11-16 00:22:50,717 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-16 00:22:50,722 INFO L410 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:22:50,722 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:22:50,722 INFO L82 PathProgramCache]: Analyzing trace with hash -2029292557, now seen corresponding path program 1 times [2019-11-16 00:22:50,723 INFO L157 tionRefinementEngine]: Executing refinement strategy WOLF [2019-11-16 00:22:50,723 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [873520900] [2019-11-16 00:22:50,723 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_0b2d4ff1-9604-4d9d-a3bc-02e1265a2173/bin/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 [2019-11-16 00:22:50,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:22:50,845 INFO L256 TraceCheckSpWp]: Trace formula consists of 172 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-16 00:22:50,847 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-16 00:22:50,876 INFO L134 CoverageAnalysis]: Checked inductivity of 191 backedges. 143 proven. 0 refuted. 0 times theorem prover too weak. 48 trivial. 0 not checked. [2019-11-16 00:22:50,877 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-11-16 00:22:50,895 INFO L134 CoverageAnalysis]: Checked inductivity of 191 backedges. 143 proven. 0 refuted. 0 times theorem prover too weak. 48 trivial. 0 not checked. [2019-11-16 00:22:50,896 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [873520900] [2019-11-16 00:22:50,896 INFO L223 tionRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:22:50,896 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 4 [2019-11-16 00:22:50,897 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1543200542] [2019-11-16 00:22:50,897 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-16 00:22:50,897 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-16 00:22:50,898 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-16 00:22:50,898 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-16 00:22:50,898 INFO L87 Difference]: Start difference. First operand 452 states and 653 transitions. Second operand 4 states. [2019-11-16 00:22:51,188 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:22:51,188 INFO L93 Difference]: Finished difference Result 1066 states and 1615 transitions. [2019-11-16 00:22:51,190 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-16 00:22:51,190 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 116 [2019-11-16 00:22:51,191 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:22:51,195 INFO L225 Difference]: With dead ends: 1066 [2019-11-16 00:22:51,196 INFO L226 Difference]: Without dead ends: 649 [2019-11-16 00:22:51,196 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 230 GetRequests, 228 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-16 00:22:51,198 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 649 states. [2019-11-16 00:22:51,223 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 649 to 629. [2019-11-16 00:22:51,224 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 629 states. [2019-11-16 00:22:51,227 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 629 states to 629 states and 887 transitions. [2019-11-16 00:22:51,228 INFO L78 Accepts]: Start accepts. Automaton has 629 states and 887 transitions. Word has length 116 [2019-11-16 00:22:51,229 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:22:51,229 INFO L462 AbstractCegarLoop]: Abstraction has 629 states and 887 transitions. [2019-11-16 00:22:51,229 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-16 00:22:51,230 INFO L276 IsEmpty]: Start isEmpty. Operand 629 states and 887 transitions. [2019-11-16 00:22:51,233 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2019-11-16 00:22:51,233 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:22:51,233 INFO L380 BasicCegarLoop]: trace histogram [7, 7, 6, 6, 6, 6, 6, 6, 6, 4, 4, 2, 2, 2, 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] [2019-11-16 00:22:51,436 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-16 00:22:51,436 INFO L410 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:22:51,437 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:22:51,437 INFO L82 PathProgramCache]: Analyzing trace with hash -1450806153, now seen corresponding path program 1 times [2019-11-16 00:22:51,437 INFO L157 tionRefinementEngine]: Executing refinement strategy WOLF [2019-11-16 00:22:51,437 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [1042674834] [2019-11-16 00:22:51,437 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_0b2d4ff1-9604-4d9d-a3bc-02e1265a2173/bin/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 [2019-11-16 00:22:51,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:22:51,526 INFO L256 TraceCheckSpWp]: Trace formula consists of 172 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-16 00:22:51,528 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-16 00:22:51,544 INFO L134 CoverageAnalysis]: Checked inductivity of 191 backedges. 62 proven. 0 refuted. 0 times theorem prover too weak. 129 trivial. 0 not checked. [2019-11-16 00:22:51,545 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-11-16 00:22:51,558 INFO L134 CoverageAnalysis]: Checked inductivity of 191 backedges. 62 proven. 0 refuted. 0 times theorem prover too weak. 129 trivial. 0 not checked. [2019-11-16 00:22:51,558 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1042674834] [2019-11-16 00:22:51,559 INFO L223 tionRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:22:51,559 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 3 [2019-11-16 00:22:51,559 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1459960033] [2019-11-16 00:22:51,560 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-16 00:22:51,560 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-16 00:22:51,560 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-16 00:22:51,560 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-16 00:22:51,560 INFO L87 Difference]: Start difference. First operand 629 states and 887 transitions. Second operand 3 states. [2019-11-16 00:22:51,722 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:22:51,722 INFO L93 Difference]: Finished difference Result 1291 states and 1846 transitions. [2019-11-16 00:22:51,723 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-16 00:22:51,723 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 116 [2019-11-16 00:22:51,723 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:22:51,727 INFO L225 Difference]: With dead ends: 1291 [2019-11-16 00:22:51,727 INFO L226 Difference]: Without dead ends: 697 [2019-11-16 00:22:51,729 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 230 GetRequests, 229 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-16 00:22:51,730 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 697 states. [2019-11-16 00:22:51,746 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 697 to 686. [2019-11-16 00:22:51,746 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 686 states. [2019-11-16 00:22:51,749 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 686 states to 686 states and 959 transitions. [2019-11-16 00:22:51,749 INFO L78 Accepts]: Start accepts. Automaton has 686 states and 959 transitions. Word has length 116 [2019-11-16 00:22:51,750 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:22:51,750 INFO L462 AbstractCegarLoop]: Abstraction has 686 states and 959 transitions. [2019-11-16 00:22:51,750 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-16 00:22:51,750 INFO L276 IsEmpty]: Start isEmpty. Operand 686 states and 959 transitions. [2019-11-16 00:22:51,753 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2019-11-16 00:22:51,753 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:22:51,753 INFO L380 BasicCegarLoop]: trace histogram [8, 8, 7, 7, 7, 7, 7, 7, 7, 5, 5, 3, 3, 2, 2, 2, 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] [2019-11-16 00:22:51,959 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-16 00:22:51,959 INFO L410 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:22:51,959 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:22:51,959 INFO L82 PathProgramCache]: Analyzing trace with hash 1686782797, now seen corresponding path program 1 times [2019-11-16 00:22:51,960 INFO L157 tionRefinementEngine]: Executing refinement strategy WOLF [2019-11-16 00:22:51,960 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [57541268] [2019-11-16 00:22:51,960 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_0b2d4ff1-9604-4d9d-a3bc-02e1265a2173/bin/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 [2019-11-16 00:22:52,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:22:52,059 INFO L256 TraceCheckSpWp]: Trace formula consists of 191 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-16 00:22:52,061 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-16 00:22:52,091 INFO L134 CoverageAnalysis]: Checked inductivity of 268 backedges. 195 proven. 0 refuted. 0 times theorem prover too weak. 73 trivial. 0 not checked. [2019-11-16 00:22:52,091 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-11-16 00:22:52,109 INFO L134 CoverageAnalysis]: Checked inductivity of 268 backedges. 195 proven. 0 refuted. 0 times theorem prover too weak. 73 trivial. 0 not checked. [2019-11-16 00:22:52,110 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [57541268] [2019-11-16 00:22:52,110 INFO L223 tionRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:22:52,110 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 3 [2019-11-16 00:22:52,110 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1152000885] [2019-11-16 00:22:52,111 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-16 00:22:52,111 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-16 00:22:52,111 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-16 00:22:52,112 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-16 00:22:52,112 INFO L87 Difference]: Start difference. First operand 686 states and 959 transitions. Second operand 3 states. [2019-11-16 00:22:52,148 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:22:52,148 INFO L93 Difference]: Finished difference Result 1565 states and 2188 transitions. [2019-11-16 00:22:52,150 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-16 00:22:52,150 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 132 [2019-11-16 00:22:52,151 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:22:52,156 INFO L225 Difference]: With dead ends: 1565 [2019-11-16 00:22:52,156 INFO L226 Difference]: Without dead ends: 914 [2019-11-16 00:22:52,157 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 262 GetRequests, 261 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-16 00:22:52,159 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 914 states. [2019-11-16 00:22:52,185 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 914 to 914. [2019-11-16 00:22:52,185 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 914 states. [2019-11-16 00:22:52,189 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 914 states to 914 states and 1272 transitions. [2019-11-16 00:22:52,189 INFO L78 Accepts]: Start accepts. Automaton has 914 states and 1272 transitions. Word has length 132 [2019-11-16 00:22:52,189 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:22:52,190 INFO L462 AbstractCegarLoop]: Abstraction has 914 states and 1272 transitions. [2019-11-16 00:22:52,190 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-16 00:22:52,190 INFO L276 IsEmpty]: Start isEmpty. Operand 914 states and 1272 transitions. [2019-11-16 00:22:52,192 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2019-11-16 00:22:52,192 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:22:52,193 INFO L380 BasicCegarLoop]: trace histogram [8, 8, 7, 7, 7, 7, 7, 7, 7, 5, 5, 3, 3, 2, 2, 2, 2, 2, 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] [2019-11-16 00:22:52,394 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-16 00:22:52,395 INFO L410 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:22:52,395 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:22:52,395 INFO L82 PathProgramCache]: Analyzing trace with hash -1283173259, now seen corresponding path program 1 times [2019-11-16 00:22:52,396 INFO L157 tionRefinementEngine]: Executing refinement strategy WOLF [2019-11-16 00:22:52,396 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [4378642] [2019-11-16 00:22:52,396 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_0b2d4ff1-9604-4d9d-a3bc-02e1265a2173/bin/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 [2019-11-16 00:22:52,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:22:52,512 INFO L256 TraceCheckSpWp]: Trace formula consists of 193 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-16 00:22:52,514 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-16 00:22:52,541 INFO L134 CoverageAnalysis]: Checked inductivity of 270 backedges. 75 proven. 0 refuted. 0 times theorem prover too weak. 195 trivial. 0 not checked. [2019-11-16 00:22:52,541 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-11-16 00:22:52,564 INFO L134 CoverageAnalysis]: Checked inductivity of 270 backedges. 75 proven. 0 refuted. 0 times theorem prover too weak. 195 trivial. 0 not checked. [2019-11-16 00:22:52,565 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [4378642] [2019-11-16 00:22:52,565 INFO L223 tionRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:22:52,565 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 3 [2019-11-16 00:22:52,565 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [20685284] [2019-11-16 00:22:52,566 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-16 00:22:52,566 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-16 00:22:52,566 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-16 00:22:52,567 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-16 00:22:52,567 INFO L87 Difference]: Start difference. First operand 914 states and 1272 transitions. Second operand 3 states. [2019-11-16 00:22:52,764 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:22:52,766 INFO L93 Difference]: Finished difference Result 1847 states and 2596 transitions. [2019-11-16 00:22:52,767 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-16 00:22:52,767 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 134 [2019-11-16 00:22:52,767 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:22:52,773 INFO L225 Difference]: With dead ends: 1847 [2019-11-16 00:22:52,773 INFO L226 Difference]: Without dead ends: 989 [2019-11-16 00:22:52,775 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 266 GetRequests, 265 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-16 00:22:52,777 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 989 states. [2019-11-16 00:22:52,803 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 989 to 977. [2019-11-16 00:22:52,803 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 977 states. [2019-11-16 00:22:52,807 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 977 states to 977 states and 1350 transitions. [2019-11-16 00:22:52,807 INFO L78 Accepts]: Start accepts. Automaton has 977 states and 1350 transitions. Word has length 134 [2019-11-16 00:22:52,807 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:22:52,807 INFO L462 AbstractCegarLoop]: Abstraction has 977 states and 1350 transitions. [2019-11-16 00:22:52,808 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-16 00:22:52,808 INFO L276 IsEmpty]: Start isEmpty. Operand 977 states and 1350 transitions. [2019-11-16 00:22:52,811 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 175 [2019-11-16 00:22:52,811 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:22:52,811 INFO L380 BasicCegarLoop]: trace histogram [9, 9, 8, 8, 8, 8, 8, 8, 8, 6, 6, 4, 4, 3, 3, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1] [2019-11-16 00:22:53,022 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-16 00:22:53,022 INFO L410 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:22:53,023 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:22:53,023 INFO L82 PathProgramCache]: Analyzing trace with hash 204159321, now seen corresponding path program 1 times [2019-11-16 00:22:53,023 INFO L157 tionRefinementEngine]: Executing refinement strategy WOLF [2019-11-16 00:22:53,023 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [793117335] [2019-11-16 00:22:53,023 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_0b2d4ff1-9604-4d9d-a3bc-02e1265a2173/bin/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 [2019-11-16 00:22:53,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:22:53,132 INFO L256 TraceCheckSpWp]: Trace formula consists of 235 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-16 00:22:53,134 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-16 00:22:53,167 INFO L134 CoverageAnalysis]: Checked inductivity of 363 backedges. 173 proven. 0 refuted. 0 times theorem prover too weak. 190 trivial. 0 not checked. [2019-11-16 00:22:53,167 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-11-16 00:22:53,193 INFO L134 CoverageAnalysis]: Checked inductivity of 363 backedges. 173 proven. 0 refuted. 0 times theorem prover too weak. 190 trivial. 0 not checked. [2019-11-16 00:22:53,194 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [793117335] [2019-11-16 00:22:53,194 INFO L223 tionRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:22:53,194 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 3 [2019-11-16 00:22:53,194 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1752786875] [2019-11-16 00:22:53,195 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-16 00:22:53,195 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-16 00:22:53,195 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-16 00:22:53,195 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-16 00:22:53,196 INFO L87 Difference]: Start difference. First operand 977 states and 1350 transitions. Second operand 3 states. [2019-11-16 00:22:53,243 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:22:53,244 INFO L93 Difference]: Finished difference Result 2432 states and 3404 transitions. [2019-11-16 00:22:53,244 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-16 00:22:53,244 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 174 [2019-11-16 00:22:53,245 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:22:53,252 INFO L225 Difference]: With dead ends: 2432 [2019-11-16 00:22:53,252 INFO L226 Difference]: Without dead ends: 1511 [2019-11-16 00:22:53,254 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 346 GetRequests, 345 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-16 00:22:53,256 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1511 states. [2019-11-16 00:22:53,295 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1511 to 1509. [2019-11-16 00:22:53,295 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1509 states. [2019-11-16 00:22:53,300 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1509 states to 1509 states and 2114 transitions. [2019-11-16 00:22:53,300 INFO L78 Accepts]: Start accepts. Automaton has 1509 states and 2114 transitions. Word has length 174 [2019-11-16 00:22:53,301 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:22:53,301 INFO L462 AbstractCegarLoop]: Abstraction has 1509 states and 2114 transitions. [2019-11-16 00:22:53,301 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-16 00:22:53,301 INFO L276 IsEmpty]: Start isEmpty. Operand 1509 states and 2114 transitions. [2019-11-16 00:22:53,305 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 175 [2019-11-16 00:22:53,305 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:22:53,305 INFO L380 BasicCegarLoop]: trace histogram [9, 9, 8, 8, 8, 8, 8, 8, 8, 6, 6, 4, 4, 3, 3, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1] [2019-11-16 00:22:53,507 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-16 00:22:53,508 INFO L410 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:22:53,508 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:22:53,508 INFO L82 PathProgramCache]: Analyzing trace with hash 2009597655, now seen corresponding path program 1 times [2019-11-16 00:22:53,508 INFO L157 tionRefinementEngine]: Executing refinement strategy WOLF [2019-11-16 00:22:53,509 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [551106388] [2019-11-16 00:22:53,509 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_0b2d4ff1-9604-4d9d-a3bc-02e1265a2173/bin/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 [2019-11-16 00:22:53,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:22:53,636 INFO L256 TraceCheckSpWp]: Trace formula consists of 235 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-16 00:22:53,639 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-16 00:22:53,676 INFO L134 CoverageAnalysis]: Checked inductivity of 363 backedges. 226 proven. 0 refuted. 0 times theorem prover too weak. 137 trivial. 0 not checked. [2019-11-16 00:22:53,677 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-11-16 00:22:53,706 INFO L134 CoverageAnalysis]: Checked inductivity of 363 backedges. 226 proven. 0 refuted. 0 times theorem prover too weak. 137 trivial. 0 not checked. [2019-11-16 00:22:53,707 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [551106388] [2019-11-16 00:22:53,707 INFO L223 tionRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:22:53,707 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 3 [2019-11-16 00:22:53,707 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [17218627] [2019-11-16 00:22:53,708 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-16 00:22:53,708 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-16 00:22:53,708 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-16 00:22:53,709 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-16 00:22:53,709 INFO L87 Difference]: Start difference. First operand 1509 states and 2114 transitions. Second operand 3 states. [2019-11-16 00:22:53,753 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:22:53,753 INFO L93 Difference]: Finished difference Result 2354 states and 3283 transitions. [2019-11-16 00:22:53,754 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-16 00:22:53,754 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 174 [2019-11-16 00:22:53,754 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:22:53,762 INFO L225 Difference]: With dead ends: 2354 [2019-11-16 00:22:53,762 INFO L226 Difference]: Without dead ends: 1513 [2019-11-16 00:22:53,764 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 346 GetRequests, 345 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-16 00:22:53,766 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1513 states. [2019-11-16 00:22:53,804 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1513 to 1511. [2019-11-16 00:22:53,804 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1511 states. [2019-11-16 00:22:53,809 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1511 states to 1511 states and 2107 transitions. [2019-11-16 00:22:53,810 INFO L78 Accepts]: Start accepts. Automaton has 1511 states and 2107 transitions. Word has length 174 [2019-11-16 00:22:53,810 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:22:53,810 INFO L462 AbstractCegarLoop]: Abstraction has 1511 states and 2107 transitions. [2019-11-16 00:22:53,810 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-16 00:22:53,810 INFO L276 IsEmpty]: Start isEmpty. Operand 1511 states and 2107 transitions. [2019-11-16 00:22:53,814 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 175 [2019-11-16 00:22:53,814 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:22:53,814 INFO L380 BasicCegarLoop]: trace histogram [10, 10, 9, 9, 9, 9, 9, 9, 9, 7, 7, 5, 5, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2019-11-16 00:22:54,022 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-16 00:22:54,022 INFO L410 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:22:54,022 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:22:54,022 INFO L82 PathProgramCache]: Analyzing trace with hash 1462336803, now seen corresponding path program 1 times [2019-11-16 00:22:54,023 INFO L157 tionRefinementEngine]: Executing refinement strategy WOLF [2019-11-16 00:22:54,023 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [1036879816] [2019-11-16 00:22:54,023 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_0b2d4ff1-9604-4d9d-a3bc-02e1265a2173/bin/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 [2019-11-16 00:22:54,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:22:54,133 INFO L256 TraceCheckSpWp]: Trace formula consists of 240 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-16 00:22:54,135 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-16 00:22:54,162 INFO L134 CoverageAnalysis]: Checked inductivity of 472 backedges. 312 proven. 0 refuted. 0 times theorem prover too weak. 160 trivial. 0 not checked. [2019-11-16 00:22:54,162 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-11-16 00:22:54,203 INFO L134 CoverageAnalysis]: Checked inductivity of 472 backedges. 312 proven. 0 refuted. 0 times theorem prover too weak. 160 trivial. 0 not checked. [2019-11-16 00:22:54,204 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1036879816] [2019-11-16 00:22:54,204 INFO L223 tionRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:22:54,204 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 4 [2019-11-16 00:22:54,205 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [91984381] [2019-11-16 00:22:54,205 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-16 00:22:54,205 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-16 00:22:54,206 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-16 00:22:54,206 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-16 00:22:54,206 INFO L87 Difference]: Start difference. First operand 1511 states and 2107 transitions. Second operand 4 states. [2019-11-16 00:22:54,505 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:22:54,505 INFO L93 Difference]: Finished difference Result 3056 states and 4299 transitions. [2019-11-16 00:22:54,506 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-16 00:22:54,506 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 174 [2019-11-16 00:22:54,506 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:22:54,514 INFO L225 Difference]: With dead ends: 3056 [2019-11-16 00:22:54,515 INFO L226 Difference]: Without dead ends: 1603 [2019-11-16 00:22:54,517 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 346 GetRequests, 344 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-16 00:22:54,519 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1603 states. [2019-11-16 00:22:54,563 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1603 to 1557. [2019-11-16 00:22:54,563 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1557 states. [2019-11-16 00:22:54,567 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1557 states to 1557 states and 2119 transitions. [2019-11-16 00:22:54,568 INFO L78 Accepts]: Start accepts. Automaton has 1557 states and 2119 transitions. Word has length 174 [2019-11-16 00:22:54,568 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:22:54,568 INFO L462 AbstractCegarLoop]: Abstraction has 1557 states and 2119 transitions. [2019-11-16 00:22:54,568 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-16 00:22:54,568 INFO L276 IsEmpty]: Start isEmpty. Operand 1557 states and 2119 transitions. [2019-11-16 00:22:54,572 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 196 [2019-11-16 00:22:54,572 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:22:54,572 INFO L380 BasicCegarLoop]: trace histogram [11, 11, 10, 10, 10, 10, 10, 10, 10, 8, 8, 6, 6, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2019-11-16 00:22:54,774 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-16 00:22:54,775 INFO L410 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:22:54,775 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:22:54,775 INFO L82 PathProgramCache]: Analyzing trace with hash -403372922, now seen corresponding path program 1 times [2019-11-16 00:22:54,776 INFO L157 tionRefinementEngine]: Executing refinement strategy WOLF [2019-11-16 00:22:54,777 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [92761976] [2019-11-16 00:22:54,777 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_0b2d4ff1-9604-4d9d-a3bc-02e1265a2173/bin/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 [2019-11-16 00:22:54,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:22:54,993 INFO L256 TraceCheckSpWp]: Trace formula consists of 263 conjuncts, 4 conjunts are in the unsatisfiable core [2019-11-16 00:22:54,995 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-16 00:22:55,055 INFO L134 CoverageAnalysis]: Checked inductivity of 599 backedges. 458 proven. 20 refuted. 0 times theorem prover too weak. 121 trivial. 0 not checked. [2019-11-16 00:22:55,055 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-11-16 00:22:55,125 INFO L134 CoverageAnalysis]: Checked inductivity of 599 backedges. 442 proven. 36 refuted. 0 times theorem prover too weak. 121 trivial. 0 not checked. [2019-11-16 00:22:55,125 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [92761976] [2019-11-16 00:22:55,126 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-16 00:22:55,126 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 8 [2019-11-16 00:22:55,126 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1861849630] [2019-11-16 00:22:55,127 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-11-16 00:22:55,127 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-16 00:22:55,127 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-11-16 00:22:55,127 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2019-11-16 00:22:55,128 INFO L87 Difference]: Start difference. First operand 1557 states and 2119 transitions. Second operand 8 states. [2019-11-16 00:22:55,982 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:22:55,982 INFO L93 Difference]: Finished difference Result 3568 states and 4898 transitions. [2019-11-16 00:22:55,983 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-11-16 00:22:55,983 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 195 [2019-11-16 00:22:55,983 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:22:55,994 INFO L225 Difference]: With dead ends: 3568 [2019-11-16 00:22:55,994 INFO L226 Difference]: Without dead ends: 2069 [2019-11-16 00:22:55,998 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 394 GetRequests, 385 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=41, Invalid=69, Unknown=0, NotChecked=0, Total=110 [2019-11-16 00:22:56,001 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2069 states. [2019-11-16 00:22:56,052 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2069 to 1891. [2019-11-16 00:22:56,053 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1891 states. [2019-11-16 00:22:56,056 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1891 states to 1891 states and 2555 transitions. [2019-11-16 00:22:56,057 INFO L78 Accepts]: Start accepts. Automaton has 1891 states and 2555 transitions. Word has length 195 [2019-11-16 00:22:56,057 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:22:56,057 INFO L462 AbstractCegarLoop]: Abstraction has 1891 states and 2555 transitions. [2019-11-16 00:22:56,057 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-11-16 00:22:56,058 INFO L276 IsEmpty]: Start isEmpty. Operand 1891 states and 2555 transitions. [2019-11-16 00:22:56,062 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 221 [2019-11-16 00:22:56,062 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:22:56,063 INFO L380 BasicCegarLoop]: trace histogram [12, 12, 11, 11, 11, 11, 11, 11, 11, 10, 9, 7, 7, 5, 5, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2019-11-16 00:22:56,274 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-16 00:22:56,274 INFO L410 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:22:56,274 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:22:56,274 INFO L82 PathProgramCache]: Analyzing trace with hash 1241778267, now seen corresponding path program 1 times [2019-11-16 00:22:56,275 INFO L157 tionRefinementEngine]: Executing refinement strategy WOLF [2019-11-16 00:22:56,275 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [1123478091] [2019-11-16 00:22:56,275 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_0b2d4ff1-9604-4d9d-a3bc-02e1265a2173/bin/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 [2019-11-16 00:22:56,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:22:56,403 INFO L256 TraceCheckSpWp]: Trace formula consists of 289 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-16 00:22:56,406 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-16 00:22:56,446 INFO L134 CoverageAnalysis]: Checked inductivity of 751 backedges. 463 proven. 0 refuted. 0 times theorem prover too weak. 288 trivial. 0 not checked. [2019-11-16 00:22:56,446 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-11-16 00:22:56,514 INFO L134 CoverageAnalysis]: Checked inductivity of 751 backedges. 463 proven. 0 refuted. 0 times theorem prover too weak. 288 trivial. 0 not checked. [2019-11-16 00:22:56,514 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1123478091] [2019-11-16 00:22:56,514 INFO L223 tionRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:22:56,514 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 4 [2019-11-16 00:22:56,515 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [588396906] [2019-11-16 00:22:56,515 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-16 00:22:56,515 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-16 00:22:56,516 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-16 00:22:56,516 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-16 00:22:56,516 INFO L87 Difference]: Start difference. First operand 1891 states and 2555 transitions. Second operand 4 states. [2019-11-16 00:22:56,798 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:22:56,799 INFO L93 Difference]: Finished difference Result 3965 states and 5428 transitions. [2019-11-16 00:22:56,799 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-16 00:22:56,799 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 220 [2019-11-16 00:22:56,800 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:22:56,812 INFO L225 Difference]: With dead ends: 3965 [2019-11-16 00:22:56,812 INFO L226 Difference]: Without dead ends: 2132 [2019-11-16 00:22:56,816 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 438 GetRequests, 436 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-16 00:22:56,819 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2132 states. [2019-11-16 00:22:56,871 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2132 to 2087. [2019-11-16 00:22:56,872 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2087 states. [2019-11-16 00:22:56,876 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2087 states to 2087 states and 2779 transitions. [2019-11-16 00:22:56,876 INFO L78 Accepts]: Start accepts. Automaton has 2087 states and 2779 transitions. Word has length 220 [2019-11-16 00:22:56,876 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:22:56,877 INFO L462 AbstractCegarLoop]: Abstraction has 2087 states and 2779 transitions. [2019-11-16 00:22:56,877 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-16 00:22:56,877 INFO L276 IsEmpty]: Start isEmpty. Operand 2087 states and 2779 transitions. [2019-11-16 00:22:56,882 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 232 [2019-11-16 00:22:56,883 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:22:56,883 INFO L380 BasicCegarLoop]: trace histogram [13, 13, 12, 12, 11, 11, 11, 11, 11, 9, 9, 7, 7, 5, 5, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2019-11-16 00:22:57,086 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-16 00:22:57,086 INFO L410 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:22:57,086 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:22:57,086 INFO L82 PathProgramCache]: Analyzing trace with hash 1291955765, now seen corresponding path program 1 times [2019-11-16 00:22:57,087 INFO L157 tionRefinementEngine]: Executing refinement strategy WOLF [2019-11-16 00:22:57,087 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [656106376] [2019-11-16 00:22:57,087 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_0b2d4ff1-9604-4d9d-a3bc-02e1265a2173/bin/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 [2019-11-16 00:22:57,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:22:57,190 INFO L256 TraceCheckSpWp]: Trace formula consists of 306 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-16 00:22:57,193 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-16 00:22:57,233 INFO L134 CoverageAnalysis]: Checked inductivity of 807 backedges. 479 proven. 0 refuted. 0 times theorem prover too weak. 328 trivial. 0 not checked. [2019-11-16 00:22:57,233 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-11-16 00:22:57,271 INFO L134 CoverageAnalysis]: Checked inductivity of 807 backedges. 479 proven. 0 refuted. 0 times theorem prover too weak. 328 trivial. 0 not checked. [2019-11-16 00:22:57,272 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [656106376] [2019-11-16 00:22:57,272 INFO L223 tionRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:22:57,272 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 4 [2019-11-16 00:22:57,272 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1398309184] [2019-11-16 00:22:57,273 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-16 00:22:57,273 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-16 00:22:57,273 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-16 00:22:57,274 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-16 00:22:57,274 INFO L87 Difference]: Start difference. First operand 2087 states and 2779 transitions. Second operand 4 states. [2019-11-16 00:22:57,504 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:22:57,504 INFO L93 Difference]: Finished difference Result 4354 states and 5895 transitions. [2019-11-16 00:22:57,505 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-16 00:22:57,505 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 231 [2019-11-16 00:22:57,505 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:22:57,517 INFO L225 Difference]: With dead ends: 4354 [2019-11-16 00:22:57,517 INFO L226 Difference]: Without dead ends: 2325 [2019-11-16 00:22:57,520 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 460 GetRequests, 458 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-16 00:22:57,523 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2325 states. [2019-11-16 00:22:57,583 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2325 to 2304. [2019-11-16 00:22:57,583 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2304 states. [2019-11-16 00:22:57,588 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2304 states to 2304 states and 3024 transitions. [2019-11-16 00:22:57,588 INFO L78 Accepts]: Start accepts. Automaton has 2304 states and 3024 transitions. Word has length 231 [2019-11-16 00:22:57,588 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:22:57,589 INFO L462 AbstractCegarLoop]: Abstraction has 2304 states and 3024 transitions. [2019-11-16 00:22:57,589 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-16 00:22:57,589 INFO L276 IsEmpty]: Start isEmpty. Operand 2304 states and 3024 transitions. [2019-11-16 00:22:57,595 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 262 [2019-11-16 00:22:57,595 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:22:57,595 INFO L380 BasicCegarLoop]: trace histogram [14, 14, 13, 13, 13, 12, 12, 12, 12, 10, 10, 8, 8, 6, 6, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2019-11-16 00:22:57,802 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-16 00:22:57,802 INFO L410 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:22:57,802 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:22:57,802 INFO L82 PathProgramCache]: Analyzing trace with hash 1875116247, now seen corresponding path program 1 times [2019-11-16 00:22:57,803 INFO L157 tionRefinementEngine]: Executing refinement strategy WOLF [2019-11-16 00:22:57,803 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [1475256344] [2019-11-16 00:22:57,803 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_0b2d4ff1-9604-4d9d-a3bc-02e1265a2173/bin/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 [2019-11-16 00:22:57,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:22:57,919 INFO L256 TraceCheckSpWp]: Trace formula consists of 337 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-16 00:22:57,921 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-16 00:22:57,961 INFO L134 CoverageAnalysis]: Checked inductivity of 986 backedges. 565 proven. 0 refuted. 0 times theorem prover too weak. 421 trivial. 0 not checked. [2019-11-16 00:22:57,961 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-11-16 00:22:58,042 INFO L134 CoverageAnalysis]: Checked inductivity of 986 backedges. 565 proven. 0 refuted. 0 times theorem prover too weak. 421 trivial. 0 not checked. [2019-11-16 00:22:58,042 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1475256344] [2019-11-16 00:22:58,043 INFO L223 tionRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:22:58,043 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 4 [2019-11-16 00:22:58,043 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1659390567] [2019-11-16 00:22:58,044 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-16 00:22:58,044 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-16 00:22:58,044 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-16 00:22:58,045 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-16 00:22:58,045 INFO L87 Difference]: Start difference. First operand 2304 states and 3024 transitions. Second operand 4 states. [2019-11-16 00:22:58,302 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:22:58,302 INFO L93 Difference]: Finished difference Result 4872 states and 6497 transitions. [2019-11-16 00:22:58,303 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-16 00:22:58,303 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 261 [2019-11-16 00:22:58,303 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:22:58,316 INFO L225 Difference]: With dead ends: 4872 [2019-11-16 00:22:58,316 INFO L226 Difference]: Without dead ends: 2626 [2019-11-16 00:22:58,319 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 520 GetRequests, 518 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-16 00:22:58,323 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2626 states. [2019-11-16 00:22:58,389 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2626 to 2556. [2019-11-16 00:22:58,389 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2556 states. [2019-11-16 00:22:58,394 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2556 states to 2556 states and 3304 transitions. [2019-11-16 00:22:58,395 INFO L78 Accepts]: Start accepts. Automaton has 2556 states and 3304 transitions. Word has length 261 [2019-11-16 00:22:58,395 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:22:58,395 INFO L462 AbstractCegarLoop]: Abstraction has 2556 states and 3304 transitions. [2019-11-16 00:22:58,396 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-16 00:22:58,396 INFO L276 IsEmpty]: Start isEmpty. Operand 2556 states and 3304 transitions. [2019-11-16 00:22:58,402 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 263 [2019-11-16 00:22:58,403 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:22:58,403 INFO L380 BasicCegarLoop]: trace histogram [14, 14, 13, 13, 13, 13, 12, 12, 12, 10, 10, 8, 8, 6, 6, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2019-11-16 00:22:58,606 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 18 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-16 00:22:58,606 INFO L410 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:22:58,607 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:22:58,607 INFO L82 PathProgramCache]: Analyzing trace with hash -362194243, now seen corresponding path program 1 times [2019-11-16 00:22:58,608 INFO L157 tionRefinementEngine]: Executing refinement strategy WOLF [2019-11-16 00:22:58,608 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [1243356394] [2019-11-16 00:22:58,608 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_0b2d4ff1-9604-4d9d-a3bc-02e1265a2173/bin/uautomizer/cvc4 Starting monitored process 19 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 19 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-16 00:22:58,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:22:58,762 INFO L256 TraceCheckSpWp]: Trace formula consists of 337 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-16 00:22:58,766 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-16 00:22:58,818 INFO L134 CoverageAnalysis]: Checked inductivity of 998 backedges. 635 proven. 0 refuted. 0 times theorem prover too weak. 363 trivial. 0 not checked. [2019-11-16 00:22:58,818 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-11-16 00:22:58,879 INFO L134 CoverageAnalysis]: Checked inductivity of 998 backedges. 635 proven. 0 refuted. 0 times theorem prover too weak. 363 trivial. 0 not checked. [2019-11-16 00:22:58,880 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1243356394] [2019-11-16 00:22:58,880 INFO L223 tionRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:22:58,880 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 4 [2019-11-16 00:22:58,880 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [604904257] [2019-11-16 00:22:58,883 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-16 00:22:58,884 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-16 00:22:58,884 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-16 00:22:58,884 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-16 00:22:58,884 INFO L87 Difference]: Start difference. First operand 2556 states and 3304 transitions. Second operand 4 states. [2019-11-16 00:22:59,046 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:22:59,046 INFO L93 Difference]: Finished difference Result 9819 states and 12722 transitions. [2019-11-16 00:22:59,047 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-16 00:22:59,047 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 262 [2019-11-16 00:22:59,048 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:22:59,085 INFO L225 Difference]: With dead ends: 9819 [2019-11-16 00:22:59,086 INFO L226 Difference]: Without dead ends: 7321 [2019-11-16 00:22:59,091 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 522 GetRequests, 520 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-16 00:22:59,101 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7321 states. [2019-11-16 00:22:59,323 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7321 to 7317. [2019-11-16 00:22:59,323 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7317 states. [2019-11-16 00:22:59,431 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7317 states to 7317 states and 9471 transitions. [2019-11-16 00:22:59,432 INFO L78 Accepts]: Start accepts. Automaton has 7317 states and 9471 transitions. Word has length 262 [2019-11-16 00:22:59,432 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:22:59,432 INFO L462 AbstractCegarLoop]: Abstraction has 7317 states and 9471 transitions. [2019-11-16 00:22:59,433 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-16 00:22:59,433 INFO L276 IsEmpty]: Start isEmpty. Operand 7317 states and 9471 transitions. [2019-11-16 00:22:59,446 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 287 [2019-11-16 00:22:59,447 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:22:59,447 INFO L380 BasicCegarLoop]: trace histogram [15, 15, 14, 14, 14, 14, 13, 13, 13, 11, 11, 9, 9, 7, 7, 5, 5, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2019-11-16 00:22:59,650 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 19 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-16 00:22:59,650 INFO L410 AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:22:59,650 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:22:59,651 INFO L82 PathProgramCache]: Analyzing trace with hash -1596519917, now seen corresponding path program 1 times [2019-11-16 00:22:59,651 INFO L157 tionRefinementEngine]: Executing refinement strategy WOLF [2019-11-16 00:22:59,651 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [642464665] [2019-11-16 00:22:59,652 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_0b2d4ff1-9604-4d9d-a3bc-02e1265a2173/bin/uautomizer/cvc4 Starting monitored process 20 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 20 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-16 00:22:59,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:22:59,804 INFO L256 TraceCheckSpWp]: Trace formula consists of 363 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-16 00:22:59,807 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-16 00:22:59,856 INFO L134 CoverageAnalysis]: Checked inductivity of 1190 backedges. 654 proven. 0 refuted. 0 times theorem prover too weak. 536 trivial. 0 not checked. [2019-11-16 00:22:59,857 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-11-16 00:22:59,909 INFO L134 CoverageAnalysis]: Checked inductivity of 1190 backedges. 654 proven. 0 refuted. 0 times theorem prover too weak. 536 trivial. 0 not checked. [2019-11-16 00:22:59,909 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [642464665] [2019-11-16 00:22:59,909 INFO L223 tionRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:22:59,910 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 4 [2019-11-16 00:22:59,910 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1255490641] [2019-11-16 00:22:59,911 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-16 00:22:59,912 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-16 00:22:59,912 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-16 00:22:59,912 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-16 00:22:59,912 INFO L87 Difference]: Start difference. First operand 7317 states and 9471 transitions. Second operand 4 states. [2019-11-16 00:23:00,261 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:23:00,262 INFO L93 Difference]: Finished difference Result 15017 states and 19517 transitions. [2019-11-16 00:23:00,262 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-16 00:23:00,262 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 286 [2019-11-16 00:23:00,263 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:23:00,299 INFO L225 Difference]: With dead ends: 15017 [2019-11-16 00:23:00,299 INFO L226 Difference]: Without dead ends: 7758 [2019-11-16 00:23:00,307 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 570 GetRequests, 568 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-16 00:23:00,317 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7758 states. [2019-11-16 00:23:00,490 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7758 to 7548. [2019-11-16 00:23:00,490 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7548 states. [2019-11-16 00:23:00,499 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7548 states to 7548 states and 9716 transitions. [2019-11-16 00:23:00,499 INFO L78 Accepts]: Start accepts. Automaton has 7548 states and 9716 transitions. Word has length 286 [2019-11-16 00:23:00,500 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:23:00,500 INFO L462 AbstractCegarLoop]: Abstraction has 7548 states and 9716 transitions. [2019-11-16 00:23:00,500 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-16 00:23:00,500 INFO L276 IsEmpty]: Start isEmpty. Operand 7548 states and 9716 transitions. [2019-11-16 00:23:00,512 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 299 [2019-11-16 00:23:00,512 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:23:00,513 INFO L380 BasicCegarLoop]: trace histogram [15, 15, 14, 14, 14, 14, 14, 13, 13, 11, 11, 9, 9, 7, 7, 5, 5, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2019-11-16 00:23:00,716 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 20 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-16 00:23:00,716 INFO L410 AbstractCegarLoop]: === Iteration 20 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:23:00,716 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:23:00,717 INFO L82 PathProgramCache]: Analyzing trace with hash -49494058, now seen corresponding path program 1 times [2019-11-16 00:23:00,717 INFO L157 tionRefinementEngine]: Executing refinement strategy WOLF [2019-11-16 00:23:00,718 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [717958993] [2019-11-16 00:23:00,718 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_0b2d4ff1-9604-4d9d-a3bc-02e1265a2173/bin/uautomizer/cvc4 Starting monitored process 21 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 21 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-16 00:23:00,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:23:00,848 INFO L256 TraceCheckSpWp]: Trace formula consists of 378 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-16 00:23:00,851 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-16 00:23:01,022 INFO L134 CoverageAnalysis]: Checked inductivity of 1207 backedges. 667 proven. 0 refuted. 0 times theorem prover too weak. 540 trivial. 0 not checked. [2019-11-16 00:23:01,023 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-11-16 00:23:01,089 INFO L134 CoverageAnalysis]: Checked inductivity of 1207 backedges. 667 proven. 0 refuted. 0 times theorem prover too weak. 540 trivial. 0 not checked. [2019-11-16 00:23:01,089 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [717958993] [2019-11-16 00:23:01,089 INFO L223 tionRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:23:01,090 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 4 [2019-11-16 00:23:01,090 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1424620665] [2019-11-16 00:23:01,090 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-16 00:23:01,090 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-16 00:23:01,091 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-16 00:23:01,091 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-16 00:23:01,091 INFO L87 Difference]: Start difference. First operand 7548 states and 9716 transitions. Second operand 4 states. [2019-11-16 00:23:01,385 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:23:01,386 INFO L93 Difference]: Finished difference Result 16025 states and 20952 transitions. [2019-11-16 00:23:01,386 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-16 00:23:01,386 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 298 [2019-11-16 00:23:01,387 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:23:01,400 INFO L225 Difference]: With dead ends: 16025 [2019-11-16 00:23:01,401 INFO L226 Difference]: Without dead ends: 8535 [2019-11-16 00:23:01,409 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 594 GetRequests, 592 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-16 00:23:01,419 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8535 states. [2019-11-16 00:23:01,588 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8535 to 8325. [2019-11-16 00:23:01,589 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8325 states. [2019-11-16 00:23:01,597 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8325 states to 8325 states and 10577 transitions. [2019-11-16 00:23:01,597 INFO L78 Accepts]: Start accepts. Automaton has 8325 states and 10577 transitions. Word has length 298 [2019-11-16 00:23:01,598 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:23:01,598 INFO L462 AbstractCegarLoop]: Abstraction has 8325 states and 10577 transitions. [2019-11-16 00:23:01,598 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-16 00:23:01,598 INFO L276 IsEmpty]: Start isEmpty. Operand 8325 states and 10577 transitions. [2019-11-16 00:23:01,612 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 336 [2019-11-16 00:23:01,612 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:23:01,612 INFO L380 BasicCegarLoop]: trace histogram [16, 16, 15, 15, 15, 15, 15, 15, 14, 12, 12, 10, 10, 8, 8, 6, 6, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2019-11-16 00:23:01,814 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 21 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-16 00:23:01,814 INFO L410 AbstractCegarLoop]: === Iteration 21 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:23:01,814 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:23:01,815 INFO L82 PathProgramCache]: Analyzing trace with hash -549291359, now seen corresponding path program 1 times [2019-11-16 00:23:01,815 INFO L157 tionRefinementEngine]: Executing refinement strategy WOLF [2019-11-16 00:23:01,815 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [516105845] [2019-11-16 00:23:01,815 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_0b2d4ff1-9604-4d9d-a3bc-02e1265a2173/bin/uautomizer/cvc4 Starting monitored process 22 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 22 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-16 00:23:01,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:23:01,932 INFO L256 TraceCheckSpWp]: Trace formula consists of 418 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-16 00:23:01,936 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-16 00:23:02,002 INFO L134 CoverageAnalysis]: Checked inductivity of 1448 backedges. 759 proven. 0 refuted. 0 times theorem prover too weak. 689 trivial. 0 not checked. [2019-11-16 00:23:02,003 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-11-16 00:23:02,138 INFO L134 CoverageAnalysis]: Checked inductivity of 1448 backedges. 759 proven. 0 refuted. 0 times theorem prover too weak. 689 trivial. 0 not checked. [2019-11-16 00:23:02,139 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [516105845] [2019-11-16 00:23:02,139 INFO L223 tionRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:23:02,139 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 4 [2019-11-16 00:23:02,140 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [882221873] [2019-11-16 00:23:02,140 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-16 00:23:02,140 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-16 00:23:02,141 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-16 00:23:02,142 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-16 00:23:02,142 INFO L87 Difference]: Start difference. First operand 8325 states and 10577 transitions. Second operand 4 states. [2019-11-16 00:23:02,485 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:23:02,485 INFO L93 Difference]: Finished difference Result 17636 states and 22773 transitions. [2019-11-16 00:23:02,485 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-16 00:23:02,486 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 335 [2019-11-16 00:23:02,486 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:23:02,501 INFO L225 Difference]: With dead ends: 17636 [2019-11-16 00:23:02,501 INFO L226 Difference]: Without dead ends: 9369 [2019-11-16 00:23:02,510 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 668 GetRequests, 666 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-16 00:23:02,520 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9369 states. [2019-11-16 00:23:02,714 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9369 to 9180. [2019-11-16 00:23:02,714 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9180 states. [2019-11-16 00:23:02,727 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9180 states to 9180 states and 11516 transitions. [2019-11-16 00:23:02,728 INFO L78 Accepts]: Start accepts. Automaton has 9180 states and 11516 transitions. Word has length 335 [2019-11-16 00:23:02,728 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:23:02,729 INFO L462 AbstractCegarLoop]: Abstraction has 9180 states and 11516 transitions. [2019-11-16 00:23:02,729 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-16 00:23:02,729 INFO L276 IsEmpty]: Start isEmpty. Operand 9180 states and 11516 transitions. [2019-11-16 00:23:02,739 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 359 [2019-11-16 00:23:02,740 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:23:02,740 INFO L380 BasicCegarLoop]: trace histogram [16, 16, 15, 15, 15, 15, 15, 15, 15, 13, 13, 11, 11, 9, 9, 7, 7, 5, 5, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1] [2019-11-16 00:23:02,942 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 22 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-16 00:23:02,942 INFO L410 AbstractCegarLoop]: === Iteration 22 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:23:02,943 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:23:02,943 INFO L82 PathProgramCache]: Analyzing trace with hash -1440496778, now seen corresponding path program 1 times [2019-11-16 00:23:02,943 INFO L157 tionRefinementEngine]: Executing refinement strategy WOLF [2019-11-16 00:23:02,943 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [1026128406] [2019-11-16 00:23:02,943 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_0b2d4ff1-9604-4d9d-a3bc-02e1265a2173/bin/uautomizer/cvc4 Starting monitored process 23 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 23 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-16 00:23:03,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:23:03,094 INFO L256 TraceCheckSpWp]: Trace formula consists of 437 conjuncts, 3 conjunts are in the unsatisfiable core [2019-11-16 00:23:03,098 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-16 00:23:03,205 INFO L134 CoverageAnalysis]: Checked inductivity of 1564 backedges. 905 proven. 10 refuted. 0 times theorem prover too weak. 649 trivial. 0 not checked. [2019-11-16 00:23:03,205 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-11-16 00:23:03,374 INFO L134 CoverageAnalysis]: Checked inductivity of 1564 backedges. 905 proven. 10 refuted. 0 times theorem prover too weak. 649 trivial. 0 not checked. [2019-11-16 00:23:03,375 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1026128406] [2019-11-16 00:23:03,375 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-16 00:23:03,376 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 6 [2019-11-16 00:23:03,376 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1600298592] [2019-11-16 00:23:03,377 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-16 00:23:03,377 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-16 00:23:03,377 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-16 00:23:03,378 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-11-16 00:23:03,378 INFO L87 Difference]: Start difference. First operand 9180 states and 11516 transitions. Second operand 6 states. [2019-11-16 00:23:04,435 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:23:04,436 INFO L93 Difference]: Finished difference Result 19024 states and 23829 transitions. [2019-11-16 00:23:04,437 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-11-16 00:23:04,437 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 358 [2019-11-16 00:23:04,438 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:23:04,449 INFO L225 Difference]: With dead ends: 19024 [2019-11-16 00:23:04,450 INFO L226 Difference]: Without dead ends: 6577 [2019-11-16 00:23:04,461 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 722 GetRequests, 714 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=36, Invalid=54, Unknown=0, NotChecked=0, Total=90 [2019-11-16 00:23:04,469 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6577 states. [2019-11-16 00:23:04,609 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6577 to 6343. [2019-11-16 00:23:04,610 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6343 states. [2019-11-16 00:23:04,618 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6343 states to 6343 states and 7946 transitions. [2019-11-16 00:23:04,618 INFO L78 Accepts]: Start accepts. Automaton has 6343 states and 7946 transitions. Word has length 358 [2019-11-16 00:23:04,618 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:23:04,618 INFO L462 AbstractCegarLoop]: Abstraction has 6343 states and 7946 transitions. [2019-11-16 00:23:04,619 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-16 00:23:04,619 INFO L276 IsEmpty]: Start isEmpty. Operand 6343 states and 7946 transitions. [2019-11-16 00:23:04,629 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 544 [2019-11-16 00:23:04,629 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:23:04,629 INFO L380 BasicCegarLoop]: trace histogram [20, 20, 19, 19, 19, 19, 19, 19, 19, 18, 17, 15, 15, 15, 14, 13, 13, 11, 11, 10, 10, 10, 10, 10, 10, 9, 9, 9, 9, 6, 6, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 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, 1] [2019-11-16 00:23:04,831 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 23 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-16 00:23:04,831 INFO L410 AbstractCegarLoop]: === Iteration 23 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:23:04,831 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:23:04,832 INFO L82 PathProgramCache]: Analyzing trace with hash -875382811, now seen corresponding path program 1 times [2019-11-16 00:23:04,832 INFO L157 tionRefinementEngine]: Executing refinement strategy WOLF [2019-11-16 00:23:04,832 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [1324176985] [2019-11-16 00:23:04,832 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_0b2d4ff1-9604-4d9d-a3bc-02e1265a2173/bin/uautomizer/cvc4 Starting monitored process 24 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 24 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-16 00:23:04,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:23:04,999 INFO L256 TraceCheckSpWp]: Trace formula consists of 641 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-16 00:23:05,004 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-16 00:23:05,146 INFO L134 CoverageAnalysis]: Checked inductivity of 3223 backedges. 1538 proven. 0 refuted. 0 times theorem prover too weak. 1685 trivial. 0 not checked. [2019-11-16 00:23:05,146 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-11-16 00:23:05,365 INFO L134 CoverageAnalysis]: Checked inductivity of 3223 backedges. 1538 proven. 0 refuted. 0 times theorem prover too weak. 1685 trivial. 0 not checked. [2019-11-16 00:23:05,365 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1324176985] [2019-11-16 00:23:05,365 INFO L223 tionRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:23:05,366 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 4 [2019-11-16 00:23:05,366 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1511543998] [2019-11-16 00:23:05,366 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-16 00:23:05,366 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-16 00:23:05,366 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-16 00:23:05,367 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-16 00:23:05,367 INFO L87 Difference]: Start difference. First operand 6343 states and 7946 transitions. Second operand 4 states. [2019-11-16 00:23:05,628 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:23:05,628 INFO L93 Difference]: Finished difference Result 12996 states and 16509 transitions. [2019-11-16 00:23:05,629 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-16 00:23:05,629 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 543 [2019-11-16 00:23:05,629 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:23:05,636 INFO L225 Difference]: With dead ends: 12996 [2019-11-16 00:23:05,636 INFO L226 Difference]: Without dead ends: 6079 [2019-11-16 00:23:05,643 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 1084 GetRequests, 1082 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-16 00:23:05,649 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6079 states. [2019-11-16 00:23:05,788 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6079 to 6043. [2019-11-16 00:23:05,789 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6043 states. [2019-11-16 00:23:05,796 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6043 states to 6043 states and 7526 transitions. [2019-11-16 00:23:05,796 INFO L78 Accepts]: Start accepts. Automaton has 6043 states and 7526 transitions. Word has length 543 [2019-11-16 00:23:05,796 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:23:05,797 INFO L462 AbstractCegarLoop]: Abstraction has 6043 states and 7526 transitions. [2019-11-16 00:23:05,797 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-16 00:23:05,797 INFO L276 IsEmpty]: Start isEmpty. Operand 6043 states and 7526 transitions. [2019-11-16 00:23:05,807 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 619 [2019-11-16 00:23:05,807 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:23:05,808 INFO L380 BasicCegarLoop]: trace histogram [22, 22, 21, 21, 21, 21, 21, 21, 21, 20, 19, 17, 17, 16, 16, 15, 15, 13, 13, 12, 12, 12, 12, 12, 12, 11, 11, 11, 11, 8, 8, 5, 5, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 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] [2019-11-16 00:23:06,010 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 24 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-16 00:23:06,010 INFO L410 AbstractCegarLoop]: === Iteration 24 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:23:06,011 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:23:06,011 INFO L82 PathProgramCache]: Analyzing trace with hash 1765106863, now seen corresponding path program 1 times [2019-11-16 00:23:06,011 INFO L157 tionRefinementEngine]: Executing refinement strategy WOLF [2019-11-16 00:23:06,012 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [1216316482] [2019-11-16 00:23:06,012 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_0b2d4ff1-9604-4d9d-a3bc-02e1265a2173/bin/uautomizer/cvc4 Starting monitored process 25 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 25 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-16 00:23:06,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:23:06,194 INFO L256 TraceCheckSpWp]: Trace formula consists of 707 conjuncts, 3 conjunts are in the unsatisfiable core [2019-11-16 00:23:06,199 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-16 00:23:06,616 INFO L134 CoverageAnalysis]: Checked inductivity of 4151 backedges. 2135 proven. 14 refuted. 0 times theorem prover too weak. 2002 trivial. 0 not checked. [2019-11-16 00:23:06,616 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-11-16 00:23:06,870 INFO L134 CoverageAnalysis]: Checked inductivity of 4151 backedges. 2135 proven. 14 refuted. 0 times theorem prover too weak. 2002 trivial. 0 not checked. [2019-11-16 00:23:06,871 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1216316482] [2019-11-16 00:23:06,871 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-16 00:23:06,872 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 6 [2019-11-16 00:23:06,872 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2039070855] [2019-11-16 00:23:06,873 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-16 00:23:06,873 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-16 00:23:06,874 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-16 00:23:06,874 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-11-16 00:23:06,874 INFO L87 Difference]: Start difference. First operand 6043 states and 7526 transitions. Second operand 6 states. [2019-11-16 00:23:07,110 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:23:07,110 INFO L93 Difference]: Finished difference Result 6256 states and 7796 transitions. [2019-11-16 00:23:07,110 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-16 00:23:07,110 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 618 [2019-11-16 00:23:07,111 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:23:07,111 INFO L225 Difference]: With dead ends: 6256 [2019-11-16 00:23:07,111 INFO L226 Difference]: Without dead ends: 0 [2019-11-16 00:23:07,116 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 1238 GetRequests, 1232 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2019-11-16 00:23:07,116 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-11-16 00:23:07,116 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-11-16 00:23:07,117 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-11-16 00:23:07,117 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-11-16 00:23:07,117 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 618 [2019-11-16 00:23:07,117 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:23:07,118 INFO L462 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-11-16 00:23:07,118 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-16 00:23:07,118 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-11-16 00:23:07,118 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-11-16 00:23:07,321 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 25 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-16 00:23:07,325 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2019-11-16 00:23:07,563 WARN L191 SmtUtils]: Spent 196.00 ms on a formula simplification. DAG size of input: 90 DAG size of output: 90 [2019-11-16 00:23:08,085 WARN L191 SmtUtils]: Spent 236.00 ms on a formula simplification. DAG size of input: 228 DAG size of output: 124 [2019-11-16 00:23:08,662 WARN L191 SmtUtils]: Spent 534.00 ms on a formula simplification. DAG size of input: 90 DAG size of output: 59 [2019-11-16 00:23:08,778 WARN L191 SmtUtils]: Spent 115.00 ms on a formula simplification that was a NOOP. DAG size: 47 [2019-11-16 00:23:09,296 WARN L191 SmtUtils]: Spent 517.00 ms on a formula simplification. DAG size of input: 80 DAG size of output: 66 [2019-11-16 00:23:09,422 WARN L191 SmtUtils]: Spent 125.00 ms on a formula simplification that was a NOOP. DAG size: 50 [2019-11-16 00:23:09,706 WARN L191 SmtUtils]: Spent 284.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 52 [2019-11-16 00:23:09,905 WARN L191 SmtUtils]: Spent 154.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 33 [2019-11-16 00:23:10,160 WARN L191 SmtUtils]: Spent 254.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 52 [2019-11-16 00:23:10,728 WARN L191 SmtUtils]: Spent 460.00 ms on a formula simplification. DAG size of input: 102 DAG size of output: 59 [2019-11-16 00:23:12,099 WARN L191 SmtUtils]: Spent 1.30 s on a formula simplification. DAG size of input: 118 DAG size of output: 109 [2019-11-16 00:23:12,330 WARN L191 SmtUtils]: Spent 205.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 52 [2019-11-16 00:23:12,608 WARN L191 SmtUtils]: Spent 277.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 59 [2019-11-16 00:23:12,611 INFO L446 ceAbstractionStarter]: At program point L597(lines 92 598) the Hoare annotation is: true [2019-11-16 00:23:12,611 INFO L443 ceAbstractionStarter]: For program point L168(lines 168 541) no Hoare annotation was computed. [2019-11-16 00:23:12,611 INFO L443 ceAbstractionStarter]: For program point L135(lines 135 552) no Hoare annotation was computed. [2019-11-16 00:23:12,611 INFO L443 ceAbstractionStarter]: For program point L102(lines 102 563) no Hoare annotation was computed. [2019-11-16 00:23:12,612 INFO L443 ceAbstractionStarter]: For program point L367(lines 367 371) no Hoare annotation was computed. [2019-11-16 00:23:12,612 INFO L443 ceAbstractionStarter]: For program point L367-2(lines 367 371) no Hoare annotation was computed. [2019-11-16 00:23:12,612 INFO L443 ceAbstractionStarter]: For program point L301-1(lines 301 315) no Hoare annotation was computed. [2019-11-16 00:23:12,612 INFO L439 ceAbstractionStarter]: At program point L202(lines 99 564) the Hoare annotation is: (and (not (= (_ bv4099 32) ULTIMATE.start_ssl3_connect_~s__state~0)) (not (= (_ bv4401 32) ULTIMATE.start_ssl3_connect_~s__state~0)) (= (_ bv0 32) ULTIMATE.start_ssl3_connect_~blastFlag~0) (not (= (_ bv4369 32) ULTIMATE.start_ssl3_connect_~s__state~0)) (not (= (_ bv4400 32) ULTIMATE.start_ssl3_connect_~s__state~0)) (not (= (bvadd ULTIMATE.start_ssl3_connect_~s__state~0 (_ bv4294950912 32)) (_ bv0 32))) (not (= (bvadd ULTIMATE.start_ssl3_connect_~s__state~0 (_ bv4294946816 32)) (_ bv0 32))) (not (= (_ bv4368 32) ULTIMATE.start_ssl3_connect_~s__state~0)) (not (= (bvadd ULTIMATE.start_ssl3_connect_~s__state~0 (_ bv4294955004 32)) (_ bv0 32)))) [2019-11-16 00:23:12,612 INFO L439 ceAbstractionStarter]: At program point L169(lines 165 542) the Hoare annotation is: (let ((.cse0 (not (= (_ bv4099 32) ULTIMATE.start_ssl3_connect_~s__state~0))) (.cse3 (= ULTIMATE.start_ssl3_connect_~s__hit~0 (_ bv0 32))) (.cse4 (not (= (_ bv4096 32) ULTIMATE.start_ssl3_connect_~s__state~0))) (.cse5 (not (= (_ bv4369 32) ULTIMATE.start_ssl3_connect_~s__state~0))) (.cse6 (not (= (_ bv4400 32) ULTIMATE.start_ssl3_connect_~s__state~0))) (.cse7 (= (_ bv65535 32) ULTIMATE.start_ssl3_connect_~ag_X~0)) (.cse8 (not (= (bvadd ULTIMATE.start_ssl3_connect_~s__state~0 (_ bv4294950912 32)) (_ bv0 32)))) (.cse9 (= (_ bv61087 32) ULTIMATE.start_ssl3_connect_~ag_Y~0)) (.cse10 (not (= (bvadd ULTIMATE.start_ssl3_connect_~s__state~0 (_ bv4294955004 32)) (_ bv0 32)))) (.cse1 (not (= (bvadd ULTIMATE.start_ssl3_connect_~s__state~0 (_ bv4294946816 32)) (_ bv0 32)))) (.cse2 (not (= (_ bv4368 32) ULTIMATE.start_ssl3_connect_~s__state~0)))) (or (and .cse0 .cse1 .cse2 (and .cse3 .cse4 .cse5 .cse6 (= (_ bv2 32) ULTIMATE.start_ssl3_connect_~blastFlag~0) .cse7 .cse8 .cse9 .cse10)) (and .cse0 (and .cse3 .cse4 .cse5 .cse6 (not (= (_ bv5 32) ULTIMATE.start_ssl3_connect_~blastFlag~0)) .cse7 .cse8 (= (bvadd ULTIMATE.start_ssl3_connect_~s__s3__tmp__new_cipher__algorithms~0 (_ bv4294967040 32)) (_ bv0 32)) .cse9 .cse10) .cse1 .cse2))) [2019-11-16 00:23:12,612 INFO L443 ceAbstractionStarter]: For program point L566(lines 566 594) no Hoare annotation was computed. [2019-11-16 00:23:12,613 INFO L443 ceAbstractionStarter]: For program point L567(lines 567 591) no Hoare annotation was computed. [2019-11-16 00:23:12,613 INFO L443 ceAbstractionStarter]: For program point L501-1(lines 197 529) no Hoare annotation was computed. [2019-11-16 00:23:12,613 INFO L443 ceAbstractionStarter]: For program point L336(lines 336 341) no Hoare annotation was computed. [2019-11-16 00:23:12,613 INFO L443 ceAbstractionStarter]: For program point L171(lines 171 540) no Hoare annotation was computed. [2019-11-16 00:23:12,613 INFO L443 ceAbstractionStarter]: For program point L138(lines 138 551) no Hoare annotation was computed. [2019-11-16 00:23:12,613 INFO L443 ceAbstractionStarter]: For program point L105(lines 105 562) no Hoare annotation was computed. [2019-11-16 00:23:12,613 INFO L443 ceAbstractionStarter]: For program point L601(lines 601 605) no Hoare annotation was computed. [2019-11-16 00:23:12,613 INFO L443 ceAbstractionStarter]: For program point L568(lines 568 577) no Hoare annotation was computed. [2019-11-16 00:23:12,613 INFO L443 ceAbstractionStarter]: For program point L601-2(lines 601 605) no Hoare annotation was computed. [2019-11-16 00:23:12,614 INFO L443 ceAbstractionStarter]: For program point L568-2(lines 567 589) no Hoare annotation was computed. [2019-11-16 00:23:12,614 INFO L439 ceAbstractionStarter]: At program point L139(lines 135 552) the Hoare annotation is: (let ((.cse1 (= ULTIMATE.start_ssl3_connect_~s__hit~0 (_ bv0 32))) (.cse3 (not (= (_ bv4369 32) ULTIMATE.start_ssl3_connect_~s__state~0))) (.cse4 (not (= (_ bv4400 32) ULTIMATE.start_ssl3_connect_~s__state~0))) (.cse6 (not (= (bvadd ULTIMATE.start_ssl3_connect_~s__state~0 (_ bv4294950912 32)) (_ bv0 32)))) (.cse8 (= (_ bv61087 32) ULTIMATE.start_ssl3_connect_~ag_Y~0)) (.cse9 (not (= (_ bv4368 32) ULTIMATE.start_ssl3_connect_~s__state~0))) (.cse0 (not (= (_ bv4099 32) ULTIMATE.start_ssl3_connect_~s__state~0))) (.cse2 (not (= (_ bv4096 32) ULTIMATE.start_ssl3_connect_~s__state~0))) (.cse5 (= (_ bv65535 32) ULTIMATE.start_ssl3_connect_~ag_X~0)) (.cse7 (not (= (bvadd ULTIMATE.start_ssl3_connect_~s__state~0 (_ bv4294946816 32)) (_ bv0 32)))) (.cse10 (not (= (bvadd ULTIMATE.start_ssl3_connect_~s__state~0 (_ bv4294955004 32)) (_ bv0 32))))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 (= (_ bv2 32) ULTIMATE.start_ssl3_connect_~blastFlag~0) .cse5 .cse6 .cse7 .cse8 .cse9 .cse10) (and .cse1 .cse3 .cse4 (not (= (_ bv5 32) ULTIMATE.start_ssl3_connect_~blastFlag~0)) .cse6 .cse8 .cse9 .cse0 .cse2 .cse5 (= (bvadd ULTIMATE.start_ssl3_connect_~s__s3__tmp__new_cipher__algorithms~0 (_ bv4294967040 32)) (_ bv0 32)) .cse7 .cse10))) [2019-11-16 00:23:12,614 INFO L443 ceAbstractionStarter]: For program point L73(lines 73 81) no Hoare annotation was computed. [2019-11-16 00:23:12,614 INFO L443 ceAbstractionStarter]: For program point L305(lines 305 309) no Hoare annotation was computed. [2019-11-16 00:23:12,614 INFO L443 ceAbstractionStarter]: For program point L305-2(lines 303 315) no Hoare annotation was computed. [2019-11-16 00:23:12,614 INFO L443 ceAbstractionStarter]: For program point L570(lines 570 574) no Hoare annotation was computed. [2019-11-16 00:23:12,614 INFO L443 ceAbstractionStarter]: For program point L438(lines 438 443) no Hoare annotation was computed. [2019-11-16 00:23:12,615 INFO L443 ceAbstractionStarter]: For program point L273(lines 273 277) no Hoare annotation was computed. [2019-11-16 00:23:12,615 INFO L443 ceAbstractionStarter]: For program point L207(lines 207 211) no Hoare annotation was computed. [2019-11-16 00:23:12,615 INFO L443 ceAbstractionStarter]: For program point L174(lines 174 539) no Hoare annotation was computed. [2019-11-16 00:23:12,615 INFO L443 ceAbstractionStarter]: For program point L141(lines 141 550) no Hoare annotation was computed. [2019-11-16 00:23:12,615 INFO L443 ceAbstractionStarter]: For program point L207-2(lines 197 529) no Hoare annotation was computed. [2019-11-16 00:23:12,615 INFO L443 ceAbstractionStarter]: For program point L108(lines 108 561) no Hoare annotation was computed. [2019-11-16 00:23:12,615 INFO L443 ceAbstractionStarter]: For program point L472(lines 472 476) no Hoare annotation was computed. [2019-11-16 00:23:12,615 INFO L439 ceAbstractionStarter]: At program point L175(lines 171 540) the Hoare annotation is: (let ((.cse5 (= (_ bv65535 32) ULTIMATE.start_ssl3_connect_~ag_X~0)) (.cse7 (= (_ bv61087 32) ULTIMATE.start_ssl3_connect_~ag_Y~0)) (.cse0 (not (= (_ bv4099 32) ULTIMATE.start_ssl3_connect_~s__state~0))) (.cse1 (not (= (_ bv4096 32) ULTIMATE.start_ssl3_connect_~s__state~0))) (.cse3 (not (= (_ bv4369 32) ULTIMATE.start_ssl3_connect_~s__state~0))) (.cse2 (= ULTIMATE.start_ssl3_connect_~s__hit~0 (_ bv0 32))) (.cse4 (not (= (_ bv4400 32) ULTIMATE.start_ssl3_connect_~s__state~0))) (.cse11 (= (_ bv2 32) ULTIMATE.start_ssl3_connect_~blastFlag~0)) (.cse6 (not (= (bvadd ULTIMATE.start_ssl3_connect_~s__state~0 (_ bv4294950912 32)) (_ bv0 32)))) (.cse8 (not (= (bvadd ULTIMATE.start_ssl3_connect_~s__state~0 (_ bv4294955004 32)) (_ bv0 32)))) (.cse9 (not (= (bvadd ULTIMATE.start_ssl3_connect_~s__state~0 (_ bv4294946816 32)) (_ bv0 32)))) (.cse10 (not (= (_ bv4368 32) ULTIMATE.start_ssl3_connect_~s__state~0)))) (or (and .cse0 .cse1 (and .cse2 .cse3 .cse4 (not (= (_ bv5 32) ULTIMATE.start_ssl3_connect_~blastFlag~0)) .cse5 .cse6 (= (bvadd ULTIMATE.start_ssl3_connect_~s__s3__tmp__new_cipher__algorithms~0 (_ bv4294967040 32)) (_ bv0 32)) .cse7 .cse8) .cse9 .cse10) (and .cse0 .cse1 (and .cse2 .cse3 .cse4 .cse11 .cse5 .cse6 .cse7 .cse8) .cse9 .cse10) (and (not (= (_ bv4401 32) ULTIMATE.start_ssl3_connect_~s__state~0)) (and .cse0 .cse1 (and .cse3 (not .cse2) .cse4 .cse11 .cse6 .cse8) .cse9 .cse10)))) [2019-11-16 00:23:12,616 INFO L443 ceAbstractionStarter]: For program point L76(lines 76 80) no Hoare annotation was computed. [2019-11-16 00:23:12,616 INFO L443 ceAbstractionStarter]: For program point L76-2(lines 73 81) no Hoare annotation was computed. [2019-11-16 00:23:12,616 INFO L443 ceAbstractionStarter]: For program point L506-1(lines 506 510) no Hoare annotation was computed. [2019-11-16 00:23:12,616 INFO L443 ceAbstractionStarter]: For program point L407(lines 407 411) no Hoare annotation was computed. [2019-11-16 00:23:12,616 INFO L443 ceAbstractionStarter]: For program point L243(lines 243 248) no Hoare annotation was computed. [2019-11-16 00:23:12,616 INFO L443 ceAbstractionStarter]: For program point L177(lines 177 538) no Hoare annotation was computed. [2019-11-16 00:23:12,616 INFO L443 ceAbstractionStarter]: For program point L144(lines 144 549) no Hoare annotation was computed. [2019-11-16 00:23:12,616 INFO L443 ceAbstractionStarter]: For program point L111(lines 111 560) no Hoare annotation was computed. [2019-11-16 00:23:12,617 INFO L439 ceAbstractionStarter]: At program point L145(lines 141 550) the Hoare annotation is: (let ((.cse1 (= ULTIMATE.start_ssl3_connect_~s__hit~0 (_ bv0 32))) (.cse3 (not (= (_ bv4369 32) ULTIMATE.start_ssl3_connect_~s__state~0))) (.cse4 (not (= (_ bv4400 32) ULTIMATE.start_ssl3_connect_~s__state~0))) (.cse6 (not (= (bvadd ULTIMATE.start_ssl3_connect_~s__state~0 (_ bv4294950912 32)) (_ bv0 32)))) (.cse7 (= (_ bv61087 32) ULTIMATE.start_ssl3_connect_~ag_Y~0)) (.cse9 (not (= (_ bv4368 32) ULTIMATE.start_ssl3_connect_~s__state~0))) (.cse0 (not (= (_ bv4099 32) ULTIMATE.start_ssl3_connect_~s__state~0))) (.cse2 (not (= (_ bv4096 32) ULTIMATE.start_ssl3_connect_~s__state~0))) (.cse5 (= (_ bv65535 32) ULTIMATE.start_ssl3_connect_~ag_X~0)) (.cse8 (not (= (bvadd ULTIMATE.start_ssl3_connect_~s__state~0 (_ bv4294946816 32)) (_ bv0 32)))) (.cse10 (not (= (bvadd ULTIMATE.start_ssl3_connect_~s__state~0 (_ bv4294955004 32)) (_ bv0 32))))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 (= (_ bv2 32) ULTIMATE.start_ssl3_connect_~blastFlag~0) .cse5 .cse6 .cse7 .cse8 .cse9 .cse10) (and .cse1 .cse3 .cse4 (not (= (_ bv5 32) ULTIMATE.start_ssl3_connect_~blastFlag~0)) .cse6 .cse7 .cse9 .cse0 .cse2 .cse5 (= (bvadd ULTIMATE.start_ssl3_connect_~s__s3__tmp__new_cipher__algorithms~0 (_ bv4294967040 32)) (_ bv0 32)) .cse8 .cse10))) [2019-11-16 00:23:12,617 INFO L443 ceAbstractionStarter]: For program point L477(lines 477 481) no Hoare annotation was computed. [2019-11-16 00:23:12,617 INFO L443 ceAbstractionStarter]: For program point L477-2(lines 477 481) no Hoare annotation was computed. [2019-11-16 00:23:12,617 INFO L443 ceAbstractionStarter]: For program point L180(lines 180 537) no Hoare annotation was computed. [2019-11-16 00:23:12,617 INFO L443 ceAbstractionStarter]: For program point L147(lines 147 548) no Hoare annotation was computed. [2019-11-16 00:23:12,617 INFO L443 ceAbstractionStarter]: For program point L114(lines 114 559) no Hoare annotation was computed. [2019-11-16 00:23:12,617 INFO L443 ceAbstractionStarter]: For program point L379(lines 379 383) no Hoare annotation was computed. [2019-11-16 00:23:12,617 INFO L443 ceAbstractionStarter]: For program point L346(lines 346 350) no Hoare annotation was computed. [2019-11-16 00:23:12,618 INFO L439 ceAbstractionStarter]: At program point L181(lines 177 538) the Hoare annotation is: (let ((.cse5 (= (_ bv2 32) ULTIMATE.start_ssl3_connect_~blastFlag~0)) (.cse0 (not (= (_ bv4099 32) ULTIMATE.start_ssl3_connect_~s__state~0))) (.cse1 (= ULTIMATE.start_ssl3_connect_~s__hit~0 (_ bv0 32))) (.cse2 (not (= (_ bv4096 32) ULTIMATE.start_ssl3_connect_~s__state~0))) (.cse3 (not (= (_ bv4369 32) ULTIMATE.start_ssl3_connect_~s__state~0))) (.cse4 (not (= (_ bv4400 32) ULTIMATE.start_ssl3_connect_~s__state~0))) (.cse6 (= (_ bv65535 32) ULTIMATE.start_ssl3_connect_~ag_X~0)) (.cse7 (not (= (bvadd ULTIMATE.start_ssl3_connect_~s__state~0 (_ bv4294950912 32)) (_ bv0 32)))) (.cse8 (not (= (bvadd ULTIMATE.start_ssl3_connect_~s__state~0 (_ bv4294946816 32)) (_ bv0 32)))) (.cse9 (= (_ bv61087 32) ULTIMATE.start_ssl3_connect_~ag_Y~0)) (.cse10 (not (= (bvadd ULTIMATE.start_ssl3_connect_~s__state~0 (_ bv4294955004 32)) (_ bv0 32)))) (.cse11 (not (= (_ bv4368 32) ULTIMATE.start_ssl3_connect_~s__state~0)))) (or (and .cse0 (and .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10) .cse11) (and (not (= (_ bv4401 32) ULTIMATE.start_ssl3_connect_~s__state~0)) .cse4 (and .cse0 (and .cse2 .cse3 (not .cse1) .cse5 .cse7 .cse8 .cse10) .cse11)) (and .cse0 (and .cse1 .cse2 .cse3 .cse4 (not (= (_ bv5 32) ULTIMATE.start_ssl3_connect_~blastFlag~0)) .cse6 .cse7 (= (bvadd ULTIMATE.start_ssl3_connect_~s__s3__tmp__new_cipher__algorithms~0 (_ bv4294967040 32)) (_ bv0 32)) .cse8 .cse9 .cse10) .cse11))) [2019-11-16 00:23:12,618 INFO L439 ceAbstractionStarter]: At program point L115(lines 111 560) the Hoare annotation is: (and (not (= (_ bv4099 32) ULTIMATE.start_ssl3_connect_~s__state~0)) (not (= (_ bv4401 32) ULTIMATE.start_ssl3_connect_~s__state~0)) (not (= (_ bv4096 32) ULTIMATE.start_ssl3_connect_~s__state~0)) (= (_ bv0 32) ULTIMATE.start_ssl3_connect_~blastFlag~0) (not (= (_ bv4369 32) ULTIMATE.start_ssl3_connect_~s__state~0)) (not (= (_ bv4400 32) ULTIMATE.start_ssl3_connect_~s__state~0)) (not (= (bvadd ULTIMATE.start_ssl3_connect_~s__state~0 (_ bv4294950912 32)) (_ bv0 32))) (not (= (bvadd ULTIMATE.start_ssl3_connect_~s__state~0 (_ bv4294946816 32)) (_ bv0 32))) (not (= (bvadd ULTIMATE.start_ssl3_connect_~s__state~0 (_ bv4294955004 32)) (_ bv0 32)))) [2019-11-16 00:23:12,618 INFO L439 ceAbstractionStarter]: At program point L347(lines 65 614) the Hoare annotation is: false [2019-11-16 00:23:12,618 INFO L443 ceAbstractionStarter]: For program point L83(lines 83 91) no Hoare annotation was computed. [2019-11-16 00:23:12,618 INFO L446 ceAbstractionStarter]: At program point L612(lines 65 614) the Hoare annotation is: true [2019-11-16 00:23:12,618 INFO L443 ceAbstractionStarter]: For program point L579(lines 579 585) no Hoare annotation was computed. [2019-11-16 00:23:12,618 INFO L443 ceAbstractionStarter]: For program point L513(lines 513 517) no Hoare annotation was computed. [2019-11-16 00:23:12,618 INFO L443 ceAbstractionStarter]: For program point L513-2(lines 513 517) no Hoare annotation was computed. [2019-11-16 00:23:12,619 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 608) no Hoare annotation was computed. [2019-11-16 00:23:12,619 INFO L443 ceAbstractionStarter]: For program point L282(lines 282 286) no Hoare annotation was computed. [2019-11-16 00:23:12,619 INFO L443 ceAbstractionStarter]: For program point L282-2(lines 197 529) no Hoare annotation was computed. [2019-11-16 00:23:12,619 INFO L443 ceAbstractionStarter]: For program point L183(lines 183 536) no Hoare annotation was computed. [2019-11-16 00:23:12,619 INFO L443 ceAbstractionStarter]: For program point L150(lines 150 547) no Hoare annotation was computed. [2019-11-16 00:23:12,619 INFO L443 ceAbstractionStarter]: For program point L117(lines 117 558) no Hoare annotation was computed. [2019-11-16 00:23:12,619 INFO L443 ceAbstractionStarter]: For program point L84(lines 84 88) no Hoare annotation was computed. [2019-11-16 00:23:12,619 INFO L446 ceAbstractionStarter]: At program point L613(lines 8 615) the Hoare annotation is: true [2019-11-16 00:23:12,619 INFO L443 ceAbstractionStarter]: For program point L448(lines 448 452) no Hoare annotation was computed. [2019-11-16 00:23:12,620 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2019-11-16 00:23:12,620 INFO L443 ceAbstractionStarter]: For program point L351(lines 351 355) no Hoare annotation was computed. [2019-11-16 00:23:12,620 INFO L443 ceAbstractionStarter]: For program point L219(lines 219 236) no Hoare annotation was computed. [2019-11-16 00:23:12,620 INFO L443 ceAbstractionStarter]: For program point L186(lines 186 535) no Hoare annotation was computed. [2019-11-16 00:23:12,620 INFO L443 ceAbstractionStarter]: For program point L153(lines 153 546) no Hoare annotation was computed. [2019-11-16 00:23:12,620 INFO L443 ceAbstractionStarter]: For program point L219-2(lines 197 529) no Hoare annotation was computed. [2019-11-16 00:23:12,620 INFO L443 ceAbstractionStarter]: For program point L120(lines 120 557) no Hoare annotation was computed. [2019-11-16 00:23:12,620 INFO L439 ceAbstractionStarter]: At program point L187(lines 183 536) the Hoare annotation is: (let ((.cse12 (not (= (_ bv4400 32) ULTIMATE.start_ssl3_connect_~s__state~0)))) (let ((.cse2 (not (= (_ bv4099 32) ULTIMATE.start_ssl3_connect_~s__state~0))) (.cse9 (= ULTIMATE.start_ssl3_connect_~s__hit~0 (_ bv0 32))) (.cse0 (and .cse12 (= (_ bv2 32) ULTIMATE.start_ssl3_connect_~blastFlag~0))) (.cse10 (= (_ bv4560 32) ULTIMATE.start_ssl3_connect_~s__s3__tmp__next_state___0~0)) (.cse3 (not (= (_ bv4096 32) ULTIMATE.start_ssl3_connect_~s__state~0))) (.cse4 (not (= (_ bv4369 32) ULTIMATE.start_ssl3_connect_~s__state~0))) (.cse13 (= (_ bv65535 32) ULTIMATE.start_ssl3_connect_~ag_X~0)) (.cse5 (not (= (bvadd ULTIMATE.start_ssl3_connect_~s__state~0 (_ bv4294950912 32)) (_ bv0 32)))) (.cse6 (not (= (bvadd ULTIMATE.start_ssl3_connect_~s__state~0 (_ bv4294946816 32)) (_ bv0 32)))) (.cse11 (= (_ bv61087 32) ULTIMATE.start_ssl3_connect_~ag_Y~0)) (.cse7 (not (= (_ bv4368 32) ULTIMATE.start_ssl3_connect_~s__state~0))) (.cse8 (not (= (bvadd ULTIMATE.start_ssl3_connect_~s__state~0 (_ bv4294955004 32)) (_ bv0 32))))) (or (and (not (= (_ bv4401 32) ULTIMATE.start_ssl3_connect_~s__state~0)) (let ((.cse1 (not .cse9))) (or (and .cse0 .cse1 (= (_ bv4560 32) ULTIMATE.start_ssl3_connect_~s__state~0)) (and .cse2 .cse0 .cse3 .cse4 .cse1 .cse5 (not (= (_ bv4368 32) ULTIMATE.start_ssl3_connect_~s__s3__tmp__next_state___0~0)) .cse6 .cse7 .cse8)))) (and .cse9 .cse10 .cse4 .cse5 .cse11 .cse7 .cse2 .cse3 (and .cse12 (not (= (_ bv5 32) ULTIMATE.start_ssl3_connect_~blastFlag~0))) .cse13 (= (bvadd ULTIMATE.start_ssl3_connect_~s__s3__tmp__new_cipher__algorithms~0 (_ bv4294967040 32)) (_ bv0 32)) .cse6 .cse8) (and .cse2 .cse9 .cse0 .cse10 .cse3 .cse4 .cse13 .cse5 .cse6 .cse11 .cse7 .cse8)))) [2019-11-16 00:23:12,621 INFO L439 ceAbstractionStarter]: At program point L121(lines 117 558) the Hoare annotation is: (let ((.cse0 (= ULTIMATE.start_ssl3_connect_~s__hit~0 (_ bv0 32))) (.cse1 (= (_ bv4560 32) ULTIMATE.start_ssl3_connect_~s__s3__tmp__next_state___0~0)) (.cse5 (= (_ bv61087 32) ULTIMATE.start_ssl3_connect_~ag_Y~0)) (.cse9 (= (_ bv65535 32) ULTIMATE.start_ssl3_connect_~ag_X~0)) (.cse7 (not (= (_ bv4099 32) ULTIMATE.start_ssl3_connect_~s__state~0))) (.cse8 (not (= (_ bv4096 32) ULTIMATE.start_ssl3_connect_~s__state~0))) (.cse2 (not (= (_ bv4369 32) ULTIMATE.start_ssl3_connect_~s__state~0))) (.cse3 (not (= (_ bv4400 32) ULTIMATE.start_ssl3_connect_~s__state~0))) (.cse4 (not (= (bvadd ULTIMATE.start_ssl3_connect_~s__state~0 (_ bv4294950912 32)) (_ bv0 32)))) (.cse10 (not (= (bvadd ULTIMATE.start_ssl3_connect_~s__state~0 (_ bv4294946816 32)) (_ bv0 32)))) (.cse6 (not (= (_ bv4368 32) ULTIMATE.start_ssl3_connect_~s__state~0))) (.cse11 (not (= (bvadd ULTIMATE.start_ssl3_connect_~s__state~0 (_ bv4294955004 32)) (_ bv0 32))))) (or (and .cse0 .cse1 .cse2 .cse3 (= (_ bv2 32) ULTIMATE.start_ssl3_connect_~blastFlag~0) .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11) (and .cse0 .cse1 .cse2 .cse3 (not (= (_ bv5 32) ULTIMATE.start_ssl3_connect_~blastFlag~0)) .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 (= (bvadd ULTIMATE.start_ssl3_connect_~s__s3__tmp__new_cipher__algorithms~0 (_ bv4294967040 32)) (_ bv0 32)) .cse10 .cse11) (and .cse7 (not (= (_ bv4401 32) ULTIMATE.start_ssl3_connect_~s__state~0)) .cse8 .cse2 .cse3 .cse4 .cse10 (= (_ bv1 32) ULTIMATE.start_ssl3_connect_~blastFlag~0) .cse6 .cse11))) [2019-11-16 00:23:12,621 INFO L443 ceAbstractionStarter]: For program point L485-1(lines 485 497) no Hoare annotation was computed. [2019-11-16 00:23:12,621 INFO L443 ceAbstractionStarter]: For program point L419(lines 419 423) no Hoare annotation was computed. [2019-11-16 00:23:12,621 INFO L443 ceAbstractionStarter]: For program point L221(lines 221 226) no Hoare annotation was computed. [2019-11-16 00:23:12,621 INFO L443 ceAbstractionStarter]: For program point L189(lines 189 534) no Hoare annotation was computed. [2019-11-16 00:23:12,621 INFO L443 ceAbstractionStarter]: For program point L156(lines 156 545) no Hoare annotation was computed. [2019-11-16 00:23:12,621 INFO L443 ceAbstractionStarter]: For program point L123(lines 123 556) no Hoare annotation was computed. [2019-11-16 00:23:12,621 INFO L443 ceAbstractionStarter]: For program point L520(lines 520 524) no Hoare annotation was computed. [2019-11-16 00:23:12,624 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2019-11-16 00:23:12,624 INFO L439 ceAbstractionStarter]: At program point L190(lines 189 534) the Hoare annotation is: (let ((.cse3 (= (_ bv2 32) ULTIMATE.start_ssl3_connect_~blastFlag~0)) (.cse0 (= ULTIMATE.start_ssl3_connect_~s__hit~0 (_ bv0 32))) (.cse1 (= (_ bv4560 32) ULTIMATE.start_ssl3_connect_~s__s3__tmp__next_state___0~0)) (.cse2 (= (_ bv4352 32) ULTIMATE.start_ssl3_connect_~s__state~0)) (.cse4 (= (_ bv61087 32) ULTIMATE.start_ssl3_connect_~ag_Y~0)) (.cse5 (= (_ bv65535 32) ULTIMATE.start_ssl3_connect_~ag_X~0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5) (and .cse2 (not .cse0) .cse3 (= (bvadd ULTIMATE.start_ssl3_connect_~s__s3__tmp__next_state___0~0 (_ bv4294967293 32)) (_ bv0 32))) (and .cse0 .cse1 .cse2 (not (= (_ bv5 32) ULTIMATE.start_ssl3_connect_~blastFlag~0)) .cse4 .cse5 (= (bvadd ULTIMATE.start_ssl3_connect_~s__s3__tmp__new_cipher__algorithms~0 (_ bv4294967040 32)) (_ bv0 32))))) [2019-11-16 00:23:12,624 INFO L439 ceAbstractionStarter]: At program point L157(lines 147 548) the Hoare annotation is: (let ((.cse0 (not (= (_ bv4099 32) ULTIMATE.start_ssl3_connect_~s__state~0))) (.cse1 (not (= (_ bv4096 32) ULTIMATE.start_ssl3_connect_~s__state~0))) (.cse2 (= ULTIMATE.start_ssl3_connect_~s__hit~0 (_ bv0 32))) (.cse3 (not (= (_ bv4369 32) ULTIMATE.start_ssl3_connect_~s__state~0))) (.cse4 (not (= (_ bv4400 32) ULTIMATE.start_ssl3_connect_~s__state~0))) (.cse5 (= (_ bv65535 32) ULTIMATE.start_ssl3_connect_~ag_X~0)) (.cse6 (= (_ bv61087 32) ULTIMATE.start_ssl3_connect_~ag_Y~0)) (.cse7 (not (= (bvadd ULTIMATE.start_ssl3_connect_~s__state~0 (_ bv4294950912 32)) (_ bv0 32)))) (.cse8 (not (= (bvadd ULTIMATE.start_ssl3_connect_~s__state~0 (_ bv4294946816 32)) (_ bv0 32)))) (.cse9 (not (= (_ bv4368 32) ULTIMATE.start_ssl3_connect_~s__state~0))) (.cse10 (not (= (bvadd ULTIMATE.start_ssl3_connect_~s__state~0 (_ bv4294955004 32)) (_ bv0 32))))) (or (and .cse0 .cse1 (and .cse2 .cse3 .cse4 (not (= (_ bv5 32) ULTIMATE.start_ssl3_connect_~blastFlag~0)) .cse5 (= (bvadd ULTIMATE.start_ssl3_connect_~s__s3__tmp__new_cipher__algorithms~0 (_ bv4294967040 32)) (_ bv0 32)) .cse6) .cse7 .cse8 .cse9 .cse10) (and .cse0 .cse1 (and .cse2 .cse3 .cse4 (= (_ bv2 32) ULTIMATE.start_ssl3_connect_~blastFlag~0) .cse5 .cse6) .cse7 .cse8 .cse9 .cse10))) [2019-11-16 00:23:12,624 INFO L443 ceAbstractionStarter]: For program point L488(lines 488 493) no Hoare annotation was computed. [2019-11-16 00:23:12,624 INFO L443 ceAbstractionStarter]: For program point L455(lines 455 466) no Hoare annotation was computed. [2019-11-16 00:23:12,624 INFO L443 ceAbstractionStarter]: For program point L455-1(lines 455 466) no Hoare annotation was computed. [2019-11-16 00:23:12,625 INFO L443 ceAbstractionStarter]: For program point L323(lines 323 327) no Hoare annotation was computed. [2019-11-16 00:23:12,625 INFO L443 ceAbstractionStarter]: For program point L257(lines 257 265) no Hoare annotation was computed. [2019-11-16 00:23:12,625 INFO L443 ceAbstractionStarter]: For program point L323-2(lines 197 529) no Hoare annotation was computed. [2019-11-16 00:23:12,625 INFO L443 ceAbstractionStarter]: For program point L390(lines 390 394) no Hoare annotation was computed. [2019-11-16 00:23:12,625 INFO L443 ceAbstractionStarter]: For program point L192(lines 192 533) no Hoare annotation was computed. [2019-11-16 00:23:12,625 INFO L443 ceAbstractionStarter]: For program point L159(lines 159 544) no Hoare annotation was computed. [2019-11-16 00:23:12,625 INFO L443 ceAbstractionStarter]: For program point L126(lines 126 555) no Hoare annotation was computed. [2019-11-16 00:23:12,626 INFO L443 ceAbstractionStarter]: For program point L93-1(lines 65 614) no Hoare annotation was computed. [2019-11-16 00:23:12,626 INFO L443 ceAbstractionStarter]: For program point L457(lines 457 463) no Hoare annotation was computed. [2019-11-16 00:23:12,626 INFO L443 ceAbstractionStarter]: For program point L292(lines 292 296) no Hoare annotation was computed. [2019-11-16 00:23:12,626 INFO L443 ceAbstractionStarter]: For program point L292-2(lines 292 296) no Hoare annotation was computed. [2019-11-16 00:23:12,626 INFO L446 ceAbstractionStarter]: At program point L193(lines 192 533) the Hoare annotation is: true [2019-11-16 00:23:12,627 INFO L439 ceAbstractionStarter]: At program point L127(lines 123 556) the Hoare annotation is: (let ((.cse1 (= ULTIMATE.start_ssl3_connect_~s__hit~0 (_ bv0 32))) (.cse3 (not (= (_ bv4369 32) ULTIMATE.start_ssl3_connect_~s__state~0))) (.cse4 (not (= (bvadd ULTIMATE.start_ssl3_connect_~s__state~0 (_ bv4294950912 32)) (_ bv0 32)))) (.cse6 (not (= (_ bv4368 32) ULTIMATE.start_ssl3_connect_~s__state~0))) (.cse0 (not (= (_ bv4099 32) ULTIMATE.start_ssl3_connect_~s__state~0))) (.cse2 (not (= (_ bv4096 32) ULTIMATE.start_ssl3_connect_~s__state~0))) (.cse5 (not (= (bvadd ULTIMATE.start_ssl3_connect_~s__state~0 (_ bv4294946816 32)) (_ bv0 32)))) (.cse7 (not (= (bvadd ULTIMATE.start_ssl3_connect_~s__state~0 (_ bv4294955004 32)) (_ bv0 32))))) (or (and .cse0 .cse1 .cse2 .cse3 (= (_ bv2 32) ULTIMATE.start_ssl3_connect_~blastFlag~0) .cse4 .cse5 .cse6 .cse7) (and .cse1 (= (_ bv4560 32) ULTIMATE.start_ssl3_connect_~s__s3__tmp__next_state___0~0) .cse3 (not (= (_ bv5 32) ULTIMATE.start_ssl3_connect_~blastFlag~0)) .cse4 (= (_ bv61087 32) ULTIMATE.start_ssl3_connect_~ag_Y~0) .cse6 .cse0 .cse2 (= (_ bv65535 32) ULTIMATE.start_ssl3_connect_~ag_X~0) (= (bvadd ULTIMATE.start_ssl3_connect_~s__s3__tmp__new_cipher__algorithms~0 (_ bv4294967040 32)) (_ bv0 32)) .cse5 .cse7))) [2019-11-16 00:23:12,627 INFO L443 ceAbstractionStarter]: For program point L94(line 94) no Hoare annotation was computed. [2019-11-16 00:23:12,627 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2019-11-16 00:23:12,627 INFO L443 ceAbstractionStarter]: For program point L260(lines 260 264) no Hoare annotation was computed. [2019-11-16 00:23:12,627 INFO L443 ceAbstractionStarter]: For program point L227(lines 227 232) no Hoare annotation was computed. [2019-11-16 00:23:12,627 INFO L443 ceAbstractionStarter]: For program point L260-2(lines 197 529) no Hoare annotation was computed. [2019-11-16 00:23:12,627 INFO L446 ceAbstractionStarter]: At program point L624(lines 616 626) the Hoare annotation is: true [2019-11-16 00:23:12,628 INFO L443 ceAbstractionStarter]: For program point L162(lines 162 543) no Hoare annotation was computed. [2019-11-16 00:23:12,628 INFO L443 ceAbstractionStarter]: For program point L129(lines 129 554) no Hoare annotation was computed. [2019-11-16 00:23:12,628 INFO L443 ceAbstractionStarter]: For program point L96(lines 96 565) no Hoare annotation was computed. [2019-11-16 00:23:12,628 INFO L443 ceAbstractionStarter]: For program point L427(lines 427 431) no Hoare annotation was computed. [2019-11-16 00:23:12,628 INFO L443 ceAbstractionStarter]: For program point L427-2(lines 197 529) no Hoare annotation was computed. [2019-11-16 00:23:12,628 INFO L446 ceAbstractionStarter]: At program point L196(lines 195 532) the Hoare annotation is: true [2019-11-16 00:23:12,628 INFO L439 ceAbstractionStarter]: At program point L163(lines 159 544) the Hoare annotation is: (let ((.cse0 (not (= (_ bv4099 32) ULTIMATE.start_ssl3_connect_~s__state~0))) (.cse1 (not (= (_ bv4096 32) ULTIMATE.start_ssl3_connect_~s__state~0))) (.cse4 (= ULTIMATE.start_ssl3_connect_~s__hit~0 (_ bv0 32))) (.cse5 (not (= (_ bv4369 32) ULTIMATE.start_ssl3_connect_~s__state~0))) (.cse6 (not (= (_ bv4400 32) ULTIMATE.start_ssl3_connect_~s__state~0))) (.cse7 (= (_ bv65535 32) ULTIMATE.start_ssl3_connect_~ag_X~0)) (.cse8 (= (_ bv61087 32) ULTIMATE.start_ssl3_connect_~ag_Y~0)) (.cse9 (not (= (bvadd ULTIMATE.start_ssl3_connect_~s__state~0 (_ bv4294955004 32)) (_ bv0 32)))) (.cse2 (not (= (bvadd ULTIMATE.start_ssl3_connect_~s__state~0 (_ bv4294950912 32)) (_ bv0 32)))) (.cse3 (not (= (bvadd ULTIMATE.start_ssl3_connect_~s__state~0 (_ bv4294946816 32)) (_ bv0 32)))) (.cse10 (not (= (_ bv4368 32) ULTIMATE.start_ssl3_connect_~s__state~0)))) (or (and .cse0 .cse1 .cse2 .cse3 (and .cse4 .cse5 .cse6 (= (_ bv2 32) ULTIMATE.start_ssl3_connect_~blastFlag~0) .cse7 .cse8 .cse9) .cse10) (and .cse0 .cse1 (and .cse4 .cse5 .cse6 (not (= (_ bv5 32) ULTIMATE.start_ssl3_connect_~blastFlag~0)) .cse7 (= (bvadd ULTIMATE.start_ssl3_connect_~s__s3__tmp__new_cipher__algorithms~0 (_ bv4294967040 32)) (_ bv0 32)) .cse8 .cse9) .cse2 .cse3 .cse10))) [2019-11-16 00:23:12,628 INFO L439 ceAbstractionStarter]: At program point L97(lines 96 565) the Hoare annotation is: (and (= (bvadd ULTIMATE.start_ssl3_connect_~s__state~0 (_ bv4294955004 32)) (_ bv0 32)) (= (_ bv0 32) ULTIMATE.start_ssl3_connect_~blastFlag~0)) [2019-11-16 00:23:12,628 INFO L443 ceAbstractionStarter]: For program point L362(lines 362 366) no Hoare annotation was computed. [2019-11-16 00:23:12,628 INFO L443 ceAbstractionStarter]: For program point L396(lines 396 401) no Hoare annotation was computed. [2019-11-16 00:23:12,628 INFO L443 ceAbstractionStarter]: For program point L396-2(lines 396 401) no Hoare annotation was computed. [2019-11-16 00:23:12,629 INFO L443 ceAbstractionStarter]: For program point L165(lines 165 542) no Hoare annotation was computed. [2019-11-16 00:23:12,629 INFO L443 ceAbstractionStarter]: For program point L132(lines 132 553) no Hoare annotation was computed. [2019-11-16 00:23:12,629 INFO L443 ceAbstractionStarter]: For program point L99(lines 99 564) no Hoare annotation was computed. [2019-11-16 00:23:12,629 INFO L439 ceAbstractionStarter]: At program point L133(lines 129 554) the Hoare annotation is: (let ((.cse0 (not (= (_ bv4099 32) ULTIMATE.start_ssl3_connect_~s__state~0))) (.cse1 (= ULTIMATE.start_ssl3_connect_~s__hit~0 (_ bv0 32))) (.cse2 (not (= (_ bv4096 32) ULTIMATE.start_ssl3_connect_~s__state~0))) (.cse3 (not (= (_ bv4369 32) ULTIMATE.start_ssl3_connect_~s__state~0))) (.cse4 (not (= (_ bv4400 32) ULTIMATE.start_ssl3_connect_~s__state~0))) (.cse5 (not (= (bvadd ULTIMATE.start_ssl3_connect_~s__state~0 (_ bv4294950912 32)) (_ bv0 32)))) (.cse6 (= (_ bv61087 32) ULTIMATE.start_ssl3_connect_~ag_Y~0)) (.cse7 (not (= (bvadd ULTIMATE.start_ssl3_connect_~s__state~0 (_ bv4294946816 32)) (_ bv0 32)))) (.cse8 (not (= (_ bv4368 32) ULTIMATE.start_ssl3_connect_~s__state~0))) (.cse9 (not (= (bvadd ULTIMATE.start_ssl3_connect_~s__state~0 (_ bv4294955004 32)) (_ bv0 32))))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 (not (= (_ bv5 32) ULTIMATE.start_ssl3_connect_~blastFlag~0)) .cse5 (= (bvadd ULTIMATE.start_ssl3_connect_~s__s3__tmp__new_cipher__algorithms~0 (_ bv4294967040 32)) (_ bv0 32)) .cse6 .cse7 .cse8 .cse9) (and .cse0 .cse1 .cse2 .cse3 .cse4 (= (_ bv2 32) ULTIMATE.start_ssl3_connect_~blastFlag~0) .cse5 .cse6 .cse7 .cse8 .cse9))) [2019-11-16 00:23:12,630 INFO L439 ceAbstractionStarter]: At program point L530(lines 93 596) the Hoare annotation is: (let ((.cse0 (= ULTIMATE.start_ssl3_connect_~s__hit~0 (_ bv0 32))) (.cse14 (= (_ bv4368 32) ULTIMATE.start_ssl3_connect_~s__state~0))) (let ((.cse20 (= (_ bv4496 32) ULTIMATE.start_ssl3_connect_~s__state~0)) (.cse6 (= (_ bv4560 32) ULTIMATE.start_ssl3_connect_~s__s3__tmp__next_state___0~0)) (.cse8 (not (= (_ bv4369 32) ULTIMATE.start_ssl3_connect_~s__state~0))) (.cse9 (not (= (bvadd ULTIMATE.start_ssl3_connect_~s__state~0 (_ bv4294950912 32)) (_ bv0 32)))) (.cse11 (not .cse14)) (.cse5 (not (= (_ bv4099 32) ULTIMATE.start_ssl3_connect_~s__state~0))) (.cse7 (not (= (_ bv4096 32) ULTIMATE.start_ssl3_connect_~s__state~0))) (.cse10 (not (= (bvadd ULTIMATE.start_ssl3_connect_~s__state~0 (_ bv4294946816 32)) (_ bv0 32)))) (.cse12 (not (= (bvadd ULTIMATE.start_ssl3_connect_~s__state~0 (_ bv4294955004 32)) (_ bv0 32)))) (.cse22 (= (_ bv4480 32) ULTIMATE.start_ssl3_connect_~s__state~0)) (.cse16 (= (_ bv4512 32) ULTIMATE.start_ssl3_connect_~s__state~0)) (.cse19 (= (bvadd ULTIMATE.start_ssl3_connect_~s__state~0 (_ bv4294967293 32)) (_ bv0 32))) (.cse13 (not .cse0)) (.cse18 (not (= (_ bv4368 32) ULTIMATE.start_ssl3_connect_~s__s3__tmp__next_state___0~0))) (.cse4 (= (_ bv4448 32) ULTIMATE.start_ssl3_connect_~s__state~0)) (.cse21 (= (_ bv4528 32) ULTIMATE.start_ssl3_connect_~s__state~0)) (.cse15 (not (= (_ bv5 32) ULTIMATE.start_ssl3_connect_~blastFlag~0))) (.cse17 (= (bvadd ULTIMATE.start_ssl3_connect_~s__s3__tmp__new_cipher__algorithms~0 (_ bv4294967040 32)) (_ bv0 32))) (.cse23 (= (_ bv4464 32) ULTIMATE.start_ssl3_connect_~s__state~0)) (.cse25 (= (_ bv4416 32) ULTIMATE.start_ssl3_connect_~s__state~0)) (.cse1 (= (_ bv2 32) ULTIMATE.start_ssl3_connect_~blastFlag~0)) (.cse2 (= (_ bv65535 32) ULTIMATE.start_ssl3_connect_~ag_X~0)) (.cse3 (= (_ bv61087 32) ULTIMATE.start_ssl3_connect_~ag_Y~0)) (.cse24 (= (_ bv4432 32) ULTIMATE.start_ssl3_connect_~s__state~0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4) (and .cse5 .cse0 .cse6 .cse7 .cse8 .cse1 .cse9 .cse2 .cse3 .cse10 .cse11 .cse12) (and (= (_ bv4352 32) ULTIMATE.start_ssl3_connect_~s__state~0) .cse13 .cse1 (= (bvadd ULTIMATE.start_ssl3_connect_~s__s3__tmp__next_state___0~0 (_ bv4294967293 32)) (_ bv0 32))) (and (= (_ bv0 32) ULTIMATE.start_ssl3_connect_~blastFlag~0) .cse14) (and .cse0 .cse15 .cse16 .cse3 .cse2 .cse17) (and .cse13 .cse18 .cse3 .cse19 .cse2 .cse17) (and .cse0 .cse20 .cse1 .cse2 .cse3) (and (= (_ bv1 32) ULTIMATE.start_ssl3_connect_~blastFlag~0) (= (_ bv4384 32) ULTIMATE.start_ssl3_connect_~s__state~0)) (and .cse21 .cse13 .cse1) (and .cse0 .cse15 .cse3 .cse22 .cse2 .cse17) (and .cse0 .cse15 .cse3 .cse21 .cse2 .cse17) (and .cse0 .cse15 .cse3 .cse20 .cse2 .cse17) (and .cse0 .cse6 .cse8 .cse15 .cse9 .cse3 .cse11 .cse5 .cse7 .cse2 .cse17 .cse10 .cse12) (and .cse0 .cse22 .cse1 .cse2 .cse3) (and .cse1 .cse2 .cse16 .cse3) (and .cse13 .cse1 .cse16) (and .cse13 (= (_ bv4560 32) ULTIMATE.start_ssl3_connect_~s__state~0) .cse1) (and .cse19 .cse13 .cse1 .cse18) (and .cse0 .cse15 .cse2 .cse17 .cse3 .cse4) (and .cse0 .cse15 .cse3 .cse2 .cse23 .cse17) (and .cse21 .cse1 .cse2 .cse3) (and .cse0 .cse15 .cse3 .cse2 .cse17 .cse24) (and .cse0 .cse15 .cse3 .cse25 .cse17) (and .cse0 .cse1 .cse2 .cse23 .cse3) (and .cse0 .cse1 (= (_ bv4400 32) ULTIMATE.start_ssl3_connect_~s__state~0)) (and .cse0 .cse25 .cse1 .cse3) (and .cse0 .cse1 .cse2 .cse3 .cse24)))) [2019-11-16 00:23:12,689 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 16.11 12:23:12 BoogieIcfgContainer [2019-11-16 00:23:12,689 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-11-16 00:23:12,690 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-11-16 00:23:12,690 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-11-16 00:23:12,690 INFO L275 PluginConnector]: Witness Printer initialized [2019-11-16 00:23:12,691 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.11 12:22:47" (3/4) ... [2019-11-16 00:23:12,696 INFO L137 WitnessPrinter]: Generating witness for correct program [2019-11-16 00:23:12,716 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2019-11-16 00:23:12,717 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2019-11-16 00:23:12,883 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/run_dir_0b2d4ff1-9604-4d9d-a3bc-02e1265a2173/bin/uautomizer/witness.graphml [2019-11-16 00:23:12,883 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-11-16 00:23:12,884 INFO L168 Benchmark]: Toolchain (without parser) took 26677.27 ms. Allocated memory was 1.0 GB in the beginning and 2.2 GB in the end (delta: 1.1 GB). Free memory was 952.4 MB in the beginning and 1.8 GB in the end (delta: -818.7 MB). Peak memory consumption was 328.5 MB. Max. memory is 11.5 GB. [2019-11-16 00:23:12,885 INFO L168 Benchmark]: CDTParser took 0.32 ms. Allocated memory is still 1.0 GB. Free memory is still 977.9 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-16 00:23:12,885 INFO L168 Benchmark]: CACSL2BoogieTranslator took 415.36 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 170.4 MB). Free memory was 952.4 MB in the beginning and 1.2 GB in the end (delta: -207.6 MB). Peak memory consumption was 29.0 MB. Max. memory is 11.5 GB. [2019-11-16 00:23:12,886 INFO L168 Benchmark]: Boogie Procedure Inliner took 52.32 ms. Allocated memory is still 1.2 GB. Free memory is still 1.2 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-16 00:23:12,886 INFO L168 Benchmark]: Boogie Preprocessor took 43.15 ms. Allocated memory is still 1.2 GB. Free memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 6.4 MB). Peak memory consumption was 6.4 MB. Max. memory is 11.5 GB. [2019-11-16 00:23:12,894 INFO L168 Benchmark]: RCFGBuilder took 774.44 ms. Allocated memory is still 1.2 GB. Free memory was 1.2 GB in the beginning and 1.1 GB in the end (delta: 44.8 MB). Peak memory consumption was 44.8 MB. Max. memory is 11.5 GB. [2019-11-16 00:23:12,894 INFO L168 Benchmark]: TraceAbstraction took 25194.52 ms. Allocated memory was 1.2 GB in the beginning and 2.2 GB in the end (delta: 976.7 MB). Free memory was 1.1 GB in the beginning and 1.8 GB in the end (delta: -687.6 MB). Peak memory consumption was 992.0 MB. Max. memory is 11.5 GB. [2019-11-16 00:23:12,895 INFO L168 Benchmark]: Witness Printer took 193.11 ms. Allocated memory is still 2.2 GB. Free memory was 1.8 GB in the beginning and 1.8 GB in the end (delta: 25.4 MB). Peak memory consumption was 25.4 MB. Max. memory is 11.5 GB. [2019-11-16 00:23:12,897 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.32 ms. Allocated memory is still 1.0 GB. Free memory is still 977.9 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 415.36 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 170.4 MB). Free memory was 952.4 MB in the beginning and 1.2 GB in the end (delta: -207.6 MB). Peak memory consumption was 29.0 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 52.32 ms. Allocated memory is still 1.2 GB. Free memory is still 1.2 GB. There was no memory consumed. Max. memory is 11.5 GB. * Boogie Preprocessor took 43.15 ms. Allocated memory is still 1.2 GB. Free memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 6.4 MB). Peak memory consumption was 6.4 MB. Max. memory is 11.5 GB. * RCFGBuilder took 774.44 ms. Allocated memory is still 1.2 GB. Free memory was 1.2 GB in the beginning and 1.1 GB in the end (delta: 44.8 MB). Peak memory consumption was 44.8 MB. Max. memory is 11.5 GB. * TraceAbstraction took 25194.52 ms. Allocated memory was 1.2 GB in the beginning and 2.2 GB in the end (delta: 976.7 MB). Free memory was 1.1 GB in the beginning and 1.8 GB in the end (delta: -687.6 MB). Peak memory consumption was 992.0 MB. Max. memory is 11.5 GB. * Witness Printer took 193.11 ms. Allocated memory is still 2.2 GB. Free memory was 1.8 GB in the beginning and 1.8 GB in the end (delta: 25.4 MB). Peak memory consumption was 25.4 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 608]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 65]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 171]: Loop Invariant Derived loop invariant: (((((!(4099bv32 == s__state) && !(4096bv32 == s__state)) && (((((((s__hit == 0bv32 && !(4369bv32 == s__state)) && !(4400bv32 == s__state)) && !(5bv32 == blastFlag)) && 65535bv32 == ag_X) && !(~bvadd64(s__state, 4294950912bv32) == 0bv32)) && ~bvadd64(s__s3__tmp__new_cipher__algorithms, 4294967040bv32) == 0bv32) && 61087bv32 == ag_Y) && !(~bvadd64(s__state, 4294955004bv32) == 0bv32)) && !(~bvadd64(s__state, 4294946816bv32) == 0bv32)) && !(4368bv32 == s__state)) || ((((!(4099bv32 == s__state) && !(4096bv32 == s__state)) && ((((((s__hit == 0bv32 && !(4369bv32 == s__state)) && !(4400bv32 == s__state)) && 2bv32 == blastFlag) && 65535bv32 == ag_X) && !(~bvadd64(s__state, 4294950912bv32) == 0bv32)) && 61087bv32 == ag_Y) && !(~bvadd64(s__state, 4294955004bv32) == 0bv32)) && !(~bvadd64(s__state, 4294946816bv32) == 0bv32)) && !(4368bv32 == s__state))) || (!(4401bv32 == s__state) && (((!(4099bv32 == s__state) && !(4096bv32 == s__state)) && ((((!(4369bv32 == s__state) && !(s__hit == 0bv32)) && !(4400bv32 == s__state)) && 2bv32 == blastFlag) && !(~bvadd64(s__state, 4294950912bv32) == 0bv32)) && !(~bvadd64(s__state, 4294955004bv32) == 0bv32)) && !(~bvadd64(s__state, 4294946816bv32) == 0bv32)) && !(4368bv32 == s__state)) - InvariantResult [Line: 129]: Loop Invariant Derived loop invariant: (((((((((((!(4099bv32 == s__state) && s__hit == 0bv32) && !(4096bv32 == s__state)) && !(4369bv32 == s__state)) && !(4400bv32 == s__state)) && !(5bv32 == blastFlag)) && !(~bvadd64(s__state, 4294950912bv32) == 0bv32)) && ~bvadd64(s__s3__tmp__new_cipher__algorithms, 4294967040bv32) == 0bv32) && 61087bv32 == ag_Y) && !(~bvadd64(s__state, 4294946816bv32) == 0bv32)) && !(4368bv32 == s__state)) && !(~bvadd64(s__state, 4294955004bv32) == 0bv32)) || ((((((((((!(4099bv32 == s__state) && s__hit == 0bv32) && !(4096bv32 == s__state)) && !(4369bv32 == s__state)) && !(4400bv32 == s__state)) && 2bv32 == blastFlag) && !(~bvadd64(s__state, 4294950912bv32) == 0bv32)) && 61087bv32 == ag_Y) && !(~bvadd64(s__state, 4294946816bv32) == 0bv32)) && !(4368bv32 == s__state)) && !(~bvadd64(s__state, 4294955004bv32) == 0bv32)) - InvariantResult [Line: 183]: Loop Invariant Derived loop invariant: ((!(4401bv32 == s__state) && ((((!(4400bv32 == s__state) && 2bv32 == blastFlag) && !(s__hit == 0bv32)) && 4560bv32 == s__state) || (((((((((!(4099bv32 == s__state) && !(4400bv32 == s__state) && 2bv32 == blastFlag) && !(4096bv32 == s__state)) && !(4369bv32 == s__state)) && !(s__hit == 0bv32)) && !(~bvadd64(s__state, 4294950912bv32) == 0bv32)) && !(4368bv32 == s__s3__tmp__next_state___0)) && !(~bvadd64(s__state, 4294946816bv32) == 0bv32)) && !(4368bv32 == s__state)) && !(~bvadd64(s__state, 4294955004bv32) == 0bv32)))) || ((((((((((((s__hit == 0bv32 && 4560bv32 == s__s3__tmp__next_state___0) && !(4369bv32 == s__state)) && !(~bvadd64(s__state, 4294950912bv32) == 0bv32)) && 61087bv32 == ag_Y) && !(4368bv32 == s__state)) && !(4099bv32 == s__state)) && !(4096bv32 == s__state)) && !(4400bv32 == s__state) && !(5bv32 == blastFlag)) && 65535bv32 == ag_X) && ~bvadd64(s__s3__tmp__new_cipher__algorithms, 4294967040bv32) == 0bv32) && !(~bvadd64(s__state, 4294946816bv32) == 0bv32)) && !(~bvadd64(s__state, 4294955004bv32) == 0bv32))) || (((((((((((!(4099bv32 == s__state) && s__hit == 0bv32) && !(4400bv32 == s__state) && 2bv32 == blastFlag) && 4560bv32 == s__s3__tmp__next_state___0) && !(4096bv32 == s__state)) && !(4369bv32 == s__state)) && 65535bv32 == ag_X) && !(~bvadd64(s__state, 4294950912bv32) == 0bv32)) && !(~bvadd64(s__state, 4294946816bv32) == 0bv32)) && 61087bv32 == ag_Y) && !(4368bv32 == s__state)) && !(~bvadd64(s__state, 4294955004bv32) == 0bv32)) - InvariantResult [Line: 141]: Loop Invariant Derived loop invariant: (((((((((((!(4099bv32 == s__state) && s__hit == 0bv32) && !(4096bv32 == s__state)) && !(4369bv32 == s__state)) && !(4400bv32 == s__state)) && 2bv32 == blastFlag) && 65535bv32 == ag_X) && !(~bvadd64(s__state, 4294950912bv32) == 0bv32)) && 61087bv32 == ag_Y) && !(~bvadd64(s__state, 4294946816bv32) == 0bv32)) && !(4368bv32 == s__state)) && !(~bvadd64(s__state, 4294955004bv32) == 0bv32)) || ((((((((((((s__hit == 0bv32 && !(4369bv32 == s__state)) && !(4400bv32 == s__state)) && !(5bv32 == blastFlag)) && !(~bvadd64(s__state, 4294950912bv32) == 0bv32)) && 61087bv32 == ag_Y) && !(4368bv32 == s__state)) && !(4099bv32 == s__state)) && !(4096bv32 == s__state)) && 65535bv32 == ag_X) && ~bvadd64(s__s3__tmp__new_cipher__algorithms, 4294967040bv32) == 0bv32) && !(~bvadd64(s__state, 4294946816bv32) == 0bv32)) && !(~bvadd64(s__state, 4294955004bv32) == 0bv32)) - InvariantResult [Line: 147]: Loop Invariant Derived loop invariant: ((((((!(4099bv32 == s__state) && !(4096bv32 == s__state)) && (((((s__hit == 0bv32 && !(4369bv32 == s__state)) && !(4400bv32 == s__state)) && !(5bv32 == blastFlag)) && 65535bv32 == ag_X) && ~bvadd64(s__s3__tmp__new_cipher__algorithms, 4294967040bv32) == 0bv32) && 61087bv32 == ag_Y) && !(~bvadd64(s__state, 4294950912bv32) == 0bv32)) && !(~bvadd64(s__state, 4294946816bv32) == 0bv32)) && !(4368bv32 == s__state)) && !(~bvadd64(s__state, 4294955004bv32) == 0bv32)) || ((((((!(4099bv32 == s__state) && !(4096bv32 == s__state)) && ((((s__hit == 0bv32 && !(4369bv32 == s__state)) && !(4400bv32 == s__state)) && 2bv32 == blastFlag) && 65535bv32 == ag_X) && 61087bv32 == ag_Y) && !(~bvadd64(s__state, 4294950912bv32) == 0bv32)) && !(~bvadd64(s__state, 4294946816bv32) == 0bv32)) && !(4368bv32 == s__state)) && !(~bvadd64(s__state, 4294955004bv32) == 0bv32)) - InvariantResult [Line: 111]: Loop Invariant Derived loop invariant: (((((((!(4099bv32 == s__state) && !(4401bv32 == s__state)) && !(4096bv32 == s__state)) && 0bv32 == blastFlag) && !(4369bv32 == s__state)) && !(4400bv32 == s__state)) && !(~bvadd64(s__state, 4294950912bv32) == 0bv32)) && !(~bvadd64(s__state, 4294946816bv32) == 0bv32)) && !(~bvadd64(s__state, 4294955004bv32) == 0bv32) - InvariantResult [Line: 92]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 189]: Loop Invariant Derived loop invariant: ((((((s__hit == 0bv32 && 4560bv32 == s__s3__tmp__next_state___0) && 4352bv32 == s__state) && 2bv32 == blastFlag) && 61087bv32 == ag_Y) && 65535bv32 == ag_X) || (((4352bv32 == s__state && !(s__hit == 0bv32)) && 2bv32 == blastFlag) && ~bvadd64(s__s3__tmp__next_state___0, 4294967293bv32) == 0bv32)) || ((((((s__hit == 0bv32 && 4560bv32 == s__s3__tmp__next_state___0) && 4352bv32 == s__state) && !(5bv32 == blastFlag)) && 61087bv32 == ag_Y) && 65535bv32 == ag_X) && ~bvadd64(s__s3__tmp__new_cipher__algorithms, 4294967040bv32) == 0bv32) - InvariantResult [Line: 165]: Loop Invariant Derived loop invariant: (((!(4099bv32 == s__state) && !(~bvadd64(s__state, 4294946816bv32) == 0bv32)) && !(4368bv32 == s__state)) && (((((((s__hit == 0bv32 && !(4096bv32 == s__state)) && !(4369bv32 == s__state)) && !(4400bv32 == s__state)) && 2bv32 == blastFlag) && 65535bv32 == ag_X) && !(~bvadd64(s__state, 4294950912bv32) == 0bv32)) && 61087bv32 == ag_Y) && !(~bvadd64(s__state, 4294955004bv32) == 0bv32)) || (((!(4099bv32 == s__state) && ((((((((s__hit == 0bv32 && !(4096bv32 == s__state)) && !(4369bv32 == s__state)) && !(4400bv32 == s__state)) && !(5bv32 == blastFlag)) && 65535bv32 == ag_X) && !(~bvadd64(s__state, 4294950912bv32) == 0bv32)) && ~bvadd64(s__s3__tmp__new_cipher__algorithms, 4294967040bv32) == 0bv32) && 61087bv32 == ag_Y) && !(~bvadd64(s__state, 4294955004bv32) == 0bv32)) && !(~bvadd64(s__state, 4294946816bv32) == 0bv32)) && !(4368bv32 == s__state)) - InvariantResult [Line: 123]: Loop Invariant Derived loop invariant: ((((((((!(4099bv32 == s__state) && s__hit == 0bv32) && !(4096bv32 == s__state)) && !(4369bv32 == s__state)) && 2bv32 == blastFlag) && !(~bvadd64(s__state, 4294950912bv32) == 0bv32)) && !(~bvadd64(s__state, 4294946816bv32) == 0bv32)) && !(4368bv32 == s__state)) && !(~bvadd64(s__state, 4294955004bv32) == 0bv32)) || ((((((((((((s__hit == 0bv32 && 4560bv32 == s__s3__tmp__next_state___0) && !(4369bv32 == s__state)) && !(5bv32 == blastFlag)) && !(~bvadd64(s__state, 4294950912bv32) == 0bv32)) && 61087bv32 == ag_Y) && !(4368bv32 == s__state)) && !(4099bv32 == s__state)) && !(4096bv32 == s__state)) && 65535bv32 == ag_X) && ~bvadd64(s__s3__tmp__new_cipher__algorithms, 4294967040bv32) == 0bv32) && !(~bvadd64(s__state, 4294946816bv32) == 0bv32)) && !(~bvadd64(s__state, 4294955004bv32) == 0bv32)) - InvariantResult [Line: 99]: Loop Invariant Derived loop invariant: (((((((!(4099bv32 == s__state) && !(4401bv32 == s__state)) && 0bv32 == blastFlag) && !(4369bv32 == s__state)) && !(4400bv32 == s__state)) && !(~bvadd64(s__state, 4294950912bv32) == 0bv32)) && !(~bvadd64(s__state, 4294946816bv32) == 0bv32)) && !(4368bv32 == s__state)) && !(~bvadd64(s__state, 4294955004bv32) == 0bv32) - InvariantResult [Line: 177]: Loop Invariant Derived loop invariant: (((!(4099bv32 == s__state) && ((((((((s__hit == 0bv32 && !(4096bv32 == s__state)) && !(4369bv32 == s__state)) && !(4400bv32 == s__state)) && 2bv32 == blastFlag) && 65535bv32 == ag_X) && !(~bvadd64(s__state, 4294950912bv32) == 0bv32)) && !(~bvadd64(s__state, 4294946816bv32) == 0bv32)) && 61087bv32 == ag_Y) && !(~bvadd64(s__state, 4294955004bv32) == 0bv32)) && !(4368bv32 == s__state)) || ((!(4401bv32 == s__state) && !(4400bv32 == s__state)) && (!(4099bv32 == s__state) && (((((!(4096bv32 == s__state) && !(4369bv32 == s__state)) && !(s__hit == 0bv32)) && 2bv32 == blastFlag) && !(~bvadd64(s__state, 4294950912bv32) == 0bv32)) && !(~bvadd64(s__state, 4294946816bv32) == 0bv32)) && !(~bvadd64(s__state, 4294955004bv32) == 0bv32)) && !(4368bv32 == s__state))) || ((!(4099bv32 == s__state) && (((((((((s__hit == 0bv32 && !(4096bv32 == s__state)) && !(4369bv32 == s__state)) && !(4400bv32 == s__state)) && !(5bv32 == blastFlag)) && 65535bv32 == ag_X) && !(~bvadd64(s__state, 4294950912bv32) == 0bv32)) && ~bvadd64(s__s3__tmp__new_cipher__algorithms, 4294967040bv32) == 0bv32) && !(~bvadd64(s__state, 4294946816bv32) == 0bv32)) && 61087bv32 == ag_Y) && !(~bvadd64(s__state, 4294955004bv32) == 0bv32)) && !(4368bv32 == s__state)) - InvariantResult [Line: 135]: Loop Invariant Derived loop invariant: (((((((((((!(4099bv32 == s__state) && s__hit == 0bv32) && !(4096bv32 == s__state)) && !(4369bv32 == s__state)) && !(4400bv32 == s__state)) && 2bv32 == blastFlag) && 65535bv32 == ag_X) && !(~bvadd64(s__state, 4294950912bv32) == 0bv32)) && !(~bvadd64(s__state, 4294946816bv32) == 0bv32)) && 61087bv32 == ag_Y) && !(4368bv32 == s__state)) && !(~bvadd64(s__state, 4294955004bv32) == 0bv32)) || ((((((((((((s__hit == 0bv32 && !(4369bv32 == s__state)) && !(4400bv32 == s__state)) && !(5bv32 == blastFlag)) && !(~bvadd64(s__state, 4294950912bv32) == 0bv32)) && 61087bv32 == ag_Y) && !(4368bv32 == s__state)) && !(4099bv32 == s__state)) && !(4096bv32 == s__state)) && 65535bv32 == ag_X) && ~bvadd64(s__s3__tmp__new_cipher__algorithms, 4294967040bv32) == 0bv32) && !(~bvadd64(s__state, 4294946816bv32) == 0bv32)) && !(~bvadd64(s__state, 4294955004bv32) == 0bv32)) - InvariantResult [Line: 96]: Loop Invariant Derived loop invariant: ~bvadd64(s__state, 4294955004bv32) == 0bv32 && 0bv32 == blastFlag - InvariantResult [Line: 93]: Loop Invariant Derived loop invariant: (((((((((((((((((((((((((((((s__hit == 0bv32 && 2bv32 == blastFlag) && 65535bv32 == ag_X) && 61087bv32 == ag_Y) && 4448bv32 == s__state) || (((((((((((!(4099bv32 == s__state) && s__hit == 0bv32) && 4560bv32 == s__s3__tmp__next_state___0) && !(4096bv32 == s__state)) && !(4369bv32 == s__state)) && 2bv32 == blastFlag) && !(~bvadd64(s__state, 4294950912bv32) == 0bv32)) && 65535bv32 == ag_X) && 61087bv32 == ag_Y) && !(~bvadd64(s__state, 4294946816bv32) == 0bv32)) && !(4368bv32 == s__state)) && !(~bvadd64(s__state, 4294955004bv32) == 0bv32))) || (((4352bv32 == s__state && !(s__hit == 0bv32)) && 2bv32 == blastFlag) && ~bvadd64(s__s3__tmp__next_state___0, 4294967293bv32) == 0bv32)) || (0bv32 == blastFlag && 4368bv32 == s__state)) || (((((s__hit == 0bv32 && !(5bv32 == blastFlag)) && 4512bv32 == s__state) && 61087bv32 == ag_Y) && 65535bv32 == ag_X) && ~bvadd64(s__s3__tmp__new_cipher__algorithms, 4294967040bv32) == 0bv32)) || (((((!(s__hit == 0bv32) && !(4368bv32 == s__s3__tmp__next_state___0)) && 61087bv32 == ag_Y) && ~bvadd64(s__state, 4294967293bv32) == 0bv32) && 65535bv32 == ag_X) && ~bvadd64(s__s3__tmp__new_cipher__algorithms, 4294967040bv32) == 0bv32)) || ((((s__hit == 0bv32 && 4496bv32 == s__state) && 2bv32 == blastFlag) && 65535bv32 == ag_X) && 61087bv32 == ag_Y)) || (1bv32 == blastFlag && 4384bv32 == s__state)) || ((4528bv32 == s__state && !(s__hit == 0bv32)) && 2bv32 == blastFlag)) || (((((s__hit == 0bv32 && !(5bv32 == blastFlag)) && 61087bv32 == ag_Y) && 4480bv32 == s__state) && 65535bv32 == ag_X) && ~bvadd64(s__s3__tmp__new_cipher__algorithms, 4294967040bv32) == 0bv32)) || (((((s__hit == 0bv32 && !(5bv32 == blastFlag)) && 61087bv32 == ag_Y) && 4528bv32 == s__state) && 65535bv32 == ag_X) && ~bvadd64(s__s3__tmp__new_cipher__algorithms, 4294967040bv32) == 0bv32)) || (((((s__hit == 0bv32 && !(5bv32 == blastFlag)) && 61087bv32 == ag_Y) && 4496bv32 == s__state) && 65535bv32 == ag_X) && ~bvadd64(s__s3__tmp__new_cipher__algorithms, 4294967040bv32) == 0bv32)) || ((((((((((((s__hit == 0bv32 && 4560bv32 == s__s3__tmp__next_state___0) && !(4369bv32 == s__state)) && !(5bv32 == blastFlag)) && !(~bvadd64(s__state, 4294950912bv32) == 0bv32)) && 61087bv32 == ag_Y) && !(4368bv32 == s__state)) && !(4099bv32 == s__state)) && !(4096bv32 == s__state)) && 65535bv32 == ag_X) && ~bvadd64(s__s3__tmp__new_cipher__algorithms, 4294967040bv32) == 0bv32) && !(~bvadd64(s__state, 4294946816bv32) == 0bv32)) && !(~bvadd64(s__state, 4294955004bv32) == 0bv32))) || ((((s__hit == 0bv32 && 4480bv32 == s__state) && 2bv32 == blastFlag) && 65535bv32 == ag_X) && 61087bv32 == ag_Y)) || (((2bv32 == blastFlag && 65535bv32 == ag_X) && 4512bv32 == s__state) && 61087bv32 == ag_Y)) || ((!(s__hit == 0bv32) && 2bv32 == blastFlag) && 4512bv32 == s__state)) || ((!(s__hit == 0bv32) && 4560bv32 == s__state) && 2bv32 == blastFlag)) || (((~bvadd64(s__state, 4294967293bv32) == 0bv32 && !(s__hit == 0bv32)) && 2bv32 == blastFlag) && !(4368bv32 == s__s3__tmp__next_state___0))) || (((((s__hit == 0bv32 && !(5bv32 == blastFlag)) && 65535bv32 == ag_X) && ~bvadd64(s__s3__tmp__new_cipher__algorithms, 4294967040bv32) == 0bv32) && 61087bv32 == ag_Y) && 4448bv32 == s__state)) || (((((s__hit == 0bv32 && !(5bv32 == blastFlag)) && 61087bv32 == ag_Y) && 65535bv32 == ag_X) && 4464bv32 == s__state) && ~bvadd64(s__s3__tmp__new_cipher__algorithms, 4294967040bv32) == 0bv32)) || (((4528bv32 == s__state && 2bv32 == blastFlag) && 65535bv32 == ag_X) && 61087bv32 == ag_Y)) || (((((s__hit == 0bv32 && !(5bv32 == blastFlag)) && 61087bv32 == ag_Y) && 65535bv32 == ag_X) && ~bvadd64(s__s3__tmp__new_cipher__algorithms, 4294967040bv32) == 0bv32) && 4432bv32 == s__state)) || ((((s__hit == 0bv32 && !(5bv32 == blastFlag)) && 61087bv32 == ag_Y) && 4416bv32 == s__state) && ~bvadd64(s__s3__tmp__new_cipher__algorithms, 4294967040bv32) == 0bv32)) || ((((s__hit == 0bv32 && 2bv32 == blastFlag) && 65535bv32 == ag_X) && 4464bv32 == s__state) && 61087bv32 == ag_Y)) || ((s__hit == 0bv32 && 2bv32 == blastFlag) && 4400bv32 == s__state)) || (((s__hit == 0bv32 && 4416bv32 == s__state) && 2bv32 == blastFlag) && 61087bv32 == ag_Y)) || ((((s__hit == 0bv32 && 2bv32 == blastFlag) && 65535bv32 == ag_X) && 61087bv32 == ag_Y) && 4432bv32 == s__state) - InvariantResult [Line: 192]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 65]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 616]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 159]: Loop Invariant Derived loop invariant: (((((!(4099bv32 == s__state) && !(4096bv32 == s__state)) && !(~bvadd64(s__state, 4294950912bv32) == 0bv32)) && !(~bvadd64(s__state, 4294946816bv32) == 0bv32)) && (((((s__hit == 0bv32 && !(4369bv32 == s__state)) && !(4400bv32 == s__state)) && 2bv32 == blastFlag) && 65535bv32 == ag_X) && 61087bv32 == ag_Y) && !(~bvadd64(s__state, 4294955004bv32) == 0bv32)) && !(4368bv32 == s__state)) || (((((!(4099bv32 == s__state) && !(4096bv32 == s__state)) && ((((((s__hit == 0bv32 && !(4369bv32 == s__state)) && !(4400bv32 == s__state)) && !(5bv32 == blastFlag)) && 65535bv32 == ag_X) && ~bvadd64(s__s3__tmp__new_cipher__algorithms, 4294967040bv32) == 0bv32) && 61087bv32 == ag_Y) && !(~bvadd64(s__state, 4294955004bv32) == 0bv32)) && !(~bvadd64(s__state, 4294950912bv32) == 0bv32)) && !(~bvadd64(s__state, 4294946816bv32) == 0bv32)) && !(4368bv32 == s__state)) - InvariantResult [Line: 8]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 117]: Loop Invariant Derived loop invariant: (((((((((((((s__hit == 0bv32 && 4560bv32 == s__s3__tmp__next_state___0) && !(4369bv32 == s__state)) && !(4400bv32 == s__state)) && 2bv32 == blastFlag) && !(~bvadd64(s__state, 4294950912bv32) == 0bv32)) && 61087bv32 == ag_Y) && !(4368bv32 == s__state)) && !(4099bv32 == s__state)) && !(4096bv32 == s__state)) && 65535bv32 == ag_X) && !(~bvadd64(s__state, 4294946816bv32) == 0bv32)) && !(~bvadd64(s__state, 4294955004bv32) == 0bv32)) || (((((((((((((s__hit == 0bv32 && 4560bv32 == s__s3__tmp__next_state___0) && !(4369bv32 == s__state)) && !(4400bv32 == s__state)) && !(5bv32 == blastFlag)) && !(~bvadd64(s__state, 4294950912bv32) == 0bv32)) && 61087bv32 == ag_Y) && !(4368bv32 == s__state)) && !(4099bv32 == s__state)) && !(4096bv32 == s__state)) && 65535bv32 == ag_X) && ~bvadd64(s__s3__tmp__new_cipher__algorithms, 4294967040bv32) == 0bv32) && !(~bvadd64(s__state, 4294946816bv32) == 0bv32)) && !(~bvadd64(s__state, 4294955004bv32) == 0bv32))) || (((((((((!(4099bv32 == s__state) && !(4401bv32 == s__state)) && !(4096bv32 == s__state)) && !(4369bv32 == s__state)) && !(4400bv32 == s__state)) && !(~bvadd64(s__state, 4294950912bv32) == 0bv32)) && !(~bvadd64(s__state, 4294946816bv32) == 0bv32)) && 1bv32 == blastFlag) && !(4368bv32 == s__state)) && !(~bvadd64(s__state, 4294955004bv32) == 0bv32)) - InvariantResult [Line: 195]: Loop Invariant Derived loop invariant: 1 - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 124 locations, 1 error locations. Result: SAFE, OverallTime: 25.0s, OverallIterations: 24, TraceHistogramMax: 22, AutomataDifference: 6.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 5.2s, HoareTripleCheckerStatistics: 4322 SDtfs, 3404 SDslu, 3841 SDs, 0 SdLazy, 3752 SolverSat, 645 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 3.8s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 9836 GetRequests, 9781 SyntacticMatches, 0 SemanticMatches, 55 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=9180occurred in iteration=21, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 1.9s AutomataMinimizationTime, 24 MinimizatonAttempts, 1298 StatesRemovedByMinimization, 18 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 23 LocationsWithAnnotation, 23 PreInvPairs, 263 NumberOfFragments, 2104 HoareAnnotationTreeSize, 23 FomulaSimplifications, 10070 FormulaSimplificationTreeSizeReduction, 0.7s HoareSimplificationTime, 23 FomulaSimplificationsInter, 5527 FormulaSimplificationTreeSizeReductionInter, 4.4s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.5s SsaConstructionTime, 1.2s SatisfiabilityAnalysisTime, 3.1s InterpolantComputationTime, 4933 NumberOfCodeBlocks, 4933 NumberOfCodeBlocksAsserted, 24 NumberOfCheckSat, 9818 ConstructedInterpolants, 0 QuantifiedInterpolants, 3880007 SizeOfPredicates, 20 NumberOfNonLiveVariables, 6480 ConjunctsInSsa, 52 ConjunctsInUnsatCore, 48 InterpolantComputations, 42 PerfectInterpolantSequences, 38264/38368 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...