./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/ssh/s3_srvr.blast.11.i.cil-1.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version f470102c Calling Ultimate with: /usr/lib/jvm/java-8-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/run_dir_e150036f-40d0-47ba-bbc9-598504b52bfb/bin/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/run_dir_e150036f-40d0-47ba-bbc9-598504b52bfb/bin/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_e150036f-40d0-47ba-bbc9-598504b52bfb/bin/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_e150036f-40d0-47ba-bbc9-598504b52bfb/bin/uautomizer/config/AutomizerReach.xml -i ../../sv-benchmarks/c/ssh/s3_srvr.blast.11.i.cil-1.c -s /tmp/vcloud-vcloud-master/worker/run_dir_e150036f-40d0-47ba-bbc9-598504b52bfb/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_e150036f-40d0-47ba-bbc9-598504b52bfb/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 ca7b987059c829f244238d9119096032ac44debc ..................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... 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_e150036f-40d0-47ba-bbc9-598504b52bfb/bin/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/run_dir_e150036f-40d0-47ba-bbc9-598504b52bfb/bin/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_e150036f-40d0-47ba-bbc9-598504b52bfb/bin/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_e150036f-40d0-47ba-bbc9-598504b52bfb/bin/uautomizer/config/AutomizerReach.xml -i ../../sv-benchmarks/c/ssh/s3_srvr.blast.11.i.cil-1.c -s /tmp/vcloud-vcloud-master/worker/run_dir_e150036f-40d0-47ba-bbc9-598504b52bfb/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_e150036f-40d0-47ba-bbc9-598504b52bfb/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 ca7b987059c829f244238d9119096032ac44debc .................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... 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.25-f470102 [2019-12-07 17:12:19,641 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-07 17:12:19,643 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-07 17:12:19,651 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-07 17:12:19,652 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-07 17:12:19,652 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-07 17:12:19,653 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-07 17:12:19,655 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-07 17:12:19,656 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-07 17:12:19,657 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-07 17:12:19,658 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-07 17:12:19,658 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-07 17:12:19,659 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-07 17:12:19,659 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-07 17:12:19,660 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-07 17:12:19,661 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-07 17:12:19,661 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-07 17:12:19,662 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-07 17:12:19,663 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-07 17:12:19,664 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-07 17:12:19,666 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-07 17:12:19,666 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-07 17:12:19,667 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-07 17:12:19,667 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-07 17:12:19,669 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-07 17:12:19,669 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-07 17:12:19,669 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-07 17:12:19,670 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-07 17:12:19,670 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-07 17:12:19,671 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-07 17:12:19,671 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-07 17:12:19,671 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-07 17:12:19,672 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-07 17:12:19,673 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-07 17:12:19,673 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-07 17:12:19,674 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-07 17:12:19,674 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-07 17:12:19,674 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-07 17:12:19,674 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-07 17:12:19,675 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-07 17:12:19,676 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-07 17:12:19,676 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_e150036f-40d0-47ba-bbc9-598504b52bfb/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf [2019-12-07 17:12:19,689 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-07 17:12:19,689 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-07 17:12:19,690 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-07 17:12:19,690 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-07 17:12:19,691 INFO L138 SettingsManager]: * Use SBE=true [2019-12-07 17:12:19,691 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-07 17:12:19,691 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-07 17:12:19,691 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-07 17:12:19,691 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-07 17:12:19,691 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-07 17:12:19,692 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-07 17:12:19,692 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-07 17:12:19,692 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-07 17:12:19,692 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-07 17:12:19,692 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-07 17:12:19,693 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-07 17:12:19,693 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-07 17:12:19,693 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-07 17:12:19,693 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-12-07 17:12:19,693 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-07 17:12:19,694 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-07 17:12:19,694 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-07 17:12:19,694 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-07 17:12:19,694 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-07 17:12:19,694 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-07 17:12:19,694 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-12-07 17:12:19,695 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-07 17:12:19,695 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-07 17:12:19,695 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2019-12-07 17:12:19,695 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /tmp/vcloud-vcloud-master/worker/run_dir_e150036f-40d0-47ba-bbc9-598504b52bfb/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 -> ca7b987059c829f244238d9119096032ac44debc [2019-12-07 17:12:19,803 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-07 17:12:19,813 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-07 17:12:19,816 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-07 17:12:19,817 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-07 17:12:19,817 INFO L275 PluginConnector]: CDTParser initialized [2019-12-07 17:12:19,818 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_e150036f-40d0-47ba-bbc9-598504b52bfb/bin/uautomizer/../../sv-benchmarks/c/ssh/s3_srvr.blast.11.i.cil-1.c [2019-12-07 17:12:19,859 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_e150036f-40d0-47ba-bbc9-598504b52bfb/bin/uautomizer/data/46fa868bf/1bc0d8d4b8a9433bac67341efd59ab51/FLAG851b785f7 [2019-12-07 17:12:20,339 INFO L306 CDTParser]: Found 1 translation units. [2019-12-07 17:12:20,339 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_e150036f-40d0-47ba-bbc9-598504b52bfb/sv-benchmarks/c/ssh/s3_srvr.blast.11.i.cil-1.c [2019-12-07 17:12:20,351 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_e150036f-40d0-47ba-bbc9-598504b52bfb/bin/uautomizer/data/46fa868bf/1bc0d8d4b8a9433bac67341efd59ab51/FLAG851b785f7 [2019-12-07 17:12:20,360 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_e150036f-40d0-47ba-bbc9-598504b52bfb/bin/uautomizer/data/46fa868bf/1bc0d8d4b8a9433bac67341efd59ab51 [2019-12-07 17:12:20,362 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-07 17:12:20,363 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-12-07 17:12:20,364 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-07 17:12:20,364 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-07 17:12:20,366 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-07 17:12:20,366 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.12 05:12:20" (1/1) ... [2019-12-07 17:12:20,368 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@8207e9e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 05:12:20, skipping insertion in model container [2019-12-07 17:12:20,368 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.12 05:12:20" (1/1) ... [2019-12-07 17:12:20,373 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-07 17:12:20,408 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-07 17:12:20,677 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-07 17:12:20,687 INFO L203 MainTranslator]: Completed pre-run [2019-12-07 17:12:20,747 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-07 17:12:20,761 INFO L208 MainTranslator]: Completed translation [2019-12-07 17:12:20,762 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 05:12:20 WrapperNode [2019-12-07 17:12:20,762 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-07 17:12:20,762 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-07 17:12:20,762 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-07 17:12:20,763 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-07 17:12:20,768 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 05:12:20" (1/1) ... [2019-12-07 17:12:20,785 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 05:12:20" (1/1) ... [2019-12-07 17:12:20,814 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-07 17:12:20,814 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-07 17:12:20,814 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-07 17:12:20,814 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-07 17:12:20,821 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 05:12:20" (1/1) ... [2019-12-07 17:12:20,821 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 05:12:20" (1/1) ... [2019-12-07 17:12:20,828 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 05:12:20" (1/1) ... [2019-12-07 17:12:20,828 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 05:12:20" (1/1) ... [2019-12-07 17:12:20,853 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 05:12:20" (1/1) ... [2019-12-07 17:12:20,860 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 05:12:20" (1/1) ... [2019-12-07 17:12:20,862 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 05:12:20" (1/1) ... [2019-12-07 17:12:20,866 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-07 17:12:20,866 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-07 17:12:20,866 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-07 17:12:20,866 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-07 17:12:20,867 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 05:12:20" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_e150036f-40d0-47ba-bbc9-598504b52bfb/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-12-07 17:12:20,907 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2019-12-07 17:12:20,907 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-12-07 17:12:20,908 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-12-07 17:12:20,908 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-12-07 17:12:20,908 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2019-12-07 17:12:20,908 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2019-12-07 17:12:20,908 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-07 17:12:20,908 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-07 17:12:21,067 WARN L738 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-12-07 17:12:21,532 INFO L691 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##87: assume false; [2019-12-07 17:12:21,532 INFO L691 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##88: assume !false; [2019-12-07 17:12:21,533 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-07 17:12:21,533 INFO L287 CfgBuilder]: Removed 7 assume(true) statements. [2019-12-07 17:12:21,534 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 05:12:21 BoogieIcfgContainer [2019-12-07 17:12:21,534 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-07 17:12:21,535 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-07 17:12:21,535 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-07 17:12:21,537 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-07 17:12:21,537 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.12 05:12:20" (1/3) ... [2019-12-07 17:12:21,537 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@67dfcf42 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.12 05:12:21, skipping insertion in model container [2019-12-07 17:12:21,537 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 05:12:20" (2/3) ... [2019-12-07 17:12:21,538 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@67dfcf42 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.12 05:12:21, skipping insertion in model container [2019-12-07 17:12:21,538 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 05:12:21" (3/3) ... [2019-12-07 17:12:21,539 INFO L109 eAbstractionObserver]: Analyzing ICFG s3_srvr.blast.11.i.cil-1.c [2019-12-07 17:12:21,545 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-07 17:12:21,549 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-12-07 17:12:21,556 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-12-07 17:12:21,572 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-07 17:12:21,572 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-07 17:12:21,572 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-07 17:12:21,572 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-12-07 17:12:21,572 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-07 17:12:21,573 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-07 17:12:21,573 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-07 17:12:21,573 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-07 17:12:21,585 INFO L276 IsEmpty]: Start isEmpty. Operand 148 states. [2019-12-07 17:12:21,591 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2019-12-07 17:12:21,591 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:12:21,591 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] [2019-12-07 17:12:21,591 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 17:12:21,595 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:12:21,595 INFO L82 PathProgramCache]: Analyzing trace with hash -2031756972, now seen corresponding path program 1 times [2019-12-07 17:12:21,601 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 17:12:21,601 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [719241191] [2019-12-07 17:12:21,601 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 17:12:21,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:12:21,802 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 17:12:21,803 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [719241191] [2019-12-07 17:12:21,803 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 17:12:21,803 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 17:12:21,804 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [12426970] [2019-12-07 17:12:21,807 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 17:12:21,807 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 17:12:21,815 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 17:12:21,816 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 17:12:21,817 INFO L87 Difference]: Start difference. First operand 148 states. Second operand 4 states. [2019-12-07 17:12:22,162 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 17:12:22,162 INFO L93 Difference]: Finished difference Result 323 states and 547 transitions. [2019-12-07 17:12:22,163 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 17:12:22,164 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 35 [2019-12-07 17:12:22,164 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 17:12:22,176 INFO L225 Difference]: With dead ends: 323 [2019-12-07 17:12:22,176 INFO L226 Difference]: Without dead ends: 163 [2019-12-07 17:12:22,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-12-07 17:12:22,196 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 163 states. [2019-12-07 17:12:22,216 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 163 to 146. [2019-12-07 17:12:22,217 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 146 states. [2019-12-07 17:12:22,218 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 146 states to 146 states and 226 transitions. [2019-12-07 17:12:22,219 INFO L78 Accepts]: Start accepts. Automaton has 146 states and 226 transitions. Word has length 35 [2019-12-07 17:12:22,219 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 17:12:22,220 INFO L462 AbstractCegarLoop]: Abstraction has 146 states and 226 transitions. [2019-12-07 17:12:22,220 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 17:12:22,220 INFO L276 IsEmpty]: Start isEmpty. Operand 146 states and 226 transitions. [2019-12-07 17:12:22,221 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2019-12-07 17:12:22,221 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:12:22,222 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] [2019-12-07 17:12:22,222 INFO L410 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 17:12:22,222 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:12:22,223 INFO L82 PathProgramCache]: Analyzing trace with hash 2027967358, now seen corresponding path program 1 times [2019-12-07 17:12:22,223 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 17:12:22,223 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1094078571] [2019-12-07 17:12:22,223 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 17:12:22,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:12:22,295 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 17:12:22,296 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1094078571] [2019-12-07 17:12:22,296 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 17:12:22,296 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 17:12:22,296 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [202387060] [2019-12-07 17:12:22,297 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 17:12:22,297 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 17:12:22,298 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 17:12:22,298 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 17:12:22,298 INFO L87 Difference]: Start difference. First operand 146 states and 226 transitions. Second operand 4 states. [2019-12-07 17:12:22,529 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 17:12:22,529 INFO L93 Difference]: Finished difference Result 290 states and 443 transitions. [2019-12-07 17:12:22,529 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 17:12:22,530 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 48 [2019-12-07 17:12:22,530 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 17:12:22,531 INFO L225 Difference]: With dead ends: 290 [2019-12-07 17:12:22,531 INFO L226 Difference]: Without dead ends: 163 [2019-12-07 17:12:22,532 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-12-07 17:12:22,533 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 163 states. [2019-12-07 17:12:22,540 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 163 to 146. [2019-12-07 17:12:22,540 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 146 states. [2019-12-07 17:12:22,541 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 146 states to 146 states and 225 transitions. [2019-12-07 17:12:22,541 INFO L78 Accepts]: Start accepts. Automaton has 146 states and 225 transitions. Word has length 48 [2019-12-07 17:12:22,541 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 17:12:22,541 INFO L462 AbstractCegarLoop]: Abstraction has 146 states and 225 transitions. [2019-12-07 17:12:22,541 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 17:12:22,541 INFO L276 IsEmpty]: Start isEmpty. Operand 146 states and 225 transitions. [2019-12-07 17:12:22,543 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2019-12-07 17:12:22,543 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:12:22,543 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] [2019-12-07 17:12:22,543 INFO L410 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 17:12:22,543 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:12:22,543 INFO L82 PathProgramCache]: Analyzing trace with hash -1944321008, now seen corresponding path program 1 times [2019-12-07 17:12:22,543 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 17:12:22,544 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [315786658] [2019-12-07 17:12:22,544 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 17:12:22,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:12:22,607 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 17:12:22,607 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [315786658] [2019-12-07 17:12:22,608 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 17:12:22,608 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 17:12:22,608 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1223969492] [2019-12-07 17:12:22,609 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 17:12:22,609 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 17:12:22,609 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 17:12:22,609 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 17:12:22,609 INFO L87 Difference]: Start difference. First operand 146 states and 225 transitions. Second operand 4 states. [2019-12-07 17:12:22,816 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 17:12:22,816 INFO L93 Difference]: Finished difference Result 289 states and 441 transitions. [2019-12-07 17:12:22,817 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 17:12:22,817 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 49 [2019-12-07 17:12:22,817 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 17:12:22,818 INFO L225 Difference]: With dead ends: 289 [2019-12-07 17:12:22,818 INFO L226 Difference]: Without dead ends: 162 [2019-12-07 17:12:22,819 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-12-07 17:12:22,819 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 162 states. [2019-12-07 17:12:22,825 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 162 to 146. [2019-12-07 17:12:22,825 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 146 states. [2019-12-07 17:12:22,826 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 146 states to 146 states and 224 transitions. [2019-12-07 17:12:22,826 INFO L78 Accepts]: Start accepts. Automaton has 146 states and 224 transitions. Word has length 49 [2019-12-07 17:12:22,826 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 17:12:22,826 INFO L462 AbstractCegarLoop]: Abstraction has 146 states and 224 transitions. [2019-12-07 17:12:22,826 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 17:12:22,826 INFO L276 IsEmpty]: Start isEmpty. Operand 146 states and 224 transitions. [2019-12-07 17:12:22,827 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2019-12-07 17:12:22,827 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:12:22,827 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] [2019-12-07 17:12:22,827 INFO L410 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 17:12:22,827 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:12:22,827 INFO L82 PathProgramCache]: Analyzing trace with hash -2008072389, now seen corresponding path program 1 times [2019-12-07 17:12:22,828 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 17:12:22,828 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [371924321] [2019-12-07 17:12:22,828 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 17:12:22,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:12:22,873 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 17:12:22,874 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [371924321] [2019-12-07 17:12:22,874 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 17:12:22,874 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 17:12:22,874 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1308093522] [2019-12-07 17:12:22,874 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 17:12:22,874 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 17:12:22,875 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 17:12:22,875 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 17:12:22,875 INFO L87 Difference]: Start difference. First operand 146 states and 224 transitions. Second operand 4 states. [2019-12-07 17:12:23,065 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 17:12:23,065 INFO L93 Difference]: Finished difference Result 287 states and 438 transitions. [2019-12-07 17:12:23,066 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 17:12:23,066 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 49 [2019-12-07 17:12:23,066 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 17:12:23,067 INFO L225 Difference]: With dead ends: 287 [2019-12-07 17:12:23,067 INFO L226 Difference]: Without dead ends: 160 [2019-12-07 17:12:23,068 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-12-07 17:12:23,069 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 160 states. [2019-12-07 17:12:23,075 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 160 to 146. [2019-12-07 17:12:23,075 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 146 states. [2019-12-07 17:12:23,076 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 146 states to 146 states and 223 transitions. [2019-12-07 17:12:23,076 INFO L78 Accepts]: Start accepts. Automaton has 146 states and 223 transitions. Word has length 49 [2019-12-07 17:12:23,076 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 17:12:23,076 INFO L462 AbstractCegarLoop]: Abstraction has 146 states and 223 transitions. [2019-12-07 17:12:23,076 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 17:12:23,076 INFO L276 IsEmpty]: Start isEmpty. Operand 146 states and 223 transitions. [2019-12-07 17:12:23,077 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2019-12-07 17:12:23,077 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:12:23,078 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] [2019-12-07 17:12:23,078 INFO L410 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 17:12:23,078 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:12:23,078 INFO L82 PathProgramCache]: Analyzing trace with hash -1467926917, now seen corresponding path program 1 times [2019-12-07 17:12:23,078 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 17:12:23,078 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [55619233] [2019-12-07 17:12:23,079 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 17:12:23,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:12:23,131 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 17:12:23,132 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [55619233] [2019-12-07 17:12:23,132 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 17:12:23,132 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 17:12:23,132 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [767417595] [2019-12-07 17:12:23,132 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 17:12:23,132 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 17:12:23,132 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 17:12:23,133 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 17:12:23,133 INFO L87 Difference]: Start difference. First operand 146 states and 223 transitions. Second operand 4 states. [2019-12-07 17:12:23,365 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 17:12:23,365 INFO L93 Difference]: Finished difference Result 286 states and 436 transitions. [2019-12-07 17:12:23,365 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 17:12:23,365 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 49 [2019-12-07 17:12:23,366 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 17:12:23,366 INFO L225 Difference]: With dead ends: 286 [2019-12-07 17:12:23,366 INFO L226 Difference]: Without dead ends: 159 [2019-12-07 17:12:23,367 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-12-07 17:12:23,367 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 159 states. [2019-12-07 17:12:23,371 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 159 to 146. [2019-12-07 17:12:23,371 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 146 states. [2019-12-07 17:12:23,371 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 146 states to 146 states and 222 transitions. [2019-12-07 17:12:23,372 INFO L78 Accepts]: Start accepts. Automaton has 146 states and 222 transitions. Word has length 49 [2019-12-07 17:12:23,372 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 17:12:23,372 INFO L462 AbstractCegarLoop]: Abstraction has 146 states and 222 transitions. [2019-12-07 17:12:23,372 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 17:12:23,372 INFO L276 IsEmpty]: Start isEmpty. Operand 146 states and 222 transitions. [2019-12-07 17:12:23,372 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2019-12-07 17:12:23,373 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:12:23,373 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] [2019-12-07 17:12:23,373 INFO L410 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 17:12:23,373 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:12:23,373 INFO L82 PathProgramCache]: Analyzing trace with hash -1078741852, now seen corresponding path program 1 times [2019-12-07 17:12:23,373 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 17:12:23,373 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [827263548] [2019-12-07 17:12:23,373 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 17:12:23,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:12:23,409 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 17:12:23,409 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [827263548] [2019-12-07 17:12:23,409 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 17:12:23,409 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 17:12:23,409 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [472619202] [2019-12-07 17:12:23,410 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 17:12:23,410 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 17:12:23,410 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 17:12:23,410 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 17:12:23,410 INFO L87 Difference]: Start difference. First operand 146 states and 222 transitions. Second operand 4 states. [2019-12-07 17:12:23,588 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 17:12:23,589 INFO L93 Difference]: Finished difference Result 286 states and 435 transitions. [2019-12-07 17:12:23,589 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 17:12:23,589 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 49 [2019-12-07 17:12:23,589 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 17:12:23,590 INFO L225 Difference]: With dead ends: 286 [2019-12-07 17:12:23,590 INFO L226 Difference]: Without dead ends: 159 [2019-12-07 17:12:23,591 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-12-07 17:12:23,591 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 159 states. [2019-12-07 17:12:23,594 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 159 to 146. [2019-12-07 17:12:23,594 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 146 states. [2019-12-07 17:12:23,594 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 146 states to 146 states and 221 transitions. [2019-12-07 17:12:23,594 INFO L78 Accepts]: Start accepts. Automaton has 146 states and 221 transitions. Word has length 49 [2019-12-07 17:12:23,594 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 17:12:23,595 INFO L462 AbstractCegarLoop]: Abstraction has 146 states and 221 transitions. [2019-12-07 17:12:23,595 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 17:12:23,595 INFO L276 IsEmpty]: Start isEmpty. Operand 146 states and 221 transitions. [2019-12-07 17:12:23,595 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2019-12-07 17:12:23,595 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:12:23,595 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] [2019-12-07 17:12:23,596 INFO L410 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 17:12:23,596 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:12:23,596 INFO L82 PathProgramCache]: Analyzing trace with hash 231094087, now seen corresponding path program 1 times [2019-12-07 17:12:23,596 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 17:12:23,596 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1923564470] [2019-12-07 17:12:23,596 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 17:12:23,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:12:23,637 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 17:12:23,637 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1923564470] [2019-12-07 17:12:23,637 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 17:12:23,637 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 17:12:23,637 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [6505888] [2019-12-07 17:12:23,638 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 17:12:23,638 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 17:12:23,638 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 17:12:23,638 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 17:12:23,638 INFO L87 Difference]: Start difference. First operand 146 states and 221 transitions. Second operand 4 states. [2019-12-07 17:12:23,822 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 17:12:23,822 INFO L93 Difference]: Finished difference Result 286 states and 434 transitions. [2019-12-07 17:12:23,822 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 17:12:23,822 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 50 [2019-12-07 17:12:23,822 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 17:12:23,823 INFO L225 Difference]: With dead ends: 286 [2019-12-07 17:12:23,823 INFO L226 Difference]: Without dead ends: 159 [2019-12-07 17:12:23,824 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-07 17:12:23,824 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 159 states. [2019-12-07 17:12:23,826 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 159 to 146. [2019-12-07 17:12:23,826 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 146 states. [2019-12-07 17:12:23,827 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 146 states to 146 states and 220 transitions. [2019-12-07 17:12:23,827 INFO L78 Accepts]: Start accepts. Automaton has 146 states and 220 transitions. Word has length 50 [2019-12-07 17:12:23,827 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 17:12:23,827 INFO L462 AbstractCegarLoop]: Abstraction has 146 states and 220 transitions. [2019-12-07 17:12:23,827 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 17:12:23,827 INFO L276 IsEmpty]: Start isEmpty. Operand 146 states and 220 transitions. [2019-12-07 17:12:23,827 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2019-12-07 17:12:23,827 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:12:23,828 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] [2019-12-07 17:12:23,828 INFO L410 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 17:12:23,828 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:12:23,828 INFO L82 PathProgramCache]: Analyzing trace with hash 1862851913, now seen corresponding path program 1 times [2019-12-07 17:12:23,828 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 17:12:23,828 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1928995244] [2019-12-07 17:12:23,828 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 17:12:23,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:12:23,860 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 17:12:23,860 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1928995244] [2019-12-07 17:12:23,860 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 17:12:23,860 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 17:12:23,860 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2014155023] [2019-12-07 17:12:23,861 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 17:12:23,861 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 17:12:23,861 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 17:12:23,861 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 17:12:23,861 INFO L87 Difference]: Start difference. First operand 146 states and 220 transitions. Second operand 4 states. [2019-12-07 17:12:24,082 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 17:12:24,082 INFO L93 Difference]: Finished difference Result 286 states and 433 transitions. [2019-12-07 17:12:24,082 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 17:12:24,082 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 51 [2019-12-07 17:12:24,083 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 17:12:24,083 INFO L225 Difference]: With dead ends: 286 [2019-12-07 17:12:24,083 INFO L226 Difference]: Without dead ends: 159 [2019-12-07 17:12:24,084 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-12-07 17:12:24,084 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 159 states. [2019-12-07 17:12:24,086 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 159 to 146. [2019-12-07 17:12:24,086 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 146 states. [2019-12-07 17:12:24,087 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 146 states to 146 states and 219 transitions. [2019-12-07 17:12:24,087 INFO L78 Accepts]: Start accepts. Automaton has 146 states and 219 transitions. Word has length 51 [2019-12-07 17:12:24,087 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 17:12:24,087 INFO L462 AbstractCegarLoop]: Abstraction has 146 states and 219 transitions. [2019-12-07 17:12:24,087 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 17:12:24,087 INFO L276 IsEmpty]: Start isEmpty. Operand 146 states and 219 transitions. [2019-12-07 17:12:24,087 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2019-12-07 17:12:24,088 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:12:24,088 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] [2019-12-07 17:12:24,088 INFO L410 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 17:12:24,088 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:12:24,088 INFO L82 PathProgramCache]: Analyzing trace with hash 589286348, now seen corresponding path program 1 times [2019-12-07 17:12:24,088 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 17:12:24,088 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [970083820] [2019-12-07 17:12:24,088 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 17:12:24,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:12:24,119 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 17:12:24,119 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [970083820] [2019-12-07 17:12:24,119 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 17:12:24,119 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 17:12:24,119 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1264935717] [2019-12-07 17:12:24,119 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 17:12:24,119 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 17:12:24,120 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 17:12:24,120 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 17:12:24,120 INFO L87 Difference]: Start difference. First operand 146 states and 219 transitions. Second operand 4 states. [2019-12-07 17:12:24,289 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 17:12:24,289 INFO L93 Difference]: Finished difference Result 276 states and 419 transitions. [2019-12-07 17:12:24,289 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 17:12:24,289 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 52 [2019-12-07 17:12:24,289 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 17:12:24,290 INFO L225 Difference]: With dead ends: 276 [2019-12-07 17:12:24,290 INFO L226 Difference]: Without dead ends: 149 [2019-12-07 17:12:24,290 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-12-07 17:12:24,291 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 149 states. [2019-12-07 17:12:24,293 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 149 to 146. [2019-12-07 17:12:24,293 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 146 states. [2019-12-07 17:12:24,293 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 146 states to 146 states and 218 transitions. [2019-12-07 17:12:24,293 INFO L78 Accepts]: Start accepts. Automaton has 146 states and 218 transitions. Word has length 52 [2019-12-07 17:12:24,294 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 17:12:24,294 INFO L462 AbstractCegarLoop]: Abstraction has 146 states and 218 transitions. [2019-12-07 17:12:24,294 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 17:12:24,294 INFO L276 IsEmpty]: Start isEmpty. Operand 146 states and 218 transitions. [2019-12-07 17:12:24,294 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2019-12-07 17:12:24,294 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:12:24,294 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] [2019-12-07 17:12:24,294 INFO L410 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 17:12:24,295 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:12:24,295 INFO L82 PathProgramCache]: Analyzing trace with hash -350273228, now seen corresponding path program 1 times [2019-12-07 17:12:24,295 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 17:12:24,295 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [137221734] [2019-12-07 17:12:24,295 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 17:12:24,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:12:24,329 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 17:12:24,329 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [137221734] [2019-12-07 17:12:24,329 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 17:12:24,329 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 17:12:24,330 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2001554485] [2019-12-07 17:12:24,330 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 17:12:24,330 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 17:12:24,330 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 17:12:24,330 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 17:12:24,330 INFO L87 Difference]: Start difference. First operand 146 states and 218 transitions. Second operand 4 states. [2019-12-07 17:12:24,547 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 17:12:24,547 INFO L93 Difference]: Finished difference Result 316 states and 480 transitions. [2019-12-07 17:12:24,548 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 17:12:24,548 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 52 [2019-12-07 17:12:24,548 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 17:12:24,550 INFO L225 Difference]: With dead ends: 316 [2019-12-07 17:12:24,550 INFO L226 Difference]: Without dead ends: 189 [2019-12-07 17:12:24,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-12-07 17:12:24,551 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 189 states. [2019-12-07 17:12:24,554 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 189 to 168. [2019-12-07 17:12:24,554 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 168 states. [2019-12-07 17:12:24,555 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 168 states to 168 states and 256 transitions. [2019-12-07 17:12:24,555 INFO L78 Accepts]: Start accepts. Automaton has 168 states and 256 transitions. Word has length 52 [2019-12-07 17:12:24,556 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 17:12:24,556 INFO L462 AbstractCegarLoop]: Abstraction has 168 states and 256 transitions. [2019-12-07 17:12:24,556 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 17:12:24,556 INFO L276 IsEmpty]: Start isEmpty. Operand 168 states and 256 transitions. [2019-12-07 17:12:24,556 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-07 17:12:24,557 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:12:24,557 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] [2019-12-07 17:12:24,557 INFO L410 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 17:12:24,557 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:12:24,557 INFO L82 PathProgramCache]: Analyzing trace with hash 1467398046, now seen corresponding path program 1 times [2019-12-07 17:12:24,557 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 17:12:24,558 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [545985507] [2019-12-07 17:12:24,558 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 17:12:24,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:12:24,601 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 30 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 17:12:24,601 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [545985507] [2019-12-07 17:12:24,601 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 17:12:24,601 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 17:12:24,601 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2109348471] [2019-12-07 17:12:24,602 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 17:12:24,602 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 17:12:24,602 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 17:12:24,602 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 17:12:24,602 INFO L87 Difference]: Start difference. First operand 168 states and 256 transitions. Second operand 4 states. [2019-12-07 17:12:24,825 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 17:12:24,825 INFO L93 Difference]: Finished difference Result 338 states and 517 transitions. [2019-12-07 17:12:24,825 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 17:12:24,826 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 65 [2019-12-07 17:12:24,826 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 17:12:24,827 INFO L225 Difference]: With dead ends: 338 [2019-12-07 17:12:24,827 INFO L226 Difference]: Without dead ends: 189 [2019-12-07 17:12:24,827 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-12-07 17:12:24,827 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 189 states. [2019-12-07 17:12:24,830 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 189 to 168. [2019-12-07 17:12:24,830 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 168 states. [2019-12-07 17:12:24,830 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 168 states to 168 states and 255 transitions. [2019-12-07 17:12:24,831 INFO L78 Accepts]: Start accepts. Automaton has 168 states and 255 transitions. Word has length 65 [2019-12-07 17:12:24,831 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 17:12:24,831 INFO L462 AbstractCegarLoop]: Abstraction has 168 states and 255 transitions. [2019-12-07 17:12:24,831 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 17:12:24,831 INFO L276 IsEmpty]: Start isEmpty. Operand 168 states and 255 transitions. [2019-12-07 17:12:24,832 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-12-07 17:12:24,832 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:12:24,832 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] [2019-12-07 17:12:24,832 INFO L410 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 17:12:24,832 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:12:24,832 INFO L82 PathProgramCache]: Analyzing trace with hash -2142100496, now seen corresponding path program 1 times [2019-12-07 17:12:24,833 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 17:12:24,833 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1503116220] [2019-12-07 17:12:24,833 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 17:12:24,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:12:24,866 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 20 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 17:12:24,867 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1503116220] [2019-12-07 17:12:24,867 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 17:12:24,867 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 17:12:24,867 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1682320341] [2019-12-07 17:12:24,867 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 17:12:24,867 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 17:12:24,867 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 17:12:24,868 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 17:12:24,868 INFO L87 Difference]: Start difference. First operand 168 states and 255 transitions. Second operand 4 states. [2019-12-07 17:12:25,072 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 17:12:25,072 INFO L93 Difference]: Finished difference Result 337 states and 514 transitions. [2019-12-07 17:12:25,073 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 17:12:25,073 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 66 [2019-12-07 17:12:25,073 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 17:12:25,074 INFO L225 Difference]: With dead ends: 337 [2019-12-07 17:12:25,074 INFO L226 Difference]: Without dead ends: 188 [2019-12-07 17:12:25,074 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-12-07 17:12:25,075 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 188 states. [2019-12-07 17:12:25,077 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 188 to 168. [2019-12-07 17:12:25,077 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 168 states. [2019-12-07 17:12:25,078 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 168 states to 168 states and 254 transitions. [2019-12-07 17:12:25,078 INFO L78 Accepts]: Start accepts. Automaton has 168 states and 254 transitions. Word has length 66 [2019-12-07 17:12:25,078 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 17:12:25,078 INFO L462 AbstractCegarLoop]: Abstraction has 168 states and 254 transitions. [2019-12-07 17:12:25,078 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 17:12:25,078 INFO L276 IsEmpty]: Start isEmpty. Operand 168 states and 254 transitions. [2019-12-07 17:12:25,078 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-12-07 17:12:25,079 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:12:25,079 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] [2019-12-07 17:12:25,079 INFO L410 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 17:12:25,079 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:12:25,079 INFO L82 PathProgramCache]: Analyzing trace with hash 2089115419, now seen corresponding path program 1 times [2019-12-07 17:12:25,079 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 17:12:25,079 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1306096944] [2019-12-07 17:12:25,079 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 17:12:25,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:12:25,106 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 32 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 17:12:25,107 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1306096944] [2019-12-07 17:12:25,107 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 17:12:25,107 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 17:12:25,107 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [313603237] [2019-12-07 17:12:25,107 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 17:12:25,107 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 17:12:25,107 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 17:12:25,108 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 17:12:25,108 INFO L87 Difference]: Start difference. First operand 168 states and 254 transitions. Second operand 4 states. [2019-12-07 17:12:25,302 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 17:12:25,302 INFO L93 Difference]: Finished difference Result 335 states and 510 transitions. [2019-12-07 17:12:25,303 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 17:12:25,303 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 66 [2019-12-07 17:12:25,303 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 17:12:25,304 INFO L225 Difference]: With dead ends: 335 [2019-12-07 17:12:25,304 INFO L226 Difference]: Without dead ends: 186 [2019-12-07 17:12:25,304 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-12-07 17:12:25,305 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 186 states. [2019-12-07 17:12:25,307 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 186 to 168. [2019-12-07 17:12:25,307 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 168 states. [2019-12-07 17:12:25,308 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 168 states to 168 states and 253 transitions. [2019-12-07 17:12:25,308 INFO L78 Accepts]: Start accepts. Automaton has 168 states and 253 transitions. Word has length 66 [2019-12-07 17:12:25,308 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 17:12:25,308 INFO L462 AbstractCegarLoop]: Abstraction has 168 states and 253 transitions. [2019-12-07 17:12:25,308 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 17:12:25,308 INFO L276 IsEmpty]: Start isEmpty. Operand 168 states and 253 transitions. [2019-12-07 17:12:25,309 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-12-07 17:12:25,309 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:12:25,309 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] [2019-12-07 17:12:25,309 INFO L410 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 17:12:25,309 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:12:25,310 INFO L82 PathProgramCache]: Analyzing trace with hash -1665706405, now seen corresponding path program 1 times [2019-12-07 17:12:25,310 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 17:12:25,310 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1109600066] [2019-12-07 17:12:25,310 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 17:12:25,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:12:25,338 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 34 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 17:12:25,338 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1109600066] [2019-12-07 17:12:25,338 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 17:12:25,338 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 17:12:25,338 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1104138884] [2019-12-07 17:12:25,338 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 17:12:25,338 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 17:12:25,339 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 17:12:25,339 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 17:12:25,339 INFO L87 Difference]: Start difference. First operand 168 states and 253 transitions. Second operand 4 states. [2019-12-07 17:12:25,591 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 17:12:25,591 INFO L93 Difference]: Finished difference Result 334 states and 507 transitions. [2019-12-07 17:12:25,592 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 17:12:25,592 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 66 [2019-12-07 17:12:25,592 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 17:12:25,593 INFO L225 Difference]: With dead ends: 334 [2019-12-07 17:12:25,593 INFO L226 Difference]: Without dead ends: 185 [2019-12-07 17:12:25,593 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-12-07 17:12:25,594 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 185 states. [2019-12-07 17:12:25,596 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 185 to 168. [2019-12-07 17:12:25,596 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 168 states. [2019-12-07 17:12:25,597 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 168 states to 168 states and 252 transitions. [2019-12-07 17:12:25,597 INFO L78 Accepts]: Start accepts. Automaton has 168 states and 252 transitions. Word has length 66 [2019-12-07 17:12:25,597 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 17:12:25,597 INFO L462 AbstractCegarLoop]: Abstraction has 168 states and 252 transitions. [2019-12-07 17:12:25,597 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 17:12:25,597 INFO L276 IsEmpty]: Start isEmpty. Operand 168 states and 252 transitions. [2019-12-07 17:12:25,597 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-12-07 17:12:25,598 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:12:25,598 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] [2019-12-07 17:12:25,598 INFO L410 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 17:12:25,598 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:12:25,598 INFO L82 PathProgramCache]: Analyzing trace with hash -1276521340, now seen corresponding path program 1 times [2019-12-07 17:12:25,598 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 17:12:25,598 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1225282351] [2019-12-07 17:12:25,598 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 17:12:25,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:12:25,632 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 22 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 17:12:25,632 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1225282351] [2019-12-07 17:12:25,633 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 17:12:25,633 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 17:12:25,633 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1339651376] [2019-12-07 17:12:25,633 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 17:12:25,633 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 17:12:25,633 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 17:12:25,633 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 17:12:25,633 INFO L87 Difference]: Start difference. First operand 168 states and 252 transitions. Second operand 4 states. [2019-12-07 17:12:25,862 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 17:12:25,862 INFO L93 Difference]: Finished difference Result 334 states and 505 transitions. [2019-12-07 17:12:25,862 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 17:12:25,863 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 66 [2019-12-07 17:12:25,863 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 17:12:25,864 INFO L225 Difference]: With dead ends: 334 [2019-12-07 17:12:25,864 INFO L226 Difference]: Without dead ends: 185 [2019-12-07 17:12:25,864 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-12-07 17:12:25,864 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 185 states. [2019-12-07 17:12:25,867 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 185 to 168. [2019-12-07 17:12:25,867 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 168 states. [2019-12-07 17:12:25,867 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 168 states to 168 states and 251 transitions. [2019-12-07 17:12:25,867 INFO L78 Accepts]: Start accepts. Automaton has 168 states and 251 transitions. Word has length 66 [2019-12-07 17:12:25,868 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 17:12:25,868 INFO L462 AbstractCegarLoop]: Abstraction has 168 states and 251 transitions. [2019-12-07 17:12:25,868 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 17:12:25,868 INFO L276 IsEmpty]: Start isEmpty. Operand 168 states and 251 transitions. [2019-12-07 17:12:25,868 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-12-07 17:12:25,868 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:12:25,868 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] [2019-12-07 17:12:25,868 INFO L410 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 17:12:25,869 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:12:25,869 INFO L82 PathProgramCache]: Analyzing trace with hash -1605102745, now seen corresponding path program 1 times [2019-12-07 17:12:25,869 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 17:12:25,869 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2014662222] [2019-12-07 17:12:25,869 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 17:12:25,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:12:25,895 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 24 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 17:12:25,896 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2014662222] [2019-12-07 17:12:25,896 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 17:12:25,896 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 17:12:25,896 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [21023498] [2019-12-07 17:12:25,896 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 17:12:25,897 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 17:12:25,897 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 17:12:25,897 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 17:12:25,897 INFO L87 Difference]: Start difference. First operand 168 states and 251 transitions. Second operand 4 states. [2019-12-07 17:12:26,125 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 17:12:26,126 INFO L93 Difference]: Finished difference Result 334 states and 503 transitions. [2019-12-07 17:12:26,126 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 17:12:26,126 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 67 [2019-12-07 17:12:26,126 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 17:12:26,127 INFO L225 Difference]: With dead ends: 334 [2019-12-07 17:12:26,127 INFO L226 Difference]: Without dead ends: 185 [2019-12-07 17:12:26,128 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-12-07 17:12:26,128 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 185 states. [2019-12-07 17:12:26,130 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 185 to 168. [2019-12-07 17:12:26,130 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 168 states. [2019-12-07 17:12:26,131 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 168 states to 168 states and 250 transitions. [2019-12-07 17:12:26,131 INFO L78 Accepts]: Start accepts. Automaton has 168 states and 250 transitions. Word has length 67 [2019-12-07 17:12:26,131 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 17:12:26,131 INFO L462 AbstractCegarLoop]: Abstraction has 168 states and 250 transitions. [2019-12-07 17:12:26,131 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 17:12:26,132 INFO L276 IsEmpty]: Start isEmpty. Operand 168 states and 250 transitions. [2019-12-07 17:12:26,132 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2019-12-07 17:12:26,132 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:12:26,132 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] [2019-12-07 17:12:26,133 INFO L410 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 17:12:26,133 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:12:26,133 INFO L82 PathProgramCache]: Analyzing trace with hash 775324969, now seen corresponding path program 1 times [2019-12-07 17:12:26,133 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 17:12:26,133 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1176453493] [2019-12-07 17:12:26,133 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 17:12:26,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:12:26,166 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 26 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 17:12:26,166 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1176453493] [2019-12-07 17:12:26,166 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 17:12:26,166 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 17:12:26,166 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1302841437] [2019-12-07 17:12:26,166 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 17:12:26,166 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 17:12:26,167 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 17:12:26,167 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 17:12:26,167 INFO L87 Difference]: Start difference. First operand 168 states and 250 transitions. Second operand 4 states. [2019-12-07 17:12:26,381 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 17:12:26,381 INFO L93 Difference]: Finished difference Result 334 states and 501 transitions. [2019-12-07 17:12:26,382 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 17:12:26,382 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 68 [2019-12-07 17:12:26,382 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 17:12:26,383 INFO L225 Difference]: With dead ends: 334 [2019-12-07 17:12:26,383 INFO L226 Difference]: Without dead ends: 185 [2019-12-07 17:12:26,383 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-12-07 17:12:26,384 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 185 states. [2019-12-07 17:12:26,386 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 185 to 168. [2019-12-07 17:12:26,386 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 168 states. [2019-12-07 17:12:26,386 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 168 states to 168 states and 249 transitions. [2019-12-07 17:12:26,386 INFO L78 Accepts]: Start accepts. Automaton has 168 states and 249 transitions. Word has length 68 [2019-12-07 17:12:26,386 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 17:12:26,386 INFO L462 AbstractCegarLoop]: Abstraction has 168 states and 249 transitions. [2019-12-07 17:12:26,386 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 17:12:26,386 INFO L276 IsEmpty]: Start isEmpty. Operand 168 states and 249 transitions. [2019-12-07 17:12:26,387 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2019-12-07 17:12:26,387 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:12:26,387 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] [2019-12-07 17:12:26,387 INFO L410 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 17:12:26,387 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:12:26,387 INFO L82 PathProgramCache]: Analyzing trace with hash 1235689452, now seen corresponding path program 1 times [2019-12-07 17:12:26,387 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 17:12:26,387 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1263374425] [2019-12-07 17:12:26,387 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 17:12:26,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:12:26,416 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 28 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 17:12:26,416 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1263374425] [2019-12-07 17:12:26,416 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 17:12:26,416 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 17:12:26,416 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1512438099] [2019-12-07 17:12:26,417 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 17:12:26,417 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 17:12:26,417 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 17:12:26,417 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 17:12:26,417 INFO L87 Difference]: Start difference. First operand 168 states and 249 transitions. Second operand 4 states. [2019-12-07 17:12:26,591 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 17:12:26,591 INFO L93 Difference]: Finished difference Result 324 states and 486 transitions. [2019-12-07 17:12:26,592 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 17:12:26,592 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 69 [2019-12-07 17:12:26,592 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 17:12:26,593 INFO L225 Difference]: With dead ends: 324 [2019-12-07 17:12:26,593 INFO L226 Difference]: Without dead ends: 175 [2019-12-07 17:12:26,593 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-12-07 17:12:26,593 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 175 states. [2019-12-07 17:12:26,595 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 175 to 168. [2019-12-07 17:12:26,596 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 168 states. [2019-12-07 17:12:26,596 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 168 states to 168 states and 248 transitions. [2019-12-07 17:12:26,596 INFO L78 Accepts]: Start accepts. Automaton has 168 states and 248 transitions. Word has length 69 [2019-12-07 17:12:26,596 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 17:12:26,596 INFO L462 AbstractCegarLoop]: Abstraction has 168 states and 248 transitions. [2019-12-07 17:12:26,596 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 17:12:26,596 INFO L276 IsEmpty]: Start isEmpty. Operand 168 states and 248 transitions. [2019-12-07 17:12:26,597 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2019-12-07 17:12:26,597 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:12:26,597 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] [2019-12-07 17:12:26,597 INFO L410 AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 17:12:26,597 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:12:26,597 INFO L82 PathProgramCache]: Analyzing trace with hash -1988306166, now seen corresponding path program 1 times [2019-12-07 17:12:26,597 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 17:12:26,597 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1372510221] [2019-12-07 17:12:26,597 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 17:12:26,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:12:26,639 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 28 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-12-07 17:12:26,639 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1372510221] [2019-12-07 17:12:26,639 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 17:12:26,639 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 17:12:26,639 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [462484156] [2019-12-07 17:12:26,639 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 17:12:26,639 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 17:12:26,640 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 17:12:26,640 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 17:12:26,640 INFO L87 Difference]: Start difference. First operand 168 states and 248 transitions. Second operand 4 states. [2019-12-07 17:12:26,944 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 17:12:26,944 INFO L93 Difference]: Finished difference Result 424 states and 639 transitions. [2019-12-07 17:12:26,944 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 17:12:26,945 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 74 [2019-12-07 17:12:26,945 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 17:12:26,946 INFO L225 Difference]: With dead ends: 424 [2019-12-07 17:12:26,946 INFO L226 Difference]: Without dead ends: 275 [2019-12-07 17:12:26,946 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-12-07 17:12:26,947 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 275 states. [2019-12-07 17:12:26,949 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 275 to 198. [2019-12-07 17:12:26,949 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 198 states. [2019-12-07 17:12:26,950 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 198 states to 198 states and 300 transitions. [2019-12-07 17:12:26,950 INFO L78 Accepts]: Start accepts. Automaton has 198 states and 300 transitions. Word has length 74 [2019-12-07 17:12:26,950 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 17:12:26,950 INFO L462 AbstractCegarLoop]: Abstraction has 198 states and 300 transitions. [2019-12-07 17:12:26,950 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 17:12:26,950 INFO L276 IsEmpty]: Start isEmpty. Operand 198 states and 300 transitions. [2019-12-07 17:12:26,950 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2019-12-07 17:12:26,950 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:12:26,950 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] [2019-12-07 17:12:26,951 INFO L410 AbstractCegarLoop]: === Iteration 20 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 17:12:26,951 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:12:26,951 INFO L82 PathProgramCache]: Analyzing trace with hash -2060692724, now seen corresponding path program 1 times [2019-12-07 17:12:26,951 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 17:12:26,951 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [651366321] [2019-12-07 17:12:26,951 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 17:12:26,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:12:26,984 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 28 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-12-07 17:12:26,984 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [651366321] [2019-12-07 17:12:26,984 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 17:12:26,984 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 17:12:26,984 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [513050629] [2019-12-07 17:12:26,984 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 17:12:26,985 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 17:12:26,985 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 17:12:26,985 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 17:12:26,985 INFO L87 Difference]: Start difference. First operand 198 states and 300 transitions. Second operand 4 states. [2019-12-07 17:12:27,248 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 17:12:27,248 INFO L93 Difference]: Finished difference Result 427 states and 655 transitions. [2019-12-07 17:12:27,249 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 17:12:27,249 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 74 [2019-12-07 17:12:27,249 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 17:12:27,250 INFO L225 Difference]: With dead ends: 427 [2019-12-07 17:12:27,250 INFO L226 Difference]: Without dead ends: 248 [2019-12-07 17:12:27,251 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-12-07 17:12:27,251 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 248 states. [2019-12-07 17:12:27,255 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 248 to 222. [2019-12-07 17:12:27,255 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 222 states. [2019-12-07 17:12:27,255 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 222 states to 222 states and 342 transitions. [2019-12-07 17:12:27,255 INFO L78 Accepts]: Start accepts. Automaton has 222 states and 342 transitions. Word has length 74 [2019-12-07 17:12:27,256 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 17:12:27,256 INFO L462 AbstractCegarLoop]: Abstraction has 222 states and 342 transitions. [2019-12-07 17:12:27,256 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 17:12:27,256 INFO L276 IsEmpty]: Start isEmpty. Operand 222 states and 342 transitions. [2019-12-07 17:12:27,256 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2019-12-07 17:12:27,256 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:12:27,257 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] [2019-12-07 17:12:27,257 INFO L410 AbstractCegarLoop]: === Iteration 21 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 17:12:27,257 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:12:27,257 INFO L82 PathProgramCache]: Analyzing trace with hash 880688961, now seen corresponding path program 1 times [2019-12-07 17:12:27,257 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 17:12:27,257 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1448363516] [2019-12-07 17:12:27,258 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 17:12:27,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:12:27,310 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 28 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-12-07 17:12:27,310 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1448363516] [2019-12-07 17:12:27,311 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 17:12:27,311 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 17:12:27,311 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1261893725] [2019-12-07 17:12:27,311 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 17:12:27,311 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 17:12:27,311 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 17:12:27,312 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 17:12:27,312 INFO L87 Difference]: Start difference. First operand 222 states and 342 transitions. Second operand 4 states. [2019-12-07 17:12:27,587 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 17:12:27,587 INFO L93 Difference]: Finished difference Result 494 states and 761 transitions. [2019-12-07 17:12:27,587 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 17:12:27,587 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 75 [2019-12-07 17:12:27,588 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 17:12:27,589 INFO L225 Difference]: With dead ends: 494 [2019-12-07 17:12:27,589 INFO L226 Difference]: Without dead ends: 291 [2019-12-07 17:12:27,589 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-12-07 17:12:27,590 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 291 states. [2019-12-07 17:12:27,592 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 291 to 223. [2019-12-07 17:12:27,592 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 223 states. [2019-12-07 17:12:27,592 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 223 states to 223 states and 343 transitions. [2019-12-07 17:12:27,593 INFO L78 Accepts]: Start accepts. Automaton has 223 states and 343 transitions. Word has length 75 [2019-12-07 17:12:27,593 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 17:12:27,593 INFO L462 AbstractCegarLoop]: Abstraction has 223 states and 343 transitions. [2019-12-07 17:12:27,593 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 17:12:27,593 INFO L276 IsEmpty]: Start isEmpty. Operand 223 states and 343 transitions. [2019-12-07 17:12:27,593 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2019-12-07 17:12:27,593 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:12:27,593 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] [2019-12-07 17:12:27,594 INFO L410 AbstractCegarLoop]: === Iteration 22 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 17:12:27,594 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:12:27,594 INFO L82 PathProgramCache]: Analyzing trace with hash 301633263, now seen corresponding path program 1 times [2019-12-07 17:12:27,594 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 17:12:27,594 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1667143210] [2019-12-07 17:12:27,594 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 17:12:27,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:12:27,634 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 28 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-12-07 17:12:27,635 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1667143210] [2019-12-07 17:12:27,635 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 17:12:27,635 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 17:12:27,635 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1942991932] [2019-12-07 17:12:27,635 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 17:12:27,635 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 17:12:27,635 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 17:12:27,636 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 17:12:27,636 INFO L87 Difference]: Start difference. First operand 223 states and 343 transitions. Second operand 4 states. [2019-12-07 17:12:27,932 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 17:12:27,932 INFO L93 Difference]: Finished difference Result 495 states and 761 transitions. [2019-12-07 17:12:27,932 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 17:12:27,932 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 81 [2019-12-07 17:12:27,932 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 17:12:27,933 INFO L225 Difference]: With dead ends: 495 [2019-12-07 17:12:27,933 INFO L226 Difference]: Without dead ends: 291 [2019-12-07 17:12:27,934 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-12-07 17:12:27,934 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 291 states. [2019-12-07 17:12:27,937 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 291 to 233. [2019-12-07 17:12:27,937 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 233 states. [2019-12-07 17:12:27,937 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 233 states to 233 states and 362 transitions. [2019-12-07 17:12:27,937 INFO L78 Accepts]: Start accepts. Automaton has 233 states and 362 transitions. Word has length 81 [2019-12-07 17:12:27,937 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 17:12:27,937 INFO L462 AbstractCegarLoop]: Abstraction has 233 states and 362 transitions. [2019-12-07 17:12:27,938 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 17:12:27,938 INFO L276 IsEmpty]: Start isEmpty. Operand 233 states and 362 transitions. [2019-12-07 17:12:27,938 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2019-12-07 17:12:27,938 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:12:27,938 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] [2019-12-07 17:12:27,938 INFO L410 AbstractCegarLoop]: === Iteration 23 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 17:12:27,938 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:12:27,938 INFO L82 PathProgramCache]: Analyzing trace with hash 542590269, now seen corresponding path program 1 times [2019-12-07 17:12:27,939 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 17:12:27,939 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [207241022] [2019-12-07 17:12:27,939 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 17:12:27,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:12:27,979 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 28 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-12-07 17:12:27,979 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [207241022] [2019-12-07 17:12:27,979 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 17:12:27,979 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 17:12:27,979 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1036807650] [2019-12-07 17:12:27,979 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 17:12:27,979 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 17:12:27,980 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 17:12:27,980 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 17:12:27,980 INFO L87 Difference]: Start difference. First operand 233 states and 362 transitions. Second operand 4 states. [2019-12-07 17:12:28,255 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 17:12:28,256 INFO L93 Difference]: Finished difference Result 497 states and 768 transitions. [2019-12-07 17:12:28,256 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 17:12:28,256 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 82 [2019-12-07 17:12:28,256 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 17:12:28,257 INFO L225 Difference]: With dead ends: 497 [2019-12-07 17:12:28,257 INFO L226 Difference]: Without dead ends: 283 [2019-12-07 17:12:28,258 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-12-07 17:12:28,258 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 283 states. [2019-12-07 17:12:28,261 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 283 to 234. [2019-12-07 17:12:28,261 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 234 states. [2019-12-07 17:12:28,261 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 234 states to 234 states and 363 transitions. [2019-12-07 17:12:28,261 INFO L78 Accepts]: Start accepts. Automaton has 234 states and 363 transitions. Word has length 82 [2019-12-07 17:12:28,262 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 17:12:28,262 INFO L462 AbstractCegarLoop]: Abstraction has 234 states and 363 transitions. [2019-12-07 17:12:28,262 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 17:12:28,262 INFO L276 IsEmpty]: Start isEmpty. Operand 234 states and 363 transitions. [2019-12-07 17:12:28,262 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2019-12-07 17:12:28,262 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:12:28,262 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] [2019-12-07 17:12:28,262 INFO L410 AbstractCegarLoop]: === Iteration 24 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 17:12:28,263 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:12:28,263 INFO L82 PathProgramCache]: Analyzing trace with hash 354437512, now seen corresponding path program 1 times [2019-12-07 17:12:28,263 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 17:12:28,263 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [421943231] [2019-12-07 17:12:28,263 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 17:12:28,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:12:28,298 INFO L134 CoverageAnalysis]: Checked inductivity of 69 backedges. 58 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-12-07 17:12:28,298 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [421943231] [2019-12-07 17:12:28,298 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 17:12:28,298 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 17:12:28,298 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [39804383] [2019-12-07 17:12:28,299 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 17:12:28,299 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 17:12:28,299 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 17:12:28,299 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 17:12:28,299 INFO L87 Difference]: Start difference. First operand 234 states and 363 transitions. Second operand 4 states. [2019-12-07 17:12:28,657 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 17:12:28,657 INFO L93 Difference]: Finished difference Result 498 states and 768 transitions. [2019-12-07 17:12:28,658 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 17:12:28,658 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 87 [2019-12-07 17:12:28,658 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 17:12:28,661 INFO L225 Difference]: With dead ends: 498 [2019-12-07 17:12:28,661 INFO L226 Difference]: Without dead ends: 283 [2019-12-07 17:12:28,662 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-12-07 17:12:28,663 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 283 states. [2019-12-07 17:12:28,670 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 283 to 234. [2019-12-07 17:12:28,670 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 234 states. [2019-12-07 17:12:28,671 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 234 states to 234 states and 362 transitions. [2019-12-07 17:12:28,672 INFO L78 Accepts]: Start accepts. Automaton has 234 states and 362 transitions. Word has length 87 [2019-12-07 17:12:28,672 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 17:12:28,672 INFO L462 AbstractCegarLoop]: Abstraction has 234 states and 362 transitions. [2019-12-07 17:12:28,672 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 17:12:28,672 INFO L276 IsEmpty]: Start isEmpty. Operand 234 states and 362 transitions. [2019-12-07 17:12:28,673 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2019-12-07 17:12:28,673 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:12:28,674 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] [2019-12-07 17:12:28,674 INFO L410 AbstractCegarLoop]: === Iteration 25 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 17:12:28,674 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:12:28,674 INFO L82 PathProgramCache]: Analyzing trace with hash -2012257082, now seen corresponding path program 1 times [2019-12-07 17:12:28,674 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 17:12:28,674 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1839412108] [2019-12-07 17:12:28,675 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 17:12:28,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:12:28,714 INFO L134 CoverageAnalysis]: Checked inductivity of 69 backedges. 58 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-12-07 17:12:28,715 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1839412108] [2019-12-07 17:12:28,715 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 17:12:28,715 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 17:12:28,715 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1480293147] [2019-12-07 17:12:28,715 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 17:12:28,715 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 17:12:28,715 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 17:12:28,715 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 17:12:28,715 INFO L87 Difference]: Start difference. First operand 234 states and 362 transitions. Second operand 4 states. [2019-12-07 17:12:28,963 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 17:12:28,963 INFO L93 Difference]: Finished difference Result 475 states and 736 transitions. [2019-12-07 17:12:28,963 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 17:12:28,964 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 87 [2019-12-07 17:12:28,964 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 17:12:28,965 INFO L225 Difference]: With dead ends: 475 [2019-12-07 17:12:28,965 INFO L226 Difference]: Without dead ends: 260 [2019-12-07 17:12:28,965 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-12-07 17:12:28,966 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 260 states. [2019-12-07 17:12:28,969 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 260 to 234. [2019-12-07 17:12:28,969 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 234 states. [2019-12-07 17:12:28,970 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 234 states to 234 states and 361 transitions. [2019-12-07 17:12:28,970 INFO L78 Accepts]: Start accepts. Automaton has 234 states and 361 transitions. Word has length 87 [2019-12-07 17:12:28,970 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 17:12:28,970 INFO L462 AbstractCegarLoop]: Abstraction has 234 states and 361 transitions. [2019-12-07 17:12:28,970 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 17:12:28,970 INFO L276 IsEmpty]: Start isEmpty. Operand 234 states and 361 transitions. [2019-12-07 17:12:28,971 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2019-12-07 17:12:28,971 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:12:28,971 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] [2019-12-07 17:12:28,971 INFO L410 AbstractCegarLoop]: === Iteration 26 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 17:12:28,971 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:12:28,971 INFO L82 PathProgramCache]: Analyzing trace with hash 2010828614, now seen corresponding path program 1 times [2019-12-07 17:12:28,971 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 17:12:28,972 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1075416642] [2019-12-07 17:12:28,972 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 17:12:28,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:12:29,016 INFO L134 CoverageAnalysis]: Checked inductivity of 54 backedges. 43 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-12-07 17:12:29,016 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1075416642] [2019-12-07 17:12:29,016 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 17:12:29,016 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 17:12:29,016 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [967929158] [2019-12-07 17:12:29,017 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 17:12:29,017 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 17:12:29,017 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 17:12:29,017 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 17:12:29,017 INFO L87 Difference]: Start difference. First operand 234 states and 361 transitions. Second operand 4 states. [2019-12-07 17:12:29,290 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 17:12:29,290 INFO L93 Difference]: Finished difference Result 497 states and 763 transitions. [2019-12-07 17:12:29,290 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 17:12:29,290 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 88 [2019-12-07 17:12:29,290 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 17:12:29,291 INFO L225 Difference]: With dead ends: 497 [2019-12-07 17:12:29,291 INFO L226 Difference]: Without dead ends: 282 [2019-12-07 17:12:29,292 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-12-07 17:12:29,292 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 282 states. [2019-12-07 17:12:29,294 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 282 to 234. [2019-12-07 17:12:29,295 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 234 states. [2019-12-07 17:12:29,295 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 234 states to 234 states and 360 transitions. [2019-12-07 17:12:29,295 INFO L78 Accepts]: Start accepts. Automaton has 234 states and 360 transitions. Word has length 88 [2019-12-07 17:12:29,295 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 17:12:29,295 INFO L462 AbstractCegarLoop]: Abstraction has 234 states and 360 transitions. [2019-12-07 17:12:29,295 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 17:12:29,295 INFO L276 IsEmpty]: Start isEmpty. Operand 234 states and 360 transitions. [2019-12-07 17:12:29,296 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2019-12-07 17:12:29,296 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:12:29,296 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] [2019-12-07 17:12:29,296 INFO L410 AbstractCegarLoop]: === Iteration 27 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 17:12:29,296 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:12:29,296 INFO L82 PathProgramCache]: Analyzing trace with hash 1947077233, now seen corresponding path program 1 times [2019-12-07 17:12:29,296 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 17:12:29,296 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1577589956] [2019-12-07 17:12:29,296 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 17:12:29,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:12:29,331 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 61 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-12-07 17:12:29,331 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1577589956] [2019-12-07 17:12:29,331 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 17:12:29,331 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 17:12:29,332 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [279900000] [2019-12-07 17:12:29,332 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 17:12:29,332 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 17:12:29,332 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 17:12:29,332 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 17:12:29,332 INFO L87 Difference]: Start difference. First operand 234 states and 360 transitions. Second operand 4 states. [2019-12-07 17:12:29,615 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 17:12:29,615 INFO L93 Difference]: Finished difference Result 495 states and 759 transitions. [2019-12-07 17:12:29,615 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 17:12:29,615 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 88 [2019-12-07 17:12:29,615 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 17:12:29,616 INFO L225 Difference]: With dead ends: 495 [2019-12-07 17:12:29,616 INFO L226 Difference]: Without dead ends: 280 [2019-12-07 17:12:29,617 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-12-07 17:12:29,617 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 280 states. [2019-12-07 17:12:29,619 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 280 to 234. [2019-12-07 17:12:29,620 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 234 states. [2019-12-07 17:12:29,620 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 234 states to 234 states and 359 transitions. [2019-12-07 17:12:29,620 INFO L78 Accepts]: Start accepts. Automaton has 234 states and 359 transitions. Word has length 88 [2019-12-07 17:12:29,620 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 17:12:29,620 INFO L462 AbstractCegarLoop]: Abstraction has 234 states and 359 transitions. [2019-12-07 17:12:29,620 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 17:12:29,620 INFO L276 IsEmpty]: Start isEmpty. Operand 234 states and 359 transitions. [2019-12-07 17:12:29,621 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2019-12-07 17:12:29,621 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:12:29,621 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] [2019-12-07 17:12:29,621 INFO L410 AbstractCegarLoop]: === Iteration 28 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 17:12:29,621 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:12:29,621 INFO L82 PathProgramCache]: Analyzing trace with hash -1807744591, now seen corresponding path program 1 times [2019-12-07 17:12:29,621 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 17:12:29,621 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1125705410] [2019-12-07 17:12:29,621 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 17:12:29,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:12:29,650 INFO L134 CoverageAnalysis]: Checked inductivity of 75 backedges. 64 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-12-07 17:12:29,650 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1125705410] [2019-12-07 17:12:29,650 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 17:12:29,651 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 17:12:29,651 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [368199880] [2019-12-07 17:12:29,651 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 17:12:29,651 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 17:12:29,651 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 17:12:29,651 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 17:12:29,651 INFO L87 Difference]: Start difference. First operand 234 states and 359 transitions. Second operand 4 states. [2019-12-07 17:12:29,926 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 17:12:29,926 INFO L93 Difference]: Finished difference Result 494 states and 756 transitions. [2019-12-07 17:12:29,926 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 17:12:29,926 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 88 [2019-12-07 17:12:29,927 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 17:12:29,928 INFO L225 Difference]: With dead ends: 494 [2019-12-07 17:12:29,928 INFO L226 Difference]: Without dead ends: 279 [2019-12-07 17:12:29,928 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-12-07 17:12:29,929 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 279 states. [2019-12-07 17:12:29,932 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 279 to 234. [2019-12-07 17:12:29,932 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 234 states. [2019-12-07 17:12:29,933 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 234 states to 234 states and 358 transitions. [2019-12-07 17:12:29,933 INFO L78 Accepts]: Start accepts. Automaton has 234 states and 358 transitions. Word has length 88 [2019-12-07 17:12:29,933 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 17:12:29,933 INFO L462 AbstractCegarLoop]: Abstraction has 234 states and 358 transitions. [2019-12-07 17:12:29,933 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 17:12:29,933 INFO L276 IsEmpty]: Start isEmpty. Operand 234 states and 358 transitions. [2019-12-07 17:12:29,934 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2019-12-07 17:12:29,934 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:12:29,934 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] [2019-12-07 17:12:29,934 INFO L410 AbstractCegarLoop]: === Iteration 29 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 17:12:29,934 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:12:29,935 INFO L82 PathProgramCache]: Analyzing trace with hash -1418559526, now seen corresponding path program 1 times [2019-12-07 17:12:29,935 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 17:12:29,935 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1440604194] [2019-12-07 17:12:29,935 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 17:12:29,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:12:29,982 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 39 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2019-12-07 17:12:29,982 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1440604194] [2019-12-07 17:12:29,982 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 17:12:29,982 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-07 17:12:29,983 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [202661848] [2019-12-07 17:12:29,983 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-07 17:12:29,983 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 17:12:29,983 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-07 17:12:29,983 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-07 17:12:29,983 INFO L87 Difference]: Start difference. First operand 234 states and 358 transitions. Second operand 5 states. [2019-12-07 17:12:30,338 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 17:12:30,338 INFO L93 Difference]: Finished difference Result 470 states and 724 transitions. [2019-12-07 17:12:30,338 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-07 17:12:30,338 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 88 [2019-12-07 17:12:30,338 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 17:12:30,339 INFO L225 Difference]: With dead ends: 470 [2019-12-07 17:12:30,339 INFO L226 Difference]: Without dead ends: 255 [2019-12-07 17:12:30,340 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-12-07 17:12:30,340 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 255 states. [2019-12-07 17:12:30,343 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 255 to 254. [2019-12-07 17:12:30,343 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 254 states. [2019-12-07 17:12:30,343 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 254 states to 254 states and 384 transitions. [2019-12-07 17:12:30,344 INFO L78 Accepts]: Start accepts. Automaton has 254 states and 384 transitions. Word has length 88 [2019-12-07 17:12:30,344 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 17:12:30,344 INFO L462 AbstractCegarLoop]: Abstraction has 254 states and 384 transitions. [2019-12-07 17:12:30,344 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-07 17:12:30,344 INFO L276 IsEmpty]: Start isEmpty. Operand 254 states and 384 transitions. [2019-12-07 17:12:30,344 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2019-12-07 17:12:30,344 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:12:30,344 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] [2019-12-07 17:12:30,344 INFO L410 AbstractCegarLoop]: === Iteration 30 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 17:12:30,345 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:12:30,345 INFO L82 PathProgramCache]: Analyzing trace with hash 1593988851, now seen corresponding path program 1 times [2019-12-07 17:12:30,345 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 17:12:30,345 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1207945149] [2019-12-07 17:12:30,345 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 17:12:30,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:12:30,375 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 61 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-12-07 17:12:30,375 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1207945149] [2019-12-07 17:12:30,375 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 17:12:30,375 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 17:12:30,375 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [246939784] [2019-12-07 17:12:30,375 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 17:12:30,375 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 17:12:30,375 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 17:12:30,376 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 17:12:30,376 INFO L87 Difference]: Start difference. First operand 254 states and 384 transitions. Second operand 4 states. [2019-12-07 17:12:30,594 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 17:12:30,595 INFO L93 Difference]: Finished difference Result 512 states and 776 transitions. [2019-12-07 17:12:30,595 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 17:12:30,595 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 88 [2019-12-07 17:12:30,595 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 17:12:30,596 INFO L225 Difference]: With dead ends: 512 [2019-12-07 17:12:30,596 INFO L226 Difference]: Without dead ends: 277 [2019-12-07 17:12:30,597 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-12-07 17:12:30,597 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 277 states. [2019-12-07 17:12:30,600 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 277 to 254. [2019-12-07 17:12:30,600 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 254 states. [2019-12-07 17:12:30,600 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 254 states to 254 states and 383 transitions. [2019-12-07 17:12:30,600 INFO L78 Accepts]: Start accepts. Automaton has 254 states and 383 transitions. Word has length 88 [2019-12-07 17:12:30,601 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 17:12:30,601 INFO L462 AbstractCegarLoop]: Abstraction has 254 states and 383 transitions. [2019-12-07 17:12:30,601 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 17:12:30,601 INFO L276 IsEmpty]: Start isEmpty. Operand 254 states and 383 transitions. [2019-12-07 17:12:30,601 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2019-12-07 17:12:30,601 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:12:30,601 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] [2019-12-07 17:12:30,601 INFO L410 AbstractCegarLoop]: === Iteration 31 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 17:12:30,602 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:12:30,602 INFO L82 PathProgramCache]: Analyzing trace with hash 2134134323, now seen corresponding path program 1 times [2019-12-07 17:12:30,602 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 17:12:30,602 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1710042317] [2019-12-07 17:12:30,602 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 17:12:30,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:12:30,630 INFO L134 CoverageAnalysis]: Checked inductivity of 75 backedges. 64 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-12-07 17:12:30,630 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1710042317] [2019-12-07 17:12:30,630 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 17:12:30,631 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 17:12:30,631 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1243067325] [2019-12-07 17:12:30,631 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 17:12:30,631 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 17:12:30,631 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 17:12:30,631 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 17:12:30,631 INFO L87 Difference]: Start difference. First operand 254 states and 383 transitions. Second operand 4 states. [2019-12-07 17:12:30,845 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 17:12:30,845 INFO L93 Difference]: Finished difference Result 511 states and 773 transitions. [2019-12-07 17:12:30,845 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 17:12:30,845 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 88 [2019-12-07 17:12:30,845 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 17:12:30,846 INFO L225 Difference]: With dead ends: 511 [2019-12-07 17:12:30,846 INFO L226 Difference]: Without dead ends: 276 [2019-12-07 17:12:30,847 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-12-07 17:12:30,847 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 276 states. [2019-12-07 17:12:30,850 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 276 to 254. [2019-12-07 17:12:30,850 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 254 states. [2019-12-07 17:12:30,850 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 254 states to 254 states and 382 transitions. [2019-12-07 17:12:30,850 INFO L78 Accepts]: Start accepts. Automaton has 254 states and 382 transitions. Word has length 88 [2019-12-07 17:12:30,850 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 17:12:30,851 INFO L462 AbstractCegarLoop]: Abstraction has 254 states and 382 transitions. [2019-12-07 17:12:30,851 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 17:12:30,851 INFO L276 IsEmpty]: Start isEmpty. Operand 254 states and 382 transitions. [2019-12-07 17:12:30,851 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2019-12-07 17:12:30,851 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:12:30,851 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] [2019-12-07 17:12:30,851 INFO L410 AbstractCegarLoop]: === Iteration 32 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 17:12:30,851 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:12:30,852 INFO L82 PathProgramCache]: Analyzing trace with hash -1582169212, now seen corresponding path program 1 times [2019-12-07 17:12:30,852 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 17:12:30,852 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [947978597] [2019-12-07 17:12:30,852 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 17:12:30,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:12:30,880 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 46 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-12-07 17:12:30,881 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [947978597] [2019-12-07 17:12:30,881 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 17:12:30,881 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 17:12:30,881 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [16985351] [2019-12-07 17:12:30,881 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 17:12:30,881 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 17:12:30,881 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 17:12:30,881 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 17:12:30,881 INFO L87 Difference]: Start difference. First operand 254 states and 382 transitions. Second operand 4 states. [2019-12-07 17:12:31,131 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 17:12:31,131 INFO L93 Difference]: Finished difference Result 534 states and 801 transitions. [2019-12-07 17:12:31,132 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 17:12:31,132 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 89 [2019-12-07 17:12:31,132 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 17:12:31,133 INFO L225 Difference]: With dead ends: 534 [2019-12-07 17:12:31,133 INFO L226 Difference]: Without dead ends: 299 [2019-12-07 17:12:31,134 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-12-07 17:12:31,134 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 299 states. [2019-12-07 17:12:31,138 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 299 to 254. [2019-12-07 17:12:31,139 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 254 states. [2019-12-07 17:12:31,139 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 254 states to 254 states and 381 transitions. [2019-12-07 17:12:31,139 INFO L78 Accepts]: Start accepts. Automaton has 254 states and 381 transitions. Word has length 89 [2019-12-07 17:12:31,139 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 17:12:31,139 INFO L462 AbstractCegarLoop]: Abstraction has 254 states and 381 transitions. [2019-12-07 17:12:31,139 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 17:12:31,140 INFO L276 IsEmpty]: Start isEmpty. Operand 254 states and 381 transitions. [2019-12-07 17:12:31,140 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2019-12-07 17:12:31,140 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:12:31,140 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] [2019-12-07 17:12:31,140 INFO L410 AbstractCegarLoop]: === Iteration 33 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 17:12:31,140 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:12:31,140 INFO L82 PathProgramCache]: Analyzing trace with hash 356992834, now seen corresponding path program 1 times [2019-12-07 17:12:31,140 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 17:12:31,141 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2018497105] [2019-12-07 17:12:31,141 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 17:12:31,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:12:31,174 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 46 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-12-07 17:12:31,174 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2018497105] [2019-12-07 17:12:31,175 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 17:12:31,175 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 17:12:31,175 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1884024134] [2019-12-07 17:12:31,175 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 17:12:31,175 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 17:12:31,175 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 17:12:31,175 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 17:12:31,175 INFO L87 Difference]: Start difference. First operand 254 states and 381 transitions. Second operand 4 states. [2019-12-07 17:12:31,393 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 17:12:31,393 INFO L93 Difference]: Finished difference Result 511 states and 769 transitions. [2019-12-07 17:12:31,393 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 17:12:31,393 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 89 [2019-12-07 17:12:31,393 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 17:12:31,394 INFO L225 Difference]: With dead ends: 511 [2019-12-07 17:12:31,394 INFO L226 Difference]: Without dead ends: 276 [2019-12-07 17:12:31,395 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-12-07 17:12:31,395 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 276 states. [2019-12-07 17:12:31,399 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 276 to 254. [2019-12-07 17:12:31,399 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 254 states. [2019-12-07 17:12:31,399 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 254 states to 254 states and 380 transitions. [2019-12-07 17:12:31,399 INFO L78 Accepts]: Start accepts. Automaton has 254 states and 380 transitions. Word has length 89 [2019-12-07 17:12:31,399 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 17:12:31,400 INFO L462 AbstractCegarLoop]: Abstraction has 254 states and 380 transitions. [2019-12-07 17:12:31,400 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 17:12:31,400 INFO L276 IsEmpty]: Start isEmpty. Operand 254 states and 380 transitions. [2019-12-07 17:12:31,400 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2019-12-07 17:12:31,400 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:12:31,400 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] [2019-12-07 17:12:31,401 INFO L410 AbstractCegarLoop]: === Iteration 34 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 17:12:31,401 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:12:31,401 INFO L82 PathProgramCache]: Analyzing trace with hash -2129784979, now seen corresponding path program 1 times [2019-12-07 17:12:31,401 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 17:12:31,401 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1234558530] [2019-12-07 17:12:31,401 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 17:12:31,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:12:31,431 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 49 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-12-07 17:12:31,431 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1234558530] [2019-12-07 17:12:31,431 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 17:12:31,431 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 17:12:31,431 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [68359993] [2019-12-07 17:12:31,431 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 17:12:31,431 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 17:12:31,431 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 17:12:31,432 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 17:12:31,432 INFO L87 Difference]: Start difference. First operand 254 states and 380 transitions. Second operand 4 states. [2019-12-07 17:12:31,690 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 17:12:31,690 INFO L93 Difference]: Finished difference Result 534 states and 797 transitions. [2019-12-07 17:12:31,690 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 17:12:31,690 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 90 [2019-12-07 17:12:31,690 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 17:12:31,691 INFO L225 Difference]: With dead ends: 534 [2019-12-07 17:12:31,691 INFO L226 Difference]: Without dead ends: 299 [2019-12-07 17:12:31,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-12-07 17:12:31,692 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 299 states. [2019-12-07 17:12:31,697 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 299 to 254. [2019-12-07 17:12:31,697 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 254 states. [2019-12-07 17:12:31,697 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 254 states to 254 states and 379 transitions. [2019-12-07 17:12:31,697 INFO L78 Accepts]: Start accepts. Automaton has 254 states and 379 transitions. Word has length 90 [2019-12-07 17:12:31,698 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 17:12:31,698 INFO L462 AbstractCegarLoop]: Abstraction has 254 states and 379 transitions. [2019-12-07 17:12:31,698 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 17:12:31,698 INFO L276 IsEmpty]: Start isEmpty. Operand 254 states and 379 transitions. [2019-12-07 17:12:31,698 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2019-12-07 17:12:31,699 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:12:31,699 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] [2019-12-07 17:12:31,699 INFO L410 AbstractCegarLoop]: === Iteration 35 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 17:12:31,699 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:12:31,699 INFO L82 PathProgramCache]: Analyzing trace with hash -2145303697, now seen corresponding path program 1 times [2019-12-07 17:12:31,699 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 17:12:31,699 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [838556478] [2019-12-07 17:12:31,700 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 17:12:31,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:12:31,732 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 49 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-12-07 17:12:31,732 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [838556478] [2019-12-07 17:12:31,732 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 17:12:31,732 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 17:12:31,732 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2038793213] [2019-12-07 17:12:31,733 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 17:12:31,733 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 17:12:31,733 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 17:12:31,733 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 17:12:31,733 INFO L87 Difference]: Start difference. First operand 254 states and 379 transitions. Second operand 4 states. [2019-12-07 17:12:31,959 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 17:12:31,959 INFO L93 Difference]: Finished difference Result 511 states and 765 transitions. [2019-12-07 17:12:31,960 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 17:12:31,960 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 90 [2019-12-07 17:12:31,960 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 17:12:31,961 INFO L225 Difference]: With dead ends: 511 [2019-12-07 17:12:31,961 INFO L226 Difference]: Without dead ends: 276 [2019-12-07 17:12:31,962 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-12-07 17:12:31,962 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 276 states. [2019-12-07 17:12:31,965 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 276 to 254. [2019-12-07 17:12:31,965 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 254 states. [2019-12-07 17:12:31,965 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 254 states to 254 states and 378 transitions. [2019-12-07 17:12:31,965 INFO L78 Accepts]: Start accepts. Automaton has 254 states and 378 transitions. Word has length 90 [2019-12-07 17:12:31,965 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 17:12:31,965 INFO L462 AbstractCegarLoop]: Abstraction has 254 states and 378 transitions. [2019-12-07 17:12:31,965 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 17:12:31,965 INFO L276 IsEmpty]: Start isEmpty. Operand 254 states and 378 transitions. [2019-12-07 17:12:31,966 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2019-12-07 17:12:31,966 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:12:31,966 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] [2019-12-07 17:12:31,966 INFO L410 AbstractCegarLoop]: === Iteration 36 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 17:12:31,966 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:12:31,966 INFO L82 PathProgramCache]: Analyzing trace with hash 1086928127, now seen corresponding path program 1 times [2019-12-07 17:12:31,966 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 17:12:31,966 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [854072959] [2019-12-07 17:12:31,967 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 17:12:31,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:12:31,997 INFO L134 CoverageAnalysis]: Checked inductivity of 63 backedges. 52 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-12-07 17:12:31,997 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [854072959] [2019-12-07 17:12:31,997 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 17:12:31,997 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 17:12:31,997 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [142756495] [2019-12-07 17:12:31,997 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 17:12:31,998 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 17:12:31,998 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 17:12:31,998 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 17:12:31,998 INFO L87 Difference]: Start difference. First operand 254 states and 378 transitions. Second operand 4 states. [2019-12-07 17:12:32,257 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 17:12:32,257 INFO L93 Difference]: Finished difference Result 534 states and 793 transitions. [2019-12-07 17:12:32,257 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 17:12:32,257 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 91 [2019-12-07 17:12:32,257 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 17:12:32,258 INFO L225 Difference]: With dead ends: 534 [2019-12-07 17:12:32,259 INFO L226 Difference]: Without dead ends: 299 [2019-12-07 17:12:32,259 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-12-07 17:12:32,259 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 299 states. [2019-12-07 17:12:32,262 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 299 to 254. [2019-12-07 17:12:32,262 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 254 states. [2019-12-07 17:12:32,262 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 254 states to 254 states and 377 transitions. [2019-12-07 17:12:32,263 INFO L78 Accepts]: Start accepts. Automaton has 254 states and 377 transitions. Word has length 91 [2019-12-07 17:12:32,263 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 17:12:32,263 INFO L462 AbstractCegarLoop]: Abstraction has 254 states and 377 transitions. [2019-12-07 17:12:32,263 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 17:12:32,263 INFO L276 IsEmpty]: Start isEmpty. Operand 254 states and 377 transitions. [2019-12-07 17:12:32,263 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2019-12-07 17:12:32,263 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:12:32,263 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] [2019-12-07 17:12:32,264 INFO L410 AbstractCegarLoop]: === Iteration 37 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 17:12:32,264 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:12:32,264 INFO L82 PathProgramCache]: Analyzing trace with hash 605847869, now seen corresponding path program 1 times [2019-12-07 17:12:32,264 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 17:12:32,264 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1319625815] [2019-12-07 17:12:32,264 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 17:12:32,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:12:32,292 INFO L134 CoverageAnalysis]: Checked inductivity of 63 backedges. 52 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-12-07 17:12:32,293 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1319625815] [2019-12-07 17:12:32,293 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 17:12:32,293 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 17:12:32,293 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1439094518] [2019-12-07 17:12:32,293 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 17:12:32,293 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 17:12:32,293 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 17:12:32,293 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 17:12:32,293 INFO L87 Difference]: Start difference. First operand 254 states and 377 transitions. Second operand 4 states. [2019-12-07 17:12:32,508 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 17:12:32,508 INFO L93 Difference]: Finished difference Result 511 states and 761 transitions. [2019-12-07 17:12:32,509 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 17:12:32,509 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 91 [2019-12-07 17:12:32,509 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 17:12:32,510 INFO L225 Difference]: With dead ends: 511 [2019-12-07 17:12:32,510 INFO L226 Difference]: Without dead ends: 276 [2019-12-07 17:12:32,510 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-12-07 17:12:32,511 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 276 states. [2019-12-07 17:12:32,513 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 276 to 254. [2019-12-07 17:12:32,514 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 254 states. [2019-12-07 17:12:32,514 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 254 states to 254 states and 376 transitions. [2019-12-07 17:12:32,514 INFO L78 Accepts]: Start accepts. Automaton has 254 states and 376 transitions. Word has length 91 [2019-12-07 17:12:32,514 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 17:12:32,514 INFO L462 AbstractCegarLoop]: Abstraction has 254 states and 376 transitions. [2019-12-07 17:12:32,514 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 17:12:32,514 INFO L276 IsEmpty]: Start isEmpty. Operand 254 states and 376 transitions. [2019-12-07 17:12:32,515 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2019-12-07 17:12:32,515 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:12:32,515 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] [2019-12-07 17:12:32,515 INFO L410 AbstractCegarLoop]: === Iteration 38 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 17:12:32,515 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:12:32,515 INFO L82 PathProgramCache]: Analyzing trace with hash 738752008, now seen corresponding path program 1 times [2019-12-07 17:12:32,515 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 17:12:32,516 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1753636309] [2019-12-07 17:12:32,516 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 17:12:32,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:12:32,545 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 55 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-12-07 17:12:32,545 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1753636309] [2019-12-07 17:12:32,545 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 17:12:32,546 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 17:12:32,546 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1906872546] [2019-12-07 17:12:32,546 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 17:12:32,546 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 17:12:32,546 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 17:12:32,546 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 17:12:32,546 INFO L87 Difference]: Start difference. First operand 254 states and 376 transitions. Second operand 4 states. [2019-12-07 17:12:32,902 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 17:12:32,903 INFO L93 Difference]: Finished difference Result 524 states and 777 transitions. [2019-12-07 17:12:32,903 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 17:12:32,903 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 92 [2019-12-07 17:12:32,904 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 17:12:32,906 INFO L225 Difference]: With dead ends: 524 [2019-12-07 17:12:32,906 INFO L226 Difference]: Without dead ends: 289 [2019-12-07 17:12:32,906 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-12-07 17:12:32,907 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 289 states. [2019-12-07 17:12:32,913 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 289 to 254. [2019-12-07 17:12:32,914 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 254 states. [2019-12-07 17:12:32,915 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 254 states to 254 states and 375 transitions. [2019-12-07 17:12:32,915 INFO L78 Accepts]: Start accepts. Automaton has 254 states and 375 transitions. Word has length 92 [2019-12-07 17:12:32,915 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 17:12:32,915 INFO L462 AbstractCegarLoop]: Abstraction has 254 states and 375 transitions. [2019-12-07 17:12:32,916 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 17:12:32,916 INFO L276 IsEmpty]: Start isEmpty. Operand 254 states and 375 transitions. [2019-12-07 17:12:32,917 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2019-12-07 17:12:32,917 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:12:32,917 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] [2019-12-07 17:12:32,918 INFO L410 AbstractCegarLoop]: === Iteration 39 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 17:12:32,918 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:12:32,918 INFO L82 PathProgramCache]: Analyzing trace with hash -1289834102, now seen corresponding path program 1 times [2019-12-07 17:12:32,918 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 17:12:32,919 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1296058988] [2019-12-07 17:12:32,919 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 17:12:32,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:12:32,966 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 55 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-12-07 17:12:32,966 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1296058988] [2019-12-07 17:12:32,967 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 17:12:32,967 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 17:12:32,967 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [965166555] [2019-12-07 17:12:32,967 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 17:12:32,967 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 17:12:32,967 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 17:12:32,967 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 17:12:32,967 INFO L87 Difference]: Start difference. First operand 254 states and 375 transitions. Second operand 4 states. [2019-12-07 17:12:33,183 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 17:12:33,183 INFO L93 Difference]: Finished difference Result 501 states and 745 transitions. [2019-12-07 17:12:33,184 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 17:12:33,184 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 92 [2019-12-07 17:12:33,184 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 17:12:33,185 INFO L225 Difference]: With dead ends: 501 [2019-12-07 17:12:33,185 INFO L226 Difference]: Without dead ends: 266 [2019-12-07 17:12:33,185 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-12-07 17:12:33,186 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 266 states. [2019-12-07 17:12:33,189 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 266 to 254. [2019-12-07 17:12:33,189 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 254 states. [2019-12-07 17:12:33,189 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 254 states to 254 states and 374 transitions. [2019-12-07 17:12:33,189 INFO L78 Accepts]: Start accepts. Automaton has 254 states and 374 transitions. Word has length 92 [2019-12-07 17:12:33,190 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 17:12:33,190 INFO L462 AbstractCegarLoop]: Abstraction has 254 states and 374 transitions. [2019-12-07 17:12:33,190 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 17:12:33,190 INFO L276 IsEmpty]: Start isEmpty. Operand 254 states and 374 transitions. [2019-12-07 17:12:33,190 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2019-12-07 17:12:33,190 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:12:33,190 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] [2019-12-07 17:12:33,190 INFO L410 AbstractCegarLoop]: === Iteration 40 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 17:12:33,190 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:12:33,191 INFO L82 PathProgramCache]: Analyzing trace with hash -1110599922, now seen corresponding path program 1 times [2019-12-07 17:12:33,191 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 17:12:33,191 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [684163765] [2019-12-07 17:12:33,191 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 17:12:33,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:12:33,230 INFO L134 CoverageAnalysis]: Checked inductivity of 86 backedges. 75 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-12-07 17:12:33,230 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [684163765] [2019-12-07 17:12:33,230 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 17:12:33,230 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 17:12:33,230 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [817427587] [2019-12-07 17:12:33,230 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 17:12:33,230 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 17:12:33,230 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 17:12:33,231 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 17:12:33,231 INFO L87 Difference]: Start difference. First operand 254 states and 374 transitions. Second operand 4 states. [2019-12-07 17:12:33,493 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 17:12:33,493 INFO L93 Difference]: Finished difference Result 524 states and 773 transitions. [2019-12-07 17:12:33,493 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 17:12:33,493 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 96 [2019-12-07 17:12:33,494 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 17:12:33,495 INFO L225 Difference]: With dead ends: 524 [2019-12-07 17:12:33,495 INFO L226 Difference]: Without dead ends: 289 [2019-12-07 17:12:33,495 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-12-07 17:12:33,495 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 289 states. [2019-12-07 17:12:33,498 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 289 to 254. [2019-12-07 17:12:33,498 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 254 states. [2019-12-07 17:12:33,499 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 254 states to 254 states and 373 transitions. [2019-12-07 17:12:33,499 INFO L78 Accepts]: Start accepts. Automaton has 254 states and 373 transitions. Word has length 96 [2019-12-07 17:12:33,499 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 17:12:33,499 INFO L462 AbstractCegarLoop]: Abstraction has 254 states and 373 transitions. [2019-12-07 17:12:33,499 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 17:12:33,499 INFO L276 IsEmpty]: Start isEmpty. Operand 254 states and 373 transitions. [2019-12-07 17:12:33,499 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2019-12-07 17:12:33,500 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:12:33,500 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] [2019-12-07 17:12:33,500 INFO L410 AbstractCegarLoop]: === Iteration 41 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 17:12:33,500 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:12:33,500 INFO L82 PathProgramCache]: Analyzing trace with hash 276185488, now seen corresponding path program 1 times [2019-12-07 17:12:33,500 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 17:12:33,500 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1966774598] [2019-12-07 17:12:33,500 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 17:12:33,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:12:33,536 INFO L134 CoverageAnalysis]: Checked inductivity of 86 backedges. 56 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2019-12-07 17:12:33,536 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1966774598] [2019-12-07 17:12:33,536 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 17:12:33,536 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 17:12:33,536 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [834568902] [2019-12-07 17:12:33,537 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 17:12:33,537 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 17:12:33,537 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 17:12:33,537 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 17:12:33,537 INFO L87 Difference]: Start difference. First operand 254 states and 373 transitions. Second operand 3 states. [2019-12-07 17:12:33,572 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 17:12:33,573 INFO L93 Difference]: Finished difference Result 722 states and 1074 transitions. [2019-12-07 17:12:33,573 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 17:12:33,573 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 96 [2019-12-07 17:12:33,573 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 17:12:33,575 INFO L225 Difference]: With dead ends: 722 [2019-12-07 17:12:33,575 INFO L226 Difference]: Without dead ends: 487 [2019-12-07 17:12:33,575 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-12-07 17:12:33,576 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 487 states. [2019-12-07 17:12:33,582 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 487 to 487. [2019-12-07 17:12:33,582 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 487 states. [2019-12-07 17:12:33,583 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 487 states to 487 states and 717 transitions. [2019-12-07 17:12:33,583 INFO L78 Accepts]: Start accepts. Automaton has 487 states and 717 transitions. Word has length 96 [2019-12-07 17:12:33,583 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 17:12:33,583 INFO L462 AbstractCegarLoop]: Abstraction has 487 states and 717 transitions. [2019-12-07 17:12:33,583 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 17:12:33,583 INFO L276 IsEmpty]: Start isEmpty. Operand 487 states and 717 transitions. [2019-12-07 17:12:33,583 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2019-12-07 17:12:33,584 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:12:33,584 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] [2019-12-07 17:12:33,584 INFO L410 AbstractCegarLoop]: === Iteration 42 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 17:12:33,584 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:12:33,584 INFO L82 PathProgramCache]: Analyzing trace with hash -1173556134, now seen corresponding path program 1 times [2019-12-07 17:12:33,584 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 17:12:33,584 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [375957097] [2019-12-07 17:12:33,584 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 17:12:33,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:12:33,611 INFO L134 CoverageAnalysis]: Checked inductivity of 86 backedges. 47 proven. 0 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2019-12-07 17:12:33,612 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [375957097] [2019-12-07 17:12:33,612 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 17:12:33,612 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 17:12:33,612 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [366477140] [2019-12-07 17:12:33,612 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 17:12:33,612 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 17:12:33,612 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 17:12:33,612 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 17:12:33,612 INFO L87 Difference]: Start difference. First operand 487 states and 717 transitions. Second operand 3 states. [2019-12-07 17:12:33,651 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 17:12:33,651 INFO L93 Difference]: Finished difference Result 1190 states and 1763 transitions. [2019-12-07 17:12:33,651 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 17:12:33,652 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 98 [2019-12-07 17:12:33,652 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 17:12:33,654 INFO L225 Difference]: With dead ends: 1190 [2019-12-07 17:12:33,654 INFO L226 Difference]: Without dead ends: 722 [2019-12-07 17:12:33,655 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-12-07 17:12:33,655 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 722 states. [2019-12-07 17:12:33,664 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 722 to 720. [2019-12-07 17:12:33,664 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 720 states. [2019-12-07 17:12:33,665 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 720 states to 720 states and 1065 transitions. [2019-12-07 17:12:33,665 INFO L78 Accepts]: Start accepts. Automaton has 720 states and 1065 transitions. Word has length 98 [2019-12-07 17:12:33,665 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 17:12:33,665 INFO L462 AbstractCegarLoop]: Abstraction has 720 states and 1065 transitions. [2019-12-07 17:12:33,665 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 17:12:33,665 INFO L276 IsEmpty]: Start isEmpty. Operand 720 states and 1065 transitions. [2019-12-07 17:12:33,666 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2019-12-07 17:12:33,666 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:12:33,666 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] [2019-12-07 17:12:33,666 INFO L410 AbstractCegarLoop]: === Iteration 43 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 17:12:33,666 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:12:33,666 INFO L82 PathProgramCache]: Analyzing trace with hash -1825940577, now seen corresponding path program 1 times [2019-12-07 17:12:33,666 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 17:12:33,666 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [560693554] [2019-12-07 17:12:33,667 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 17:12:33,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:12:33,695 INFO L134 CoverageAnalysis]: Checked inductivity of 86 backedges. 47 proven. 0 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2019-12-07 17:12:33,695 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [560693554] [2019-12-07 17:12:33,695 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 17:12:33,695 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 17:12:33,695 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1194743070] [2019-12-07 17:12:33,695 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 17:12:33,696 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 17:12:33,696 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 17:12:33,696 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 17:12:33,696 INFO L87 Difference]: Start difference. First operand 720 states and 1065 transitions. Second operand 3 states. [2019-12-07 17:12:33,747 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 17:12:33,747 INFO L93 Difference]: Finished difference Result 1656 states and 2457 transitions. [2019-12-07 17:12:33,747 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 17:12:33,747 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 105 [2019-12-07 17:12:33,747 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 17:12:33,750 INFO L225 Difference]: With dead ends: 1656 [2019-12-07 17:12:33,751 INFO L226 Difference]: Without dead ends: 955 [2019-12-07 17:12:33,751 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-12-07 17:12:33,752 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 955 states. [2019-12-07 17:12:33,770 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 955 to 953. [2019-12-07 17:12:33,770 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 953 states. [2019-12-07 17:12:33,772 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 953 states to 953 states and 1399 transitions. [2019-12-07 17:12:33,772 INFO L78 Accepts]: Start accepts. Automaton has 953 states and 1399 transitions. Word has length 105 [2019-12-07 17:12:33,772 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 17:12:33,772 INFO L462 AbstractCegarLoop]: Abstraction has 953 states and 1399 transitions. [2019-12-07 17:12:33,772 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 17:12:33,772 INFO L276 IsEmpty]: Start isEmpty. Operand 953 states and 1399 transitions. [2019-12-07 17:12:33,774 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2019-12-07 17:12:33,774 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:12:33,774 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, 1, 1, 1, 1, 1, 1, 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-12-07 17:12:33,774 INFO L410 AbstractCegarLoop]: === Iteration 44 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 17:12:33,774 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:12:33,775 INFO L82 PathProgramCache]: Analyzing trace with hash 315775349, now seen corresponding path program 1 times [2019-12-07 17:12:33,775 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 17:12:33,775 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [797483365] [2019-12-07 17:12:33,775 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 17:12:33,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:12:33,811 INFO L134 CoverageAnalysis]: Checked inductivity of 101 backedges. 62 proven. 0 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2019-12-07 17:12:33,811 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [797483365] [2019-12-07 17:12:33,812 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 17:12:33,812 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 17:12:33,812 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1973121280] [2019-12-07 17:12:33,812 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 17:12:33,812 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 17:12:33,812 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 17:12:33,812 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 17:12:33,813 INFO L87 Difference]: Start difference. First operand 953 states and 1399 transitions. Second operand 3 states. [2019-12-07 17:12:33,858 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 17:12:33,858 INFO L93 Difference]: Finished difference Result 2120 states and 3124 transitions. [2019-12-07 17:12:33,858 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 17:12:33,858 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 122 [2019-12-07 17:12:33,859 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 17:12:33,864 INFO L225 Difference]: With dead ends: 2120 [2019-12-07 17:12:33,864 INFO L226 Difference]: Without dead ends: 1186 [2019-12-07 17:12:33,865 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-12-07 17:12:33,867 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1186 states. [2019-12-07 17:12:33,887 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1186 to 1186. [2019-12-07 17:12:33,887 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1186 states. [2019-12-07 17:12:33,889 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1186 states to 1186 states and 1744 transitions. [2019-12-07 17:12:33,889 INFO L78 Accepts]: Start accepts. Automaton has 1186 states and 1744 transitions. Word has length 122 [2019-12-07 17:12:33,890 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 17:12:33,890 INFO L462 AbstractCegarLoop]: Abstraction has 1186 states and 1744 transitions. [2019-12-07 17:12:33,890 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 17:12:33,890 INFO L276 IsEmpty]: Start isEmpty. Operand 1186 states and 1744 transitions. [2019-12-07 17:12:33,891 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2019-12-07 17:12:33,891 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:12:33,892 INFO L410 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 17:12:33,892 INFO L410 AbstractCegarLoop]: === Iteration 45 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 17:12:33,892 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:12:33,892 INFO L82 PathProgramCache]: Analyzing trace with hash -799556719, now seen corresponding path program 1 times [2019-12-07 17:12:33,892 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 17:12:33,892 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [257908197] [2019-12-07 17:12:33,892 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 17:12:33,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-07 17:12:34,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-07 17:12:34,100 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-07 17:12:34,100 INFO L475 BasicCegarLoop]: Counterexample might be feasible [2019-12-07 17:12:34,172 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 07.12 05:12:34 BoogieIcfgContainer [2019-12-07 17:12:34,172 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-07 17:12:34,172 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-12-07 17:12:34,172 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-12-07 17:12:34,172 INFO L275 PluginConnector]: Witness Printer initialized [2019-12-07 17:12:34,173 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 05:12:21" (3/4) ... [2019-12-07 17:12:34,175 INFO L140 WitnessPrinter]: No result that supports witness generation found [2019-12-07 17:12:34,175 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-12-07 17:12:34,177 INFO L168 Benchmark]: Toolchain (without parser) took 13813.43 ms. Allocated memory was 1.0 GB in the beginning and 1.3 GB in the end (delta: 288.4 MB). Free memory was 943.6 MB in the beginning and 908.1 MB in the end (delta: 35.5 MB). Peak memory consumption was 323.9 MB. Max. memory is 11.5 GB. [2019-12-07 17:12:34,177 INFO L168 Benchmark]: CDTParser took 0.20 ms. Allocated memory is still 1.0 GB. Free memory is still 964.0 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-12-07 17:12:34,177 INFO L168 Benchmark]: CACSL2BoogieTranslator took 398.51 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 106.4 MB). Free memory was 943.6 MB in the beginning and 1.1 GB in the end (delta: -130.1 MB). Peak memory consumption was 24.5 MB. Max. memory is 11.5 GB. [2019-12-07 17:12:34,177 INFO L168 Benchmark]: Boogie Procedure Inliner took 51.69 ms. Allocated memory is still 1.1 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-12-07 17:12:34,178 INFO L168 Benchmark]: Boogie Preprocessor took 51.85 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. [2019-12-07 17:12:34,178 INFO L168 Benchmark]: RCFGBuilder took 667.79 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 969.1 MB in the end (delta: 93.9 MB). Peak memory consumption was 93.9 MB. Max. memory is 11.5 GB. [2019-12-07 17:12:34,178 INFO L168 Benchmark]: TraceAbstraction took 12637.12 ms. Allocated memory was 1.1 GB in the beginning and 1.3 GB in the end (delta: 181.9 MB). Free memory was 963.8 MB in the beginning and 908.1 MB in the end (delta: 55.7 MB). Peak memory consumption was 237.6 MB. Max. memory is 11.5 GB. [2019-12-07 17:12:34,178 INFO L168 Benchmark]: Witness Printer took 3.29 ms. Allocated memory is still 1.3 GB. Free memory is still 908.1 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-12-07 17:12:34,180 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.20 ms. Allocated memory is still 1.0 GB. Free memory is still 964.0 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 398.51 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 106.4 MB). Free memory was 943.6 MB in the beginning and 1.1 GB in the end (delta: -130.1 MB). Peak memory consumption was 24.5 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 51.69 ms. Allocated memory is still 1.1 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * Boogie Preprocessor took 51.85 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. * RCFGBuilder took 667.79 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 969.1 MB in the end (delta: 93.9 MB). Peak memory consumption was 93.9 MB. Max. memory is 11.5 GB. * TraceAbstraction took 12637.12 ms. Allocated memory was 1.1 GB in the beginning and 1.3 GB in the end (delta: 181.9 MB). Free memory was 963.8 MB in the beginning and 908.1 MB in the end (delta: 55.7 MB). Peak memory consumption was 237.6 MB. Max. memory is 11.5 GB. * Witness Printer took 3.29 ms. Allocated memory is still 1.3 GB. Free memory is still 908.1 MB. There was no memory consumed. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - UnprovableResult [Line: 1726]: Unable to prove that call of __VERIFIER_error() unreachable Unable to prove that call of __VERIFIER_error() unreachable Reason: overapproximation of bitwiseAnd at line 1444. Possible FailurePath: [L1042] static int init = 1; [L1043] static SSL_METHOD SSLv3_server_data ; VAL [init=1, SSLv3_server_data={6: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)) [L1080] BUF_MEM *buf ; [L1081] unsigned long l ; [L1082] unsigned long Time ; [L1083] unsigned long tmp ; [L1084] void (*cb)() ; [L1085] long num1 ; [L1086] int ret ; [L1087] int new_state ; [L1088] int state ; [L1089] int skip ; [L1090] int got_new_session ; [L1091] int tmp___1 = __VERIFIER_nondet_int() ; [L1092] int tmp___2 = __VERIFIER_nondet_int() ; [L1093] int tmp___3 = __VERIFIER_nondet_int() ; [L1094] int tmp___4 = __VERIFIER_nondet_int() ; [L1095] int tmp___5 = __VERIFIER_nondet_int() ; [L1096] int tmp___6 = __VERIFIER_nondet_int() ; [L1097] int tmp___7 ; [L1098] long tmp___8 = __VERIFIER_nondet_long() ; [L1099] int tmp___9 = __VERIFIER_nondet_int() ; [L1100] int tmp___10 = __VERIFIER_nondet_int() ; [L1101] int blastFlag ; [L1105] s->state = 8464 [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={6: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={6:0}] [L1130] EXPR s->cert VAL [init=1, SSLv3_server_data={6:0}] [L1130] COND FALSE !((unsigned long )s->cert == (unsigned long )((void *)0)) [L1136] COND TRUE 1 VAL [init=1, SSLv3_server_data={6:0}] [L1138] EXPR s->state [L1138] state = s->state [L1139] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1139] COND FALSE !(s->state == 12292) [L1142] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1142] COND FALSE !(s->state == 16384) [L1145] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1145] COND FALSE !(s->state == 8192) [L1148] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1148] COND FALSE !(s->state == 24576) [L1151] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1151] COND FALSE !(s->state == 8195) [L1154] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1154] COND FALSE !(s->state == 8480) [L1157] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1157] COND FALSE !(s->state == 8481) [L1160] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1160] COND FALSE !(s->state == 8482) [L1163] EXPR s->state VAL [init=1, SSLv3_server_data={6: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={6: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={6:0}] [L1685] EXPR s->s3 [L1685] EXPR (s->s3)->tmp.reuse_message VAL [init=1, SSLv3_server_data={6:0}] [L1685] COND FALSE !(! (s->s3)->tmp.reuse_message) [L1714] skip = 0 VAL [init=1, SSLv3_server_data={6:0}] [L1136] COND TRUE 1 VAL [init=1, SSLv3_server_data={6:0}] [L1138] EXPR s->state [L1138] state = s->state [L1139] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1139] COND FALSE !(s->state == 12292) [L1142] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1142] COND FALSE !(s->state == 16384) [L1145] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1145] COND FALSE !(s->state == 8192) [L1148] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1148] COND FALSE !(s->state == 24576) [L1151] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1151] COND FALSE !(s->state == 8195) [L1154] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1154] COND FALSE !(s->state == 8480) [L1157] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1157] COND FALSE !(s->state == 8481) [L1160] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1160] COND FALSE !(s->state == 8482) [L1163] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1163] COND FALSE !(s->state == 8464) [L1166] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1166] COND FALSE !(s->state == 8465) [L1169] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1169] COND FALSE !(s->state == 8466) [L1172] EXPR s->state VAL [init=1, SSLv3_server_data={6: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={6:0}] [L1347] COND FALSE !(ret <= 0) [L1352] s->hit VAL [init=1, SSLv3_server_data={6:0}] [L1352] COND FALSE !(s->hit) [L1355] s->state = 8512 VAL [init=1, SSLv3_server_data={6:0}] [L1357] s->init_num = 0 VAL [init=1, SSLv3_server_data={6:0}] [L1685] EXPR s->s3 [L1685] EXPR (s->s3)->tmp.reuse_message VAL [init=1, SSLv3_server_data={6:0}] [L1685] COND FALSE !(! (s->s3)->tmp.reuse_message) [L1714] skip = 0 VAL [init=1, SSLv3_server_data={6:0}] [L1136] COND TRUE 1 VAL [init=1, SSLv3_server_data={6:0}] [L1138] EXPR s->state [L1138] state = s->state [L1139] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1139] COND FALSE !(s->state == 12292) [L1142] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1142] COND FALSE !(s->state == 16384) [L1145] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1145] COND FALSE !(s->state == 8192) [L1148] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1148] COND FALSE !(s->state == 24576) [L1151] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1151] COND FALSE !(s->state == 8195) [L1154] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1154] COND FALSE !(s->state == 8480) [L1157] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1157] COND FALSE !(s->state == 8481) [L1160] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1160] COND FALSE !(s->state == 8482) [L1163] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1163] COND FALSE !(s->state == 8464) [L1166] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1166] COND FALSE !(s->state == 8465) [L1169] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1169] COND FALSE !(s->state == 8466) [L1172] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1172] COND FALSE !(s->state == 8496) [L1175] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1175] COND FALSE !(s->state == 8497) [L1178] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1178] COND TRUE s->state == 8512 [L1361] EXPR s->s3 [L1361] EXPR (s->s3)->tmp.new_cipher [L1361] EXPR ((s->s3)->tmp.new_cipher)->algorithms VAL [init=1, SSLv3_server_data={6:0}] [L1361] COND FALSE !(((s->s3)->tmp.new_cipher)->algorithms & 256UL) [L1364] ret = __VERIFIER_nondet_int() [L1365] COND TRUE blastFlag == 2 [L1366] blastFlag = 6 VAL [init=1, SSLv3_server_data={6:0}] [L1370] COND FALSE !(ret <= 0) VAL [init=1, SSLv3_server_data={6:0}] [L1376] s->state = 8528 [L1377] s->init_num = 0 VAL [init=1, SSLv3_server_data={6:0}] [L1685] EXPR s->s3 [L1685] EXPR (s->s3)->tmp.reuse_message VAL [init=1, SSLv3_server_data={6:0}] [L1685] COND FALSE !(! (s->s3)->tmp.reuse_message) [L1714] skip = 0 VAL [init=1, SSLv3_server_data={6:0}] [L1136] COND TRUE 1 VAL [init=1, SSLv3_server_data={6:0}] [L1138] EXPR s->state [L1138] state = s->state [L1139] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1139] COND FALSE !(s->state == 12292) [L1142] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1142] COND FALSE !(s->state == 16384) [L1145] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1145] COND FALSE !(s->state == 8192) [L1148] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1148] COND FALSE !(s->state == 24576) [L1151] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1151] COND FALSE !(s->state == 8195) [L1154] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1154] COND FALSE !(s->state == 8480) [L1157] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1157] COND FALSE !(s->state == 8481) [L1160] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1160] COND FALSE !(s->state == 8482) [L1163] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1163] COND FALSE !(s->state == 8464) [L1166] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1166] COND FALSE !(s->state == 8465) [L1169] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1169] COND FALSE !(s->state == 8466) [L1172] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1172] COND FALSE !(s->state == 8496) [L1175] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1175] COND FALSE !(s->state == 8497) [L1178] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1178] COND FALSE !(s->state == 8512) [L1181] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1181] COND FALSE !(s->state == 8513) [L1184] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1184] COND TRUE s->state == 8528 [L1381] EXPR s->s3 [L1381] EXPR (s->s3)->tmp.new_cipher [L1381] EXPR ((s->s3)->tmp.new_cipher)->algorithms [L1381] l = ((s->s3)->tmp.new_cipher)->algorithms [L1382] EXPR s->options VAL [init=1, SSLv3_server_data={6:0}] [L1382] COND TRUE s->options & 2097152UL [L1383] EXPR s->s3 [L1383] (s->s3)->tmp.use_rsa_tmp = 1 [L1387] EXPR s->s3 [L1387] (s->s3)->tmp.use_rsa_tmp VAL [init=1, SSLv3_server_data={6:0}] [L1387] COND TRUE (s->s3)->tmp.use_rsa_tmp [L1405] ret = __VERIFIER_nondet_int() [L1406] COND TRUE blastFlag == 6 [L1407] blastFlag = 7 VAL [init=1, SSLv3_server_data={6:0}] [L1411] COND FALSE !(ret <= 0) VAL [init=1, SSLv3_server_data={6:0}] [L1428] s->state = 8544 [L1429] s->init_num = 0 VAL [init=1, SSLv3_server_data={6:0}] [L1685] EXPR s->s3 [L1685] EXPR (s->s3)->tmp.reuse_message VAL [init=1, SSLv3_server_data={6:0}] [L1685] COND FALSE !(! (s->s3)->tmp.reuse_message) [L1714] skip = 0 VAL [init=1, SSLv3_server_data={6:0}] [L1136] COND TRUE 1 VAL [init=1, SSLv3_server_data={6:0}] [L1138] EXPR s->state [L1138] state = s->state [L1139] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1139] COND FALSE !(s->state == 12292) [L1142] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1142] COND FALSE !(s->state == 16384) [L1145] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1145] COND FALSE !(s->state == 8192) [L1148] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1148] COND FALSE !(s->state == 24576) [L1151] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1151] COND FALSE !(s->state == 8195) [L1154] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1154] COND FALSE !(s->state == 8480) [L1157] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1157] COND FALSE !(s->state == 8481) [L1160] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1160] COND FALSE !(s->state == 8482) [L1163] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1163] COND FALSE !(s->state == 8464) [L1166] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1166] COND FALSE !(s->state == 8465) [L1169] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1169] COND FALSE !(s->state == 8466) [L1172] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1172] COND FALSE !(s->state == 8496) [L1175] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1175] COND FALSE !(s->state == 8497) [L1178] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1178] COND FALSE !(s->state == 8512) [L1181] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1181] COND FALSE !(s->state == 8513) [L1184] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1184] COND FALSE !(s->state == 8528) [L1187] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1187] COND FALSE !(s->state == 8529) [L1190] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1190] COND TRUE s->state == 8544 [L1433] EXPR s->verify_mode VAL [init=1, SSLv3_server_data={6:0}] [L1433] COND TRUE s->verify_mode & 1 [L1434] EXPR s->session [L1434] EXPR (s->session)->peer VAL [init=1, SSLv3_server_data={6:0}] [L1434] COND FALSE !((unsigned long )(s->session)->peer != (unsigned long )((void *)0)) [L1444] EXPR s->s3 [L1444] EXPR (s->s3)->tmp.new_cipher [L1444] EXPR ((s->s3)->tmp.new_cipher)->algorithms VAL [init=1, SSLv3_server_data={6:0}] [L1444] COND FALSE !(((s->s3)->tmp.new_cipher)->algorithms & 256UL) [L1454] EXPR s->s3 [L1454] (s->s3)->tmp.cert_request = 1 [L1455] ret = __VERIFIER_nondet_int() [L1456] COND TRUE blastFlag == 7 VAL [init=1, SSLv3_server_data={6:0}] [L1726] __VERIFIER_error() VAL [init=1, SSLv3_server_data={6:0}] - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 148 locations, 1 error locations. Result: UNSAFE, OverallTime: 12.5s, OverallIterations: 45, TraceHistogramMax: 5, AutomataDifference: 10.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 8837 SDtfs, 2842 SDslu, 12828 SDs, 0 SdLazy, 7576 SolverSat, 404 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 8.0s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 246 GetRequests, 88 SyntacticMatches, 32 SemanticMatches, 126 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1186occurred in iteration=44, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 44 MinimizatonAttempts, 1099 StatesRemovedByMinimization, 42 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 0.9s InterpolantComputationTime, 3473 NumberOfCodeBlocks, 3473 NumberOfCodeBlocksAsserted, 45 NumberOfCheckSat, 3302 ConstructedInterpolants, 0 QuantifiedInterpolants, 774146 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 44 InterpolantComputations, 44 PerfectInterpolantSequences, 1954/1954 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.25-f470102 [2019-12-07 17:12:35,502 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-07 17:12:35,503 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-07 17:12:35,511 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-07 17:12:35,511 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-07 17:12:35,512 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-07 17:12:35,513 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-07 17:12:35,514 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-07 17:12:35,515 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-07 17:12:35,516 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-07 17:12:35,517 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-07 17:12:35,517 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-07 17:12:35,518 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-07 17:12:35,518 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-07 17:12:35,519 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-07 17:12:35,520 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-07 17:12:35,520 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-07 17:12:35,521 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-07 17:12:35,522 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-07 17:12:35,524 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-07 17:12:35,525 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-07 17:12:35,526 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-07 17:12:35,527 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-07 17:12:35,527 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-07 17:12:35,529 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-07 17:12:35,530 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-07 17:12:35,530 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-07 17:12:35,530 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-07 17:12:35,531 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-07 17:12:35,531 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-07 17:12:35,531 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-07 17:12:35,532 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-07 17:12:35,532 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-07 17:12:35,533 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-07 17:12:35,534 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-07 17:12:35,534 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-07 17:12:35,534 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-07 17:12:35,534 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-07 17:12:35,534 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-07 17:12:35,535 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-07 17:12:35,535 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-07 17:12:35,536 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_e150036f-40d0-47ba-bbc9-598504b52bfb/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2019-12-07 17:12:35,546 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-07 17:12:35,546 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-07 17:12:35,547 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-07 17:12:35,547 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-07 17:12:35,547 INFO L138 SettingsManager]: * Use SBE=true [2019-12-07 17:12:35,548 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-07 17:12:35,548 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-07 17:12:35,548 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-07 17:12:35,548 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-07 17:12:35,548 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-07 17:12:35,548 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-07 17:12:35,548 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-07 17:12:35,549 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2019-12-07 17:12:35,549 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2019-12-07 17:12:35,549 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-07 17:12:35,549 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-07 17:12:35,549 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-07 17:12:35,549 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-07 17:12:35,549 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-07 17:12:35,550 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-12-07 17:12:35,550 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-07 17:12:35,550 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-07 17:12:35,550 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-07 17:12:35,550 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-07 17:12:35,550 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-07 17:12:35,550 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-07 17:12:35,551 INFO L138 SettingsManager]: * Trace refinement strategy=WOLF [2019-12-07 17:12:35,551 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --rewrite-divk --print-success --lang smt [2019-12-07 17:12:35,551 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-07 17:12:35,551 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2019-12-07 17:12:35,551 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-12-07 17:12:35,551 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_e150036f-40d0-47ba-bbc9-598504b52bfb/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 -> ca7b987059c829f244238d9119096032ac44debc [2019-12-07 17:12:35,727 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-07 17:12:35,735 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-07 17:12:35,737 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-07 17:12:35,738 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-07 17:12:35,738 INFO L275 PluginConnector]: CDTParser initialized [2019-12-07 17:12:35,738 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_e150036f-40d0-47ba-bbc9-598504b52bfb/bin/uautomizer/../../sv-benchmarks/c/ssh/s3_srvr.blast.11.i.cil-1.c [2019-12-07 17:12:35,776 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_e150036f-40d0-47ba-bbc9-598504b52bfb/bin/uautomizer/data/76550c34f/7e9b21e6c5aa4e21a7419302112a0b04/FLAG0e017b894 [2019-12-07 17:12:36,258 INFO L306 CDTParser]: Found 1 translation units. [2019-12-07 17:12:36,259 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_e150036f-40d0-47ba-bbc9-598504b52bfb/sv-benchmarks/c/ssh/s3_srvr.blast.11.i.cil-1.c [2019-12-07 17:12:36,271 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_e150036f-40d0-47ba-bbc9-598504b52bfb/bin/uautomizer/data/76550c34f/7e9b21e6c5aa4e21a7419302112a0b04/FLAG0e017b894 [2019-12-07 17:12:36,280 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_e150036f-40d0-47ba-bbc9-598504b52bfb/bin/uautomizer/data/76550c34f/7e9b21e6c5aa4e21a7419302112a0b04 [2019-12-07 17:12:36,282 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-07 17:12:36,283 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-12-07 17:12:36,283 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-07 17:12:36,283 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-07 17:12:36,285 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-07 17:12:36,286 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.12 05:12:36" (1/1) ... [2019-12-07 17:12:36,287 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@10831c8b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 05:12:36, skipping insertion in model container [2019-12-07 17:12:36,288 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.12 05:12:36" (1/1) ... [2019-12-07 17:12:36,292 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-07 17:12:36,326 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-07 17:12:36,599 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-07 17:12:36,610 INFO L203 MainTranslator]: Completed pre-run [2019-12-07 17:12:36,674 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-07 17:12:36,687 INFO L208 MainTranslator]: Completed translation [2019-12-07 17:12:36,688 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 05:12:36 WrapperNode [2019-12-07 17:12:36,688 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-07 17:12:36,688 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-07 17:12:36,689 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-07 17:12:36,689 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-07 17:12:36,694 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 05:12:36" (1/1) ... [2019-12-07 17:12:36,712 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 05:12:36" (1/1) ... [2019-12-07 17:12:36,743 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-07 17:12:36,743 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-07 17:12:36,743 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-07 17:12:36,743 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-07 17:12:36,750 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 05:12:36" (1/1) ... [2019-12-07 17:12:36,750 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 05:12:36" (1/1) ... [2019-12-07 17:12:36,756 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 05:12:36" (1/1) ... [2019-12-07 17:12:36,756 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 05:12:36" (1/1) ... [2019-12-07 17:12:36,781 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 05:12:36" (1/1) ... [2019-12-07 17:12:36,787 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 05:12:36" (1/1) ... [2019-12-07 17:12:36,791 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 05:12:36" (1/1) ... [2019-12-07 17:12:36,795 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-07 17:12:36,796 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-07 17:12:36,796 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-07 17:12:36,796 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-07 17:12:36,796 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 05:12:36" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_e150036f-40d0-47ba-bbc9-598504b52bfb/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-12-07 17:12:36,838 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2019-12-07 17:12:36,838 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-12-07 17:12:36,838 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4 [2019-12-07 17:12:36,838 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2019-12-07 17:12:36,838 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2019-12-07 17:12:36,838 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-07 17:12:36,838 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-07 17:12:36,839 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2019-12-07 17:12:36,959 WARN L738 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-12-07 17:12:38,774 INFO L691 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##87: assume false; [2019-12-07 17:12:38,774 INFO L691 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##88: assume !false; [2019-12-07 17:12:38,775 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-07 17:12:38,775 INFO L287 CfgBuilder]: Removed 7 assume(true) statements. [2019-12-07 17:12:38,776 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 05:12:38 BoogieIcfgContainer [2019-12-07 17:12:38,776 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-07 17:12:38,777 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-07 17:12:38,777 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-07 17:12:38,779 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-07 17:12:38,779 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.12 05:12:36" (1/3) ... [2019-12-07 17:12:38,780 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@31f8dcc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.12 05:12:38, skipping insertion in model container [2019-12-07 17:12:38,780 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 05:12:36" (2/3) ... [2019-12-07 17:12:38,780 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@31f8dcc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.12 05:12:38, skipping insertion in model container [2019-12-07 17:12:38,780 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 05:12:38" (3/3) ... [2019-12-07 17:12:38,782 INFO L109 eAbstractionObserver]: Analyzing ICFG s3_srvr.blast.11.i.cil-1.c [2019-12-07 17:12:38,788 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-07 17:12:38,793 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-12-07 17:12:38,801 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-12-07 17:12:38,823 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-07 17:12:38,823 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-07 17:12:38,823 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-07 17:12:38,824 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-12-07 17:12:38,824 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-07 17:12:38,824 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-07 17:12:38,824 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-07 17:12:38,824 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-07 17:12:38,837 INFO L276 IsEmpty]: Start isEmpty. Operand 148 states. [2019-12-07 17:12:38,843 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2019-12-07 17:12:38,843 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:12:38,844 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] [2019-12-07 17:12:38,844 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 17:12:38,847 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:12:38,848 INFO L82 PathProgramCache]: Analyzing trace with hash -2031756972, now seen corresponding path program 1 times [2019-12-07 17:12:38,856 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-12-07 17:12:38,856 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [733033360] [2019-12-07 17:12:38,856 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_e150036f-40d0-47ba-bbc9-598504b52bfb/bin/uautomizer/mathsat Starting monitored process 2 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with mathsat -unsat_core_generation=3 [2019-12-07 17:12:38,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:12:38,975 INFO L264 TraceCheckSpWp]: Trace formula consists of 125 conjuncts, 2 conjunts are in the unsatisfiable core [2019-12-07 17:12:38,981 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 17:12:39,012 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 17:12:39,013 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 17:12:39,033 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 17:12:39,034 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [733033360] [2019-12-07 17:12:39,034 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-12-07 17:12:39,035 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 4 [2019-12-07 17:12:39,035 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1968756332] [2019-12-07 17:12:39,040 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 17:12:39,040 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-12-07 17:12:39,051 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 17:12:39,052 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-07 17:12:39,054 INFO L87 Difference]: Start difference. First operand 148 states. Second operand 4 states. [2019-12-07 17:12:39,185 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 17:12:39,185 INFO L93 Difference]: Finished difference Result 561 states and 957 transitions. [2019-12-07 17:12:39,185 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 17:12:39,186 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 35 [2019-12-07 17:12:39,187 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 17:12:39,197 INFO L225 Difference]: With dead ends: 561 [2019-12-07 17:12:39,198 INFO L226 Difference]: Without dead ends: 382 [2019-12-07 17:12:39,200 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 66 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-12-07 17:12:39,213 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 382 states. [2019-12-07 17:12:39,244 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 382 to 380. [2019-12-07 17:12:39,244 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 380 states. [2019-12-07 17:12:39,246 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 380 states to 380 states and 579 transitions. [2019-12-07 17:12:39,247 INFO L78 Accepts]: Start accepts. Automaton has 380 states and 579 transitions. Word has length 35 [2019-12-07 17:12:39,247 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 17:12:39,248 INFO L462 AbstractCegarLoop]: Abstraction has 380 states and 579 transitions. [2019-12-07 17:12:39,248 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 17:12:39,248 INFO L276 IsEmpty]: Start isEmpty. Operand 380 states and 579 transitions. [2019-12-07 17:12:39,250 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2019-12-07 17:12:39,250 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:12:39,251 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] [2019-12-07 17:12:39,451 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 mathsat -unsat_core_generation=3 [2019-12-07 17:12:39,452 INFO L410 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 17:12:39,452 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:12:39,452 INFO L82 PathProgramCache]: Analyzing trace with hash -1192573563, now seen corresponding path program 1 times [2019-12-07 17:12:39,454 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-12-07 17:12:39,454 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [305545582] [2019-12-07 17:12:39,454 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_e150036f-40d0-47ba-bbc9-598504b52bfb/bin/uautomizer/mathsat Starting monitored process 3 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with mathsat -unsat_core_generation=3 [2019-12-07 17:12:39,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:12:39,644 INFO L264 TraceCheckSpWp]: Trace formula consists of 170 conjuncts, 2 conjunts are in the unsatisfiable core [2019-12-07 17:12:39,647 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 17:12:39,660 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 17:12:39,661 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 17:12:39,675 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 17:12:39,675 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [305545582] [2019-12-07 17:12:39,675 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-12-07 17:12:39,675 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 4 [2019-12-07 17:12:39,676 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1130378894] [2019-12-07 17:12:39,677 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 17:12:39,677 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-12-07 17:12:39,677 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 17:12:39,677 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-07 17:12:39,677 INFO L87 Difference]: Start difference. First operand 380 states and 579 transitions. Second operand 4 states. [2019-12-07 17:12:40,434 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 17:12:40,435 INFO L93 Difference]: Finished difference Result 876 states and 1345 transitions. [2019-12-07 17:12:40,435 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 17:12:40,435 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 59 [2019-12-07 17:12:40,436 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 17:12:40,440 INFO L225 Difference]: With dead ends: 876 [2019-12-07 17:12:40,440 INFO L226 Difference]: Without dead ends: 628 [2019-12-07 17:12:40,442 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 116 GetRequests, 114 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-12-07 17:12:40,443 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 628 states. [2019-12-07 17:12:40,473 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 628 to 626. [2019-12-07 17:12:40,473 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 626 states. [2019-12-07 17:12:40,476 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 626 states to 626 states and 950 transitions. [2019-12-07 17:12:40,476 INFO L78 Accepts]: Start accepts. Automaton has 626 states and 950 transitions. Word has length 59 [2019-12-07 17:12:40,477 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 17:12:40,477 INFO L462 AbstractCegarLoop]: Abstraction has 626 states and 950 transitions. [2019-12-07 17:12:40,477 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 17:12:40,477 INFO L276 IsEmpty]: Start isEmpty. Operand 626 states and 950 transitions. [2019-12-07 17:12:40,482 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2019-12-07 17:12:40,482 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:12:40,482 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12-07 17:12:40,683 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 mathsat -unsat_core_generation=3 [2019-12-07 17:12:40,683 INFO L410 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 17:12:40,684 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:12:40,684 INFO L82 PathProgramCache]: Analyzing trace with hash 1680839393, now seen corresponding path program 1 times [2019-12-07 17:12:40,685 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-12-07 17:12:40,686 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1230924611] [2019-12-07 17:12:40,686 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_e150036f-40d0-47ba-bbc9-598504b52bfb/bin/uautomizer/mathsat Starting monitored process 4 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with mathsat -unsat_core_generation=3 [2019-12-07 17:12:40,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:12:40,912 INFO L264 TraceCheckSpWp]: Trace formula consists of 264 conjuncts, 2 conjunts are in the unsatisfiable core [2019-12-07 17:12:40,916 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 17:12:40,946 INFO L134 CoverageAnalysis]: Checked inductivity of 88 backedges. 77 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-12-07 17:12:40,947 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 17:12:40,966 INFO L134 CoverageAnalysis]: Checked inductivity of 88 backedges. 77 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-12-07 17:12:40,966 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1230924611] [2019-12-07 17:12:40,966 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-12-07 17:12:40,967 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 4 [2019-12-07 17:12:40,967 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [271151673] [2019-12-07 17:12:40,967 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 17:12:40,967 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-12-07 17:12:40,967 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 17:12:40,967 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-07 17:12:40,968 INFO L87 Difference]: Start difference. First operand 626 states and 950 transitions. Second operand 4 states. [2019-12-07 17:12:41,584 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 17:12:41,584 INFO L93 Difference]: Finished difference Result 1366 states and 2085 transitions. [2019-12-07 17:12:41,585 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 17:12:41,585 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 103 [2019-12-07 17:12:41,585 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 17:12:41,589 INFO L225 Difference]: With dead ends: 1366 [2019-12-07 17:12:41,589 INFO L226 Difference]: Without dead ends: 872 [2019-12-07 17:12:41,591 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-12-07 17:12:41,591 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 872 states. [2019-12-07 17:12:41,611 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 872 to 872. [2019-12-07 17:12:41,611 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 872 states. [2019-12-07 17:12:41,614 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 872 states to 872 states and 1320 transitions. [2019-12-07 17:12:41,614 INFO L78 Accepts]: Start accepts. Automaton has 872 states and 1320 transitions. Word has length 103 [2019-12-07 17:12:41,614 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 17:12:41,614 INFO L462 AbstractCegarLoop]: Abstraction has 872 states and 1320 transitions. [2019-12-07 17:12:41,615 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 17:12:41,615 INFO L276 IsEmpty]: Start isEmpty. Operand 872 states and 1320 transitions. [2019-12-07 17:12:41,616 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2019-12-07 17:12:41,617 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:12:41,617 INFO L410 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 17:12:41,817 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 mathsat -unsat_core_generation=3 [2019-12-07 17:12:41,818 INFO L410 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 17:12:41,818 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:12:41,819 INFO L82 PathProgramCache]: Analyzing trace with hash 1159018067, now seen corresponding path program 1 times [2019-12-07 17:12:41,820 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-12-07 17:12:41,820 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1451912135] [2019-12-07 17:12:41,821 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_e150036f-40d0-47ba-bbc9-598504b52bfb/bin/uautomizer/mathsat Starting monitored process 5 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with mathsat -unsat_core_generation=3 [2019-12-07 17:12:42,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:12:42,092 INFO L264 TraceCheckSpWp]: Trace formula consists of 314 conjuncts, 4 conjunts are in the unsatisfiable core [2019-12-07 17:12:42,097 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 17:12:42,131 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2019-12-07 17:12:42,131 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 17:12:42,135 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 17:12:42,136 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 17:12:42,136 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:13, output treesize:9 [2019-12-07 17:12:42,162 INFO L343 Elim1Store]: treesize reduction 27, result has 25.0 percent of original size [2019-12-07 17:12:42,162 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 23 treesize of output 22 [2019-12-07 17:12:42,163 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 17:12:42,171 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 17:12:42,171 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 17:12:42,171 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:23, output treesize:19 [2019-12-07 17:12:42,194 INFO L343 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2019-12-07 17:12:42,195 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 28 treesize of output 10 [2019-12-07 17:12:42,195 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 17:12:42,198 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 17:12:42,198 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 17:12:42,198 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:28, output treesize:3 [2019-12-07 17:12:42,221 INFO L134 CoverageAnalysis]: Checked inductivity of 154 backedges. 122 proven. 0 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2019-12-07 17:12:42,221 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 17:12:42,269 INFO L134 CoverageAnalysis]: Checked inductivity of 154 backedges. 122 proven. 0 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2019-12-07 17:12:42,270 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1451912135] [2019-12-07 17:12:42,270 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-12-07 17:12:42,270 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5, 4] imperfect sequences [] total 7 [2019-12-07 17:12:42,270 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [675673685] [2019-12-07 17:12:42,270 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-07 17:12:42,270 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-12-07 17:12:42,271 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-07 17:12:42,271 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-12-07 17:12:42,271 INFO L87 Difference]: Start difference. First operand 872 states and 1320 transitions. Second operand 7 states. [2019-12-07 17:12:55,653 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 17:12:55,653 INFO L93 Difference]: Finished difference Result 3288 states and 4998 transitions. [2019-12-07 17:12:55,655 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-07 17:12:55,655 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 127 [2019-12-07 17:12:55,656 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 17:12:55,665 INFO L225 Difference]: With dead ends: 3288 [2019-12-07 17:12:55,665 INFO L226 Difference]: Without dead ends: 2424 [2019-12-07 17:12:55,667 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 254 GetRequests, 246 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2019-12-07 17:12:55,669 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2424 states. [2019-12-07 17:12:55,701 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2424 to 1046. [2019-12-07 17:12:55,701 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1046 states. [2019-12-07 17:12:55,704 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1046 states to 1046 states and 1620 transitions. [2019-12-07 17:12:55,704 INFO L78 Accepts]: Start accepts. Automaton has 1046 states and 1620 transitions. Word has length 127 [2019-12-07 17:12:55,704 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 17:12:55,704 INFO L462 AbstractCegarLoop]: Abstraction has 1046 states and 1620 transitions. [2019-12-07 17:12:55,704 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-07 17:12:55,705 INFO L276 IsEmpty]: Start isEmpty. Operand 1046 states and 1620 transitions. [2019-12-07 17:12:55,706 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2019-12-07 17:12:55,707 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:12:55,707 INFO L410 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 17:12:55,907 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 mathsat -unsat_core_generation=3 [2019-12-07 17:12:55,907 INFO L410 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 17:12:55,908 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:12:55,908 INFO L82 PathProgramCache]: Analyzing trace with hash -799556719, now seen corresponding path program 1 times [2019-12-07 17:12:55,908 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-12-07 17:12:55,909 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [348937913] [2019-12-07 17:12:55,909 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_e150036f-40d0-47ba-bbc9-598504b52bfb/bin/uautomizer/mathsat Starting monitored process 6 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with mathsat -unsat_core_generation=3 [2019-12-07 17:12:56,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-07 17:12:56,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-07 17:12:56,859 INFO L174 FreeRefinementEngine]: Strategy WOLF found a feasible trace [2019-12-07 17:12:56,859 INFO L475 BasicCegarLoop]: Counterexample might be feasible [2019-12-07 17:12:57,060 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 mathsat -unsat_core_generation=3 [2019-12-07 17:12:57,177 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 07.12 05:12:57 BoogieIcfgContainer [2019-12-07 17:12:57,177 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-07 17:12:57,177 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-12-07 17:12:57,177 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-12-07 17:12:57,178 INFO L275 PluginConnector]: Witness Printer initialized [2019-12-07 17:12:57,178 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 05:12:38" (3/4) ... [2019-12-07 17:12:57,180 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2019-12-07 17:12:57,272 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/run_dir_e150036f-40d0-47ba-bbc9-598504b52bfb/bin/uautomizer/witness.graphml [2019-12-07 17:12:57,272 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-12-07 17:12:57,273 INFO L168 Benchmark]: Toolchain (without parser) took 20990.67 ms. Allocated memory was 1.0 GB in the beginning and 1.3 GB in the end (delta: 291.5 MB). Free memory was 948.4 MB in the beginning and 1.2 GB in the end (delta: -295.3 MB). There was no memory consumed. Max. memory is 11.5 GB. [2019-12-07 17:12:57,273 INFO L168 Benchmark]: CDTParser took 0.14 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-12-07 17:12:57,274 INFO L168 Benchmark]: CACSL2BoogieTranslator took 405.03 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 147.8 MB). Free memory was 948.4 MB in the beginning and 1.1 GB in the end (delta: -174.1 MB). Peak memory consumption was 28.2 MB. Max. memory is 11.5 GB. [2019-12-07 17:12:57,274 INFO L168 Benchmark]: Boogie Procedure Inliner took 54.42 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.7 MB). Peak memory consumption was 6.7 MB. Max. memory is 11.5 GB. [2019-12-07 17:12:57,274 INFO L168 Benchmark]: Boogie Preprocessor took 52.20 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: 13.4 MB). Peak memory consumption was 13.4 MB. Max. memory is 11.5 GB. [2019-12-07 17:12:57,275 INFO L168 Benchmark]: RCFGBuilder took 1980.86 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: 93.3 MB). Peak memory consumption was 93.3 MB. Max. memory is 11.5 GB. [2019-12-07 17:12:57,275 INFO L168 Benchmark]: TraceAbstraction took 18400.01 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 143.7 MB). Free memory was 1.0 GB in the beginning and 1.3 GB in the end (delta: -252.2 MB). Peak memory consumption was 275.4 MB. Max. memory is 11.5 GB. [2019-12-07 17:12:57,275 INFO L168 Benchmark]: Witness Printer took 94.92 ms. Allocated memory is still 1.3 GB. Free memory was 1.3 GB in the beginning and 1.2 GB in the end (delta: 17.6 MB). Peak memory consumption was 17.6 MB. Max. memory is 11.5 GB. [2019-12-07 17:12:57,277 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.14 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 405.03 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 147.8 MB). Free memory was 948.4 MB in the beginning and 1.1 GB in the end (delta: -174.1 MB). Peak memory consumption was 28.2 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 54.42 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.7 MB). Peak memory consumption was 6.7 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 52.20 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: 13.4 MB). Peak memory consumption was 13.4 MB. Max. memory is 11.5 GB. * RCFGBuilder took 1980.86 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: 93.3 MB). Peak memory consumption was 93.3 MB. Max. memory is 11.5 GB. * TraceAbstraction took 18400.01 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 143.7 MB). Free memory was 1.0 GB in the beginning and 1.3 GB in the end (delta: -252.2 MB). Peak memory consumption was 275.4 MB. Max. memory is 11.5 GB. * Witness Printer took 94.92 ms. Allocated memory is still 1.3 GB. Free memory was 1.3 GB in the beginning and 1.2 GB in the end (delta: 17.6 MB). Peak memory consumption was 17.6 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 1726]: 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={-1: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)) [L1080] BUF_MEM *buf ; [L1081] unsigned long l ; [L1082] unsigned long Time ; [L1083] unsigned long tmp ; [L1084] void (*cb)() ; [L1085] long num1 ; [L1086] int ret ; [L1087] int new_state ; [L1088] int state ; [L1089] int skip ; [L1090] int got_new_session ; [L1091] int tmp___1 = __VERIFIER_nondet_int() ; [L1092] int tmp___2 = __VERIFIER_nondet_int() ; [L1093] int tmp___3 = __VERIFIER_nondet_int() ; [L1094] int tmp___4 = __VERIFIER_nondet_int() ; [L1095] int tmp___5 = __VERIFIER_nondet_int() ; [L1096] int tmp___6 = __VERIFIER_nondet_int() ; [L1097] int tmp___7 ; [L1098] long tmp___8 = __VERIFIER_nondet_long() ; [L1099] int tmp___9 = __VERIFIER_nondet_int() ; [L1100] int tmp___10 = __VERIFIER_nondet_int() ; [L1101] int blastFlag ; [L1105] s->state = 8464 [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={-1: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={-1:0}] [L1130] EXPR s->cert VAL [init=1, SSLv3_server_data={-1:0}] [L1130] COND FALSE !((unsigned long )s->cert == (unsigned long )((void *)0)) [L1136] COND TRUE 1 VAL [init=1, SSLv3_server_data={-1:0}] [L1138] EXPR s->state [L1138] state = s->state [L1139] EXPR s->state VAL [init=1, SSLv3_server_data={-1:0}] [L1139] COND FALSE !(s->state == 12292) [L1142] EXPR s->state VAL [init=1, SSLv3_server_data={-1:0}] [L1142] COND FALSE !(s->state == 16384) [L1145] EXPR s->state VAL [init=1, SSLv3_server_data={-1:0}] [L1145] COND FALSE !(s->state == 8192) [L1148] EXPR s->state VAL [init=1, SSLv3_server_data={-1:0}] [L1148] COND FALSE !(s->state == 24576) [L1151] EXPR s->state VAL [init=1, SSLv3_server_data={-1:0}] [L1151] COND FALSE !(s->state == 8195) [L1154] EXPR s->state VAL [init=1, SSLv3_server_data={-1:0}] [L1154] COND FALSE !(s->state == 8480) [L1157] EXPR s->state VAL [init=1, SSLv3_server_data={-1:0}] [L1157] COND FALSE !(s->state == 8481) [L1160] EXPR s->state VAL [init=1, SSLv3_server_data={-1:0}] [L1160] COND FALSE !(s->state == 8482) [L1163] EXPR s->state VAL [init=1, SSLv3_server_data={-1: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={-1: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={-1:0}] [L1685] EXPR s->s3 [L1685] EXPR (s->s3)->tmp.reuse_message VAL [init=1, SSLv3_server_data={-1:0}] [L1685] COND FALSE !(! (s->s3)->tmp.reuse_message) [L1714] skip = 0 VAL [init=1, SSLv3_server_data={-1:0}] [L1136] COND TRUE 1 VAL [init=1, SSLv3_server_data={-1:0}] [L1138] EXPR s->state [L1138] state = s->state [L1139] EXPR s->state VAL [init=1, SSLv3_server_data={-1:0}] [L1139] COND FALSE !(s->state == 12292) [L1142] EXPR s->state VAL [init=1, SSLv3_server_data={-1:0}] [L1142] COND FALSE !(s->state == 16384) [L1145] EXPR s->state VAL [init=1, SSLv3_server_data={-1:0}] [L1145] COND FALSE !(s->state == 8192) [L1148] EXPR s->state VAL [init=1, SSLv3_server_data={-1:0}] [L1148] COND FALSE !(s->state == 24576) [L1151] EXPR s->state VAL [init=1, SSLv3_server_data={-1:0}] [L1151] COND FALSE !(s->state == 8195) [L1154] EXPR s->state VAL [init=1, SSLv3_server_data={-1:0}] [L1154] COND FALSE !(s->state == 8480) [L1157] EXPR s->state VAL [init=1, SSLv3_server_data={-1:0}] [L1157] COND FALSE !(s->state == 8481) [L1160] EXPR s->state VAL [init=1, SSLv3_server_data={-1:0}] [L1160] COND FALSE !(s->state == 8482) [L1163] EXPR s->state VAL [init=1, SSLv3_server_data={-1:0}] [L1163] COND FALSE !(s->state == 8464) [L1166] EXPR s->state VAL [init=1, SSLv3_server_data={-1:0}] [L1166] COND FALSE !(s->state == 8465) [L1169] EXPR s->state VAL [init=1, SSLv3_server_data={-1:0}] [L1169] COND FALSE !(s->state == 8466) [L1172] EXPR s->state VAL [init=1, SSLv3_server_data={-1: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={-1:0}] [L1347] COND FALSE !(ret <= 0) [L1352] s->hit VAL [init=1, SSLv3_server_data={-1:0}] [L1352] COND FALSE !(s->hit) [L1355] s->state = 8512 VAL [init=1, SSLv3_server_data={-1:0}] [L1357] s->init_num = 0 VAL [init=1, SSLv3_server_data={-1:0}] [L1685] EXPR s->s3 [L1685] EXPR (s->s3)->tmp.reuse_message VAL [init=1, SSLv3_server_data={-1:0}] [L1685] COND FALSE !(! (s->s3)->tmp.reuse_message) [L1714] skip = 0 VAL [init=1, SSLv3_server_data={-1:0}] [L1136] COND TRUE 1 VAL [init=1, SSLv3_server_data={-1:0}] [L1138] EXPR s->state [L1138] state = s->state [L1139] EXPR s->state VAL [init=1, SSLv3_server_data={-1:0}] [L1139] COND FALSE !(s->state == 12292) [L1142] EXPR s->state VAL [init=1, SSLv3_server_data={-1:0}] [L1142] COND FALSE !(s->state == 16384) [L1145] EXPR s->state VAL [init=1, SSLv3_server_data={-1:0}] [L1145] COND FALSE !(s->state == 8192) [L1148] EXPR s->state VAL [init=1, SSLv3_server_data={-1:0}] [L1148] COND FALSE !(s->state == 24576) [L1151] EXPR s->state VAL [init=1, SSLv3_server_data={-1:0}] [L1151] COND FALSE !(s->state == 8195) [L1154] EXPR s->state VAL [init=1, SSLv3_server_data={-1:0}] [L1154] COND FALSE !(s->state == 8480) [L1157] EXPR s->state VAL [init=1, SSLv3_server_data={-1:0}] [L1157] COND FALSE !(s->state == 8481) [L1160] EXPR s->state VAL [init=1, SSLv3_server_data={-1:0}] [L1160] COND FALSE !(s->state == 8482) [L1163] EXPR s->state VAL [init=1, SSLv3_server_data={-1:0}] [L1163] COND FALSE !(s->state == 8464) [L1166] EXPR s->state VAL [init=1, SSLv3_server_data={-1:0}] [L1166] COND FALSE !(s->state == 8465) [L1169] EXPR s->state VAL [init=1, SSLv3_server_data={-1:0}] [L1169] COND FALSE !(s->state == 8466) [L1172] EXPR s->state VAL [init=1, SSLv3_server_data={-1:0}] [L1172] COND FALSE !(s->state == 8496) [L1175] EXPR s->state VAL [init=1, SSLv3_server_data={-1:0}] [L1175] COND FALSE !(s->state == 8497) [L1178] EXPR s->state VAL [init=1, SSLv3_server_data={-1:0}] [L1178] COND TRUE s->state == 8512 [L1361] EXPR s->s3 [L1361] EXPR (s->s3)->tmp.new_cipher [L1361] EXPR ((s->s3)->tmp.new_cipher)->algorithms VAL [init=1, SSLv3_server_data={-1:0}] [L1361] COND FALSE !(((s->s3)->tmp.new_cipher)->algorithms & 256UL) [L1364] ret = __VERIFIER_nondet_int() [L1365] COND TRUE blastFlag == 2 [L1366] blastFlag = 6 VAL [init=1, SSLv3_server_data={-1:0}] [L1370] COND FALSE !(ret <= 0) VAL [init=1, SSLv3_server_data={-1:0}] [L1376] s->state = 8528 [L1377] s->init_num = 0 VAL [init=1, SSLv3_server_data={-1:0}] [L1685] EXPR s->s3 [L1685] EXPR (s->s3)->tmp.reuse_message VAL [init=1, SSLv3_server_data={-1:0}] [L1685] COND FALSE !(! (s->s3)->tmp.reuse_message) [L1714] skip = 0 VAL [init=1, SSLv3_server_data={-1:0}] [L1136] COND TRUE 1 VAL [init=1, SSLv3_server_data={-1:0}] [L1138] EXPR s->state [L1138] state = s->state [L1139] EXPR s->state VAL [init=1, SSLv3_server_data={-1:0}] [L1139] COND FALSE !(s->state == 12292) [L1142] EXPR s->state VAL [init=1, SSLv3_server_data={-1:0}] [L1142] COND FALSE !(s->state == 16384) [L1145] EXPR s->state VAL [init=1, SSLv3_server_data={-1:0}] [L1145] COND FALSE !(s->state == 8192) [L1148] EXPR s->state VAL [init=1, SSLv3_server_data={-1:0}] [L1148] COND FALSE !(s->state == 24576) [L1151] EXPR s->state VAL [init=1, SSLv3_server_data={-1:0}] [L1151] COND FALSE !(s->state == 8195) [L1154] EXPR s->state VAL [init=1, SSLv3_server_data={-1:0}] [L1154] COND FALSE !(s->state == 8480) [L1157] EXPR s->state VAL [init=1, SSLv3_server_data={-1:0}] [L1157] COND FALSE !(s->state == 8481) [L1160] EXPR s->state VAL [init=1, SSLv3_server_data={-1:0}] [L1160] COND FALSE !(s->state == 8482) [L1163] EXPR s->state VAL [init=1, SSLv3_server_data={-1:0}] [L1163] COND FALSE !(s->state == 8464) [L1166] EXPR s->state VAL [init=1, SSLv3_server_data={-1:0}] [L1166] COND FALSE !(s->state == 8465) [L1169] EXPR s->state VAL [init=1, SSLv3_server_data={-1:0}] [L1169] COND FALSE !(s->state == 8466) [L1172] EXPR s->state VAL [init=1, SSLv3_server_data={-1:0}] [L1172] COND FALSE !(s->state == 8496) [L1175] EXPR s->state VAL [init=1, SSLv3_server_data={-1:0}] [L1175] COND FALSE !(s->state == 8497) [L1178] EXPR s->state VAL [init=1, SSLv3_server_data={-1:0}] [L1178] COND FALSE !(s->state == 8512) [L1181] EXPR s->state VAL [init=1, SSLv3_server_data={-1:0}] [L1181] COND FALSE !(s->state == 8513) [L1184] EXPR s->state VAL [init=1, SSLv3_server_data={-1:0}] [L1184] COND TRUE s->state == 8528 [L1381] EXPR s->s3 [L1381] EXPR (s->s3)->tmp.new_cipher [L1381] EXPR ((s->s3)->tmp.new_cipher)->algorithms [L1381] l = ((s->s3)->tmp.new_cipher)->algorithms [L1382] EXPR s->options VAL [init=1, SSLv3_server_data={-1:0}] [L1382] COND TRUE s->options & 2097152UL [L1383] EXPR s->s3 [L1383] (s->s3)->tmp.use_rsa_tmp = 1 [L1387] EXPR s->s3 [L1387] (s->s3)->tmp.use_rsa_tmp VAL [init=1, SSLv3_server_data={-1:0}] [L1387] COND TRUE (s->s3)->tmp.use_rsa_tmp [L1405] ret = __VERIFIER_nondet_int() [L1406] COND TRUE blastFlag == 6 [L1407] blastFlag = 7 VAL [init=1, SSLv3_server_data={-1:0}] [L1411] COND FALSE !(ret <= 0) VAL [init=1, SSLv3_server_data={-1:0}] [L1428] s->state = 8544 [L1429] s->init_num = 0 VAL [init=1, SSLv3_server_data={-1:0}] [L1685] EXPR s->s3 [L1685] EXPR (s->s3)->tmp.reuse_message VAL [init=1, SSLv3_server_data={-1:0}] [L1685] COND FALSE !(! (s->s3)->tmp.reuse_message) [L1714] skip = 0 VAL [init=1, SSLv3_server_data={-1:0}] [L1136] COND TRUE 1 VAL [init=1, SSLv3_server_data={-1:0}] [L1138] EXPR s->state [L1138] state = s->state [L1139] EXPR s->state VAL [init=1, SSLv3_server_data={-1:0}] [L1139] COND FALSE !(s->state == 12292) [L1142] EXPR s->state VAL [init=1, SSLv3_server_data={-1:0}] [L1142] COND FALSE !(s->state == 16384) [L1145] EXPR s->state VAL [init=1, SSLv3_server_data={-1:0}] [L1145] COND FALSE !(s->state == 8192) [L1148] EXPR s->state VAL [init=1, SSLv3_server_data={-1:0}] [L1148] COND FALSE !(s->state == 24576) [L1151] EXPR s->state VAL [init=1, SSLv3_server_data={-1:0}] [L1151] COND FALSE !(s->state == 8195) [L1154] EXPR s->state VAL [init=1, SSLv3_server_data={-1:0}] [L1154] COND FALSE !(s->state == 8480) [L1157] EXPR s->state VAL [init=1, SSLv3_server_data={-1:0}] [L1157] COND FALSE !(s->state == 8481) [L1160] EXPR s->state VAL [init=1, SSLv3_server_data={-1:0}] [L1160] COND FALSE !(s->state == 8482) [L1163] EXPR s->state VAL [init=1, SSLv3_server_data={-1:0}] [L1163] COND FALSE !(s->state == 8464) [L1166] EXPR s->state VAL [init=1, SSLv3_server_data={-1:0}] [L1166] COND FALSE !(s->state == 8465) [L1169] EXPR s->state VAL [init=1, SSLv3_server_data={-1:0}] [L1169] COND FALSE !(s->state == 8466) [L1172] EXPR s->state VAL [init=1, SSLv3_server_data={-1:0}] [L1172] COND FALSE !(s->state == 8496) [L1175] EXPR s->state VAL [init=1, SSLv3_server_data={-1:0}] [L1175] COND FALSE !(s->state == 8497) [L1178] EXPR s->state VAL [init=1, SSLv3_server_data={-1:0}] [L1178] COND FALSE !(s->state == 8512) [L1181] EXPR s->state VAL [init=1, SSLv3_server_data={-1:0}] [L1181] COND FALSE !(s->state == 8513) [L1184] EXPR s->state VAL [init=1, SSLv3_server_data={-1:0}] [L1184] COND FALSE !(s->state == 8528) [L1187] EXPR s->state VAL [init=1, SSLv3_server_data={-1:0}] [L1187] COND FALSE !(s->state == 8529) [L1190] EXPR s->state VAL [init=1, SSLv3_server_data={-1:0}] [L1190] COND TRUE s->state == 8544 [L1433] EXPR s->verify_mode VAL [init=1, SSLv3_server_data={-1:0}] [L1433] COND TRUE s->verify_mode & 1 [L1434] EXPR s->session [L1434] EXPR (s->session)->peer VAL [init=1, SSLv3_server_data={-1:0}] [L1434] COND FALSE !((unsigned long )(s->session)->peer != (unsigned long )((void *)0)) [L1444] EXPR s->s3 [L1444] EXPR (s->s3)->tmp.new_cipher [L1444] EXPR ((s->s3)->tmp.new_cipher)->algorithms VAL [init=1, SSLv3_server_data={-1:0}] [L1444] COND FALSE !(((s->s3)->tmp.new_cipher)->algorithms & 256UL) [L1454] EXPR s->s3 [L1454] (s->s3)->tmp.cert_request = 1 [L1455] ret = __VERIFIER_nondet_int() [L1456] COND TRUE blastFlag == 7 VAL [init=1, SSLv3_server_data={-1:0}] [L1726] __VERIFIER_error() VAL [init=1, SSLv3_server_data={-1:0}] - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 148 locations, 1 error locations. Result: UNSAFE, OverallTime: 18.2s, OverallIterations: 5, TraceHistogramMax: 5, AutomataDifference: 14.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 1308 SDtfs, 1593 SDslu, 2155 SDs, 0 SdLazy, 975 SolverSat, 129 SolverUnsat, 1 SolverUnknown, 0 SolverNotchecked, 14.0s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 642 GetRequests, 628 SyntacticMatches, 1 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1046occurred in iteration=4, 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, 4 MinimizatonAttempts, 1382 StatesRemovedByMinimization, 3 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.7s SatisfiabilityAnalysisTime, 0.3s InterpolantComputationTime, 451 NumberOfCodeBlocks, 451 NumberOfCodeBlocksAsserted, 5 NumberOfCheckSat, 640 ConstructedInterpolants, 0 QuantifiedInterpolants, 180600 SizeOfPredicates, 5 NumberOfNonLiveVariables, 873 ConjunctsInSsa, 10 ConjunctsInUnsatCore, 8 InterpolantComputations, 8 PerfectInterpolantSequences, 506/506 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...