./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/ssh/s3_clnt.blast.03.i.cil-1.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 678e0110 Calling Ultimate with: /usr/lib/jvm/java-8-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/run_dir_3a4ed6af-12e8-48f9-ba15-2ea66e97af8d/bin/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/run_dir_3a4ed6af-12e8-48f9-ba15-2ea66e97af8d/bin/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_3a4ed6af-12e8-48f9-ba15-2ea66e97af8d/bin/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_3a4ed6af-12e8-48f9-ba15-2ea66e97af8d/bin/uautomizer/config/AutomizerReach.xml -i ../../sv-benchmarks/c/ssh/s3_clnt.blast.03.i.cil-1.c -s /tmp/vcloud-vcloud-master/worker/run_dir_3a4ed6af-12e8-48f9-ba15-2ea66e97af8d/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_3a4ed6af-12e8-48f9-ba15-2ea66e97af8d/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 ed035556db4b60d2bb3e3e70af5f975a04e628c4 ....................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... 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_3a4ed6af-12e8-48f9-ba15-2ea66e97af8d/bin/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/run_dir_3a4ed6af-12e8-48f9-ba15-2ea66e97af8d/bin/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_3a4ed6af-12e8-48f9-ba15-2ea66e97af8d/bin/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_3a4ed6af-12e8-48f9-ba15-2ea66e97af8d/bin/uautomizer/config/AutomizerReach.xml -i ../../sv-benchmarks/c/ssh/s3_clnt.blast.03.i.cil-1.c -s /tmp/vcloud-vcloud-master/worker/run_dir_3a4ed6af-12e8-48f9-ba15-2ea66e97af8d/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_3a4ed6af-12e8-48f9-ba15-2ea66e97af8d/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 ed035556db4b60d2bb3e3e70af5f975a04e628c4 ...................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE --- Real Ultimate output --- This is Ultimate 0.1.24-678e011 [2019-11-20 04:34:22,607 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-20 04:34:22,609 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-20 04:34:22,619 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-20 04:34:22,619 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-20 04:34:22,620 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-20 04:34:22,622 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-20 04:34:22,624 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-20 04:34:22,626 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-20 04:34:22,627 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-20 04:34:22,628 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-20 04:34:22,629 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-20 04:34:22,629 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-20 04:34:22,630 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-20 04:34:22,631 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-20 04:34:22,633 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-20 04:34:22,633 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-20 04:34:22,634 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-20 04:34:22,636 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-20 04:34:22,639 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-20 04:34:22,640 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-20 04:34:22,641 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-20 04:34:22,642 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-20 04:34:22,643 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-20 04:34:22,645 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-20 04:34:22,646 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-20 04:34:22,646 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-20 04:34:22,647 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-20 04:34:22,647 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-20 04:34:22,648 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-20 04:34:22,648 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-20 04:34:22,649 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-20 04:34:22,649 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-20 04:34:22,650 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-20 04:34:22,651 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-20 04:34:22,651 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-20 04:34:22,652 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-20 04:34:22,652 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-20 04:34:22,652 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-20 04:34:22,653 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-20 04:34:22,654 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-20 04:34:22,654 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_3a4ed6af-12e8-48f9-ba15-2ea66e97af8d/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf [2019-11-20 04:34:22,667 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-20 04:34:22,667 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-20 04:34:22,668 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-20 04:34:22,668 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-20 04:34:22,668 INFO L138 SettingsManager]: * Use SBE=true [2019-11-20 04:34:22,669 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-20 04:34:22,669 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-20 04:34:22,669 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-20 04:34:22,669 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-20 04:34:22,669 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-20 04:34:22,670 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-11-20 04:34:22,670 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-20 04:34:22,670 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-11-20 04:34:22,670 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-20 04:34:22,671 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-20 04:34:22,671 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-20 04:34:22,671 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-11-20 04:34:22,671 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-20 04:34:22,671 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-20 04:34:22,672 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-20 04:34:22,672 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-20 04:34:22,672 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-20 04:34:22,672 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-20 04:34:22,673 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-20 04:34:22,673 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-11-20 04:34:22,673 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-11-20 04:34:22,673 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-11-20 04:34:22,673 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-11-20 04:34:22,674 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_3a4ed6af-12e8-48f9-ba15-2ea66e97af8d/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 -> ed035556db4b60d2bb3e3e70af5f975a04e628c4 [2019-11-20 04:34:22,805 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-20 04:34:22,815 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-20 04:34:22,818 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-20 04:34:22,819 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-20 04:34:22,819 INFO L275 PluginConnector]: CDTParser initialized [2019-11-20 04:34:22,820 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_3a4ed6af-12e8-48f9-ba15-2ea66e97af8d/bin/uautomizer/../../sv-benchmarks/c/ssh/s3_clnt.blast.03.i.cil-1.c [2019-11-20 04:34:22,870 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_3a4ed6af-12e8-48f9-ba15-2ea66e97af8d/bin/uautomizer/data/8167b7243/10958616e6c145ac884645e45c7e3b10/FLAGa42a2a1d0 [2019-11-20 04:34:23,365 INFO L306 CDTParser]: Found 1 translation units. [2019-11-20 04:34:23,368 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_3a4ed6af-12e8-48f9-ba15-2ea66e97af8d/sv-benchmarks/c/ssh/s3_clnt.blast.03.i.cil-1.c [2019-11-20 04:34:23,399 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_3a4ed6af-12e8-48f9-ba15-2ea66e97af8d/bin/uautomizer/data/8167b7243/10958616e6c145ac884645e45c7e3b10/FLAGa42a2a1d0 [2019-11-20 04:34:23,592 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_3a4ed6af-12e8-48f9-ba15-2ea66e97af8d/bin/uautomizer/data/8167b7243/10958616e6c145ac884645e45c7e3b10 [2019-11-20 04:34:23,595 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-20 04:34:23,596 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-11-20 04:34:23,597 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-20 04:34:23,597 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-20 04:34:23,601 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-20 04:34:23,601 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.11 04:34:23" (1/1) ... [2019-11-20 04:34:23,603 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5fb910e0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 04:34:23, skipping insertion in model container [2019-11-20 04:34:23,603 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.11 04:34:23" (1/1) ... [2019-11-20 04:34:23,609 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-11-20 04:34:23,680 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-11-20 04:34:24,146 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-20 04:34:24,160 INFO L188 MainTranslator]: Completed pre-run [2019-11-20 04:34:24,262 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-20 04:34:24,292 INFO L192 MainTranslator]: Completed translation [2019-11-20 04:34:24,292 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 04:34:24 WrapperNode [2019-11-20 04:34:24,293 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-20 04:34:24,294 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-11-20 04:34:24,294 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-11-20 04:34:24,294 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-11-20 04:34:24,301 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 04:34:24" (1/1) ... [2019-11-20 04:34:24,336 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 04:34:24" (1/1) ... [2019-11-20 04:34:24,391 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-11-20 04:34:24,396 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-20 04:34:24,396 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-20 04:34:24,397 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-20 04:34:24,405 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 04:34:24" (1/1) ... [2019-11-20 04:34:24,405 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 04:34:24" (1/1) ... [2019-11-20 04:34:24,430 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 04:34:24" (1/1) ... [2019-11-20 04:34:24,432 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 04:34:24" (1/1) ... [2019-11-20 04:34:24,493 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 04:34:24" (1/1) ... [2019-11-20 04:34:24,507 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 04:34:24" (1/1) ... [2019-11-20 04:34:24,523 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 04:34:24" (1/1) ... [2019-11-20 04:34:24,528 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-20 04:34:24,533 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-20 04:34:24,534 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-20 04:34:24,534 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-20 04:34:24,535 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 04:34:24" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_3a4ed6af-12e8-48f9-ba15-2ea66e97af8d/bin/uautomizer/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-20 04:34:24,610 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2019-11-20 04:34:24,610 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-11-20 04:34:24,610 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-11-20 04:34:24,610 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-11-20 04:34:24,611 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2019-11-20 04:34:24,611 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2019-11-20 04:34:24,612 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-20 04:34:24,612 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-20 04:34:24,925 WARN L736 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-11-20 04:34:25,675 INFO L689 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##85: assume !false; [2019-11-20 04:34:25,676 INFO L689 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##84: assume false; [2019-11-20 04:34:25,677 INFO L280 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-20 04:34:25,677 INFO L285 CfgBuilder]: Removed 7 assume(true) statements. [2019-11-20 04:34:25,680 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 04:34:25 BoogieIcfgContainer [2019-11-20 04:34:25,680 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-20 04:34:25,683 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-20 04:34:25,683 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-20 04:34:25,685 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-20 04:34:25,686 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.11 04:34:23" (1/3) ... [2019-11-20 04:34:25,687 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@37d6cf3c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.11 04:34:25, skipping insertion in model container [2019-11-20 04:34:25,687 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 04:34:24" (2/3) ... [2019-11-20 04:34:25,688 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@37d6cf3c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.11 04:34:25, skipping insertion in model container [2019-11-20 04:34:25,688 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 04:34:25" (3/3) ... [2019-11-20 04:34:25,691 INFO L109 eAbstractionObserver]: Analyzing ICFG s3_clnt.blast.03.i.cil-1.c [2019-11-20 04:34:25,699 INFO L153 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-20 04:34:25,706 INFO L165 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-11-20 04:34:25,717 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-11-20 04:34:25,741 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-20 04:34:25,741 INFO L374 AbstractCegarLoop]: Hoare is true [2019-11-20 04:34:25,742 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-20 04:34:25,742 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-20 04:34:25,742 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-20 04:34:25,742 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-20 04:34:25,742 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-20 04:34:25,742 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-20 04:34:25,768 INFO L276 IsEmpty]: Start isEmpty. Operand 129 states. [2019-11-20 04:34:25,774 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2019-11-20 04:34:25,774 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 04:34:25,775 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 04:34:25,775 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 04:34:25,780 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 04:34:25,780 INFO L82 PathProgramCache]: Analyzing trace with hash -1457695037, now seen corresponding path program 1 times [2019-11-20 04:34:25,788 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 04:34:25,789 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2111812495] [2019-11-20 04:34:25,789 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 04:34:25,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 04:34:26,066 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 04:34:26,067 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2111812495] [2019-11-20 04:34:26,067 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 04:34:26,067 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-20 04:34:26,068 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1889654753] [2019-11-20 04:34:26,072 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-20 04:34:26,072 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 04:34:26,083 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-20 04:34:26,083 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-20 04:34:26,085 INFO L87 Difference]: Start difference. First operand 129 states. Second operand 4 states. [2019-11-20 04:34:26,513 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 04:34:26,513 INFO L93 Difference]: Finished difference Result 255 states and 430 transitions. [2019-11-20 04:34:26,513 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-20 04:34:26,514 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 24 [2019-11-20 04:34:26,515 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 04:34:26,525 INFO L225 Difference]: With dead ends: 255 [2019-11-20 04:34:26,525 INFO L226 Difference]: Without dead ends: 116 [2019-11-20 04:34:26,529 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-20 04:34:26,547 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 116 states. [2019-11-20 04:34:26,567 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 116 to 115. [2019-11-20 04:34:26,568 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 115 states. [2019-11-20 04:34:26,570 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 115 states to 115 states and 172 transitions. [2019-11-20 04:34:26,572 INFO L78 Accepts]: Start accepts. Automaton has 115 states and 172 transitions. Word has length 24 [2019-11-20 04:34:26,572 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 04:34:26,572 INFO L462 AbstractCegarLoop]: Abstraction has 115 states and 172 transitions. [2019-11-20 04:34:26,572 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-20 04:34:26,573 INFO L276 IsEmpty]: Start isEmpty. Operand 115 states and 172 transitions. [2019-11-20 04:34:26,574 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2019-11-20 04:34:26,574 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 04:34:26,575 INFO L410 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, 1, 1, 1] [2019-11-20 04:34:26,575 INFO L410 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 04:34:26,575 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 04:34:26,576 INFO L82 PathProgramCache]: Analyzing trace with hash 1001988123, now seen corresponding path program 1 times [2019-11-20 04:34:26,576 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 04:34:26,576 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1028896853] [2019-11-20 04:34:26,576 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 04:34:26,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 04:34:26,777 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-11-20 04:34:26,778 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1028896853] [2019-11-20 04:34:26,778 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 04:34:26,778 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-20 04:34:26,778 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [708814474] [2019-11-20 04:34:26,780 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-20 04:34:26,780 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 04:34:26,784 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-20 04:34:26,784 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-20 04:34:26,785 INFO L87 Difference]: Start difference. First operand 115 states and 172 transitions. Second operand 3 states. [2019-11-20 04:34:26,835 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 04:34:26,835 INFO L93 Difference]: Finished difference Result 321 states and 484 transitions. [2019-11-20 04:34:26,836 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-20 04:34:26,836 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 38 [2019-11-20 04:34:26,837 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 04:34:26,839 INFO L225 Difference]: With dead ends: 321 [2019-11-20 04:34:26,839 INFO L226 Difference]: Without dead ends: 216 [2019-11-20 04:34:26,841 INFO L630 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-20 04:34:26,842 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 216 states. [2019-11-20 04:34:26,857 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 216 to 216. [2019-11-20 04:34:26,858 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 216 states. [2019-11-20 04:34:26,860 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 216 states to 216 states and 320 transitions. [2019-11-20 04:34:26,860 INFO L78 Accepts]: Start accepts. Automaton has 216 states and 320 transitions. Word has length 38 [2019-11-20 04:34:26,860 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 04:34:26,861 INFO L462 AbstractCegarLoop]: Abstraction has 216 states and 320 transitions. [2019-11-20 04:34:26,861 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-20 04:34:26,861 INFO L276 IsEmpty]: Start isEmpty. Operand 216 states and 320 transitions. [2019-11-20 04:34:26,863 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2019-11-20 04:34:26,864 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 04:34:26,864 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 04:34:26,864 INFO L410 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 04:34:26,864 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 04:34:26,865 INFO L82 PathProgramCache]: Analyzing trace with hash -596933037, now seen corresponding path program 1 times [2019-11-20 04:34:26,865 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 04:34:26,865 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1928606828] [2019-11-20 04:34:26,865 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 04:34:26,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 04:34:26,954 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-11-20 04:34:26,954 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1928606828] [2019-11-20 04:34:26,955 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 04:34:26,955 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-20 04:34:26,955 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1250795770] [2019-11-20 04:34:26,956 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-20 04:34:26,956 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 04:34:26,956 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-20 04:34:26,956 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-20 04:34:26,957 INFO L87 Difference]: Start difference. First operand 216 states and 320 transitions. Second operand 3 states. [2019-11-20 04:34:27,044 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 04:34:27,044 INFO L93 Difference]: Finished difference Result 420 states and 629 transitions. [2019-11-20 04:34:27,047 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-20 04:34:27,047 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 53 [2019-11-20 04:34:27,048 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 04:34:27,051 INFO L225 Difference]: With dead ends: 420 [2019-11-20 04:34:27,051 INFO L226 Difference]: Without dead ends: 315 [2019-11-20 04:34:27,052 INFO L630 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-20 04:34:27,053 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 315 states. [2019-11-20 04:34:27,093 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 315 to 315. [2019-11-20 04:34:27,094 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 315 states. [2019-11-20 04:34:27,096 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 315 states to 315 states and 466 transitions. [2019-11-20 04:34:27,096 INFO L78 Accepts]: Start accepts. Automaton has 315 states and 466 transitions. Word has length 53 [2019-11-20 04:34:27,097 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 04:34:27,097 INFO L462 AbstractCegarLoop]: Abstraction has 315 states and 466 transitions. [2019-11-20 04:34:27,098 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-20 04:34:27,098 INFO L276 IsEmpty]: Start isEmpty. Operand 315 states and 466 transitions. [2019-11-20 04:34:27,105 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2019-11-20 04:34:27,108 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 04:34:27,108 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 3, 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, 1] [2019-11-20 04:34:27,109 INFO L410 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 04:34:27,109 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 04:34:27,109 INFO L82 PathProgramCache]: Analyzing trace with hash -1173568974, now seen corresponding path program 1 times [2019-11-20 04:34:27,110 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 04:34:27,110 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [782550614] [2019-11-20 04:34:27,110 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 04:34:27,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 04:34:27,283 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 27 proven. 0 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2019-11-20 04:34:27,283 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [782550614] [2019-11-20 04:34:27,284 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 04:34:27,284 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-20 04:34:27,284 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1590615729] [2019-11-20 04:34:27,285 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-20 04:34:27,285 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 04:34:27,285 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-20 04:34:27,285 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-20 04:34:27,286 INFO L87 Difference]: Start difference. First operand 315 states and 466 transitions. Second operand 4 states. [2019-11-20 04:34:27,953 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 04:34:27,953 INFO L93 Difference]: Finished difference Result 806 states and 1197 transitions. [2019-11-20 04:34:27,953 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-20 04:34:27,954 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 71 [2019-11-20 04:34:27,954 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 04:34:27,958 INFO L225 Difference]: With dead ends: 806 [2019-11-20 04:34:27,958 INFO L226 Difference]: Without dead ends: 501 [2019-11-20 04:34:27,960 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-20 04:34:27,961 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 501 states. [2019-11-20 04:34:27,986 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 501 to 365. [2019-11-20 04:34:27,986 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 365 states. [2019-11-20 04:34:27,988 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 365 states to 365 states and 552 transitions. [2019-11-20 04:34:27,989 INFO L78 Accepts]: Start accepts. Automaton has 365 states and 552 transitions. Word has length 71 [2019-11-20 04:34:27,989 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 04:34:27,989 INFO L462 AbstractCegarLoop]: Abstraction has 365 states and 552 transitions. [2019-11-20 04:34:27,990 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-20 04:34:27,990 INFO L276 IsEmpty]: Start isEmpty. Operand 365 states and 552 transitions. [2019-11-20 04:34:27,993 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2019-11-20 04:34:27,994 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 04:34:27,994 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 3, 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, 1] [2019-11-20 04:34:27,994 INFO L410 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 04:34:27,995 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 04:34:27,995 INFO L82 PathProgramCache]: Analyzing trace with hash -1307582480, now seen corresponding path program 1 times [2019-11-20 04:34:27,995 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 04:34:27,995 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1998538046] [2019-11-20 04:34:27,996 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 04:34:28,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 04:34:28,114 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 27 proven. 0 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2019-11-20 04:34:28,115 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1998538046] [2019-11-20 04:34:28,115 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 04:34:28,115 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-20 04:34:28,116 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [916500151] [2019-11-20 04:34:28,116 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-20 04:34:28,116 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 04:34:28,117 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-20 04:34:28,117 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-20 04:34:28,117 INFO L87 Difference]: Start difference. First operand 365 states and 552 transitions. Second operand 4 states. [2019-11-20 04:34:28,565 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 04:34:28,565 INFO L93 Difference]: Finished difference Result 806 states and 1218 transitions. [2019-11-20 04:34:28,566 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-20 04:34:28,566 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 71 [2019-11-20 04:34:28,566 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 04:34:28,569 INFO L225 Difference]: With dead ends: 806 [2019-11-20 04:34:28,569 INFO L226 Difference]: Without dead ends: 451 [2019-11-20 04:34:28,570 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-20 04:34:28,571 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 451 states. [2019-11-20 04:34:28,580 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 451 to 405. [2019-11-20 04:34:28,581 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 405 states. [2019-11-20 04:34:28,582 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 405 states to 405 states and 620 transitions. [2019-11-20 04:34:28,583 INFO L78 Accepts]: Start accepts. Automaton has 405 states and 620 transitions. Word has length 71 [2019-11-20 04:34:28,583 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 04:34:28,583 INFO L462 AbstractCegarLoop]: Abstraction has 405 states and 620 transitions. [2019-11-20 04:34:28,583 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-20 04:34:28,584 INFO L276 IsEmpty]: Start isEmpty. Operand 405 states and 620 transitions. [2019-11-20 04:34:28,585 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2019-11-20 04:34:28,585 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 04:34:28,585 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 3, 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, 1, 1] [2019-11-20 04:34:28,585 INFO L410 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 04:34:28,585 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 04:34:28,586 INFO L82 PathProgramCache]: Analyzing trace with hash -2025585655, now seen corresponding path program 1 times [2019-11-20 04:34:28,586 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 04:34:28,586 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1364607121] [2019-11-20 04:34:28,586 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 04:34:28,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 04:34:28,677 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 27 proven. 0 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2019-11-20 04:34:28,678 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1364607121] [2019-11-20 04:34:28,678 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 04:34:28,679 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-20 04:34:28,679 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1253381394] [2019-11-20 04:34:28,679 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-20 04:34:28,680 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 04:34:28,680 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-20 04:34:28,681 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-20 04:34:28,681 INFO L87 Difference]: Start difference. First operand 405 states and 620 transitions. Second operand 4 states. [2019-11-20 04:34:29,243 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 04:34:29,243 INFO L93 Difference]: Finished difference Result 928 states and 1409 transitions. [2019-11-20 04:34:29,244 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-20 04:34:29,244 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 72 [2019-11-20 04:34:29,245 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 04:34:29,248 INFO L225 Difference]: With dead ends: 928 [2019-11-20 04:34:29,249 INFO L226 Difference]: Without dead ends: 533 [2019-11-20 04:34:29,249 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-20 04:34:29,250 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 533 states. [2019-11-20 04:34:29,262 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 533 to 407. [2019-11-20 04:34:29,262 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 407 states. [2019-11-20 04:34:29,265 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 407 states to 407 states and 622 transitions. [2019-11-20 04:34:29,266 INFO L78 Accepts]: Start accepts. Automaton has 407 states and 622 transitions. Word has length 72 [2019-11-20 04:34:29,271 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 04:34:29,271 INFO L462 AbstractCegarLoop]: Abstraction has 407 states and 622 transitions. [2019-11-20 04:34:29,271 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-20 04:34:29,272 INFO L276 IsEmpty]: Start isEmpty. Operand 407 states and 622 transitions. [2019-11-20 04:34:29,273 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2019-11-20 04:34:29,274 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 04:34:29,274 INFO L410 BasicCegarLoop]: trace histogram [5, 5, 4, 4, 4, 3, 3, 3, 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] [2019-11-20 04:34:29,274 INFO L410 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 04:34:29,275 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 04:34:29,275 INFO L82 PathProgramCache]: Analyzing trace with hash 703880522, now seen corresponding path program 2 times [2019-11-20 04:34:29,275 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 04:34:29,276 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [634610273] [2019-11-20 04:34:29,283 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 04:34:29,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 04:34:29,393 INFO L134 CoverageAnalysis]: Checked inductivity of 73 backedges. 56 proven. 0 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2019-11-20 04:34:29,397 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [634610273] [2019-11-20 04:34:29,398 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 04:34:29,398 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-20 04:34:29,398 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [758241854] [2019-11-20 04:34:29,399 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-20 04:34:29,399 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 04:34:29,399 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-20 04:34:29,400 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-20 04:34:29,400 INFO L87 Difference]: Start difference. First operand 407 states and 622 transitions. Second operand 4 states. [2019-11-20 04:34:29,898 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 04:34:29,898 INFO L93 Difference]: Finished difference Result 928 states and 1407 transitions. [2019-11-20 04:34:29,899 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-20 04:34:29,899 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 85 [2019-11-20 04:34:29,899 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 04:34:29,903 INFO L225 Difference]: With dead ends: 928 [2019-11-20 04:34:29,903 INFO L226 Difference]: Without dead ends: 531 [2019-11-20 04:34:29,904 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-20 04:34:29,905 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 531 states. [2019-11-20 04:34:29,914 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 531 to 407. [2019-11-20 04:34:29,914 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 407 states. [2019-11-20 04:34:29,916 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 407 states to 407 states and 620 transitions. [2019-11-20 04:34:29,917 INFO L78 Accepts]: Start accepts. Automaton has 407 states and 620 transitions. Word has length 85 [2019-11-20 04:34:29,917 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 04:34:29,917 INFO L462 AbstractCegarLoop]: Abstraction has 407 states and 620 transitions. [2019-11-20 04:34:29,918 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-20 04:34:29,918 INFO L276 IsEmpty]: Start isEmpty. Operand 407 states and 620 transitions. [2019-11-20 04:34:29,923 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2019-11-20 04:34:29,923 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 04:34:29,924 INFO L410 BasicCegarLoop]: trace histogram [5, 5, 4, 4, 4, 4, 3, 3, 3, 3, 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-20 04:34:29,924 INFO L410 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 04:34:29,924 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 04:34:29,925 INFO L82 PathProgramCache]: Analyzing trace with hash -405099924, now seen corresponding path program 1 times [2019-11-20 04:34:29,925 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 04:34:29,925 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1035745097] [2019-11-20 04:34:29,925 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 04:34:29,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 04:34:29,995 INFO L134 CoverageAnalysis]: Checked inductivity of 75 backedges. 58 proven. 0 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2019-11-20 04:34:29,995 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1035745097] [2019-11-20 04:34:29,995 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 04:34:29,995 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-20 04:34:29,996 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [610946764] [2019-11-20 04:34:29,996 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-20 04:34:29,996 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 04:34:29,996 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-20 04:34:29,997 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-20 04:34:29,997 INFO L87 Difference]: Start difference. First operand 407 states and 620 transitions. Second operand 4 states. [2019-11-20 04:34:30,481 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 04:34:30,482 INFO L93 Difference]: Finished difference Result 928 states and 1403 transitions. [2019-11-20 04:34:30,482 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-20 04:34:30,482 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 85 [2019-11-20 04:34:30,482 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 04:34:30,485 INFO L225 Difference]: With dead ends: 928 [2019-11-20 04:34:30,485 INFO L226 Difference]: Without dead ends: 531 [2019-11-20 04:34:30,486 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-20 04:34:30,487 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 531 states. [2019-11-20 04:34:30,495 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 531 to 407. [2019-11-20 04:34:30,495 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 407 states. [2019-11-20 04:34:30,497 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 407 states to 407 states and 618 transitions. [2019-11-20 04:34:30,497 INFO L78 Accepts]: Start accepts. Automaton has 407 states and 618 transitions. Word has length 85 [2019-11-20 04:34:30,497 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 04:34:30,498 INFO L462 AbstractCegarLoop]: Abstraction has 407 states and 618 transitions. [2019-11-20 04:34:30,498 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-20 04:34:30,498 INFO L276 IsEmpty]: Start isEmpty. Operand 407 states and 618 transitions. [2019-11-20 04:34:30,499 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2019-11-20 04:34:30,499 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 04:34:30,499 INFO L410 BasicCegarLoop]: trace histogram [5, 5, 4, 4, 4, 3, 3, 3, 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] [2019-11-20 04:34:30,500 INFO L410 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 04:34:30,500 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 04:34:30,500 INFO L82 PathProgramCache]: Analyzing trace with hash -325478776, now seen corresponding path program 2 times [2019-11-20 04:34:30,500 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 04:34:30,500 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [825173710] [2019-11-20 04:34:30,501 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 04:34:30,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 04:34:30,582 INFO L134 CoverageAnalysis]: Checked inductivity of 73 backedges. 56 proven. 0 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2019-11-20 04:34:30,582 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [825173710] [2019-11-20 04:34:30,582 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 04:34:30,582 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-20 04:34:30,583 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1927063126] [2019-11-20 04:34:30,583 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-20 04:34:30,583 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 04:34:30,583 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-20 04:34:30,584 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-20 04:34:30,584 INFO L87 Difference]: Start difference. First operand 407 states and 618 transitions. Second operand 4 states. [2019-11-20 04:34:30,946 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 04:34:30,946 INFO L93 Difference]: Finished difference Result 848 states and 1278 transitions. [2019-11-20 04:34:30,948 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-20 04:34:30,948 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 85 [2019-11-20 04:34:30,949 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 04:34:30,951 INFO L225 Difference]: With dead ends: 848 [2019-11-20 04:34:30,951 INFO L226 Difference]: Without dead ends: 451 [2019-11-20 04:34:30,952 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-20 04:34:30,953 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 451 states. [2019-11-20 04:34:30,964 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 451 to 407. [2019-11-20 04:34:30,965 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 407 states. [2019-11-20 04:34:30,966 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 407 states to 407 states and 616 transitions. [2019-11-20 04:34:30,967 INFO L78 Accepts]: Start accepts. Automaton has 407 states and 616 transitions. Word has length 85 [2019-11-20 04:34:30,967 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 04:34:30,967 INFO L462 AbstractCegarLoop]: Abstraction has 407 states and 616 transitions. [2019-11-20 04:34:30,967 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-20 04:34:30,967 INFO L276 IsEmpty]: Start isEmpty. Operand 407 states and 616 transitions. [2019-11-20 04:34:30,970 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2019-11-20 04:34:30,970 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 04:34:30,970 INFO L410 BasicCegarLoop]: trace histogram [5, 5, 4, 4, 4, 4, 3, 3, 3, 3, 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-20 04:34:30,970 INFO L410 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 04:34:30,971 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 04:34:30,971 INFO L82 PathProgramCache]: Analyzing trace with hash -1434459222, now seen corresponding path program 1 times [2019-11-20 04:34:30,971 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 04:34:30,971 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1528550111] [2019-11-20 04:34:30,972 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 04:34:30,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 04:34:31,042 INFO L134 CoverageAnalysis]: Checked inductivity of 75 backedges. 58 proven. 0 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2019-11-20 04:34:31,043 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1528550111] [2019-11-20 04:34:31,045 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 04:34:31,045 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-20 04:34:31,046 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1605334583] [2019-11-20 04:34:31,046 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-20 04:34:31,046 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 04:34:31,046 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-20 04:34:31,047 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-20 04:34:31,047 INFO L87 Difference]: Start difference. First operand 407 states and 616 transitions. Second operand 4 states. [2019-11-20 04:34:31,384 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 04:34:31,384 INFO L93 Difference]: Finished difference Result 848 states and 1274 transitions. [2019-11-20 04:34:31,384 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-20 04:34:31,385 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 85 [2019-11-20 04:34:31,385 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 04:34:31,390 INFO L225 Difference]: With dead ends: 848 [2019-11-20 04:34:31,390 INFO L226 Difference]: Without dead ends: 451 [2019-11-20 04:34:31,391 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-20 04:34:31,392 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 451 states. [2019-11-20 04:34:31,401 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 451 to 407. [2019-11-20 04:34:31,402 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 407 states. [2019-11-20 04:34:31,403 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 407 states to 407 states and 614 transitions. [2019-11-20 04:34:31,404 INFO L78 Accepts]: Start accepts. Automaton has 407 states and 614 transitions. Word has length 85 [2019-11-20 04:34:31,404 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 04:34:31,404 INFO L462 AbstractCegarLoop]: Abstraction has 407 states and 614 transitions. [2019-11-20 04:34:31,404 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-20 04:34:31,404 INFO L276 IsEmpty]: Start isEmpty. Operand 407 states and 614 transitions. [2019-11-20 04:34:31,406 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2019-11-20 04:34:31,406 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 04:34:31,406 INFO L410 BasicCegarLoop]: trace histogram [5, 5, 4, 4, 4, 4, 4, 3, 3, 3, 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-20 04:34:31,406 INFO L410 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 04:34:31,407 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 04:34:31,407 INFO L82 PathProgramCache]: Analyzing trace with hash 381197251, now seen corresponding path program 1 times [2019-11-20 04:34:31,407 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 04:34:31,407 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2432594] [2019-11-20 04:34:31,408 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 04:34:31,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 04:34:31,495 INFO L134 CoverageAnalysis]: Checked inductivity of 78 backedges. 61 proven. 0 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2019-11-20 04:34:31,495 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2432594] [2019-11-20 04:34:31,495 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 04:34:31,496 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-20 04:34:31,496 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1150903770] [2019-11-20 04:34:31,496 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-20 04:34:31,497 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 04:34:31,497 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-20 04:34:31,497 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-20 04:34:31,497 INFO L87 Difference]: Start difference. First operand 407 states and 614 transitions. Second operand 4 states. [2019-11-20 04:34:31,983 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 04:34:31,983 INFO L93 Difference]: Finished difference Result 928 states and 1391 transitions. [2019-11-20 04:34:31,984 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-20 04:34:31,984 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 86 [2019-11-20 04:34:31,984 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 04:34:31,987 INFO L225 Difference]: With dead ends: 928 [2019-11-20 04:34:31,987 INFO L226 Difference]: Without dead ends: 531 [2019-11-20 04:34:31,988 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-20 04:34:31,989 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 531 states. [2019-11-20 04:34:31,999 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 531 to 407. [2019-11-20 04:34:31,999 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 407 states. [2019-11-20 04:34:32,032 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 407 states to 407 states and 612 transitions. [2019-11-20 04:34:32,033 INFO L78 Accepts]: Start accepts. Automaton has 407 states and 612 transitions. Word has length 86 [2019-11-20 04:34:32,033 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 04:34:32,033 INFO L462 AbstractCegarLoop]: Abstraction has 407 states and 612 transitions. [2019-11-20 04:34:32,033 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-20 04:34:32,033 INFO L276 IsEmpty]: Start isEmpty. Operand 407 states and 612 transitions. [2019-11-20 04:34:32,034 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2019-11-20 04:34:32,034 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 04:34:32,035 INFO L410 BasicCegarLoop]: trace histogram [5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 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] [2019-11-20 04:34:32,035 INFO L410 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 04:34:32,035 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 04:34:32,035 INFO L82 PathProgramCache]: Analyzing trace with hash 681258334, now seen corresponding path program 1 times [2019-11-20 04:34:32,035 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 04:34:32,035 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [71782765] [2019-11-20 04:34:32,035 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 04:34:32,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 04:34:32,099 INFO L134 CoverageAnalysis]: Checked inductivity of 84 backedges. 67 proven. 0 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2019-11-20 04:34:32,099 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [71782765] [2019-11-20 04:34:32,100 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 04:34:32,100 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-20 04:34:32,100 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1385881657] [2019-11-20 04:34:32,100 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-20 04:34:32,101 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 04:34:32,101 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-20 04:34:32,101 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-20 04:34:32,101 INFO L87 Difference]: Start difference. First operand 407 states and 612 transitions. Second operand 4 states. [2019-11-20 04:34:32,615 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 04:34:32,615 INFO L93 Difference]: Finished difference Result 783 states and 1168 transitions. [2019-11-20 04:34:32,616 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-20 04:34:32,616 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 86 [2019-11-20 04:34:32,616 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 04:34:32,619 INFO L225 Difference]: With dead ends: 783 [2019-11-20 04:34:32,619 INFO L226 Difference]: Without dead ends: 531 [2019-11-20 04:34:32,619 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-20 04:34:32,620 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 531 states. [2019-11-20 04:34:32,629 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 531 to 407. [2019-11-20 04:34:32,630 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 407 states. [2019-11-20 04:34:32,631 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 407 states to 407 states and 610 transitions. [2019-11-20 04:34:32,631 INFO L78 Accepts]: Start accepts. Automaton has 407 states and 610 transitions. Word has length 86 [2019-11-20 04:34:32,632 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 04:34:32,632 INFO L462 AbstractCegarLoop]: Abstraction has 407 states and 610 transitions. [2019-11-20 04:34:32,632 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-20 04:34:32,632 INFO L276 IsEmpty]: Start isEmpty. Operand 407 states and 610 transitions. [2019-11-20 04:34:32,633 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2019-11-20 04:34:32,633 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 04:34:32,634 INFO L410 BasicCegarLoop]: trace histogram [5, 5, 4, 4, 4, 4, 4, 3, 3, 3, 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-20 04:34:32,634 INFO L410 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 04:34:32,634 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 04:34:32,634 INFO L82 PathProgramCache]: Analyzing trace with hash -1464169915, now seen corresponding path program 1 times [2019-11-20 04:34:32,634 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 04:34:32,635 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1275790344] [2019-11-20 04:34:32,635 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 04:34:32,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 04:34:32,691 INFO L134 CoverageAnalysis]: Checked inductivity of 78 backedges. 61 proven. 0 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2019-11-20 04:34:32,691 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1275790344] [2019-11-20 04:34:32,691 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 04:34:32,692 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-20 04:34:32,692 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1050312384] [2019-11-20 04:34:32,692 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-20 04:34:32,692 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 04:34:32,693 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-20 04:34:32,693 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-20 04:34:32,693 INFO L87 Difference]: Start difference. First operand 407 states and 610 transitions. Second operand 4 states. [2019-11-20 04:34:33,034 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 04:34:33,035 INFO L93 Difference]: Finished difference Result 848 states and 1262 transitions. [2019-11-20 04:34:33,035 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-20 04:34:33,036 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 86 [2019-11-20 04:34:33,036 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 04:34:33,038 INFO L225 Difference]: With dead ends: 848 [2019-11-20 04:34:33,038 INFO L226 Difference]: Without dead ends: 451 [2019-11-20 04:34:33,039 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-20 04:34:33,040 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 451 states. [2019-11-20 04:34:33,056 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 451 to 407. [2019-11-20 04:34:33,056 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 407 states. [2019-11-20 04:34:33,057 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 407 states to 407 states and 608 transitions. [2019-11-20 04:34:33,058 INFO L78 Accepts]: Start accepts. Automaton has 407 states and 608 transitions. Word has length 86 [2019-11-20 04:34:33,058 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 04:34:33,058 INFO L462 AbstractCegarLoop]: Abstraction has 407 states and 608 transitions. [2019-11-20 04:34:33,058 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-20 04:34:33,058 INFO L276 IsEmpty]: Start isEmpty. Operand 407 states and 608 transitions. [2019-11-20 04:34:33,060 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2019-11-20 04:34:33,060 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 04:34:33,060 INFO L410 BasicCegarLoop]: trace histogram [5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 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] [2019-11-20 04:34:33,060 INFO L410 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 04:34:33,060 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 04:34:33,061 INFO L82 PathProgramCache]: Analyzing trace with hash -1164108832, now seen corresponding path program 1 times [2019-11-20 04:34:33,061 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 04:34:33,061 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1916843432] [2019-11-20 04:34:33,061 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 04:34:33,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 04:34:33,119 INFO L134 CoverageAnalysis]: Checked inductivity of 84 backedges. 67 proven. 0 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2019-11-20 04:34:33,119 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1916843432] [2019-11-20 04:34:33,120 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 04:34:33,120 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-20 04:34:33,120 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1685883509] [2019-11-20 04:34:33,120 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-20 04:34:33,121 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 04:34:33,121 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-20 04:34:33,121 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-20 04:34:33,121 INFO L87 Difference]: Start difference. First operand 407 states and 608 transitions. Second operand 4 states. [2019-11-20 04:34:33,456 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 04:34:33,456 INFO L93 Difference]: Finished difference Result 703 states and 1041 transitions. [2019-11-20 04:34:33,457 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-20 04:34:33,457 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 86 [2019-11-20 04:34:33,457 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 04:34:33,460 INFO L225 Difference]: With dead ends: 703 [2019-11-20 04:34:33,460 INFO L226 Difference]: Without dead ends: 451 [2019-11-20 04:34:33,460 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-20 04:34:33,461 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 451 states. [2019-11-20 04:34:33,474 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 451 to 407. [2019-11-20 04:34:33,475 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 407 states. [2019-11-20 04:34:33,476 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 407 states to 407 states and 606 transitions. [2019-11-20 04:34:33,476 INFO L78 Accepts]: Start accepts. Automaton has 407 states and 606 transitions. Word has length 86 [2019-11-20 04:34:33,476 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 04:34:33,477 INFO L462 AbstractCegarLoop]: Abstraction has 407 states and 606 transitions. [2019-11-20 04:34:33,477 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-20 04:34:33,477 INFO L276 IsEmpty]: Start isEmpty. Operand 407 states and 606 transitions. [2019-11-20 04:34:33,478 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2019-11-20 04:34:33,478 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 04:34:33,478 INFO L410 BasicCegarLoop]: trace histogram [5, 5, 4, 4, 4, 4, 4, 4, 3, 3, 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-20 04:34:33,479 INFO L410 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 04:34:33,479 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 04:34:33,479 INFO L82 PathProgramCache]: Analyzing trace with hash -956813465, now seen corresponding path program 1 times [2019-11-20 04:34:33,479 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 04:34:33,479 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1928899533] [2019-11-20 04:34:33,480 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 04:34:33,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 04:34:33,550 INFO L134 CoverageAnalysis]: Checked inductivity of 81 backedges. 64 proven. 0 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2019-11-20 04:34:33,550 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1928899533] [2019-11-20 04:34:33,551 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 04:34:33,551 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-20 04:34:33,551 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [16429989] [2019-11-20 04:34:33,551 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-20 04:34:33,552 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 04:34:33,552 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-20 04:34:33,552 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-20 04:34:33,552 INFO L87 Difference]: Start difference. First operand 407 states and 606 transitions. Second operand 4 states. [2019-11-20 04:34:34,028 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 04:34:34,029 INFO L93 Difference]: Finished difference Result 928 states and 1375 transitions. [2019-11-20 04:34:34,029 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-20 04:34:34,029 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 87 [2019-11-20 04:34:34,029 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 04:34:34,032 INFO L225 Difference]: With dead ends: 928 [2019-11-20 04:34:34,032 INFO L226 Difference]: Without dead ends: 531 [2019-11-20 04:34:34,033 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-20 04:34:34,034 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 531 states. [2019-11-20 04:34:34,047 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 531 to 407. [2019-11-20 04:34:34,048 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 407 states. [2019-11-20 04:34:34,049 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 407 states to 407 states and 604 transitions. [2019-11-20 04:34:34,049 INFO L78 Accepts]: Start accepts. Automaton has 407 states and 604 transitions. Word has length 87 [2019-11-20 04:34:34,049 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 04:34:34,050 INFO L462 AbstractCegarLoop]: Abstraction has 407 states and 604 transitions. [2019-11-20 04:34:34,050 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-20 04:34:34,050 INFO L276 IsEmpty]: Start isEmpty. Operand 407 states and 604 transitions. [2019-11-20 04:34:34,051 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2019-11-20 04:34:34,051 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 04:34:34,051 INFO L410 BasicCegarLoop]: trace histogram [5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 04:34:34,052 INFO L410 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 04:34:34,052 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 04:34:34,052 INFO L82 PathProgramCache]: Analyzing trace with hash 2048176167, now seen corresponding path program 1 times [2019-11-20 04:34:34,052 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 04:34:34,053 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1249419791] [2019-11-20 04:34:34,053 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 04:34:34,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 04:34:34,128 INFO L134 CoverageAnalysis]: Checked inductivity of 86 backedges. 69 proven. 0 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2019-11-20 04:34:34,129 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1249419791] [2019-11-20 04:34:34,131 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 04:34:34,131 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-20 04:34:34,135 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1143113419] [2019-11-20 04:34:34,135 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-20 04:34:34,136 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 04:34:34,136 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-20 04:34:34,136 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-20 04:34:34,136 INFO L87 Difference]: Start difference. First operand 407 states and 604 transitions. Second operand 4 states. [2019-11-20 04:34:34,597 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 04:34:34,597 INFO L93 Difference]: Finished difference Result 777 states and 1149 transitions. [2019-11-20 04:34:34,598 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-20 04:34:34,598 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 87 [2019-11-20 04:34:34,598 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 04:34:34,601 INFO L225 Difference]: With dead ends: 777 [2019-11-20 04:34:34,601 INFO L226 Difference]: Without dead ends: 525 [2019-11-20 04:34:34,602 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-20 04:34:34,603 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 525 states. [2019-11-20 04:34:34,615 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 525 to 407. [2019-11-20 04:34:34,615 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 407 states. [2019-11-20 04:34:34,616 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 407 states to 407 states and 602 transitions. [2019-11-20 04:34:34,616 INFO L78 Accepts]: Start accepts. Automaton has 407 states and 602 transitions. Word has length 87 [2019-11-20 04:34:34,617 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 04:34:34,617 INFO L462 AbstractCegarLoop]: Abstraction has 407 states and 602 transitions. [2019-11-20 04:34:34,617 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-20 04:34:34,617 INFO L276 IsEmpty]: Start isEmpty. Operand 407 states and 602 transitions. [2019-11-20 04:34:34,618 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2019-11-20 04:34:34,618 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 04:34:34,619 INFO L410 BasicCegarLoop]: trace histogram [5, 5, 4, 4, 4, 4, 4, 4, 3, 3, 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-20 04:34:34,619 INFO L410 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 04:34:34,619 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 04:34:34,619 INFO L82 PathProgramCache]: Analyzing trace with hash 1966346533, now seen corresponding path program 1 times [2019-11-20 04:34:34,620 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 04:34:34,620 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1960265744] [2019-11-20 04:34:34,620 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 04:34:34,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 04:34:34,679 INFO L134 CoverageAnalysis]: Checked inductivity of 81 backedges. 64 proven. 0 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2019-11-20 04:34:34,679 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1960265744] [2019-11-20 04:34:34,680 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 04:34:34,680 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-20 04:34:34,680 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1469827393] [2019-11-20 04:34:34,680 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-20 04:34:34,681 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 04:34:34,681 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-20 04:34:34,681 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-20 04:34:34,681 INFO L87 Difference]: Start difference. First operand 407 states and 602 transitions. Second operand 4 states. [2019-11-20 04:34:34,990 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 04:34:34,991 INFO L93 Difference]: Finished difference Result 848 states and 1246 transitions. [2019-11-20 04:34:34,991 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-20 04:34:34,991 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 87 [2019-11-20 04:34:34,991 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 04:34:34,993 INFO L225 Difference]: With dead ends: 848 [2019-11-20 04:34:34,994 INFO L226 Difference]: Without dead ends: 451 [2019-11-20 04:34:34,994 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-20 04:34:34,995 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 451 states. [2019-11-20 04:34:35,004 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 451 to 407. [2019-11-20 04:34:35,005 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 407 states. [2019-11-20 04:34:35,006 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 407 states to 407 states and 600 transitions. [2019-11-20 04:34:35,006 INFO L78 Accepts]: Start accepts. Automaton has 407 states and 600 transitions. Word has length 87 [2019-11-20 04:34:35,006 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 04:34:35,006 INFO L462 AbstractCegarLoop]: Abstraction has 407 states and 600 transitions. [2019-11-20 04:34:35,006 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-20 04:34:35,007 INFO L276 IsEmpty]: Start isEmpty. Operand 407 states and 600 transitions. [2019-11-20 04:34:35,008 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2019-11-20 04:34:35,008 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 04:34:35,008 INFO L410 BasicCegarLoop]: trace histogram [5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 04:34:35,008 INFO L410 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 04:34:35,009 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 04:34:35,009 INFO L82 PathProgramCache]: Analyzing trace with hash 676368869, now seen corresponding path program 1 times [2019-11-20 04:34:35,009 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 04:34:35,009 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1433085494] [2019-11-20 04:34:35,009 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 04:34:35,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 04:34:35,070 INFO L134 CoverageAnalysis]: Checked inductivity of 86 backedges. 69 proven. 0 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2019-11-20 04:34:35,070 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1433085494] [2019-11-20 04:34:35,070 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 04:34:35,071 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-20 04:34:35,071 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1151036367] [2019-11-20 04:34:35,071 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-20 04:34:35,072 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 04:34:35,072 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-20 04:34:35,072 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-20 04:34:35,072 INFO L87 Difference]: Start difference. First operand 407 states and 600 transitions. Second operand 4 states. [2019-11-20 04:34:35,436 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 04:34:35,436 INFO L93 Difference]: Finished difference Result 697 states and 1022 transitions. [2019-11-20 04:34:35,436 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-20 04:34:35,436 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 87 [2019-11-20 04:34:35,437 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 04:34:35,439 INFO L225 Difference]: With dead ends: 697 [2019-11-20 04:34:35,439 INFO L226 Difference]: Without dead ends: 445 [2019-11-20 04:34:35,440 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-20 04:34:35,441 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 445 states. [2019-11-20 04:34:35,493 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 445 to 407. [2019-11-20 04:34:35,494 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 407 states. [2019-11-20 04:34:35,495 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 407 states to 407 states and 598 transitions. [2019-11-20 04:34:35,495 INFO L78 Accepts]: Start accepts. Automaton has 407 states and 598 transitions. Word has length 87 [2019-11-20 04:34:35,495 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 04:34:35,495 INFO L462 AbstractCegarLoop]: Abstraction has 407 states and 598 transitions. [2019-11-20 04:34:35,496 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-20 04:34:35,496 INFO L276 IsEmpty]: Start isEmpty. Operand 407 states and 598 transitions. [2019-11-20 04:34:35,497 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2019-11-20 04:34:35,497 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 04:34:35,497 INFO L410 BasicCegarLoop]: trace histogram [5, 5, 4, 4, 4, 4, 4, 4, 4, 3, 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-20 04:34:35,498 INFO L410 AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 04:34:35,498 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 04:34:35,498 INFO L82 PathProgramCache]: Analyzing trace with hash 571107934, now seen corresponding path program 1 times [2019-11-20 04:34:35,498 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 04:34:35,498 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [814097353] [2019-11-20 04:34:35,499 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 04:34:35,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 04:34:35,548 INFO L134 CoverageAnalysis]: Checked inductivity of 84 backedges. 67 proven. 0 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2019-11-20 04:34:35,549 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [814097353] [2019-11-20 04:34:35,549 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 04:34:35,549 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-20 04:34:35,549 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [641245865] [2019-11-20 04:34:35,551 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-20 04:34:35,551 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 04:34:35,551 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-20 04:34:35,552 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-20 04:34:35,552 INFO L87 Difference]: Start difference. First operand 407 states and 598 transitions. Second operand 4 states. [2019-11-20 04:34:36,036 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 04:34:36,036 INFO L93 Difference]: Finished difference Result 904 states and 1330 transitions. [2019-11-20 04:34:36,036 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-20 04:34:36,036 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 88 [2019-11-20 04:34:36,037 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 04:34:36,039 INFO L225 Difference]: With dead ends: 904 [2019-11-20 04:34:36,039 INFO L226 Difference]: Without dead ends: 507 [2019-11-20 04:34:36,040 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-20 04:34:36,041 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 507 states. [2019-11-20 04:34:36,050 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 507 to 407. [2019-11-20 04:34:36,050 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 407 states. [2019-11-20 04:34:36,051 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 407 states to 407 states and 596 transitions. [2019-11-20 04:34:36,051 INFO L78 Accepts]: Start accepts. Automaton has 407 states and 596 transitions. Word has length 88 [2019-11-20 04:34:36,051 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 04:34:36,052 INFO L462 AbstractCegarLoop]: Abstraction has 407 states and 596 transitions. [2019-11-20 04:34:36,052 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-20 04:34:36,052 INFO L276 IsEmpty]: Start isEmpty. Operand 407 states and 596 transitions. [2019-11-20 04:34:36,053 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2019-11-20 04:34:36,053 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 04:34:36,053 INFO L410 BasicCegarLoop]: trace histogram [5, 5, 4, 4, 4, 4, 4, 4, 4, 3, 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-20 04:34:36,054 INFO L410 AbstractCegarLoop]: === Iteration 20 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 04:34:36,054 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 04:34:36,054 INFO L82 PathProgramCache]: Analyzing trace with hash 994754656, now seen corresponding path program 1 times [2019-11-20 04:34:36,054 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 04:34:36,054 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1797064387] [2019-11-20 04:34:36,055 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 04:34:36,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 04:34:36,116 INFO L134 CoverageAnalysis]: Checked inductivity of 84 backedges. 67 proven. 0 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2019-11-20 04:34:36,117 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1797064387] [2019-11-20 04:34:36,117 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 04:34:36,117 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-20 04:34:36,117 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1857049608] [2019-11-20 04:34:36,118 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-20 04:34:36,118 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 04:34:36,118 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-20 04:34:36,119 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-20 04:34:36,119 INFO L87 Difference]: Start difference. First operand 407 states and 596 transitions. Second operand 4 states. [2019-11-20 04:34:36,438 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 04:34:36,438 INFO L93 Difference]: Finished difference Result 824 states and 1205 transitions. [2019-11-20 04:34:36,439 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-20 04:34:36,439 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 88 [2019-11-20 04:34:36,439 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 04:34:36,441 INFO L225 Difference]: With dead ends: 824 [2019-11-20 04:34:36,442 INFO L226 Difference]: Without dead ends: 427 [2019-11-20 04:34:36,443 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-20 04:34:36,444 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 427 states. [2019-11-20 04:34:36,452 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 427 to 407. [2019-11-20 04:34:36,453 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 407 states. [2019-11-20 04:34:36,454 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 407 states to 407 states and 594 transitions. [2019-11-20 04:34:36,454 INFO L78 Accepts]: Start accepts. Automaton has 407 states and 594 transitions. Word has length 88 [2019-11-20 04:34:36,454 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 04:34:36,454 INFO L462 AbstractCegarLoop]: Abstraction has 407 states and 594 transitions. [2019-11-20 04:34:36,454 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-20 04:34:36,454 INFO L276 IsEmpty]: Start isEmpty. Operand 407 states and 594 transitions. [2019-11-20 04:34:36,456 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2019-11-20 04:34:36,456 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 04:34:36,456 INFO L410 BasicCegarLoop]: trace histogram [5, 5, 4, 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, 1, 1, 1] [2019-11-20 04:34:36,456 INFO L410 AbstractCegarLoop]: === Iteration 21 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 04:34:36,456 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 04:34:36,457 INFO L82 PathProgramCache]: Analyzing trace with hash -433365501, now seen corresponding path program 1 times [2019-11-20 04:34:36,457 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 04:34:36,457 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2016280628] [2019-11-20 04:34:36,457 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 04:34:36,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 04:34:36,532 INFO L134 CoverageAnalysis]: Checked inductivity of 86 backedges. 69 proven. 0 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2019-11-20 04:34:36,532 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2016280628] [2019-11-20 04:34:36,533 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 04:34:36,533 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-20 04:34:36,533 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2145386057] [2019-11-20 04:34:36,534 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-20 04:34:36,534 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 04:34:36,534 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-20 04:34:36,536 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-20 04:34:36,536 INFO L87 Difference]: Start difference. First operand 407 states and 594 transitions. Second operand 4 states. [2019-11-20 04:34:36,978 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 04:34:36,978 INFO L93 Difference]: Finished difference Result 904 states and 1322 transitions. [2019-11-20 04:34:36,979 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-20 04:34:36,979 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 89 [2019-11-20 04:34:36,979 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 04:34:36,982 INFO L225 Difference]: With dead ends: 904 [2019-11-20 04:34:36,982 INFO L226 Difference]: Without dead ends: 507 [2019-11-20 04:34:36,985 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-20 04:34:36,986 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 507 states. [2019-11-20 04:34:36,997 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 507 to 407. [2019-11-20 04:34:36,997 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 407 states. [2019-11-20 04:34:36,998 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 407 states to 407 states and 592 transitions. [2019-11-20 04:34:36,998 INFO L78 Accepts]: Start accepts. Automaton has 407 states and 592 transitions. Word has length 89 [2019-11-20 04:34:36,999 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 04:34:36,999 INFO L462 AbstractCegarLoop]: Abstraction has 407 states and 592 transitions. [2019-11-20 04:34:36,999 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-20 04:34:36,999 INFO L276 IsEmpty]: Start isEmpty. Operand 407 states and 592 transitions. [2019-11-20 04:34:37,000 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2019-11-20 04:34:37,000 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 04:34:37,001 INFO L410 BasicCegarLoop]: trace histogram [5, 5, 4, 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, 1, 1, 1] [2019-11-20 04:34:37,001 INFO L410 AbstractCegarLoop]: === Iteration 22 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 04:34:37,001 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 04:34:37,001 INFO L82 PathProgramCache]: Analyzing trace with hash -185219007, now seen corresponding path program 1 times [2019-11-20 04:34:37,001 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 04:34:37,002 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1017812178] [2019-11-20 04:34:37,002 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 04:34:37,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 04:34:37,065 INFO L134 CoverageAnalysis]: Checked inductivity of 86 backedges. 54 proven. 0 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2019-11-20 04:34:37,066 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1017812178] [2019-11-20 04:34:37,066 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 04:34:37,066 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-20 04:34:37,067 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [446161035] [2019-11-20 04:34:37,067 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-20 04:34:37,067 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 04:34:37,067 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-20 04:34:37,068 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-20 04:34:37,068 INFO L87 Difference]: Start difference. First operand 407 states and 592 transitions. Second operand 3 states. [2019-11-20 04:34:37,106 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 04:34:37,106 INFO L93 Difference]: Finished difference Result 806 states and 1179 transitions. [2019-11-20 04:34:37,107 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-20 04:34:37,108 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 89 [2019-11-20 04:34:37,108 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 04:34:37,111 INFO L225 Difference]: With dead ends: 806 [2019-11-20 04:34:37,111 INFO L226 Difference]: Without dead ends: 556 [2019-11-20 04:34:37,111 INFO L630 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-20 04:34:37,112 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 556 states. [2019-11-20 04:34:37,126 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 556 to 556. [2019-11-20 04:34:37,126 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 556 states. [2019-11-20 04:34:37,128 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 556 states to 556 states and 809 transitions. [2019-11-20 04:34:37,128 INFO L78 Accepts]: Start accepts. Automaton has 556 states and 809 transitions. Word has length 89 [2019-11-20 04:34:37,128 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 04:34:37,128 INFO L462 AbstractCegarLoop]: Abstraction has 556 states and 809 transitions. [2019-11-20 04:34:37,128 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-20 04:34:37,128 INFO L276 IsEmpty]: Start isEmpty. Operand 556 states and 809 transitions. [2019-11-20 04:34:37,130 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2019-11-20 04:34:37,130 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 04:34:37,130 INFO L410 BasicCegarLoop]: trace histogram [5, 5, 4, 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, 1, 1, 1, 1, 1] [2019-11-20 04:34:37,130 INFO L410 AbstractCegarLoop]: === Iteration 23 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 04:34:37,131 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 04:34:37,131 INFO L82 PathProgramCache]: Analyzing trace with hash 1027809079, now seen corresponding path program 1 times [2019-11-20 04:34:37,131 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 04:34:37,131 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [118676282] [2019-11-20 04:34:37,131 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 04:34:37,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 04:34:37,179 INFO L134 CoverageAnalysis]: Checked inductivity of 86 backedges. 42 proven. 0 refuted. 0 times theorem prover too weak. 44 trivial. 0 not checked. [2019-11-20 04:34:37,179 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [118676282] [2019-11-20 04:34:37,179 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 04:34:37,180 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-20 04:34:37,181 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [3237124] [2019-11-20 04:34:37,181 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-20 04:34:37,181 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 04:34:37,182 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-20 04:34:37,182 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-20 04:34:37,182 INFO L87 Difference]: Start difference. First operand 556 states and 809 transitions. Second operand 3 states. [2019-11-20 04:34:37,218 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 04:34:37,218 INFO L93 Difference]: Finished difference Result 1104 states and 1613 transitions. [2019-11-20 04:34:37,218 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-20 04:34:37,218 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 91 [2019-11-20 04:34:37,219 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 04:34:37,222 INFO L225 Difference]: With dead ends: 1104 [2019-11-20 04:34:37,222 INFO L226 Difference]: Without dead ends: 705 [2019-11-20 04:34:37,223 INFO L630 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-20 04:34:37,224 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 705 states. [2019-11-20 04:34:37,237 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 705 to 705. [2019-11-20 04:34:37,238 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 705 states. [2019-11-20 04:34:37,239 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 705 states to 705 states and 1027 transitions. [2019-11-20 04:34:37,240 INFO L78 Accepts]: Start accepts. Automaton has 705 states and 1027 transitions. Word has length 91 [2019-11-20 04:34:37,240 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 04:34:37,240 INFO L462 AbstractCegarLoop]: Abstraction has 705 states and 1027 transitions. [2019-11-20 04:34:37,240 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-20 04:34:37,240 INFO L276 IsEmpty]: Start isEmpty. Operand 705 states and 1027 transitions. [2019-11-20 04:34:37,242 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2019-11-20 04:34:37,242 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 04:34:37,242 INFO L410 BasicCegarLoop]: trace histogram [6, 6, 5, 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, 1, 1, 1] [2019-11-20 04:34:37,243 INFO L410 AbstractCegarLoop]: === Iteration 24 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 04:34:37,243 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 04:34:37,243 INFO L82 PathProgramCache]: Analyzing trace with hash 1254631592, now seen corresponding path program 1 times [2019-11-20 04:34:37,243 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 04:34:37,244 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1218634969] [2019-11-20 04:34:37,244 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 04:34:37,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-20 04:34:37,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-20 04:34:37,685 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-20 04:34:37,685 INFO L475 BasicCegarLoop]: Counterexample might be feasible [2019-11-20 04:34:37,834 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 20.11 04:34:37 BoogieIcfgContainer [2019-11-20 04:34:37,834 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-11-20 04:34:37,835 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-11-20 04:34:37,835 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-11-20 04:34:37,835 INFO L275 PluginConnector]: Witness Printer initialized [2019-11-20 04:34:37,835 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 04:34:25" (3/4) ... [2019-11-20 04:34:37,845 INFO L140 WitnessPrinter]: No result that supports witness generation found [2019-11-20 04:34:37,852 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-11-20 04:34:37,854 INFO L168 Benchmark]: Toolchain (without parser) took 14257.30 ms. Allocated memory was 1.0 GB in the beginning and 1.3 GB in the end (delta: 277.3 MB). Free memory was 946.0 MB in the beginning and 883.2 MB in the end (delta: 62.9 MB). Peak memory consumption was 340.2 MB. Max. memory is 11.5 GB. [2019-11-20 04:34:37,854 INFO L168 Benchmark]: CDTParser took 0.24 ms. Allocated memory is still 1.0 GB. Free memory is still 967.5 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-20 04:34:37,854 INFO L168 Benchmark]: CACSL2BoogieTranslator took 696.56 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 107.0 MB). Free memory was 946.0 MB in the beginning and 1.1 GB in the end (delta: -135.1 MB). Peak memory consumption was 23.9 MB. Max. memory is 11.5 GB. [2019-11-20 04:34:37,855 INFO L168 Benchmark]: Boogie Procedure Inliner took 102.16 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 7.1 MB). Peak memory consumption was 7.1 MB. Max. memory is 11.5 GB. [2019-11-20 04:34:37,855 INFO L168 Benchmark]: Boogie Preprocessor took 136.92 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 7.1 MB). Peak memory consumption was 7.1 MB. Max. memory is 11.5 GB. [2019-11-20 04:34:37,855 INFO L168 Benchmark]: RCFGBuilder took 1147.07 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 973.6 MB in the end (delta: 93.4 MB). Peak memory consumption was 93.4 MB. Max. memory is 11.5 GB. [2019-11-20 04:34:37,856 INFO L168 Benchmark]: TraceAbstraction took 12151.48 ms. Allocated memory was 1.1 GB in the beginning and 1.3 GB in the end (delta: 170.4 MB). Free memory was 973.6 MB in the beginning and 883.2 MB in the end (delta: 90.4 MB). Peak memory consumption was 260.8 MB. Max. memory is 11.5 GB. [2019-11-20 04:34:37,856 INFO L168 Benchmark]: Witness Printer took 17.44 ms. Allocated memory is still 1.3 GB. Free memory is still 883.2 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-20 04:34:37,858 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.24 ms. Allocated memory is still 1.0 GB. Free memory is still 967.5 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 696.56 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 107.0 MB). Free memory was 946.0 MB in the beginning and 1.1 GB in the end (delta: -135.1 MB). Peak memory consumption was 23.9 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 102.16 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 7.1 MB). Peak memory consumption was 7.1 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 136.92 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 7.1 MB). Peak memory consumption was 7.1 MB. Max. memory is 11.5 GB. * RCFGBuilder took 1147.07 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 973.6 MB in the end (delta: 93.4 MB). Peak memory consumption was 93.4 MB. Max. memory is 11.5 GB. * TraceAbstraction took 12151.48 ms. Allocated memory was 1.1 GB in the beginning and 1.3 GB in the end (delta: 170.4 MB). Free memory was 973.6 MB in the beginning and 883.2 MB in the end (delta: 90.4 MB). Peak memory consumption was 260.8 MB. Max. memory is 11.5 GB. * Witness Printer took 17.44 ms. Allocated memory is still 1.3 GB. Free memory is still 883.2 MB. There was no memory consumed. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - UnprovableResult [Line: 1641]: Unable to prove that call of __VERIFIER_error() unreachable Unable to prove that call of __VERIFIER_error() unreachable Reason: overapproximation of bitwiseAnd at line 1336. Possible FailurePath: [L1042] static int init = 1; [L1043] static SSL_METHOD SSLv3_client_data ; VAL [init=1, SSLv3_client_data={9:0}] [L1065] SSL *s = (SSL*)malloc(sizeof(SSL)) ; [L1069] s->s3 = malloc(sizeof(struct ssl3_state_st)) [L1070] s->ctx = malloc(sizeof(SSL_CTX)) [L1071] s->session = malloc(sizeof(SSL_SESSION)) [L1072] s->state = 12292 [L1073] s->version = __VERIFIER_nondet_int() [L1080] BUF_MEM *buf ; [L1081] unsigned long tmp ; [L1082] unsigned long l ; [L1083] long num1 ; [L1084] void (*cb)() ; [L1085] int ret ; [L1086] int new_state ; [L1087] int state ; [L1088] int skip ; [L1089] int tmp___1 = __VERIFIER_nondet_int() ; [L1090] int tmp___2 = __VERIFIER_nondet_int() ; [L1091] int tmp___3 = __VERIFIER_nondet_int() ; [L1092] int tmp___4 = __VERIFIER_nondet_int() ; [L1093] int tmp___5 = __VERIFIER_nondet_int() ; [L1094] int tmp___6 = __VERIFIER_nondet_int() ; [L1095] int tmp___7 = __VERIFIER_nondet_int() ; [L1096] int tmp___8 = __VERIFIER_nondet_int() ; [L1097] long tmp___9 = __VERIFIER_nondet_long() ; [L1098] int blastFlag ; [L1101] blastFlag = 0 [L1102] s->hit=__VERIFIER_nondet_int () [L1103] s->state = 12292 [L1104] tmp = __VERIFIER_nondet_int() [L1105] cb = (void (*)())((void *)0) [L1106] ret = -1 [L1107] skip = 0 [L1108] EXPR s->info_callback VAL [init=1, SSLv3_client_data={9:0}] [L1108] COND TRUE (unsigned long )s->info_callback != (unsigned long )((void *)0) [L1109] EXPR s->info_callback [L1109] cb = s->info_callback [L1117] EXPR s->in_handshake [L1117] s->in_handshake += 1 [L1118] COND FALSE !(tmp___1 & 12288) VAL [init=1, SSLv3_client_data={9:0}] [L1128] COND TRUE 1 VAL [init=1, SSLv3_client_data={9:0}] [L1130] EXPR s->state [L1130] state = s->state [L1131] EXPR s->state VAL [init=1, SSLv3_client_data={9:0}] [L1131] COND TRUE s->state == 12292 [L1234] s->new_session = 1 [L1235] s->state = 4096 [L1236] EXPR s->ctx [L1236] EXPR (s->ctx)->stats.sess_connect_renegotiate [L1236] (s->ctx)->stats.sess_connect_renegotiate += 1 [L1241] s->server = 0 VAL [init=1, SSLv3_client_data={9:0}] [L1242] COND TRUE (unsigned long )cb != (unsigned long )((void *)0) VAL [init=1, SSLv3_client_data={9:0}] [L1247] EXPR s->version VAL [init=1, SSLv3_client_data={9:0}] [L1247] COND FALSE !((s->version & 65280) != 768) [L1253] s->type = 4096 [L1254] EXPR s->init_buf VAL [init=1, SSLv3_client_data={9:0}] [L1254] COND FALSE !((unsigned long )s->init_buf == (unsigned long )((void *)0)) [L1272] COND FALSE !(! tmp___4) VAL [init=1, SSLv3_client_data={9:0}] [L1278] COND FALSE !(! tmp___5) [L1284] s->state = 4368 [L1285] EXPR s->ctx [L1285] EXPR (s->ctx)->stats.sess_connect [L1285] (s->ctx)->stats.sess_connect += 1 [L1286] s->init_num = 0 VAL [init=1, SSLv3_client_data={9:0}] [L1600] EXPR s->s3 [L1600] EXPR (s->s3)->tmp.reuse_message VAL [init=1, SSLv3_client_data={9:0}] [L1600] COND FALSE !(! (s->s3)->tmp.reuse_message) [L1629] skip = 0 VAL [init=1, SSLv3_client_data={9:0}] [L1128] COND TRUE 1 VAL [init=1, SSLv3_client_data={9:0}] [L1130] EXPR s->state [L1130] state = s->state [L1131] EXPR s->state VAL [init=1, SSLv3_client_data={9:0}] [L1131] COND FALSE !(s->state == 12292) [L1134] EXPR s->state VAL [init=1, SSLv3_client_data={9:0}] [L1134] COND FALSE !(s->state == 16384) [L1137] EXPR s->state VAL [init=1, SSLv3_client_data={9:0}] [L1137] COND FALSE !(s->state == 4096) [L1140] EXPR s->state VAL [init=1, SSLv3_client_data={9:0}] [L1140] COND FALSE !(s->state == 20480) [L1143] EXPR s->state VAL [init=1, SSLv3_client_data={9:0}] [L1143] COND FALSE !(s->state == 4099) [L1146] EXPR s->state VAL [init=1, SSLv3_client_data={9:0}] [L1146] COND TRUE s->state == 4368 [L1290] s->shutdown = 0 [L1291] ret = __VERIFIER_nondet_int() [L1292] COND TRUE blastFlag == 0 [L1293] blastFlag = 1 VAL [init=1, SSLv3_client_data={9:0}] [L1297] COND FALSE !(ret <= 0) [L1302] s->state = 4384 [L1303] s->init_num = 0 [L1304] EXPR s->bbio [L1304] EXPR s->wbio VAL [init=1, SSLv3_client_data={9:0}] [L1304] COND TRUE (unsigned long )s->bbio != (unsigned long )s->wbio [L1600] EXPR s->s3 [L1600] EXPR (s->s3)->tmp.reuse_message VAL [init=1, SSLv3_client_data={9:0}] [L1600] COND FALSE !(! (s->s3)->tmp.reuse_message) [L1629] skip = 0 VAL [init=1, SSLv3_client_data={9:0}] [L1128] COND TRUE 1 VAL [init=1, SSLv3_client_data={9:0}] [L1130] EXPR s->state [L1130] state = s->state [L1131] EXPR s->state VAL [init=1, SSLv3_client_data={9:0}] [L1131] COND FALSE !(s->state == 12292) [L1134] EXPR s->state VAL [init=1, SSLv3_client_data={9:0}] [L1134] COND FALSE !(s->state == 16384) [L1137] EXPR s->state VAL [init=1, SSLv3_client_data={9:0}] [L1137] COND FALSE !(s->state == 4096) [L1140] EXPR s->state VAL [init=1, SSLv3_client_data={9:0}] [L1140] COND FALSE !(s->state == 20480) [L1143] EXPR s->state VAL [init=1, SSLv3_client_data={9:0}] [L1143] COND FALSE !(s->state == 4099) [L1146] EXPR s->state VAL [init=1, SSLv3_client_data={9:0}] [L1146] COND FALSE !(s->state == 4368) [L1149] EXPR s->state VAL [init=1, SSLv3_client_data={9:0}] [L1149] COND FALSE !(s->state == 4369) [L1152] EXPR s->state VAL [init=1, SSLv3_client_data={9:0}] [L1152] COND TRUE s->state == 4384 [L1312] ret = __VERIFIER_nondet_int() [L1313] COND TRUE blastFlag == 1 [L1314] blastFlag = 2 VAL [init=1, SSLv3_client_data={9:0}] [L1322] COND FALSE !(ret <= 0) [L1327] s->hit VAL [init=1, SSLv3_client_data={9:0}] [L1327] COND FALSE !(s->hit) [L1330] s->state = 4400 VAL [init=1, SSLv3_client_data={9:0}] [L1332] s->init_num = 0 VAL [init=1, SSLv3_client_data={9:0}] [L1600] EXPR s->s3 [L1600] EXPR (s->s3)->tmp.reuse_message VAL [init=1, SSLv3_client_data={9:0}] [L1600] COND FALSE !(! (s->s3)->tmp.reuse_message) [L1629] skip = 0 VAL [init=1, SSLv3_client_data={9:0}] [L1128] COND TRUE 1 VAL [init=1, SSLv3_client_data={9:0}] [L1130] EXPR s->state [L1130] state = s->state [L1131] EXPR s->state VAL [init=1, SSLv3_client_data={9:0}] [L1131] COND FALSE !(s->state == 12292) [L1134] EXPR s->state VAL [init=1, SSLv3_client_data={9:0}] [L1134] COND FALSE !(s->state == 16384) [L1137] EXPR s->state VAL [init=1, SSLv3_client_data={9:0}] [L1137] COND FALSE !(s->state == 4096) [L1140] EXPR s->state VAL [init=1, SSLv3_client_data={9:0}] [L1140] COND FALSE !(s->state == 20480) [L1143] EXPR s->state VAL [init=1, SSLv3_client_data={9:0}] [L1143] COND FALSE !(s->state == 4099) [L1146] EXPR s->state VAL [init=1, SSLv3_client_data={9:0}] [L1146] COND FALSE !(s->state == 4368) [L1149] EXPR s->state VAL [init=1, SSLv3_client_data={9:0}] [L1149] COND FALSE !(s->state == 4369) [L1152] EXPR s->state VAL [init=1, SSLv3_client_data={9:0}] [L1152] COND FALSE !(s->state == 4384) [L1155] EXPR s->state VAL [init=1, SSLv3_client_data={9:0}] [L1155] COND FALSE !(s->state == 4385) [L1158] EXPR s->state VAL [init=1, SSLv3_client_data={9:0}] [L1158] COND TRUE s->state == 4400 [L1336] EXPR s->s3 [L1336] EXPR (s->s3)->tmp.new_cipher [L1336] EXPR ((s->s3)->tmp.new_cipher)->algorithms VAL [init=1, SSLv3_client_data={9:0}] [L1336] COND FALSE !(((s->s3)->tmp.new_cipher)->algorithms & 256UL) [L1339] ret = __VERIFIER_nondet_int() [L1340] COND TRUE blastFlag == 2 [L1341] blastFlag = 3 VAL [init=1, SSLv3_client_data={9:0}] [L1345] COND FALSE !(ret <= 0) VAL [init=1, SSLv3_client_data={9:0}] [L1351] s->state = 4416 [L1352] s->init_num = 0 VAL [init=1, SSLv3_client_data={9:0}] [L1600] EXPR s->s3 [L1600] EXPR (s->s3)->tmp.reuse_message VAL [init=1, SSLv3_client_data={9:0}] [L1600] COND FALSE !(! (s->s3)->tmp.reuse_message) [L1629] skip = 0 VAL [init=1, SSLv3_client_data={9:0}] [L1128] COND TRUE 1 VAL [init=1, SSLv3_client_data={9:0}] [L1130] EXPR s->state [L1130] state = s->state [L1131] EXPR s->state VAL [init=1, SSLv3_client_data={9:0}] [L1131] COND FALSE !(s->state == 12292) [L1134] EXPR s->state VAL [init=1, SSLv3_client_data={9:0}] [L1134] COND FALSE !(s->state == 16384) [L1137] EXPR s->state VAL [init=1, SSLv3_client_data={9:0}] [L1137] COND FALSE !(s->state == 4096) [L1140] EXPR s->state VAL [init=1, SSLv3_client_data={9:0}] [L1140] COND FALSE !(s->state == 20480) [L1143] EXPR s->state VAL [init=1, SSLv3_client_data={9:0}] [L1143] COND FALSE !(s->state == 4099) [L1146] EXPR s->state VAL [init=1, SSLv3_client_data={9:0}] [L1146] COND FALSE !(s->state == 4368) [L1149] EXPR s->state VAL [init=1, SSLv3_client_data={9:0}] [L1149] COND FALSE !(s->state == 4369) [L1152] EXPR s->state VAL [init=1, SSLv3_client_data={9:0}] [L1152] COND FALSE !(s->state == 4384) [L1155] EXPR s->state VAL [init=1, SSLv3_client_data={9:0}] [L1155] COND FALSE !(s->state == 4385) [L1158] EXPR s->state VAL [init=1, SSLv3_client_data={9:0}] [L1158] COND FALSE !(s->state == 4400) [L1161] EXPR s->state VAL [init=1, SSLv3_client_data={9:0}] [L1161] COND FALSE !(s->state == 4401) [L1164] EXPR s->state VAL [init=1, SSLv3_client_data={9:0}] [L1164] COND TRUE s->state == 4416 [L1356] ret = __VERIFIER_nondet_int() [L1357] COND TRUE blastFlag == 3 [L1358] blastFlag = 4 VAL [init=1, SSLv3_client_data={9:0}] [L1362] COND FALSE !(ret <= 0) [L1367] s->state = 4432 [L1368] s->init_num = 0 VAL [init=1, SSLv3_client_data={9:0}] [L1369] COND FALSE !(! tmp___6) VAL [init=1, SSLv3_client_data={9:0}] [L1600] EXPR s->s3 [L1600] EXPR (s->s3)->tmp.reuse_message VAL [init=1, SSLv3_client_data={9:0}] [L1600] COND FALSE !(! (s->s3)->tmp.reuse_message) [L1629] skip = 0 VAL [init=1, SSLv3_client_data={9:0}] [L1128] COND TRUE 1 VAL [init=1, SSLv3_client_data={9:0}] [L1130] EXPR s->state [L1130] state = s->state [L1131] EXPR s->state VAL [init=1, SSLv3_client_data={9:0}] [L1131] COND FALSE !(s->state == 12292) [L1134] EXPR s->state VAL [init=1, SSLv3_client_data={9:0}] [L1134] COND FALSE !(s->state == 16384) [L1137] EXPR s->state VAL [init=1, SSLv3_client_data={9:0}] [L1137] COND FALSE !(s->state == 4096) [L1140] EXPR s->state VAL [init=1, SSLv3_client_data={9:0}] [L1140] COND FALSE !(s->state == 20480) [L1143] EXPR s->state VAL [init=1, SSLv3_client_data={9:0}] [L1143] COND FALSE !(s->state == 4099) [L1146] EXPR s->state VAL [init=1, SSLv3_client_data={9:0}] [L1146] COND FALSE !(s->state == 4368) [L1149] EXPR s->state VAL [init=1, SSLv3_client_data={9:0}] [L1149] COND FALSE !(s->state == 4369) [L1152] EXPR s->state VAL [init=1, SSLv3_client_data={9:0}] [L1152] COND FALSE !(s->state == 4384) [L1155] EXPR s->state VAL [init=1, SSLv3_client_data={9:0}] [L1155] COND FALSE !(s->state == 4385) [L1158] EXPR s->state VAL [init=1, SSLv3_client_data={9:0}] [L1158] COND FALSE !(s->state == 4400) [L1161] EXPR s->state VAL [init=1, SSLv3_client_data={9:0}] [L1161] COND FALSE !(s->state == 4401) [L1164] EXPR s->state VAL [init=1, SSLv3_client_data={9:0}] [L1164] COND FALSE !(s->state == 4416) [L1167] EXPR s->state VAL [init=1, SSLv3_client_data={9:0}] [L1167] COND FALSE !(s->state == 4417) [L1170] EXPR s->state VAL [init=1, SSLv3_client_data={9:0}] [L1170] COND TRUE s->state == 4432 [L1378] ret = __VERIFIER_nondet_int() [L1379] COND TRUE blastFlag == 4 VAL [init=1, SSLv3_client_data={9:0}] [L1641] __VERIFIER_error() VAL [init=1, SSLv3_client_data={9:0}] - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 129 locations, 1 error locations. Result: UNSAFE, OverallTime: 12.0s, OverallIterations: 24, TraceHistogramMax: 6, AutomataDifference: 8.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 4903 SDtfs, 1790 SDslu, 6305 SDs, 0 SdLazy, 3605 SolverSat, 135 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 6.9s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 126 GetRequests, 46 SyntacticMatches, 19 SemanticMatches, 61 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=705occurred in iteration=23, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.4s AutomataMinimizationTime, 23 MinimizatonAttempts, 1525 StatesRemovedByMinimization, 19 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.7s SatisfiabilityAnalysisTime, 1.1s InterpolantComputationTime, 1918 NumberOfCodeBlocks, 1918 NumberOfCodeBlocksAsserted, 24 NumberOfCheckSat, 1783 ConstructedInterpolants, 0 QuantifiedInterpolants, 373356 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 23 InterpolantComputations, 23 PerfectInterpolantSequences, 1532/1532 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces Received shutdown request... ### Bit-precise run ### This is Ultimate 0.1.24-678e011 [2019-11-20 04:34:39,703 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-20 04:34:39,704 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-20 04:34:39,720 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-20 04:34:39,720 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-20 04:34:39,722 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-20 04:34:39,724 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-20 04:34:39,732 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-20 04:34:39,737 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-20 04:34:39,740 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-20 04:34:39,741 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-20 04:34:39,742 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-20 04:34:39,743 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-20 04:34:39,745 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-20 04:34:39,746 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-20 04:34:39,747 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-20 04:34:39,749 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-20 04:34:39,749 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-20 04:34:39,752 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-20 04:34:39,755 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-20 04:34:39,758 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-20 04:34:39,761 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-20 04:34:39,763 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-20 04:34:39,764 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-20 04:34:39,768 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-20 04:34:39,768 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-20 04:34:39,769 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-20 04:34:39,770 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-20 04:34:39,770 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-20 04:34:39,771 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-20 04:34:39,771 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-20 04:34:39,772 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-20 04:34:39,773 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-20 04:34:39,773 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-20 04:34:39,774 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-20 04:34:39,775 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-20 04:34:39,775 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-20 04:34:39,776 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-20 04:34:39,776 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-20 04:34:39,777 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-20 04:34:39,778 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-20 04:34:39,779 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_3a4ed6af-12e8-48f9-ba15-2ea66e97af8d/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2019-11-20 04:34:39,803 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-20 04:34:39,812 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-20 04:34:39,813 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-20 04:34:39,814 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-20 04:34:39,814 INFO L138 SettingsManager]: * Use SBE=true [2019-11-20 04:34:39,814 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-20 04:34:39,814 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-20 04:34:39,815 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-20 04:34:39,815 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-20 04:34:39,816 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-11-20 04:34:39,817 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-20 04:34:39,817 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-11-20 04:34:39,817 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2019-11-20 04:34:39,818 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2019-11-20 04:34:39,818 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-20 04:34:39,818 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-20 04:34:39,819 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-20 04:34:39,819 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-11-20 04:34:39,819 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-20 04:34:39,819 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-20 04:34:39,820 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-20 04:34:39,820 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-20 04:34:39,820 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-20 04:34:39,820 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-20 04:34:39,821 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-20 04:34:39,821 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-11-20 04:34:39,821 INFO L138 SettingsManager]: * Trace refinement strategy=WOLF [2019-11-20 04:34:39,821 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --rewrite-divk --print-success --lang smt [2019-11-20 04:34:39,822 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-11-20 04:34:39,822 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-11-20 04:34:39,823 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_3a4ed6af-12e8-48f9-ba15-2ea66e97af8d/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 -> ed035556db4b60d2bb3e3e70af5f975a04e628c4 [2019-11-20 04:34:40,081 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-20 04:34:40,097 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-20 04:34:40,101 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-20 04:34:40,104 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-20 04:34:40,104 INFO L275 PluginConnector]: CDTParser initialized [2019-11-20 04:34:40,105 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_3a4ed6af-12e8-48f9-ba15-2ea66e97af8d/bin/uautomizer/../../sv-benchmarks/c/ssh/s3_clnt.blast.03.i.cil-1.c [2019-11-20 04:34:40,157 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_3a4ed6af-12e8-48f9-ba15-2ea66e97af8d/bin/uautomizer/data/17408eaa9/d915c09aafeb4aa2ac048e1526c86a05/FLAG26618aaa6 [2019-11-20 04:34:40,682 INFO L306 CDTParser]: Found 1 translation units. [2019-11-20 04:34:40,683 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_3a4ed6af-12e8-48f9-ba15-2ea66e97af8d/sv-benchmarks/c/ssh/s3_clnt.blast.03.i.cil-1.c [2019-11-20 04:34:40,708 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_3a4ed6af-12e8-48f9-ba15-2ea66e97af8d/bin/uautomizer/data/17408eaa9/d915c09aafeb4aa2ac048e1526c86a05/FLAG26618aaa6 [2019-11-20 04:34:40,971 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_3a4ed6af-12e8-48f9-ba15-2ea66e97af8d/bin/uautomizer/data/17408eaa9/d915c09aafeb4aa2ac048e1526c86a05 [2019-11-20 04:34:40,974 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-20 04:34:40,975 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-11-20 04:34:40,976 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-20 04:34:40,976 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-20 04:34:40,982 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-20 04:34:40,983 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.11 04:34:40" (1/1) ... [2019-11-20 04:34:40,986 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@63cbfd1d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 04:34:40, skipping insertion in model container [2019-11-20 04:34:40,986 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.11 04:34:40" (1/1) ... [2019-11-20 04:34:40,993 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-11-20 04:34:41,061 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-11-20 04:34:41,598 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-20 04:34:41,621 INFO L188 MainTranslator]: Completed pre-run [2019-11-20 04:34:41,765 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-20 04:34:41,785 INFO L192 MainTranslator]: Completed translation [2019-11-20 04:34:41,785 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 04:34:41 WrapperNode [2019-11-20 04:34:41,786 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-20 04:34:41,786 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-11-20 04:34:41,786 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-11-20 04:34:41,787 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-11-20 04:34:41,795 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 04:34:41" (1/1) ... [2019-11-20 04:34:41,819 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 04:34:41" (1/1) ... [2019-11-20 04:34:41,871 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-11-20 04:34:41,871 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-20 04:34:41,871 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-20 04:34:41,871 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-20 04:34:41,885 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 04:34:41" (1/1) ... [2019-11-20 04:34:41,885 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 04:34:41" (1/1) ... [2019-11-20 04:34:41,905 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 04:34:41" (1/1) ... [2019-11-20 04:34:41,920 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 04:34:41" (1/1) ... [2019-11-20 04:34:41,954 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 04:34:41" (1/1) ... [2019-11-20 04:34:41,962 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 04:34:41" (1/1) ... [2019-11-20 04:34:41,966 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 04:34:41" (1/1) ... [2019-11-20 04:34:41,972 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-20 04:34:41,972 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-20 04:34:41,972 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-20 04:34:41,973 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-20 04:34:41,973 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 04:34:41" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_3a4ed6af-12e8-48f9-ba15-2ea66e97af8d/bin/uautomizer/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-20 04:34:42,032 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2019-11-20 04:34:42,033 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-11-20 04:34:42,033 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4 [2019-11-20 04:34:42,034 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2019-11-20 04:34:42,034 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2019-11-20 04:34:42,034 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-20 04:34:42,034 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-20 04:34:42,034 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2019-11-20 04:34:42,273 WARN L736 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-11-20 04:34:45,071 INFO L689 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##85: assume !false; [2019-11-20 04:34:45,072 INFO L689 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##84: assume false; [2019-11-20 04:34:45,073 INFO L280 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-20 04:34:45,073 INFO L285 CfgBuilder]: Removed 7 assume(true) statements. [2019-11-20 04:34:45,074 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 04:34:45 BoogieIcfgContainer [2019-11-20 04:34:45,074 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-20 04:34:45,075 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-20 04:34:45,076 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-20 04:34:45,078 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-20 04:34:45,078 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.11 04:34:40" (1/3) ... [2019-11-20 04:34:45,079 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2690815e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.11 04:34:45, skipping insertion in model container [2019-11-20 04:34:45,079 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 04:34:41" (2/3) ... [2019-11-20 04:34:45,079 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2690815e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.11 04:34:45, skipping insertion in model container [2019-11-20 04:34:45,080 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 04:34:45" (3/3) ... [2019-11-20 04:34:45,081 INFO L109 eAbstractionObserver]: Analyzing ICFG s3_clnt.blast.03.i.cil-1.c [2019-11-20 04:34:45,091 INFO L153 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-20 04:34:45,096 INFO L165 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-11-20 04:34:45,105 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-11-20 04:34:45,128 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-20 04:34:45,128 INFO L374 AbstractCegarLoop]: Hoare is true [2019-11-20 04:34:45,129 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-20 04:34:45,129 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-20 04:34:45,129 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-20 04:34:45,129 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-20 04:34:45,130 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-20 04:34:45,130 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-20 04:34:45,147 INFO L276 IsEmpty]: Start isEmpty. Operand 129 states. [2019-11-20 04:34:45,154 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2019-11-20 04:34:45,154 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 04:34:45,155 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 04:34:45,155 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 04:34:45,159 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 04:34:45,159 INFO L82 PathProgramCache]: Analyzing trace with hash -1457695037, now seen corresponding path program 1 times [2019-11-20 04:34:45,170 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-20 04:34:45,171 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [1068921599] [2019-11-20 04:34:45,171 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_3a4ed6af-12e8-48f9-ba15-2ea66e97af8d/bin/uautomizer/cvc4 Starting monitored process 2 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-20 04:34:45,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 04:34:45,377 INFO L255 TraceCheckSpWp]: Trace formula consists of 98 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-20 04:34:45,384 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 04:34:45,423 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 04:34:45,430 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-20 04:34:45,447 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 04:34:45,450 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1068921599] [2019-11-20 04:34:45,451 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-20 04:34:45,451 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 4 [2019-11-20 04:34:45,452 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1970681890] [2019-11-20 04:34:45,459 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-20 04:34:45,460 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-20 04:34:45,474 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-20 04:34:45,475 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-20 04:34:45,477 INFO L87 Difference]: Start difference. First operand 129 states. Second operand 4 states. [2019-11-20 04:34:45,665 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 04:34:45,665 INFO L93 Difference]: Finished difference Result 485 states and 820 transitions. [2019-11-20 04:34:45,670 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-20 04:34:45,671 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 24 [2019-11-20 04:34:45,672 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 04:34:45,694 INFO L225 Difference]: With dead ends: 485 [2019-11-20 04:34:45,695 INFO L226 Difference]: Without dead ends: 312 [2019-11-20 04:34:45,699 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 44 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-20 04:34:45,719 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 312 states. [2019-11-20 04:34:45,792 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 312 to 312. [2019-11-20 04:34:45,793 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 312 states. [2019-11-20 04:34:45,800 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 312 states to 312 states and 467 transitions. [2019-11-20 04:34:45,801 INFO L78 Accepts]: Start accepts. Automaton has 312 states and 467 transitions. Word has length 24 [2019-11-20 04:34:45,802 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 04:34:45,802 INFO L462 AbstractCegarLoop]: Abstraction has 312 states and 467 transitions. [2019-11-20 04:34:45,802 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-20 04:34:45,802 INFO L276 IsEmpty]: Start isEmpty. Operand 312 states and 467 transitions. [2019-11-20 04:34:45,810 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2019-11-20 04:34:45,811 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 04:34:45,811 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 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-20 04:34:46,014 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-20 04:34:46,016 INFO L410 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 04:34:46,016 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 04:34:46,017 INFO L82 PathProgramCache]: Analyzing trace with hash -1854239308, now seen corresponding path program 1 times [2019-11-20 04:34:46,018 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-20 04:34:46,018 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [803380557] [2019-11-20 04:34:46,018 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_3a4ed6af-12e8-48f9-ba15-2ea66e97af8d/bin/uautomizer/cvc4 Starting monitored process 3 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-20 04:34:46,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 04:34:46,241 INFO L255 TraceCheckSpWp]: Trace formula consists of 175 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-20 04:34:46,245 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 04:34:46,267 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 33 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 04:34:46,267 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-20 04:34:46,285 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 33 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 04:34:46,285 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [803380557] [2019-11-20 04:34:46,286 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-20 04:34:46,286 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 4 [2019-11-20 04:34:46,286 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2055883150] [2019-11-20 04:34:46,288 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-20 04:34:46,288 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-20 04:34:46,288 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-20 04:34:46,288 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-20 04:34:46,289 INFO L87 Difference]: Start difference. First operand 312 states and 467 transitions. Second operand 4 states. [2019-11-20 04:34:48,408 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 04:34:48,409 INFO L93 Difference]: Finished difference Result 716 states and 1078 transitions. [2019-11-20 04:34:48,409 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-20 04:34:48,409 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 60 [2019-11-20 04:34:48,410 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 04:34:48,413 INFO L225 Difference]: With dead ends: 716 [2019-11-20 04:34:48,413 INFO L226 Difference]: Without dead ends: 512 [2019-11-20 04:34:48,415 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 118 GetRequests, 116 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-20 04:34:48,416 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 512 states. [2019-11-20 04:34:48,442 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 512 to 512. [2019-11-20 04:34:48,442 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 512 states. [2019-11-20 04:34:48,444 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 512 states to 512 states and 764 transitions. [2019-11-20 04:34:48,445 INFO L78 Accepts]: Start accepts. Automaton has 512 states and 764 transitions. Word has length 60 [2019-11-20 04:34:48,445 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 04:34:48,445 INFO L462 AbstractCegarLoop]: Abstraction has 512 states and 764 transitions. [2019-11-20 04:34:48,446 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-20 04:34:48,446 INFO L276 IsEmpty]: Start isEmpty. Operand 512 states and 764 transitions. [2019-11-20 04:34:48,450 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2019-11-20 04:34:48,450 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 04:34:48,451 INFO L410 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 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] [2019-11-20 04:34:48,653 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-20 04:34:48,654 INFO L410 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 04:34:48,654 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 04:34:48,654 INFO L82 PathProgramCache]: Analyzing trace with hash 922615118, now seen corresponding path program 1 times [2019-11-20 04:34:48,655 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-20 04:34:48,655 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [2068053681] [2019-11-20 04:34:48,655 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_3a4ed6af-12e8-48f9-ba15-2ea66e97af8d/bin/uautomizer/cvc4 Starting monitored process 4 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-20 04:34:49,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 04:34:49,917 INFO L255 TraceCheckSpWp]: Trace formula consists of 252 conjuncts, 8 conjunts are in the unsatisfiable core [2019-11-20 04:34:49,923 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 04:34:49,972 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 04:34:49,974 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 04:34:49,977 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 04:34:50,007 INFO L343 Elim1Store]: treesize reduction 19, result has 32.1 percent of original size [2019-11-20 04:34:50,008 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 44 treesize of output 35 [2019-11-20 04:34:50,009 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 04:34:50,035 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 04:34:50,037 INFO L496 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-20 04:34:50,037 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:48, output treesize:22 [2019-11-20 04:34:50,101 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 04:34:50,105 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 04:34:50,106 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 33 treesize of output 26 [2019-11-20 04:34:50,107 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 04:34:50,120 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 04:34:50,120 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-20 04:34:50,120 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:36, output treesize:15 [2019-11-20 04:34:50,129 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2019-11-20 04:34:50,130 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 04:34:50,132 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 04:34:50,133 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-20 04:34:50,133 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:15, output treesize:5 [2019-11-20 04:34:50,177 INFO L134 CoverageAnalysis]: Checked inductivity of 118 backedges. 32 proven. 0 refuted. 0 times theorem prover too weak. 86 trivial. 0 not checked. [2019-11-20 04:34:50,177 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-20 04:34:50,266 INFO L134 CoverageAnalysis]: Checked inductivity of 118 backedges. 32 proven. 0 refuted. 0 times theorem prover too weak. 86 trivial. 0 not checked. [2019-11-20 04:34:50,267 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [2068053681] [2019-11-20 04:34:50,267 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-20 04:34:50,267 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 6 [2019-11-20 04:34:50,267 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1647766731] [2019-11-20 04:34:50,269 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-20 04:34:50,269 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-20 04:34:50,269 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-20 04:34:50,270 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-11-20 04:34:50,270 INFO L87 Difference]: Start difference. First operand 512 states and 764 transitions. Second operand 6 states. [2019-11-20 04:34:54,934 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 04:34:54,934 INFO L93 Difference]: Finished difference Result 1450 states and 2171 transitions. [2019-11-20 04:34:54,946 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-20 04:34:54,946 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 98 [2019-11-20 04:34:54,947 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 04:34:54,953 INFO L225 Difference]: With dead ends: 1450 [2019-11-20 04:34:54,953 INFO L226 Difference]: Without dead ends: 1044 [2019-11-20 04:34:54,955 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 196 GetRequests, 189 SyntacticMatches, 1 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2019-11-20 04:34:54,956 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1044 states. [2019-11-20 04:34:54,985 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1044 to 592. [2019-11-20 04:34:54,985 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 592 states. [2019-11-20 04:34:54,987 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 592 states to 592 states and 894 transitions. [2019-11-20 04:34:54,988 INFO L78 Accepts]: Start accepts. Automaton has 592 states and 894 transitions. Word has length 98 [2019-11-20 04:34:54,988 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 04:34:54,988 INFO L462 AbstractCegarLoop]: Abstraction has 592 states and 894 transitions. [2019-11-20 04:34:54,988 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-20 04:34:54,989 INFO L276 IsEmpty]: Start isEmpty. Operand 592 states and 894 transitions. [2019-11-20 04:34:54,991 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2019-11-20 04:34:54,991 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 04:34:54,991 INFO L410 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 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] [2019-11-20 04:34:55,204 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-20 04:34:55,204 INFO L410 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 04:34:55,205 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 04:34:55,205 INFO L82 PathProgramCache]: Analyzing trace with hash -1761362845, now seen corresponding path program 1 times [2019-11-20 04:34:55,206 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-20 04:34:55,206 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [1027132092] [2019-11-20 04:34:55,220 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_3a4ed6af-12e8-48f9-ba15-2ea66e97af8d/bin/uautomizer/cvc4 Starting monitored process 5 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-20 04:34:56,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 04:34:56,427 INFO L255 TraceCheckSpWp]: Trace formula consists of 254 conjuncts, 8 conjunts are in the unsatisfiable core [2019-11-20 04:34:56,437 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 04:34:56,456 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 04:34:56,461 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 04:34:56,463 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 04:34:56,497 INFO L343 Elim1Store]: treesize reduction 19, result has 32.1 percent of original size [2019-11-20 04:34:56,497 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 44 treesize of output 35 [2019-11-20 04:34:56,498 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 04:34:56,526 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 04:34:56,527 INFO L496 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-20 04:34:56,527 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:48, output treesize:22 [2019-11-20 04:34:56,562 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 04:34:56,565 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 04:34:56,565 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 33 treesize of output 26 [2019-11-20 04:34:56,566 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 04:34:56,579 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 04:34:56,579 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-20 04:34:56,579 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:36, output treesize:15 [2019-11-20 04:34:56,588 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2019-11-20 04:34:56,588 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 04:34:56,591 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 04:34:56,591 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-20 04:34:56,592 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:15, output treesize:5 [2019-11-20 04:34:56,614 INFO L134 CoverageAnalysis]: Checked inductivity of 122 backedges. 36 proven. 0 refuted. 0 times theorem prover too weak. 86 trivial. 0 not checked. [2019-11-20 04:34:56,615 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-20 04:34:56,673 INFO L134 CoverageAnalysis]: Checked inductivity of 122 backedges. 36 proven. 0 refuted. 0 times theorem prover too weak. 86 trivial. 0 not checked. [2019-11-20 04:34:56,673 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1027132092] [2019-11-20 04:34:56,673 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-20 04:34:56,673 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 6 [2019-11-20 04:34:56,673 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [177970979] [2019-11-20 04:34:56,674 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-20 04:34:56,674 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-20 04:34:56,674 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-20 04:34:56,675 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-11-20 04:34:56,675 INFO L87 Difference]: Start difference. First operand 592 states and 894 transitions. Second operand 6 states. [2019-11-20 04:35:00,719 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 04:35:00,719 INFO L93 Difference]: Finished difference Result 1497 states and 2249 transitions. [2019-11-20 04:35:00,720 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-20 04:35:00,720 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 99 [2019-11-20 04:35:00,722 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 04:35:00,730 INFO L225 Difference]: With dead ends: 1497 [2019-11-20 04:35:00,730 INFO L226 Difference]: Without dead ends: 1027 [2019-11-20 04:35:00,732 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 198 GetRequests, 191 SyntacticMatches, 1 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2019-11-20 04:35:00,733 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1027 states. [2019-11-20 04:35:00,758 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1027 to 597. [2019-11-20 04:35:00,759 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 597 states. [2019-11-20 04:35:00,764 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 597 states to 597 states and 899 transitions. [2019-11-20 04:35:00,767 INFO L78 Accepts]: Start accepts. Automaton has 597 states and 899 transitions. Word has length 99 [2019-11-20 04:35:00,768 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 04:35:00,768 INFO L462 AbstractCegarLoop]: Abstraction has 597 states and 899 transitions. [2019-11-20 04:35:00,769 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-20 04:35:00,769 INFO L276 IsEmpty]: Start isEmpty. Operand 597 states and 899 transitions. [2019-11-20 04:35:00,775 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2019-11-20 04:35:00,775 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 04:35:00,776 INFO L410 BasicCegarLoop]: trace histogram [6, 6, 5, 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, 1, 1, 1] [2019-11-20 04:35:00,986 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-20 04:35:00,987 INFO L410 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 04:35:00,987 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 04:35:00,987 INFO L82 PathProgramCache]: Analyzing trace with hash -1354155866, now seen corresponding path program 1 times [2019-11-20 04:35:00,987 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-20 04:35:00,987 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [870734163] [2019-11-20 04:35:00,988 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_3a4ed6af-12e8-48f9-ba15-2ea66e97af8d/bin/uautomizer/cvc4 Starting monitored process 6 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-20 04:35:02,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 04:35:02,648 INFO L255 TraceCheckSpWp]: Trace formula consists of 289 conjuncts, 8 conjunts are in the unsatisfiable core [2019-11-20 04:35:02,653 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 04:35:02,672 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2019-11-20 04:35:02,672 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 04:35:02,678 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 04:35:02,678 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-20 04:35:02,678 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:17, output treesize:13 [2019-11-20 04:35:02,708 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 04:35:02,716 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 22 [2019-11-20 04:35:02,717 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 04:35:02,725 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 04:35:02,726 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-20 04:35:02,726 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:26, output treesize:22 [2019-11-20 04:35:02,760 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 04:35:02,761 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 22 treesize of output 10 [2019-11-20 04:35:02,761 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 04:35:02,764 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 04:35:02,764 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-20 04:35:02,764 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:22, output treesize:3 [2019-11-20 04:35:02,800 INFO L134 CoverageAnalysis]: Checked inductivity of 145 backedges. 111 proven. 0 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2019-11-20 04:35:02,800 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-20 04:35:02,865 INFO L134 CoverageAnalysis]: Checked inductivity of 145 backedges. 111 proven. 0 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2019-11-20 04:35:02,866 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [870734163] [2019-11-20 04:35:02,867 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-20 04:35:02,867 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6, 4] imperfect sequences [] total 8 [2019-11-20 04:35:02,867 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1370850756] [2019-11-20 04:35:02,868 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-11-20 04:35:02,869 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-20 04:35:02,869 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-11-20 04:35:02,872 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2019-11-20 04:35:02,873 INFO L87 Difference]: Start difference. First operand 597 states and 899 transitions. Second operand 8 states. [2019-11-20 04:35:11,173 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 04:35:11,173 INFO L93 Difference]: Finished difference Result 1957 states and 2947 transitions. [2019-11-20 04:35:11,175 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-11-20 04:35:11,175 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 112 [2019-11-20 04:35:11,175 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 04:35:11,182 INFO L225 Difference]: With dead ends: 1957 [2019-11-20 04:35:11,182 INFO L226 Difference]: Without dead ends: 1367 [2019-11-20 04:35:11,184 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 226 GetRequests, 216 SyntacticMatches, 1 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=41, Invalid=69, Unknown=0, NotChecked=0, Total=110 [2019-11-20 04:35:11,186 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1367 states. [2019-11-20 04:35:11,217 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1367 to 751. [2019-11-20 04:35:11,217 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 751 states. [2019-11-20 04:35:11,220 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 751 states to 751 states and 1153 transitions. [2019-11-20 04:35:11,221 INFO L78 Accepts]: Start accepts. Automaton has 751 states and 1153 transitions. Word has length 112 [2019-11-20 04:35:11,223 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 04:35:11,224 INFO L462 AbstractCegarLoop]: Abstraction has 751 states and 1153 transitions. [2019-11-20 04:35:11,224 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-11-20 04:35:11,224 INFO L276 IsEmpty]: Start isEmpty. Operand 751 states and 1153 transitions. [2019-11-20 04:35:11,226 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2019-11-20 04:35:11,226 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 04:35:11,227 INFO L410 BasicCegarLoop]: trace histogram [6, 6, 5, 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, 1, 1, 1] [2019-11-20 04:35:11,440 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-20 04:35:11,441 INFO L410 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 04:35:11,441 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 04:35:11,441 INFO L82 PathProgramCache]: Analyzing trace with hash 1254631592, now seen corresponding path program 1 times [2019-11-20 04:35:11,442 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-20 04:35:11,442 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [1189606080] [2019-11-20 04:35:11,442 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_3a4ed6af-12e8-48f9-ba15-2ea66e97af8d/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-20 04:35:13,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-20 04:35:15,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-20 04:35:16,130 INFO L174 FreeRefinementEngine]: Strategy WOLF found a feasible trace [2019-11-20 04:35:16,130 INFO L475 BasicCegarLoop]: Counterexample might be feasible [2019-11-20 04:35:16,347 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-20 04:35:16,472 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 20.11 04:35:16 BoogieIcfgContainer [2019-11-20 04:35:16,472 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-11-20 04:35:16,472 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-11-20 04:35:16,472 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-11-20 04:35:16,473 INFO L275 PluginConnector]: Witness Printer initialized [2019-11-20 04:35:16,473 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 04:34:45" (3/4) ... [2019-11-20 04:35:16,475 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2019-11-20 04:35:16,594 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/run_dir_3a4ed6af-12e8-48f9-ba15-2ea66e97af8d/bin/uautomizer/witness.graphml [2019-11-20 04:35:16,595 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-11-20 04:35:16,596 INFO L168 Benchmark]: Toolchain (without parser) took 35621.32 ms. Allocated memory was 1.0 GB in the beginning and 1.3 GB in the end (delta: 293.6 MB). Free memory was 951.0 MB in the beginning and 1.1 GB in the end (delta: -145.7 MB). Peak memory consumption was 147.9 MB. Max. memory is 11.5 GB. [2019-11-20 04:35:16,596 INFO L168 Benchmark]: CDTParser took 0.24 ms. Allocated memory is still 1.0 GB. Free memory is still 981.9 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-20 04:35:16,597 INFO L168 Benchmark]: CACSL2BoogieTranslator took 809.97 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 161.5 MB). Free memory was 951.0 MB in the beginning and 1.1 GB in the end (delta: -183.5 MB). Peak memory consumption was 29.7 MB. Max. memory is 11.5 GB. [2019-11-20 04:35:16,597 INFO L168 Benchmark]: Boogie Procedure Inliner took 84.59 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.6 MB). Peak memory consumption was 6.6 MB. Max. memory is 11.5 GB. [2019-11-20 04:35:16,597 INFO L168 Benchmark]: Boogie Preprocessor took 100.93 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.6 MB). Peak memory consumption was 6.6 MB. Max. memory is 11.5 GB. [2019-11-20 04:35:16,598 INFO L168 Benchmark]: RCFGBuilder took 3102.26 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 84.2 MB). Peak memory consumption was 84.2 MB. Max. memory is 11.5 GB. [2019-11-20 04:35:16,598 INFO L168 Benchmark]: TraceAbstraction took 31396.69 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 132.1 MB). Free memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: -77.1 MB). Peak memory consumption was 55.0 MB. Max. memory is 11.5 GB. [2019-11-20 04:35:16,599 INFO L168 Benchmark]: Witness Printer took 122.53 ms. Allocated memory is still 1.3 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 17.4 MB). Peak memory consumption was 17.4 MB. Max. memory is 11.5 GB. [2019-11-20 04:35:16,600 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.24 ms. Allocated memory is still 1.0 GB. Free memory is still 981.9 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 809.97 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 161.5 MB). Free memory was 951.0 MB in the beginning and 1.1 GB in the end (delta: -183.5 MB). Peak memory consumption was 29.7 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 84.59 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.6 MB). Peak memory consumption was 6.6 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 100.93 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.6 MB). Peak memory consumption was 6.6 MB. Max. memory is 11.5 GB. * RCFGBuilder took 3102.26 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 84.2 MB). Peak memory consumption was 84.2 MB. Max. memory is 11.5 GB. * TraceAbstraction took 31396.69 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 132.1 MB). Free memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: -77.1 MB). Peak memory consumption was 55.0 MB. Max. memory is 11.5 GB. * Witness Printer took 122.53 ms. Allocated memory is still 1.3 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 17.4 MB). Peak memory consumption was 17.4 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 1641]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L1042] static int init = 1; [L1043] static SSL_METHOD SSLv3_client_data ; VAL [init=1, SSLv3_client_data={1758530013:0}] [L1065] SSL *s = (SSL*)malloc(sizeof(SSL)) ; [L1069] s->s3 = malloc(sizeof(struct ssl3_state_st)) [L1070] s->ctx = malloc(sizeof(SSL_CTX)) [L1071] s->session = malloc(sizeof(SSL_SESSION)) [L1072] s->state = 12292 [L1073] s->version = __VERIFIER_nondet_int() [L1080] BUF_MEM *buf ; [L1081] unsigned long tmp ; [L1082] unsigned long l ; [L1083] long num1 ; [L1084] void (*cb)() ; [L1085] int ret ; [L1086] int new_state ; [L1087] int state ; [L1088] int skip ; [L1089] int tmp___1 = __VERIFIER_nondet_int() ; [L1090] int tmp___2 = __VERIFIER_nondet_int() ; [L1091] int tmp___3 = __VERIFIER_nondet_int() ; [L1092] int tmp___4 = __VERIFIER_nondet_int() ; [L1093] int tmp___5 = __VERIFIER_nondet_int() ; [L1094] int tmp___6 = __VERIFIER_nondet_int() ; [L1095] int tmp___7 = __VERIFIER_nondet_int() ; [L1096] int tmp___8 = __VERIFIER_nondet_int() ; [L1097] long tmp___9 = __VERIFIER_nondet_long() ; [L1098] int blastFlag ; [L1101] blastFlag = 0 [L1102] s->hit=__VERIFIER_nondet_int () [L1103] s->state = 12292 [L1104] tmp = __VERIFIER_nondet_int() [L1105] cb = (void (*)())((void *)0) [L1106] ret = -1 [L1107] skip = 0 [L1108] EXPR s->info_callback VAL [init=1, SSLv3_client_data={1758530013:0}] [L1108] COND TRUE (unsigned long )s->info_callback != (unsigned long )((void *)0) [L1109] EXPR s->info_callback [L1109] cb = s->info_callback [L1117] EXPR s->in_handshake [L1117] s->in_handshake += 1 [L1118] COND FALSE !(tmp___1 & 12288) VAL [init=1, SSLv3_client_data={1758530013:0}] [L1128] COND TRUE 1 VAL [init=1, SSLv3_client_data={1758530013:0}] [L1130] EXPR s->state [L1130] state = s->state [L1131] EXPR s->state VAL [init=1, SSLv3_client_data={1758530013:0}] [L1131] COND TRUE s->state == 12292 [L1234] s->new_session = 1 [L1235] s->state = 4096 [L1236] EXPR s->ctx [L1236] EXPR (s->ctx)->stats.sess_connect_renegotiate [L1236] (s->ctx)->stats.sess_connect_renegotiate += 1 [L1241] s->server = 0 VAL [init=1, SSLv3_client_data={1758530013:0}] [L1242] COND TRUE (unsigned long )cb != (unsigned long )((void *)0) VAL [init=1, SSLv3_client_data={1758530013:0}] [L1247] EXPR s->version VAL [init=1, SSLv3_client_data={1758530013:0}] [L1247] COND FALSE !((s->version & 65280) != 768) [L1253] s->type = 4096 [L1254] EXPR s->init_buf VAL [init=1, SSLv3_client_data={1758530013:0}] [L1254] COND FALSE !((unsigned long )s->init_buf == (unsigned long )((void *)0)) [L1272] COND FALSE !(! tmp___4) VAL [init=1, SSLv3_client_data={1758530013:0}] [L1278] COND FALSE !(! tmp___5) [L1284] s->state = 4368 [L1285] EXPR s->ctx [L1285] EXPR (s->ctx)->stats.sess_connect [L1285] (s->ctx)->stats.sess_connect += 1 [L1286] s->init_num = 0 VAL [init=1, SSLv3_client_data={1758530013:0}] [L1600] EXPR s->s3 [L1600] EXPR (s->s3)->tmp.reuse_message VAL [init=1, SSLv3_client_data={1758530013:0}] [L1600] COND FALSE !(! (s->s3)->tmp.reuse_message) [L1629] skip = 0 VAL [init=1, SSLv3_client_data={1758530013:0}] [L1128] COND TRUE 1 VAL [init=1, SSLv3_client_data={1758530013:0}] [L1130] EXPR s->state [L1130] state = s->state [L1131] EXPR s->state VAL [init=1, SSLv3_client_data={1758530013:0}] [L1131] COND FALSE !(s->state == 12292) [L1134] EXPR s->state VAL [init=1, SSLv3_client_data={1758530013:0}] [L1134] COND FALSE !(s->state == 16384) [L1137] EXPR s->state VAL [init=1, SSLv3_client_data={1758530013:0}] [L1137] COND FALSE !(s->state == 4096) [L1140] EXPR s->state VAL [init=1, SSLv3_client_data={1758530013:0}] [L1140] COND FALSE !(s->state == 20480) [L1143] EXPR s->state VAL [init=1, SSLv3_client_data={1758530013:0}] [L1143] COND FALSE !(s->state == 4099) [L1146] EXPR s->state VAL [init=1, SSLv3_client_data={1758530013:0}] [L1146] COND TRUE s->state == 4368 [L1290] s->shutdown = 0 [L1291] ret = __VERIFIER_nondet_int() [L1292] COND TRUE blastFlag == 0 [L1293] blastFlag = 1 VAL [init=1, SSLv3_client_data={1758530013:0}] [L1297] COND FALSE !(ret <= 0) [L1302] s->state = 4384 [L1303] s->init_num = 0 [L1304] EXPR s->bbio [L1304] EXPR s->wbio VAL [init=1, SSLv3_client_data={1758530013:0}] [L1304] COND TRUE (unsigned long )s->bbio != (unsigned long )s->wbio [L1600] EXPR s->s3 [L1600] EXPR (s->s3)->tmp.reuse_message VAL [init=1, SSLv3_client_data={1758530013:0}] [L1600] COND FALSE !(! (s->s3)->tmp.reuse_message) [L1629] skip = 0 VAL [init=1, SSLv3_client_data={1758530013:0}] [L1128] COND TRUE 1 VAL [init=1, SSLv3_client_data={1758530013:0}] [L1130] EXPR s->state [L1130] state = s->state [L1131] EXPR s->state VAL [init=1, SSLv3_client_data={1758530013:0}] [L1131] COND FALSE !(s->state == 12292) [L1134] EXPR s->state VAL [init=1, SSLv3_client_data={1758530013:0}] [L1134] COND FALSE !(s->state == 16384) [L1137] EXPR s->state VAL [init=1, SSLv3_client_data={1758530013:0}] [L1137] COND FALSE !(s->state == 4096) [L1140] EXPR s->state VAL [init=1, SSLv3_client_data={1758530013:0}] [L1140] COND FALSE !(s->state == 20480) [L1143] EXPR s->state VAL [init=1, SSLv3_client_data={1758530013:0}] [L1143] COND FALSE !(s->state == 4099) [L1146] EXPR s->state VAL [init=1, SSLv3_client_data={1758530013:0}] [L1146] COND FALSE !(s->state == 4368) [L1149] EXPR s->state VAL [init=1, SSLv3_client_data={1758530013:0}] [L1149] COND FALSE !(s->state == 4369) [L1152] EXPR s->state VAL [init=1, SSLv3_client_data={1758530013:0}] [L1152] COND TRUE s->state == 4384 [L1312] ret = __VERIFIER_nondet_int() [L1313] COND TRUE blastFlag == 1 [L1314] blastFlag = 2 VAL [init=1, SSLv3_client_data={1758530013:0}] [L1322] COND FALSE !(ret <= 0) [L1327] s->hit VAL [init=1, SSLv3_client_data={1758530013:0}] [L1327] COND FALSE !(s->hit) [L1330] s->state = 4400 VAL [init=1, SSLv3_client_data={1758530013:0}] [L1332] s->init_num = 0 VAL [init=1, SSLv3_client_data={1758530013:0}] [L1600] EXPR s->s3 [L1600] EXPR (s->s3)->tmp.reuse_message VAL [init=1, SSLv3_client_data={1758530013:0}] [L1600] COND FALSE !(! (s->s3)->tmp.reuse_message) [L1629] skip = 0 VAL [init=1, SSLv3_client_data={1758530013:0}] [L1128] COND TRUE 1 VAL [init=1, SSLv3_client_data={1758530013:0}] [L1130] EXPR s->state [L1130] state = s->state [L1131] EXPR s->state VAL [init=1, SSLv3_client_data={1758530013:0}] [L1131] COND FALSE !(s->state == 12292) [L1134] EXPR s->state VAL [init=1, SSLv3_client_data={1758530013:0}] [L1134] COND FALSE !(s->state == 16384) [L1137] EXPR s->state VAL [init=1, SSLv3_client_data={1758530013:0}] [L1137] COND FALSE !(s->state == 4096) [L1140] EXPR s->state VAL [init=1, SSLv3_client_data={1758530013:0}] [L1140] COND FALSE !(s->state == 20480) [L1143] EXPR s->state VAL [init=1, SSLv3_client_data={1758530013:0}] [L1143] COND FALSE !(s->state == 4099) [L1146] EXPR s->state VAL [init=1, SSLv3_client_data={1758530013:0}] [L1146] COND FALSE !(s->state == 4368) [L1149] EXPR s->state VAL [init=1, SSLv3_client_data={1758530013:0}] [L1149] COND FALSE !(s->state == 4369) [L1152] EXPR s->state VAL [init=1, SSLv3_client_data={1758530013:0}] [L1152] COND FALSE !(s->state == 4384) [L1155] EXPR s->state VAL [init=1, SSLv3_client_data={1758530013:0}] [L1155] COND FALSE !(s->state == 4385) [L1158] EXPR s->state VAL [init=1, SSLv3_client_data={1758530013:0}] [L1158] COND TRUE s->state == 4400 [L1336] EXPR s->s3 [L1336] EXPR (s->s3)->tmp.new_cipher [L1336] EXPR ((s->s3)->tmp.new_cipher)->algorithms VAL [init=1, SSLv3_client_data={1758530013:0}] [L1336] COND FALSE !(((s->s3)->tmp.new_cipher)->algorithms & 256UL) [L1339] ret = __VERIFIER_nondet_int() [L1340] COND TRUE blastFlag == 2 [L1341] blastFlag = 3 VAL [init=1, SSLv3_client_data={1758530013:0}] [L1345] COND FALSE !(ret <= 0) VAL [init=1, SSLv3_client_data={1758530013:0}] [L1351] s->state = 4416 [L1352] s->init_num = 0 VAL [init=1, SSLv3_client_data={1758530013:0}] [L1600] EXPR s->s3 [L1600] EXPR (s->s3)->tmp.reuse_message VAL [init=1, SSLv3_client_data={1758530013:0}] [L1600] COND FALSE !(! (s->s3)->tmp.reuse_message) [L1629] skip = 0 VAL [init=1, SSLv3_client_data={1758530013:0}] [L1128] COND TRUE 1 VAL [init=1, SSLv3_client_data={1758530013:0}] [L1130] EXPR s->state [L1130] state = s->state [L1131] EXPR s->state VAL [init=1, SSLv3_client_data={1758530013:0}] [L1131] COND FALSE !(s->state == 12292) [L1134] EXPR s->state VAL [init=1, SSLv3_client_data={1758530013:0}] [L1134] COND FALSE !(s->state == 16384) [L1137] EXPR s->state VAL [init=1, SSLv3_client_data={1758530013:0}] [L1137] COND FALSE !(s->state == 4096) [L1140] EXPR s->state VAL [init=1, SSLv3_client_data={1758530013:0}] [L1140] COND FALSE !(s->state == 20480) [L1143] EXPR s->state VAL [init=1, SSLv3_client_data={1758530013:0}] [L1143] COND FALSE !(s->state == 4099) [L1146] EXPR s->state VAL [init=1, SSLv3_client_data={1758530013:0}] [L1146] COND FALSE !(s->state == 4368) [L1149] EXPR s->state VAL [init=1, SSLv3_client_data={1758530013:0}] [L1149] COND FALSE !(s->state == 4369) [L1152] EXPR s->state VAL [init=1, SSLv3_client_data={1758530013:0}] [L1152] COND FALSE !(s->state == 4384) [L1155] EXPR s->state VAL [init=1, SSLv3_client_data={1758530013:0}] [L1155] COND FALSE !(s->state == 4385) [L1158] EXPR s->state VAL [init=1, SSLv3_client_data={1758530013:0}] [L1158] COND FALSE !(s->state == 4400) [L1161] EXPR s->state VAL [init=1, SSLv3_client_data={1758530013:0}] [L1161] COND FALSE !(s->state == 4401) [L1164] EXPR s->state VAL [init=1, SSLv3_client_data={1758530013:0}] [L1164] COND TRUE s->state == 4416 [L1356] ret = __VERIFIER_nondet_int() [L1357] COND TRUE blastFlag == 3 [L1358] blastFlag = 4 VAL [init=1, SSLv3_client_data={1758530013:0}] [L1362] COND FALSE !(ret <= 0) [L1367] s->state = 4432 [L1368] s->init_num = 0 VAL [init=1, SSLv3_client_data={1758530013:0}] [L1369] COND FALSE !(! tmp___6) VAL [init=1, SSLv3_client_data={1758530013:0}] [L1600] EXPR s->s3 [L1600] EXPR (s->s3)->tmp.reuse_message VAL [init=1, SSLv3_client_data={1758530013:0}] [L1600] COND FALSE !(! (s->s3)->tmp.reuse_message) [L1629] skip = 0 VAL [init=1, SSLv3_client_data={1758530013:0}] [L1128] COND TRUE 1 VAL [init=1, SSLv3_client_data={1758530013:0}] [L1130] EXPR s->state [L1130] state = s->state [L1131] EXPR s->state VAL [init=1, SSLv3_client_data={1758530013:0}] [L1131] COND FALSE !(s->state == 12292) [L1134] EXPR s->state VAL [init=1, SSLv3_client_data={1758530013:0}] [L1134] COND FALSE !(s->state == 16384) [L1137] EXPR s->state VAL [init=1, SSLv3_client_data={1758530013:0}] [L1137] COND FALSE !(s->state == 4096) [L1140] EXPR s->state VAL [init=1, SSLv3_client_data={1758530013:0}] [L1140] COND FALSE !(s->state == 20480) [L1143] EXPR s->state VAL [init=1, SSLv3_client_data={1758530013:0}] [L1143] COND FALSE !(s->state == 4099) [L1146] EXPR s->state VAL [init=1, SSLv3_client_data={1758530013:0}] [L1146] COND FALSE !(s->state == 4368) [L1149] EXPR s->state VAL [init=1, SSLv3_client_data={1758530013:0}] [L1149] COND FALSE !(s->state == 4369) [L1152] EXPR s->state VAL [init=1, SSLv3_client_data={1758530013:0}] [L1152] COND FALSE !(s->state == 4384) [L1155] EXPR s->state VAL [init=1, SSLv3_client_data={1758530013:0}] [L1155] COND FALSE !(s->state == 4385) [L1158] EXPR s->state VAL [init=1, SSLv3_client_data={1758530013:0}] [L1158] COND FALSE !(s->state == 4400) [L1161] EXPR s->state VAL [init=1, SSLv3_client_data={1758530013:0}] [L1161] COND FALSE !(s->state == 4401) [L1164] EXPR s->state VAL [init=1, SSLv3_client_data={1758530013:0}] [L1164] COND FALSE !(s->state == 4416) [L1167] EXPR s->state VAL [init=1, SSLv3_client_data={1758530013:0}] [L1167] COND FALSE !(s->state == 4417) [L1170] EXPR s->state VAL [init=1, SSLv3_client_data={1758530013:0}] [L1170] COND TRUE s->state == 4432 [L1378] ret = __VERIFIER_nondet_int() [L1379] COND TRUE blastFlag == 4 VAL [init=1, SSLv3_client_data={1758530013:0}] [L1641] __VERIFIER_error() VAL [init=1, SSLv3_client_data={1758530013:0}] - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 129 locations, 1 error locations. Result: UNSAFE, OverallTime: 31.3s, OverallIterations: 6, TraceHistogramMax: 6, AutomataDifference: 19.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 875 SDtfs, 1650 SDslu, 2097 SDs, 0 SdLazy, 1610 SolverSat, 218 SolverUnsat, 1 SolverUnknown, 0 SolverNotchecked, 17.5s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 784 GetRequests, 756 SyntacticMatches, 3 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=751occurred in iteration=5, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 5 MinimizatonAttempts, 1498 StatesRemovedByMinimization, 3 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.3s SsaConstructionTime, 5.7s SatisfiabilityAnalysisTime, 1.0s InterpolantComputationTime, 505 NumberOfCodeBlocks, 505 NumberOfCodeBlocksAsserted, 6 NumberOfCheckSat, 776 ConstructedInterpolants, 0 QuantifiedInterpolants, 187485 SizeOfPredicates, 21 NumberOfNonLiveVariables, 1068 ConjunctsInSsa, 28 ConjunctsInUnsatCore, 10 InterpolantComputations, 10 PerfectInterpolantSequences, 836/836 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 incorrect! Received shutdown request...