./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/ssh/s3_srvr.blast.02.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_15c46571-83bb-461b-9212-2516ad5cc207/bin/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/run_dir_15c46571-83bb-461b-9212-2516ad5cc207/bin/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_15c46571-83bb-461b-9212-2516ad5cc207/bin/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_15c46571-83bb-461b-9212-2516ad5cc207/bin/uautomizer/config/AutomizerReach.xml -i ../../sv-benchmarks/c/ssh/s3_srvr.blast.02.i.cil-1.c -s /tmp/vcloud-vcloud-master/worker/run_dir_15c46571-83bb-461b-9212-2516ad5cc207/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_15c46571-83bb-461b-9212-2516ad5cc207/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 1952eae46575e60399f761afaedbe356b8f81a96 ......................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... 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_15c46571-83bb-461b-9212-2516ad5cc207/bin/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/run_dir_15c46571-83bb-461b-9212-2516ad5cc207/bin/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_15c46571-83bb-461b-9212-2516ad5cc207/bin/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_15c46571-83bb-461b-9212-2516ad5cc207/bin/uautomizer/config/AutomizerReach.xml -i ../../sv-benchmarks/c/ssh/s3_srvr.blast.02.i.cil-1.c -s /tmp/vcloud-vcloud-master/worker/run_dir_15c46571-83bb-461b-9212-2516ad5cc207/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_15c46571-83bb-461b-9212-2516ad5cc207/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 1952eae46575e60399f761afaedbe356b8f81a96 ........................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... 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 07:10:46,500 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-20 07:10:46,501 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-20 07:10:46,511 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-20 07:10:46,511 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-20 07:10:46,515 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-20 07:10:46,517 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-20 07:10:46,525 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-20 07:10:46,529 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-20 07:10:46,533 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-20 07:10:46,534 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-20 07:10:46,535 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-20 07:10:46,535 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-20 07:10:46,537 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-20 07:10:46,538 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-20 07:10:46,539 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-20 07:10:46,540 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-20 07:10:46,541 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-20 07:10:46,543 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-20 07:10:46,547 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-20 07:10:46,550 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-20 07:10:46,552 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-20 07:10:46,555 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-20 07:10:46,555 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-20 07:10:46,558 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-20 07:10:46,558 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-20 07:10:46,559 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-20 07:10:46,560 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-20 07:10:46,560 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-20 07:10:46,561 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-20 07:10:46,561 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-20 07:10:46,562 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-20 07:10:46,563 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-20 07:10:46,564 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-20 07:10:46,564 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-20 07:10:46,565 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-20 07:10:46,565 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-20 07:10:46,565 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-20 07:10:46,566 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-20 07:10:46,566 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-20 07:10:46,567 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-20 07:10:46,568 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_15c46571-83bb-461b-9212-2516ad5cc207/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf [2019-11-20 07:10:46,588 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-20 07:10:46,591 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-20 07:10:46,592 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-20 07:10:46,592 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-20 07:10:46,593 INFO L138 SettingsManager]: * Use SBE=true [2019-11-20 07:10:46,593 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-20 07:10:46,593 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-20 07:10:46,593 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-20 07:10:46,593 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-20 07:10:46,594 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-20 07:10:46,594 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-11-20 07:10:46,594 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-20 07:10:46,594 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-11-20 07:10:46,594 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-20 07:10:46,594 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-20 07:10:46,595 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-20 07:10:46,595 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-11-20 07:10:46,595 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-20 07:10:46,595 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-20 07:10:46,595 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-20 07:10:46,595 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-20 07:10:46,596 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-20 07:10:46,596 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-20 07:10:46,596 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-20 07:10:46,596 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-11-20 07:10:46,596 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-11-20 07:10:46,597 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-11-20 07:10:46,597 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-11-20 07:10:46,597 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_15c46571-83bb-461b-9212-2516ad5cc207/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 -> 1952eae46575e60399f761afaedbe356b8f81a96 [2019-11-20 07:10:46,740 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-20 07:10:46,750 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-20 07:10:46,753 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-20 07:10:46,754 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-20 07:10:46,755 INFO L275 PluginConnector]: CDTParser initialized [2019-11-20 07:10:46,755 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_15c46571-83bb-461b-9212-2516ad5cc207/bin/uautomizer/../../sv-benchmarks/c/ssh/s3_srvr.blast.02.i.cil-1.c [2019-11-20 07:10:46,804 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_15c46571-83bb-461b-9212-2516ad5cc207/bin/uautomizer/data/bc6fb58bf/c65c3cad519b44e882c6280120d2ea87/FLAG198af97d2 [2019-11-20 07:10:47,322 INFO L306 CDTParser]: Found 1 translation units. [2019-11-20 07:10:47,323 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_15c46571-83bb-461b-9212-2516ad5cc207/sv-benchmarks/c/ssh/s3_srvr.blast.02.i.cil-1.c [2019-11-20 07:10:47,344 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_15c46571-83bb-461b-9212-2516ad5cc207/bin/uautomizer/data/bc6fb58bf/c65c3cad519b44e882c6280120d2ea87/FLAG198af97d2 [2019-11-20 07:10:47,774 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_15c46571-83bb-461b-9212-2516ad5cc207/bin/uautomizer/data/bc6fb58bf/c65c3cad519b44e882c6280120d2ea87 [2019-11-20 07:10:47,776 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-20 07:10:47,777 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-11-20 07:10:47,777 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-20 07:10:47,778 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-20 07:10:47,781 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-20 07:10:47,781 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.11 07:10:47" (1/1) ... [2019-11-20 07:10:47,783 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@17fceab4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 07:10:47, skipping insertion in model container [2019-11-20 07:10:47,784 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.11 07:10:47" (1/1) ... [2019-11-20 07:10:47,790 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-11-20 07:10:47,843 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-11-20 07:10:48,340 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-20 07:10:48,361 INFO L188 MainTranslator]: Completed pre-run [2019-11-20 07:10:48,525 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-20 07:10:48,545 INFO L192 MainTranslator]: Completed translation [2019-11-20 07:10:48,546 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 07:10:48 WrapperNode [2019-11-20 07:10:48,546 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-20 07:10:48,547 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-11-20 07:10:48,547 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-11-20 07:10:48,547 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-11-20 07:10:48,554 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 07:10:48" (1/1) ... [2019-11-20 07:10:48,590 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 07:10:48" (1/1) ... [2019-11-20 07:10:48,641 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-11-20 07:10:48,641 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-20 07:10:48,641 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-20 07:10:48,641 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-20 07:10:48,650 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 07:10:48" (1/1) ... [2019-11-20 07:10:48,650 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 07:10:48" (1/1) ... [2019-11-20 07:10:48,658 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 07:10:48" (1/1) ... [2019-11-20 07:10:48,658 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 07:10:48" (1/1) ... [2019-11-20 07:10:48,706 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 07:10:48" (1/1) ... [2019-11-20 07:10:48,715 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 07:10:48" (1/1) ... [2019-11-20 07:10:48,719 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 07:10:48" (1/1) ... [2019-11-20 07:10:48,725 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-20 07:10:48,726 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-20 07:10:48,726 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-20 07:10:48,726 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-20 07:10:48,727 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 07:10:48" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_15c46571-83bb-461b-9212-2516ad5cc207/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 07:10:48,788 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2019-11-20 07:10:48,788 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-11-20 07:10:48,789 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-11-20 07:10:48,789 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-11-20 07:10:48,789 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2019-11-20 07:10:48,789 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2019-11-20 07:10:48,789 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-20 07:10:48,790 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-20 07:10:49,001 WARN L736 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-11-20 07:10:49,788 INFO L689 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##87: assume false; [2019-11-20 07:10:49,788 INFO L689 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##88: assume !false; [2019-11-20 07:10:49,789 INFO L280 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-20 07:10:49,792 INFO L285 CfgBuilder]: Removed 7 assume(true) statements. [2019-11-20 07:10:49,793 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 07:10:49 BoogieIcfgContainer [2019-11-20 07:10:49,793 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-20 07:10:49,796 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-20 07:10:49,796 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-20 07:10:49,799 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-20 07:10:49,799 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.11 07:10:47" (1/3) ... [2019-11-20 07:10:49,800 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2478564 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.11 07:10:49, skipping insertion in model container [2019-11-20 07:10:49,800 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 07:10:48" (2/3) ... [2019-11-20 07:10:49,800 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2478564 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.11 07:10:49, skipping insertion in model container [2019-11-20 07:10:49,801 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 07:10:49" (3/3) ... [2019-11-20 07:10:49,802 INFO L109 eAbstractionObserver]: Analyzing ICFG s3_srvr.blast.02.i.cil-1.c [2019-11-20 07:10:49,809 INFO L153 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-20 07:10:49,814 INFO L165 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-11-20 07:10:49,823 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-11-20 07:10:49,845 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-20 07:10:49,845 INFO L374 AbstractCegarLoop]: Hoare is true [2019-11-20 07:10:49,846 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-20 07:10:49,846 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-20 07:10:49,846 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-20 07:10:49,846 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-20 07:10:49,846 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-20 07:10:49,846 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-20 07:10:49,862 INFO L276 IsEmpty]: Start isEmpty. Operand 143 states. [2019-11-20 07:10:49,870 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2019-11-20 07:10:49,870 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 07:10:49,871 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 07:10:49,871 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 07:10:49,875 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 07:10:49,876 INFO L82 PathProgramCache]: Analyzing trace with hash 522836684, now seen corresponding path program 1 times [2019-11-20 07:10:49,883 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 07:10:49,883 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1696398033] [2019-11-20 07:10:49,883 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 07:10:50,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 07:10:50,185 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 07:10:50,185 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1696398033] [2019-11-20 07:10:50,186 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 07:10:50,186 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-20 07:10:50,187 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1837264163] [2019-11-20 07:10:50,191 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-20 07:10:50,191 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 07:10:50,203 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-20 07:10:50,204 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-20 07:10:50,206 INFO L87 Difference]: Start difference. First operand 143 states. Second operand 4 states. [2019-11-20 07:10:50,674 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 07:10:50,674 INFO L93 Difference]: Finished difference Result 313 states and 527 transitions. [2019-11-20 07:10:50,675 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-20 07:10:50,676 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 45 [2019-11-20 07:10:50,677 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 07:10:50,688 INFO L225 Difference]: With dead ends: 313 [2019-11-20 07:10:50,688 INFO L226 Difference]: Without dead ends: 158 [2019-11-20 07:10:50,692 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 07:10:50,708 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 158 states. [2019-11-20 07:10:50,733 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 158 to 141. [2019-11-20 07:10:50,734 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 141 states. [2019-11-20 07:10:50,736 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 141 states to 141 states and 216 transitions. [2019-11-20 07:10:50,737 INFO L78 Accepts]: Start accepts. Automaton has 141 states and 216 transitions. Word has length 45 [2019-11-20 07:10:50,738 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 07:10:50,738 INFO L462 AbstractCegarLoop]: Abstraction has 141 states and 216 transitions. [2019-11-20 07:10:50,738 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-20 07:10:50,738 INFO L276 IsEmpty]: Start isEmpty. Operand 141 states and 216 transitions. [2019-11-20 07:10:50,741 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2019-11-20 07:10:50,741 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 07:10:50,741 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 07:10:50,741 INFO L410 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 07:10:50,742 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 07:10:50,742 INFO L82 PathProgramCache]: Analyzing trace with hash 968097209, now seen corresponding path program 1 times [2019-11-20 07:10:50,742 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 07:10:50,742 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1099090956] [2019-11-20 07:10:50,743 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 07:10:50,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 07:10:50,850 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 07:10:50,850 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1099090956] [2019-11-20 07:10:50,851 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 07:10:50,851 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-20 07:10:50,851 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [150300388] [2019-11-20 07:10:50,853 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-20 07:10:50,853 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 07:10:50,853 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-20 07:10:50,853 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-20 07:10:50,854 INFO L87 Difference]: Start difference. First operand 141 states and 216 transitions. Second operand 4 states. [2019-11-20 07:10:51,207 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 07:10:51,207 INFO L93 Difference]: Finished difference Result 280 states and 423 transitions. [2019-11-20 07:10:51,208 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-20 07:10:51,208 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 58 [2019-11-20 07:10:51,208 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 07:10:51,210 INFO L225 Difference]: With dead ends: 280 [2019-11-20 07:10:51,211 INFO L226 Difference]: Without dead ends: 158 [2019-11-20 07:10:51,212 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 07:10:51,213 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 158 states. [2019-11-20 07:10:51,224 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 158 to 141. [2019-11-20 07:10:51,226 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 141 states. [2019-11-20 07:10:51,227 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 141 states to 141 states and 215 transitions. [2019-11-20 07:10:51,228 INFO L78 Accepts]: Start accepts. Automaton has 141 states and 215 transitions. Word has length 58 [2019-11-20 07:10:51,229 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 07:10:51,229 INFO L462 AbstractCegarLoop]: Abstraction has 141 states and 215 transitions. [2019-11-20 07:10:51,229 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-20 07:10:51,230 INFO L276 IsEmpty]: Start isEmpty. Operand 141 states and 215 transitions. [2019-11-20 07:10:51,232 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2019-11-20 07:10:51,233 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 07:10:51,234 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 07:10:51,234 INFO L410 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 07:10:51,235 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 07:10:51,235 INFO L82 PathProgramCache]: Analyzing trace with hash -461266997, now seen corresponding path program 1 times [2019-11-20 07:10:51,236 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 07:10:51,236 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1157285132] [2019-11-20 07:10:51,237 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 07:10:51,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 07:10:51,435 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 07:10:51,436 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1157285132] [2019-11-20 07:10:51,436 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 07:10:51,436 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-20 07:10:51,437 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1296739386] [2019-11-20 07:10:51,437 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-20 07:10:51,437 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 07:10:51,438 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-20 07:10:51,438 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-20 07:10:51,438 INFO L87 Difference]: Start difference. First operand 141 states and 215 transitions. Second operand 4 states. [2019-11-20 07:10:51,751 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 07:10:51,751 INFO L93 Difference]: Finished difference Result 279 states and 421 transitions. [2019-11-20 07:10:51,751 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-20 07:10:51,751 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 59 [2019-11-20 07:10:51,752 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 07:10:51,753 INFO L225 Difference]: With dead ends: 279 [2019-11-20 07:10:51,753 INFO L226 Difference]: Without dead ends: 157 [2019-11-20 07:10:51,754 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 07:10:51,755 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 157 states. [2019-11-20 07:10:51,763 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 157 to 141. [2019-11-20 07:10:51,763 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 141 states. [2019-11-20 07:10:51,764 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 141 states to 141 states and 214 transitions. [2019-11-20 07:10:51,765 INFO L78 Accepts]: Start accepts. Automaton has 141 states and 214 transitions. Word has length 59 [2019-11-20 07:10:51,765 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 07:10:51,765 INFO L462 AbstractCegarLoop]: Abstraction has 141 states and 214 transitions. [2019-11-20 07:10:51,765 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-20 07:10:51,765 INFO L276 IsEmpty]: Start isEmpty. Operand 141 states and 214 transitions. [2019-11-20 07:10:51,768 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2019-11-20 07:10:51,768 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 07:10:51,768 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 07:10:51,768 INFO L410 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 07:10:51,769 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 07:10:51,769 INFO L82 PathProgramCache]: Analyzing trace with hash 881926454, now seen corresponding path program 1 times [2019-11-20 07:10:51,769 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 07:10:51,769 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [217936330] [2019-11-20 07:10:51,769 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 07:10:51,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 07:10:51,839 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 07:10:51,840 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [217936330] [2019-11-20 07:10:51,840 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 07:10:51,840 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-20 07:10:51,840 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [60310695] [2019-11-20 07:10:51,841 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-20 07:10:51,841 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 07:10:51,841 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-20 07:10:51,842 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-20 07:10:51,842 INFO L87 Difference]: Start difference. First operand 141 states and 214 transitions. Second operand 4 states. [2019-11-20 07:10:52,177 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 07:10:52,177 INFO L93 Difference]: Finished difference Result 277 states and 418 transitions. [2019-11-20 07:10:52,177 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-20 07:10:52,177 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 59 [2019-11-20 07:10:52,178 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 07:10:52,179 INFO L225 Difference]: With dead ends: 277 [2019-11-20 07:10:52,179 INFO L226 Difference]: Without dead ends: 155 [2019-11-20 07:10:52,180 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 07:10:52,180 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 155 states. [2019-11-20 07:10:52,187 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 155 to 141. [2019-11-20 07:10:52,187 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 141 states. [2019-11-20 07:10:52,194 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 141 states to 141 states and 213 transitions. [2019-11-20 07:10:52,195 INFO L78 Accepts]: Start accepts. Automaton has 141 states and 213 transitions. Word has length 59 [2019-11-20 07:10:52,196 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 07:10:52,196 INFO L462 AbstractCegarLoop]: Abstraction has 141 states and 213 transitions. [2019-11-20 07:10:52,197 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-20 07:10:52,197 INFO L276 IsEmpty]: Start isEmpty. Operand 141 states and 213 transitions. [2019-11-20 07:10:52,201 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2019-11-20 07:10:52,207 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 07:10:52,207 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 07:10:52,208 INFO L410 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 07:10:52,208 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 07:10:52,208 INFO L82 PathProgramCache]: Analyzing trace with hash 1831274614, now seen corresponding path program 1 times [2019-11-20 07:10:52,208 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 07:10:52,209 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1986397097] [2019-11-20 07:10:52,209 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 07:10:52,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 07:10:52,296 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 07:10:52,297 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1986397097] [2019-11-20 07:10:52,297 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 07:10:52,297 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-20 07:10:52,297 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [973291376] [2019-11-20 07:10:52,298 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-20 07:10:52,298 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 07:10:52,298 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-20 07:10:52,298 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-20 07:10:52,299 INFO L87 Difference]: Start difference. First operand 141 states and 213 transitions. Second operand 4 states. [2019-11-20 07:10:52,584 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 07:10:52,584 INFO L93 Difference]: Finished difference Result 276 states and 416 transitions. [2019-11-20 07:10:52,585 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-20 07:10:52,585 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 59 [2019-11-20 07:10:52,585 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 07:10:52,586 INFO L225 Difference]: With dead ends: 276 [2019-11-20 07:10:52,586 INFO L226 Difference]: Without dead ends: 154 [2019-11-20 07:10:52,587 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 07:10:52,588 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 154 states. [2019-11-20 07:10:52,599 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 154 to 141. [2019-11-20 07:10:52,606 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 141 states. [2019-11-20 07:10:52,607 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 141 states to 141 states and 212 transitions. [2019-11-20 07:10:52,607 INFO L78 Accepts]: Start accepts. Automaton has 141 states and 212 transitions. Word has length 59 [2019-11-20 07:10:52,608 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 07:10:52,608 INFO L462 AbstractCegarLoop]: Abstraction has 141 states and 212 transitions. [2019-11-20 07:10:52,608 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-20 07:10:52,608 INFO L276 IsEmpty]: Start isEmpty. Operand 141 states and 212 transitions. [2019-11-20 07:10:52,609 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2019-11-20 07:10:52,609 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 07:10:52,609 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 07:10:52,610 INFO L410 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 07:10:52,610 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 07:10:52,610 INFO L82 PathProgramCache]: Analyzing trace with hash 376743775, now seen corresponding path program 1 times [2019-11-20 07:10:52,610 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 07:10:52,611 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [460069210] [2019-11-20 07:10:52,611 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 07:10:52,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 07:10:52,706 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 07:10:52,707 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [460069210] [2019-11-20 07:10:52,707 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 07:10:52,707 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-20 07:10:52,708 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1599664025] [2019-11-20 07:10:52,708 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-20 07:10:52,708 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 07:10:52,708 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-20 07:10:52,709 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-20 07:10:52,709 INFO L87 Difference]: Start difference. First operand 141 states and 212 transitions. Second operand 4 states. [2019-11-20 07:10:52,973 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 07:10:52,973 INFO L93 Difference]: Finished difference Result 276 states and 415 transitions. [2019-11-20 07:10:52,974 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-20 07:10:52,974 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 59 [2019-11-20 07:10:52,974 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 07:10:52,975 INFO L225 Difference]: With dead ends: 276 [2019-11-20 07:10:52,975 INFO L226 Difference]: Without dead ends: 154 [2019-11-20 07:10:52,976 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 07:10:52,976 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 154 states. [2019-11-20 07:10:52,981 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 154 to 141. [2019-11-20 07:10:52,981 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 141 states. [2019-11-20 07:10:52,982 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 141 states to 141 states and 211 transitions. [2019-11-20 07:10:52,982 INFO L78 Accepts]: Start accepts. Automaton has 141 states and 211 transitions. Word has length 59 [2019-11-20 07:10:52,983 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 07:10:52,983 INFO L462 AbstractCegarLoop]: Abstraction has 141 states and 211 transitions. [2019-11-20 07:10:52,983 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-20 07:10:52,983 INFO L276 IsEmpty]: Start isEmpty. Operand 141 states and 211 transitions. [2019-11-20 07:10:52,984 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2019-11-20 07:10:52,984 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 07:10:52,984 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 07:10:52,984 INFO L410 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 07:10:52,984 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 07:10:52,984 INFO L82 PathProgramCache]: Analyzing trace with hash 1718254146, now seen corresponding path program 1 times [2019-11-20 07:10:52,984 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 07:10:52,985 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [658587518] [2019-11-20 07:10:52,985 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 07:10:52,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 07:10:53,036 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 07:10:53,036 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [658587518] [2019-11-20 07:10:53,036 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 07:10:53,037 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-20 07:10:53,037 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [607458853] [2019-11-20 07:10:53,037 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-20 07:10:53,037 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 07:10:53,038 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-20 07:10:53,038 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-20 07:10:53,038 INFO L87 Difference]: Start difference. First operand 141 states and 211 transitions. Second operand 4 states. [2019-11-20 07:10:53,260 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 07:10:53,261 INFO L93 Difference]: Finished difference Result 276 states and 414 transitions. [2019-11-20 07:10:53,261 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-20 07:10:53,261 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 60 [2019-11-20 07:10:53,261 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 07:10:53,262 INFO L225 Difference]: With dead ends: 276 [2019-11-20 07:10:53,262 INFO L226 Difference]: Without dead ends: 154 [2019-11-20 07:10:53,263 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 07:10:53,263 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 154 states. [2019-11-20 07:10:53,267 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 154 to 141. [2019-11-20 07:10:53,267 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 141 states. [2019-11-20 07:10:53,268 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 141 states to 141 states and 210 transitions. [2019-11-20 07:10:53,268 INFO L78 Accepts]: Start accepts. Automaton has 141 states and 210 transitions. Word has length 60 [2019-11-20 07:10:53,268 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 07:10:53,269 INFO L462 AbstractCegarLoop]: Abstraction has 141 states and 210 transitions. [2019-11-20 07:10:53,269 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-20 07:10:53,269 INFO L276 IsEmpty]: Start isEmpty. Operand 141 states and 210 transitions. [2019-11-20 07:10:53,270 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2019-11-20 07:10:53,270 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 07:10:53,270 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 07:10:53,270 INFO L410 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 07:10:53,271 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 07:10:53,271 INFO L82 PathProgramCache]: Analyzing trace with hash 316605892, now seen corresponding path program 1 times [2019-11-20 07:10:53,271 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 07:10:53,271 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1008664542] [2019-11-20 07:10:53,271 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 07:10:53,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 07:10:53,350 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 07:10:53,350 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1008664542] [2019-11-20 07:10:53,350 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 07:10:53,351 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-20 07:10:53,351 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [142109185] [2019-11-20 07:10:53,351 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-20 07:10:53,351 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 07:10:53,352 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-20 07:10:53,352 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-20 07:10:53,352 INFO L87 Difference]: Start difference. First operand 141 states and 210 transitions. Second operand 4 states. [2019-11-20 07:10:53,665 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 07:10:53,666 INFO L93 Difference]: Finished difference Result 276 states and 413 transitions. [2019-11-20 07:10:53,666 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-20 07:10:53,666 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 61 [2019-11-20 07:10:53,666 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 07:10:53,667 INFO L225 Difference]: With dead ends: 276 [2019-11-20 07:10:53,668 INFO L226 Difference]: Without dead ends: 154 [2019-11-20 07:10:53,668 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 07:10:53,669 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 154 states. [2019-11-20 07:10:53,673 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 154 to 141. [2019-11-20 07:10:53,673 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 141 states. [2019-11-20 07:10:53,674 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 141 states to 141 states and 209 transitions. [2019-11-20 07:10:53,674 INFO L78 Accepts]: Start accepts. Automaton has 141 states and 209 transitions. Word has length 61 [2019-11-20 07:10:53,674 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 07:10:53,674 INFO L462 AbstractCegarLoop]: Abstraction has 141 states and 209 transitions. [2019-11-20 07:10:53,674 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-20 07:10:53,674 INFO L276 IsEmpty]: Start isEmpty. Operand 141 states and 209 transitions. [2019-11-20 07:10:53,676 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2019-11-20 07:10:53,676 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 07:10:53,676 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 07:10:53,676 INFO L410 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 07:10:53,677 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 07:10:53,677 INFO L82 PathProgramCache]: Analyzing trace with hash -223613817, now seen corresponding path program 1 times [2019-11-20 07:10:53,677 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 07:10:53,677 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1612873144] [2019-11-20 07:10:53,677 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 07:10:53,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 07:10:53,770 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 07:10:53,771 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1612873144] [2019-11-20 07:10:53,771 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 07:10:53,771 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-20 07:10:53,772 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1274457778] [2019-11-20 07:10:53,772 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-20 07:10:53,772 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 07:10:53,772 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-20 07:10:53,773 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-20 07:10:53,773 INFO L87 Difference]: Start difference. First operand 141 states and 209 transitions. Second operand 4 states. [2019-11-20 07:10:54,024 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 07:10:54,024 INFO L93 Difference]: Finished difference Result 266 states and 399 transitions. [2019-11-20 07:10:54,025 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-20 07:10:54,025 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 62 [2019-11-20 07:10:54,025 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 07:10:54,026 INFO L225 Difference]: With dead ends: 266 [2019-11-20 07:10:54,026 INFO L226 Difference]: Without dead ends: 144 [2019-11-20 07:10:54,027 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 07:10:54,027 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 144 states. [2019-11-20 07:10:54,030 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 144 to 141. [2019-11-20 07:10:54,031 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 141 states. [2019-11-20 07:10:54,031 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 141 states to 141 states and 208 transitions. [2019-11-20 07:10:54,031 INFO L78 Accepts]: Start accepts. Automaton has 141 states and 208 transitions. Word has length 62 [2019-11-20 07:10:54,032 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 07:10:54,032 INFO L462 AbstractCegarLoop]: Abstraction has 141 states and 208 transitions. [2019-11-20 07:10:54,033 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-20 07:10:54,033 INFO L276 IsEmpty]: Start isEmpty. Operand 141 states and 208 transitions. [2019-11-20 07:10:54,034 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2019-11-20 07:10:54,034 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 07:10:54,034 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 07:10:54,034 INFO L410 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 07:10:54,035 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 07:10:54,035 INFO L82 PathProgramCache]: Analyzing trace with hash 176537583, now seen corresponding path program 1 times [2019-11-20 07:10:54,035 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 07:10:54,035 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1304288204] [2019-11-20 07:10:54,036 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 07:10:54,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 07:10:54,106 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 07:10:54,107 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1304288204] [2019-11-20 07:10:54,108 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 07:10:54,114 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-20 07:10:54,114 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1533258937] [2019-11-20 07:10:54,115 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-20 07:10:54,115 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 07:10:54,116 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-20 07:10:54,116 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-20 07:10:54,117 INFO L87 Difference]: Start difference. First operand 141 states and 208 transitions. Second operand 4 states. [2019-11-20 07:10:54,408 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 07:10:54,408 INFO L93 Difference]: Finished difference Result 307 states and 462 transitions. [2019-11-20 07:10:54,408 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-20 07:10:54,409 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 62 [2019-11-20 07:10:54,409 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 07:10:54,410 INFO L225 Difference]: With dead ends: 307 [2019-11-20 07:10:54,410 INFO L226 Difference]: Without dead ends: 185 [2019-11-20 07:10:54,411 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 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 07:10:54,411 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 185 states. [2019-11-20 07:10:54,415 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 185 to 163. [2019-11-20 07:10:54,415 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 163 states. [2019-11-20 07:10:54,416 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 163 states to 163 states and 246 transitions. [2019-11-20 07:10:54,416 INFO L78 Accepts]: Start accepts. Automaton has 163 states and 246 transitions. Word has length 62 [2019-11-20 07:10:54,416 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 07:10:54,416 INFO L462 AbstractCegarLoop]: Abstraction has 163 states and 246 transitions. [2019-11-20 07:10:54,416 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-20 07:10:54,417 INFO L276 IsEmpty]: Start isEmpty. Operand 163 states and 246 transitions. [2019-11-20 07:10:54,417 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2019-11-20 07:10:54,417 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 07:10:54,418 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 07:10:54,418 INFO L410 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 07:10:54,418 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 07:10:54,418 INFO L82 PathProgramCache]: Analyzing trace with hash 551995766, now seen corresponding path program 1 times [2019-11-20 07:10:54,418 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 07:10:54,418 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1499040833] [2019-11-20 07:10:54,419 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 07:10:54,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 07:10:54,471 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 30 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 07:10:54,472 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1499040833] [2019-11-20 07:10:54,472 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 07:10:54,472 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-20 07:10:54,472 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1851902123] [2019-11-20 07:10:54,473 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-20 07:10:54,473 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 07:10:54,473 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-20 07:10:54,473 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-20 07:10:54,473 INFO L87 Difference]: Start difference. First operand 163 states and 246 transitions. Second operand 4 states. [2019-11-20 07:10:54,767 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 07:10:54,767 INFO L93 Difference]: Finished difference Result 329 states and 499 transitions. [2019-11-20 07:10:54,767 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-20 07:10:54,767 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 75 [2019-11-20 07:10:54,767 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 07:10:54,768 INFO L225 Difference]: With dead ends: 329 [2019-11-20 07:10:54,768 INFO L226 Difference]: Without dead ends: 185 [2019-11-20 07:10:54,769 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 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 07:10:54,769 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 185 states. [2019-11-20 07:10:54,773 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 185 to 163. [2019-11-20 07:10:54,773 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 163 states. [2019-11-20 07:10:54,774 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 163 states to 163 states and 245 transitions. [2019-11-20 07:10:54,774 INFO L78 Accepts]: Start accepts. Automaton has 163 states and 245 transitions. Word has length 75 [2019-11-20 07:10:54,774 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 07:10:54,774 INFO L462 AbstractCegarLoop]: Abstraction has 163 states and 245 transitions. [2019-11-20 07:10:54,774 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-20 07:10:54,775 INFO L276 IsEmpty]: Start isEmpty. Operand 163 states and 245 transitions. [2019-11-20 07:10:54,775 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2019-11-20 07:10:54,775 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 07:10:54,775 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 07:10:54,776 INFO L410 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 07:10:54,776 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 07:10:54,776 INFO L82 PathProgramCache]: Analyzing trace with hash -475509842, now seen corresponding path program 1 times [2019-11-20 07:10:54,776 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 07:10:54,776 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [303069760] [2019-11-20 07:10:54,776 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 07:10:54,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 07:10:54,848 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 20 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 07:10:54,850 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [303069760] [2019-11-20 07:10:54,853 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 07:10:54,853 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-20 07:10:54,853 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1478386512] [2019-11-20 07:10:54,854 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-20 07:10:54,854 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 07:10:54,854 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-20 07:10:54,854 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-20 07:10:54,854 INFO L87 Difference]: Start difference. First operand 163 states and 245 transitions. Second operand 4 states. [2019-11-20 07:10:55,169 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 07:10:55,170 INFO L93 Difference]: Finished difference Result 328 states and 496 transitions. [2019-11-20 07:10:55,170 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-20 07:10:55,170 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 76 [2019-11-20 07:10:55,171 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 07:10:55,172 INFO L225 Difference]: With dead ends: 328 [2019-11-20 07:10:55,172 INFO L226 Difference]: Without dead ends: 184 [2019-11-20 07:10:55,172 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 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 07:10:55,173 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 184 states. [2019-11-20 07:10:55,179 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 184 to 163. [2019-11-20 07:10:55,179 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 163 states. [2019-11-20 07:10:55,180 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 163 states to 163 states and 244 transitions. [2019-11-20 07:10:55,180 INFO L78 Accepts]: Start accepts. Automaton has 163 states and 244 transitions. Word has length 76 [2019-11-20 07:10:55,180 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 07:10:55,180 INFO L462 AbstractCegarLoop]: Abstraction has 163 states and 244 transitions. [2019-11-20 07:10:55,181 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-20 07:10:55,181 INFO L276 IsEmpty]: Start isEmpty. Operand 163 states and 244 transitions. [2019-11-20 07:10:55,181 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2019-11-20 07:10:55,182 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 07:10:55,183 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 07:10:55,184 INFO L410 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 07:10:55,184 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 07:10:55,184 INFO L82 PathProgramCache]: Analyzing trace with hash 867683609, now seen corresponding path program 1 times [2019-11-20 07:10:55,184 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 07:10:55,185 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1676245204] [2019-11-20 07:10:55,185 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 07:10:55,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 07:10:55,235 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 32 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 07:10:55,236 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1676245204] [2019-11-20 07:10:55,236 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 07:10:55,237 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-20 07:10:55,237 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1104867515] [2019-11-20 07:10:55,237 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-20 07:10:55,237 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 07:10:55,238 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-20 07:10:55,238 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-20 07:10:55,238 INFO L87 Difference]: Start difference. First operand 163 states and 244 transitions. Second operand 4 states. [2019-11-20 07:10:55,547 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 07:10:55,547 INFO L93 Difference]: Finished difference Result 326 states and 492 transitions. [2019-11-20 07:10:55,548 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-20 07:10:55,548 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 76 [2019-11-20 07:10:55,548 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 07:10:55,549 INFO L225 Difference]: With dead ends: 326 [2019-11-20 07:10:55,549 INFO L226 Difference]: Without dead ends: 182 [2019-11-20 07:10:55,550 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 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 07:10:55,550 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 182 states. [2019-11-20 07:10:55,554 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 182 to 163. [2019-11-20 07:10:55,554 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 163 states. [2019-11-20 07:10:55,554 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 163 states to 163 states and 243 transitions. [2019-11-20 07:10:55,555 INFO L78 Accepts]: Start accepts. Automaton has 163 states and 243 transitions. Word has length 76 [2019-11-20 07:10:55,555 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 07:10:55,555 INFO L462 AbstractCegarLoop]: Abstraction has 163 states and 243 transitions. [2019-11-20 07:10:55,555 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-20 07:10:55,555 INFO L276 IsEmpty]: Start isEmpty. Operand 163 states and 243 transitions. [2019-11-20 07:10:55,556 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2019-11-20 07:10:55,556 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 07:10:55,557 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 07:10:55,558 INFO L410 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 07:10:55,558 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 07:10:55,560 INFO L82 PathProgramCache]: Analyzing trace with hash 1817031769, now seen corresponding path program 1 times [2019-11-20 07:10:55,561 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 07:10:55,561 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1330252009] [2019-11-20 07:10:55,562 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 07:10:55,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 07:10:55,623 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 34 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 07:10:55,623 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1330252009] [2019-11-20 07:10:55,624 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 07:10:55,624 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-20 07:10:55,624 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1485323387] [2019-11-20 07:10:55,624 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-20 07:10:55,625 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 07:10:55,625 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-20 07:10:55,625 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-20 07:10:55,625 INFO L87 Difference]: Start difference. First operand 163 states and 243 transitions. Second operand 4 states. [2019-11-20 07:10:55,998 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 07:10:55,998 INFO L93 Difference]: Finished difference Result 325 states and 489 transitions. [2019-11-20 07:10:55,999 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-20 07:10:55,999 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 76 [2019-11-20 07:10:55,999 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 07:10:56,000 INFO L225 Difference]: With dead ends: 325 [2019-11-20 07:10:56,000 INFO L226 Difference]: Without dead ends: 181 [2019-11-20 07:10:56,001 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 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 07:10:56,001 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 181 states. [2019-11-20 07:10:56,005 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 181 to 163. [2019-11-20 07:10:56,005 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 163 states. [2019-11-20 07:10:56,006 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 163 states to 163 states and 242 transitions. [2019-11-20 07:10:56,006 INFO L78 Accepts]: Start accepts. Automaton has 163 states and 242 transitions. Word has length 76 [2019-11-20 07:10:56,006 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 07:10:56,006 INFO L462 AbstractCegarLoop]: Abstraction has 163 states and 242 transitions. [2019-11-20 07:10:56,006 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-20 07:10:56,006 INFO L276 IsEmpty]: Start isEmpty. Operand 163 states and 242 transitions. [2019-11-20 07:10:56,007 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2019-11-20 07:10:56,007 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 07:10:56,007 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 07:10:56,007 INFO L410 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 07:10:56,008 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 07:10:56,008 INFO L82 PathProgramCache]: Analyzing trace with hash 362500930, now seen corresponding path program 1 times [2019-11-20 07:10:56,008 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 07:10:56,009 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1077989521] [2019-11-20 07:10:56,009 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 07:10:56,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 07:10:56,049 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 22 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 07:10:56,049 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1077989521] [2019-11-20 07:10:56,049 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 07:10:56,050 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-20 07:10:56,050 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [39176549] [2019-11-20 07:10:56,050 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-20 07:10:56,050 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 07:10:56,051 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-20 07:10:56,051 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-20 07:10:56,051 INFO L87 Difference]: Start difference. First operand 163 states and 242 transitions. Second operand 4 states. [2019-11-20 07:10:56,351 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 07:10:56,352 INFO L93 Difference]: Finished difference Result 325 states and 487 transitions. [2019-11-20 07:10:56,352 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-20 07:10:56,352 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 76 [2019-11-20 07:10:56,352 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 07:10:56,354 INFO L225 Difference]: With dead ends: 325 [2019-11-20 07:10:56,354 INFO L226 Difference]: Without dead ends: 181 [2019-11-20 07:10:56,354 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 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 07:10:56,355 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 181 states. [2019-11-20 07:10:56,358 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 181 to 163. [2019-11-20 07:10:56,358 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 163 states. [2019-11-20 07:10:56,359 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 163 states to 163 states and 241 transitions. [2019-11-20 07:10:56,359 INFO L78 Accepts]: Start accepts. Automaton has 163 states and 241 transitions. Word has length 76 [2019-11-20 07:10:56,359 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 07:10:56,359 INFO L462 AbstractCegarLoop]: Abstraction has 163 states and 241 transitions. [2019-11-20 07:10:56,359 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-20 07:10:56,360 INFO L276 IsEmpty]: Start isEmpty. Operand 163 states and 241 transitions. [2019-11-20 07:10:56,361 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2019-11-20 07:10:56,361 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 07:10:56,361 INFO L410 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 07:10:56,361 INFO L410 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 07:10:56,361 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 07:10:56,361 INFO L82 PathProgramCache]: Analyzing trace with hash 1276725951, now seen corresponding path program 1 times [2019-11-20 07:10:56,362 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 07:10:56,362 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1890946360] [2019-11-20 07:10:56,362 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 07:10:56,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 07:10:56,406 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 24 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 07:10:56,406 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1890946360] [2019-11-20 07:10:56,408 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 07:10:56,408 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-20 07:10:56,409 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [728210076] [2019-11-20 07:10:56,409 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-20 07:10:56,409 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 07:10:56,409 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-20 07:10:56,410 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-20 07:10:56,410 INFO L87 Difference]: Start difference. First operand 163 states and 241 transitions. Second operand 4 states. [2019-11-20 07:10:56,697 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 07:10:56,698 INFO L93 Difference]: Finished difference Result 325 states and 485 transitions. [2019-11-20 07:10:56,698 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-20 07:10:56,698 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 77 [2019-11-20 07:10:56,698 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 07:10:56,699 INFO L225 Difference]: With dead ends: 325 [2019-11-20 07:10:56,699 INFO L226 Difference]: Without dead ends: 181 [2019-11-20 07:10:56,700 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 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 07:10:56,700 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 181 states. [2019-11-20 07:10:56,704 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 181 to 163. [2019-11-20 07:10:56,704 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 163 states. [2019-11-20 07:10:56,705 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 163 states to 163 states and 240 transitions. [2019-11-20 07:10:56,705 INFO L78 Accepts]: Start accepts. Automaton has 163 states and 240 transitions. Word has length 77 [2019-11-20 07:10:56,705 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 07:10:56,705 INFO L462 AbstractCegarLoop]: Abstraction has 163 states and 240 transitions. [2019-11-20 07:10:56,705 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-20 07:10:56,705 INFO L276 IsEmpty]: Start isEmpty. Operand 163 states and 240 transitions. [2019-11-20 07:10:56,706 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2019-11-20 07:10:56,706 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 07:10:56,706 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 07:10:56,706 INFO L410 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 07:10:56,706 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 07:10:56,706 INFO L82 PathProgramCache]: Analyzing trace with hash -485866265, now seen corresponding path program 1 times [2019-11-20 07:10:56,707 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 07:10:56,707 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1929087099] [2019-11-20 07:10:56,707 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 07:10:56,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 07:10:56,755 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 26 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 07:10:56,755 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1929087099] [2019-11-20 07:10:56,755 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 07:10:56,755 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-20 07:10:56,755 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1681354851] [2019-11-20 07:10:56,756 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-20 07:10:56,756 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 07:10:56,756 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-20 07:10:56,756 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-20 07:10:56,756 INFO L87 Difference]: Start difference. First operand 163 states and 240 transitions. Second operand 4 states. [2019-11-20 07:10:57,049 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 07:10:57,049 INFO L93 Difference]: Finished difference Result 325 states and 483 transitions. [2019-11-20 07:10:57,050 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-20 07:10:57,050 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 78 [2019-11-20 07:10:57,050 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 07:10:57,051 INFO L225 Difference]: With dead ends: 325 [2019-11-20 07:10:57,051 INFO L226 Difference]: Without dead ends: 181 [2019-11-20 07:10:57,052 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 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 07:10:57,052 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 181 states. [2019-11-20 07:10:57,055 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 181 to 163. [2019-11-20 07:10:57,055 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 163 states. [2019-11-20 07:10:57,056 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 163 states to 163 states and 239 transitions. [2019-11-20 07:10:57,056 INFO L78 Accepts]: Start accepts. Automaton has 163 states and 239 transitions. Word has length 78 [2019-11-20 07:10:57,056 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 07:10:57,056 INFO L462 AbstractCegarLoop]: Abstraction has 163 states and 239 transitions. [2019-11-20 07:10:57,057 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-20 07:10:57,057 INFO L276 IsEmpty]: Start isEmpty. Operand 163 states and 239 transitions. [2019-11-20 07:10:57,057 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2019-11-20 07:10:57,057 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 07:10:57,058 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 07:10:57,058 INFO L410 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 07:10:57,058 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 07:10:57,058 INFO L82 PathProgramCache]: Analyzing trace with hash 669553092, now seen corresponding path program 1 times [2019-11-20 07:10:57,058 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 07:10:57,058 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [71324850] [2019-11-20 07:10:57,058 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 07:10:57,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 07:10:57,108 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 28 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 07:10:57,109 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [71324850] [2019-11-20 07:10:57,109 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 07:10:57,109 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-20 07:10:57,109 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1771949777] [2019-11-20 07:10:57,110 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-20 07:10:57,110 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 07:10:57,110 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-20 07:10:57,110 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-20 07:10:57,110 INFO L87 Difference]: Start difference. First operand 163 states and 239 transitions. Second operand 4 states. [2019-11-20 07:10:57,352 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 07:10:57,353 INFO L93 Difference]: Finished difference Result 315 states and 468 transitions. [2019-11-20 07:10:57,353 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-20 07:10:57,353 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 79 [2019-11-20 07:10:57,353 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 07:10:57,354 INFO L225 Difference]: With dead ends: 315 [2019-11-20 07:10:57,354 INFO L226 Difference]: Without dead ends: 171 [2019-11-20 07:10:57,355 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 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 07:10:57,355 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 171 states. [2019-11-20 07:10:57,359 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 171 to 163. [2019-11-20 07:10:57,359 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 163 states. [2019-11-20 07:10:57,359 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 163 states to 163 states and 238 transitions. [2019-11-20 07:10:57,360 INFO L78 Accepts]: Start accepts. Automaton has 163 states and 238 transitions. Word has length 79 [2019-11-20 07:10:57,360 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 07:10:57,360 INFO L462 AbstractCegarLoop]: Abstraction has 163 states and 238 transitions. [2019-11-20 07:10:57,360 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-20 07:10:57,360 INFO L276 IsEmpty]: Start isEmpty. Operand 163 states and 238 transitions. [2019-11-20 07:10:57,361 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2019-11-20 07:10:57,361 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 07:10:57,361 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 07:10:57,361 INFO L410 AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 07:10:57,361 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 07:10:57,361 INFO L82 PathProgramCache]: Analyzing trace with hash 719124867, now seen corresponding path program 1 times [2019-11-20 07:10:57,362 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 07:10:57,362 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [300221743] [2019-11-20 07:10:57,362 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 07:10:57,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 07:10:57,435 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 28 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-11-20 07:10:57,436 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [300221743] [2019-11-20 07:10:57,436 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 07:10:57,436 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-20 07:10:57,437 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [988038779] [2019-11-20 07:10:57,437 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-20 07:10:57,437 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 07:10:57,437 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-20 07:10:57,438 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-20 07:10:57,438 INFO L87 Difference]: Start difference. First operand 163 states and 238 transitions. Second operand 4 states. [2019-11-20 07:10:57,861 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 07:10:57,861 INFO L93 Difference]: Finished difference Result 403 states and 603 transitions. [2019-11-20 07:10:57,862 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-20 07:10:57,862 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 84 [2019-11-20 07:10:57,862 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 07:10:57,864 INFO L225 Difference]: With dead ends: 403 [2019-11-20 07:10:57,864 INFO L226 Difference]: Without dead ends: 259 [2019-11-20 07:10:57,864 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 07:10:57,865 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 259 states. [2019-11-20 07:10:57,870 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 259 to 206. [2019-11-20 07:10:57,870 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 206 states. [2019-11-20 07:10:57,871 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 206 states to 206 states and 316 transitions. [2019-11-20 07:10:57,871 INFO L78 Accepts]: Start accepts. Automaton has 206 states and 316 transitions. Word has length 84 [2019-11-20 07:10:57,871 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 07:10:57,871 INFO L462 AbstractCegarLoop]: Abstraction has 206 states and 316 transitions. [2019-11-20 07:10:57,871 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-20 07:10:57,871 INFO L276 IsEmpty]: Start isEmpty. Operand 206 states and 316 transitions. [2019-11-20 07:10:57,872 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2019-11-20 07:10:57,872 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 07:10:57,873 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 07:10:57,873 INFO L410 AbstractCegarLoop]: === Iteration 20 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 07:10:57,873 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 07:10:57,873 INFO L82 PathProgramCache]: Analyzing trace with hash -178268411, now seen corresponding path program 1 times [2019-11-20 07:10:57,873 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 07:10:57,874 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2012638640] [2019-11-20 07:10:57,874 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 07:10:57,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 07:10:57,931 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 28 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-11-20 07:10:57,931 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2012638640] [2019-11-20 07:10:57,931 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 07:10:57,931 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-20 07:10:57,931 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [488033870] [2019-11-20 07:10:57,932 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-20 07:10:57,932 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 07:10:57,932 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-20 07:10:57,933 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-20 07:10:57,933 INFO L87 Difference]: Start difference. First operand 206 states and 316 transitions. Second operand 4 states. [2019-11-20 07:10:58,328 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 07:10:58,328 INFO L93 Difference]: Finished difference Result 443 states and 687 transitions. [2019-11-20 07:10:58,328 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-20 07:10:58,328 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 84 [2019-11-20 07:10:58,329 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 07:10:58,330 INFO L225 Difference]: With dead ends: 443 [2019-11-20 07:10:58,330 INFO L226 Difference]: Without dead ends: 256 [2019-11-20 07:10:58,331 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 07:10:58,331 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 256 states. [2019-11-20 07:10:58,337 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 256 to 230. [2019-11-20 07:10:58,337 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 230 states. [2019-11-20 07:10:58,338 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 230 states to 230 states and 358 transitions. [2019-11-20 07:10:58,338 INFO L78 Accepts]: Start accepts. Automaton has 230 states and 358 transitions. Word has length 84 [2019-11-20 07:10:58,339 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 07:10:58,339 INFO L462 AbstractCegarLoop]: Abstraction has 230 states and 358 transitions. [2019-11-20 07:10:58,339 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-20 07:10:58,339 INFO L276 IsEmpty]: Start isEmpty. Operand 230 states and 358 transitions. [2019-11-20 07:10:58,340 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2019-11-20 07:10:58,340 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 07:10:58,340 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 07:10:58,341 INFO L410 AbstractCegarLoop]: === Iteration 21 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 07:10:58,341 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 07:10:58,341 INFO L82 PathProgramCache]: Analyzing trace with hash 2081210466, now seen corresponding path program 1 times [2019-11-20 07:10:58,341 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 07:10:58,341 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [33183302] [2019-11-20 07:10:58,342 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 07:10:58,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 07:10:58,404 INFO L134 CoverageAnalysis]: Checked inductivity of 69 backedges. 58 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-11-20 07:10:58,404 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [33183302] [2019-11-20 07:10:58,404 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 07:10:58,405 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-20 07:10:58,406 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2128838965] [2019-11-20 07:10:58,407 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-20 07:10:58,407 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 07:10:58,407 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-20 07:10:58,407 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-20 07:10:58,408 INFO L87 Difference]: Start difference. First operand 230 states and 358 transitions. Second operand 4 states. [2019-11-20 07:10:58,847 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 07:10:58,847 INFO L93 Difference]: Finished difference Result 494 states and 764 transitions. [2019-11-20 07:10:58,847 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-20 07:10:58,848 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 97 [2019-11-20 07:10:58,848 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 07:10:58,849 INFO L225 Difference]: With dead ends: 494 [2019-11-20 07:10:58,850 INFO L226 Difference]: Without dead ends: 283 [2019-11-20 07:10:58,850 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 07:10:58,851 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 283 states. [2019-11-20 07:10:58,856 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 283 to 230. [2019-11-20 07:10:58,856 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 230 states. [2019-11-20 07:10:58,857 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 230 states to 230 states and 357 transitions. [2019-11-20 07:10:58,857 INFO L78 Accepts]: Start accepts. Automaton has 230 states and 357 transitions. Word has length 97 [2019-11-20 07:10:58,857 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 07:10:58,858 INFO L462 AbstractCegarLoop]: Abstraction has 230 states and 357 transitions. [2019-11-20 07:10:58,858 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-20 07:10:58,858 INFO L276 IsEmpty]: Start isEmpty. Operand 230 states and 357 transitions. [2019-11-20 07:10:58,859 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2019-11-20 07:10:58,859 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 07:10:58,859 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 07:10:58,859 INFO L410 AbstractCegarLoop]: === Iteration 22 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 07:10:58,860 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 07:10:58,860 INFO L82 PathProgramCache]: Analyzing trace with hash 2121885216, now seen corresponding path program 1 times [2019-11-20 07:10:58,860 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 07:10:58,860 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [256394788] [2019-11-20 07:10:58,860 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 07:10:58,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 07:10:58,917 INFO L134 CoverageAnalysis]: Checked inductivity of 69 backedges. 58 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-11-20 07:10:58,917 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [256394788] [2019-11-20 07:10:58,917 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 07:10:58,918 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-20 07:10:58,918 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [838916886] [2019-11-20 07:10:58,918 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-20 07:10:58,918 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 07:10:58,918 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-20 07:10:58,919 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-20 07:10:58,919 INFO L87 Difference]: Start difference. First operand 230 states and 357 transitions. Second operand 4 states. [2019-11-20 07:10:59,270 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 07:10:59,270 INFO L93 Difference]: Finished difference Result 467 states and 726 transitions. [2019-11-20 07:10:59,272 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-20 07:10:59,272 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 97 [2019-11-20 07:10:59,272 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 07:10:59,273 INFO L225 Difference]: With dead ends: 467 [2019-11-20 07:10:59,274 INFO L226 Difference]: Without dead ends: 256 [2019-11-20 07:10:59,274 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 07:10:59,275 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 256 states. [2019-11-20 07:10:59,280 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 256 to 230. [2019-11-20 07:10:59,280 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 230 states. [2019-11-20 07:10:59,281 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 230 states to 230 states and 356 transitions. [2019-11-20 07:10:59,281 INFO L78 Accepts]: Start accepts. Automaton has 230 states and 356 transitions. Word has length 97 [2019-11-20 07:10:59,281 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 07:10:59,281 INFO L462 AbstractCegarLoop]: Abstraction has 230 states and 356 transitions. [2019-11-20 07:10:59,281 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-20 07:10:59,281 INFO L276 IsEmpty]: Start isEmpty. Operand 230 states and 356 transitions. [2019-11-20 07:10:59,282 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2019-11-20 07:10:59,282 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 07:10:59,283 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 07:10:59,283 INFO L410 AbstractCegarLoop]: === Iteration 23 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 07:10:59,283 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 07:10:59,283 INFO L82 PathProgramCache]: Analyzing trace with hash -314494398, now seen corresponding path program 1 times [2019-11-20 07:10:59,283 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 07:10:59,283 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [8129773] [2019-11-20 07:10:59,284 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 07:10:59,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 07:10:59,338 INFO L134 CoverageAnalysis]: Checked inductivity of 54 backedges. 43 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-11-20 07:10:59,338 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [8129773] [2019-11-20 07:10:59,339 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 07:10:59,339 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-20 07:10:59,340 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [784346450] [2019-11-20 07:10:59,340 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-20 07:10:59,340 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 07:10:59,341 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-20 07:10:59,341 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-20 07:10:59,341 INFO L87 Difference]: Start difference. First operand 230 states and 356 transitions. Second operand 4 states. [2019-11-20 07:10:59,711 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 07:10:59,711 INFO L93 Difference]: Finished difference Result 493 states and 759 transitions. [2019-11-20 07:10:59,711 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-20 07:10:59,712 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 98 [2019-11-20 07:10:59,712 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 07:10:59,713 INFO L225 Difference]: With dead ends: 493 [2019-11-20 07:10:59,713 INFO L226 Difference]: Without dead ends: 282 [2019-11-20 07:10:59,713 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 07:10:59,714 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 282 states. [2019-11-20 07:10:59,718 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 282 to 230. [2019-11-20 07:10:59,718 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 230 states. [2019-11-20 07:10:59,719 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 230 states to 230 states and 355 transitions. [2019-11-20 07:10:59,719 INFO L78 Accepts]: Start accepts. Automaton has 230 states and 355 transitions. Word has length 98 [2019-11-20 07:10:59,719 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 07:10:59,720 INFO L462 AbstractCegarLoop]: Abstraction has 230 states and 355 transitions. [2019-11-20 07:10:59,720 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-20 07:10:59,720 INFO L276 IsEmpty]: Start isEmpty. Operand 230 states and 355 transitions. [2019-11-20 07:10:59,721 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2019-11-20 07:10:59,721 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 07:10:59,721 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 07:10:59,721 INFO L410 AbstractCegarLoop]: === Iteration 24 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 07:10:59,721 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 07:10:59,721 INFO L82 PathProgramCache]: Analyzing trace with hash 1028699053, now seen corresponding path program 1 times [2019-11-20 07:10:59,722 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 07:10:59,722 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [103165502] [2019-11-20 07:10:59,722 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 07:10:59,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 07:10:59,782 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 61 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-11-20 07:10:59,782 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [103165502] [2019-11-20 07:10:59,782 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 07:10:59,782 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-20 07:10:59,783 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [549084113] [2019-11-20 07:10:59,783 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-20 07:10:59,783 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 07:10:59,783 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-20 07:10:59,784 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-20 07:10:59,784 INFO L87 Difference]: Start difference. First operand 230 states and 355 transitions. Second operand 4 states. [2019-11-20 07:11:00,089 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 07:11:00,089 INFO L93 Difference]: Finished difference Result 491 states and 755 transitions. [2019-11-20 07:11:00,089 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-20 07:11:00,089 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 98 [2019-11-20 07:11:00,090 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 07:11:00,091 INFO L225 Difference]: With dead ends: 491 [2019-11-20 07:11:00,091 INFO L226 Difference]: Without dead ends: 280 [2019-11-20 07:11:00,092 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 07:11:00,092 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 280 states. [2019-11-20 07:11:00,097 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 280 to 230. [2019-11-20 07:11:00,097 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 230 states. [2019-11-20 07:11:00,098 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 230 states to 230 states and 354 transitions. [2019-11-20 07:11:00,098 INFO L78 Accepts]: Start accepts. Automaton has 230 states and 354 transitions. Word has length 98 [2019-11-20 07:11:00,098 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 07:11:00,098 INFO L462 AbstractCegarLoop]: Abstraction has 230 states and 354 transitions. [2019-11-20 07:11:00,098 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-20 07:11:00,098 INFO L276 IsEmpty]: Start isEmpty. Operand 230 states and 354 transitions. [2019-11-20 07:11:00,099 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2019-11-20 07:11:00,099 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 07:11:00,100 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 07:11:00,100 INFO L410 AbstractCegarLoop]: === Iteration 25 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 07:11:00,100 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 07:11:00,100 INFO L82 PathProgramCache]: Analyzing trace with hash 1978047213, now seen corresponding path program 1 times [2019-11-20 07:11:00,100 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 07:11:00,100 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [542391787] [2019-11-20 07:11:00,101 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 07:11:00,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 07:11:00,158 INFO L134 CoverageAnalysis]: Checked inductivity of 75 backedges. 64 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-11-20 07:11:00,159 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [542391787] [2019-11-20 07:11:00,159 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 07:11:00,159 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-20 07:11:00,159 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [841320144] [2019-11-20 07:11:00,160 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-20 07:11:00,160 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 07:11:00,160 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-20 07:11:00,160 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-20 07:11:00,160 INFO L87 Difference]: Start difference. First operand 230 states and 354 transitions. Second operand 4 states. [2019-11-20 07:11:00,569 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 07:11:00,569 INFO L93 Difference]: Finished difference Result 490 states and 752 transitions. [2019-11-20 07:11:00,569 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-20 07:11:00,569 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 98 [2019-11-20 07:11:00,570 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 07:11:00,571 INFO L225 Difference]: With dead ends: 490 [2019-11-20 07:11:00,571 INFO L226 Difference]: Without dead ends: 279 [2019-11-20 07:11:00,572 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 07:11:00,572 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 279 states. [2019-11-20 07:11:00,577 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 279 to 230. [2019-11-20 07:11:00,577 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 230 states. [2019-11-20 07:11:00,578 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 230 states to 230 states and 353 transitions. [2019-11-20 07:11:00,578 INFO L78 Accepts]: Start accepts. Automaton has 230 states and 353 transitions. Word has length 98 [2019-11-20 07:11:00,578 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 07:11:00,578 INFO L462 AbstractCegarLoop]: Abstraction has 230 states and 353 transitions. [2019-11-20 07:11:00,578 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-20 07:11:00,578 INFO L276 IsEmpty]: Start isEmpty. Operand 230 states and 353 transitions. [2019-11-20 07:11:00,579 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2019-11-20 07:11:00,580 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 07:11:00,580 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 07:11:00,581 INFO L410 AbstractCegarLoop]: === Iteration 26 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 07:11:00,581 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 07:11:00,581 INFO L82 PathProgramCache]: Analyzing trace with hash 523516374, now seen corresponding path program 1 times [2019-11-20 07:11:00,581 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 07:11:00,581 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [148511433] [2019-11-20 07:11:00,582 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 07:11:00,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 07:11:00,677 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 39 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2019-11-20 07:11:00,678 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [148511433] [2019-11-20 07:11:00,678 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 07:11:00,678 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-20 07:11:00,678 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [277218799] [2019-11-20 07:11:00,679 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-20 07:11:00,679 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 07:11:00,680 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-20 07:11:00,680 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-20 07:11:00,680 INFO L87 Difference]: Start difference. First operand 230 states and 353 transitions. Second operand 5 states. [2019-11-20 07:11:01,127 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 07:11:01,127 INFO L93 Difference]: Finished difference Result 462 states and 714 transitions. [2019-11-20 07:11:01,136 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-20 07:11:01,136 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 98 [2019-11-20 07:11:01,137 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 07:11:01,138 INFO L225 Difference]: With dead ends: 462 [2019-11-20 07:11:01,139 INFO L226 Difference]: Without dead ends: 251 [2019-11-20 07:11:01,139 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-11-20 07:11:01,140 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 251 states. [2019-11-20 07:11:01,148 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 251 to 250. [2019-11-20 07:11:01,148 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 250 states. [2019-11-20 07:11:01,149 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 250 states to 250 states and 379 transitions. [2019-11-20 07:11:01,149 INFO L78 Accepts]: Start accepts. Automaton has 250 states and 379 transitions. Word has length 98 [2019-11-20 07:11:01,149 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 07:11:01,150 INFO L462 AbstractCegarLoop]: Abstraction has 250 states and 379 transitions. [2019-11-20 07:11:01,150 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-20 07:11:01,150 INFO L276 IsEmpty]: Start isEmpty. Operand 250 states and 379 transitions. [2019-11-20 07:11:01,151 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2019-11-20 07:11:01,151 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 07:11:01,152 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 07:11:01,152 INFO L410 AbstractCegarLoop]: === Iteration 27 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 07:11:01,152 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 07:11:01,153 INFO L82 PathProgramCache]: Analyzing trace with hash -2005350993, now seen corresponding path program 1 times [2019-11-20 07:11:01,153 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 07:11:01,153 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1421160644] [2019-11-20 07:11:01,153 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 07:11:01,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 07:11:01,226 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 61 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-11-20 07:11:01,227 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1421160644] [2019-11-20 07:11:01,227 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 07:11:01,227 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-20 07:11:01,228 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1231782865] [2019-11-20 07:11:01,228 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-20 07:11:01,228 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 07:11:01,229 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-20 07:11:01,229 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-20 07:11:01,229 INFO L87 Difference]: Start difference. First operand 250 states and 379 transitions. Second operand 4 states. [2019-11-20 07:11:01,548 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 07:11:01,548 INFO L93 Difference]: Finished difference Result 504 states and 766 transitions. [2019-11-20 07:11:01,549 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-20 07:11:01,549 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 98 [2019-11-20 07:11:01,549 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 07:11:01,550 INFO L225 Difference]: With dead ends: 504 [2019-11-20 07:11:01,551 INFO L226 Difference]: Without dead ends: 273 [2019-11-20 07:11:01,551 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 07:11:01,552 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 273 states. [2019-11-20 07:11:01,557 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 273 to 250. [2019-11-20 07:11:01,557 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 250 states. [2019-11-20 07:11:01,558 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 250 states to 250 states and 378 transitions. [2019-11-20 07:11:01,558 INFO L78 Accepts]: Start accepts. Automaton has 250 states and 378 transitions. Word has length 98 [2019-11-20 07:11:01,558 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 07:11:01,558 INFO L462 AbstractCegarLoop]: Abstraction has 250 states and 378 transitions. [2019-11-20 07:11:01,558 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-20 07:11:01,558 INFO L276 IsEmpty]: Start isEmpty. Operand 250 states and 378 transitions. [2019-11-20 07:11:01,559 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2019-11-20 07:11:01,559 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 07:11:01,559 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 07:11:01,559 INFO L410 AbstractCegarLoop]: === Iteration 28 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 07:11:01,560 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 07:11:01,560 INFO L82 PathProgramCache]: Analyzing trace with hash -1056002833, now seen corresponding path program 1 times [2019-11-20 07:11:01,560 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 07:11:01,561 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [733245827] [2019-11-20 07:11:01,561 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 07:11:01,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 07:11:01,622 INFO L134 CoverageAnalysis]: Checked inductivity of 75 backedges. 64 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-11-20 07:11:01,622 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [733245827] [2019-11-20 07:11:01,623 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 07:11:01,623 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-20 07:11:01,623 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1933405015] [2019-11-20 07:11:01,623 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-20 07:11:01,623 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 07:11:01,624 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-20 07:11:01,624 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-20 07:11:01,624 INFO L87 Difference]: Start difference. First operand 250 states and 378 transitions. Second operand 4 states. [2019-11-20 07:11:01,977 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 07:11:01,977 INFO L93 Difference]: Finished difference Result 503 states and 763 transitions. [2019-11-20 07:11:01,978 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-20 07:11:01,978 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 98 [2019-11-20 07:11:01,978 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 07:11:01,979 INFO L225 Difference]: With dead ends: 503 [2019-11-20 07:11:01,980 INFO L226 Difference]: Without dead ends: 272 [2019-11-20 07:11:01,980 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 07:11:01,981 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 272 states. [2019-11-20 07:11:01,986 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 272 to 250. [2019-11-20 07:11:01,986 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 250 states. [2019-11-20 07:11:01,986 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 250 states to 250 states and 377 transitions. [2019-11-20 07:11:01,987 INFO L78 Accepts]: Start accepts. Automaton has 250 states and 377 transitions. Word has length 98 [2019-11-20 07:11:01,987 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 07:11:01,987 INFO L462 AbstractCegarLoop]: Abstraction has 250 states and 377 transitions. [2019-11-20 07:11:01,987 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-20 07:11:01,987 INFO L276 IsEmpty]: Start isEmpty. Operand 250 states and 377 transitions. [2019-11-20 07:11:01,988 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2019-11-20 07:11:01,988 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 07:11:01,988 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 07:11:01,989 INFO L410 AbstractCegarLoop]: === Iteration 29 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 07:11:01,989 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 07:11:01,989 INFO L82 PathProgramCache]: Analyzing trace with hash -1449434210, now seen corresponding path program 1 times [2019-11-20 07:11:01,989 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 07:11:01,989 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1154643261] [2019-11-20 07:11:01,989 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 07:11:02,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 07:11:02,038 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 46 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-11-20 07:11:02,039 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1154643261] [2019-11-20 07:11:02,039 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 07:11:02,039 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-20 07:11:02,039 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2126173300] [2019-11-20 07:11:02,040 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-20 07:11:02,040 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 07:11:02,040 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-20 07:11:02,040 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-20 07:11:02,040 INFO L87 Difference]: Start difference. First operand 250 states and 377 transitions. Second operand 4 states. [2019-11-20 07:11:02,446 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 07:11:02,446 INFO L93 Difference]: Finished difference Result 530 states and 797 transitions. [2019-11-20 07:11:02,446 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-20 07:11:02,446 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 99 [2019-11-20 07:11:02,447 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 07:11:02,448 INFO L225 Difference]: With dead ends: 530 [2019-11-20 07:11:02,448 INFO L226 Difference]: Without dead ends: 299 [2019-11-20 07:11:02,449 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 07:11:02,450 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 299 states. [2019-11-20 07:11:02,455 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 299 to 250. [2019-11-20 07:11:02,455 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 250 states. [2019-11-20 07:11:02,455 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 250 states to 250 states and 376 transitions. [2019-11-20 07:11:02,456 INFO L78 Accepts]: Start accepts. Automaton has 250 states and 376 transitions. Word has length 99 [2019-11-20 07:11:02,456 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 07:11:02,456 INFO L462 AbstractCegarLoop]: Abstraction has 250 states and 376 transitions. [2019-11-20 07:11:02,457 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-20 07:11:02,457 INFO L276 IsEmpty]: Start isEmpty. Operand 250 states and 376 transitions. [2019-11-20 07:11:02,458 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2019-11-20 07:11:02,458 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 07:11:02,458 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 07:11:02,459 INFO L410 AbstractCegarLoop]: === Iteration 30 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 07:11:02,459 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 07:11:02,459 INFO L82 PathProgramCache]: Analyzing trace with hash -1015705124, now seen corresponding path program 1 times [2019-11-20 07:11:02,459 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 07:11:02,459 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1576945725] [2019-11-20 07:11:02,459 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 07:11:02,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 07:11:02,512 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 46 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-11-20 07:11:02,512 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1576945725] [2019-11-20 07:11:02,513 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 07:11:02,513 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-20 07:11:02,513 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [830622018] [2019-11-20 07:11:02,513 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-20 07:11:02,513 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 07:11:02,514 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-20 07:11:02,514 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-20 07:11:02,514 INFO L87 Difference]: Start difference. First operand 250 states and 376 transitions. Second operand 4 states. [2019-11-20 07:11:02,841 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 07:11:02,841 INFO L93 Difference]: Finished difference Result 503 states and 759 transitions. [2019-11-20 07:11:02,841 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-20 07:11:02,842 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 99 [2019-11-20 07:11:02,842 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 07:11:02,843 INFO L225 Difference]: With dead ends: 503 [2019-11-20 07:11:02,843 INFO L226 Difference]: Without dead ends: 272 [2019-11-20 07:11:02,844 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 07:11:02,844 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 272 states. [2019-11-20 07:11:02,850 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 272 to 250. [2019-11-20 07:11:02,850 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 250 states. [2019-11-20 07:11:02,851 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 250 states to 250 states and 375 transitions. [2019-11-20 07:11:02,851 INFO L78 Accepts]: Start accepts. Automaton has 250 states and 375 transitions. Word has length 99 [2019-11-20 07:11:02,852 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 07:11:02,852 INFO L462 AbstractCegarLoop]: Abstraction has 250 states and 375 transitions. [2019-11-20 07:11:02,852 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-20 07:11:02,852 INFO L276 IsEmpty]: Start isEmpty. Operand 250 states and 375 transitions. [2019-11-20 07:11:02,853 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2019-11-20 07:11:02,853 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 07:11:02,853 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 07:11:02,853 INFO L410 AbstractCegarLoop]: === Iteration 31 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 07:11:02,854 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 07:11:02,854 INFO L82 PathProgramCache]: Analyzing trace with hash 542245225, now seen corresponding path program 1 times [2019-11-20 07:11:02,854 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 07:11:02,854 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1002923029] [2019-11-20 07:11:02,854 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 07:11:02,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 07:11:02,908 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 49 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-11-20 07:11:02,909 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1002923029] [2019-11-20 07:11:02,909 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 07:11:02,909 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-20 07:11:02,909 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1019411682] [2019-11-20 07:11:02,909 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-20 07:11:02,910 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 07:11:02,910 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-20 07:11:02,910 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-20 07:11:02,910 INFO L87 Difference]: Start difference. First operand 250 states and 375 transitions. Second operand 4 states. [2019-11-20 07:11:03,298 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 07:11:03,298 INFO L93 Difference]: Finished difference Result 530 states and 793 transitions. [2019-11-20 07:11:03,298 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-20 07:11:03,298 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 100 [2019-11-20 07:11:03,299 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 07:11:03,300 INFO L225 Difference]: With dead ends: 530 [2019-11-20 07:11:03,300 INFO L226 Difference]: Without dead ends: 299 [2019-11-20 07:11:03,301 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 07:11:03,301 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 299 states. [2019-11-20 07:11:03,307 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 299 to 250. [2019-11-20 07:11:03,307 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 250 states. [2019-11-20 07:11:03,307 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 250 states to 250 states and 374 transitions. [2019-11-20 07:11:03,307 INFO L78 Accepts]: Start accepts. Automaton has 250 states and 374 transitions. Word has length 100 [2019-11-20 07:11:03,308 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 07:11:03,308 INFO L462 AbstractCegarLoop]: Abstraction has 250 states and 374 transitions. [2019-11-20 07:11:03,308 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-20 07:11:03,308 INFO L276 IsEmpty]: Start isEmpty. Operand 250 states and 374 transitions. [2019-11-20 07:11:03,309 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2019-11-20 07:11:03,309 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 07:11:03,309 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 07:11:03,309 INFO L410 AbstractCegarLoop]: === Iteration 32 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 07:11:03,309 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 07:11:03,309 INFO L82 PathProgramCache]: Analyzing trace with hash 1102945003, now seen corresponding path program 1 times [2019-11-20 07:11:03,310 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 07:11:03,310 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [271789740] [2019-11-20 07:11:03,310 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 07:11:03,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 07:11:03,364 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 49 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-11-20 07:11:03,365 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [271789740] [2019-11-20 07:11:03,365 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 07:11:03,365 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-20 07:11:03,365 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1710333754] [2019-11-20 07:11:03,366 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-20 07:11:03,366 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 07:11:03,366 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-20 07:11:03,366 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-20 07:11:03,366 INFO L87 Difference]: Start difference. First operand 250 states and 374 transitions. Second operand 4 states. [2019-11-20 07:11:03,663 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 07:11:03,663 INFO L93 Difference]: Finished difference Result 503 states and 755 transitions. [2019-11-20 07:11:03,663 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-20 07:11:03,663 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 100 [2019-11-20 07:11:03,664 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 07:11:03,665 INFO L225 Difference]: With dead ends: 503 [2019-11-20 07:11:03,665 INFO L226 Difference]: Without dead ends: 272 [2019-11-20 07:11:03,665 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 07:11:03,666 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 272 states. [2019-11-20 07:11:03,671 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 272 to 250. [2019-11-20 07:11:03,671 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 250 states. [2019-11-20 07:11:03,672 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 250 states to 250 states and 373 transitions. [2019-11-20 07:11:03,672 INFO L78 Accepts]: Start accepts. Automaton has 250 states and 373 transitions. Word has length 100 [2019-11-20 07:11:03,672 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 07:11:03,672 INFO L462 AbstractCegarLoop]: Abstraction has 250 states and 373 transitions. [2019-11-20 07:11:03,672 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-20 07:11:03,673 INFO L276 IsEmpty]: Start isEmpty. Operand 250 states and 373 transitions. [2019-11-20 07:11:03,673 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2019-11-20 07:11:03,673 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 07:11:03,674 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 07:11:03,674 INFO L410 AbstractCegarLoop]: === Iteration 33 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 07:11:03,674 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 07:11:03,674 INFO L82 PathProgramCache]: Analyzing trace with hash 952064921, now seen corresponding path program 1 times [2019-11-20 07:11:03,674 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 07:11:03,674 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1815629984] [2019-11-20 07:11:03,674 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 07:11:03,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 07:11:03,732 INFO L134 CoverageAnalysis]: Checked inductivity of 63 backedges. 52 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-11-20 07:11:03,733 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1815629984] [2019-11-20 07:11:03,733 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 07:11:03,733 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-20 07:11:03,733 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1613437269] [2019-11-20 07:11:03,734 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-20 07:11:03,734 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 07:11:03,734 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-20 07:11:03,734 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-20 07:11:03,734 INFO L87 Difference]: Start difference. First operand 250 states and 373 transitions. Second operand 4 states. [2019-11-20 07:11:04,142 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 07:11:04,142 INFO L93 Difference]: Finished difference Result 530 states and 789 transitions. [2019-11-20 07:11:04,143 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-20 07:11:04,143 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 101 [2019-11-20 07:11:04,143 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 07:11:04,145 INFO L225 Difference]: With dead ends: 530 [2019-11-20 07:11:04,145 INFO L226 Difference]: Without dead ends: 299 [2019-11-20 07:11:04,145 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 07:11:04,146 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 299 states. [2019-11-20 07:11:04,151 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 299 to 250. [2019-11-20 07:11:04,151 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 250 states. [2019-11-20 07:11:04,154 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 250 states to 250 states and 372 transitions. [2019-11-20 07:11:04,155 INFO L78 Accepts]: Start accepts. Automaton has 250 states and 372 transitions. Word has length 101 [2019-11-20 07:11:04,155 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 07:11:04,155 INFO L462 AbstractCegarLoop]: Abstraction has 250 states and 372 transitions. [2019-11-20 07:11:04,155 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-20 07:11:04,156 INFO L276 IsEmpty]: Start isEmpty. Operand 250 states and 372 transitions. [2019-11-20 07:11:04,156 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2019-11-20 07:11:04,157 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 07:11:04,157 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 07:11:04,157 INFO L410 AbstractCegarLoop]: === Iteration 34 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 07:11:04,157 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 07:11:04,157 INFO L82 PathProgramCache]: Analyzing trace with hash 1153888855, now seen corresponding path program 1 times [2019-11-20 07:11:04,158 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 07:11:04,158 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1003338482] [2019-11-20 07:11:04,158 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 07:11:04,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 07:11:04,209 INFO L134 CoverageAnalysis]: Checked inductivity of 63 backedges. 52 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-11-20 07:11:04,209 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1003338482] [2019-11-20 07:11:04,210 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 07:11:04,210 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-20 07:11:04,210 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2033179951] [2019-11-20 07:11:04,210 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-20 07:11:04,211 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 07:11:04,211 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-20 07:11:04,211 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-20 07:11:04,211 INFO L87 Difference]: Start difference. First operand 250 states and 372 transitions. Second operand 4 states. [2019-11-20 07:11:04,540 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 07:11:04,540 INFO L93 Difference]: Finished difference Result 503 states and 751 transitions. [2019-11-20 07:11:04,541 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-20 07:11:04,541 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 101 [2019-11-20 07:11:04,541 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 07:11:04,542 INFO L225 Difference]: With dead ends: 503 [2019-11-20 07:11:04,543 INFO L226 Difference]: Without dead ends: 272 [2019-11-20 07:11:04,543 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 07:11:04,544 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 272 states. [2019-11-20 07:11:04,549 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 272 to 250. [2019-11-20 07:11:04,549 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 250 states. [2019-11-20 07:11:04,549 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 250 states to 250 states and 371 transitions. [2019-11-20 07:11:04,550 INFO L78 Accepts]: Start accepts. Automaton has 250 states and 371 transitions. Word has length 101 [2019-11-20 07:11:04,550 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 07:11:04,550 INFO L462 AbstractCegarLoop]: Abstraction has 250 states and 371 transitions. [2019-11-20 07:11:04,550 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-20 07:11:04,550 INFO L276 IsEmpty]: Start isEmpty. Operand 250 states and 371 transitions. [2019-11-20 07:11:04,551 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2019-11-20 07:11:04,551 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 07:11:04,551 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 07:11:04,551 INFO L410 AbstractCegarLoop]: === Iteration 35 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 07:11:04,551 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 07:11:04,551 INFO L82 PathProgramCache]: Analyzing trace with hash -431127036, now seen corresponding path program 1 times [2019-11-20 07:11:04,551 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 07:11:04,552 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [877706781] [2019-11-20 07:11:04,552 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 07:11:04,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 07:11:04,602 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 55 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-11-20 07:11:04,602 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [877706781] [2019-11-20 07:11:04,602 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 07:11:04,603 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-20 07:11:04,603 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [416604965] [2019-11-20 07:11:04,603 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-20 07:11:04,603 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 07:11:04,603 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-20 07:11:04,604 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-20 07:11:04,604 INFO L87 Difference]: Start difference. First operand 250 states and 371 transitions. Second operand 4 states. [2019-11-20 07:11:04,999 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 07:11:04,999 INFO L93 Difference]: Finished difference Result 520 states and 773 transitions. [2019-11-20 07:11:04,999 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-20 07:11:05,000 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 102 [2019-11-20 07:11:05,000 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 07:11:05,001 INFO L225 Difference]: With dead ends: 520 [2019-11-20 07:11:05,001 INFO L226 Difference]: Without dead ends: 289 [2019-11-20 07:11:05,002 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 07:11:05,002 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 289 states. [2019-11-20 07:11:05,008 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 289 to 250. [2019-11-20 07:11:05,008 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 250 states. [2019-11-20 07:11:05,009 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 250 states to 250 states and 370 transitions. [2019-11-20 07:11:05,009 INFO L78 Accepts]: Start accepts. Automaton has 250 states and 370 transitions. Word has length 102 [2019-11-20 07:11:05,009 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 07:11:05,009 INFO L462 AbstractCegarLoop]: Abstraction has 250 states and 370 transitions. [2019-11-20 07:11:05,009 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-20 07:11:05,010 INFO L276 IsEmpty]: Start isEmpty. Operand 250 states and 370 transitions. [2019-11-20 07:11:05,010 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2019-11-20 07:11:05,010 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 07:11:05,011 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 07:11:05,011 INFO L410 AbstractCegarLoop]: === Iteration 36 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 07:11:05,011 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 07:11:05,011 INFO L82 PathProgramCache]: Analyzing trace with hash 1530447622, now seen corresponding path program 1 times [2019-11-20 07:11:05,011 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 07:11:05,012 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1894941825] [2019-11-20 07:11:05,012 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 07:11:05,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 07:11:05,068 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 55 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-11-20 07:11:05,068 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1894941825] [2019-11-20 07:11:05,068 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 07:11:05,068 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-20 07:11:05,068 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [649823503] [2019-11-20 07:11:05,069 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-20 07:11:05,069 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 07:11:05,069 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-20 07:11:05,069 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-20 07:11:05,070 INFO L87 Difference]: Start difference. First operand 250 states and 370 transitions. Second operand 4 states. [2019-11-20 07:11:05,370 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 07:11:05,370 INFO L93 Difference]: Finished difference Result 493 states and 735 transitions. [2019-11-20 07:11:05,371 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-20 07:11:05,371 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 102 [2019-11-20 07:11:05,371 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 07:11:05,372 INFO L225 Difference]: With dead ends: 493 [2019-11-20 07:11:05,373 INFO L226 Difference]: Without dead ends: 262 [2019-11-20 07:11:05,373 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 07:11:05,374 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 262 states. [2019-11-20 07:11:05,379 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 262 to 250. [2019-11-20 07:11:05,379 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 250 states. [2019-11-20 07:11:05,379 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 250 states to 250 states and 369 transitions. [2019-11-20 07:11:05,380 INFO L78 Accepts]: Start accepts. Automaton has 250 states and 369 transitions. Word has length 102 [2019-11-20 07:11:05,380 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 07:11:05,380 INFO L462 AbstractCegarLoop]: Abstraction has 250 states and 369 transitions. [2019-11-20 07:11:05,380 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-20 07:11:05,381 INFO L276 IsEmpty]: Start isEmpty. Operand 250 states and 369 transitions. [2019-11-20 07:11:05,381 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2019-11-20 07:11:05,381 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 07:11:05,382 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 07:11:05,382 INFO L410 AbstractCegarLoop]: === Iteration 37 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 07:11:05,383 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 07:11:05,384 INFO L82 PathProgramCache]: Analyzing trace with hash 1853395595, now seen corresponding path program 1 times [2019-11-20 07:11:05,384 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 07:11:05,384 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [948265398] [2019-11-20 07:11:05,384 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 07:11:05,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 07:11:05,442 INFO L134 CoverageAnalysis]: Checked inductivity of 86 backedges. 75 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-11-20 07:11:05,443 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [948265398] [2019-11-20 07:11:05,443 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 07:11:05,443 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-20 07:11:05,444 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1488569663] [2019-11-20 07:11:05,444 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-20 07:11:05,445 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 07:11:05,445 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-20 07:11:05,446 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-20 07:11:05,446 INFO L87 Difference]: Start difference. First operand 250 states and 369 transitions. Second operand 4 states. [2019-11-20 07:11:05,826 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 07:11:05,826 INFO L93 Difference]: Finished difference Result 520 states and 769 transitions. [2019-11-20 07:11:05,827 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-20 07:11:05,827 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 106 [2019-11-20 07:11:05,827 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 07:11:05,828 INFO L225 Difference]: With dead ends: 520 [2019-11-20 07:11:05,829 INFO L226 Difference]: Without dead ends: 289 [2019-11-20 07:11:05,829 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 07:11:05,830 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 289 states. [2019-11-20 07:11:05,835 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 289 to 250. [2019-11-20 07:11:05,836 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 250 states. [2019-11-20 07:11:05,836 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 250 states to 250 states and 368 transitions. [2019-11-20 07:11:05,837 INFO L78 Accepts]: Start accepts. Automaton has 250 states and 368 transitions. Word has length 106 [2019-11-20 07:11:05,837 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 07:11:05,837 INFO L462 AbstractCegarLoop]: Abstraction has 250 states and 368 transitions. [2019-11-20 07:11:05,837 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-20 07:11:05,837 INFO L276 IsEmpty]: Start isEmpty. Operand 250 states and 368 transitions. [2019-11-20 07:11:05,838 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2019-11-20 07:11:05,838 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 07:11:05,838 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 07:11:05,838 INFO L410 AbstractCegarLoop]: === Iteration 38 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 07:11:05,839 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 07:11:05,839 INFO L82 PathProgramCache]: Analyzing trace with hash 167215757, now seen corresponding path program 1 times [2019-11-20 07:11:05,839 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 07:11:05,839 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [136700137] [2019-11-20 07:11:05,839 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 07:11:05,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 07:11:05,894 INFO L134 CoverageAnalysis]: Checked inductivity of 86 backedges. 56 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2019-11-20 07:11:05,894 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [136700137] [2019-11-20 07:11:05,895 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 07:11:05,895 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-20 07:11:05,895 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1498078075] [2019-11-20 07:11:05,895 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-20 07:11:05,896 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 07:11:05,896 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-20 07:11:05,896 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-20 07:11:05,896 INFO L87 Difference]: Start difference. First operand 250 states and 368 transitions. Second operand 3 states. [2019-11-20 07:11:05,927 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 07:11:05,927 INFO L93 Difference]: Finished difference Result 710 states and 1059 transitions. [2019-11-20 07:11:05,928 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-20 07:11:05,928 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 106 [2019-11-20 07:11:05,928 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 07:11:05,930 INFO L225 Difference]: With dead ends: 710 [2019-11-20 07:11:05,930 INFO L226 Difference]: Without dead ends: 479 [2019-11-20 07:11:05,931 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 07:11:05,932 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 479 states. [2019-11-20 07:11:05,943 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 479 to 479. [2019-11-20 07:11:05,943 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 479 states. [2019-11-20 07:11:05,945 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 479 states to 479 states and 711 transitions. [2019-11-20 07:11:05,945 INFO L78 Accepts]: Start accepts. Automaton has 479 states and 711 transitions. Word has length 106 [2019-11-20 07:11:05,945 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 07:11:05,945 INFO L462 AbstractCegarLoop]: Abstraction has 479 states and 711 transitions. [2019-11-20 07:11:05,945 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-20 07:11:05,946 INFO L276 IsEmpty]: Start isEmpty. Operand 479 states and 711 transitions. [2019-11-20 07:11:05,947 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2019-11-20 07:11:05,947 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 07:11:05,947 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 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 07:11:05,947 INFO L410 AbstractCegarLoop]: === Iteration 39 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 07:11:05,948 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 07:11:05,948 INFO L82 PathProgramCache]: Analyzing trace with hash 1381936186, now seen corresponding path program 1 times [2019-11-20 07:11:05,948 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 07:11:05,948 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2114827203] [2019-11-20 07:11:05,948 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 07:11:06,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-20 07:11:06,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-20 07:11:06,238 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-20 07:11:06,238 INFO L475 BasicCegarLoop]: Counterexample might be feasible [2019-11-20 07:11:06,394 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 20.11 07:11:06 BoogieIcfgContainer [2019-11-20 07:11:06,395 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-11-20 07:11:06,395 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-11-20 07:11:06,395 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-11-20 07:11:06,396 INFO L275 PluginConnector]: Witness Printer initialized [2019-11-20 07:11:06,396 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 07:10:49" (3/4) ... [2019-11-20 07:11:06,404 INFO L140 WitnessPrinter]: No result that supports witness generation found [2019-11-20 07:11:06,405 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-11-20 07:11:06,406 INFO L168 Benchmark]: Toolchain (without parser) took 18629.06 ms. Allocated memory was 1.0 GB in the beginning and 1.4 GB in the end (delta: 406.3 MB). Free memory was 939.3 MB in the beginning and 927.0 MB in the end (delta: 12.3 MB). Peak memory consumption was 418.6 MB. Max. memory is 11.5 GB. [2019-11-20 07:11:06,407 INFO L168 Benchmark]: CDTParser took 0.17 ms. Allocated memory is still 1.0 GB. Free memory is still 962.2 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-20 07:11:06,407 INFO L168 Benchmark]: CACSL2BoogieTranslator took 769.14 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 137.4 MB). Free memory was 939.3 MB in the beginning and 1.1 GB in the end (delta: -169.5 MB). Peak memory consumption was 24.0 MB. Max. memory is 11.5 GB. [2019-11-20 07:11:06,408 INFO L168 Benchmark]: Boogie Procedure Inliner took 93.97 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-20 07:11:06,408 INFO L168 Benchmark]: Boogie Preprocessor took 84.66 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 07:11:06,408 INFO L168 Benchmark]: RCFGBuilder took 1067.23 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: 97.7 MB). Peak memory consumption was 97.7 MB. Max. memory is 11.5 GB. [2019-11-20 07:11:06,409 INFO L168 Benchmark]: TraceAbstraction took 16599.05 ms. Allocated memory was 1.2 GB in the beginning and 1.4 GB in the end (delta: 269.0 MB). Free memory was 1.0 GB in the beginning and 927.0 MB in the end (delta: 73.4 MB). Peak memory consumption was 342.4 MB. Max. memory is 11.5 GB. [2019-11-20 07:11:06,409 INFO L168 Benchmark]: Witness Printer took 9.49 ms. Allocated memory is still 1.4 GB. Free memory is still 927.0 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-20 07:11:06,411 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.17 ms. Allocated memory is still 1.0 GB. Free memory is still 962.2 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 769.14 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 137.4 MB). Free memory was 939.3 MB in the beginning and 1.1 GB in the end (delta: -169.5 MB). Peak memory consumption was 24.0 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 93.97 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * Boogie Preprocessor took 84.66 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 1067.23 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: 97.7 MB). Peak memory consumption was 97.7 MB. Max. memory is 11.5 GB. * TraceAbstraction took 16599.05 ms. Allocated memory was 1.2 GB in the beginning and 1.4 GB in the end (delta: 269.0 MB). Free memory was 1.0 GB in the beginning and 927.0 MB in the end (delta: 73.4 MB). Peak memory consumption was 342.4 MB. Max. memory is 11.5 GB. * Witness Printer took 9.49 ms. Allocated memory is still 1.4 GB. Free memory is still 927.0 MB. There was no memory consumed. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - UnprovableResult [Line: 1702]: Unable to prove that call of __VERIFIER_error() unreachable Unable to prove that call of __VERIFIER_error() unreachable Reason: overapproximation of bitwiseAnd at line 1121. Possible FailurePath: [L1042] static int init = 1; [L1043] static SSL_METHOD SSLv3_server_data ; VAL [init=1, SSLv3_server_data={9:0}] [L1065] SSL *s ; [L1066] int tmp ; [L1070] s = malloc(sizeof(SSL)) [L1071] s->s3 = malloc(sizeof(struct ssl3_state_st)) [L1072] s->ctx = malloc(sizeof(SSL_CTX)) [L1073] s->session = malloc(sizeof(SSL_SESSION)) [L1074] s->state = 8464 [L1081] BUF_MEM *buf ; [L1082] unsigned long l ; [L1083] unsigned long Time ; [L1084] unsigned long tmp ; [L1085] void (*cb)() ; [L1086] long num1 ; [L1087] int ret ; [L1088] int new_state ; [L1089] int state ; [L1090] int skip ; [L1091] int got_new_session ; [L1092] int tmp___1 = __VERIFIER_nondet_int() ; [L1093] int tmp___2 = __VERIFIER_nondet_int() ; [L1094] int tmp___3 = __VERIFIER_nondet_int() ; [L1095] int tmp___4 = __VERIFIER_nondet_int() ; [L1096] int tmp___5 = __VERIFIER_nondet_int() ; [L1097] int tmp___6 = __VERIFIER_nondet_int() ; [L1098] int tmp___7 ; [L1099] long tmp___8 = __VERIFIER_nondet_long() ; [L1100] int tmp___9 = __VERIFIER_nondet_int() ; [L1101] int tmp___10 = __VERIFIER_nondet_int() ; [L1102] int blastFlag ; [L1106] blastFlag = 0 [L1107] s->hit=__VERIFIER_nondet_int () [L1108] s->state = 8464 [L1109] tmp = __VERIFIER_nondet_int() [L1110] Time = tmp [L1111] cb = (void (*)())((void *)0) [L1112] ret = -1 [L1113] skip = 0 [L1114] got_new_session = 0 [L1115] EXPR s->info_callback VAL [init=1, SSLv3_server_data={9:0}] [L1115] COND TRUE (unsigned long )s->info_callback != (unsigned long )((void *)0) [L1116] EXPR s->info_callback [L1116] cb = s->info_callback [L1120] EXPR s->in_handshake [L1120] s->in_handshake += 1 [L1121] COND FALSE !(tmp___1 & 12288) VAL [init=1, SSLv3_server_data={9:0}] [L1130] EXPR s->cert VAL [init=1, SSLv3_server_data={9:0}] [L1130] COND FALSE !((unsigned long )s->cert == (unsigned long )((void *)0)) [L1136] COND TRUE 1 VAL [init=1, SSLv3_server_data={9:0}] [L1138] EXPR s->state [L1138] state = s->state [L1139] EXPR s->state VAL [init=1, SSLv3_server_data={9:0}] [L1139] COND FALSE !(s->state == 12292) [L1142] EXPR s->state VAL [init=1, SSLv3_server_data={9:0}] [L1142] COND FALSE !(s->state == 16384) [L1145] EXPR s->state VAL [init=1, SSLv3_server_data={9:0}] [L1145] COND FALSE !(s->state == 8192) [L1148] EXPR s->state VAL [init=1, SSLv3_server_data={9:0}] [L1148] COND FALSE !(s->state == 24576) [L1151] EXPR s->state VAL [init=1, SSLv3_server_data={9:0}] [L1151] COND FALSE !(s->state == 8195) [L1154] EXPR s->state VAL [init=1, SSLv3_server_data={9:0}] [L1154] COND FALSE !(s->state == 8480) [L1157] EXPR s->state VAL [init=1, SSLv3_server_data={9:0}] [L1157] COND FALSE !(s->state == 8481) [L1160] EXPR s->state VAL [init=1, SSLv3_server_data={9:0}] [L1160] COND FALSE !(s->state == 8482) [L1163] EXPR s->state VAL [init=1, SSLv3_server_data={9:0}] [L1163] COND TRUE s->state == 8464 [L1323] s->shutdown = 0 [L1324] ret = __VERIFIER_nondet_int() [L1325] COND TRUE blastFlag == 0 [L1326] blastFlag = 1 VAL [init=1, SSLv3_server_data={9:0}] [L1330] COND FALSE !(ret <= 0) [L1335] got_new_session = 1 [L1336] s->state = 8496 [L1337] s->init_num = 0 VAL [init=1, SSLv3_server_data={9:0}] [L1661] EXPR s->s3 [L1661] EXPR (s->s3)->tmp.reuse_message VAL [init=1, SSLv3_server_data={9:0}] [L1661] COND FALSE !(! (s->s3)->tmp.reuse_message) [L1690] skip = 0 VAL [init=1, SSLv3_server_data={9:0}] [L1136] COND TRUE 1 VAL [init=1, SSLv3_server_data={9:0}] [L1138] EXPR s->state [L1138] state = s->state [L1139] EXPR s->state VAL [init=1, SSLv3_server_data={9:0}] [L1139] COND FALSE !(s->state == 12292) [L1142] EXPR s->state VAL [init=1, SSLv3_server_data={9:0}] [L1142] COND FALSE !(s->state == 16384) [L1145] EXPR s->state VAL [init=1, SSLv3_server_data={9:0}] [L1145] COND FALSE !(s->state == 8192) [L1148] EXPR s->state VAL [init=1, SSLv3_server_data={9:0}] [L1148] COND FALSE !(s->state == 24576) [L1151] EXPR s->state VAL [init=1, SSLv3_server_data={9:0}] [L1151] COND FALSE !(s->state == 8195) [L1154] EXPR s->state VAL [init=1, SSLv3_server_data={9:0}] [L1154] COND FALSE !(s->state == 8480) [L1157] EXPR s->state VAL [init=1, SSLv3_server_data={9:0}] [L1157] COND FALSE !(s->state == 8481) [L1160] EXPR s->state VAL [init=1, SSLv3_server_data={9:0}] [L1160] COND FALSE !(s->state == 8482) [L1163] EXPR s->state VAL [init=1, SSLv3_server_data={9:0}] [L1163] COND FALSE !(s->state == 8464) [L1166] EXPR s->state VAL [init=1, SSLv3_server_data={9:0}] [L1166] COND FALSE !(s->state == 8465) [L1169] EXPR s->state VAL [init=1, SSLv3_server_data={9:0}] [L1169] COND FALSE !(s->state == 8466) [L1172] EXPR s->state VAL [init=1, SSLv3_server_data={9:0}] [L1172] COND TRUE s->state == 8496 [L1341] ret = __VERIFIER_nondet_int() [L1342] COND TRUE blastFlag == 1 [L1343] blastFlag = 2 VAL [init=1, SSLv3_server_data={9:0}] [L1351] COND FALSE !(ret <= 0) [L1356] s->hit VAL [init=1, SSLv3_server_data={9:0}] [L1356] COND TRUE s->hit [L1357] s->state = 8656 VAL [init=1, SSLv3_server_data={9:0}] [L1361] s->init_num = 0 VAL [init=1, SSLv3_server_data={9:0}] [L1661] EXPR s->s3 [L1661] EXPR (s->s3)->tmp.reuse_message VAL [init=1, SSLv3_server_data={9:0}] [L1661] COND FALSE !(! (s->s3)->tmp.reuse_message) [L1690] skip = 0 VAL [init=1, SSLv3_server_data={9:0}] [L1136] COND TRUE 1 VAL [init=1, SSLv3_server_data={9:0}] [L1138] EXPR s->state [L1138] state = s->state [L1139] EXPR s->state VAL [init=1, SSLv3_server_data={9:0}] [L1139] COND FALSE !(s->state == 12292) [L1142] EXPR s->state VAL [init=1, SSLv3_server_data={9:0}] [L1142] COND FALSE !(s->state == 16384) [L1145] EXPR s->state VAL [init=1, SSLv3_server_data={9:0}] [L1145] COND FALSE !(s->state == 8192) [L1148] EXPR s->state VAL [init=1, SSLv3_server_data={9:0}] [L1148] COND FALSE !(s->state == 24576) [L1151] EXPR s->state VAL [init=1, SSLv3_server_data={9:0}] [L1151] COND FALSE !(s->state == 8195) [L1154] EXPR s->state VAL [init=1, SSLv3_server_data={9:0}] [L1154] COND FALSE !(s->state == 8480) [L1157] EXPR s->state VAL [init=1, SSLv3_server_data={9:0}] [L1157] COND FALSE !(s->state == 8481) [L1160] EXPR s->state VAL [init=1, SSLv3_server_data={9:0}] [L1160] COND FALSE !(s->state == 8482) [L1163] EXPR s->state VAL [init=1, SSLv3_server_data={9:0}] [L1163] COND FALSE !(s->state == 8464) [L1166] EXPR s->state VAL [init=1, SSLv3_server_data={9:0}] [L1166] COND FALSE !(s->state == 8465) [L1169] EXPR s->state VAL [init=1, SSLv3_server_data={9:0}] [L1169] COND FALSE !(s->state == 8466) [L1172] EXPR s->state VAL [init=1, SSLv3_server_data={9:0}] [L1172] COND FALSE !(s->state == 8496) [L1175] EXPR s->state VAL [init=1, SSLv3_server_data={9:0}] [L1175] COND FALSE !(s->state == 8497) [L1178] EXPR s->state VAL [init=1, SSLv3_server_data={9:0}] [L1178] COND FALSE !(s->state == 8512) [L1181] EXPR s->state VAL [init=1, SSLv3_server_data={9:0}] [L1181] COND FALSE !(s->state == 8513) [L1184] EXPR s->state VAL [init=1, SSLv3_server_data={9:0}] [L1184] COND FALSE !(s->state == 8528) [L1187] EXPR s->state VAL [init=1, SSLv3_server_data={9:0}] [L1187] COND FALSE !(s->state == 8529) [L1190] EXPR s->state VAL [init=1, SSLv3_server_data={9:0}] [L1190] COND FALSE !(s->state == 8544) [L1193] EXPR s->state VAL [init=1, SSLv3_server_data={9:0}] [L1193] COND FALSE !(s->state == 8545) [L1196] EXPR s->state VAL [init=1, SSLv3_server_data={9:0}] [L1196] COND FALSE !(s->state == 8560) [L1199] EXPR s->state VAL [init=1, SSLv3_server_data={9:0}] [L1199] COND FALSE !(s->state == 8561) [L1202] EXPR s->state VAL [init=1, SSLv3_server_data={9:0}] [L1202] COND FALSE !(s->state == 8448) [L1205] EXPR s->state VAL [init=1, SSLv3_server_data={9:0}] [L1205] COND FALSE !(s->state == 8576) [L1208] EXPR s->state VAL [init=1, SSLv3_server_data={9:0}] [L1208] COND FALSE !(s->state == 8577) [L1211] EXPR s->state VAL [init=1, SSLv3_server_data={9:0}] [L1211] COND FALSE !(s->state == 8592) [L1214] EXPR s->state VAL [init=1, SSLv3_server_data={9:0}] [L1214] COND FALSE !(s->state == 8593) [L1217] EXPR s->state VAL [init=1, SSLv3_server_data={9:0}] [L1217] COND FALSE !(s->state == 8608) [L1220] EXPR s->state VAL [init=1, SSLv3_server_data={9:0}] [L1220] COND FALSE !(s->state == 8609) [L1223] EXPR s->state VAL [init=1, SSLv3_server_data={9:0}] [L1223] COND FALSE !(s->state == 8640) [L1226] EXPR s->state VAL [init=1, SSLv3_server_data={9:0}] [L1226] COND FALSE !(s->state == 8641) [L1229] EXPR s->state VAL [init=1, SSLv3_server_data={9:0}] [L1229] COND TRUE s->state == 8656 [L1554] EXPR s->session [L1554] EXPR s->s3 [L1554] EXPR (s->s3)->tmp.new_cipher [L1554] (s->session)->cipher = (s->s3)->tmp.new_cipher [L1555] COND FALSE !(! tmp___9) [L1561] ret = __VERIFIER_nondet_int() [L1562] COND TRUE blastFlag == 2 [L1563] blastFlag = 3 VAL [init=1, SSLv3_server_data={9:0}] [L1567] COND FALSE !(ret <= 0) [L1572] s->state = 8672 [L1573] s->init_num = 0 VAL [init=1, SSLv3_server_data={9:0}] [L1574] COND FALSE !(! tmp___10) VAL [init=1, SSLv3_server_data={9:0}] [L1661] EXPR s->s3 [L1661] EXPR (s->s3)->tmp.reuse_message VAL [init=1, SSLv3_server_data={9:0}] [L1661] COND FALSE !(! (s->s3)->tmp.reuse_message) [L1690] skip = 0 VAL [init=1, SSLv3_server_data={9:0}] [L1136] COND TRUE 1 VAL [init=1, SSLv3_server_data={9:0}] [L1138] EXPR s->state [L1138] state = s->state [L1139] EXPR s->state VAL [init=1, SSLv3_server_data={9:0}] [L1139] COND FALSE !(s->state == 12292) [L1142] EXPR s->state VAL [init=1, SSLv3_server_data={9:0}] [L1142] COND FALSE !(s->state == 16384) [L1145] EXPR s->state VAL [init=1, SSLv3_server_data={9:0}] [L1145] COND FALSE !(s->state == 8192) [L1148] EXPR s->state VAL [init=1, SSLv3_server_data={9:0}] [L1148] COND FALSE !(s->state == 24576) [L1151] EXPR s->state VAL [init=1, SSLv3_server_data={9:0}] [L1151] COND FALSE !(s->state == 8195) [L1154] EXPR s->state VAL [init=1, SSLv3_server_data={9:0}] [L1154] COND FALSE !(s->state == 8480) [L1157] EXPR s->state VAL [init=1, SSLv3_server_data={9:0}] [L1157] COND FALSE !(s->state == 8481) [L1160] EXPR s->state VAL [init=1, SSLv3_server_data={9:0}] [L1160] COND FALSE !(s->state == 8482) [L1163] EXPR s->state VAL [init=1, SSLv3_server_data={9:0}] [L1163] COND FALSE !(s->state == 8464) [L1166] EXPR s->state VAL [init=1, SSLv3_server_data={9:0}] [L1166] COND FALSE !(s->state == 8465) [L1169] EXPR s->state VAL [init=1, SSLv3_server_data={9:0}] [L1169] COND FALSE !(s->state == 8466) [L1172] EXPR s->state VAL [init=1, SSLv3_server_data={9:0}] [L1172] COND FALSE !(s->state == 8496) [L1175] EXPR s->state VAL [init=1, SSLv3_server_data={9:0}] [L1175] COND FALSE !(s->state == 8497) [L1178] EXPR s->state VAL [init=1, SSLv3_server_data={9:0}] [L1178] COND FALSE !(s->state == 8512) [L1181] EXPR s->state VAL [init=1, SSLv3_server_data={9:0}] [L1181] COND FALSE !(s->state == 8513) [L1184] EXPR s->state VAL [init=1, SSLv3_server_data={9:0}] [L1184] COND FALSE !(s->state == 8528) [L1187] EXPR s->state VAL [init=1, SSLv3_server_data={9:0}] [L1187] COND FALSE !(s->state == 8529) [L1190] EXPR s->state VAL [init=1, SSLv3_server_data={9:0}] [L1190] COND FALSE !(s->state == 8544) [L1193] EXPR s->state VAL [init=1, SSLv3_server_data={9:0}] [L1193] COND FALSE !(s->state == 8545) [L1196] EXPR s->state VAL [init=1, SSLv3_server_data={9:0}] [L1196] COND FALSE !(s->state == 8560) [L1199] EXPR s->state VAL [init=1, SSLv3_server_data={9:0}] [L1199] COND FALSE !(s->state == 8561) [L1202] EXPR s->state VAL [init=1, SSLv3_server_data={9:0}] [L1202] COND FALSE !(s->state == 8448) [L1205] EXPR s->state VAL [init=1, SSLv3_server_data={9:0}] [L1205] COND FALSE !(s->state == 8576) [L1208] EXPR s->state VAL [init=1, SSLv3_server_data={9:0}] [L1208] COND FALSE !(s->state == 8577) [L1211] EXPR s->state VAL [init=1, SSLv3_server_data={9:0}] [L1211] COND FALSE !(s->state == 8592) [L1214] EXPR s->state VAL [init=1, SSLv3_server_data={9:0}] [L1214] COND FALSE !(s->state == 8593) [L1217] EXPR s->state VAL [init=1, SSLv3_server_data={9:0}] [L1217] COND FALSE !(s->state == 8608) [L1220] EXPR s->state VAL [init=1, SSLv3_server_data={9:0}] [L1220] COND FALSE !(s->state == 8609) [L1223] EXPR s->state VAL [init=1, SSLv3_server_data={9:0}] [L1223] COND FALSE !(s->state == 8640) [L1226] EXPR s->state VAL [init=1, SSLv3_server_data={9:0}] [L1226] COND FALSE !(s->state == 8641) [L1229] EXPR s->state VAL [init=1, SSLv3_server_data={9:0}] [L1229] COND FALSE !(s->state == 8656) [L1232] EXPR s->state VAL [init=1, SSLv3_server_data={9:0}] [L1232] COND FALSE !(s->state == 8657) [L1235] EXPR s->state VAL [init=1, SSLv3_server_data={9:0}] [L1235] COND TRUE s->state == 8672 [L1583] ret = __VERIFIER_nondet_int() [L1584] COND TRUE blastFlag == 3 VAL [init=1, SSLv3_server_data={9:0}] [L1702] __VERIFIER_error() VAL [init=1, SSLv3_server_data={9:0}] - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 143 locations, 1 error locations. Result: UNSAFE, OverallTime: 16.5s, OverallIterations: 39, TraceHistogramMax: 4, AutomataDifference: 12.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 7109 SDtfs, 2139 SDslu, 10637 SDs, 0 SdLazy, 6863 SolverSat, 339 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 10.0s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 219 GetRequests, 76 SyntacticMatches, 29 SemanticMatches, 114 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=479occurred in iteration=38, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.3s AutomataMinimizationTime, 38 MinimizatonAttempts, 941 StatesRemovedByMinimization, 37 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.6s SatisfiabilityAnalysisTime, 1.6s InterpolantComputationTime, 3288 NumberOfCodeBlocks, 3288 NumberOfCodeBlocksAsserted, 39 NumberOfCheckSat, 3125 ConstructedInterpolants, 0 QuantifiedInterpolants, 733119 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 38 InterpolantComputations, 38 PerfectInterpolantSequences, 1564/1564 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 07:11:08,372 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-20 07:11:08,374 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-20 07:11:08,385 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-20 07:11:08,387 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-20 07:11:08,389 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-20 07:11:08,391 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-20 07:11:08,400 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-20 07:11:08,406 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-20 07:11:08,409 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-20 07:11:08,410 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-20 07:11:08,412 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-20 07:11:08,413 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-20 07:11:08,414 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-20 07:11:08,415 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-20 07:11:08,417 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-20 07:11:08,419 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-20 07:11:08,420 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-20 07:11:08,423 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-20 07:11:08,427 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-20 07:11:08,430 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-20 07:11:08,433 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-20 07:11:08,435 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-20 07:11:08,436 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-20 07:11:08,440 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-20 07:11:08,441 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-20 07:11:08,441 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-20 07:11:08,443 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-20 07:11:08,443 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-20 07:11:08,444 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-20 07:11:08,444 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-20 07:11:08,445 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-20 07:11:08,446 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-20 07:11:08,446 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-20 07:11:08,447 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-20 07:11:08,448 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-20 07:11:08,448 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-20 07:11:08,449 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-20 07:11:08,449 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-20 07:11:08,450 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-20 07:11:08,451 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-20 07:11:08,452 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_15c46571-83bb-461b-9212-2516ad5cc207/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2019-11-20 07:11:08,478 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-20 07:11:08,486 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-20 07:11:08,488 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-20 07:11:08,489 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-20 07:11:08,489 INFO L138 SettingsManager]: * Use SBE=true [2019-11-20 07:11:08,490 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-20 07:11:08,492 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-20 07:11:08,492 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-20 07:11:08,493 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-20 07:11:08,493 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-11-20 07:11:08,494 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-20 07:11:08,494 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-11-20 07:11:08,495 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2019-11-20 07:11:08,495 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2019-11-20 07:11:08,495 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-20 07:11:08,495 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-20 07:11:08,496 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-20 07:11:08,496 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-11-20 07:11:08,496 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-20 07:11:08,497 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-20 07:11:08,498 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-20 07:11:08,499 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-20 07:11:08,500 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-20 07:11:08,501 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-20 07:11:08,502 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-20 07:11:08,502 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-11-20 07:11:08,502 INFO L138 SettingsManager]: * Trace refinement strategy=WOLF [2019-11-20 07:11:08,503 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --rewrite-divk --print-success --lang smt [2019-11-20 07:11:08,503 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-11-20 07:11:08,503 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-11-20 07:11:08,503 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_15c46571-83bb-461b-9212-2516ad5cc207/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 -> 1952eae46575e60399f761afaedbe356b8f81a96 [2019-11-20 07:11:08,759 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-20 07:11:08,774 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-20 07:11:08,777 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-20 07:11:08,778 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-20 07:11:08,779 INFO L275 PluginConnector]: CDTParser initialized [2019-11-20 07:11:08,780 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_15c46571-83bb-461b-9212-2516ad5cc207/bin/uautomizer/../../sv-benchmarks/c/ssh/s3_srvr.blast.02.i.cil-1.c [2019-11-20 07:11:08,838 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_15c46571-83bb-461b-9212-2516ad5cc207/bin/uautomizer/data/b7cef6e5e/b82f0aa86dc245078e2e597a772fa358/FLAG93ff7d0ab [2019-11-20 07:11:09,397 INFO L306 CDTParser]: Found 1 translation units. [2019-11-20 07:11:09,400 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_15c46571-83bb-461b-9212-2516ad5cc207/sv-benchmarks/c/ssh/s3_srvr.blast.02.i.cil-1.c [2019-11-20 07:11:09,426 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_15c46571-83bb-461b-9212-2516ad5cc207/bin/uautomizer/data/b7cef6e5e/b82f0aa86dc245078e2e597a772fa358/FLAG93ff7d0ab [2019-11-20 07:11:09,675 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_15c46571-83bb-461b-9212-2516ad5cc207/bin/uautomizer/data/b7cef6e5e/b82f0aa86dc245078e2e597a772fa358 [2019-11-20 07:11:09,677 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-20 07:11:09,678 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-11-20 07:11:09,679 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-20 07:11:09,684 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-20 07:11:09,687 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-20 07:11:09,688 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.11 07:11:09" (1/1) ... [2019-11-20 07:11:09,691 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@9bbf7c9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 07:11:09, skipping insertion in model container [2019-11-20 07:11:09,691 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.11 07:11:09" (1/1) ... [2019-11-20 07:11:09,698 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-11-20 07:11:09,773 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-11-20 07:11:10,227 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-20 07:11:10,254 INFO L188 MainTranslator]: Completed pre-run [2019-11-20 07:11:10,414 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-20 07:11:10,434 INFO L192 MainTranslator]: Completed translation [2019-11-20 07:11:10,435 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 07:11:10 WrapperNode [2019-11-20 07:11:10,435 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-20 07:11:10,436 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-11-20 07:11:10,436 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-11-20 07:11:10,436 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-11-20 07:11:10,444 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 07:11:10" (1/1) ... [2019-11-20 07:11:10,482 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 07:11:10" (1/1) ... [2019-11-20 07:11:10,533 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-11-20 07:11:10,534 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-20 07:11:10,534 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-20 07:11:10,534 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-20 07:11:10,543 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 07:11:10" (1/1) ... [2019-11-20 07:11:10,546 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 07:11:10" (1/1) ... [2019-11-20 07:11:10,555 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 07:11:10" (1/1) ... [2019-11-20 07:11:10,562 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 07:11:10" (1/1) ... [2019-11-20 07:11:10,630 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 07:11:10" (1/1) ... [2019-11-20 07:11:10,650 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 07:11:10" (1/1) ... [2019-11-20 07:11:10,654 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 07:11:10" (1/1) ... [2019-11-20 07:11:10,659 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-20 07:11:10,668 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-20 07:11:10,669 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-20 07:11:10,669 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-20 07:11:10,670 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 07:11:10" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_15c46571-83bb-461b-9212-2516ad5cc207/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 07:11:10,740 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2019-11-20 07:11:10,741 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-11-20 07:11:10,742 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4 [2019-11-20 07:11:10,742 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2019-11-20 07:11:10,742 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2019-11-20 07:11:10,742 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-20 07:11:10,742 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-20 07:11:10,742 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2019-11-20 07:11:11,036 WARN L736 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-11-20 07:11:13,597 INFO L689 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##87: assume false; [2019-11-20 07:11:13,597 INFO L689 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##88: assume !false; [2019-11-20 07:11:13,599 INFO L280 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-20 07:11:13,599 INFO L285 CfgBuilder]: Removed 7 assume(true) statements. [2019-11-20 07:11:13,600 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 07:11:13 BoogieIcfgContainer [2019-11-20 07:11:13,600 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-20 07:11:13,602 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-20 07:11:13,602 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-20 07:11:13,604 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-20 07:11:13,605 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.11 07:11:09" (1/3) ... [2019-11-20 07:11:13,605 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@69046d6f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.11 07:11:13, skipping insertion in model container [2019-11-20 07:11:13,606 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 07:11:10" (2/3) ... [2019-11-20 07:11:13,606 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@69046d6f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.11 07:11:13, skipping insertion in model container [2019-11-20 07:11:13,606 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 07:11:13" (3/3) ... [2019-11-20 07:11:13,608 INFO L109 eAbstractionObserver]: Analyzing ICFG s3_srvr.blast.02.i.cil-1.c [2019-11-20 07:11:13,621 INFO L153 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-20 07:11:13,627 INFO L165 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-11-20 07:11:13,637 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-11-20 07:11:13,671 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-20 07:11:13,671 INFO L374 AbstractCegarLoop]: Hoare is true [2019-11-20 07:11:13,671 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-20 07:11:13,672 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-20 07:11:13,672 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-20 07:11:13,672 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-20 07:11:13,672 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-20 07:11:13,672 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-20 07:11:13,696 INFO L276 IsEmpty]: Start isEmpty. Operand 143 states. [2019-11-20 07:11:13,711 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2019-11-20 07:11:13,711 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 07:11:13,712 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 07:11:13,713 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 07:11:13,718 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 07:11:13,719 INFO L82 PathProgramCache]: Analyzing trace with hash 522836684, now seen corresponding path program 1 times [2019-11-20 07:11:13,727 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-20 07:11:13,727 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [232602994] [2019-11-20 07:11:13,728 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_15c46571-83bb-461b-9212-2516ad5cc207/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 07:11:13,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 07:11:13,960 INFO L255 TraceCheckSpWp]: Trace formula consists of 139 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-20 07:11:13,975 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 07:11:14,027 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 07:11:14,028 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-20 07:11:14,061 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 07:11:14,062 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [232602994] [2019-11-20 07:11:14,062 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-20 07:11:14,063 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 4 [2019-11-20 07:11:14,064 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1118997820] [2019-11-20 07:11:14,070 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-20 07:11:14,071 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-20 07:11:14,082 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-20 07:11:14,083 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-20 07:11:14,085 INFO L87 Difference]: Start difference. First operand 143 states. Second operand 4 states. [2019-11-20 07:11:14,242 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 07:11:14,243 INFO L93 Difference]: Finished difference Result 537 states and 912 transitions. [2019-11-20 07:11:14,243 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-20 07:11:14,244 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 45 [2019-11-20 07:11:14,245 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 07:11:14,268 INFO L225 Difference]: With dead ends: 537 [2019-11-20 07:11:14,269 INFO L226 Difference]: Without dead ends: 363 [2019-11-20 07:11:14,273 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 88 GetRequests, 86 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 07:11:14,293 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 363 states. [2019-11-20 07:11:14,335 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 363 to 363. [2019-11-20 07:11:14,336 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 363 states. [2019-11-20 07:11:14,340 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 363 states to 363 states and 551 transitions. [2019-11-20 07:11:14,341 INFO L78 Accepts]: Start accepts. Automaton has 363 states and 551 transitions. Word has length 45 [2019-11-20 07:11:14,342 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 07:11:14,342 INFO L462 AbstractCegarLoop]: Abstraction has 363 states and 551 transitions. [2019-11-20 07:11:14,342 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-20 07:11:14,343 INFO L276 IsEmpty]: Start isEmpty. Operand 363 states and 551 transitions. [2019-11-20 07:11:14,348 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2019-11-20 07:11:14,349 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 07:11:14,349 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2019-11-20 07:11:14,551 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-20 07:11:14,552 INFO L410 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 07:11:14,552 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 07:11:14,552 INFO L82 PathProgramCache]: Analyzing trace with hash -1786835122, now seen corresponding path program 1 times [2019-11-20 07:11:14,553 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-20 07:11:14,553 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [1788328711] [2019-11-20 07:11:14,554 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_15c46571-83bb-461b-9212-2516ad5cc207/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 07:11:14,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 07:11:14,791 INFO L255 TraceCheckSpWp]: Trace formula consists of 260 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-20 07:11:14,796 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 07:11:14,834 INFO L134 CoverageAnalysis]: Checked inductivity of 58 backedges. 58 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 07:11:14,834 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-20 07:11:14,878 INFO L134 CoverageAnalysis]: Checked inductivity of 58 backedges. 58 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 07:11:14,878 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1788328711] [2019-11-20 07:11:14,878 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-20 07:11:14,879 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 4 [2019-11-20 07:11:14,879 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [534746365] [2019-11-20 07:11:14,882 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-20 07:11:14,882 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-20 07:11:14,882 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-20 07:11:14,883 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-20 07:11:14,883 INFO L87 Difference]: Start difference. First operand 363 states and 551 transitions. Second operand 4 states. [2019-11-20 07:11:15,539 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 07:11:15,540 INFO L93 Difference]: Finished difference Result 833 states and 1271 transitions. [2019-11-20 07:11:15,540 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-20 07:11:15,540 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 103 [2019-11-20 07:11:15,541 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 07:11:15,544 INFO L225 Difference]: With dead ends: 833 [2019-11-20 07:11:15,544 INFO L226 Difference]: Without dead ends: 597 [2019-11-20 07:11:15,547 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 204 GetRequests, 202 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 07:11:15,548 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 597 states. [2019-11-20 07:11:15,623 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 597 to 597. [2019-11-20 07:11:15,623 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 597 states. [2019-11-20 07:11:15,626 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 597 states to 597 states and 905 transitions. [2019-11-20 07:11:15,627 INFO L78 Accepts]: Start accepts. Automaton has 597 states and 905 transitions. Word has length 103 [2019-11-20 07:11:15,627 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 07:11:15,627 INFO L462 AbstractCegarLoop]: Abstraction has 597 states and 905 transitions. [2019-11-20 07:11:15,628 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-20 07:11:15,628 INFO L276 IsEmpty]: Start isEmpty. Operand 597 states and 905 transitions. [2019-11-20 07:11:15,638 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2019-11-20 07:11:15,639 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 07:11:15,639 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 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 07:11:15,841 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-20 07:11:15,842 INFO L410 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 07:11:15,842 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 07:11:15,842 INFO L82 PathProgramCache]: Analyzing trace with hash 1381936186, now seen corresponding path program 1 times [2019-11-20 07:11:15,843 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-20 07:11:15,843 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [605858906] [2019-11-20 07:11:15,844 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_15c46571-83bb-461b-9212-2516ad5cc207/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 07:11:17,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-20 07:11:18,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-20 07:11:18,553 INFO L174 FreeRefinementEngine]: Strategy WOLF found a feasible trace [2019-11-20 07:11:18,554 INFO L475 BasicCegarLoop]: Counterexample might be feasible [2019-11-20 07:11:18,767 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-20 07:11:18,937 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 20.11 07:11:18 BoogieIcfgContainer [2019-11-20 07:11:18,937 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-11-20 07:11:18,937 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-11-20 07:11:18,937 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-11-20 07:11:18,938 INFO L275 PluginConnector]: Witness Printer initialized [2019-11-20 07:11:18,938 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 07:11:13" (3/4) ... [2019-11-20 07:11:18,940 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2019-11-20 07:11:19,081 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/run_dir_15c46571-83bb-461b-9212-2516ad5cc207/bin/uautomizer/witness.graphml [2019-11-20 07:11:19,082 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-11-20 07:11:19,084 INFO L168 Benchmark]: Toolchain (without parser) took 9405.06 ms. Allocated memory was 1.0 GB in the beginning and 1.3 GB in the end (delta: 240.1 MB). Free memory was 952.4 MB in the beginning and 1.1 GB in the end (delta: -194.8 MB). Peak memory consumption was 45.3 MB. Max. memory is 11.5 GB. [2019-11-20 07:11:19,084 INFO L168 Benchmark]: CDTParser took 0.27 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 07:11:19,085 INFO L168 Benchmark]: CACSL2BoogieTranslator took 756.03 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 168.8 MB). Free memory was 952.4 MB in the beginning and 1.1 GB in the end (delta: -190.0 MB). Peak memory consumption was 28.6 MB. Max. memory is 11.5 GB. [2019-11-20 07:11:19,085 INFO L168 Benchmark]: Boogie Procedure Inliner took 97.76 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.5 MB). Peak memory consumption was 6.5 MB. Max. memory is 11.5 GB. [2019-11-20 07:11:19,085 INFO L168 Benchmark]: Boogie Preprocessor took 134.17 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.5 MB). Peak memory consumption was 6.5 MB. Max. memory is 11.5 GB. [2019-11-20 07:11:19,086 INFO L168 Benchmark]: RCFGBuilder took 2932.34 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: 90.3 MB). Peak memory consumption was 90.3 MB. Max. memory is 11.5 GB. [2019-11-20 07:11:19,086 INFO L168 Benchmark]: TraceAbstraction took 5335.49 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 71.3 MB). Free memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: -123.0 MB). There was no memory consumed. Max. memory is 11.5 GB. [2019-11-20 07:11:19,087 INFO L168 Benchmark]: Witness Printer took 144.86 ms. Allocated memory is still 1.3 GB. Free memory was 1.2 GB in the beginning and 1.1 GB in the end (delta: 14.8 MB). Peak memory consumption was 14.8 MB. Max. memory is 11.5 GB. [2019-11-20 07:11:19,090 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.27 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 756.03 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 168.8 MB). Free memory was 952.4 MB in the beginning and 1.1 GB in the end (delta: -190.0 MB). Peak memory consumption was 28.6 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 97.76 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.5 MB). Peak memory consumption was 6.5 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 134.17 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.5 MB). Peak memory consumption was 6.5 MB. Max. memory is 11.5 GB. * RCFGBuilder took 2932.34 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: 90.3 MB). Peak memory consumption was 90.3 MB. Max. memory is 11.5 GB. * TraceAbstraction took 5335.49 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 71.3 MB). Free memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: -123.0 MB). There was no memory consumed. Max. memory is 11.5 GB. * Witness Printer took 144.86 ms. Allocated memory is still 1.3 GB. Free memory was 1.2 GB in the beginning and 1.1 GB in the end (delta: 14.8 MB). Peak memory consumption was 14.8 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 1702]: 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_server_data ; VAL [init=1, SSLv3_server_data={2147483645:0}] [L1065] SSL *s ; [L1066] int tmp ; [L1070] s = malloc(sizeof(SSL)) [L1071] s->s3 = malloc(sizeof(struct ssl3_state_st)) [L1072] s->ctx = malloc(sizeof(SSL_CTX)) [L1073] s->session = malloc(sizeof(SSL_SESSION)) [L1074] s->state = 8464 [L1081] BUF_MEM *buf ; [L1082] unsigned long l ; [L1083] unsigned long Time ; [L1084] unsigned long tmp ; [L1085] void (*cb)() ; [L1086] long num1 ; [L1087] int ret ; [L1088] int new_state ; [L1089] int state ; [L1090] int skip ; [L1091] int got_new_session ; [L1092] int tmp___1 = __VERIFIER_nondet_int() ; [L1093] int tmp___2 = __VERIFIER_nondet_int() ; [L1094] int tmp___3 = __VERIFIER_nondet_int() ; [L1095] int tmp___4 = __VERIFIER_nondet_int() ; [L1096] int tmp___5 = __VERIFIER_nondet_int() ; [L1097] int tmp___6 = __VERIFIER_nondet_int() ; [L1098] int tmp___7 ; [L1099] long tmp___8 = __VERIFIER_nondet_long() ; [L1100] int tmp___9 = __VERIFIER_nondet_int() ; [L1101] int tmp___10 = __VERIFIER_nondet_int() ; [L1102] int blastFlag ; [L1106] blastFlag = 0 [L1107] s->hit=__VERIFIER_nondet_int () [L1108] s->state = 8464 [L1109] tmp = __VERIFIER_nondet_int() [L1110] Time = tmp [L1111] cb = (void (*)())((void *)0) [L1112] ret = -1 [L1113] skip = 0 [L1114] got_new_session = 0 [L1115] EXPR s->info_callback VAL [init=1, SSLv3_server_data={2147483645:0}] [L1115] COND TRUE (unsigned long )s->info_callback != (unsigned long )((void *)0) [L1116] EXPR s->info_callback [L1116] cb = s->info_callback [L1120] EXPR s->in_handshake [L1120] s->in_handshake += 1 [L1121] COND FALSE !(tmp___1 & 12288) VAL [init=1, SSLv3_server_data={2147483645:0}] [L1130] EXPR s->cert VAL [init=1, SSLv3_server_data={2147483645:0}] [L1130] COND FALSE !((unsigned long )s->cert == (unsigned long )((void *)0)) [L1136] COND TRUE 1 VAL [init=1, SSLv3_server_data={2147483645:0}] [L1138] EXPR s->state [L1138] state = s->state [L1139] EXPR s->state VAL [init=1, SSLv3_server_data={2147483645:0}] [L1139] COND FALSE !(s->state == 12292) [L1142] EXPR s->state VAL [init=1, SSLv3_server_data={2147483645:0}] [L1142] COND FALSE !(s->state == 16384) [L1145] EXPR s->state VAL [init=1, SSLv3_server_data={2147483645:0}] [L1145] COND FALSE !(s->state == 8192) [L1148] EXPR s->state VAL [init=1, SSLv3_server_data={2147483645:0}] [L1148] COND FALSE !(s->state == 24576) [L1151] EXPR s->state VAL [init=1, SSLv3_server_data={2147483645:0}] [L1151] COND FALSE !(s->state == 8195) [L1154] EXPR s->state VAL [init=1, SSLv3_server_data={2147483645:0}] [L1154] COND FALSE !(s->state == 8480) [L1157] EXPR s->state VAL [init=1, SSLv3_server_data={2147483645:0}] [L1157] COND FALSE !(s->state == 8481) [L1160] EXPR s->state VAL [init=1, SSLv3_server_data={2147483645:0}] [L1160] COND FALSE !(s->state == 8482) [L1163] EXPR s->state VAL [init=1, SSLv3_server_data={2147483645:0}] [L1163] COND TRUE s->state == 8464 [L1323] s->shutdown = 0 [L1324] ret = __VERIFIER_nondet_int() [L1325] COND TRUE blastFlag == 0 [L1326] blastFlag = 1 VAL [init=1, SSLv3_server_data={2147483645:0}] [L1330] COND FALSE !(ret <= 0) [L1335] got_new_session = 1 [L1336] s->state = 8496 [L1337] s->init_num = 0 VAL [init=1, SSLv3_server_data={2147483645:0}] [L1661] EXPR s->s3 [L1661] EXPR (s->s3)->tmp.reuse_message VAL [init=1, SSLv3_server_data={2147483645:0}] [L1661] COND FALSE !(! (s->s3)->tmp.reuse_message) [L1690] skip = 0 VAL [init=1, SSLv3_server_data={2147483645:0}] [L1136] COND TRUE 1 VAL [init=1, SSLv3_server_data={2147483645:0}] [L1138] EXPR s->state [L1138] state = s->state [L1139] EXPR s->state VAL [init=1, SSLv3_server_data={2147483645:0}] [L1139] COND FALSE !(s->state == 12292) [L1142] EXPR s->state VAL [init=1, SSLv3_server_data={2147483645:0}] [L1142] COND FALSE !(s->state == 16384) [L1145] EXPR s->state VAL [init=1, SSLv3_server_data={2147483645:0}] [L1145] COND FALSE !(s->state == 8192) [L1148] EXPR s->state VAL [init=1, SSLv3_server_data={2147483645:0}] [L1148] COND FALSE !(s->state == 24576) [L1151] EXPR s->state VAL [init=1, SSLv3_server_data={2147483645:0}] [L1151] COND FALSE !(s->state == 8195) [L1154] EXPR s->state VAL [init=1, SSLv3_server_data={2147483645:0}] [L1154] COND FALSE !(s->state == 8480) [L1157] EXPR s->state VAL [init=1, SSLv3_server_data={2147483645:0}] [L1157] COND FALSE !(s->state == 8481) [L1160] EXPR s->state VAL [init=1, SSLv3_server_data={2147483645:0}] [L1160] COND FALSE !(s->state == 8482) [L1163] EXPR s->state VAL [init=1, SSLv3_server_data={2147483645:0}] [L1163] COND FALSE !(s->state == 8464) [L1166] EXPR s->state VAL [init=1, SSLv3_server_data={2147483645:0}] [L1166] COND FALSE !(s->state == 8465) [L1169] EXPR s->state VAL [init=1, SSLv3_server_data={2147483645:0}] [L1169] COND FALSE !(s->state == 8466) [L1172] EXPR s->state VAL [init=1, SSLv3_server_data={2147483645:0}] [L1172] COND TRUE s->state == 8496 [L1341] ret = __VERIFIER_nondet_int() [L1342] COND TRUE blastFlag == 1 [L1343] blastFlag = 2 VAL [init=1, SSLv3_server_data={2147483645:0}] [L1351] COND FALSE !(ret <= 0) [L1356] s->hit VAL [init=1, SSLv3_server_data={2147483645:0}] [L1356] COND TRUE s->hit [L1357] s->state = 8656 VAL [init=1, SSLv3_server_data={2147483645:0}] [L1361] s->init_num = 0 VAL [init=1, SSLv3_server_data={2147483645:0}] [L1661] EXPR s->s3 [L1661] EXPR (s->s3)->tmp.reuse_message VAL [init=1, SSLv3_server_data={2147483645:0}] [L1661] COND FALSE !(! (s->s3)->tmp.reuse_message) [L1690] skip = 0 VAL [init=1, SSLv3_server_data={2147483645:0}] [L1136] COND TRUE 1 VAL [init=1, SSLv3_server_data={2147483645:0}] [L1138] EXPR s->state [L1138] state = s->state [L1139] EXPR s->state VAL [init=1, SSLv3_server_data={2147483645:0}] [L1139] COND FALSE !(s->state == 12292) [L1142] EXPR s->state VAL [init=1, SSLv3_server_data={2147483645:0}] [L1142] COND FALSE !(s->state == 16384) [L1145] EXPR s->state VAL [init=1, SSLv3_server_data={2147483645:0}] [L1145] COND FALSE !(s->state == 8192) [L1148] EXPR s->state VAL [init=1, SSLv3_server_data={2147483645:0}] [L1148] COND FALSE !(s->state == 24576) [L1151] EXPR s->state VAL [init=1, SSLv3_server_data={2147483645:0}] [L1151] COND FALSE !(s->state == 8195) [L1154] EXPR s->state VAL [init=1, SSLv3_server_data={2147483645:0}] [L1154] COND FALSE !(s->state == 8480) [L1157] EXPR s->state VAL [init=1, SSLv3_server_data={2147483645:0}] [L1157] COND FALSE !(s->state == 8481) [L1160] EXPR s->state VAL [init=1, SSLv3_server_data={2147483645:0}] [L1160] COND FALSE !(s->state == 8482) [L1163] EXPR s->state VAL [init=1, SSLv3_server_data={2147483645:0}] [L1163] COND FALSE !(s->state == 8464) [L1166] EXPR s->state VAL [init=1, SSLv3_server_data={2147483645:0}] [L1166] COND FALSE !(s->state == 8465) [L1169] EXPR s->state VAL [init=1, SSLv3_server_data={2147483645:0}] [L1169] COND FALSE !(s->state == 8466) [L1172] EXPR s->state VAL [init=1, SSLv3_server_data={2147483645:0}] [L1172] COND FALSE !(s->state == 8496) [L1175] EXPR s->state VAL [init=1, SSLv3_server_data={2147483645:0}] [L1175] COND FALSE !(s->state == 8497) [L1178] EXPR s->state VAL [init=1, SSLv3_server_data={2147483645:0}] [L1178] COND FALSE !(s->state == 8512) [L1181] EXPR s->state VAL [init=1, SSLv3_server_data={2147483645:0}] [L1181] COND FALSE !(s->state == 8513) [L1184] EXPR s->state VAL [init=1, SSLv3_server_data={2147483645:0}] [L1184] COND FALSE !(s->state == 8528) [L1187] EXPR s->state VAL [init=1, SSLv3_server_data={2147483645:0}] [L1187] COND FALSE !(s->state == 8529) [L1190] EXPR s->state VAL [init=1, SSLv3_server_data={2147483645:0}] [L1190] COND FALSE !(s->state == 8544) [L1193] EXPR s->state VAL [init=1, SSLv3_server_data={2147483645:0}] [L1193] COND FALSE !(s->state == 8545) [L1196] EXPR s->state VAL [init=1, SSLv3_server_data={2147483645:0}] [L1196] COND FALSE !(s->state == 8560) [L1199] EXPR s->state VAL [init=1, SSLv3_server_data={2147483645:0}] [L1199] COND FALSE !(s->state == 8561) [L1202] EXPR s->state VAL [init=1, SSLv3_server_data={2147483645:0}] [L1202] COND FALSE !(s->state == 8448) [L1205] EXPR s->state VAL [init=1, SSLv3_server_data={2147483645:0}] [L1205] COND FALSE !(s->state == 8576) [L1208] EXPR s->state VAL [init=1, SSLv3_server_data={2147483645:0}] [L1208] COND FALSE !(s->state == 8577) [L1211] EXPR s->state VAL [init=1, SSLv3_server_data={2147483645:0}] [L1211] COND FALSE !(s->state == 8592) [L1214] EXPR s->state VAL [init=1, SSLv3_server_data={2147483645:0}] [L1214] COND FALSE !(s->state == 8593) [L1217] EXPR s->state VAL [init=1, SSLv3_server_data={2147483645:0}] [L1217] COND FALSE !(s->state == 8608) [L1220] EXPR s->state VAL [init=1, SSLv3_server_data={2147483645:0}] [L1220] COND FALSE !(s->state == 8609) [L1223] EXPR s->state VAL [init=1, SSLv3_server_data={2147483645:0}] [L1223] COND FALSE !(s->state == 8640) [L1226] EXPR s->state VAL [init=1, SSLv3_server_data={2147483645:0}] [L1226] COND FALSE !(s->state == 8641) [L1229] EXPR s->state VAL [init=1, SSLv3_server_data={2147483645:0}] [L1229] COND TRUE s->state == 8656 [L1554] EXPR s->session [L1554] EXPR s->s3 [L1554] EXPR (s->s3)->tmp.new_cipher [L1554] (s->session)->cipher = (s->s3)->tmp.new_cipher [L1555] COND FALSE !(! tmp___9) [L1561] ret = __VERIFIER_nondet_int() [L1562] COND TRUE blastFlag == 2 [L1563] blastFlag = 3 VAL [init=1, SSLv3_server_data={2147483645:0}] [L1567] COND FALSE !(ret <= 0) [L1572] s->state = 8672 [L1573] s->init_num = 0 VAL [init=1, SSLv3_server_data={2147483645:0}] [L1574] COND FALSE !(! tmp___10) VAL [init=1, SSLv3_server_data={2147483645:0}] [L1661] EXPR s->s3 [L1661] EXPR (s->s3)->tmp.reuse_message VAL [init=1, SSLv3_server_data={2147483645:0}] [L1661] COND FALSE !(! (s->s3)->tmp.reuse_message) [L1690] skip = 0 VAL [init=1, SSLv3_server_data={2147483645:0}] [L1136] COND TRUE 1 VAL [init=1, SSLv3_server_data={2147483645:0}] [L1138] EXPR s->state [L1138] state = s->state [L1139] EXPR s->state VAL [init=1, SSLv3_server_data={2147483645:0}] [L1139] COND FALSE !(s->state == 12292) [L1142] EXPR s->state VAL [init=1, SSLv3_server_data={2147483645:0}] [L1142] COND FALSE !(s->state == 16384) [L1145] EXPR s->state VAL [init=1, SSLv3_server_data={2147483645:0}] [L1145] COND FALSE !(s->state == 8192) [L1148] EXPR s->state VAL [init=1, SSLv3_server_data={2147483645:0}] [L1148] COND FALSE !(s->state == 24576) [L1151] EXPR s->state VAL [init=1, SSLv3_server_data={2147483645:0}] [L1151] COND FALSE !(s->state == 8195) [L1154] EXPR s->state VAL [init=1, SSLv3_server_data={2147483645:0}] [L1154] COND FALSE !(s->state == 8480) [L1157] EXPR s->state VAL [init=1, SSLv3_server_data={2147483645:0}] [L1157] COND FALSE !(s->state == 8481) [L1160] EXPR s->state VAL [init=1, SSLv3_server_data={2147483645:0}] [L1160] COND FALSE !(s->state == 8482) [L1163] EXPR s->state VAL [init=1, SSLv3_server_data={2147483645:0}] [L1163] COND FALSE !(s->state == 8464) [L1166] EXPR s->state VAL [init=1, SSLv3_server_data={2147483645:0}] [L1166] COND FALSE !(s->state == 8465) [L1169] EXPR s->state VAL [init=1, SSLv3_server_data={2147483645:0}] [L1169] COND FALSE !(s->state == 8466) [L1172] EXPR s->state VAL [init=1, SSLv3_server_data={2147483645:0}] [L1172] COND FALSE !(s->state == 8496) [L1175] EXPR s->state VAL [init=1, SSLv3_server_data={2147483645:0}] [L1175] COND FALSE !(s->state == 8497) [L1178] EXPR s->state VAL [init=1, SSLv3_server_data={2147483645:0}] [L1178] COND FALSE !(s->state == 8512) [L1181] EXPR s->state VAL [init=1, SSLv3_server_data={2147483645:0}] [L1181] COND FALSE !(s->state == 8513) [L1184] EXPR s->state VAL [init=1, SSLv3_server_data={2147483645:0}] [L1184] COND FALSE !(s->state == 8528) [L1187] EXPR s->state VAL [init=1, SSLv3_server_data={2147483645:0}] [L1187] COND FALSE !(s->state == 8529) [L1190] EXPR s->state VAL [init=1, SSLv3_server_data={2147483645:0}] [L1190] COND FALSE !(s->state == 8544) [L1193] EXPR s->state VAL [init=1, SSLv3_server_data={2147483645:0}] [L1193] COND FALSE !(s->state == 8545) [L1196] EXPR s->state VAL [init=1, SSLv3_server_data={2147483645:0}] [L1196] COND FALSE !(s->state == 8560) [L1199] EXPR s->state VAL [init=1, SSLv3_server_data={2147483645:0}] [L1199] COND FALSE !(s->state == 8561) [L1202] EXPR s->state VAL [init=1, SSLv3_server_data={2147483645:0}] [L1202] COND FALSE !(s->state == 8448) [L1205] EXPR s->state VAL [init=1, SSLv3_server_data={2147483645:0}] [L1205] COND FALSE !(s->state == 8576) [L1208] EXPR s->state VAL [init=1, SSLv3_server_data={2147483645:0}] [L1208] COND FALSE !(s->state == 8577) [L1211] EXPR s->state VAL [init=1, SSLv3_server_data={2147483645:0}] [L1211] COND FALSE !(s->state == 8592) [L1214] EXPR s->state VAL [init=1, SSLv3_server_data={2147483645:0}] [L1214] COND FALSE !(s->state == 8593) [L1217] EXPR s->state VAL [init=1, SSLv3_server_data={2147483645:0}] [L1217] COND FALSE !(s->state == 8608) [L1220] EXPR s->state VAL [init=1, SSLv3_server_data={2147483645:0}] [L1220] COND FALSE !(s->state == 8609) [L1223] EXPR s->state VAL [init=1, SSLv3_server_data={2147483645:0}] [L1223] COND FALSE !(s->state == 8640) [L1226] EXPR s->state VAL [init=1, SSLv3_server_data={2147483645:0}] [L1226] COND FALSE !(s->state == 8641) [L1229] EXPR s->state VAL [init=1, SSLv3_server_data={2147483645:0}] [L1229] COND FALSE !(s->state == 8656) [L1232] EXPR s->state VAL [init=1, SSLv3_server_data={2147483645:0}] [L1232] COND FALSE !(s->state == 8657) [L1235] EXPR s->state VAL [init=1, SSLv3_server_data={2147483645:0}] [L1235] COND TRUE s->state == 8672 [L1583] ret = __VERIFIER_nondet_int() [L1584] COND TRUE blastFlag == 3 VAL [init=1, SSLv3_server_data={2147483645:0}] [L1702] __VERIFIER_error() VAL [init=1, SSLv3_server_data={2147483645:0}] - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 143 locations, 1 error locations. Result: UNSAFE, OverallTime: 5.2s, OverallIterations: 3, TraceHistogramMax: 4, AutomataDifference: 0.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 588 SDtfs, 657 SDslu, 785 SDs, 0 SdLazy, 50 SolverSat, 19 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.6s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 292 GetRequests, 288 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=597occurred in iteration=2, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 2 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 1.2s SatisfiabilityAnalysisTime, 0.1s InterpolantComputationTime, 273 NumberOfCodeBlocks, 273 NumberOfCodeBlocksAsserted, 3 NumberOfCheckSat, 292 ConstructedInterpolants, 0 QuantifiedInterpolants, 74336 SizeOfPredicates, 1 NumberOfNonLiveVariables, 399 ConjunctsInSsa, 4 ConjunctsInUnsatCore, 4 InterpolantComputations, 4 PerfectInterpolantSequences, 116/116 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...