./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/ssh/s3_clnt.blast.03.i.cil-1.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 6b5699aa Calling Ultimate with: /usr/lib/jvm/java-8-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/run_dir_1577eaba-c8df-49de-920b-6f96275043ad/bin/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/run_dir_1577eaba-c8df-49de-920b-6f96275043ad/bin/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_1577eaba-c8df-49de-920b-6f96275043ad/bin/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_1577eaba-c8df-49de-920b-6f96275043ad/bin/uautomizer/config/AutomizerReach.xml -i ../../sv-benchmarks/c/ssh/s3_clnt.blast.03.i.cil-1.c -s /tmp/vcloud-vcloud-master/worker/run_dir_1577eaba-c8df-49de-920b-6f96275043ad/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_1577eaba-c8df-49de-920b-6f96275043ad/bin/uautomizer --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(__VERIFIER_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash ed035556db4b60d2bb3e3e70af5f975a04e628c4 ....................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis Calling Ultimate with: /usr/lib/jvm/java-8-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/run_dir_1577eaba-c8df-49de-920b-6f96275043ad/bin/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/run_dir_1577eaba-c8df-49de-920b-6f96275043ad/bin/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_1577eaba-c8df-49de-920b-6f96275043ad/bin/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_1577eaba-c8df-49de-920b-6f96275043ad/bin/uautomizer/config/AutomizerReach.xml -i ../../sv-benchmarks/c/ssh/s3_clnt.blast.03.i.cil-1.c -s /tmp/vcloud-vcloud-master/worker/run_dir_1577eaba-c8df-49de-920b-6f96275043ad/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_1577eaba-c8df-49de-920b-6f96275043ad/bin/uautomizer --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(__VERIFIER_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash ed035556db4b60d2bb3e3e70af5f975a04e628c4 ................................................................................................................................................................. Execution finished normally Writing output log to file Ultimate.log Result: ERROR: ExceptionOrErrorResult: UnsupportedOperationException: Unsupported type(() : VOID) --- Real Ultimate output --- This is Ultimate 0.1.24-6b5699a [2019-11-25 08:53:24,858 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-25 08:53:24,860 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-25 08:53:24,874 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-25 08:53:24,874 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-25 08:53:24,875 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-25 08:53:24,876 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-25 08:53:24,878 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-25 08:53:24,880 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-25 08:53:24,881 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-25 08:53:24,881 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-25 08:53:24,882 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-25 08:53:24,883 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-25 08:53:24,884 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-25 08:53:24,884 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-25 08:53:24,885 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-25 08:53:24,886 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-25 08:53:24,887 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-25 08:53:24,889 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-25 08:53:24,891 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-25 08:53:24,893 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-25 08:53:24,893 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-25 08:53:24,894 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-25 08:53:24,895 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-25 08:53:24,902 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-25 08:53:24,903 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-25 08:53:24,903 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-25 08:53:24,904 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-25 08:53:24,904 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-25 08:53:24,905 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-25 08:53:24,905 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-25 08:53:24,906 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-25 08:53:24,906 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-25 08:53:24,907 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-25 08:53:24,908 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-25 08:53:24,908 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-25 08:53:24,909 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-25 08:53:24,909 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-25 08:53:24,909 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-25 08:53:24,910 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-25 08:53:24,910 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-25 08:53:24,911 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_1577eaba-c8df-49de-920b-6f96275043ad/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf [2019-11-25 08:53:24,932 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-25 08:53:24,932 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-25 08:53:24,933 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-25 08:53:24,934 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-25 08:53:24,934 INFO L138 SettingsManager]: * Use SBE=true [2019-11-25 08:53:24,934 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-25 08:53:24,934 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-25 08:53:24,934 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-25 08:53:24,935 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-25 08:53:24,935 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-25 08:53:24,936 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-11-25 08:53:24,936 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-25 08:53:24,936 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-11-25 08:53:24,936 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-25 08:53:24,937 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-25 08:53:24,937 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-25 08:53:24,937 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-11-25 08:53:24,937 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-25 08:53:24,937 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-25 08:53:24,937 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-25 08:53:24,938 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-25 08:53:24,938 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-25 08:53:24,938 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-25 08:53:24,938 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-25 08:53:24,939 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-11-25 08:53:24,939 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-11-25 08:53:24,939 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-11-25 08:53:24,939 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-11-25 08:53:24,939 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_1577eaba-c8df-49de-920b-6f96275043ad/bin/uautomizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(__VERIFIER_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> ed035556db4b60d2bb3e3e70af5f975a04e628c4 [2019-11-25 08:53:25,067 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-25 08:53:25,077 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-25 08:53:25,080 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-25 08:53:25,081 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-25 08:53:25,081 INFO L275 PluginConnector]: CDTParser initialized [2019-11-25 08:53:25,082 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_1577eaba-c8df-49de-920b-6f96275043ad/bin/uautomizer/../../sv-benchmarks/c/ssh/s3_clnt.blast.03.i.cil-1.c [2019-11-25 08:53:25,129 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_1577eaba-c8df-49de-920b-6f96275043ad/bin/uautomizer/data/2cd5b6ed4/ded19e2974eb487d9f7bcf9d69284589/FLAGbf85fa081 [2019-11-25 08:53:25,649 INFO L306 CDTParser]: Found 1 translation units. [2019-11-25 08:53:25,651 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_1577eaba-c8df-49de-920b-6f96275043ad/sv-benchmarks/c/ssh/s3_clnt.blast.03.i.cil-1.c [2019-11-25 08:53:25,673 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_1577eaba-c8df-49de-920b-6f96275043ad/bin/uautomizer/data/2cd5b6ed4/ded19e2974eb487d9f7bcf9d69284589/FLAGbf85fa081 [2019-11-25 08:53:25,940 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_1577eaba-c8df-49de-920b-6f96275043ad/bin/uautomizer/data/2cd5b6ed4/ded19e2974eb487d9f7bcf9d69284589 [2019-11-25 08:53:25,945 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-25 08:53:25,947 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-11-25 08:53:25,949 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-25 08:53:25,949 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-25 08:53:25,953 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-25 08:53:25,954 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.11 08:53:25" (1/1) ... [2019-11-25 08:53:25,957 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@268d1770 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 08:53:25, skipping insertion in model container [2019-11-25 08:53:25,957 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.11 08:53:25" (1/1) ... [2019-11-25 08:53:25,965 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-11-25 08:53:26,024 INFO L179 MainTranslator]: Built tables and reachable declarations [2019-11-25 08:53:26,478 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-25 08:53:26,491 INFO L201 MainTranslator]: Completed pre-run [2019-11-25 08:53:26,584 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-25 08:53:26,602 INFO L205 MainTranslator]: Completed translation [2019-11-25 08:53:26,603 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 08:53:26 WrapperNode [2019-11-25 08:53:26,603 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-25 08:53:26,604 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-11-25 08:53:26,604 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-11-25 08:53:26,604 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-11-25 08:53:26,611 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 08:53:26" (1/1) ... [2019-11-25 08:53:26,631 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 08:53:26" (1/1) ... [2019-11-25 08:53:26,670 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-11-25 08:53:26,670 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-25 08:53:26,670 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-25 08:53:26,671 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-25 08:53:26,679 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 08:53:26" (1/1) ... [2019-11-25 08:53:26,679 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 08:53:26" (1/1) ... [2019-11-25 08:53:26,687 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 08:53:26" (1/1) ... [2019-11-25 08:53:26,687 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 08:53:26" (1/1) ... [2019-11-25 08:53:26,722 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 08:53:26" (1/1) ... [2019-11-25 08:53:26,729 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 08:53:26" (1/1) ... [2019-11-25 08:53:26,742 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 08:53:26" (1/1) ... [2019-11-25 08:53:26,747 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-25 08:53:26,747 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-25 08:53:26,747 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-25 08:53:26,747 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-25 08:53:26,748 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 08:53:26" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_1577eaba-c8df-49de-920b-6f96275043ad/bin/uautomizer/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-25 08:53:26,832 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2019-11-25 08:53:26,832 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-11-25 08:53:26,832 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-11-25 08:53:26,833 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-11-25 08:53:26,833 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2019-11-25 08:53:26,834 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2019-11-25 08:53:26,834 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-25 08:53:26,834 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-25 08:53:27,142 WARN L735 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-11-25 08:53:28,158 INFO L688 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##85: assume !false; [2019-11-25 08:53:28,159 INFO L688 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##84: assume false; [2019-11-25 08:53:28,159 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-25 08:53:28,160 INFO L284 CfgBuilder]: Removed 7 assume(true) statements. [2019-11-25 08:53:28,165 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.11 08:53:28 BoogieIcfgContainer [2019-11-25 08:53:28,165 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-25 08:53:28,166 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-25 08:53:28,166 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-25 08:53:28,173 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-25 08:53:28,173 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 25.11 08:53:25" (1/3) ... [2019-11-25 08:53:28,174 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@708f966e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.11 08:53:28, skipping insertion in model container [2019-11-25 08:53:28,174 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 08:53:26" (2/3) ... [2019-11-25 08:53:28,175 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@708f966e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.11 08:53:28, skipping insertion in model container [2019-11-25 08:53:28,178 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.11 08:53:28" (3/3) ... [2019-11-25 08:53:28,179 INFO L109 eAbstractionObserver]: Analyzing ICFG s3_clnt.blast.03.i.cil-1.c [2019-11-25 08:53:28,186 INFO L153 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-25 08:53:28,191 INFO L165 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-11-25 08:53:28,199 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-11-25 08:53:28,226 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-25 08:53:28,227 INFO L374 AbstractCegarLoop]: Hoare is true [2019-11-25 08:53:28,227 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-25 08:53:28,227 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-25 08:53:28,227 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-25 08:53:28,229 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-25 08:53:28,229 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-25 08:53:28,229 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-25 08:53:28,244 INFO L276 IsEmpty]: Start isEmpty. Operand 129 states. [2019-11-25 08:53:28,250 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2019-11-25 08:53:28,251 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 08:53:28,251 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-25 08:53:28,252 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-25 08:53:28,256 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:53:28,257 INFO L82 PathProgramCache]: Analyzing trace with hash -1457695037, now seen corresponding path program 1 times [2019-11-25 08:53:28,263 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 08:53:28,263 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [235484073] [2019-11-25 08:53:28,264 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 08:53:28,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:53:28,493 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-25 08:53:28,494 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [235484073] [2019-11-25 08:53:28,495 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-25 08:53:28,495 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-25 08:53:28,496 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [550488617] [2019-11-25 08:53:28,499 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-25 08:53:28,500 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-25 08:53:28,511 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-25 08:53:28,512 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-25 08:53:28,514 INFO L87 Difference]: Start difference. First operand 129 states. Second operand 4 states. [2019-11-25 08:53:28,923 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 08:53:28,923 INFO L93 Difference]: Finished difference Result 255 states and 430 transitions. [2019-11-25 08:53:28,924 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-25 08:53:28,925 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 24 [2019-11-25 08:53:28,925 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-25 08:53:28,941 INFO L225 Difference]: With dead ends: 255 [2019-11-25 08:53:28,941 INFO L226 Difference]: Without dead ends: 116 [2019-11-25 08:53:28,945 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-25 08:53:28,961 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 116 states. [2019-11-25 08:53:28,994 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 116 to 115. [2019-11-25 08:53:28,996 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 115 states. [2019-11-25 08:53:29,006 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 115 states to 115 states and 172 transitions. [2019-11-25 08:53:29,007 INFO L78 Accepts]: Start accepts. Automaton has 115 states and 172 transitions. Word has length 24 [2019-11-25 08:53:29,008 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-25 08:53:29,008 INFO L462 AbstractCegarLoop]: Abstraction has 115 states and 172 transitions. [2019-11-25 08:53:29,008 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-25 08:53:29,008 INFO L276 IsEmpty]: Start isEmpty. Operand 115 states and 172 transitions. [2019-11-25 08:53:29,012 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2019-11-25 08:53:29,013 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 08:53:29,013 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-25 08:53:29,014 INFO L410 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-25 08:53:29,014 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:53:29,015 INFO L82 PathProgramCache]: Analyzing trace with hash 1001988123, now seen corresponding path program 1 times [2019-11-25 08:53:29,015 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 08:53:29,015 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1054254866] [2019-11-25 08:53:29,016 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 08:53:29,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:53:29,242 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-11-25 08:53:29,242 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1054254866] [2019-11-25 08:53:29,242 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-25 08:53:29,242 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-25 08:53:29,243 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [753877252] [2019-11-25 08:53:29,244 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-25 08:53:29,244 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-25 08:53:29,244 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-25 08:53:29,245 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-25 08:53:29,245 INFO L87 Difference]: Start difference. First operand 115 states and 172 transitions. Second operand 3 states. [2019-11-25 08:53:29,295 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 08:53:29,295 INFO L93 Difference]: Finished difference Result 321 states and 484 transitions. [2019-11-25 08:53:29,298 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-25 08:53:29,298 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 38 [2019-11-25 08:53:29,298 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-25 08:53:29,300 INFO L225 Difference]: With dead ends: 321 [2019-11-25 08:53:29,300 INFO L226 Difference]: Without dead ends: 216 [2019-11-25 08:53:29,301 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-25 08:53:29,302 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 216 states. [2019-11-25 08:53:29,317 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 216 to 216. [2019-11-25 08:53:29,317 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 216 states. [2019-11-25 08:53:29,319 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 216 states to 216 states and 320 transitions. [2019-11-25 08:53:29,319 INFO L78 Accepts]: Start accepts. Automaton has 216 states and 320 transitions. Word has length 38 [2019-11-25 08:53:29,319 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-25 08:53:29,320 INFO L462 AbstractCegarLoop]: Abstraction has 216 states and 320 transitions. [2019-11-25 08:53:29,320 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-25 08:53:29,320 INFO L276 IsEmpty]: Start isEmpty. Operand 216 states and 320 transitions. [2019-11-25 08:53:29,322 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2019-11-25 08:53:29,323 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 08:53:29,323 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-25 08:53:29,323 INFO L410 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-25 08:53:29,323 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:53:29,324 INFO L82 PathProgramCache]: Analyzing trace with hash -596933037, now seen corresponding path program 1 times [2019-11-25 08:53:29,324 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 08:53:29,324 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [105268954] [2019-11-25 08:53:29,324 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 08:53:29,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:53:29,418 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-11-25 08:53:29,419 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [105268954] [2019-11-25 08:53:29,419 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-25 08:53:29,419 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-25 08:53:29,420 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [935682694] [2019-11-25 08:53:29,420 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-25 08:53:29,420 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-25 08:53:29,421 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-25 08:53:29,421 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-25 08:53:29,421 INFO L87 Difference]: Start difference. First operand 216 states and 320 transitions. Second operand 3 states. [2019-11-25 08:53:29,503 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 08:53:29,504 INFO L93 Difference]: Finished difference Result 420 states and 629 transitions. [2019-11-25 08:53:29,504 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-25 08:53:29,504 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 53 [2019-11-25 08:53:29,505 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-25 08:53:29,508 INFO L225 Difference]: With dead ends: 420 [2019-11-25 08:53:29,508 INFO L226 Difference]: Without dead ends: 315 [2019-11-25 08:53:29,509 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-25 08:53:29,510 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 315 states. [2019-11-25 08:53:29,528 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 315 to 315. [2019-11-25 08:53:29,528 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 315 states. [2019-11-25 08:53:29,530 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 315 states to 315 states and 466 transitions. [2019-11-25 08:53:29,530 INFO L78 Accepts]: Start accepts. Automaton has 315 states and 466 transitions. Word has length 53 [2019-11-25 08:53:29,530 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-25 08:53:29,531 INFO L462 AbstractCegarLoop]: Abstraction has 315 states and 466 transitions. [2019-11-25 08:53:29,531 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-25 08:53:29,531 INFO L276 IsEmpty]: Start isEmpty. Operand 315 states and 466 transitions. [2019-11-25 08:53:29,535 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2019-11-25 08:53:29,535 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 08:53:29,535 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-25 08:53:29,535 INFO L410 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-25 08:53:29,536 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:53:29,536 INFO L82 PathProgramCache]: Analyzing trace with hash -1173568974, now seen corresponding path program 1 times [2019-11-25 08:53:29,536 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 08:53:29,541 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2090665356] [2019-11-25 08:53:29,541 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 08:53:29,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:53:29,699 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 27 proven. 0 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2019-11-25 08:53:29,700 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2090665356] [2019-11-25 08:53:29,700 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-25 08:53:29,700 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-25 08:53:29,701 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1881151824] [2019-11-25 08:53:29,701 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-25 08:53:29,702 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-25 08:53:29,702 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-25 08:53:29,702 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-25 08:53:29,702 INFO L87 Difference]: Start difference. First operand 315 states and 466 transitions. Second operand 4 states. [2019-11-25 08:53:30,377 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 08:53:30,377 INFO L93 Difference]: Finished difference Result 806 states and 1197 transitions. [2019-11-25 08:53:30,379 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-25 08:53:30,379 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 71 [2019-11-25 08:53:30,379 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-25 08:53:30,382 INFO L225 Difference]: With dead ends: 806 [2019-11-25 08:53:30,382 INFO L226 Difference]: Without dead ends: 501 [2019-11-25 08:53:30,389 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-25 08:53:30,390 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 501 states. [2019-11-25 08:53:30,414 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 501 to 365. [2019-11-25 08:53:30,419 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 365 states. [2019-11-25 08:53:30,421 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 365 states to 365 states and 552 transitions. [2019-11-25 08:53:30,421 INFO L78 Accepts]: Start accepts. Automaton has 365 states and 552 transitions. Word has length 71 [2019-11-25 08:53:30,421 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-25 08:53:30,422 INFO L462 AbstractCegarLoop]: Abstraction has 365 states and 552 transitions. [2019-11-25 08:53:30,422 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-25 08:53:30,422 INFO L276 IsEmpty]: Start isEmpty. Operand 365 states and 552 transitions. [2019-11-25 08:53:30,430 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2019-11-25 08:53:30,431 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 08:53:30,431 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-25 08:53:30,432 INFO L410 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-25 08:53:30,432 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:53:30,432 INFO L82 PathProgramCache]: Analyzing trace with hash -1307582480, now seen corresponding path program 1 times [2019-11-25 08:53:30,432 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 08:53:30,433 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1867292394] [2019-11-25 08:53:30,433 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 08:53:30,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:53:30,569 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 27 proven. 0 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2019-11-25 08:53:30,570 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1867292394] [2019-11-25 08:53:30,571 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-25 08:53:30,571 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-25 08:53:30,572 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [505814264] [2019-11-25 08:53:30,574 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-25 08:53:30,574 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-25 08:53:30,575 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-25 08:53:30,576 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-25 08:53:30,576 INFO L87 Difference]: Start difference. First operand 365 states and 552 transitions. Second operand 4 states. [2019-11-25 08:53:31,051 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 08:53:31,052 INFO L93 Difference]: Finished difference Result 806 states and 1218 transitions. [2019-11-25 08:53:31,053 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-25 08:53:31,053 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 71 [2019-11-25 08:53:31,054 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-25 08:53:31,056 INFO L225 Difference]: With dead ends: 806 [2019-11-25 08:53:31,056 INFO L226 Difference]: Without dead ends: 451 [2019-11-25 08:53:31,057 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-25 08:53:31,058 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 451 states. [2019-11-25 08:53:31,067 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 451 to 405. [2019-11-25 08:53:31,067 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 405 states. [2019-11-25 08:53:31,069 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 405 states to 405 states and 620 transitions. [2019-11-25 08:53:31,070 INFO L78 Accepts]: Start accepts. Automaton has 405 states and 620 transitions. Word has length 71 [2019-11-25 08:53:31,070 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-25 08:53:31,070 INFO L462 AbstractCegarLoop]: Abstraction has 405 states and 620 transitions. [2019-11-25 08:53:31,070 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-25 08:53:31,071 INFO L276 IsEmpty]: Start isEmpty. Operand 405 states and 620 transitions. [2019-11-25 08:53:31,072 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2019-11-25 08:53:31,072 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 08:53:31,072 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-25 08:53:31,072 INFO L410 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-25 08:53:31,073 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:53:31,073 INFO L82 PathProgramCache]: Analyzing trace with hash -2025585655, now seen corresponding path program 1 times [2019-11-25 08:53:31,073 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 08:53:31,073 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1684024082] [2019-11-25 08:53:31,073 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 08:53:31,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:53:31,157 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 27 proven. 0 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2019-11-25 08:53:31,157 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1684024082] [2019-11-25 08:53:31,158 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-25 08:53:31,158 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-25 08:53:31,158 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [871258431] [2019-11-25 08:53:31,159 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-25 08:53:31,159 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-25 08:53:31,159 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-25 08:53:31,159 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-25 08:53:31,159 INFO L87 Difference]: Start difference. First operand 405 states and 620 transitions. Second operand 4 states. [2019-11-25 08:53:31,710 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 08:53:31,711 INFO L93 Difference]: Finished difference Result 928 states and 1409 transitions. [2019-11-25 08:53:31,711 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-25 08:53:31,711 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 72 [2019-11-25 08:53:31,712 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-25 08:53:31,715 INFO L225 Difference]: With dead ends: 928 [2019-11-25 08:53:31,715 INFO L226 Difference]: Without dead ends: 533 [2019-11-25 08:53:31,716 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-25 08:53:31,717 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 533 states. [2019-11-25 08:53:31,726 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 533 to 407. [2019-11-25 08:53:31,726 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 407 states. [2019-11-25 08:53:31,728 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 407 states to 407 states and 622 transitions. [2019-11-25 08:53:31,728 INFO L78 Accepts]: Start accepts. Automaton has 407 states and 622 transitions. Word has length 72 [2019-11-25 08:53:31,729 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-25 08:53:31,729 INFO L462 AbstractCegarLoop]: Abstraction has 407 states and 622 transitions. [2019-11-25 08:53:31,729 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-25 08:53:31,729 INFO L276 IsEmpty]: Start isEmpty. Operand 407 states and 622 transitions. [2019-11-25 08:53:31,730 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2019-11-25 08:53:31,730 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 08:53:31,731 INFO L410 BasicCegarLoop]: trace histogram [5, 5, 4, 4, 4, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-25 08:53:31,731 INFO L410 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-25 08:53:31,731 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:53:31,731 INFO L82 PathProgramCache]: Analyzing trace with hash 703880522, now seen corresponding path program 2 times [2019-11-25 08:53:31,731 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 08:53:31,732 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [237514233] [2019-11-25 08:53:31,732 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 08:53:31,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:53:31,809 INFO L134 CoverageAnalysis]: Checked inductivity of 73 backedges. 56 proven. 0 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2019-11-25 08:53:31,809 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [237514233] [2019-11-25 08:53:31,810 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-25 08:53:31,810 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-25 08:53:31,810 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [286875170] [2019-11-25 08:53:31,811 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-25 08:53:31,811 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-25 08:53:31,811 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-25 08:53:31,811 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-25 08:53:31,811 INFO L87 Difference]: Start difference. First operand 407 states and 622 transitions. Second operand 4 states. [2019-11-25 08:53:32,316 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 08:53:32,317 INFO L93 Difference]: Finished difference Result 928 states and 1407 transitions. [2019-11-25 08:53:32,317 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-25 08:53:32,317 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 85 [2019-11-25 08:53:32,317 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-25 08:53:32,320 INFO L225 Difference]: With dead ends: 928 [2019-11-25 08:53:32,320 INFO L226 Difference]: Without dead ends: 531 [2019-11-25 08:53:32,321 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-25 08:53:32,322 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 531 states. [2019-11-25 08:53:32,330 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 531 to 407. [2019-11-25 08:53:32,330 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 407 states. [2019-11-25 08:53:32,333 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 407 states to 407 states and 620 transitions. [2019-11-25 08:53:32,333 INFO L78 Accepts]: Start accepts. Automaton has 407 states and 620 transitions. Word has length 85 [2019-11-25 08:53:32,333 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-25 08:53:32,333 INFO L462 AbstractCegarLoop]: Abstraction has 407 states and 620 transitions. [2019-11-25 08:53:32,333 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-25 08:53:32,334 INFO L276 IsEmpty]: Start isEmpty. Operand 407 states and 620 transitions. [2019-11-25 08:53:32,335 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2019-11-25 08:53:32,335 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 08:53:32,335 INFO L410 BasicCegarLoop]: trace histogram [5, 5, 4, 4, 4, 4, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-25 08:53:32,335 INFO L410 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-25 08:53:32,335 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:53:32,336 INFO L82 PathProgramCache]: Analyzing trace with hash -405099924, now seen corresponding path program 1 times [2019-11-25 08:53:32,336 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 08:53:32,336 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1749932697] [2019-11-25 08:53:32,336 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 08:53:32,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:53:32,454 INFO L134 CoverageAnalysis]: Checked inductivity of 75 backedges. 58 proven. 0 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2019-11-25 08:53:32,455 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1749932697] [2019-11-25 08:53:32,455 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-25 08:53:32,455 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-25 08:53:32,455 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1915493460] [2019-11-25 08:53:32,456 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-25 08:53:32,456 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-25 08:53:32,456 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-25 08:53:32,456 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-25 08:53:32,456 INFO L87 Difference]: Start difference. First operand 407 states and 620 transitions. Second operand 4 states. [2019-11-25 08:53:32,970 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 08:53:32,970 INFO L93 Difference]: Finished difference Result 928 states and 1403 transitions. [2019-11-25 08:53:32,970 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-25 08:53:32,971 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 85 [2019-11-25 08:53:32,971 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-25 08:53:32,974 INFO L225 Difference]: With dead ends: 928 [2019-11-25 08:53:32,974 INFO L226 Difference]: Without dead ends: 531 [2019-11-25 08:53:32,974 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-25 08:53:32,975 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 531 states. [2019-11-25 08:53:32,985 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 531 to 407. [2019-11-25 08:53:32,985 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 407 states. [2019-11-25 08:53:32,987 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 407 states to 407 states and 618 transitions. [2019-11-25 08:53:32,987 INFO L78 Accepts]: Start accepts. Automaton has 407 states and 618 transitions. Word has length 85 [2019-11-25 08:53:32,988 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-25 08:53:32,988 INFO L462 AbstractCegarLoop]: Abstraction has 407 states and 618 transitions. [2019-11-25 08:53:32,988 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-25 08:53:32,988 INFO L276 IsEmpty]: Start isEmpty. Operand 407 states and 618 transitions. [2019-11-25 08:53:32,989 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2019-11-25 08:53:32,989 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 08:53:32,990 INFO L410 BasicCegarLoop]: trace histogram [5, 5, 4, 4, 4, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-25 08:53:32,990 INFO L410 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-25 08:53:32,990 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:53:32,990 INFO L82 PathProgramCache]: Analyzing trace with hash -325478776, now seen corresponding path program 2 times [2019-11-25 08:53:32,991 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 08:53:32,991 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [873043371] [2019-11-25 08:53:32,991 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 08:53:33,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:53:33,065 INFO L134 CoverageAnalysis]: Checked inductivity of 73 backedges. 56 proven. 0 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2019-11-25 08:53:33,066 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [873043371] [2019-11-25 08:53:33,066 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-25 08:53:33,066 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-25 08:53:33,066 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1781510506] [2019-11-25 08:53:33,067 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-25 08:53:33,067 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-25 08:53:33,067 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-25 08:53:33,068 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-25 08:53:33,068 INFO L87 Difference]: Start difference. First operand 407 states and 618 transitions. Second operand 4 states. [2019-11-25 08:53:33,484 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 08:53:33,484 INFO L93 Difference]: Finished difference Result 848 states and 1278 transitions. [2019-11-25 08:53:33,485 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-25 08:53:33,485 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 85 [2019-11-25 08:53:33,485 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-25 08:53:33,488 INFO L225 Difference]: With dead ends: 848 [2019-11-25 08:53:33,488 INFO L226 Difference]: Without dead ends: 451 [2019-11-25 08:53:33,489 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-25 08:53:33,490 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 451 states. [2019-11-25 08:53:33,501 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 451 to 407. [2019-11-25 08:53:33,501 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 407 states. [2019-11-25 08:53:33,503 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 407 states to 407 states and 616 transitions. [2019-11-25 08:53:33,503 INFO L78 Accepts]: Start accepts. Automaton has 407 states and 616 transitions. Word has length 85 [2019-11-25 08:53:33,504 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-25 08:53:33,504 INFO L462 AbstractCegarLoop]: Abstraction has 407 states and 616 transitions. [2019-11-25 08:53:33,504 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-25 08:53:33,504 INFO L276 IsEmpty]: Start isEmpty. Operand 407 states and 616 transitions. [2019-11-25 08:53:33,506 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2019-11-25 08:53:33,507 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 08:53:33,507 INFO L410 BasicCegarLoop]: trace histogram [5, 5, 4, 4, 4, 4, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-25 08:53:33,507 INFO L410 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-25 08:53:33,507 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:53:33,508 INFO L82 PathProgramCache]: Analyzing trace with hash -1434459222, now seen corresponding path program 1 times [2019-11-25 08:53:33,508 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 08:53:33,508 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [588251713] [2019-11-25 08:53:33,508 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 08:53:33,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:53:33,581 INFO L134 CoverageAnalysis]: Checked inductivity of 75 backedges. 58 proven. 0 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2019-11-25 08:53:33,582 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [588251713] [2019-11-25 08:53:33,582 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-25 08:53:33,584 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-25 08:53:33,584 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1509930743] [2019-11-25 08:53:33,585 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-25 08:53:33,585 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-25 08:53:33,585 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-25 08:53:33,586 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-25 08:53:33,586 INFO L87 Difference]: Start difference. First operand 407 states and 616 transitions. Second operand 4 states. [2019-11-25 08:53:33,935 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 08:53:33,935 INFO L93 Difference]: Finished difference Result 848 states and 1274 transitions. [2019-11-25 08:53:33,936 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-25 08:53:33,936 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 85 [2019-11-25 08:53:33,936 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-25 08:53:33,941 INFO L225 Difference]: With dead ends: 848 [2019-11-25 08:53:33,942 INFO L226 Difference]: Without dead ends: 451 [2019-11-25 08:53:33,943 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-25 08:53:33,943 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 451 states. [2019-11-25 08:53:33,952 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 451 to 407. [2019-11-25 08:53:33,952 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 407 states. [2019-11-25 08:53:33,954 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 407 states to 407 states and 614 transitions. [2019-11-25 08:53:33,954 INFO L78 Accepts]: Start accepts. Automaton has 407 states and 614 transitions. Word has length 85 [2019-11-25 08:53:33,954 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-25 08:53:33,954 INFO L462 AbstractCegarLoop]: Abstraction has 407 states and 614 transitions. [2019-11-25 08:53:33,954 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-25 08:53:33,955 INFO L276 IsEmpty]: Start isEmpty. Operand 407 states and 614 transitions. [2019-11-25 08:53:33,956 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2019-11-25 08:53:33,956 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 08:53:33,956 INFO L410 BasicCegarLoop]: trace histogram [5, 5, 4, 4, 4, 4, 4, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-25 08:53:33,956 INFO L410 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-25 08:53:33,956 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:53:33,957 INFO L82 PathProgramCache]: Analyzing trace with hash 381197251, now seen corresponding path program 1 times [2019-11-25 08:53:33,957 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 08:53:33,957 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [328157213] [2019-11-25 08:53:33,957 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 08:53:33,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:53:34,029 INFO L134 CoverageAnalysis]: Checked inductivity of 78 backedges. 61 proven. 0 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2019-11-25 08:53:34,030 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [328157213] [2019-11-25 08:53:34,030 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-25 08:53:34,030 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-25 08:53:34,030 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [115842811] [2019-11-25 08:53:34,031 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-25 08:53:34,031 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-25 08:53:34,031 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-25 08:53:34,031 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-25 08:53:34,032 INFO L87 Difference]: Start difference. First operand 407 states and 614 transitions. Second operand 4 states. [2019-11-25 08:53:34,507 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 08:53:34,507 INFO L93 Difference]: Finished difference Result 928 states and 1391 transitions. [2019-11-25 08:53:34,508 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-25 08:53:34,508 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 86 [2019-11-25 08:53:34,508 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-25 08:53:34,511 INFO L225 Difference]: With dead ends: 928 [2019-11-25 08:53:34,511 INFO L226 Difference]: Without dead ends: 531 [2019-11-25 08:53:34,512 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-25 08:53:34,513 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 531 states. [2019-11-25 08:53:34,521 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 531 to 407. [2019-11-25 08:53:34,521 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 407 states. [2019-11-25 08:53:34,523 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 407 states to 407 states and 612 transitions. [2019-11-25 08:53:34,523 INFO L78 Accepts]: Start accepts. Automaton has 407 states and 612 transitions. Word has length 86 [2019-11-25 08:53:34,523 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-25 08:53:34,523 INFO L462 AbstractCegarLoop]: Abstraction has 407 states and 612 transitions. [2019-11-25 08:53:34,524 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-25 08:53:34,524 INFO L276 IsEmpty]: Start isEmpty. Operand 407 states and 612 transitions. [2019-11-25 08:53:34,525 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2019-11-25 08:53:34,525 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 08:53:34,525 INFO L410 BasicCegarLoop]: trace histogram [5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-25 08:53:34,525 INFO L410 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-25 08:53:34,526 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:53:34,526 INFO L82 PathProgramCache]: Analyzing trace with hash 681258334, now seen corresponding path program 1 times [2019-11-25 08:53:34,526 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 08:53:34,526 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1516506611] [2019-11-25 08:53:34,526 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 08:53:34,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:53:34,594 INFO L134 CoverageAnalysis]: Checked inductivity of 84 backedges. 67 proven. 0 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2019-11-25 08:53:34,595 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1516506611] [2019-11-25 08:53:34,595 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-25 08:53:34,595 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-25 08:53:34,595 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1367655168] [2019-11-25 08:53:34,596 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-25 08:53:34,596 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-25 08:53:34,596 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-25 08:53:34,596 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-25 08:53:34,596 INFO L87 Difference]: Start difference. First operand 407 states and 612 transitions. Second operand 4 states. [2019-11-25 08:53:35,094 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 08:53:35,094 INFO L93 Difference]: Finished difference Result 783 states and 1168 transitions. [2019-11-25 08:53:35,094 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-25 08:53:35,094 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 86 [2019-11-25 08:53:35,095 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-25 08:53:35,097 INFO L225 Difference]: With dead ends: 783 [2019-11-25 08:53:35,097 INFO L226 Difference]: Without dead ends: 531 [2019-11-25 08:53:35,098 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-25 08:53:35,099 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 531 states. [2019-11-25 08:53:35,107 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 531 to 407. [2019-11-25 08:53:35,107 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 407 states. [2019-11-25 08:53:35,109 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 407 states to 407 states and 610 transitions. [2019-11-25 08:53:35,109 INFO L78 Accepts]: Start accepts. Automaton has 407 states and 610 transitions. Word has length 86 [2019-11-25 08:53:35,109 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-25 08:53:35,109 INFO L462 AbstractCegarLoop]: Abstraction has 407 states and 610 transitions. [2019-11-25 08:53:35,110 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-25 08:53:35,110 INFO L276 IsEmpty]: Start isEmpty. Operand 407 states and 610 transitions. [2019-11-25 08:53:35,111 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2019-11-25 08:53:35,111 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 08:53:35,111 INFO L410 BasicCegarLoop]: trace histogram [5, 5, 4, 4, 4, 4, 4, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-25 08:53:35,111 INFO L410 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-25 08:53:35,112 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:53:35,112 INFO L82 PathProgramCache]: Analyzing trace with hash -1464169915, now seen corresponding path program 1 times [2019-11-25 08:53:35,112 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 08:53:35,112 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [968021567] [2019-11-25 08:53:35,112 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 08:53:35,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:53:35,175 INFO L134 CoverageAnalysis]: Checked inductivity of 78 backedges. 61 proven. 0 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2019-11-25 08:53:35,175 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [968021567] [2019-11-25 08:53:35,175 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-25 08:53:35,176 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-25 08:53:35,176 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1946828353] [2019-11-25 08:53:35,176 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-25 08:53:35,176 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-25 08:53:35,177 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-25 08:53:35,177 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-25 08:53:35,177 INFO L87 Difference]: Start difference. First operand 407 states and 610 transitions. Second operand 4 states. [2019-11-25 08:53:35,523 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 08:53:35,523 INFO L93 Difference]: Finished difference Result 848 states and 1262 transitions. [2019-11-25 08:53:35,524 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-25 08:53:35,524 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 86 [2019-11-25 08:53:35,524 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-25 08:53:35,527 INFO L225 Difference]: With dead ends: 848 [2019-11-25 08:53:35,527 INFO L226 Difference]: Without dead ends: 451 [2019-11-25 08:53:35,528 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-25 08:53:35,529 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 451 states. [2019-11-25 08:53:35,538 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 451 to 407. [2019-11-25 08:53:35,538 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 407 states. [2019-11-25 08:53:35,540 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 407 states to 407 states and 608 transitions. [2019-11-25 08:53:35,540 INFO L78 Accepts]: Start accepts. Automaton has 407 states and 608 transitions. Word has length 86 [2019-11-25 08:53:35,540 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-25 08:53:35,540 INFO L462 AbstractCegarLoop]: Abstraction has 407 states and 608 transitions. [2019-11-25 08:53:35,540 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-25 08:53:35,540 INFO L276 IsEmpty]: Start isEmpty. Operand 407 states and 608 transitions. [2019-11-25 08:53:35,542 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2019-11-25 08:53:35,542 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 08:53:35,542 INFO L410 BasicCegarLoop]: trace histogram [5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-25 08:53:35,542 INFO L410 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-25 08:53:35,542 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:53:35,543 INFO L82 PathProgramCache]: Analyzing trace with hash -1164108832, now seen corresponding path program 1 times [2019-11-25 08:53:35,543 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 08:53:35,544 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1227761674] [2019-11-25 08:53:35,544 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 08:53:35,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:53:35,606 INFO L134 CoverageAnalysis]: Checked inductivity of 84 backedges. 67 proven. 0 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2019-11-25 08:53:35,606 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1227761674] [2019-11-25 08:53:35,606 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-25 08:53:35,606 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-25 08:53:35,607 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1447023764] [2019-11-25 08:53:35,607 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-25 08:53:35,607 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-25 08:53:35,607 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-25 08:53:35,608 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-25 08:53:35,608 INFO L87 Difference]: Start difference. First operand 407 states and 608 transitions. Second operand 4 states. [2019-11-25 08:53:35,918 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 08:53:35,918 INFO L93 Difference]: Finished difference Result 703 states and 1041 transitions. [2019-11-25 08:53:35,922 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-25 08:53:35,922 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 86 [2019-11-25 08:53:35,923 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-25 08:53:35,925 INFO L225 Difference]: With dead ends: 703 [2019-11-25 08:53:35,925 INFO L226 Difference]: Without dead ends: 451 [2019-11-25 08:53:35,926 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-25 08:53:35,926 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 451 states. [2019-11-25 08:53:35,937 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 451 to 407. [2019-11-25 08:53:35,937 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 407 states. [2019-11-25 08:53:35,938 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 407 states to 407 states and 606 transitions. [2019-11-25 08:53:35,938 INFO L78 Accepts]: Start accepts. Automaton has 407 states and 606 transitions. Word has length 86 [2019-11-25 08:53:35,939 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-25 08:53:35,939 INFO L462 AbstractCegarLoop]: Abstraction has 407 states and 606 transitions. [2019-11-25 08:53:35,939 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-25 08:53:35,939 INFO L276 IsEmpty]: Start isEmpty. Operand 407 states and 606 transitions. [2019-11-25 08:53:35,940 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2019-11-25 08:53:35,940 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 08:53:35,941 INFO L410 BasicCegarLoop]: trace histogram [5, 5, 4, 4, 4, 4, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-25 08:53:35,941 INFO L410 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-25 08:53:35,941 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:53:35,941 INFO L82 PathProgramCache]: Analyzing trace with hash -956813465, now seen corresponding path program 1 times [2019-11-25 08:53:35,941 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 08:53:35,942 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [41127255] [2019-11-25 08:53:35,942 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 08:53:35,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:53:36,020 INFO L134 CoverageAnalysis]: Checked inductivity of 81 backedges. 64 proven. 0 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2019-11-25 08:53:36,021 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [41127255] [2019-11-25 08:53:36,021 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-25 08:53:36,021 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-25 08:53:36,021 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1448601114] [2019-11-25 08:53:36,022 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-25 08:53:36,022 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-25 08:53:36,022 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-25 08:53:36,022 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-25 08:53:36,022 INFO L87 Difference]: Start difference. First operand 407 states and 606 transitions. Second operand 4 states. [2019-11-25 08:53:36,455 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 08:53:36,456 INFO L93 Difference]: Finished difference Result 928 states and 1375 transitions. [2019-11-25 08:53:36,456 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-25 08:53:36,456 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 87 [2019-11-25 08:53:36,456 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-25 08:53:36,459 INFO L225 Difference]: With dead ends: 928 [2019-11-25 08:53:36,459 INFO L226 Difference]: Without dead ends: 531 [2019-11-25 08:53:36,460 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-25 08:53:36,461 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 531 states. [2019-11-25 08:53:36,470 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 531 to 407. [2019-11-25 08:53:36,470 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 407 states. [2019-11-25 08:53:36,471 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 407 states to 407 states and 604 transitions. [2019-11-25 08:53:36,472 INFO L78 Accepts]: Start accepts. Automaton has 407 states and 604 transitions. Word has length 87 [2019-11-25 08:53:36,472 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-25 08:53:36,472 INFO L462 AbstractCegarLoop]: Abstraction has 407 states and 604 transitions. [2019-11-25 08:53:36,472 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-25 08:53:36,472 INFO L276 IsEmpty]: Start isEmpty. Operand 407 states and 604 transitions. [2019-11-25 08:53:36,473 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2019-11-25 08:53:36,474 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 08:53:36,474 INFO L410 BasicCegarLoop]: trace histogram [5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-25 08:53:36,474 INFO L410 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-25 08:53:36,474 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:53:36,474 INFO L82 PathProgramCache]: Analyzing trace with hash 2048176167, now seen corresponding path program 1 times [2019-11-25 08:53:36,475 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 08:53:36,475 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2129710099] [2019-11-25 08:53:36,475 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 08:53:36,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:53:36,545 INFO L134 CoverageAnalysis]: Checked inductivity of 86 backedges. 69 proven. 0 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2019-11-25 08:53:36,546 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2129710099] [2019-11-25 08:53:36,547 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-25 08:53:36,548 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-25 08:53:36,552 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [970282521] [2019-11-25 08:53:36,552 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-25 08:53:36,552 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-25 08:53:36,553 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-25 08:53:36,553 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-25 08:53:36,553 INFO L87 Difference]: Start difference. First operand 407 states and 604 transitions. Second operand 4 states. [2019-11-25 08:53:37,037 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 08:53:37,037 INFO L93 Difference]: Finished difference Result 777 states and 1149 transitions. [2019-11-25 08:53:37,037 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-25 08:53:37,038 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 87 [2019-11-25 08:53:37,038 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-25 08:53:37,040 INFO L225 Difference]: With dead ends: 777 [2019-11-25 08:53:37,040 INFO L226 Difference]: Without dead ends: 525 [2019-11-25 08:53:37,041 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-25 08:53:37,042 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 525 states. [2019-11-25 08:53:37,053 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 525 to 407. [2019-11-25 08:53:37,053 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 407 states. [2019-11-25 08:53:37,054 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 407 states to 407 states and 602 transitions. [2019-11-25 08:53:37,055 INFO L78 Accepts]: Start accepts. Automaton has 407 states and 602 transitions. Word has length 87 [2019-11-25 08:53:37,055 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-25 08:53:37,055 INFO L462 AbstractCegarLoop]: Abstraction has 407 states and 602 transitions. [2019-11-25 08:53:37,055 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-25 08:53:37,056 INFO L276 IsEmpty]: Start isEmpty. Operand 407 states and 602 transitions. [2019-11-25 08:53:37,057 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2019-11-25 08:53:37,057 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 08:53:37,057 INFO L410 BasicCegarLoop]: trace histogram [5, 5, 4, 4, 4, 4, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-25 08:53:37,057 INFO L410 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-25 08:53:37,057 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:53:37,058 INFO L82 PathProgramCache]: Analyzing trace with hash 1966346533, now seen corresponding path program 1 times [2019-11-25 08:53:37,058 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 08:53:37,058 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1243899191] [2019-11-25 08:53:37,058 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 08:53:37,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:53:37,119 INFO L134 CoverageAnalysis]: Checked inductivity of 81 backedges. 64 proven. 0 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2019-11-25 08:53:37,120 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1243899191] [2019-11-25 08:53:37,120 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-25 08:53:37,120 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-25 08:53:37,120 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1639796952] [2019-11-25 08:53:37,121 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-25 08:53:37,121 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-25 08:53:37,121 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-25 08:53:37,121 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-25 08:53:37,122 INFO L87 Difference]: Start difference. First operand 407 states and 602 transitions. Second operand 4 states. [2019-11-25 08:53:37,492 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 08:53:37,493 INFO L93 Difference]: Finished difference Result 848 states and 1246 transitions. [2019-11-25 08:53:37,493 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-25 08:53:37,493 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 87 [2019-11-25 08:53:37,493 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-25 08:53:37,496 INFO L225 Difference]: With dead ends: 848 [2019-11-25 08:53:37,496 INFO L226 Difference]: Without dead ends: 451 [2019-11-25 08:53:37,497 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-25 08:53:37,498 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 451 states. [2019-11-25 08:53:37,507 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 451 to 407. [2019-11-25 08:53:37,508 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 407 states. [2019-11-25 08:53:37,509 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 407 states to 407 states and 600 transitions. [2019-11-25 08:53:37,509 INFO L78 Accepts]: Start accepts. Automaton has 407 states and 600 transitions. Word has length 87 [2019-11-25 08:53:37,509 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-25 08:53:37,509 INFO L462 AbstractCegarLoop]: Abstraction has 407 states and 600 transitions. [2019-11-25 08:53:37,509 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-25 08:53:37,510 INFO L276 IsEmpty]: Start isEmpty. Operand 407 states and 600 transitions. [2019-11-25 08:53:37,511 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2019-11-25 08:53:37,511 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 08:53:37,511 INFO L410 BasicCegarLoop]: trace histogram [5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-25 08:53:37,511 INFO L410 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-25 08:53:37,511 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:53:37,511 INFO L82 PathProgramCache]: Analyzing trace with hash 676368869, now seen corresponding path program 1 times [2019-11-25 08:53:37,512 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 08:53:37,512 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [826216574] [2019-11-25 08:53:37,512 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 08:53:37,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:53:37,571 INFO L134 CoverageAnalysis]: Checked inductivity of 86 backedges. 69 proven. 0 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2019-11-25 08:53:37,571 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [826216574] [2019-11-25 08:53:37,571 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-25 08:53:37,571 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-25 08:53:37,572 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1357125259] [2019-11-25 08:53:37,572 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-25 08:53:37,572 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-25 08:53:37,572 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-25 08:53:37,572 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-25 08:53:37,573 INFO L87 Difference]: Start difference. First operand 407 states and 600 transitions. Second operand 4 states. [2019-11-25 08:53:37,899 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 08:53:37,899 INFO L93 Difference]: Finished difference Result 697 states and 1022 transitions. [2019-11-25 08:53:37,899 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-25 08:53:37,900 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 87 [2019-11-25 08:53:37,900 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-25 08:53:37,902 INFO L225 Difference]: With dead ends: 697 [2019-11-25 08:53:37,902 INFO L226 Difference]: Without dead ends: 445 [2019-11-25 08:53:37,903 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-25 08:53:37,903 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 445 states. [2019-11-25 08:53:37,911 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 445 to 407. [2019-11-25 08:53:37,912 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 407 states. [2019-11-25 08:53:37,913 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 407 states to 407 states and 598 transitions. [2019-11-25 08:53:37,913 INFO L78 Accepts]: Start accepts. Automaton has 407 states and 598 transitions. Word has length 87 [2019-11-25 08:53:37,913 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-25 08:53:37,913 INFO L462 AbstractCegarLoop]: Abstraction has 407 states and 598 transitions. [2019-11-25 08:53:37,913 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-25 08:53:37,913 INFO L276 IsEmpty]: Start isEmpty. Operand 407 states and 598 transitions. [2019-11-25 08:53:37,915 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2019-11-25 08:53:37,915 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 08:53:37,915 INFO L410 BasicCegarLoop]: trace histogram [5, 5, 4, 4, 4, 4, 4, 4, 4, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-25 08:53:37,915 INFO L410 AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-25 08:53:37,915 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:53:37,915 INFO L82 PathProgramCache]: Analyzing trace with hash 571107934, now seen corresponding path program 1 times [2019-11-25 08:53:37,916 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 08:53:37,916 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [734242599] [2019-11-25 08:53:37,916 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 08:53:37,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:53:37,984 INFO L134 CoverageAnalysis]: Checked inductivity of 84 backedges. 67 proven. 0 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2019-11-25 08:53:37,985 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [734242599] [2019-11-25 08:53:37,985 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-25 08:53:37,985 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-25 08:53:37,985 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1043862068] [2019-11-25 08:53:37,986 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-25 08:53:37,987 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-25 08:53:37,987 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-25 08:53:37,987 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-25 08:53:37,987 INFO L87 Difference]: Start difference. First operand 407 states and 598 transitions. Second operand 4 states. [2019-11-25 08:53:38,401 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 08:53:38,401 INFO L93 Difference]: Finished difference Result 904 states and 1330 transitions. [2019-11-25 08:53:38,401 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-25 08:53:38,401 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 88 [2019-11-25 08:53:38,401 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-25 08:53:38,404 INFO L225 Difference]: With dead ends: 904 [2019-11-25 08:53:38,404 INFO L226 Difference]: Without dead ends: 507 [2019-11-25 08:53:38,405 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-25 08:53:38,405 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 507 states. [2019-11-25 08:53:38,416 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 507 to 407. [2019-11-25 08:53:38,416 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 407 states. [2019-11-25 08:53:38,417 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 407 states to 407 states and 596 transitions. [2019-11-25 08:53:38,417 INFO L78 Accepts]: Start accepts. Automaton has 407 states and 596 transitions. Word has length 88 [2019-11-25 08:53:38,417 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-25 08:53:38,417 INFO L462 AbstractCegarLoop]: Abstraction has 407 states and 596 transitions. [2019-11-25 08:53:38,417 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-25 08:53:38,417 INFO L276 IsEmpty]: Start isEmpty. Operand 407 states and 596 transitions. [2019-11-25 08:53:38,420 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2019-11-25 08:53:38,420 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 08:53:38,421 INFO L410 BasicCegarLoop]: trace histogram [5, 5, 4, 4, 4, 4, 4, 4, 4, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-25 08:53:38,421 INFO L410 AbstractCegarLoop]: === Iteration 20 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-25 08:53:38,421 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:53:38,421 INFO L82 PathProgramCache]: Analyzing trace with hash 994754656, now seen corresponding path program 1 times [2019-11-25 08:53:38,421 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 08:53:38,422 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1043739842] [2019-11-25 08:53:38,422 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 08:53:38,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:53:38,490 INFO L134 CoverageAnalysis]: Checked inductivity of 84 backedges. 67 proven. 0 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2019-11-25 08:53:38,490 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1043739842] [2019-11-25 08:53:38,491 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-25 08:53:38,491 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-25 08:53:38,491 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2108481961] [2019-11-25 08:53:38,491 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-25 08:53:38,492 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-25 08:53:38,492 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-25 08:53:38,492 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-25 08:53:38,492 INFO L87 Difference]: Start difference. First operand 407 states and 596 transitions. Second operand 4 states. [2019-11-25 08:53:38,797 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 08:53:38,797 INFO L93 Difference]: Finished difference Result 824 states and 1205 transitions. [2019-11-25 08:53:38,798 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-25 08:53:38,798 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 88 [2019-11-25 08:53:38,798 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-25 08:53:38,800 INFO L225 Difference]: With dead ends: 824 [2019-11-25 08:53:38,800 INFO L226 Difference]: Without dead ends: 427 [2019-11-25 08:53:38,801 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-25 08:53:38,802 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 427 states. [2019-11-25 08:53:38,811 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 427 to 407. [2019-11-25 08:53:38,811 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 407 states. [2019-11-25 08:53:38,812 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 407 states to 407 states and 594 transitions. [2019-11-25 08:53:38,812 INFO L78 Accepts]: Start accepts. Automaton has 407 states and 594 transitions. Word has length 88 [2019-11-25 08:53:38,812 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-25 08:53:38,812 INFO L462 AbstractCegarLoop]: Abstraction has 407 states and 594 transitions. [2019-11-25 08:53:38,812 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-25 08:53:38,812 INFO L276 IsEmpty]: Start isEmpty. Operand 407 states and 594 transitions. [2019-11-25 08:53:38,813 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2019-11-25 08:53:38,814 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 08:53:38,814 INFO L410 BasicCegarLoop]: trace histogram [5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-25 08:53:38,814 INFO L410 AbstractCegarLoop]: === Iteration 21 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-25 08:53:38,814 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:53:38,814 INFO L82 PathProgramCache]: Analyzing trace with hash -433365501, now seen corresponding path program 1 times [2019-11-25 08:53:38,815 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 08:53:38,816 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [538564374] [2019-11-25 08:53:38,816 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 08:53:38,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:53:38,878 INFO L134 CoverageAnalysis]: Checked inductivity of 86 backedges. 69 proven. 0 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2019-11-25 08:53:38,878 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [538564374] [2019-11-25 08:53:38,878 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-25 08:53:38,879 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-25 08:53:38,879 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1149567735] [2019-11-25 08:53:38,880 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-25 08:53:38,880 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-25 08:53:38,880 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-25 08:53:38,882 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-25 08:53:38,882 INFO L87 Difference]: Start difference. First operand 407 states and 594 transitions. Second operand 4 states. [2019-11-25 08:53:39,305 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 08:53:39,305 INFO L93 Difference]: Finished difference Result 904 states and 1322 transitions. [2019-11-25 08:53:39,305 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-25 08:53:39,305 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 89 [2019-11-25 08:53:39,306 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-25 08:53:39,308 INFO L225 Difference]: With dead ends: 904 [2019-11-25 08:53:39,308 INFO L226 Difference]: Without dead ends: 507 [2019-11-25 08:53:39,309 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-25 08:53:39,310 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 507 states. [2019-11-25 08:53:39,319 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 507 to 407. [2019-11-25 08:53:39,319 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 407 states. [2019-11-25 08:53:39,320 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 407 states to 407 states and 592 transitions. [2019-11-25 08:53:39,320 INFO L78 Accepts]: Start accepts. Automaton has 407 states and 592 transitions. Word has length 89 [2019-11-25 08:53:39,320 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-25 08:53:39,320 INFO L462 AbstractCegarLoop]: Abstraction has 407 states and 592 transitions. [2019-11-25 08:53:39,321 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-25 08:53:39,321 INFO L276 IsEmpty]: Start isEmpty. Operand 407 states and 592 transitions. [2019-11-25 08:53:39,322 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2019-11-25 08:53:39,322 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 08:53:39,322 INFO L410 BasicCegarLoop]: trace histogram [5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-25 08:53:39,322 INFO L410 AbstractCegarLoop]: === Iteration 22 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-25 08:53:39,323 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:53:39,323 INFO L82 PathProgramCache]: Analyzing trace with hash -185219007, now seen corresponding path program 1 times [2019-11-25 08:53:39,323 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 08:53:39,323 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [346683242] [2019-11-25 08:53:39,323 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 08:53:39,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:53:39,385 INFO L134 CoverageAnalysis]: Checked inductivity of 86 backedges. 54 proven. 0 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2019-11-25 08:53:39,386 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [346683242] [2019-11-25 08:53:39,386 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-25 08:53:39,386 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-25 08:53:39,386 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1564060080] [2019-11-25 08:53:39,387 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-25 08:53:39,387 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-25 08:53:39,387 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-25 08:53:39,387 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-25 08:53:39,388 INFO L87 Difference]: Start difference. First operand 407 states and 592 transitions. Second operand 3 states. [2019-11-25 08:53:39,433 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 08:53:39,433 INFO L93 Difference]: Finished difference Result 806 states and 1179 transitions. [2019-11-25 08:53:39,434 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-25 08:53:39,435 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 89 [2019-11-25 08:53:39,435 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-25 08:53:39,438 INFO L225 Difference]: With dead ends: 806 [2019-11-25 08:53:39,438 INFO L226 Difference]: Without dead ends: 556 [2019-11-25 08:53:39,439 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-25 08:53:39,439 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 556 states. [2019-11-25 08:53:39,457 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 556 to 556. [2019-11-25 08:53:39,457 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 556 states. [2019-11-25 08:53:39,459 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 556 states to 556 states and 809 transitions. [2019-11-25 08:53:39,459 INFO L78 Accepts]: Start accepts. Automaton has 556 states and 809 transitions. Word has length 89 [2019-11-25 08:53:39,459 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-25 08:53:39,459 INFO L462 AbstractCegarLoop]: Abstraction has 556 states and 809 transitions. [2019-11-25 08:53:39,459 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-25 08:53:39,460 INFO L276 IsEmpty]: Start isEmpty. Operand 556 states and 809 transitions. [2019-11-25 08:53:39,461 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2019-11-25 08:53:39,461 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 08:53:39,462 INFO L410 BasicCegarLoop]: trace histogram [5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-25 08:53:39,462 INFO L410 AbstractCegarLoop]: === Iteration 23 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-25 08:53:39,462 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:53:39,462 INFO L82 PathProgramCache]: Analyzing trace with hash 1027809079, now seen corresponding path program 1 times [2019-11-25 08:53:39,462 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 08:53:39,463 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [19550465] [2019-11-25 08:53:39,463 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 08:53:39,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:53:39,519 INFO L134 CoverageAnalysis]: Checked inductivity of 86 backedges. 42 proven. 0 refuted. 0 times theorem prover too weak. 44 trivial. 0 not checked. [2019-11-25 08:53:39,520 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [19550465] [2019-11-25 08:53:39,520 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-25 08:53:39,520 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-25 08:53:39,521 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1625897784] [2019-11-25 08:53:39,522 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-25 08:53:39,522 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-25 08:53:39,522 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-25 08:53:39,522 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-25 08:53:39,522 INFO L87 Difference]: Start difference. First operand 556 states and 809 transitions. Second operand 3 states. [2019-11-25 08:53:39,561 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 08:53:39,561 INFO L93 Difference]: Finished difference Result 1104 states and 1613 transitions. [2019-11-25 08:53:39,561 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-25 08:53:39,561 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 91 [2019-11-25 08:53:39,562 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-25 08:53:39,565 INFO L225 Difference]: With dead ends: 1104 [2019-11-25 08:53:39,565 INFO L226 Difference]: Without dead ends: 705 [2019-11-25 08:53:39,566 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-25 08:53:39,567 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 705 states. [2019-11-25 08:53:39,586 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 705 to 705. [2019-11-25 08:53:39,586 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 705 states. [2019-11-25 08:53:39,588 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 705 states to 705 states and 1027 transitions. [2019-11-25 08:53:39,588 INFO L78 Accepts]: Start accepts. Automaton has 705 states and 1027 transitions. Word has length 91 [2019-11-25 08:53:39,589 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-25 08:53:39,589 INFO L462 AbstractCegarLoop]: Abstraction has 705 states and 1027 transitions. [2019-11-25 08:53:39,589 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-25 08:53:39,589 INFO L276 IsEmpty]: Start isEmpty. Operand 705 states and 1027 transitions. [2019-11-25 08:53:39,591 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2019-11-25 08:53:39,591 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 08:53:39,591 INFO L410 BasicCegarLoop]: trace histogram [6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-25 08:53:39,592 INFO L410 AbstractCegarLoop]: === Iteration 24 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-25 08:53:39,592 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:53:39,592 INFO L82 PathProgramCache]: Analyzing trace with hash 1254631592, now seen corresponding path program 1 times [2019-11-25 08:53:39,592 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 08:53:39,593 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [516566107] [2019-11-25 08:53:39,593 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 08:53:39,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-25 08:53:39,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-25 08:53:40,066 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-25 08:53:40,066 INFO L475 BasicCegarLoop]: Counterexample might be feasible [2019-11-25 08:53:40,191 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 25.11 08:53:40 BoogieIcfgContainer [2019-11-25 08:53:40,191 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-11-25 08:53:40,191 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-11-25 08:53:40,191 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-11-25 08:53:40,192 INFO L275 PluginConnector]: Witness Printer initialized [2019-11-25 08:53:40,192 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.11 08:53:28" (3/4) ... [2019-11-25 08:53:40,195 INFO L140 WitnessPrinter]: No result that supports witness generation found [2019-11-25 08:53:40,195 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-11-25 08:53:40,197 INFO L168 Benchmark]: Toolchain (without parser) took 14249.64 ms. Allocated memory was 1.0 GB in the beginning and 1.3 GB in the end (delta: 250.1 MB). Free memory was 944.7 MB in the beginning and 1.1 GB in the end (delta: -204.0 MB). Peak memory consumption was 46.1 MB. Max. memory is 11.5 GB. [2019-11-25 08:53:40,197 INFO L168 Benchmark]: CDTParser took 0.17 ms. Allocated memory is still 1.0 GB. Free memory is still 967.5 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-25 08:53:40,197 INFO L168 Benchmark]: CACSL2BoogieTranslator took 654.59 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 137.4 MB). Free memory was 944.7 MB in the beginning and 1.1 GB in the end (delta: -169.6 MB). Peak memory consumption was 23.9 MB. Max. memory is 11.5 GB. [2019-11-25 08:53:40,198 INFO L168 Benchmark]: Boogie Procedure Inliner took 66.41 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-11-25 08:53:40,198 INFO L168 Benchmark]: Boogie Preprocessor took 76.51 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. [2019-11-25 08:53:40,199 INFO L168 Benchmark]: RCFGBuilder took 1418.35 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 86.8 MB). Peak memory consumption was 86.8 MB. Max. memory is 11.5 GB. [2019-11-25 08:53:40,199 INFO L168 Benchmark]: TraceAbstraction took 12024.76 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 112.7 MB). Free memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: -146.6 MB). There was no memory consumed. Max. memory is 11.5 GB. [2019-11-25 08:53:40,199 INFO L168 Benchmark]: Witness Printer took 3.91 ms. Allocated memory is still 1.3 GB. Free memory was 1.2 GB in the beginning and 1.1 GB in the end (delta: 7.9 MB). Peak memory consumption was 7.9 MB. Max. memory is 11.5 GB. [2019-11-25 08:53:40,201 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.17 ms. Allocated memory is still 1.0 GB. Free memory is still 967.5 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 654.59 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 137.4 MB). Free memory was 944.7 MB in the beginning and 1.1 GB in the end (delta: -169.6 MB). Peak memory consumption was 23.9 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 66.41 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 76.51 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. * RCFGBuilder took 1418.35 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 86.8 MB). Peak memory consumption was 86.8 MB. Max. memory is 11.5 GB. * TraceAbstraction took 12024.76 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 112.7 MB). Free memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: -146.6 MB). There was no memory consumed. Max. memory is 11.5 GB. * Witness Printer took 3.91 ms. Allocated memory is still 1.3 GB. Free memory was 1.2 GB in the beginning and 1.1 GB in the end (delta: 7.9 MB). Peak memory consumption was 7.9 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - UnprovableResult [Line: 1641]: Unable to prove that call of __VERIFIER_error() unreachable Unable to prove that call of __VERIFIER_error() unreachable Reason: overapproximation of bitwiseAnd at line 1336. Possible FailurePath: [L1042] static int init = 1; [L1043] static SSL_METHOD SSLv3_client_data ; VAL [init=1, SSLv3_client_data={9:0}] [L1065] SSL *s = (SSL*)malloc(sizeof(SSL)) ; [L1069] s->s3 = malloc(sizeof(struct ssl3_state_st)) [L1070] s->ctx = malloc(sizeof(SSL_CTX)) [L1071] s->session = malloc(sizeof(SSL_SESSION)) [L1072] s->state = 12292 [L1073] s->version = __VERIFIER_nondet_int() [L1080] BUF_MEM *buf ; [L1081] unsigned long tmp ; [L1082] unsigned long l ; [L1083] long num1 ; [L1084] void (*cb)() ; [L1085] int ret ; [L1086] int new_state ; [L1087] int state ; [L1088] int skip ; [L1089] int tmp___1 = __VERIFIER_nondet_int() ; [L1090] int tmp___2 = __VERIFIER_nondet_int() ; [L1091] int tmp___3 = __VERIFIER_nondet_int() ; [L1092] int tmp___4 = __VERIFIER_nondet_int() ; [L1093] int tmp___5 = __VERIFIER_nondet_int() ; [L1094] int tmp___6 = __VERIFIER_nondet_int() ; [L1095] int tmp___7 = __VERIFIER_nondet_int() ; [L1096] int tmp___8 = __VERIFIER_nondet_int() ; [L1097] long tmp___9 = __VERIFIER_nondet_long() ; [L1098] int blastFlag ; [L1101] blastFlag = 0 [L1102] s->hit=__VERIFIER_nondet_int () [L1103] s->state = 12292 [L1104] tmp = __VERIFIER_nondet_int() [L1105] cb = (void (*)())((void *)0) [L1106] ret = -1 [L1107] skip = 0 [L1108] EXPR s->info_callback VAL [init=1, SSLv3_client_data={9:0}] [L1108] COND TRUE (unsigned long )s->info_callback != (unsigned long )((void *)0) [L1109] EXPR s->info_callback [L1109] cb = s->info_callback [L1117] EXPR s->in_handshake [L1117] s->in_handshake += 1 [L1118] COND FALSE !(tmp___1 & 12288) VAL [init=1, SSLv3_client_data={9:0}] [L1128] COND TRUE 1 VAL [init=1, SSLv3_client_data={9:0}] [L1130] EXPR s->state [L1130] state = s->state [L1131] EXPR s->state VAL [init=1, SSLv3_client_data={9:0}] [L1131] COND TRUE s->state == 12292 [L1234] s->new_session = 1 [L1235] s->state = 4096 [L1236] EXPR s->ctx [L1236] EXPR (s->ctx)->stats.sess_connect_renegotiate [L1236] (s->ctx)->stats.sess_connect_renegotiate += 1 [L1241] s->server = 0 VAL [init=1, SSLv3_client_data={9:0}] [L1242] COND TRUE (unsigned long )cb != (unsigned long )((void *)0) VAL [init=1, SSLv3_client_data={9:0}] [L1247] EXPR s->version VAL [init=1, SSLv3_client_data={9:0}] [L1247] COND FALSE !((s->version & 65280) != 768) [L1253] s->type = 4096 [L1254] EXPR s->init_buf VAL [init=1, SSLv3_client_data={9:0}] [L1254] COND FALSE !((unsigned long )s->init_buf == (unsigned long )((void *)0)) [L1272] COND FALSE !(! tmp___4) VAL [init=1, SSLv3_client_data={9:0}] [L1278] COND FALSE !(! tmp___5) [L1284] s->state = 4368 [L1285] EXPR s->ctx [L1285] EXPR (s->ctx)->stats.sess_connect [L1285] (s->ctx)->stats.sess_connect += 1 [L1286] s->init_num = 0 VAL [init=1, SSLv3_client_data={9:0}] [L1600] EXPR s->s3 [L1600] EXPR (s->s3)->tmp.reuse_message VAL [init=1, SSLv3_client_data={9:0}] [L1600] COND FALSE !(! (s->s3)->tmp.reuse_message) [L1629] skip = 0 VAL [init=1, SSLv3_client_data={9:0}] [L1128] COND TRUE 1 VAL [init=1, SSLv3_client_data={9:0}] [L1130] EXPR s->state [L1130] state = s->state [L1131] EXPR s->state VAL [init=1, SSLv3_client_data={9:0}] [L1131] COND FALSE !(s->state == 12292) [L1134] EXPR s->state VAL [init=1, SSLv3_client_data={9:0}] [L1134] COND FALSE !(s->state == 16384) [L1137] EXPR s->state VAL [init=1, SSLv3_client_data={9:0}] [L1137] COND FALSE !(s->state == 4096) [L1140] EXPR s->state VAL [init=1, SSLv3_client_data={9:0}] [L1140] COND FALSE !(s->state == 20480) [L1143] EXPR s->state VAL [init=1, SSLv3_client_data={9:0}] [L1143] COND FALSE !(s->state == 4099) [L1146] EXPR s->state VAL [init=1, SSLv3_client_data={9:0}] [L1146] COND TRUE s->state == 4368 [L1290] s->shutdown = 0 [L1291] ret = __VERIFIER_nondet_int() [L1292] COND TRUE blastFlag == 0 [L1293] blastFlag = 1 VAL [init=1, SSLv3_client_data={9:0}] [L1297] COND FALSE !(ret <= 0) [L1302] s->state = 4384 [L1303] s->init_num = 0 [L1304] EXPR s->bbio [L1304] EXPR s->wbio VAL [init=1, SSLv3_client_data={9:0}] [L1304] COND TRUE (unsigned long )s->bbio != (unsigned long )s->wbio [L1600] EXPR s->s3 [L1600] EXPR (s->s3)->tmp.reuse_message VAL [init=1, SSLv3_client_data={9:0}] [L1600] COND FALSE !(! (s->s3)->tmp.reuse_message) [L1629] skip = 0 VAL [init=1, SSLv3_client_data={9:0}] [L1128] COND TRUE 1 VAL [init=1, SSLv3_client_data={9:0}] [L1130] EXPR s->state [L1130] state = s->state [L1131] EXPR s->state VAL [init=1, SSLv3_client_data={9:0}] [L1131] COND FALSE !(s->state == 12292) [L1134] EXPR s->state VAL [init=1, SSLv3_client_data={9:0}] [L1134] COND FALSE !(s->state == 16384) [L1137] EXPR s->state VAL [init=1, SSLv3_client_data={9:0}] [L1137] COND FALSE !(s->state == 4096) [L1140] EXPR s->state VAL [init=1, SSLv3_client_data={9:0}] [L1140] COND FALSE !(s->state == 20480) [L1143] EXPR s->state VAL [init=1, SSLv3_client_data={9:0}] [L1143] COND FALSE !(s->state == 4099) [L1146] EXPR s->state VAL [init=1, SSLv3_client_data={9:0}] [L1146] COND FALSE !(s->state == 4368) [L1149] EXPR s->state VAL [init=1, SSLv3_client_data={9:0}] [L1149] COND FALSE !(s->state == 4369) [L1152] EXPR s->state VAL [init=1, SSLv3_client_data={9:0}] [L1152] COND TRUE s->state == 4384 [L1312] ret = __VERIFIER_nondet_int() [L1313] COND TRUE blastFlag == 1 [L1314] blastFlag = 2 VAL [init=1, SSLv3_client_data={9:0}] [L1322] COND FALSE !(ret <= 0) [L1327] s->hit VAL [init=1, SSLv3_client_data={9:0}] [L1327] COND FALSE !(s->hit) [L1330] s->state = 4400 VAL [init=1, SSLv3_client_data={9:0}] [L1332] s->init_num = 0 VAL [init=1, SSLv3_client_data={9:0}] [L1600] EXPR s->s3 [L1600] EXPR (s->s3)->tmp.reuse_message VAL [init=1, SSLv3_client_data={9:0}] [L1600] COND FALSE !(! (s->s3)->tmp.reuse_message) [L1629] skip = 0 VAL [init=1, SSLv3_client_data={9:0}] [L1128] COND TRUE 1 VAL [init=1, SSLv3_client_data={9:0}] [L1130] EXPR s->state [L1130] state = s->state [L1131] EXPR s->state VAL [init=1, SSLv3_client_data={9:0}] [L1131] COND FALSE !(s->state == 12292) [L1134] EXPR s->state VAL [init=1, SSLv3_client_data={9:0}] [L1134] COND FALSE !(s->state == 16384) [L1137] EXPR s->state VAL [init=1, SSLv3_client_data={9:0}] [L1137] COND FALSE !(s->state == 4096) [L1140] EXPR s->state VAL [init=1, SSLv3_client_data={9:0}] [L1140] COND FALSE !(s->state == 20480) [L1143] EXPR s->state VAL [init=1, SSLv3_client_data={9:0}] [L1143] COND FALSE !(s->state == 4099) [L1146] EXPR s->state VAL [init=1, SSLv3_client_data={9:0}] [L1146] COND FALSE !(s->state == 4368) [L1149] EXPR s->state VAL [init=1, SSLv3_client_data={9:0}] [L1149] COND FALSE !(s->state == 4369) [L1152] EXPR s->state VAL [init=1, SSLv3_client_data={9:0}] [L1152] COND FALSE !(s->state == 4384) [L1155] EXPR s->state VAL [init=1, SSLv3_client_data={9:0}] [L1155] COND FALSE !(s->state == 4385) [L1158] EXPR s->state VAL [init=1, SSLv3_client_data={9:0}] [L1158] COND TRUE s->state == 4400 [L1336] EXPR s->s3 [L1336] EXPR (s->s3)->tmp.new_cipher [L1336] EXPR ((s->s3)->tmp.new_cipher)->algorithms VAL [init=1, SSLv3_client_data={9:0}] [L1336] COND FALSE !(((s->s3)->tmp.new_cipher)->algorithms & 256UL) [L1339] ret = __VERIFIER_nondet_int() [L1340] COND TRUE blastFlag == 2 [L1341] blastFlag = 3 VAL [init=1, SSLv3_client_data={9:0}] [L1345] COND FALSE !(ret <= 0) VAL [init=1, SSLv3_client_data={9:0}] [L1351] s->state = 4416 [L1352] s->init_num = 0 VAL [init=1, SSLv3_client_data={9:0}] [L1600] EXPR s->s3 [L1600] EXPR (s->s3)->tmp.reuse_message VAL [init=1, SSLv3_client_data={9:0}] [L1600] COND FALSE !(! (s->s3)->tmp.reuse_message) [L1629] skip = 0 VAL [init=1, SSLv3_client_data={9:0}] [L1128] COND TRUE 1 VAL [init=1, SSLv3_client_data={9:0}] [L1130] EXPR s->state [L1130] state = s->state [L1131] EXPR s->state VAL [init=1, SSLv3_client_data={9:0}] [L1131] COND FALSE !(s->state == 12292) [L1134] EXPR s->state VAL [init=1, SSLv3_client_data={9:0}] [L1134] COND FALSE !(s->state == 16384) [L1137] EXPR s->state VAL [init=1, SSLv3_client_data={9:0}] [L1137] COND FALSE !(s->state == 4096) [L1140] EXPR s->state VAL [init=1, SSLv3_client_data={9:0}] [L1140] COND FALSE !(s->state == 20480) [L1143] EXPR s->state VAL [init=1, SSLv3_client_data={9:0}] [L1143] COND FALSE !(s->state == 4099) [L1146] EXPR s->state VAL [init=1, SSLv3_client_data={9:0}] [L1146] COND FALSE !(s->state == 4368) [L1149] EXPR s->state VAL [init=1, SSLv3_client_data={9:0}] [L1149] COND FALSE !(s->state == 4369) [L1152] EXPR s->state VAL [init=1, SSLv3_client_data={9:0}] [L1152] COND FALSE !(s->state == 4384) [L1155] EXPR s->state VAL [init=1, SSLv3_client_data={9:0}] [L1155] COND FALSE !(s->state == 4385) [L1158] EXPR s->state VAL [init=1, SSLv3_client_data={9:0}] [L1158] COND FALSE !(s->state == 4400) [L1161] EXPR s->state VAL [init=1, SSLv3_client_data={9:0}] [L1161] COND FALSE !(s->state == 4401) [L1164] EXPR s->state VAL [init=1, SSLv3_client_data={9:0}] [L1164] COND TRUE s->state == 4416 [L1356] ret = __VERIFIER_nondet_int() [L1357] COND TRUE blastFlag == 3 [L1358] blastFlag = 4 VAL [init=1, SSLv3_client_data={9:0}] [L1362] COND FALSE !(ret <= 0) [L1367] s->state = 4432 [L1368] s->init_num = 0 VAL [init=1, SSLv3_client_data={9:0}] [L1369] COND FALSE !(! tmp___6) VAL [init=1, SSLv3_client_data={9:0}] [L1600] EXPR s->s3 [L1600] EXPR (s->s3)->tmp.reuse_message VAL [init=1, SSLv3_client_data={9:0}] [L1600] COND FALSE !(! (s->s3)->tmp.reuse_message) [L1629] skip = 0 VAL [init=1, SSLv3_client_data={9:0}] [L1128] COND TRUE 1 VAL [init=1, SSLv3_client_data={9:0}] [L1130] EXPR s->state [L1130] state = s->state [L1131] EXPR s->state VAL [init=1, SSLv3_client_data={9:0}] [L1131] COND FALSE !(s->state == 12292) [L1134] EXPR s->state VAL [init=1, SSLv3_client_data={9:0}] [L1134] COND FALSE !(s->state == 16384) [L1137] EXPR s->state VAL [init=1, SSLv3_client_data={9:0}] [L1137] COND FALSE !(s->state == 4096) [L1140] EXPR s->state VAL [init=1, SSLv3_client_data={9:0}] [L1140] COND FALSE !(s->state == 20480) [L1143] EXPR s->state VAL [init=1, SSLv3_client_data={9:0}] [L1143] COND FALSE !(s->state == 4099) [L1146] EXPR s->state VAL [init=1, SSLv3_client_data={9:0}] [L1146] COND FALSE !(s->state == 4368) [L1149] EXPR s->state VAL [init=1, SSLv3_client_data={9:0}] [L1149] COND FALSE !(s->state == 4369) [L1152] EXPR s->state VAL [init=1, SSLv3_client_data={9:0}] [L1152] COND FALSE !(s->state == 4384) [L1155] EXPR s->state VAL [init=1, SSLv3_client_data={9:0}] [L1155] COND FALSE !(s->state == 4385) [L1158] EXPR s->state VAL [init=1, SSLv3_client_data={9:0}] [L1158] COND FALSE !(s->state == 4400) [L1161] EXPR s->state VAL [init=1, SSLv3_client_data={9:0}] [L1161] COND FALSE !(s->state == 4401) [L1164] EXPR s->state VAL [init=1, SSLv3_client_data={9:0}] [L1164] COND FALSE !(s->state == 4416) [L1167] EXPR s->state VAL [init=1, SSLv3_client_data={9:0}] [L1167] COND FALSE !(s->state == 4417) [L1170] EXPR s->state VAL [init=1, SSLv3_client_data={9:0}] [L1170] COND TRUE s->state == 4432 [L1378] ret = __VERIFIER_nondet_int() [L1379] COND TRUE blastFlag == 4 VAL [init=1, SSLv3_client_data={9:0}] [L1641] __VERIFIER_error() VAL [init=1, SSLv3_client_data={9:0}] - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 129 locations, 1 error locations. Result: UNSAFE, OverallTime: 11.9s, OverallIterations: 24, TraceHistogramMax: 6, AutomataDifference: 8.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 4903 SDtfs, 1790 SDslu, 6305 SDs, 0 SdLazy, 3605 SolverSat, 135 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 7.0s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 126 GetRequests, 46 SyntacticMatches, 19 SemanticMatches, 61 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=705occurred in iteration=23, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.3s AutomataMinimizationTime, 23 MinimizatonAttempts, 1525 StatesRemovedByMinimization, 19 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.7s SatisfiabilityAnalysisTime, 1.1s InterpolantComputationTime, 1918 NumberOfCodeBlocks, 1918 NumberOfCodeBlocksAsserted, 24 NumberOfCheckSat, 1783 ConstructedInterpolants, 0 QuantifiedInterpolants, 373356 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 23 InterpolantComputations, 23 PerfectInterpolantSequences, 1532/1532 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces Received shutdown request... ### Bit-precise run ### This is Ultimate 0.1.24-6b5699a [2019-11-25 08:53:42,010 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-25 08:53:42,011 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-25 08:53:42,022 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-25 08:53:42,022 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-25 08:53:42,023 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-25 08:53:42,024 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-25 08:53:42,027 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-25 08:53:42,029 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-25 08:53:42,029 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-25 08:53:42,030 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-25 08:53:42,032 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-25 08:53:42,032 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-25 08:53:42,033 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-25 08:53:42,034 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-25 08:53:42,035 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-25 08:53:42,036 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-25 08:53:42,037 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-25 08:53:42,039 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-25 08:53:42,041 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-25 08:53:42,043 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-25 08:53:42,044 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-25 08:53:42,045 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-25 08:53:42,046 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-25 08:53:42,048 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-25 08:53:42,049 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-25 08:53:42,049 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-25 08:53:42,050 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-25 08:53:42,050 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-25 08:53:42,051 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-25 08:53:42,051 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-25 08:53:42,052 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-25 08:53:42,053 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-25 08:53:42,053 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-25 08:53:42,054 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-25 08:53:42,055 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-25 08:53:42,055 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-25 08:53:42,055 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-25 08:53:42,056 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-25 08:53:42,056 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-25 08:53:42,057 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-25 08:53:42,058 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_1577eaba-c8df-49de-920b-6f96275043ad/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2019-11-25 08:53:42,071 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-25 08:53:42,072 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-25 08:53:42,073 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-25 08:53:42,073 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-25 08:53:42,073 INFO L138 SettingsManager]: * Use SBE=true [2019-11-25 08:53:42,074 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-25 08:53:42,074 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-25 08:53:42,074 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-25 08:53:42,074 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-25 08:53:42,074 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-11-25 08:53:42,075 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-25 08:53:42,075 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-11-25 08:53:42,075 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2019-11-25 08:53:42,075 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2019-11-25 08:53:42,076 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2019-11-25 08:53:42,076 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-25 08:53:42,076 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-25 08:53:42,076 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-25 08:53:42,077 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-11-25 08:53:42,077 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-25 08:53:42,077 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-25 08:53:42,078 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-25 08:53:42,078 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-25 08:53:42,078 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-25 08:53:42,078 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-25 08:53:42,079 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-25 08:53:42,079 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-11-25 08:53:42,079 INFO L138 SettingsManager]: * Trace refinement strategy=WOLF [2019-11-25 08:53:42,079 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --rewrite-divk --print-success --lang smt [2019-11-25 08:53:42,080 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-11-25 08:53:42,080 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-11-25 08:53:42,080 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_1577eaba-c8df-49de-920b-6f96275043ad/bin/uautomizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(__VERIFIER_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> ed035556db4b60d2bb3e3e70af5f975a04e628c4 [2019-11-25 08:53:42,342 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-25 08:53:42,352 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-25 08:53:42,355 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-25 08:53:42,356 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-25 08:53:42,356 INFO L275 PluginConnector]: CDTParser initialized [2019-11-25 08:53:42,357 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_1577eaba-c8df-49de-920b-6f96275043ad/bin/uautomizer/../../sv-benchmarks/c/ssh/s3_clnt.blast.03.i.cil-1.c [2019-11-25 08:53:42,405 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_1577eaba-c8df-49de-920b-6f96275043ad/bin/uautomizer/data/651adae20/bb64c5bf799b417aa2073122ba4d63c8/FLAGcf4ff4ad5 [2019-11-25 08:53:42,924 INFO L306 CDTParser]: Found 1 translation units. [2019-11-25 08:53:42,924 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_1577eaba-c8df-49de-920b-6f96275043ad/sv-benchmarks/c/ssh/s3_clnt.blast.03.i.cil-1.c [2019-11-25 08:53:42,950 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_1577eaba-c8df-49de-920b-6f96275043ad/bin/uautomizer/data/651adae20/bb64c5bf799b417aa2073122ba4d63c8/FLAGcf4ff4ad5 [2019-11-25 08:53:43,430 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_1577eaba-c8df-49de-920b-6f96275043ad/bin/uautomizer/data/651adae20/bb64c5bf799b417aa2073122ba4d63c8 [2019-11-25 08:53:43,432 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-25 08:53:43,434 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-11-25 08:53:43,435 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-25 08:53:43,435 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-25 08:53:43,438 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-25 08:53:43,439 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.11 08:53:43" (1/1) ... [2019-11-25 08:53:43,441 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7aee4558 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 08:53:43, skipping insertion in model container [2019-11-25 08:53:43,441 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.11 08:53:43" (1/1) ... [2019-11-25 08:53:43,448 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-11-25 08:53:43,508 INFO L179 MainTranslator]: Built tables and reachable declarations [2019-11-25 08:53:43,854 INFO L965 CHandler]: Found a cast between two array/pointer types where the value type is smaller than the cast-to type, and where that value type is smaller than our current memory model resolution [2019-11-25 08:53:43,855 INFO L968 CHandler]: at location: C: (SSL_METHOD *)((void *)0) [1038] [2019-11-25 08:53:43,856 INFO L969 CHandler]: current memory model: HoenickeLindenmann_4ByteResolution [2019-11-25 08:53:43,876 INFO L965 CHandler]: Found a cast between two array/pointer types where the value type is smaller than the cast-to type, and where that value type is smaller than our current memory model resolution [2019-11-25 08:53:43,876 INFO L968 CHandler]: at location: C: (SSL*)malloc(sizeof(SSL)) [1065] [2019-11-25 08:53:43,877 INFO L969 CHandler]: current memory model: HoenickeLindenmann_4ByteResolution [2019-11-25 08:53:43,890 FATAL L? ?]: The Plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator has thrown an exception: java.lang.UnsupportedOperationException: Unsupported type(() : VOID) at de.uni_freiburg.informatik.ultimate.cdt.translation.implementation.base.chandler.TypeSizeAndOffsetComputer.computeSize(TypeSizeAndOffsetComputer.java:205) at de.uni_freiburg.informatik.ultimate.cdt.translation.implementation.base.chandler.TypeSizeAndOffsetComputer.constructBytesizeExpression(TypeSizeAndOffsetComputer.java:121) at de.uni_freiburg.informatik.ultimate.cdt.translation.implementation.base.CHandler.visit(CHandler.java:955) at de.uni_freiburg.informatik.ultimate.cdt.translation.implementation.base.PRDispatcher.dispatch(PRDispatcher.java:279) at de.uni_freiburg.informatik.ultimate.cdt.translation.implementation.base.CHandler.visit(CHandler.java:700) at de.uni_freiburg.informatik.ultimate.cdt.translation.implementation.base.PRDispatcher.dispatch(PRDispatcher.java:282) at de.uni_freiburg.informatik.ultimate.cdt.translation.implementation.base.CHandler.visit(CHandler.java:1300) at de.uni_freiburg.informatik.ultimate.cdt.translation.implementation.base.PRDispatcher.dispatch(PRDispatcher.java:220) at de.uni_freiburg.informatik.ultimate.cdt.translation.implementation.base.CHandler.visit(CHandler.java:993) at de.uni_freiburg.informatik.ultimate.cdt.translation.implementation.base.PRDispatcher.dispatch(PRDispatcher.java:232) at de.uni_freiburg.informatik.ultimate.cdt.translation.implementation.base.CHandler.visit(CHandler.java:993) at de.uni_freiburg.informatik.ultimate.cdt.translation.implementation.base.PRDispatcher.dispatch(PRDispatcher.java:232) at de.uni_freiburg.informatik.ultimate.cdt.translation.implementation.base.chandler.FunctionHandler.handleFunctionDefinition(FunctionHandler.java:372) at de.uni_freiburg.informatik.ultimate.cdt.translation.implementation.base.CHandler.visit(CHandler.java:1371) at de.uni_freiburg.informatik.ultimate.cdt.translation.implementation.base.PRDispatcher.dispatch(PRDispatcher.java:155) at de.uni_freiburg.informatik.ultimate.cdt.translation.implementation.base.CHandler.processTUchild(CHandler.java:3448) at de.uni_freiburg.informatik.ultimate.cdt.translation.implementation.base.CHandler.visit(CHandler.java:2263) at de.uni_freiburg.informatik.ultimate.cdt.translation.implementation.base.CHandler.visit(CHandler.java:573) at de.uni_freiburg.informatik.ultimate.cdt.translation.implementation.base.PRDispatcher.dispatch(PRDispatcher.java:134) at de.uni_freiburg.informatik.ultimate.cdt.translation.implementation.base.MainTranslator.translate(MainTranslator.java:193) at de.uni_freiburg.informatik.ultimate.cdt.translation.implementation.base.MainTranslator.run(MainTranslator.java:115) at de.uni_freiburg.informatik.ultimate.cdt.translation.implementation.base.MainTranslator.(MainTranslator.java:93) at de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieTranslatorObserver.finish(CACSL2BoogieTranslatorObserver.java:125) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:316) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:55) [2019-11-25 08:53:43,896 INFO L168 Benchmark]: Toolchain (without parser) took 461.02 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 148.9 MB). Free memory was 957.8 MB in the beginning and 1.1 GB in the end (delta: -177.3 MB). Peak memory consumption was 28.3 MB. Max. memory is 11.5 GB. [2019-11-25 08:53:43,896 INFO L168 Benchmark]: CDTParser took 0.22 ms. Allocated memory is still 1.0 GB. Free memory is still 987.3 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-25 08:53:43,897 INFO L168 Benchmark]: CACSL2BoogieTranslator took 458.86 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 148.9 MB). Free memory was 957.8 MB in the beginning and 1.1 GB in the end (delta: -177.3 MB). Peak memory consumption was 28.3 MB. Max. memory is 11.5 GB. [2019-11-25 08:53:43,898 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.22 ms. Allocated memory is still 1.0 GB. Free memory is still 987.3 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 458.86 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 148.9 MB). Free memory was 957.8 MB in the beginning and 1.1 GB in the end (delta: -177.3 MB). Peak memory consumption was 28.3 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - ExceptionOrErrorResult: UnsupportedOperationException: Unsupported type(() : VOID) de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: UnsupportedOperationException: Unsupported type(() : VOID): de.uni_freiburg.informatik.ultimate.cdt.translation.implementation.base.chandler.TypeSizeAndOffsetComputer.computeSize(TypeSizeAndOffsetComputer.java:205) RESULT: Ultimate could not prove your program: Toolchain returned no result. Received shutdown request...