./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/ssh/s3_clnt.blast.04.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_ad572bcb-4a3b-4036-a8f8-4e229599943f/bin/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/run_dir_ad572bcb-4a3b-4036-a8f8-4e229599943f/bin/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_ad572bcb-4a3b-4036-a8f8-4e229599943f/bin/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_ad572bcb-4a3b-4036-a8f8-4e229599943f/bin/uautomizer/config/AutomizerReach.xml -i ../../sv-benchmarks/c/ssh/s3_clnt.blast.04.i.cil-1.c -s /tmp/vcloud-vcloud-master/worker/run_dir_ad572bcb-4a3b-4036-a8f8-4e229599943f/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_ad572bcb-4a3b-4036-a8f8-4e229599943f/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 dbebd8f3a7ff59c46b95280959676a0cf0887b44 ....................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... 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_ad572bcb-4a3b-4036-a8f8-4e229599943f/bin/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/run_dir_ad572bcb-4a3b-4036-a8f8-4e229599943f/bin/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_ad572bcb-4a3b-4036-a8f8-4e229599943f/bin/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_ad572bcb-4a3b-4036-a8f8-4e229599943f/bin/uautomizer/config/AutomizerReach.xml -i ../../sv-benchmarks/c/ssh/s3_clnt.blast.04.i.cil-1.c -s /tmp/vcloud-vcloud-master/worker/run_dir_ad572bcb-4a3b-4036-a8f8-4e229599943f/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_ad572bcb-4a3b-4036-a8f8-4e229599943f/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 dbebd8f3a7ff59c46b95280959676a0cf0887b44 ...................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... 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 06:32:22,577 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-20 06:32:22,578 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-20 06:32:22,591 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-20 06:32:22,592 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-20 06:32:22,593 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-20 06:32:22,595 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-20 06:32:22,603 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-20 06:32:22,607 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-20 06:32:22,611 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-20 06:32:22,612 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-20 06:32:22,614 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-20 06:32:22,614 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-20 06:32:22,616 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-20 06:32:22,617 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-20 06:32:22,618 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-20 06:32:22,619 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-20 06:32:22,620 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-20 06:32:22,622 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-20 06:32:22,626 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-20 06:32:22,630 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-20 06:32:22,632 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-20 06:32:22,635 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-20 06:32:22,635 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-20 06:32:22,638 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-20 06:32:22,639 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-20 06:32:22,639 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-20 06:32:22,640 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-20 06:32:22,641 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-20 06:32:22,642 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-20 06:32:22,642 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-20 06:32:22,643 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-20 06:32:22,643 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-20 06:32:22,644 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-20 06:32:22,645 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-20 06:32:22,645 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-20 06:32:22,646 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-20 06:32:22,646 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-20 06:32:22,646 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-20 06:32:22,647 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-20 06:32:22,648 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-20 06:32:22,649 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_ad572bcb-4a3b-4036-a8f8-4e229599943f/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf [2019-11-20 06:32:22,672 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-20 06:32:22,673 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-20 06:32:22,674 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-20 06:32:22,674 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-20 06:32:22,674 INFO L138 SettingsManager]: * Use SBE=true [2019-11-20 06:32:22,674 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-20 06:32:22,674 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-20 06:32:22,675 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-20 06:32:22,675 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-20 06:32:22,675 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-20 06:32:22,675 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-11-20 06:32:22,675 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-20 06:32:22,676 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-11-20 06:32:22,676 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-20 06:32:22,676 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-20 06:32:22,676 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-20 06:32:22,676 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-11-20 06:32:22,677 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-20 06:32:22,677 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-20 06:32:22,677 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-20 06:32:22,677 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-20 06:32:22,678 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-20 06:32:22,678 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-20 06:32:22,678 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-20 06:32:22,678 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-11-20 06:32:22,679 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-11-20 06:32:22,679 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-11-20 06:32:22,679 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-11-20 06:32:22,679 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_ad572bcb-4a3b-4036-a8f8-4e229599943f/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 -> dbebd8f3a7ff59c46b95280959676a0cf0887b44 [2019-11-20 06:32:22,817 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-20 06:32:22,827 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-20 06:32:22,830 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-20 06:32:22,832 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-20 06:32:22,832 INFO L275 PluginConnector]: CDTParser initialized [2019-11-20 06:32:22,833 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_ad572bcb-4a3b-4036-a8f8-4e229599943f/bin/uautomizer/../../sv-benchmarks/c/ssh/s3_clnt.blast.04.i.cil-1.c [2019-11-20 06:32:22,890 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_ad572bcb-4a3b-4036-a8f8-4e229599943f/bin/uautomizer/data/24ba8a8df/2c4486fcecc344cf9baf9b5f0fb34ad4/FLAG9680af7d8 [2019-11-20 06:32:23,391 INFO L306 CDTParser]: Found 1 translation units. [2019-11-20 06:32:23,404 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_ad572bcb-4a3b-4036-a8f8-4e229599943f/sv-benchmarks/c/ssh/s3_clnt.blast.04.i.cil-1.c [2019-11-20 06:32:23,427 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_ad572bcb-4a3b-4036-a8f8-4e229599943f/bin/uautomizer/data/24ba8a8df/2c4486fcecc344cf9baf9b5f0fb34ad4/FLAG9680af7d8 [2019-11-20 06:32:23,713 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_ad572bcb-4a3b-4036-a8f8-4e229599943f/bin/uautomizer/data/24ba8a8df/2c4486fcecc344cf9baf9b5f0fb34ad4 [2019-11-20 06:32:23,715 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-20 06:32:23,716 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-11-20 06:32:23,717 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-20 06:32:23,717 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-20 06:32:23,721 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-20 06:32:23,722 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.11 06:32:23" (1/1) ... [2019-11-20 06:32:23,724 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@211af8f8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 06:32:23, skipping insertion in model container [2019-11-20 06:32:23,724 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.11 06:32:23" (1/1) ... [2019-11-20 06:32:23,733 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-11-20 06:32:23,796 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-11-20 06:32:24,266 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-20 06:32:24,295 INFO L188 MainTranslator]: Completed pre-run [2019-11-20 06:32:24,411 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-20 06:32:24,441 INFO L192 MainTranslator]: Completed translation [2019-11-20 06:32:24,442 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 06:32:24 WrapperNode [2019-11-20 06:32:24,442 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-20 06:32:24,443 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-11-20 06:32:24,443 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-11-20 06:32:24,444 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-11-20 06:32:24,451 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 06:32:24" (1/1) ... [2019-11-20 06:32:24,487 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 06:32:24" (1/1) ... [2019-11-20 06:32:24,543 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-11-20 06:32:24,548 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-20 06:32:24,548 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-20 06:32:24,548 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-20 06:32:24,557 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 06:32:24" (1/1) ... [2019-11-20 06:32:24,557 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 06:32:24" (1/1) ... [2019-11-20 06:32:24,576 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 06:32:24" (1/1) ... [2019-11-20 06:32:24,581 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 06:32:24" (1/1) ... [2019-11-20 06:32:24,636 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 06:32:24" (1/1) ... [2019-11-20 06:32:24,658 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 06:32:24" (1/1) ... [2019-11-20 06:32:24,662 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 06:32:24" (1/1) ... [2019-11-20 06:32:24,672 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-20 06:32:24,676 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-20 06:32:24,676 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-20 06:32:24,676 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-20 06:32:24,678 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 06:32:24" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_ad572bcb-4a3b-4036-a8f8-4e229599943f/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 06:32:24,750 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2019-11-20 06:32:24,751 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-11-20 06:32:24,751 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-11-20 06:32:24,751 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-11-20 06:32:24,752 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2019-11-20 06:32:24,752 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2019-11-20 06:32:24,752 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-20 06:32:24,753 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-20 06:32:25,078 WARN L736 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-11-20 06:32:26,051 INFO L689 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##85: assume !false; [2019-11-20 06:32:26,051 INFO L689 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##84: assume false; [2019-11-20 06:32:26,052 INFO L280 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-20 06:32:26,052 INFO L285 CfgBuilder]: Removed 7 assume(true) statements. [2019-11-20 06:32:26,053 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 06:32:26 BoogieIcfgContainer [2019-11-20 06:32:26,053 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-20 06:32:26,054 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-20 06:32:26,054 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-20 06:32:26,066 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-20 06:32:26,066 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.11 06:32:23" (1/3) ... [2019-11-20 06:32:26,067 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3bd4076f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.11 06:32:26, skipping insertion in model container [2019-11-20 06:32:26,067 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 06:32:24" (2/3) ... [2019-11-20 06:32:26,068 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3bd4076f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.11 06:32:26, skipping insertion in model container [2019-11-20 06:32:26,068 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 06:32:26" (3/3) ... [2019-11-20 06:32:26,070 INFO L109 eAbstractionObserver]: Analyzing ICFG s3_clnt.blast.04.i.cil-1.c [2019-11-20 06:32:26,084 INFO L153 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-20 06:32:26,089 INFO L165 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-11-20 06:32:26,098 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-11-20 06:32:26,120 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-20 06:32:26,120 INFO L374 AbstractCegarLoop]: Hoare is true [2019-11-20 06:32:26,120 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-20 06:32:26,121 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-20 06:32:26,121 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-20 06:32:26,121 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-20 06:32:26,121 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-20 06:32:26,121 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-20 06:32:26,137 INFO L276 IsEmpty]: Start isEmpty. Operand 129 states. [2019-11-20 06:32:26,143 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2019-11-20 06:32:26,144 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 06:32:26,145 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 06:32:26,145 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 06:32:26,152 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 06:32:26,153 INFO L82 PathProgramCache]: Analyzing trace with hash -1457695037, now seen corresponding path program 1 times [2019-11-20 06:32:26,160 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 06:32:26,160 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2020218474] [2019-11-20 06:32:26,161 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 06:32:26,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 06:32:26,481 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 06:32:26,481 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2020218474] [2019-11-20 06:32:26,482 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 06:32:26,482 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-20 06:32:26,483 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1092162386] [2019-11-20 06:32:26,486 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-20 06:32:26,486 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 06:32:26,495 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-20 06:32:26,496 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-20 06:32:26,497 INFO L87 Difference]: Start difference. First operand 129 states. Second operand 4 states. [2019-11-20 06:32:26,885 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 06:32:26,885 INFO L93 Difference]: Finished difference Result 255 states and 430 transitions. [2019-11-20 06:32:26,886 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-20 06:32:26,887 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 24 [2019-11-20 06:32:26,888 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 06:32:26,902 INFO L225 Difference]: With dead ends: 255 [2019-11-20 06:32:26,902 INFO L226 Difference]: Without dead ends: 116 [2019-11-20 06:32:26,907 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 06:32:26,924 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 116 states. [2019-11-20 06:32:26,956 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 116 to 115. [2019-11-20 06:32:26,959 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 115 states. [2019-11-20 06:32:26,965 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 115 states to 115 states and 172 transitions. [2019-11-20 06:32:26,966 INFO L78 Accepts]: Start accepts. Automaton has 115 states and 172 transitions. Word has length 24 [2019-11-20 06:32:26,967 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 06:32:26,967 INFO L462 AbstractCegarLoop]: Abstraction has 115 states and 172 transitions. [2019-11-20 06:32:26,967 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-20 06:32:26,967 INFO L276 IsEmpty]: Start isEmpty. Operand 115 states and 172 transitions. [2019-11-20 06:32:26,971 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2019-11-20 06:32:26,971 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 06:32:26,972 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 06:32:26,973 INFO L410 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 06:32:26,973 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 06:32:26,973 INFO L82 PathProgramCache]: Analyzing trace with hash 1001988123, now seen corresponding path program 1 times [2019-11-20 06:32:26,973 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 06:32:26,974 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [63822135] [2019-11-20 06:32:26,974 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 06:32:27,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 06:32:27,151 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 06:32:27,154 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [63822135] [2019-11-20 06:32:27,155 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 06:32:27,155 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-20 06:32:27,156 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [405357909] [2019-11-20 06:32:27,157 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-20 06:32:27,159 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 06:32:27,159 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-20 06:32:27,161 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-20 06:32:27,161 INFO L87 Difference]: Start difference. First operand 115 states and 172 transitions. Second operand 3 states. [2019-11-20 06:32:27,236 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 06:32:27,237 INFO L93 Difference]: Finished difference Result 321 states and 484 transitions. [2019-11-20 06:32:27,240 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-20 06:32:27,240 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 38 [2019-11-20 06:32:27,240 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 06:32:27,242 INFO L225 Difference]: With dead ends: 321 [2019-11-20 06:32:27,243 INFO L226 Difference]: Without dead ends: 216 [2019-11-20 06:32:27,244 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 06:32:27,247 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 216 states. [2019-11-20 06:32:27,278 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 216 to 216. [2019-11-20 06:32:27,279 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 216 states. [2019-11-20 06:32:27,282 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 216 states to 216 states and 320 transitions. [2019-11-20 06:32:27,283 INFO L78 Accepts]: Start accepts. Automaton has 216 states and 320 transitions. Word has length 38 [2019-11-20 06:32:27,283 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 06:32:27,284 INFO L462 AbstractCegarLoop]: Abstraction has 216 states and 320 transitions. [2019-11-20 06:32:27,284 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-20 06:32:27,284 INFO L276 IsEmpty]: Start isEmpty. Operand 216 states and 320 transitions. [2019-11-20 06:32:27,288 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2019-11-20 06:32:27,290 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 06:32:27,290 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 06:32:27,291 INFO L410 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 06:32:27,292 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 06:32:27,292 INFO L82 PathProgramCache]: Analyzing trace with hash -596933037, now seen corresponding path program 1 times [2019-11-20 06:32:27,292 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 06:32:27,292 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1938955558] [2019-11-20 06:32:27,294 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 06:32:27,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 06:32:27,429 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 06:32:27,429 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1938955558] [2019-11-20 06:32:27,430 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 06:32:27,430 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-20 06:32:27,430 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2100750449] [2019-11-20 06:32:27,432 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-20 06:32:27,434 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 06:32:27,435 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-20 06:32:27,435 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-20 06:32:27,436 INFO L87 Difference]: Start difference. First operand 216 states and 320 transitions. Second operand 3 states. [2019-11-20 06:32:27,526 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 06:32:27,526 INFO L93 Difference]: Finished difference Result 421 states and 631 transitions. [2019-11-20 06:32:27,527 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-20 06:32:27,528 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 53 [2019-11-20 06:32:27,528 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 06:32:27,531 INFO L225 Difference]: With dead ends: 421 [2019-11-20 06:32:27,531 INFO L226 Difference]: Without dead ends: 316 [2019-11-20 06:32:27,533 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 06:32:27,534 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 316 states. [2019-11-20 06:32:27,550 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 316 to 316. [2019-11-20 06:32:27,550 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 316 states. [2019-11-20 06:32:27,553 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 316 states to 316 states and 467 transitions. [2019-11-20 06:32:27,554 INFO L78 Accepts]: Start accepts. Automaton has 316 states and 467 transitions. Word has length 53 [2019-11-20 06:32:27,554 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 06:32:27,554 INFO L462 AbstractCegarLoop]: Abstraction has 316 states and 467 transitions. [2019-11-20 06:32:27,554 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-20 06:32:27,555 INFO L276 IsEmpty]: Start isEmpty. Operand 316 states and 467 transitions. [2019-11-20 06:32:27,559 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2019-11-20 06:32:27,563 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 06:32:27,564 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 06:32:27,564 INFO L410 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 06:32:27,565 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 06:32:27,565 INFO L82 PathProgramCache]: Analyzing trace with hash -971278195, now seen corresponding path program 1 times [2019-11-20 06:32:27,565 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 06:32:27,566 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1462422307] [2019-11-20 06:32:27,566 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 06:32:27,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 06:32:27,737 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 06:32:27,737 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1462422307] [2019-11-20 06:32:27,738 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 06:32:27,738 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-20 06:32:27,739 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1180911381] [2019-11-20 06:32:27,740 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-20 06:32:27,740 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 06:32:27,740 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-20 06:32:27,740 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-20 06:32:27,741 INFO L87 Difference]: Start difference. First operand 316 states and 467 transitions. Second operand 4 states. [2019-11-20 06:32:28,353 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 06:32:28,354 INFO L93 Difference]: Finished difference Result 808 states and 1199 transitions. [2019-11-20 06:32:28,357 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-20 06:32:28,357 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 71 [2019-11-20 06:32:28,358 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 06:32:28,363 INFO L225 Difference]: With dead ends: 808 [2019-11-20 06:32:28,363 INFO L226 Difference]: Without dead ends: 502 [2019-11-20 06:32:28,365 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 06:32:28,370 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 502 states. [2019-11-20 06:32:28,394 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 502 to 366. [2019-11-20 06:32:28,402 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 366 states. [2019-11-20 06:32:28,404 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 366 states to 366 states and 553 transitions. [2019-11-20 06:32:28,404 INFO L78 Accepts]: Start accepts. Automaton has 366 states and 553 transitions. Word has length 71 [2019-11-20 06:32:28,405 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 06:32:28,405 INFO L462 AbstractCegarLoop]: Abstraction has 366 states and 553 transitions. [2019-11-20 06:32:28,405 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-20 06:32:28,406 INFO L276 IsEmpty]: Start isEmpty. Operand 366 states and 553 transitions. [2019-11-20 06:32:28,408 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2019-11-20 06:32:28,410 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 06:32:28,411 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 06:32:28,411 INFO L410 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 06:32:28,411 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 06:32:28,411 INFO L82 PathProgramCache]: Analyzing trace with hash -1105291701, now seen corresponding path program 1 times [2019-11-20 06:32:28,412 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 06:32:28,412 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [375251183] [2019-11-20 06:32:28,412 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 06:32:28,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 06:32:28,523 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 06:32:28,524 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [375251183] [2019-11-20 06:32:28,524 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 06:32:28,525 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-20 06:32:28,525 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1955785894] [2019-11-20 06:32:28,527 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-20 06:32:28,527 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 06:32:28,527 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-20 06:32:28,529 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-20 06:32:28,529 INFO L87 Difference]: Start difference. First operand 366 states and 553 transitions. Second operand 4 states. [2019-11-20 06:32:28,915 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 06:32:28,916 INFO L93 Difference]: Finished difference Result 808 states and 1220 transitions. [2019-11-20 06:32:28,917 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-20 06:32:28,917 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 71 [2019-11-20 06:32:28,919 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 06:32:28,923 INFO L225 Difference]: With dead ends: 808 [2019-11-20 06:32:28,923 INFO L226 Difference]: Without dead ends: 452 [2019-11-20 06:32:28,924 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 06:32:28,925 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 452 states. [2019-11-20 06:32:28,940 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 452 to 406. [2019-11-20 06:32:28,940 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 406 states. [2019-11-20 06:32:28,942 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 406 states to 406 states and 621 transitions. [2019-11-20 06:32:28,943 INFO L78 Accepts]: Start accepts. Automaton has 406 states and 621 transitions. Word has length 71 [2019-11-20 06:32:28,943 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 06:32:28,943 INFO L462 AbstractCegarLoop]: Abstraction has 406 states and 621 transitions. [2019-11-20 06:32:28,943 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-20 06:32:28,943 INFO L276 IsEmpty]: Start isEmpty. Operand 406 states and 621 transitions. [2019-11-20 06:32:28,945 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2019-11-20 06:32:28,945 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 06:32:28,945 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 06:32:28,946 INFO L410 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 06:32:28,946 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 06:32:28,946 INFO L82 PathProgramCache]: Analyzing trace with hash -49538802, now seen corresponding path program 1 times [2019-11-20 06:32:28,946 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 06:32:28,947 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1110950752] [2019-11-20 06:32:28,947 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 06:32:28,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 06:32:29,044 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 06:32:29,044 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1110950752] [2019-11-20 06:32:29,044 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 06:32:29,045 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-20 06:32:29,045 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1718505746] [2019-11-20 06:32:29,045 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-20 06:32:29,045 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 06:32:29,046 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-20 06:32:29,046 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-20 06:32:29,047 INFO L87 Difference]: Start difference. First operand 406 states and 621 transitions. Second operand 4 states. [2019-11-20 06:32:29,541 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 06:32:29,541 INFO L93 Difference]: Finished difference Result 930 states and 1411 transitions. [2019-11-20 06:32:29,542 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-20 06:32:29,542 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 72 [2019-11-20 06:32:29,543 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 06:32:29,547 INFO L225 Difference]: With dead ends: 930 [2019-11-20 06:32:29,547 INFO L226 Difference]: Without dead ends: 534 [2019-11-20 06:32:29,548 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 06:32:29,549 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 534 states. [2019-11-20 06:32:29,561 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 534 to 408. [2019-11-20 06:32:29,561 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 408 states. [2019-11-20 06:32:29,565 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 408 states to 408 states and 623 transitions. [2019-11-20 06:32:29,569 INFO L78 Accepts]: Start accepts. Automaton has 408 states and 623 transitions. Word has length 72 [2019-11-20 06:32:29,569 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 06:32:29,570 INFO L462 AbstractCegarLoop]: Abstraction has 408 states and 623 transitions. [2019-11-20 06:32:29,570 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-20 06:32:29,570 INFO L276 IsEmpty]: Start isEmpty. Operand 408 states and 623 transitions. [2019-11-20 06:32:29,572 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2019-11-20 06:32:29,572 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 06:32:29,573 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 06:32:29,573 INFO L410 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 06:32:29,573 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 06:32:29,573 INFO L82 PathProgramCache]: Analyzing trace with hash -200583067, now seen corresponding path program 2 times [2019-11-20 06:32:29,574 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 06:32:29,574 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [917473639] [2019-11-20 06:32:29,581 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 06:32:29,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 06:32:29,699 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 06:32:29,703 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [917473639] [2019-11-20 06:32:29,703 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 06:32:29,704 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-20 06:32:29,704 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [388124336] [2019-11-20 06:32:29,705 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-20 06:32:29,705 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 06:32:29,705 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-20 06:32:29,705 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-20 06:32:29,705 INFO L87 Difference]: Start difference. First operand 408 states and 623 transitions. Second operand 4 states. [2019-11-20 06:32:30,181 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 06:32:30,182 INFO L93 Difference]: Finished difference Result 930 states and 1409 transitions. [2019-11-20 06:32:30,182 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-20 06:32:30,182 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 85 [2019-11-20 06:32:30,183 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 06:32:30,186 INFO L225 Difference]: With dead ends: 930 [2019-11-20 06:32:30,186 INFO L226 Difference]: Without dead ends: 532 [2019-11-20 06:32:30,187 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 06:32:30,188 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 532 states. [2019-11-20 06:32:30,201 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 532 to 408. [2019-11-20 06:32:30,202 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 408 states. [2019-11-20 06:32:30,206 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 408 states to 408 states and 621 transitions. [2019-11-20 06:32:30,206 INFO L78 Accepts]: Start accepts. Automaton has 408 states and 621 transitions. Word has length 85 [2019-11-20 06:32:30,207 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 06:32:30,207 INFO L462 AbstractCegarLoop]: Abstraction has 408 states and 621 transitions. [2019-11-20 06:32:30,207 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-20 06:32:30,207 INFO L276 IsEmpty]: Start isEmpty. Operand 408 states and 621 transitions. [2019-11-20 06:32:30,209 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2019-11-20 06:32:30,209 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 06:32:30,209 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 06:32:30,209 INFO L410 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 06:32:30,209 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 06:32:30,210 INFO L82 PathProgramCache]: Analyzing trace with hash -1309563513, now seen corresponding path program 1 times [2019-11-20 06:32:30,210 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 06:32:30,210 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [984312059] [2019-11-20 06:32:30,210 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 06:32:30,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 06:32:30,314 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 06:32:30,315 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [984312059] [2019-11-20 06:32:30,315 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 06:32:30,315 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-20 06:32:30,315 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1356787640] [2019-11-20 06:32:30,316 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-20 06:32:30,316 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 06:32:30,316 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-20 06:32:30,317 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-20 06:32:30,317 INFO L87 Difference]: Start difference. First operand 408 states and 621 transitions. Second operand 4 states. [2019-11-20 06:32:30,798 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 06:32:30,799 INFO L93 Difference]: Finished difference Result 930 states and 1405 transitions. [2019-11-20 06:32:30,799 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-20 06:32:30,799 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 85 [2019-11-20 06:32:30,800 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 06:32:30,803 INFO L225 Difference]: With dead ends: 930 [2019-11-20 06:32:30,803 INFO L226 Difference]: Without dead ends: 532 [2019-11-20 06:32:30,804 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 06:32:30,805 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 532 states. [2019-11-20 06:32:30,814 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 532 to 408. [2019-11-20 06:32:30,815 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 408 states. [2019-11-20 06:32:30,816 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 408 states to 408 states and 619 transitions. [2019-11-20 06:32:30,817 INFO L78 Accepts]: Start accepts. Automaton has 408 states and 619 transitions. Word has length 85 [2019-11-20 06:32:30,817 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 06:32:30,817 INFO L462 AbstractCegarLoop]: Abstraction has 408 states and 619 transitions. [2019-11-20 06:32:30,817 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-20 06:32:30,817 INFO L276 IsEmpty]: Start isEmpty. Operand 408 states and 619 transitions. [2019-11-20 06:32:30,819 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2019-11-20 06:32:30,819 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 06:32:30,819 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 06:32:30,819 INFO L410 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 06:32:30,820 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 06:32:30,820 INFO L82 PathProgramCache]: Analyzing trace with hash -1229942365, now seen corresponding path program 2 times [2019-11-20 06:32:30,820 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 06:32:30,820 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1785637456] [2019-11-20 06:32:30,820 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 06:32:30,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 06:32:30,883 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 06:32:30,884 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1785637456] [2019-11-20 06:32:30,884 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 06:32:30,884 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-20 06:32:30,884 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2027140231] [2019-11-20 06:32:30,885 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-20 06:32:30,885 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 06:32:30,885 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-20 06:32:30,885 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-20 06:32:30,886 INFO L87 Difference]: Start difference. First operand 408 states and 619 transitions. Second operand 4 states. [2019-11-20 06:32:31,219 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 06:32:31,219 INFO L93 Difference]: Finished difference Result 850 states and 1280 transitions. [2019-11-20 06:32:31,220 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-20 06:32:31,220 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 85 [2019-11-20 06:32:31,221 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 06:32:31,223 INFO L225 Difference]: With dead ends: 850 [2019-11-20 06:32:31,223 INFO L226 Difference]: Without dead ends: 452 [2019-11-20 06:32:31,224 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 06:32:31,225 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 452 states. [2019-11-20 06:32:31,240 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 452 to 408. [2019-11-20 06:32:31,241 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 408 states. [2019-11-20 06:32:31,242 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 408 states to 408 states and 617 transitions. [2019-11-20 06:32:31,243 INFO L78 Accepts]: Start accepts. Automaton has 408 states and 617 transitions. Word has length 85 [2019-11-20 06:32:31,243 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 06:32:31,243 INFO L462 AbstractCegarLoop]: Abstraction has 408 states and 617 transitions. [2019-11-20 06:32:31,243 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-20 06:32:31,243 INFO L276 IsEmpty]: Start isEmpty. Operand 408 states and 617 transitions. [2019-11-20 06:32:31,245 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2019-11-20 06:32:31,247 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 06:32:31,247 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 06:32:31,247 INFO L410 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 06:32:31,248 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 06:32:31,248 INFO L82 PathProgramCache]: Analyzing trace with hash 1956044485, now seen corresponding path program 1 times [2019-11-20 06:32:31,248 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 06:32:31,248 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [314560392] [2019-11-20 06:32:31,248 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 06:32:31,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 06:32:31,323 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 06:32:31,324 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [314560392] [2019-11-20 06:32:31,324 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 06:32:31,324 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-20 06:32:31,324 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [85965189] [2019-11-20 06:32:31,325 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-20 06:32:31,325 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 06:32:31,325 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-20 06:32:31,326 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-20 06:32:31,327 INFO L87 Difference]: Start difference. First operand 408 states and 617 transitions. Second operand 4 states. [2019-11-20 06:32:31,716 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 06:32:31,716 INFO L93 Difference]: Finished difference Result 850 states and 1276 transitions. [2019-11-20 06:32:31,717 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-20 06:32:31,717 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 85 [2019-11-20 06:32:31,717 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 06:32:31,719 INFO L225 Difference]: With dead ends: 850 [2019-11-20 06:32:31,720 INFO L226 Difference]: Without dead ends: 452 [2019-11-20 06:32:31,721 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 06:32:31,721 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 452 states. [2019-11-20 06:32:31,731 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 452 to 408. [2019-11-20 06:32:31,731 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 408 states. [2019-11-20 06:32:31,733 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 408 states to 408 states and 615 transitions. [2019-11-20 06:32:31,733 INFO L78 Accepts]: Start accepts. Automaton has 408 states and 615 transitions. Word has length 85 [2019-11-20 06:32:31,734 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 06:32:31,734 INFO L462 AbstractCegarLoop]: Abstraction has 408 states and 615 transitions. [2019-11-20 06:32:31,734 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-20 06:32:31,734 INFO L276 IsEmpty]: Start isEmpty. Operand 408 states and 615 transitions. [2019-11-20 06:32:31,735 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2019-11-20 06:32:31,736 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 06:32:31,736 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 06:32:31,736 INFO L410 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 06:32:31,736 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 06:32:31,737 INFO L82 PathProgramCache]: Analyzing trace with hash -1887370232, now seen corresponding path program 1 times [2019-11-20 06:32:31,737 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 06:32:31,737 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2018830561] [2019-11-20 06:32:31,737 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 06:32:31,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 06:32:31,798 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 06:32:31,799 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2018830561] [2019-11-20 06:32:31,799 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 06:32:31,799 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-20 06:32:31,799 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [987344514] [2019-11-20 06:32:31,800 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-20 06:32:31,800 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 06:32:31,800 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-20 06:32:31,801 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-20 06:32:31,801 INFO L87 Difference]: Start difference. First operand 408 states and 615 transitions. Second operand 4 states. [2019-11-20 06:32:32,281 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 06:32:32,281 INFO L93 Difference]: Finished difference Result 930 states and 1393 transitions. [2019-11-20 06:32:32,282 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-20 06:32:32,282 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 86 [2019-11-20 06:32:32,283 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 06:32:32,286 INFO L225 Difference]: With dead ends: 930 [2019-11-20 06:32:32,286 INFO L226 Difference]: Without dead ends: 532 [2019-11-20 06:32:32,291 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 06:32:32,292 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 532 states. [2019-11-20 06:32:32,302 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 532 to 408. [2019-11-20 06:32:32,302 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 408 states. [2019-11-20 06:32:32,304 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 408 states to 408 states and 613 transitions. [2019-11-20 06:32:32,305 INFO L78 Accepts]: Start accepts. Automaton has 408 states and 613 transitions. Word has length 86 [2019-11-20 06:32:32,305 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 06:32:32,305 INFO L462 AbstractCegarLoop]: Abstraction has 408 states and 613 transitions. [2019-11-20 06:32:32,305 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-20 06:32:32,305 INFO L276 IsEmpty]: Start isEmpty. Operand 408 states and 613 transitions. [2019-11-20 06:32:32,307 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2019-11-20 06:32:32,307 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 06:32:32,307 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 06:32:32,307 INFO L410 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 06:32:32,307 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 06:32:32,308 INFO L82 PathProgramCache]: Analyzing trace with hash -1587309149, now seen corresponding path program 1 times [2019-11-20 06:32:32,308 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 06:32:32,308 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1643611550] [2019-11-20 06:32:32,308 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 06:32:32,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 06:32:32,376 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 06:32:32,376 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1643611550] [2019-11-20 06:32:32,377 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 06:32:32,377 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-20 06:32:32,377 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [124628790] [2019-11-20 06:32:32,377 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-20 06:32:32,378 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 06:32:32,378 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-20 06:32:32,378 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-20 06:32:32,378 INFO L87 Difference]: Start difference. First operand 408 states and 613 transitions. Second operand 4 states. [2019-11-20 06:32:32,904 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 06:32:32,904 INFO L93 Difference]: Finished difference Result 785 states and 1170 transitions. [2019-11-20 06:32:32,905 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-20 06:32:32,905 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 86 [2019-11-20 06:32:32,905 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 06:32:32,908 INFO L225 Difference]: With dead ends: 785 [2019-11-20 06:32:32,908 INFO L226 Difference]: Without dead ends: 532 [2019-11-20 06:32:32,909 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 06:32:32,910 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 532 states. [2019-11-20 06:32:32,921 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 532 to 408. [2019-11-20 06:32:32,921 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 408 states. [2019-11-20 06:32:32,923 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 408 states to 408 states and 611 transitions. [2019-11-20 06:32:32,923 INFO L78 Accepts]: Start accepts. Automaton has 408 states and 611 transitions. Word has length 86 [2019-11-20 06:32:32,923 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 06:32:32,923 INFO L462 AbstractCegarLoop]: Abstraction has 408 states and 611 transitions. [2019-11-20 06:32:32,923 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-20 06:32:32,924 INFO L276 IsEmpty]: Start isEmpty. Operand 408 states and 611 transitions. [2019-11-20 06:32:32,925 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2019-11-20 06:32:32,925 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 06:32:32,925 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 06:32:32,926 INFO L410 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 06:32:32,926 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 06:32:32,926 INFO L82 PathProgramCache]: Analyzing trace with hash 562229898, now seen corresponding path program 1 times [2019-11-20 06:32:32,926 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 06:32:32,926 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [679381503] [2019-11-20 06:32:32,927 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 06:32:32,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 06:32:32,986 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 06:32:32,987 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [679381503] [2019-11-20 06:32:32,987 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 06:32:32,987 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-20 06:32:32,987 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [380817848] [2019-11-20 06:32:32,988 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-20 06:32:32,988 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 06:32:32,988 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-20 06:32:32,988 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-20 06:32:32,988 INFO L87 Difference]: Start difference. First operand 408 states and 611 transitions. Second operand 4 states. [2019-11-20 06:32:33,392 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 06:32:33,392 INFO L93 Difference]: Finished difference Result 850 states and 1264 transitions. [2019-11-20 06:32:33,393 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-20 06:32:33,393 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 86 [2019-11-20 06:32:33,393 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 06:32:33,395 INFO L225 Difference]: With dead ends: 850 [2019-11-20 06:32:33,395 INFO L226 Difference]: Without dead ends: 452 [2019-11-20 06:32:33,396 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 06:32:33,397 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 452 states. [2019-11-20 06:32:33,407 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 452 to 408. [2019-11-20 06:32:33,407 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 408 states. [2019-11-20 06:32:33,409 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 408 states to 408 states and 609 transitions. [2019-11-20 06:32:33,409 INFO L78 Accepts]: Start accepts. Automaton has 408 states and 609 transitions. Word has length 86 [2019-11-20 06:32:33,409 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 06:32:33,409 INFO L462 AbstractCegarLoop]: Abstraction has 408 states and 609 transitions. [2019-11-20 06:32:33,410 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-20 06:32:33,410 INFO L276 IsEmpty]: Start isEmpty. Operand 408 states and 609 transitions. [2019-11-20 06:32:33,411 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2019-11-20 06:32:33,411 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 06:32:33,411 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 06:32:33,412 INFO L410 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 06:32:33,412 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 06:32:33,412 INFO L82 PathProgramCache]: Analyzing trace with hash 862290981, now seen corresponding path program 1 times [2019-11-20 06:32:33,412 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 06:32:33,412 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1494536681] [2019-11-20 06:32:33,413 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 06:32:33,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 06:32:33,469 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 06:32:33,469 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1494536681] [2019-11-20 06:32:33,469 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 06:32:33,470 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-20 06:32:33,470 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [697485883] [2019-11-20 06:32:33,470 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-20 06:32:33,470 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 06:32:33,471 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-20 06:32:33,471 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-20 06:32:33,471 INFO L87 Difference]: Start difference. First operand 408 states and 609 transitions. Second operand 4 states. [2019-11-20 06:32:33,822 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 06:32:33,822 INFO L93 Difference]: Finished difference Result 705 states and 1043 transitions. [2019-11-20 06:32:33,822 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-20 06:32:33,822 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 86 [2019-11-20 06:32:33,823 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 06:32:33,825 INFO L225 Difference]: With dead ends: 705 [2019-11-20 06:32:33,825 INFO L226 Difference]: Without dead ends: 452 [2019-11-20 06:32:33,826 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 06:32:33,827 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 452 states. [2019-11-20 06:32:33,838 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 452 to 408. [2019-11-20 06:32:33,838 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 408 states. [2019-11-20 06:32:33,840 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 408 states to 408 states and 607 transitions. [2019-11-20 06:32:33,840 INFO L78 Accepts]: Start accepts. Automaton has 408 states and 607 transitions. Word has length 86 [2019-11-20 06:32:33,840 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 06:32:33,841 INFO L462 AbstractCegarLoop]: Abstraction has 408 states and 607 transitions. [2019-11-20 06:32:33,841 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-20 06:32:33,841 INFO L276 IsEmpty]: Start isEmpty. Operand 408 states and 607 transitions. [2019-11-20 06:32:33,842 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2019-11-20 06:32:33,842 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 06:32:33,843 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 06:32:33,843 INFO L410 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 06:32:33,843 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 06:32:33,843 INFO L82 PathProgramCache]: Analyzing trace with hash 1732038594, now seen corresponding path program 1 times [2019-11-20 06:32:33,843 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 06:32:33,844 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1121694553] [2019-11-20 06:32:33,844 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 06:32:33,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 06:32:33,921 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 06:32:33,921 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1121694553] [2019-11-20 06:32:33,921 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 06:32:33,921 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-20 06:32:33,922 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1591549996] [2019-11-20 06:32:33,922 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-20 06:32:33,922 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 06:32:33,922 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-20 06:32:33,923 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-20 06:32:33,923 INFO L87 Difference]: Start difference. First operand 408 states and 607 transitions. Second operand 4 states. [2019-11-20 06:32:34,385 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 06:32:34,385 INFO L93 Difference]: Finished difference Result 930 states and 1377 transitions. [2019-11-20 06:32:34,386 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-20 06:32:34,386 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 87 [2019-11-20 06:32:34,387 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 06:32:34,389 INFO L225 Difference]: With dead ends: 930 [2019-11-20 06:32:34,390 INFO L226 Difference]: Without dead ends: 532 [2019-11-20 06:32:34,393 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 06:32:34,394 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 532 states. [2019-11-20 06:32:34,404 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 532 to 408. [2019-11-20 06:32:34,404 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 408 states. [2019-11-20 06:32:34,410 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 408 states to 408 states and 605 transitions. [2019-11-20 06:32:34,410 INFO L78 Accepts]: Start accepts. Automaton has 408 states and 605 transitions. Word has length 87 [2019-11-20 06:32:34,411 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 06:32:34,411 INFO L462 AbstractCegarLoop]: Abstraction has 408 states and 605 transitions. [2019-11-20 06:32:34,411 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-20 06:32:34,411 INFO L276 IsEmpty]: Start isEmpty. Operand 408 states and 605 transitions. [2019-11-20 06:32:34,412 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2019-11-20 06:32:34,412 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 06:32:34,413 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 06:32:34,413 INFO L410 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 06:32:34,413 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 06:32:34,413 INFO L82 PathProgramCache]: Analyzing trace with hash 442060930, now seen corresponding path program 1 times [2019-11-20 06:32:34,414 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 06:32:34,414 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [237248923] [2019-11-20 06:32:34,414 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 06:32:34,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 06:32:34,483 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 06:32:34,483 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [237248923] [2019-11-20 06:32:34,485 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 06:32:34,485 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-20 06:32:34,487 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1762927728] [2019-11-20 06:32:34,488 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-20 06:32:34,488 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 06:32:34,488 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-20 06:32:34,489 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-20 06:32:34,489 INFO L87 Difference]: Start difference. First operand 408 states and 605 transitions. Second operand 4 states. [2019-11-20 06:32:34,929 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 06:32:34,929 INFO L93 Difference]: Finished difference Result 779 states and 1151 transitions. [2019-11-20 06:32:34,929 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-20 06:32:34,929 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 87 [2019-11-20 06:32:34,930 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 06:32:34,932 INFO L225 Difference]: With dead ends: 779 [2019-11-20 06:32:34,933 INFO L226 Difference]: Without dead ends: 526 [2019-11-20 06:32:34,933 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 06:32:34,934 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 526 states. [2019-11-20 06:32:34,945 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 526 to 408. [2019-11-20 06:32:34,945 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 408 states. [2019-11-20 06:32:34,946 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 408 states to 408 states and 603 transitions. [2019-11-20 06:32:34,947 INFO L78 Accepts]: Start accepts. Automaton has 408 states and 603 transitions. Word has length 87 [2019-11-20 06:32:34,947 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 06:32:34,947 INFO L462 AbstractCegarLoop]: Abstraction has 408 states and 603 transitions. [2019-11-20 06:32:34,947 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-20 06:32:34,947 INFO L276 IsEmpty]: Start isEmpty. Operand 408 states and 603 transitions. [2019-11-20 06:32:34,949 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2019-11-20 06:32:34,949 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 06:32:34,949 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 06:32:34,949 INFO L410 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 06:32:34,950 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 06:32:34,950 INFO L82 PathProgramCache]: Analyzing trace with hash 360231296, now seen corresponding path program 1 times [2019-11-20 06:32:34,950 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 06:32:34,950 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1678414339] [2019-11-20 06:32:34,950 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 06:32:34,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 06:32:35,023 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 06:32:35,023 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1678414339] [2019-11-20 06:32:35,024 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 06:32:35,049 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-20 06:32:35,049 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [82785673] [2019-11-20 06:32:35,050 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-20 06:32:35,050 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 06:32:35,050 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-20 06:32:35,050 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-20 06:32:35,050 INFO L87 Difference]: Start difference. First operand 408 states and 603 transitions. Second operand 4 states. [2019-11-20 06:32:35,406 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 06:32:35,406 INFO L93 Difference]: Finished difference Result 850 states and 1248 transitions. [2019-11-20 06:32:35,407 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-20 06:32:35,407 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 87 [2019-11-20 06:32:35,407 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 06:32:35,409 INFO L225 Difference]: With dead ends: 850 [2019-11-20 06:32:35,409 INFO L226 Difference]: Without dead ends: 452 [2019-11-20 06:32:35,410 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 06:32:35,411 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 452 states. [2019-11-20 06:32:35,421 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 452 to 408. [2019-11-20 06:32:35,421 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 408 states. [2019-11-20 06:32:35,423 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 408 states to 408 states and 601 transitions. [2019-11-20 06:32:35,423 INFO L78 Accepts]: Start accepts. Automaton has 408 states and 601 transitions. Word has length 87 [2019-11-20 06:32:35,423 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 06:32:35,423 INFO L462 AbstractCegarLoop]: Abstraction has 408 states and 601 transitions. [2019-11-20 06:32:35,424 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-20 06:32:35,424 INFO L276 IsEmpty]: Start isEmpty. Operand 408 states and 601 transitions. [2019-11-20 06:32:35,425 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2019-11-20 06:32:35,425 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 06:32:35,425 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 06:32:35,426 INFO L410 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 06:32:35,426 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 06:32:35,426 INFO L82 PathProgramCache]: Analyzing trace with hash -929746368, now seen corresponding path program 1 times [2019-11-20 06:32:35,426 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 06:32:35,426 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [485275581] [2019-11-20 06:32:35,427 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 06:32:35,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 06:32:35,487 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 06:32:35,488 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [485275581] [2019-11-20 06:32:35,488 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 06:32:35,488 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-20 06:32:35,488 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1045126213] [2019-11-20 06:32:35,489 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-20 06:32:35,489 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 06:32:35,489 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-20 06:32:35,489 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-20 06:32:35,489 INFO L87 Difference]: Start difference. First operand 408 states and 601 transitions. Second operand 4 states. [2019-11-20 06:32:35,820 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 06:32:35,820 INFO L93 Difference]: Finished difference Result 699 states and 1024 transitions. [2019-11-20 06:32:35,820 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-20 06:32:35,821 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 87 [2019-11-20 06:32:35,821 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 06:32:35,823 INFO L225 Difference]: With dead ends: 699 [2019-11-20 06:32:35,823 INFO L226 Difference]: Without dead ends: 446 [2019-11-20 06:32:35,824 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 06:32:35,825 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 446 states. [2019-11-20 06:32:35,836 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 446 to 408. [2019-11-20 06:32:35,836 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 408 states. [2019-11-20 06:32:35,838 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 408 states to 408 states and 599 transitions. [2019-11-20 06:32:35,838 INFO L78 Accepts]: Start accepts. Automaton has 408 states and 599 transitions. Word has length 87 [2019-11-20 06:32:35,838 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 06:32:35,838 INFO L462 AbstractCegarLoop]: Abstraction has 408 states and 599 transitions. [2019-11-20 06:32:35,838 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-20 06:32:35,839 INFO L276 IsEmpty]: Start isEmpty. Operand 408 states and 599 transitions. [2019-11-20 06:32:35,840 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2019-11-20 06:32:35,840 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 06:32:35,840 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 06:32:35,840 INFO L410 AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 06:32:35,841 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 06:32:35,841 INFO L82 PathProgramCache]: Analyzing trace with hash -1973824157, now seen corresponding path program 1 times [2019-11-20 06:32:35,841 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 06:32:35,841 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1858468968] [2019-11-20 06:32:35,841 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 06:32:35,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 06:32:35,898 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 06:32:35,899 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1858468968] [2019-11-20 06:32:35,899 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 06:32:35,899 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-20 06:32:35,899 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1230553338] [2019-11-20 06:32:35,900 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-20 06:32:35,901 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 06:32:35,901 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-20 06:32:35,901 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-20 06:32:35,902 INFO L87 Difference]: Start difference. First operand 408 states and 599 transitions. Second operand 4 states. [2019-11-20 06:32:36,332 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 06:32:36,332 INFO L93 Difference]: Finished difference Result 906 states and 1332 transitions. [2019-11-20 06:32:36,333 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-20 06:32:36,333 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 88 [2019-11-20 06:32:36,333 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 06:32:36,336 INFO L225 Difference]: With dead ends: 906 [2019-11-20 06:32:36,337 INFO L226 Difference]: Without dead ends: 508 [2019-11-20 06:32:36,338 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 06:32:36,339 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 508 states. [2019-11-20 06:32:36,349 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 508 to 408. [2019-11-20 06:32:36,349 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 408 states. [2019-11-20 06:32:36,351 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 408 states to 408 states and 597 transitions. [2019-11-20 06:32:36,351 INFO L78 Accepts]: Start accepts. Automaton has 408 states and 597 transitions. Word has length 88 [2019-11-20 06:32:36,351 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 06:32:36,351 INFO L462 AbstractCegarLoop]: Abstraction has 408 states and 597 transitions. [2019-11-20 06:32:36,351 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-20 06:32:36,352 INFO L276 IsEmpty]: Start isEmpty. Operand 408 states and 597 transitions. [2019-11-20 06:32:36,353 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2019-11-20 06:32:36,353 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 06:32:36,353 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 06:32:36,354 INFO L410 AbstractCegarLoop]: === Iteration 20 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 06:32:36,354 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 06:32:36,354 INFO L82 PathProgramCache]: Analyzing trace with hash -1550177435, now seen corresponding path program 1 times [2019-11-20 06:32:36,354 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 06:32:36,354 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [332348956] [2019-11-20 06:32:36,354 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 06:32:36,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 06:32:36,424 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 06:32:36,424 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [332348956] [2019-11-20 06:32:36,425 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 06:32:36,425 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-20 06:32:36,425 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [406854591] [2019-11-20 06:32:36,426 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-20 06:32:36,426 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 06:32:36,426 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-20 06:32:36,426 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-20 06:32:36,426 INFO L87 Difference]: Start difference. First operand 408 states and 597 transitions. Second operand 4 states. [2019-11-20 06:32:36,719 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 06:32:36,720 INFO L93 Difference]: Finished difference Result 826 states and 1207 transitions. [2019-11-20 06:32:36,720 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-20 06:32:36,720 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 88 [2019-11-20 06:32:36,720 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 06:32:36,723 INFO L225 Difference]: With dead ends: 826 [2019-11-20 06:32:36,723 INFO L226 Difference]: Without dead ends: 428 [2019-11-20 06:32:36,724 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 06:32:36,725 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 428 states. [2019-11-20 06:32:36,734 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 428 to 408. [2019-11-20 06:32:36,734 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 408 states. [2019-11-20 06:32:36,736 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 408 states to 408 states and 595 transitions. [2019-11-20 06:32:36,736 INFO L78 Accepts]: Start accepts. Automaton has 408 states and 595 transitions. Word has length 88 [2019-11-20 06:32:36,736 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 06:32:36,736 INFO L462 AbstractCegarLoop]: Abstraction has 408 states and 595 transitions. [2019-11-20 06:32:36,736 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-20 06:32:36,737 INFO L276 IsEmpty]: Start isEmpty. Operand 408 states and 595 transitions. [2019-11-20 06:32:36,738 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2019-11-20 06:32:36,738 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 06:32:36,738 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 06:32:36,738 INFO L410 AbstractCegarLoop]: === Iteration 21 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 06:32:36,739 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 06:32:36,739 INFO L82 PathProgramCache]: Analyzing trace with hash 114296894, now seen corresponding path program 1 times [2019-11-20 06:32:36,739 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 06:32:36,739 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1381402547] [2019-11-20 06:32:36,739 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 06:32:36,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 06:32:36,802 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 06:32:36,802 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1381402547] [2019-11-20 06:32:36,803 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 06:32:36,803 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-20 06:32:36,803 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [424191157] [2019-11-20 06:32:36,803 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-20 06:32:36,804 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 06:32:36,804 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-20 06:32:36,806 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-20 06:32:36,806 INFO L87 Difference]: Start difference. First operand 408 states and 595 transitions. Second operand 4 states. [2019-11-20 06:32:37,228 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 06:32:37,228 INFO L93 Difference]: Finished difference Result 906 states and 1324 transitions. [2019-11-20 06:32:37,229 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-20 06:32:37,229 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 89 [2019-11-20 06:32:37,229 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 06:32:37,232 INFO L225 Difference]: With dead ends: 906 [2019-11-20 06:32:37,232 INFO L226 Difference]: Without dead ends: 508 [2019-11-20 06:32:37,235 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 06:32:37,236 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 508 states. [2019-11-20 06:32:37,245 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 508 to 408. [2019-11-20 06:32:37,246 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 408 states. [2019-11-20 06:32:37,247 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 408 states to 408 states and 593 transitions. [2019-11-20 06:32:37,247 INFO L78 Accepts]: Start accepts. Automaton has 408 states and 593 transitions. Word has length 89 [2019-11-20 06:32:37,247 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 06:32:37,247 INFO L462 AbstractCegarLoop]: Abstraction has 408 states and 593 transitions. [2019-11-20 06:32:37,247 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-20 06:32:37,248 INFO L276 IsEmpty]: Start isEmpty. Operand 408 states and 593 transitions. [2019-11-20 06:32:37,249 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2019-11-20 06:32:37,249 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 06:32:37,249 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 06:32:37,249 INFO L410 AbstractCegarLoop]: === Iteration 22 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 06:32:37,250 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 06:32:37,250 INFO L82 PathProgramCache]: Analyzing trace with hash 362443388, now seen corresponding path program 1 times [2019-11-20 06:32:37,251 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 06:32:37,252 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1091505218] [2019-11-20 06:32:37,252 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 06:32:37,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 06:32:37,314 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 06:32:37,315 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1091505218] [2019-11-20 06:32:37,315 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 06:32:37,315 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-20 06:32:37,315 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [723594302] [2019-11-20 06:32:37,316 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-20 06:32:37,316 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 06:32:37,316 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-20 06:32:37,316 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-20 06:32:37,317 INFO L87 Difference]: Start difference. First operand 408 states and 593 transitions. Second operand 3 states. [2019-11-20 06:32:37,358 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 06:32:37,359 INFO L93 Difference]: Finished difference Result 808 states and 1181 transitions. [2019-11-20 06:32:37,360 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-20 06:32:37,360 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 89 [2019-11-20 06:32:37,361 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 06:32:37,364 INFO L225 Difference]: With dead ends: 808 [2019-11-20 06:32:37,364 INFO L226 Difference]: Without dead ends: 557 [2019-11-20 06:32:37,366 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 06:32:37,367 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 557 states. [2019-11-20 06:32:37,380 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 557 to 557. [2019-11-20 06:32:37,380 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 557 states. [2019-11-20 06:32:37,382 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 557 states to 557 states and 810 transitions. [2019-11-20 06:32:37,383 INFO L78 Accepts]: Start accepts. Automaton has 557 states and 810 transitions. Word has length 89 [2019-11-20 06:32:37,383 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 06:32:37,383 INFO L462 AbstractCegarLoop]: Abstraction has 557 states and 810 transitions. [2019-11-20 06:32:37,383 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-20 06:32:37,383 INFO L276 IsEmpty]: Start isEmpty. Operand 557 states and 810 transitions. [2019-11-20 06:32:37,385 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2019-11-20 06:32:37,385 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 06:32:37,385 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 06:32:37,386 INFO L410 AbstractCegarLoop]: === Iteration 23 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 06:32:37,386 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 06:32:37,386 INFO L82 PathProgramCache]: Analyzing trace with hash 846505389, now seen corresponding path program 1 times [2019-11-20 06:32:37,386 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 06:32:37,386 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1726830630] [2019-11-20 06:32:37,387 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 06:32:37,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 06:32:37,445 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 06:32:37,445 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1726830630] [2019-11-20 06:32:37,445 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 06:32:37,445 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-20 06:32:37,446 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [752745582] [2019-11-20 06:32:37,447 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-20 06:32:37,447 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 06:32:37,447 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-20 06:32:37,447 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-20 06:32:37,448 INFO L87 Difference]: Start difference. First operand 557 states and 810 transitions. Second operand 3 states. [2019-11-20 06:32:37,489 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 06:32:37,489 INFO L93 Difference]: Finished difference Result 1106 states and 1615 transitions. [2019-11-20 06:32:37,490 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-20 06:32:37,490 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 91 [2019-11-20 06:32:37,490 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 06:32:37,495 INFO L225 Difference]: With dead ends: 1106 [2019-11-20 06:32:37,495 INFO L226 Difference]: Without dead ends: 706 [2019-11-20 06:32:37,496 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 06:32:37,497 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 706 states. [2019-11-20 06:32:37,516 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 706 to 706. [2019-11-20 06:32:37,516 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 706 states. [2019-11-20 06:32:37,518 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 706 states to 706 states and 1028 transitions. [2019-11-20 06:32:37,518 INFO L78 Accepts]: Start accepts. Automaton has 706 states and 1028 transitions. Word has length 91 [2019-11-20 06:32:37,519 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 06:32:37,519 INFO L462 AbstractCegarLoop]: Abstraction has 706 states and 1028 transitions. [2019-11-20 06:32:37,519 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-20 06:32:37,519 INFO L276 IsEmpty]: Start isEmpty. Operand 706 states and 1028 transitions. [2019-11-20 06:32:37,521 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2019-11-20 06:32:37,521 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 06:32:37,522 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 06:32:37,522 INFO L410 AbstractCegarLoop]: === Iteration 24 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 06:32:37,522 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 06:32:37,523 INFO L82 PathProgramCache]: Analyzing trace with hash 797599730, now seen corresponding path program 1 times [2019-11-20 06:32:37,523 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 06:32:37,523 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1836413744] [2019-11-20 06:32:37,523 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 06:32:37,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-20 06:32:37,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-20 06:32:38,024 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-20 06:32:38,024 INFO L475 BasicCegarLoop]: Counterexample might be feasible [2019-11-20 06:32:38,160 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 20.11 06:32:38 BoogieIcfgContainer [2019-11-20 06:32:38,160 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-11-20 06:32:38,160 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-11-20 06:32:38,161 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-11-20 06:32:38,161 INFO L275 PluginConnector]: Witness Printer initialized [2019-11-20 06:32:38,161 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 06:32:26" (3/4) ... [2019-11-20 06:32:38,176 INFO L140 WitnessPrinter]: No result that supports witness generation found [2019-11-20 06:32:38,183 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-11-20 06:32:38,185 INFO L168 Benchmark]: Toolchain (without parser) took 14468.42 ms. Allocated memory was 1.0 GB in the beginning and 1.3 GB in the end (delta: 266.3 MB). Free memory was 944.7 MB in the beginning and 1.2 GB in the end (delta: -226.7 MB). Peak memory consumption was 39.6 MB. Max. memory is 11.5 GB. [2019-11-20 06:32:38,185 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 06:32:38,186 INFO L168 Benchmark]: CACSL2BoogieTranslator took 725.69 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 151.5 MB). Free memory was 944.7 MB in the beginning and 1.1 GB in the end (delta: -183.7 MB). Peak memory consumption was 24.0 MB. Max. memory is 11.5 GB. [2019-11-20 06:32:38,186 INFO L168 Benchmark]: Boogie Procedure Inliner took 104.57 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: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. [2019-11-20 06:32:38,186 INFO L168 Benchmark]: Boogie Preprocessor took 127.48 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: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. [2019-11-20 06:32:38,187 INFO L168 Benchmark]: RCFGBuilder took 1377.74 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: 86.8 MB). Peak memory consumption was 86.8 MB. Max. memory is 11.5 GB. [2019-11-20 06:32:38,187 INFO L168 Benchmark]: TraceAbstraction took 12106.00 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 114.8 MB). Free memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: -145.9 MB). There was no memory consumed. Max. memory is 11.5 GB. [2019-11-20 06:32:38,187 INFO L168 Benchmark]: Witness Printer took 22.82 ms. Allocated memory is still 1.3 GB. Free memory is still 1.2 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-20 06:32:38,189 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 725.69 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 151.5 MB). Free memory was 944.7 MB in the beginning and 1.1 GB in the end (delta: -183.7 MB). Peak memory consumption was 24.0 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 104.57 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: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 127.48 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: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. * RCFGBuilder took 1377.74 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: 86.8 MB). Peak memory consumption was 86.8 MB. Max. memory is 11.5 GB. * TraceAbstraction took 12106.00 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 114.8 MB). Free memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: -145.9 MB). There was no memory consumed. Max. memory is 11.5 GB. * Witness Printer took 22.82 ms. Allocated memory is still 1.3 GB. Free memory is still 1.2 GB. There was no memory consumed. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - UnprovableResult [Line: 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 1332. 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}] [L1318] COND FALSE !(ret <= 0) [L1323] s->hit VAL [init=1, SSLv3_client_data={9:0}] [L1323] COND FALSE !(s->hit) [L1326] s->state = 4400 VAL [init=1, SSLv3_client_data={9:0}] [L1328] 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 [L1332] EXPR s->s3 [L1332] EXPR (s->s3)->tmp.new_cipher [L1332] EXPR ((s->s3)->tmp.new_cipher)->algorithms VAL [init=1, SSLv3_client_data={9:0}] [L1332] COND FALSE !(((s->s3)->tmp.new_cipher)->algorithms & 256UL) [L1335] ret = __VERIFIER_nondet_int() [L1336] COND TRUE blastFlag == 2 [L1337] 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.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 4904 SDtfs, 1791 SDslu, 6306 SDs, 0 SdLazy, 3606 SolverSat, 136 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 6.6s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 126 GetRequests, 46 SyntacticMatches, 19 SemanticMatches, 61 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=706occurred 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.8s 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 06:32:40,127 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-20 06:32:40,129 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-20 06:32:40,140 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-20 06:32:40,140 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-20 06:32:40,141 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-20 06:32:40,142 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-20 06:32:40,144 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-20 06:32:40,146 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-20 06:32:40,147 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-20 06:32:40,148 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-20 06:32:40,149 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-20 06:32:40,150 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-20 06:32:40,151 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-20 06:32:40,152 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-20 06:32:40,153 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-20 06:32:40,154 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-20 06:32:40,154 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-20 06:32:40,156 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-20 06:32:40,158 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-20 06:32:40,160 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-20 06:32:40,161 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-20 06:32:40,162 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-20 06:32:40,163 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-20 06:32:40,165 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-20 06:32:40,166 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-20 06:32:40,166 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-20 06:32:40,167 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-20 06:32:40,168 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-20 06:32:40,169 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-20 06:32:40,169 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-20 06:32:40,170 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-20 06:32:40,170 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-20 06:32:40,171 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-20 06:32:40,172 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-20 06:32:40,172 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-20 06:32:40,173 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-20 06:32:40,173 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-20 06:32:40,174 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-20 06:32:40,175 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-20 06:32:40,175 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-20 06:32:40,176 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_ad572bcb-4a3b-4036-a8f8-4e229599943f/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2019-11-20 06:32:40,190 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-20 06:32:40,190 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-20 06:32:40,191 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-20 06:32:40,192 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-20 06:32:40,192 INFO L138 SettingsManager]: * Use SBE=true [2019-11-20 06:32:40,192 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-20 06:32:40,193 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-20 06:32:40,193 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-20 06:32:40,193 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-20 06:32:40,193 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-11-20 06:32:40,193 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-20 06:32:40,194 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-11-20 06:32:40,194 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2019-11-20 06:32:40,194 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2019-11-20 06:32:40,194 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-20 06:32:40,195 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-20 06:32:40,195 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-20 06:32:40,195 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-11-20 06:32:40,195 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-20 06:32:40,196 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-20 06:32:40,196 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-20 06:32:40,196 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-20 06:32:40,196 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-20 06:32:40,197 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-20 06:32:40,197 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-20 06:32:40,197 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-11-20 06:32:40,197 INFO L138 SettingsManager]: * Trace refinement strategy=WOLF [2019-11-20 06:32:40,198 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --rewrite-divk --print-success --lang smt [2019-11-20 06:32:40,198 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-11-20 06:32:40,198 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-11-20 06:32:40,198 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_ad572bcb-4a3b-4036-a8f8-4e229599943f/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 -> dbebd8f3a7ff59c46b95280959676a0cf0887b44 [2019-11-20 06:32:40,524 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-20 06:32:40,534 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-20 06:32:40,542 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-20 06:32:40,544 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-20 06:32:40,545 INFO L275 PluginConnector]: CDTParser initialized [2019-11-20 06:32:40,546 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_ad572bcb-4a3b-4036-a8f8-4e229599943f/bin/uautomizer/../../sv-benchmarks/c/ssh/s3_clnt.blast.04.i.cil-1.c [2019-11-20 06:32:40,604 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_ad572bcb-4a3b-4036-a8f8-4e229599943f/bin/uautomizer/data/b30efcfdc/c3960b2ae1574d5e800bf087f3d9be40/FLAGaf4514c54 [2019-11-20 06:32:41,119 INFO L306 CDTParser]: Found 1 translation units. [2019-11-20 06:32:41,120 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_ad572bcb-4a3b-4036-a8f8-4e229599943f/sv-benchmarks/c/ssh/s3_clnt.blast.04.i.cil-1.c [2019-11-20 06:32:41,143 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_ad572bcb-4a3b-4036-a8f8-4e229599943f/bin/uautomizer/data/b30efcfdc/c3960b2ae1574d5e800bf087f3d9be40/FLAGaf4514c54 [2019-11-20 06:32:41,398 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_ad572bcb-4a3b-4036-a8f8-4e229599943f/bin/uautomizer/data/b30efcfdc/c3960b2ae1574d5e800bf087f3d9be40 [2019-11-20 06:32:41,400 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-20 06:32:41,402 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-11-20 06:32:41,405 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-20 06:32:41,405 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-20 06:32:41,408 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-20 06:32:41,409 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.11 06:32:41" (1/1) ... [2019-11-20 06:32:41,411 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5981097c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 06:32:41, skipping insertion in model container [2019-11-20 06:32:41,411 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.11 06:32:41" (1/1) ... [2019-11-20 06:32:41,422 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-11-20 06:32:41,490 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-11-20 06:32:42,049 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-20 06:32:42,075 INFO L188 MainTranslator]: Completed pre-run [2019-11-20 06:32:42,215 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-20 06:32:42,239 INFO L192 MainTranslator]: Completed translation [2019-11-20 06:32:42,240 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 06:32:42 WrapperNode [2019-11-20 06:32:42,240 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-20 06:32:42,241 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-11-20 06:32:42,241 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-11-20 06:32:42,241 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-11-20 06:32:42,250 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 06:32:42" (1/1) ... [2019-11-20 06:32:42,296 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 06:32:42" (1/1) ... [2019-11-20 06:32:42,348 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-11-20 06:32:42,353 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-20 06:32:42,353 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-20 06:32:42,353 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-20 06:32:42,363 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 06:32:42" (1/1) ... [2019-11-20 06:32:42,363 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 06:32:42" (1/1) ... [2019-11-20 06:32:42,381 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 06:32:42" (1/1) ... [2019-11-20 06:32:42,383 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 06:32:42" (1/1) ... [2019-11-20 06:32:42,436 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 06:32:42" (1/1) ... [2019-11-20 06:32:42,443 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 06:32:42" (1/1) ... [2019-11-20 06:32:42,446 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 06:32:42" (1/1) ... [2019-11-20 06:32:42,452 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-20 06:32:42,452 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-20 06:32:42,452 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-20 06:32:42,453 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-20 06:32:42,453 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 06:32:42" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_ad572bcb-4a3b-4036-a8f8-4e229599943f/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 06:32:42,532 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2019-11-20 06:32:42,533 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-11-20 06:32:42,534 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4 [2019-11-20 06:32:42,534 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2019-11-20 06:32:42,534 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2019-11-20 06:32:42,534 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-20 06:32:42,534 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-20 06:32:42,535 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2019-11-20 06:32:42,760 WARN L736 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-11-20 06:32:45,813 INFO L689 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##85: assume !false; [2019-11-20 06:32:45,813 INFO L689 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##84: assume false; [2019-11-20 06:32:45,814 INFO L280 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-20 06:32:45,814 INFO L285 CfgBuilder]: Removed 7 assume(true) statements. [2019-11-20 06:32:45,816 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 06:32:45 BoogieIcfgContainer [2019-11-20 06:32:45,816 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-20 06:32:45,817 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-20 06:32:45,817 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-20 06:32:45,820 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-20 06:32:45,820 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.11 06:32:41" (1/3) ... [2019-11-20 06:32:45,821 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@56857510 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.11 06:32:45, skipping insertion in model container [2019-11-20 06:32:45,821 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 06:32:42" (2/3) ... [2019-11-20 06:32:45,821 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@56857510 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.11 06:32:45, skipping insertion in model container [2019-11-20 06:32:45,821 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 06:32:45" (3/3) ... [2019-11-20 06:32:45,823 INFO L109 eAbstractionObserver]: Analyzing ICFG s3_clnt.blast.04.i.cil-1.c [2019-11-20 06:32:45,832 INFO L153 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-20 06:32:45,839 INFO L165 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-11-20 06:32:45,849 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-11-20 06:32:45,870 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-20 06:32:45,870 INFO L374 AbstractCegarLoop]: Hoare is true [2019-11-20 06:32:45,870 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-20 06:32:45,871 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-20 06:32:45,871 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-20 06:32:45,871 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-20 06:32:45,871 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-20 06:32:45,871 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-20 06:32:45,886 INFO L276 IsEmpty]: Start isEmpty. Operand 129 states. [2019-11-20 06:32:45,891 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2019-11-20 06:32:45,892 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 06:32:45,893 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 06:32:45,893 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 06:32:45,897 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 06:32:45,897 INFO L82 PathProgramCache]: Analyzing trace with hash -1457695037, now seen corresponding path program 1 times [2019-11-20 06:32:45,906 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-20 06:32:45,906 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [385024287] [2019-11-20 06:32:45,907 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_ad572bcb-4a3b-4036-a8f8-4e229599943f/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 06:32:46,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 06:32:46,092 INFO L255 TraceCheckSpWp]: Trace formula consists of 98 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-20 06:32:46,098 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 06:32:46,138 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 06:32:46,144 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-20 06:32:46,162 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 06:32:46,163 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [385024287] [2019-11-20 06:32:46,165 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-20 06:32:46,165 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 4 [2019-11-20 06:32:46,166 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [649787471] [2019-11-20 06:32:46,173 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-20 06:32:46,174 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-20 06:32:46,186 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-20 06:32:46,187 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-20 06:32:46,190 INFO L87 Difference]: Start difference. First operand 129 states. Second operand 4 states. [2019-11-20 06:32:46,360 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 06:32:46,364 INFO L93 Difference]: Finished difference Result 487 states and 823 transitions. [2019-11-20 06:32:46,365 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-20 06:32:46,366 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 24 [2019-11-20 06:32:46,367 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 06:32:46,384 INFO L225 Difference]: With dead ends: 487 [2019-11-20 06:32:46,387 INFO L226 Difference]: Without dead ends: 314 [2019-11-20 06:32:46,391 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 06:32:46,410 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 314 states. [2019-11-20 06:32:46,479 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 314 to 314. [2019-11-20 06:32:46,481 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 314 states. [2019-11-20 06:32:46,489 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 314 states to 314 states and 470 transitions. [2019-11-20 06:32:46,491 INFO L78 Accepts]: Start accepts. Automaton has 314 states and 470 transitions. Word has length 24 [2019-11-20 06:32:46,491 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 06:32:46,492 INFO L462 AbstractCegarLoop]: Abstraction has 314 states and 470 transitions. [2019-11-20 06:32:46,492 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-20 06:32:46,492 INFO L276 IsEmpty]: Start isEmpty. Operand 314 states and 470 transitions. [2019-11-20 06:32:46,500 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2019-11-20 06:32:46,500 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 06:32:46,500 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 06:32:46,712 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-20 06:32:46,712 INFO L410 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 06:32:46,712 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 06:32:46,712 INFO L82 PathProgramCache]: Analyzing trace with hash -1854239308, now seen corresponding path program 1 times [2019-11-20 06:32:46,713 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-20 06:32:46,714 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [1114775434] [2019-11-20 06:32:46,714 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_ad572bcb-4a3b-4036-a8f8-4e229599943f/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 06:32:46,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 06:32:46,924 INFO L255 TraceCheckSpWp]: Trace formula consists of 175 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-20 06:32:46,928 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 06:32:46,950 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 06:32:46,950 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-20 06:32:46,969 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 06:32:46,970 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1114775434] [2019-11-20 06:32:46,970 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-20 06:32:46,970 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 4 [2019-11-20 06:32:46,971 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1549158188] [2019-11-20 06:32:46,972 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-20 06:32:46,972 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-20 06:32:46,973 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-20 06:32:46,973 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-20 06:32:46,973 INFO L87 Difference]: Start difference. First operand 314 states and 470 transitions. Second operand 4 states. [2019-11-20 06:32:48,524 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 06:32:48,524 INFO L93 Difference]: Finished difference Result 721 states and 1085 transitions. [2019-11-20 06:32:48,525 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-20 06:32:48,525 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 60 [2019-11-20 06:32:48,525 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 06:32:48,531 INFO L225 Difference]: With dead ends: 721 [2019-11-20 06:32:48,531 INFO L226 Difference]: Without dead ends: 515 [2019-11-20 06:32:48,534 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 06:32:48,537 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 515 states. [2019-11-20 06:32:48,586 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 515 to 515. [2019-11-20 06:32:48,587 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 515 states. [2019-11-20 06:32:48,589 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 515 states to 515 states and 768 transitions. [2019-11-20 06:32:48,589 INFO L78 Accepts]: Start accepts. Automaton has 515 states and 768 transitions. Word has length 60 [2019-11-20 06:32:48,590 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 06:32:48,591 INFO L462 AbstractCegarLoop]: Abstraction has 515 states and 768 transitions. [2019-11-20 06:32:48,591 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-20 06:32:48,595 INFO L276 IsEmpty]: Start isEmpty. Operand 515 states and 768 transitions. [2019-11-20 06:32:48,602 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2019-11-20 06:32:48,602 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 06:32:48,603 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 06:32:48,804 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-20 06:32:48,805 INFO L410 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 06:32:48,805 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 06:32:48,806 INFO L82 PathProgramCache]: Analyzing trace with hash 465583256, now seen corresponding path program 1 times [2019-11-20 06:32:48,807 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-20 06:32:48,807 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [424370544] [2019-11-20 06:32:48,807 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_ad572bcb-4a3b-4036-a8f8-4e229599943f/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 06:32:50,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 06:32:50,117 INFO L255 TraceCheckSpWp]: Trace formula consists of 252 conjuncts, 8 conjunts are in the unsatisfiable core [2019-11-20 06:32:50,124 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 06:32:50,180 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 06:32:50,185 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 06:32:50,188 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 06:32:50,212 INFO L343 Elim1Store]: treesize reduction 19, result has 32.1 percent of original size [2019-11-20 06:32:50,213 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 06:32:50,213 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 06:32:50,237 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 06:32:50,238 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 06:32:50,239 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:48, output treesize:22 [2019-11-20 06:32:50,286 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 06:32:50,290 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 06:32:50,290 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 06:32:50,291 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 06:32:50,300 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 06:32:50,300 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-20 06:32:50,300 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:36, output treesize:15 [2019-11-20 06:32:50,308 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 06:32:50,309 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 06:32:50,311 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 06:32:50,311 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 06:32:50,312 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:15, output treesize:5 [2019-11-20 06:32:50,353 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 06:32:50,353 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-20 06:32:50,424 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 06:32:50,425 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [424370544] [2019-11-20 06:32:50,426 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-20 06:32:50,426 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 6 [2019-11-20 06:32:50,426 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [387641380] [2019-11-20 06:32:50,428 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-20 06:32:50,428 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-20 06:32:50,428 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-20 06:32:50,429 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-11-20 06:32:50,429 INFO L87 Difference]: Start difference. First operand 515 states and 768 transitions. Second operand 6 states. [2019-11-20 06:32:54,203 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 06:32:54,203 INFO L93 Difference]: Finished difference Result 1458 states and 2182 transitions. [2019-11-20 06:32:54,205 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-20 06:32:54,205 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 98 [2019-11-20 06:32:54,205 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 06:32:54,217 INFO L225 Difference]: With dead ends: 1458 [2019-11-20 06:32:54,218 INFO L226 Difference]: Without dead ends: 1049 [2019-11-20 06:32:54,224 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 06:32:54,227 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1049 states. [2019-11-20 06:32:54,247 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1049 to 595. [2019-11-20 06:32:54,248 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 595 states. [2019-11-20 06:32:54,250 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 595 states to 595 states and 898 transitions. [2019-11-20 06:32:54,250 INFO L78 Accepts]: Start accepts. Automaton has 595 states and 898 transitions. Word has length 98 [2019-11-20 06:32:54,251 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 06:32:54,251 INFO L462 AbstractCegarLoop]: Abstraction has 595 states and 898 transitions. [2019-11-20 06:32:54,251 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-20 06:32:54,251 INFO L276 IsEmpty]: Start isEmpty. Operand 595 states and 898 transitions. [2019-11-20 06:32:54,254 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2019-11-20 06:32:54,254 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 06:32:54,254 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 06:32:54,462 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-20 06:32:54,463 INFO L410 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 06:32:54,463 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 06:32:54,463 INFO L82 PathProgramCache]: Analyzing trace with hash 2076572589, now seen corresponding path program 1 times [2019-11-20 06:32:54,464 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-20 06:32:54,465 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [1187697250] [2019-11-20 06:32:54,465 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_ad572bcb-4a3b-4036-a8f8-4e229599943f/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 06:32:55,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 06:32:55,726 INFO L255 TraceCheckSpWp]: Trace formula consists of 254 conjuncts, 8 conjunts are in the unsatisfiable core [2019-11-20 06:32:55,737 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 06:32:55,757 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 06:32:55,758 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 06:32:55,762 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 06:32:55,786 INFO L343 Elim1Store]: treesize reduction 19, result has 32.1 percent of original size [2019-11-20 06:32:55,786 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 06:32:55,787 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 06:32:55,806 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 06:32:55,807 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 06:32:55,808 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:48, output treesize:22 [2019-11-20 06:32:55,837 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 06:32:55,839 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 06:32:55,839 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 06:32:55,840 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 06:32:55,848 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 06:32:55,848 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-20 06:32:55,848 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:36, output treesize:15 [2019-11-20 06:32:55,855 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 06:32:55,856 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 06:32:55,858 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 06:32:55,858 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 06:32:55,859 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:15, output treesize:5 [2019-11-20 06:32:55,880 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 06:32:55,880 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-20 06:32:55,940 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 06:32:55,941 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1187697250] [2019-11-20 06:32:55,941 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-20 06:32:55,941 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 6 [2019-11-20 06:32:55,941 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1986160337] [2019-11-20 06:32:55,942 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-20 06:32:55,943 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-20 06:32:55,943 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-20 06:32:55,945 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-11-20 06:32:55,945 INFO L87 Difference]: Start difference. First operand 595 states and 898 transitions. Second operand 6 states. [2019-11-20 06:32:59,628 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 06:32:59,628 INFO L93 Difference]: Finished difference Result 1505 states and 2260 transitions. [2019-11-20 06:32:59,630 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-20 06:32:59,630 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 99 [2019-11-20 06:32:59,632 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 06:32:59,640 INFO L225 Difference]: With dead ends: 1505 [2019-11-20 06:32:59,640 INFO L226 Difference]: Without dead ends: 1032 [2019-11-20 06:32:59,642 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 198 GetRequests, 191 SyntacticMatches, 1 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2019-11-20 06:32:59,644 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1032 states. [2019-11-20 06:32:59,672 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1032 to 600. [2019-11-20 06:32:59,674 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 600 states. [2019-11-20 06:32:59,680 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 600 states to 600 states and 903 transitions. [2019-11-20 06:32:59,681 INFO L78 Accepts]: Start accepts. Automaton has 600 states and 903 transitions. Word has length 99 [2019-11-20 06:32:59,681 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 06:32:59,681 INFO L462 AbstractCegarLoop]: Abstraction has 600 states and 903 transitions. [2019-11-20 06:32:59,681 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-20 06:32:59,681 INFO L276 IsEmpty]: Start isEmpty. Operand 600 states and 903 transitions. [2019-11-20 06:32:59,684 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2019-11-20 06:32:59,684 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 06:32:59,685 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 06:32:59,892 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-20 06:32:59,893 INFO L410 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 06:32:59,893 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 06:32:59,893 INFO L82 PathProgramCache]: Analyzing trace with hash -1811187728, now seen corresponding path program 1 times [2019-11-20 06:32:59,894 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-20 06:32:59,894 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [291909459] [2019-11-20 06:32:59,894 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_ad572bcb-4a3b-4036-a8f8-4e229599943f/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 06:33:01,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 06:33:01,620 INFO L255 TraceCheckSpWp]: Trace formula consists of 289 conjuncts, 8 conjunts are in the unsatisfiable core [2019-11-20 06:33:01,624 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 06:33:01,645 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 06:33:01,645 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 06:33:01,653 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 06:33:01,653 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-20 06:33:01,654 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:17, output treesize:13 [2019-11-20 06:33:01,681 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 06:33:01,689 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 06:33:01,689 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 06:33:01,702 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 06:33:01,702 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-20 06:33:01,702 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:26, output treesize:22 [2019-11-20 06:33:01,726 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 06:33:01,726 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 06:33:01,727 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 06:33:01,728 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 06:33:01,729 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 06:33:01,729 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:22, output treesize:3 [2019-11-20 06:33:01,751 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 06:33:01,751 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-20 06:33:01,799 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 06:33:01,799 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [291909459] [2019-11-20 06:33:01,799 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-20 06:33:01,799 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6, 4] imperfect sequences [] total 8 [2019-11-20 06:33:01,799 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1956182164] [2019-11-20 06:33:01,800 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-11-20 06:33:01,800 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-20 06:33:01,800 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-11-20 06:33:01,804 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2019-11-20 06:33:01,804 INFO L87 Difference]: Start difference. First operand 600 states and 903 transitions. Second operand 8 states. [2019-11-20 06:33:10,169 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 06:33:10,169 INFO L93 Difference]: Finished difference Result 2071 states and 3119 transitions. [2019-11-20 06:33:10,171 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-11-20 06:33:10,171 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 112 [2019-11-20 06:33:10,172 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 06:33:10,179 INFO L225 Difference]: With dead ends: 2071 [2019-11-20 06:33:10,180 INFO L226 Difference]: Without dead ends: 1478 [2019-11-20 06:33:10,181 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 06:33:10,183 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1478 states. [2019-11-20 06:33:10,215 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1478 to 772. [2019-11-20 06:33:10,215 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 772 states. [2019-11-20 06:33:10,218 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 772 states to 772 states and 1185 transitions. [2019-11-20 06:33:10,218 INFO L78 Accepts]: Start accepts. Automaton has 772 states and 1185 transitions. Word has length 112 [2019-11-20 06:33:10,221 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 06:33:10,221 INFO L462 AbstractCegarLoop]: Abstraction has 772 states and 1185 transitions. [2019-11-20 06:33:10,221 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-11-20 06:33:10,221 INFO L276 IsEmpty]: Start isEmpty. Operand 772 states and 1185 transitions. [2019-11-20 06:33:10,223 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2019-11-20 06:33:10,223 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 06:33:10,224 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 06:33:10,441 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-20 06:33:10,441 INFO L410 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 06:33:10,442 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 06:33:10,442 INFO L82 PathProgramCache]: Analyzing trace with hash 797599730, now seen corresponding path program 1 times [2019-11-20 06:33:10,442 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-20 06:33:10,442 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [42050628] [2019-11-20 06:33:10,442 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_ad572bcb-4a3b-4036-a8f8-4e229599943f/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 06:33:12,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-20 06:33:14,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-20 06:33:15,090 INFO L174 FreeRefinementEngine]: Strategy WOLF found a feasible trace [2019-11-20 06:33:15,090 INFO L475 BasicCegarLoop]: Counterexample might be feasible [2019-11-20 06:33:15,311 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-20 06:33:15,471 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 20.11 06:33:15 BoogieIcfgContainer [2019-11-20 06:33:15,472 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-11-20 06:33:15,472 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-11-20 06:33:15,472 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-11-20 06:33:15,472 INFO L275 PluginConnector]: Witness Printer initialized [2019-11-20 06:33:15,473 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 06:32:45" (3/4) ... [2019-11-20 06:33:15,475 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2019-11-20 06:33:15,590 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/run_dir_ad572bcb-4a3b-4036-a8f8-4e229599943f/bin/uautomizer/witness.graphml [2019-11-20 06:33:15,591 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-11-20 06:33:15,592 INFO L168 Benchmark]: Toolchain (without parser) took 34190.47 ms. Allocated memory was 1.0 GB in the beginning and 1.3 GB in the end (delta: 280.0 MB). Free memory was 951.0 MB in the beginning and 1.1 GB in the end (delta: -163.9 MB). Peak memory consumption was 116.1 MB. Max. memory is 11.5 GB. [2019-11-20 06:33:15,592 INFO L168 Benchmark]: CDTParser took 0.48 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 06:33:15,592 INFO L168 Benchmark]: CACSL2BoogieTranslator took 835.80 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 119.5 MB). Free memory was 951.0 MB in the beginning and 1.1 GB in the end (delta: -136.1 MB). Peak memory consumption was 28.2 MB. Max. memory is 11.5 GB. [2019-11-20 06:33:15,593 INFO L168 Benchmark]: Boogie Procedure Inliner took 111.78 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: 6.7 MB). Peak memory consumption was 6.7 MB. Max. memory is 11.5 GB. [2019-11-20 06:33:15,593 INFO L168 Benchmark]: Boogie Preprocessor took 98.85 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: 6.7 MB). Peak memory consumption was 6.7 MB. Max. memory is 11.5 GB. [2019-11-20 06:33:15,593 INFO L168 Benchmark]: RCFGBuilder took 3363.68 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 988.2 MB in the end (delta: 85.5 MB). Peak memory consumption was 85.5 MB. Max. memory is 11.5 GB. [2019-11-20 06:33:15,594 INFO L168 Benchmark]: TraceAbstraction took 29654.87 ms. Allocated memory was 1.1 GB in the beginning and 1.3 GB in the end (delta: 160.4 MB). Free memory was 988.2 MB in the beginning and 1.1 GB in the end (delta: -144.9 MB). Peak memory consumption was 15.5 MB. Max. memory is 11.5 GB. [2019-11-20 06:33:15,594 INFO L168 Benchmark]: Witness Printer took 118.65 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: 18.2 MB). Peak memory consumption was 18.2 MB. Max. memory is 11.5 GB. [2019-11-20 06:33:15,596 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.48 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 835.80 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 119.5 MB). Free memory was 951.0 MB in the beginning and 1.1 GB in the end (delta: -136.1 MB). Peak memory consumption was 28.2 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 111.78 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: 6.7 MB). Peak memory consumption was 6.7 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 98.85 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: 6.7 MB). Peak memory consumption was 6.7 MB. Max. memory is 11.5 GB. * RCFGBuilder took 3363.68 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 988.2 MB in the end (delta: 85.5 MB). Peak memory consumption was 85.5 MB. Max. memory is 11.5 GB. * TraceAbstraction took 29654.87 ms. Allocated memory was 1.1 GB in the beginning and 1.3 GB in the end (delta: 160.4 MB). Free memory was 988.2 MB in the beginning and 1.1 GB in the end (delta: -144.9 MB). Peak memory consumption was 15.5 MB. Max. memory is 11.5 GB. * Witness Printer took 118.65 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: 18.2 MB). Peak memory consumption was 18.2 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}] [L1318] COND FALSE !(ret <= 0) [L1323] s->hit VAL [init=1, SSLv3_client_data={1758530013:0}] [L1323] COND FALSE !(s->hit) [L1326] s->state = 4400 VAL [init=1, SSLv3_client_data={1758530013:0}] [L1328] 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 [L1332] EXPR s->s3 [L1332] EXPR (s->s3)->tmp.new_cipher [L1332] EXPR ((s->s3)->tmp.new_cipher)->algorithms VAL [init=1, SSLv3_client_data={1758530013:0}] [L1332] COND FALSE !(((s->s3)->tmp.new_cipher)->algorithms & 256UL) [L1335] ret = __VERIFIER_nondet_int() [L1336] COND TRUE blastFlag == 2 [L1337] 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: 29.5s, OverallIterations: 6, TraceHistogramMax: 6, AutomataDifference: 17.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 878 SDtfs, 1827 SDslu, 1605 SDs, 0 SdLazy, 1192 SolverSat, 225 SolverUnsat, 1 SolverUnknown, 0 SolverNotchecked, 15.9s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 784 GetRequests, 756 SyntacticMatches, 3 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=772occurred 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, 1592 StatesRemovedByMinimization, 3 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.3s SsaConstructionTime, 5.8s SatisfiabilityAnalysisTime, 0.9s 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...