./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/bitvector/s3_clnt_2.BV.c.cil-1a.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version f470102c Calling Ultimate with: /usr/lib/jvm/java-8-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/run_dir_b73ae0b1-f3a2-46c9-8e3b-fe3c43b0904d/bin/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/run_dir_b73ae0b1-f3a2-46c9-8e3b-fe3c43b0904d/bin/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_b73ae0b1-f3a2-46c9-8e3b-fe3c43b0904d/bin/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_b73ae0b1-f3a2-46c9-8e3b-fe3c43b0904d/bin/uautomizer/config/AutomizerReach.xml -i ../../sv-benchmarks/c/bitvector/s3_clnt_2.BV.c.cil-1a.c -s /tmp/vcloud-vcloud-master/worker/run_dir_b73ae0b1-f3a2-46c9-8e3b-fe3c43b0904d/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_b73ae0b1-f3a2-46c9-8e3b-fe3c43b0904d/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 1e9943d2199c95030d170f0541cc4df722deb62f .......................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... 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_b73ae0b1-f3a2-46c9-8e3b-fe3c43b0904d/bin/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/run_dir_b73ae0b1-f3a2-46c9-8e3b-fe3c43b0904d/bin/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_b73ae0b1-f3a2-46c9-8e3b-fe3c43b0904d/bin/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_b73ae0b1-f3a2-46c9-8e3b-fe3c43b0904d/bin/uautomizer/config/AutomizerReach.xml -i ../../sv-benchmarks/c/bitvector/s3_clnt_2.BV.c.cil-1a.c -s /tmp/vcloud-vcloud-master/worker/run_dir_b73ae0b1-f3a2-46c9-8e3b-fe3c43b0904d/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_b73ae0b1-f3a2-46c9-8e3b-fe3c43b0904d/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 1e9943d2199c95030d170f0541cc4df722deb62f ............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................. Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.25-f470102 [2019-12-07 10:07:33,935 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-07 10:07:33,936 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-07 10:07:33,944 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-07 10:07:33,944 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-07 10:07:33,945 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-07 10:07:33,946 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-07 10:07:33,947 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-07 10:07:33,949 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-07 10:07:33,949 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-07 10:07:33,950 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-07 10:07:33,951 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-07 10:07:33,951 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-07 10:07:33,951 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-07 10:07:33,952 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-07 10:07:33,953 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-07 10:07:33,953 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-07 10:07:33,954 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-07 10:07:33,955 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-07 10:07:33,957 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-07 10:07:33,958 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-07 10:07:33,959 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-07 10:07:33,959 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-07 10:07:33,960 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-07 10:07:33,961 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-07 10:07:33,962 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-07 10:07:33,962 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-07 10:07:33,962 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-07 10:07:33,962 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-07 10:07:33,963 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-07 10:07:33,963 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-07 10:07:33,964 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-07 10:07:33,964 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-07 10:07:33,965 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-07 10:07:33,965 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-07 10:07:33,965 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-07 10:07:33,966 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-07 10:07:33,966 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-07 10:07:33,966 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-07 10:07:33,967 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-07 10:07:33,967 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-07 10:07:33,968 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_b73ae0b1-f3a2-46c9-8e3b-fe3c43b0904d/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf [2019-12-07 10:07:33,977 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-07 10:07:33,977 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-07 10:07:33,978 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-07 10:07:33,978 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-07 10:07:33,979 INFO L138 SettingsManager]: * Use SBE=true [2019-12-07 10:07:33,979 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-07 10:07:33,979 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-07 10:07:33,979 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-07 10:07:33,979 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-07 10:07:33,979 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-07 10:07:33,979 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-07 10:07:33,980 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-07 10:07:33,980 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-07 10:07:33,980 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-07 10:07:33,980 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-07 10:07:33,980 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-07 10:07:33,980 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-07 10:07:33,980 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-07 10:07:33,981 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-12-07 10:07:33,981 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-07 10:07:33,981 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-07 10:07:33,981 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-07 10:07:33,981 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-07 10:07:33,981 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-07 10:07:33,981 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-07 10:07:33,981 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-12-07 10:07:33,982 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-07 10:07:33,982 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-07 10:07:33,982 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2019-12-07 10:07:33,982 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_b73ae0b1-f3a2-46c9-8e3b-fe3c43b0904d/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 -> 1e9943d2199c95030d170f0541cc4df722deb62f [2019-12-07 10:07:34,083 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-07 10:07:34,090 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-07 10:07:34,093 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-07 10:07:34,093 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-07 10:07:34,094 INFO L275 PluginConnector]: CDTParser initialized [2019-12-07 10:07:34,094 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_b73ae0b1-f3a2-46c9-8e3b-fe3c43b0904d/bin/uautomizer/../../sv-benchmarks/c/bitvector/s3_clnt_2.BV.c.cil-1a.c [2019-12-07 10:07:34,130 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_b73ae0b1-f3a2-46c9-8e3b-fe3c43b0904d/bin/uautomizer/data/65df1b75d/a22d8dc9bbad4ac3b9dd414b185abd8b/FLAGe69e996bb [2019-12-07 10:07:34,547 INFO L306 CDTParser]: Found 1 translation units. [2019-12-07 10:07:34,547 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_b73ae0b1-f3a2-46c9-8e3b-fe3c43b0904d/sv-benchmarks/c/bitvector/s3_clnt_2.BV.c.cil-1a.c [2019-12-07 10:07:34,555 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_b73ae0b1-f3a2-46c9-8e3b-fe3c43b0904d/bin/uautomizer/data/65df1b75d/a22d8dc9bbad4ac3b9dd414b185abd8b/FLAGe69e996bb [2019-12-07 10:07:34,564 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_b73ae0b1-f3a2-46c9-8e3b-fe3c43b0904d/bin/uautomizer/data/65df1b75d/a22d8dc9bbad4ac3b9dd414b185abd8b [2019-12-07 10:07:34,566 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-07 10:07:34,567 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-12-07 10:07:34,568 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-07 10:07:34,568 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-07 10:07:34,570 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-07 10:07:34,571 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.12 10:07:34" (1/1) ... [2019-12-07 10:07:34,573 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6342ce07 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 10:07:34, skipping insertion in model container [2019-12-07 10:07:34,573 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.12 10:07:34" (1/1) ... [2019-12-07 10:07:34,578 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-07 10:07:34,603 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-07 10:07:34,772 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-07 10:07:34,775 INFO L203 MainTranslator]: Completed pre-run [2019-12-07 10:07:34,808 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-07 10:07:34,817 INFO L208 MainTranslator]: Completed translation [2019-12-07 10:07:34,817 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 10:07:34 WrapperNode [2019-12-07 10:07:34,818 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-07 10:07:34,818 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-07 10:07:34,818 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-07 10:07:34,818 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-07 10:07:34,824 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 10:07:34" (1/1) ... [2019-12-07 10:07:34,830 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 10:07:34" (1/1) ... [2019-12-07 10:07:34,853 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-07 10:07:34,853 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-07 10:07:34,853 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-07 10:07:34,853 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-07 10:07:34,859 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 10:07:34" (1/1) ... [2019-12-07 10:07:34,859 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 10:07:34" (1/1) ... [2019-12-07 10:07:34,861 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 10:07:34" (1/1) ... [2019-12-07 10:07:34,862 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 10:07:34" (1/1) ... [2019-12-07 10:07:34,867 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 10:07:34" (1/1) ... [2019-12-07 10:07:34,872 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 10:07:34" (1/1) ... [2019-12-07 10:07:34,874 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 10:07:34" (1/1) ... [2019-12-07 10:07:34,876 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-07 10:07:34,877 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-07 10:07:34,877 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-07 10:07:34,877 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-07 10:07:34,877 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 10:07:34" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_b73ae0b1-f3a2-46c9-8e3b-fe3c43b0904d/bin/uautomizer/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-07 10:07:34,916 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-07 10:07:34,917 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-07 10:07:34,987 WARN L738 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-12-07 10:07:35,247 INFO L691 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##85: assume !false; [2019-12-07 10:07:35,247 INFO L691 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##84: assume false; [2019-12-07 10:07:35,249 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-07 10:07:35,249 INFO L287 CfgBuilder]: Removed 7 assume(true) statements. [2019-12-07 10:07:35,250 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 10:07:35 BoogieIcfgContainer [2019-12-07 10:07:35,250 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-07 10:07:35,251 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-07 10:07:35,251 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-07 10:07:35,253 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-07 10:07:35,254 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.12 10:07:34" (1/3) ... [2019-12-07 10:07:35,254 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@a8f5e8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.12 10:07:35, skipping insertion in model container [2019-12-07 10:07:35,254 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 10:07:34" (2/3) ... [2019-12-07 10:07:35,255 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@a8f5e8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.12 10:07:35, skipping insertion in model container [2019-12-07 10:07:35,255 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 10:07:35" (3/3) ... [2019-12-07 10:07:35,256 INFO L109 eAbstractionObserver]: Analyzing ICFG s3_clnt_2.BV.c.cil-1a.c [2019-12-07 10:07:35,264 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-07 10:07:35,270 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-12-07 10:07:35,277 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-12-07 10:07:35,293 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-07 10:07:35,293 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-07 10:07:35,293 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-07 10:07:35,293 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-12-07 10:07:35,293 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-07 10:07:35,293 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-07 10:07:35,294 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-07 10:07:35,294 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-07 10:07:35,305 INFO L276 IsEmpty]: Start isEmpty. Operand 124 states. [2019-12-07 10:07:35,310 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2019-12-07 10:07:35,310 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 10:07:35,310 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] [2019-12-07 10:07:35,311 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 10:07:35,314 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 10:07:35,314 INFO L82 PathProgramCache]: Analyzing trace with hash -1449578949, now seen corresponding path program 1 times [2019-12-07 10:07:35,320 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 10:07:35,320 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [870003555] [2019-12-07 10:07:35,321 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 10:07:35,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 10:07:35,441 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 10:07:35,442 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [870003555] [2019-12-07 10:07:35,443 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 10:07:35,443 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 10:07:35,444 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [381406392] [2019-12-07 10:07:35,448 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 10:07:35,449 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 10:07:35,457 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 10:07:35,457 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 10:07:35,459 INFO L87 Difference]: Start difference. First operand 124 states. Second operand 3 states. [2019-12-07 10:07:35,562 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 10:07:35,562 INFO L93 Difference]: Finished difference Result 245 states and 420 transitions. [2019-12-07 10:07:35,563 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 10:07:35,564 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 23 [2019-12-07 10:07:35,564 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 10:07:35,572 INFO L225 Difference]: With dead ends: 245 [2019-12-07 10:07:35,572 INFO L226 Difference]: Without dead ends: 111 [2019-12-07 10:07:35,575 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 10:07:35,586 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111 states. [2019-12-07 10:07:35,601 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111 to 111. [2019-12-07 10:07:35,602 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 111 states. [2019-12-07 10:07:35,603 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111 states to 111 states and 168 transitions. [2019-12-07 10:07:35,604 INFO L78 Accepts]: Start accepts. Automaton has 111 states and 168 transitions. Word has length 23 [2019-12-07 10:07:35,605 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 10:07:35,605 INFO L462 AbstractCegarLoop]: Abstraction has 111 states and 168 transitions. [2019-12-07 10:07:35,605 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 10:07:35,605 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 168 transitions. [2019-12-07 10:07:35,606 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2019-12-07 10:07:35,606 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 10:07:35,606 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] [2019-12-07 10:07:35,606 INFO L410 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 10:07:35,606 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 10:07:35,606 INFO L82 PathProgramCache]: Analyzing trace with hash 800883515, now seen corresponding path program 1 times [2019-12-07 10:07:35,607 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 10:07:35,607 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1649863635] [2019-12-07 10:07:35,607 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 10:07:35,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 10:07:35,650 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 10:07:35,650 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1649863635] [2019-12-07 10:07:35,650 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 10:07:35,650 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 10:07:35,650 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1858164341] [2019-12-07 10:07:35,651 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 10:07:35,651 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 10:07:35,652 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 10:07:35,652 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 10:07:35,652 INFO L87 Difference]: Start difference. First operand 111 states and 168 transitions. Second operand 3 states. [2019-12-07 10:07:35,735 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 10:07:35,735 INFO L93 Difference]: Finished difference Result 232 states and 355 transitions. [2019-12-07 10:07:35,735 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 10:07:35,736 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 35 [2019-12-07 10:07:35,736 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 10:07:35,737 INFO L225 Difference]: With dead ends: 232 [2019-12-07 10:07:35,737 INFO L226 Difference]: Without dead ends: 130 [2019-12-07 10:07:35,738 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 10:07:35,738 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 130 states. [2019-12-07 10:07:35,744 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 130 to 126. [2019-12-07 10:07:35,745 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 126 states. [2019-12-07 10:07:35,746 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 126 states to 126 states and 188 transitions. [2019-12-07 10:07:35,746 INFO L78 Accepts]: Start accepts. Automaton has 126 states and 188 transitions. Word has length 35 [2019-12-07 10:07:35,746 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 10:07:35,746 INFO L462 AbstractCegarLoop]: Abstraction has 126 states and 188 transitions. [2019-12-07 10:07:35,746 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 10:07:35,746 INFO L276 IsEmpty]: Start isEmpty. Operand 126 states and 188 transitions. [2019-12-07 10:07:35,747 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2019-12-07 10:07:35,747 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 10:07:35,747 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 10:07:35,748 INFO L410 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 10:07:35,748 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 10:07:35,748 INFO L82 PathProgramCache]: Analyzing trace with hash 1711238340, now seen corresponding path program 1 times [2019-12-07 10:07:35,748 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 10:07:35,748 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [662620624] [2019-12-07 10:07:35,748 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 10:07:35,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 10:07:35,791 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 13 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-12-07 10:07:35,791 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [662620624] [2019-12-07 10:07:35,791 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 10:07:35,791 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 10:07:35,791 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1628764488] [2019-12-07 10:07:35,792 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 10:07:35,792 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 10:07:35,792 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 10:07:35,792 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 10:07:35,792 INFO L87 Difference]: Start difference. First operand 126 states and 188 transitions. Second operand 3 states. [2019-12-07 10:07:35,888 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 10:07:35,888 INFO L93 Difference]: Finished difference Result 264 states and 399 transitions. [2019-12-07 10:07:35,889 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 10:07:35,889 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 49 [2019-12-07 10:07:35,889 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 10:07:35,891 INFO L225 Difference]: With dead ends: 264 [2019-12-07 10:07:35,891 INFO L226 Difference]: Without dead ends: 147 [2019-12-07 10:07:35,892 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 10:07:35,892 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 147 states. [2019-12-07 10:07:35,900 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 147 to 143. [2019-12-07 10:07:35,901 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 143 states. [2019-12-07 10:07:35,901 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 143 states to 143 states and 210 transitions. [2019-12-07 10:07:35,902 INFO L78 Accepts]: Start accepts. Automaton has 143 states and 210 transitions. Word has length 49 [2019-12-07 10:07:35,902 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 10:07:35,902 INFO L462 AbstractCegarLoop]: Abstraction has 143 states and 210 transitions. [2019-12-07 10:07:35,902 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 10:07:35,902 INFO L276 IsEmpty]: Start isEmpty. Operand 143 states and 210 transitions. [2019-12-07 10:07:35,904 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-12-07 10:07:35,904 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 10:07:35,905 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 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] [2019-12-07 10:07:35,905 INFO L410 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 10:07:35,905 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 10:07:35,905 INFO L82 PathProgramCache]: Analyzing trace with hash -1841896084, now seen corresponding path program 1 times [2019-12-07 10:07:35,905 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 10:07:35,906 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [503559499] [2019-12-07 10:07:35,906 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 10:07:35,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 10:07:35,962 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 38 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-12-07 10:07:35,963 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [503559499] [2019-12-07 10:07:35,963 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 10:07:35,963 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 10:07:35,963 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [540118268] [2019-12-07 10:07:35,963 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 10:07:35,963 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 10:07:35,964 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 10:07:35,964 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 10:07:35,964 INFO L87 Difference]: Start difference. First operand 143 states and 210 transitions. Second operand 3 states. [2019-12-07 10:07:35,981 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 10:07:35,982 INFO L93 Difference]: Finished difference Result 298 states and 435 transitions. [2019-12-07 10:07:35,982 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 10:07:35,982 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 66 [2019-12-07 10:07:35,982 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 10:07:35,983 INFO L225 Difference]: With dead ends: 298 [2019-12-07 10:07:35,984 INFO L226 Difference]: Without dead ends: 164 [2019-12-07 10:07:35,984 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 10:07:35,985 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 164 states. [2019-12-07 10:07:35,991 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 164 to 164. [2019-12-07 10:07:35,991 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 164 states. [2019-12-07 10:07:35,992 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 164 states to 164 states and 237 transitions. [2019-12-07 10:07:35,992 INFO L78 Accepts]: Start accepts. Automaton has 164 states and 237 transitions. Word has length 66 [2019-12-07 10:07:35,992 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 10:07:35,992 INFO L462 AbstractCegarLoop]: Abstraction has 164 states and 237 transitions. [2019-12-07 10:07:35,992 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 10:07:35,992 INFO L276 IsEmpty]: Start isEmpty. Operand 164 states and 237 transitions. [2019-12-07 10:07:35,993 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-12-07 10:07:35,993 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 10:07:35,994 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 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] [2019-12-07 10:07:35,994 INFO L410 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 10:07:35,994 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 10:07:35,994 INFO L82 PathProgramCache]: Analyzing trace with hash -1982444694, now seen corresponding path program 1 times [2019-12-07 10:07:35,994 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 10:07:35,994 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1206095889] [2019-12-07 10:07:35,995 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 10:07:36,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 10:07:36,035 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 25 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2019-12-07 10:07:36,035 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1206095889] [2019-12-07 10:07:36,035 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 10:07:36,036 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 10:07:36,036 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1606490272] [2019-12-07 10:07:36,036 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 10:07:36,036 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 10:07:36,037 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 10:07:36,037 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 10:07:36,037 INFO L87 Difference]: Start difference. First operand 164 states and 237 transitions. Second operand 3 states. [2019-12-07 10:07:36,153 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 10:07:36,153 INFO L93 Difference]: Finished difference Result 369 states and 549 transitions. [2019-12-07 10:07:36,154 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 10:07:36,154 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 66 [2019-12-07 10:07:36,154 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 10:07:36,155 INFO L225 Difference]: With dead ends: 369 [2019-12-07 10:07:36,155 INFO L226 Difference]: Without dead ends: 213 [2019-12-07 10:07:36,156 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 10:07:36,156 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 213 states. [2019-12-07 10:07:36,162 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 213 to 205. [2019-12-07 10:07:36,162 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 205 states. [2019-12-07 10:07:36,163 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 205 states to 205 states and 287 transitions. [2019-12-07 10:07:36,163 INFO L78 Accepts]: Start accepts. Automaton has 205 states and 287 transitions. Word has length 66 [2019-12-07 10:07:36,163 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 10:07:36,163 INFO L462 AbstractCegarLoop]: Abstraction has 205 states and 287 transitions. [2019-12-07 10:07:36,164 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 10:07:36,164 INFO L276 IsEmpty]: Start isEmpty. Operand 205 states and 287 transitions. [2019-12-07 10:07:36,165 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-12-07 10:07:36,165 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 10:07:36,165 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 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] [2019-12-07 10:07:36,165 INFO L410 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 10:07:36,166 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 10:07:36,166 INFO L82 PathProgramCache]: Analyzing trace with hash 507084268, now seen corresponding path program 1 times [2019-12-07 10:07:36,166 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 10:07:36,166 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [578551852] [2019-12-07 10:07:36,166 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 10:07:36,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 10:07:36,199 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 25 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2019-12-07 10:07:36,200 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [578551852] [2019-12-07 10:07:36,200 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 10:07:36,200 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 10:07:36,200 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [540616255] [2019-12-07 10:07:36,200 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 10:07:36,201 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 10:07:36,201 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 10:07:36,201 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 10:07:36,201 INFO L87 Difference]: Start difference. First operand 205 states and 287 transitions. Second operand 3 states. [2019-12-07 10:07:36,284 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 10:07:36,284 INFO L93 Difference]: Finished difference Result 424 states and 601 transitions. [2019-12-07 10:07:36,285 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 10:07:36,285 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 66 [2019-12-07 10:07:36,285 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 10:07:36,286 INFO L225 Difference]: With dead ends: 424 [2019-12-07 10:07:36,286 INFO L226 Difference]: Without dead ends: 228 [2019-12-07 10:07:36,287 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 10:07:36,287 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 228 states. [2019-12-07 10:07:36,291 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 228 to 224. [2019-12-07 10:07:36,291 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 224 states. [2019-12-07 10:07:36,292 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 224 states to 224 states and 311 transitions. [2019-12-07 10:07:36,292 INFO L78 Accepts]: Start accepts. Automaton has 224 states and 311 transitions. Word has length 66 [2019-12-07 10:07:36,293 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 10:07:36,293 INFO L462 AbstractCegarLoop]: Abstraction has 224 states and 311 transitions. [2019-12-07 10:07:36,293 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 10:07:36,293 INFO L276 IsEmpty]: Start isEmpty. Operand 224 states and 311 transitions. [2019-12-07 10:07:36,294 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2019-12-07 10:07:36,294 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 10:07:36,294 INFO L410 BasicCegarLoop]: trace histogram [5, 5, 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] [2019-12-07 10:07:36,294 INFO L410 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 10:07:36,294 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 10:07:36,295 INFO L82 PathProgramCache]: Analyzing trace with hash -374488382, now seen corresponding path program 1 times [2019-12-07 10:07:36,295 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 10:07:36,295 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2007507514] [2019-12-07 10:07:36,295 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 10:07:36,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 10:07:36,326 INFO L134 CoverageAnalysis]: Checked inductivity of 80 backedges. 39 proven. 0 refuted. 0 times theorem prover too weak. 41 trivial. 0 not checked. [2019-12-07 10:07:36,326 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2007507514] [2019-12-07 10:07:36,326 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 10:07:36,326 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 10:07:36,326 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [909651758] [2019-12-07 10:07:36,327 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 10:07:36,327 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 10:07:36,327 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 10:07:36,327 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 10:07:36,327 INFO L87 Difference]: Start difference. First operand 224 states and 311 transitions. Second operand 3 states. [2019-12-07 10:07:36,404 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 10:07:36,404 INFO L93 Difference]: Finished difference Result 463 states and 651 transitions. [2019-12-07 10:07:36,404 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 10:07:36,404 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 82 [2019-12-07 10:07:36,404 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 10:07:36,406 INFO L225 Difference]: With dead ends: 463 [2019-12-07 10:07:36,406 INFO L226 Difference]: Without dead ends: 248 [2019-12-07 10:07:36,406 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 10:07:36,407 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 248 states. [2019-12-07 10:07:36,410 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 248 to 245. [2019-12-07 10:07:36,410 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 245 states. [2019-12-07 10:07:36,411 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 245 states to 245 states and 337 transitions. [2019-12-07 10:07:36,411 INFO L78 Accepts]: Start accepts. Automaton has 245 states and 337 transitions. Word has length 82 [2019-12-07 10:07:36,411 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 10:07:36,411 INFO L462 AbstractCegarLoop]: Abstraction has 245 states and 337 transitions. [2019-12-07 10:07:36,411 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 10:07:36,412 INFO L276 IsEmpty]: Start isEmpty. Operand 245 states and 337 transitions. [2019-12-07 10:07:36,412 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2019-12-07 10:07:36,412 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 10:07:36,412 INFO L410 BasicCegarLoop]: trace histogram [6, 6, 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] [2019-12-07 10:07:36,413 INFO L410 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 10:07:36,413 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 10:07:36,413 INFO L82 PathProgramCache]: Analyzing trace with hash -272398982, now seen corresponding path program 1 times [2019-12-07 10:07:36,413 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 10:07:36,413 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [666401410] [2019-12-07 10:07:36,413 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 10:07:36,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 10:07:36,450 INFO L134 CoverageAnalysis]: Checked inductivity of 135 backedges. 105 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2019-12-07 10:07:36,450 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [666401410] [2019-12-07 10:07:36,451 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 10:07:36,451 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 10:07:36,451 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [784183701] [2019-12-07 10:07:36,451 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 10:07:36,451 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 10:07:36,451 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 10:07:36,452 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 10:07:36,452 INFO L87 Difference]: Start difference. First operand 245 states and 337 transitions. Second operand 3 states. [2019-12-07 10:07:36,477 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 10:07:36,478 INFO L93 Difference]: Finished difference Result 694 states and 957 transitions. [2019-12-07 10:07:36,478 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 10:07:36,478 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 102 [2019-12-07 10:07:36,478 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 10:07:36,480 INFO L225 Difference]: With dead ends: 694 [2019-12-07 10:07:36,480 INFO L226 Difference]: Without dead ends: 458 [2019-12-07 10:07:36,481 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 10:07:36,481 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 458 states. [2019-12-07 10:07:36,488 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 458 to 458. [2019-12-07 10:07:36,488 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 458 states. [2019-12-07 10:07:36,489 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 458 states to 458 states and 630 transitions. [2019-12-07 10:07:36,489 INFO L78 Accepts]: Start accepts. Automaton has 458 states and 630 transitions. Word has length 102 [2019-12-07 10:07:36,489 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 10:07:36,490 INFO L462 AbstractCegarLoop]: Abstraction has 458 states and 630 transitions. [2019-12-07 10:07:36,490 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 10:07:36,490 INFO L276 IsEmpty]: Start isEmpty. Operand 458 states and 630 transitions. [2019-12-07 10:07:36,490 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2019-12-07 10:07:36,491 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 10:07:36,491 INFO L410 BasicCegarLoop]: trace histogram [6, 6, 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] [2019-12-07 10:07:36,491 INFO L410 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 10:07:36,491 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 10:07:36,491 INFO L82 PathProgramCache]: Analyzing trace with hash -1688750428, now seen corresponding path program 1 times [2019-12-07 10:07:36,491 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 10:07:36,491 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [442302678] [2019-12-07 10:07:36,491 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 10:07:36,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 10:07:36,526 INFO L134 CoverageAnalysis]: Checked inductivity of 135 backedges. 55 proven. 0 refuted. 0 times theorem prover too weak. 80 trivial. 0 not checked. [2019-12-07 10:07:36,527 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [442302678] [2019-12-07 10:07:36,527 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 10:07:36,527 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 10:07:36,527 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [661650627] [2019-12-07 10:07:36,527 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 10:07:36,528 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 10:07:36,528 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 10:07:36,528 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 10:07:36,528 INFO L87 Difference]: Start difference. First operand 458 states and 630 transitions. Second operand 3 states. [2019-12-07 10:07:36,559 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 10:07:36,559 INFO L93 Difference]: Finished difference Result 673 states and 927 transitions. [2019-12-07 10:07:36,560 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 10:07:36,560 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 104 [2019-12-07 10:07:36,560 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 10:07:36,564 INFO L225 Difference]: With dead ends: 673 [2019-12-07 10:07:36,564 INFO L226 Difference]: Without dead ends: 671 [2019-12-07 10:07:36,564 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 10:07:36,565 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 671 states. [2019-12-07 10:07:36,578 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 671 to 671. [2019-12-07 10:07:36,578 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 671 states. [2019-12-07 10:07:36,581 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 671 states to 671 states and 925 transitions. [2019-12-07 10:07:36,581 INFO L78 Accepts]: Start accepts. Automaton has 671 states and 925 transitions. Word has length 104 [2019-12-07 10:07:36,581 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 10:07:36,581 INFO L462 AbstractCegarLoop]: Abstraction has 671 states and 925 transitions. [2019-12-07 10:07:36,581 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 10:07:36,581 INFO L276 IsEmpty]: Start isEmpty. Operand 671 states and 925 transitions. [2019-12-07 10:07:36,584 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 173 [2019-12-07 10:07:36,584 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 10:07:36,584 INFO L410 BasicCegarLoop]: trace histogram [10, 10, 9, 9, 9, 9, 9, 9, 9, 7, 7, 5, 5, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 10:07:36,584 INFO L410 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 10:07:36,584 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 10:07:36,585 INFO L82 PathProgramCache]: Analyzing trace with hash 439361019, now seen corresponding path program 1 times [2019-12-07 10:07:36,585 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 10:07:36,585 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1838818080] [2019-12-07 10:07:36,585 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 10:07:36,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 10:07:36,633 INFO L134 CoverageAnalysis]: Checked inductivity of 470 backedges. 310 proven. 0 refuted. 0 times theorem prover too weak. 160 trivial. 0 not checked. [2019-12-07 10:07:36,633 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1838818080] [2019-12-07 10:07:36,634 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 10:07:36,634 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 10:07:36,634 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [745060274] [2019-12-07 10:07:36,634 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 10:07:36,634 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 10:07:36,634 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 10:07:36,635 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 10:07:36,635 INFO L87 Difference]: Start difference. First operand 671 states and 925 transitions. Second operand 3 states. [2019-12-07 10:07:36,751 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 10:07:36,752 INFO L93 Difference]: Finished difference Result 1483 states and 2101 transitions. [2019-12-07 10:07:36,752 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 10:07:36,752 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 172 [2019-12-07 10:07:36,752 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 10:07:36,756 INFO L225 Difference]: With dead ends: 1483 [2019-12-07 10:07:36,756 INFO L226 Difference]: Without dead ends: 818 [2019-12-07 10:07:36,757 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 10:07:36,758 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 818 states. [2019-12-07 10:07:36,769 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 818 to 788. [2019-12-07 10:07:36,769 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 788 states. [2019-12-07 10:07:36,771 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 788 states to 788 states and 1114 transitions. [2019-12-07 10:07:36,771 INFO L78 Accepts]: Start accepts. Automaton has 788 states and 1114 transitions. Word has length 172 [2019-12-07 10:07:36,771 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 10:07:36,772 INFO L462 AbstractCegarLoop]: Abstraction has 788 states and 1114 transitions. [2019-12-07 10:07:36,772 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 10:07:36,772 INFO L276 IsEmpty]: Start isEmpty. Operand 788 states and 1114 transitions. [2019-12-07 10:07:36,773 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 185 [2019-12-07 10:07:36,773 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 10:07:36,774 INFO L410 BasicCegarLoop]: trace histogram [11, 11, 10, 10, 9, 9, 9, 9, 9, 7, 7, 5, 5, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 10:07:36,774 INFO L410 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 10:07:36,774 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 10:07:36,774 INFO L82 PathProgramCache]: Analyzing trace with hash 1597857147, now seen corresponding path program 2 times [2019-12-07 10:07:36,774 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 10:07:36,774 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [567340128] [2019-12-07 10:07:36,774 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 10:07:36,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 10:07:36,811 INFO L134 CoverageAnalysis]: Checked inductivity of 525 backedges. 325 proven. 0 refuted. 0 times theorem prover too weak. 200 trivial. 0 not checked. [2019-12-07 10:07:36,811 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [567340128] [2019-12-07 10:07:36,811 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 10:07:36,811 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 10:07:36,811 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [838183874] [2019-12-07 10:07:36,812 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 10:07:36,812 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 10:07:36,812 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 10:07:36,812 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 10:07:36,812 INFO L87 Difference]: Start difference. First operand 788 states and 1114 transitions. Second operand 3 states. [2019-12-07 10:07:36,945 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 10:07:36,945 INFO L93 Difference]: Finished difference Result 1845 states and 2682 transitions. [2019-12-07 10:07:36,945 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 10:07:36,945 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 184 [2019-12-07 10:07:36,945 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 10:07:36,949 INFO L225 Difference]: With dead ends: 1845 [2019-12-07 10:07:36,949 INFO L226 Difference]: Without dead ends: 1015 [2019-12-07 10:07:36,950 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 10:07:36,951 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1015 states. [2019-12-07 10:07:36,965 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1015 to 977. [2019-12-07 10:07:36,965 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 977 states. [2019-12-07 10:07:36,968 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 977 states to 977 states and 1366 transitions. [2019-12-07 10:07:36,968 INFO L78 Accepts]: Start accepts. Automaton has 977 states and 1366 transitions. Word has length 184 [2019-12-07 10:07:36,968 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 10:07:36,968 INFO L462 AbstractCegarLoop]: Abstraction has 977 states and 1366 transitions. [2019-12-07 10:07:36,968 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 10:07:36,968 INFO L276 IsEmpty]: Start isEmpty. Operand 977 states and 1366 transitions. [2019-12-07 10:07:36,970 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 194 [2019-12-07 10:07:36,970 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 10:07:36,970 INFO L410 BasicCegarLoop]: trace histogram [11, 11, 10, 10, 10, 10, 10, 10, 10, 8, 8, 6, 6, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 10:07:36,970 INFO L410 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 10:07:36,971 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 10:07:36,971 INFO L82 PathProgramCache]: Analyzing trace with hash -1444142562, now seen corresponding path program 1 times [2019-12-07 10:07:36,971 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 10:07:36,971 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1031721119] [2019-12-07 10:07:36,971 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 10:07:36,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 10:07:37,051 INFO L134 CoverageAnalysis]: Checked inductivity of 597 backedges. 420 proven. 0 refuted. 0 times theorem prover too weak. 177 trivial. 0 not checked. [2019-12-07 10:07:37,051 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1031721119] [2019-12-07 10:07:37,051 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 10:07:37,052 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 10:07:37,052 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [286158493] [2019-12-07 10:07:37,052 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 10:07:37,052 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 10:07:37,052 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 10:07:37,052 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 10:07:37,052 INFO L87 Difference]: Start difference. First operand 977 states and 1366 transitions. Second operand 3 states. [2019-12-07 10:07:37,074 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 10:07:37,075 INFO L93 Difference]: Finished difference Result 2279 states and 3183 transitions. [2019-12-07 10:07:37,075 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 10:07:37,075 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 193 [2019-12-07 10:07:37,075 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 10:07:37,080 INFO L225 Difference]: With dead ends: 2279 [2019-12-07 10:07:37,080 INFO L226 Difference]: Without dead ends: 1311 [2019-12-07 10:07:37,081 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 10:07:37,082 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1311 states. [2019-12-07 10:07:37,101 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1311 to 1311. [2019-12-07 10:07:37,101 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1311 states. [2019-12-07 10:07:37,104 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1311 states to 1311 states and 1827 transitions. [2019-12-07 10:07:37,105 INFO L78 Accepts]: Start accepts. Automaton has 1311 states and 1827 transitions. Word has length 193 [2019-12-07 10:07:37,105 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 10:07:37,105 INFO L462 AbstractCegarLoop]: Abstraction has 1311 states and 1827 transitions. [2019-12-07 10:07:37,105 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 10:07:37,105 INFO L276 IsEmpty]: Start isEmpty. Operand 1311 states and 1827 transitions. [2019-12-07 10:07:37,107 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 196 [2019-12-07 10:07:37,107 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 10:07:37,108 INFO L410 BasicCegarLoop]: trace histogram [10, 10, 9, 9, 9, 9, 9, 9, 9, 7, 7, 5, 5, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 10:07:37,108 INFO L410 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 10:07:37,108 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 10:07:37,108 INFO L82 PathProgramCache]: Analyzing trace with hash -1661550404, now seen corresponding path program 1 times [2019-12-07 10:07:37,108 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 10:07:37,108 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1759259918] [2019-12-07 10:07:37,108 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 10:07:37,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 10:07:37,157 INFO L134 CoverageAnalysis]: Checked inductivity of 478 backedges. 324 proven. 0 refuted. 0 times theorem prover too weak. 154 trivial. 0 not checked. [2019-12-07 10:07:37,158 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1759259918] [2019-12-07 10:07:37,158 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 10:07:37,158 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 10:07:37,158 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [356692596] [2019-12-07 10:07:37,158 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 10:07:37,158 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 10:07:37,159 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 10:07:37,159 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 10:07:37,159 INFO L87 Difference]: Start difference. First operand 1311 states and 1827 transitions. Second operand 3 states. [2019-12-07 10:07:37,193 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 10:07:37,193 INFO L93 Difference]: Finished difference Result 3667 states and 5151 transitions. [2019-12-07 10:07:37,193 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 10:07:37,193 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 195 [2019-12-07 10:07:37,193 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 10:07:37,202 INFO L225 Difference]: With dead ends: 3667 [2019-12-07 10:07:37,202 INFO L226 Difference]: Without dead ends: 2365 [2019-12-07 10:07:37,203 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 10:07:37,206 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2365 states. [2019-12-07 10:07:37,241 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2365 to 2363. [2019-12-07 10:07:37,241 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2363 states. [2019-12-07 10:07:37,246 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2363 states to 2363 states and 3324 transitions. [2019-12-07 10:07:37,246 INFO L78 Accepts]: Start accepts. Automaton has 2363 states and 3324 transitions. Word has length 195 [2019-12-07 10:07:37,247 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 10:07:37,247 INFO L462 AbstractCegarLoop]: Abstraction has 2363 states and 3324 transitions. [2019-12-07 10:07:37,247 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 10:07:37,247 INFO L276 IsEmpty]: Start isEmpty. Operand 2363 states and 3324 transitions. [2019-12-07 10:07:37,250 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 196 [2019-12-07 10:07:37,250 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 10:07:37,250 INFO L410 BasicCegarLoop]: trace histogram [11, 11, 10, 10, 10, 10, 10, 10, 10, 8, 8, 6, 6, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 10:07:37,250 INFO L410 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 10:07:37,250 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 10:07:37,250 INFO L82 PathProgramCache]: Analyzing trace with hash -403372922, now seen corresponding path program 1 times [2019-12-07 10:07:37,250 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 10:07:37,251 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [419295081] [2019-12-07 10:07:37,251 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 10:07:37,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-07 10:07:37,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-07 10:07:37,361 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-07 10:07:37,361 INFO L475 BasicCegarLoop]: Counterexample might be feasible [2019-12-07 10:07:37,419 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 07.12 10:07:37 BoogieIcfgContainer [2019-12-07 10:07:37,419 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-07 10:07:37,419 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-12-07 10:07:37,419 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-12-07 10:07:37,419 INFO L275 PluginConnector]: Witness Printer initialized [2019-12-07 10:07:37,419 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 10:07:35" (3/4) ... [2019-12-07 10:07:37,422 INFO L140 WitnessPrinter]: No result that supports witness generation found [2019-12-07 10:07:37,422 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-12-07 10:07:37,424 INFO L168 Benchmark]: Toolchain (without parser) took 2856.20 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 163.6 MB). Free memory was 944.8 MB in the beginning and 902.7 MB in the end (delta: 42.1 MB). Peak memory consumption was 205.6 MB. Max. memory is 11.5 GB. [2019-12-07 10:07:37,424 INFO L168 Benchmark]: CDTParser took 0.15 ms. Allocated memory is still 1.0 GB. Free memory is still 960.9 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-12-07 10:07:37,424 INFO L168 Benchmark]: CACSL2BoogieTranslator took 250.14 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 104.3 MB). Free memory was 944.8 MB in the beginning and 1.1 GB in the end (delta: -148.7 MB). Peak memory consumption was 23.8 MB. Max. memory is 11.5 GB. [2019-12-07 10:07:37,425 INFO L168 Benchmark]: Boogie Procedure Inliner took 34.60 ms. Allocated memory is still 1.1 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-12-07 10:07:37,425 INFO L168 Benchmark]: Boogie Preprocessor took 23.58 ms. Allocated memory is still 1.1 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-12-07 10:07:37,425 INFO L168 Benchmark]: RCFGBuilder took 373.53 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 50.6 MB). Peak memory consumption was 50.6 MB. Max. memory is 11.5 GB. [2019-12-07 10:07:37,425 INFO L168 Benchmark]: TraceAbstraction took 2167.88 ms. Allocated memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: 59.2 MB). Free memory was 1.0 GB in the beginning and 902.7 MB in the end (delta: 134.8 MB). Peak memory consumption was 194.1 MB. Max. memory is 11.5 GB. [2019-12-07 10:07:37,426 INFO L168 Benchmark]: Witness Printer took 3.30 ms. Allocated memory is still 1.2 GB. Free memory is still 902.7 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-12-07 10:07:37,427 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.15 ms. Allocated memory is still 1.0 GB. Free memory is still 960.9 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 250.14 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 104.3 MB). Free memory was 944.8 MB in the beginning and 1.1 GB in the end (delta: -148.7 MB). Peak memory consumption was 23.8 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 34.60 ms. Allocated memory is still 1.1 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * Boogie Preprocessor took 23.58 ms. Allocated memory is still 1.1 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 373.53 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 50.6 MB). Peak memory consumption was 50.6 MB. Max. memory is 11.5 GB. * TraceAbstraction took 2167.88 ms. Allocated memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: 59.2 MB). Free memory was 1.0 GB in the beginning and 902.7 MB in the end (delta: 134.8 MB). Peak memory consumption was 194.1 MB. Max. memory is 11.5 GB. * Witness Printer took 3.30 ms. Allocated memory is still 1.2 GB. Free memory is still 902.7 MB. There was no memory consumed. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - UnprovableResult [Line: 608]: Unable to prove that call of __VERIFIER_error() unreachable Unable to prove that call of __VERIFIER_error() unreachable Reason: overapproximation of bitwiseXor at line 356. Possible FailurePath: [L617] int __retres1 ; [L9] int s__info_callback = __VERIFIER_nondet_int(); [L10] unsigned int s__in_handshake = __VERIFIER_nondet_uint(); [L11] int s__state ; [L12] int s__new_session ; [L13] int s__server ; [L14] unsigned int s__version = __VERIFIER_nondet_uint(); [L15] int s__type ; [L16] int s__init_num ; [L17] int s__bbio = __VERIFIER_nondet_int(); [L18] int s__wbio = __VERIFIER_nondet_int(); [L19] int s__hit = __VERIFIER_nondet_int(); [L20] int s__rwstate ; [L21] int s__init_buf___0 ; [L22] int s__debug = __VERIFIER_nondet_int(); [L23] int s__shutdown ; [L24] int s__ctx__info_callback = __VERIFIER_nondet_int(); [L25] unsigned int s__ctx__stats__sess_connect_renegotiate = __VERIFIER_nondet_uint(); [L26] unsigned int s__ctx__stats__sess_connect ; [L27] unsigned int s__ctx__stats__sess_hit = __VERIFIER_nondet_uint(); [L28] unsigned int s__ctx__stats__sess_connect_good = __VERIFIER_nondet_uint(); [L29] int s__s3__change_cipher_spec ; [L30] int s__s3__flags ; [L31] int s__s3__delay_buf_pop_ret ; [L32] int s__s3__tmp__cert_req = __VERIFIER_nondet_int(); [L33] int s__s3__tmp__new_compression = __VERIFIER_nondet_int(); [L34] int s__s3__tmp__reuse_message = __VERIFIER_nondet_int(); [L35] int s__s3__tmp__new_cipher = __VERIFIER_nondet_int(); [L36] int s__s3__tmp__new_cipher__algorithms = __VERIFIER_nondet_int(); [L37] int s__s3__tmp__next_state___0 ; [L38] int s__s3__tmp__new_compression__id = __VERIFIER_nondet_int(); [L39] int s__session__cipher ; [L40] int s__session__compress_meth ; [L41] int buf ; [L42] unsigned long tmp ; [L43] unsigned long l ; [L44] int num1 ; [L45] int cb ; [L46] int ret ; [L47] int new_state ; [L48] int state ; [L49] int skip ; [L50] int tmp___0 ; [L51] unsigned int tmp___1 = __VERIFIER_nondet_uint(); [L52] unsigned int tmp___2 = __VERIFIER_nondet_uint(); [L53] int tmp___3 = __VERIFIER_nondet_int(); [L54] int tmp___4 = __VERIFIER_nondet_int(); [L55] int tmp___5 = __VERIFIER_nondet_int(); [L56] int tmp___6 = __VERIFIER_nondet_int(); [L57] int tmp___7 = __VERIFIER_nondet_int(); [L58] int tmp___8 = __VERIFIER_nondet_int(); [L59] int tmp___9 = __VERIFIER_nondet_int(); [L60] int blastFlag ; [L61] int ag_X ; [L62] int ag_Y ; [L63] int __retres59 ; [L66] s__state = 12292 [L67] blastFlag = 0 [L68] tmp = __VERIFIER_nondet_int() [L69] cb = 0 [L70] ret = -1 [L71] skip = 0 [L72] tmp___0 = 0 [L73] COND TRUE s__info_callback != 0 [L74] cb = s__info_callback [L82] s__in_handshake = s__in_handshake + 1 [L83] COND FALSE !(tmp___1 - 12288) [L93] COND TRUE 1 [L95] state = s__state [L96] COND TRUE s__state == 12292 [L199] s__new_session = 1 [L200] s__state = 4096 [L201] s__ctx__stats__sess_connect_renegotiate = s__ctx__stats__sess_connect_renegotiate + 1 [L206] s__server = 0 [L207] COND TRUE cb != 0 [L212] COND FALSE !(s__version - 65280 != 768) [L218] s__type = 4096 [L219] COND FALSE !(s__init_buf___0 == 0) [L237] COND FALSE !(! tmp___4) [L243] COND FALSE !(! tmp___5) [L249] s__state = 4368 [L250] s__ctx__stats__sess_connect = s__ctx__stats__sess_connect + 1 [L251] s__init_num = 0 [L566] COND FALSE !(! s__s3__tmp__reuse_message) [L595] skip = 0 [L93] COND TRUE 1 [L95] state = s__state [L96] COND FALSE !(s__state == 12292) [L99] COND FALSE !(s__state == 16384) [L102] COND FALSE !(s__state == 4096) [L105] COND FALSE !(s__state == 20480) [L108] COND FALSE !(s__state == 4099) [L111] COND TRUE s__state == 4368 [L255] s__shutdown = 0 [L256] ret = __VERIFIER_nondet_int() [L257] COND TRUE blastFlag == 0 [L258] blastFlag = 1 [L266] COND FALSE !(ret <= 0) [L271] s__state = 4384 [L272] s__init_num = 0 [L273] COND TRUE s__bbio != s__wbio [L566] COND FALSE !(! s__s3__tmp__reuse_message) [L595] skip = 0 [L93] COND TRUE 1 [L95] state = s__state [L96] COND FALSE !(s__state == 12292) [L99] COND FALSE !(s__state == 16384) [L102] COND FALSE !(s__state == 4096) [L105] COND FALSE !(s__state == 20480) [L108] COND FALSE !(s__state == 4099) [L111] COND FALSE !(s__state == 4368) [L114] COND FALSE !(s__state == 4369) [L117] COND TRUE s__state == 4384 [L281] ret = __VERIFIER_nondet_int() [L282] COND TRUE blastFlag == 1 [L283] blastFlag = 2 [L287] COND FALSE !(ret <= 0) [L292] COND FALSE !(\read(s__hit)) [L295] s__state = 4400 [L297] s__init_num = 0 [L566] COND FALSE !(! s__s3__tmp__reuse_message) [L595] skip = 0 [L93] COND TRUE 1 [L95] state = s__state [L96] COND FALSE !(s__state == 12292) [L99] COND FALSE !(s__state == 16384) [L102] COND FALSE !(s__state == 4096) [L105] COND FALSE !(s__state == 20480) [L108] COND FALSE !(s__state == 4099) [L111] COND FALSE !(s__state == 4368) [L114] COND FALSE !(s__state == 4369) [L117] COND FALSE !(s__state == 4384) [L120] COND FALSE !(s__state == 4385) [L123] COND TRUE s__state == 4400 [L301] COND FALSE !((unsigned long )s__s3__tmp__new_cipher__algorithms - 256UL) [L304] ret = __VERIFIER_nondet_int() [L305] COND TRUE blastFlag == 2 [L306] blastFlag = 3 [L310] COND FALSE !(ret <= 0) [L316] ag_Y = 61087 [L317] s__state = 4416 [L318] s__init_num = 0 [L566] COND FALSE !(! s__s3__tmp__reuse_message) [L595] skip = 0 [L93] COND TRUE 1 [L95] state = s__state [L96] COND FALSE !(s__state == 12292) [L99] COND FALSE !(s__state == 16384) [L102] COND FALSE !(s__state == 4096) [L105] COND FALSE !(s__state == 20480) [L108] COND FALSE !(s__state == 4099) [L111] COND FALSE !(s__state == 4368) [L114] COND FALSE !(s__state == 4369) [L117] COND FALSE !(s__state == 4384) [L120] COND FALSE !(s__state == 4385) [L123] COND FALSE !(s__state == 4400) [L126] COND FALSE !(s__state == 4401) [L129] COND TRUE s__state == 4416 [L322] ret = __VERIFIER_nondet_int() [L323] COND TRUE blastFlag == 3 [L324] blastFlag = 4 [L328] COND FALSE !(ret <= 0) [L333] s__state = 4432 [L334] ag_X = (unsigned short)65535 [L335] s__init_num = 0 [L336] COND FALSE !(! tmp___6) [L566] COND FALSE !(! s__s3__tmp__reuse_message) [L595] skip = 0 [L93] COND TRUE 1 [L95] state = s__state [L96] COND FALSE !(s__state == 12292) [L99] COND FALSE !(s__state == 16384) [L102] COND FALSE !(s__state == 4096) [L105] COND FALSE !(s__state == 20480) [L108] COND FALSE !(s__state == 4099) [L111] COND FALSE !(s__state == 4368) [L114] COND FALSE !(s__state == 4369) [L117] COND FALSE !(s__state == 4384) [L120] COND FALSE !(s__state == 4385) [L123] COND FALSE !(s__state == 4400) [L126] COND FALSE !(s__state == 4401) [L129] COND FALSE !(s__state == 4416) [L132] COND FALSE !(s__state == 4417) [L135] COND TRUE s__state == 4432 [L345] ret = __VERIFIER_nondet_int() [L346] COND FALSE !(blastFlag == 5) [L351] COND FALSE !(ret <= 0) [L356] s__state = ag_X ^ ag_Y [L357] s__init_num = 0 [L566] COND FALSE !(! s__s3__tmp__reuse_message) [L595] skip = 0 [L93] COND TRUE 1 [L95] state = s__state [L96] COND FALSE !(s__state == 12292) [L99] COND FALSE !(s__state == 16384) [L102] COND FALSE !(s__state == 4096) [L105] COND FALSE !(s__state == 20480) [L108] COND FALSE !(s__state == 4099) [L111] COND TRUE s__state == 4368 [L255] s__shutdown = 0 [L256] ret = __VERIFIER_nondet_int() [L257] COND FALSE !(blastFlag == 0) [L260] COND TRUE blastFlag == 4 [L261] blastFlag = 5 [L266] COND FALSE !(ret <= 0) [L271] s__state = 4384 [L272] s__init_num = 0 [L273] COND TRUE s__bbio != s__wbio [L566] COND FALSE !(! s__s3__tmp__reuse_message) [L595] skip = 0 [L93] COND TRUE 1 [L95] state = s__state [L96] COND FALSE !(s__state == 12292) [L99] COND FALSE !(s__state == 16384) [L102] COND FALSE !(s__state == 4096) [L105] COND FALSE !(s__state == 20480) [L108] COND FALSE !(s__state == 4099) [L111] COND FALSE !(s__state == 4368) [L114] COND FALSE !(s__state == 4369) [L117] COND TRUE s__state == 4384 [L281] ret = __VERIFIER_nondet_int() [L282] COND FALSE !(blastFlag == 1) [L287] COND FALSE !(ret <= 0) [L292] COND FALSE !(\read(s__hit)) [L295] s__state = 4400 [L297] s__init_num = 0 [L566] COND FALSE !(! s__s3__tmp__reuse_message) [L595] skip = 0 [L93] COND TRUE 1 [L95] state = s__state [L96] COND FALSE !(s__state == 12292) [L99] COND FALSE !(s__state == 16384) [L102] COND FALSE !(s__state == 4096) [L105] COND FALSE !(s__state == 20480) [L108] COND FALSE !(s__state == 4099) [L111] COND FALSE !(s__state == 4368) [L114] COND FALSE !(s__state == 4369) [L117] COND FALSE !(s__state == 4384) [L120] COND FALSE !(s__state == 4385) [L123] COND TRUE s__state == 4400 [L301] COND FALSE !((unsigned long )s__s3__tmp__new_cipher__algorithms - 256UL) [L304] ret = __VERIFIER_nondet_int() [L305] COND FALSE !(blastFlag == 2) [L310] COND FALSE !(ret <= 0) [L316] ag_Y = 61087 [L317] s__state = 4416 [L318] s__init_num = 0 [L566] COND FALSE !(! s__s3__tmp__reuse_message) [L595] skip = 0 [L93] COND TRUE 1 [L95] state = s__state [L96] COND FALSE !(s__state == 12292) [L99] COND FALSE !(s__state == 16384) [L102] COND FALSE !(s__state == 4096) [L105] COND FALSE !(s__state == 20480) [L108] COND FALSE !(s__state == 4099) [L111] COND FALSE !(s__state == 4368) [L114] COND FALSE !(s__state == 4369) [L117] COND FALSE !(s__state == 4384) [L120] COND FALSE !(s__state == 4385) [L123] COND FALSE !(s__state == 4400) [L126] COND FALSE !(s__state == 4401) [L129] COND TRUE s__state == 4416 [L322] ret = __VERIFIER_nondet_int() [L323] COND FALSE !(blastFlag == 3) [L328] COND FALSE !(ret <= 0) [L333] s__state = 4432 [L334] ag_X = (unsigned short)65535 [L335] s__init_num = 0 [L336] COND FALSE !(! tmp___6) [L566] COND FALSE !(! s__s3__tmp__reuse_message) [L595] skip = 0 [L93] COND TRUE 1 [L95] state = s__state [L96] COND FALSE !(s__state == 12292) [L99] COND FALSE !(s__state == 16384) [L102] COND FALSE !(s__state == 4096) [L105] COND FALSE !(s__state == 20480) [L108] COND FALSE !(s__state == 4099) [L111] COND FALSE !(s__state == 4368) [L114] COND FALSE !(s__state == 4369) [L117] COND FALSE !(s__state == 4384) [L120] COND FALSE !(s__state == 4385) [L123] COND FALSE !(s__state == 4400) [L126] COND FALSE !(s__state == 4401) [L129] COND FALSE !(s__state == 4416) [L132] COND FALSE !(s__state == 4417) [L135] COND TRUE s__state == 4432 [L345] ret = __VERIFIER_nondet_int() [L346] COND TRUE blastFlag == 5 [L608] __VERIFIER_error() - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 124 locations, 1 error locations. Result: UNSAFE, OverallTime: 2.0s, OverallIterations: 14, TraceHistogramMax: 11, AutomataDifference: 1.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 2411 SDtfs, 803 SDslu, 1336 SDs, 0 SdLazy, 884 SolverSat, 173 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.6s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 38 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=2363occurred in iteration=13, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 13 MinimizatonAttempts, 93 StatesRemovedByMinimization, 8 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.3s InterpolantComputationTime, 1532 NumberOfCodeBlocks, 1532 NumberOfCodeBlocksAsserted, 14 NumberOfCheckSat, 1324 ConstructedInterpolants, 0 QuantifiedInterpolants, 420496 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 13 InterpolantComputations, 13 PerfectInterpolantSequences, 2562/2562 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces Received shutdown request... ### Bit-precise run ### This is Ultimate 0.1.25-f470102 [2019-12-07 10:07:38,731 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-07 10:07:38,733 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-07 10:07:38,741 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-07 10:07:38,741 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-07 10:07:38,741 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-07 10:07:38,742 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-07 10:07:38,744 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-07 10:07:38,745 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-07 10:07:38,746 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-07 10:07:38,746 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-07 10:07:38,747 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-07 10:07:38,747 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-07 10:07:38,748 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-07 10:07:38,749 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-07 10:07:38,749 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-07 10:07:38,750 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-07 10:07:38,751 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-07 10:07:38,752 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-07 10:07:38,753 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-07 10:07:38,754 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-07 10:07:38,755 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-07 10:07:38,756 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-07 10:07:38,757 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-07 10:07:38,759 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-07 10:07:38,759 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-07 10:07:38,759 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-07 10:07:38,759 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-07 10:07:38,760 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-07 10:07:38,760 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-07 10:07:38,760 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-07 10:07:38,761 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-07 10:07:38,761 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-07 10:07:38,762 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-07 10:07:38,763 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-07 10:07:38,763 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-07 10:07:38,763 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-07 10:07:38,763 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-07 10:07:38,763 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-07 10:07:38,764 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-07 10:07:38,764 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-07 10:07:38,765 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_b73ae0b1-f3a2-46c9-8e3b-fe3c43b0904d/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2019-12-07 10:07:38,774 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-07 10:07:38,775 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-07 10:07:38,775 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-07 10:07:38,776 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-07 10:07:38,776 INFO L138 SettingsManager]: * Use SBE=true [2019-12-07 10:07:38,776 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-07 10:07:38,776 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-07 10:07:38,776 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-07 10:07:38,776 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-07 10:07:38,776 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-07 10:07:38,777 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-07 10:07:38,777 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-07 10:07:38,777 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2019-12-07 10:07:38,777 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2019-12-07 10:07:38,777 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-07 10:07:38,777 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-07 10:07:38,777 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-07 10:07:38,777 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-07 10:07:38,778 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-07 10:07:38,778 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-12-07 10:07:38,778 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-07 10:07:38,778 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-07 10:07:38,778 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-07 10:07:38,778 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-07 10:07:38,778 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-07 10:07:38,779 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-07 10:07:38,779 INFO L138 SettingsManager]: * Trace refinement strategy=WOLF [2019-12-07 10:07:38,779 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --rewrite-divk --print-success --lang smt [2019-12-07 10:07:38,779 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-07 10:07:38,779 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2019-12-07 10:07:38,779 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-12-07 10:07:38,779 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_b73ae0b1-f3a2-46c9-8e3b-fe3c43b0904d/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 -> 1e9943d2199c95030d170f0541cc4df722deb62f [2019-12-07 10:07:38,959 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-07 10:07:38,968 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-07 10:07:38,970 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-07 10:07:38,971 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-07 10:07:38,972 INFO L275 PluginConnector]: CDTParser initialized [2019-12-07 10:07:38,972 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_b73ae0b1-f3a2-46c9-8e3b-fe3c43b0904d/bin/uautomizer/../../sv-benchmarks/c/bitvector/s3_clnt_2.BV.c.cil-1a.c [2019-12-07 10:07:39,013 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_b73ae0b1-f3a2-46c9-8e3b-fe3c43b0904d/bin/uautomizer/data/e19c78486/2ad638cc895f4f82b8a975de275b2fb5/FLAG70f76510d [2019-12-07 10:07:39,415 INFO L306 CDTParser]: Found 1 translation units. [2019-12-07 10:07:39,416 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_b73ae0b1-f3a2-46c9-8e3b-fe3c43b0904d/sv-benchmarks/c/bitvector/s3_clnt_2.BV.c.cil-1a.c [2019-12-07 10:07:39,423 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_b73ae0b1-f3a2-46c9-8e3b-fe3c43b0904d/bin/uautomizer/data/e19c78486/2ad638cc895f4f82b8a975de275b2fb5/FLAG70f76510d [2019-12-07 10:07:39,432 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_b73ae0b1-f3a2-46c9-8e3b-fe3c43b0904d/bin/uautomizer/data/e19c78486/2ad638cc895f4f82b8a975de275b2fb5 [2019-12-07 10:07:39,434 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-07 10:07:39,435 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-12-07 10:07:39,436 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-07 10:07:39,436 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-07 10:07:39,438 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-07 10:07:39,439 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.12 10:07:39" (1/1) ... [2019-12-07 10:07:39,440 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@41944eff and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 10:07:39, skipping insertion in model container [2019-12-07 10:07:39,441 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.12 10:07:39" (1/1) ... [2019-12-07 10:07:39,445 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-07 10:07:39,469 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-07 10:07:39,607 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-07 10:07:39,610 INFO L203 MainTranslator]: Completed pre-run [2019-12-07 10:07:39,644 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-07 10:07:39,684 INFO L208 MainTranslator]: Completed translation [2019-12-07 10:07:39,684 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 10:07:39 WrapperNode [2019-12-07 10:07:39,685 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-07 10:07:39,685 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-07 10:07:39,685 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-07 10:07:39,685 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-07 10:07:39,690 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 10:07:39" (1/1) ... [2019-12-07 10:07:39,697 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 10:07:39" (1/1) ... [2019-12-07 10:07:39,720 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-07 10:07:39,721 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-07 10:07:39,721 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-07 10:07:39,721 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-07 10:07:39,727 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 10:07:39" (1/1) ... [2019-12-07 10:07:39,727 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 10:07:39" (1/1) ... [2019-12-07 10:07:39,730 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 10:07:39" (1/1) ... [2019-12-07 10:07:39,730 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 10:07:39" (1/1) ... [2019-12-07 10:07:39,735 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 10:07:39" (1/1) ... [2019-12-07 10:07:39,741 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 10:07:39" (1/1) ... [2019-12-07 10:07:39,743 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 10:07:39" (1/1) ... [2019-12-07 10:07:39,747 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-07 10:07:39,747 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-07 10:07:39,748 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-07 10:07:39,748 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-07 10:07:39,748 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 10:07:39" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_b73ae0b1-f3a2-46c9-8e3b-fe3c43b0904d/bin/uautomizer/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-07 10:07:39,787 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-07 10:07:39,788 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-07 10:07:39,858 WARN L738 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-12-07 10:07:40,147 INFO L691 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##85: assume !false; [2019-12-07 10:07:40,147 INFO L691 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##84: assume false; [2019-12-07 10:07:40,148 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-07 10:07:40,148 INFO L287 CfgBuilder]: Removed 7 assume(true) statements. [2019-12-07 10:07:40,149 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 10:07:40 BoogieIcfgContainer [2019-12-07 10:07:40,149 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-07 10:07:40,149 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-07 10:07:40,150 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-07 10:07:40,151 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-07 10:07:40,151 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.12 10:07:39" (1/3) ... [2019-12-07 10:07:40,152 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@344410eb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.12 10:07:40, skipping insertion in model container [2019-12-07 10:07:40,152 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 10:07:39" (2/3) ... [2019-12-07 10:07:40,152 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@344410eb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.12 10:07:40, skipping insertion in model container [2019-12-07 10:07:40,152 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 10:07:40" (3/3) ... [2019-12-07 10:07:40,153 INFO L109 eAbstractionObserver]: Analyzing ICFG s3_clnt_2.BV.c.cil-1a.c [2019-12-07 10:07:40,160 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-07 10:07:40,165 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-12-07 10:07:40,172 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-12-07 10:07:40,188 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-07 10:07:40,188 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-07 10:07:40,188 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-07 10:07:40,188 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-12-07 10:07:40,189 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-07 10:07:40,189 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-07 10:07:40,189 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-07 10:07:40,189 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-07 10:07:40,201 INFO L276 IsEmpty]: Start isEmpty. Operand 124 states. [2019-12-07 10:07:40,205 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2019-12-07 10:07:40,206 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 10:07:40,206 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] [2019-12-07 10:07:40,206 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 10:07:40,210 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 10:07:40,210 INFO L82 PathProgramCache]: Analyzing trace with hash -1449578949, now seen corresponding path program 1 times [2019-12-07 10:07:40,218 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-12-07 10:07:40,218 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [694840624] [2019-12-07 10:07:40,219 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_b73ae0b1-f3a2-46c9-8e3b-fe3c43b0904d/bin/uautomizer/mathsat Starting monitored process 2 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with mathsat -unsat_core_generation=3 [2019-12-07 10:07:40,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 10:07:40,277 INFO L264 TraceCheckSpWp]: Trace formula consists of 58 conjuncts, 2 conjunts are in the unsatisfiable core [2019-12-07 10:07:40,282 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 10:07:40,310 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 10:07:40,310 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 10:07:40,316 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 10:07:40,317 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [694840624] [2019-12-07 10:07:40,318 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-12-07 10:07:40,318 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2, 2] imperfect sequences [] total 2 [2019-12-07 10:07:40,319 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1776487675] [2019-12-07 10:07:40,323 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 10:07:40,323 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-12-07 10:07:40,331 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 10:07:40,331 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 10:07:40,333 INFO L87 Difference]: Start difference. First operand 124 states. Second operand 3 states. [2019-12-07 10:07:40,450 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 10:07:40,450 INFO L93 Difference]: Finished difference Result 245 states and 420 transitions. [2019-12-07 10:07:40,450 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 10:07:40,451 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 23 [2019-12-07 10:07:40,451 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 10:07:40,460 INFO L225 Difference]: With dead ends: 245 [2019-12-07 10:07:40,461 INFO L226 Difference]: Without dead ends: 111 [2019-12-07 10:07:40,463 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 43 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 10:07:40,476 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111 states. [2019-12-07 10:07:40,494 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111 to 111. [2019-12-07 10:07:40,495 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 111 states. [2019-12-07 10:07:40,496 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111 states to 111 states and 168 transitions. [2019-12-07 10:07:40,497 INFO L78 Accepts]: Start accepts. Automaton has 111 states and 168 transitions. Word has length 23 [2019-12-07 10:07:40,497 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 10:07:40,497 INFO L462 AbstractCegarLoop]: Abstraction has 111 states and 168 transitions. [2019-12-07 10:07:40,497 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 10:07:40,498 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 168 transitions. [2019-12-07 10:07:40,499 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2019-12-07 10:07:40,499 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 10:07:40,499 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] [2019-12-07 10:07:40,700 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 mathsat -unsat_core_generation=3 [2019-12-07 10:07:40,700 INFO L410 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 10:07:40,700 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 10:07:40,700 INFO L82 PathProgramCache]: Analyzing trace with hash 800883515, now seen corresponding path program 1 times [2019-12-07 10:07:40,701 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-12-07 10:07:40,701 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1794587613] [2019-12-07 10:07:40,702 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_b73ae0b1-f3a2-46c9-8e3b-fe3c43b0904d/bin/uautomizer/mathsat Starting monitored process 3 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with mathsat -unsat_core_generation=3 [2019-12-07 10:07:40,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 10:07:40,749 INFO L264 TraceCheckSpWp]: Trace formula consists of 76 conjuncts, 2 conjunts are in the unsatisfiable core [2019-12-07 10:07:40,751 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 10:07:40,758 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 10:07:40,758 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 10:07:40,762 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 10:07:40,762 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1794587613] [2019-12-07 10:07:40,762 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-12-07 10:07:40,762 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 3 [2019-12-07 10:07:40,763 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [720210986] [2019-12-07 10:07:40,763 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 10:07:40,764 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-12-07 10:07:40,764 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 10:07:40,764 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 10:07:40,764 INFO L87 Difference]: Start difference. First operand 111 states and 168 transitions. Second operand 3 states. [2019-12-07 10:07:40,865 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 10:07:40,865 INFO L93 Difference]: Finished difference Result 232 states and 355 transitions. [2019-12-07 10:07:40,866 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 10:07:40,866 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 35 [2019-12-07 10:07:40,866 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 10:07:40,867 INFO L225 Difference]: With dead ends: 232 [2019-12-07 10:07:40,867 INFO L226 Difference]: Without dead ends: 130 [2019-12-07 10:07:40,868 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 67 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 10:07:40,869 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 130 states. [2019-12-07 10:07:40,876 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 130 to 126. [2019-12-07 10:07:40,876 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 126 states. [2019-12-07 10:07:40,877 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 126 states to 126 states and 188 transitions. [2019-12-07 10:07:40,877 INFO L78 Accepts]: Start accepts. Automaton has 126 states and 188 transitions. Word has length 35 [2019-12-07 10:07:40,877 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 10:07:40,877 INFO L462 AbstractCegarLoop]: Abstraction has 126 states and 188 transitions. [2019-12-07 10:07:40,877 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 10:07:40,877 INFO L276 IsEmpty]: Start isEmpty. Operand 126 states and 188 transitions. [2019-12-07 10:07:40,878 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2019-12-07 10:07:40,878 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 10:07:40,879 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 10:07:41,079 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 mathsat -unsat_core_generation=3 [2019-12-07 10:07:41,080 INFO L410 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 10:07:41,080 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 10:07:41,080 INFO L82 PathProgramCache]: Analyzing trace with hash 1711238340, now seen corresponding path program 1 times [2019-12-07 10:07:41,081 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-12-07 10:07:41,082 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [48047311] [2019-12-07 10:07:41,082 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_b73ae0b1-f3a2-46c9-8e3b-fe3c43b0904d/bin/uautomizer/mathsat Starting monitored process 4 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with mathsat -unsat_core_generation=3 [2019-12-07 10:07:41,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 10:07:41,152 INFO L264 TraceCheckSpWp]: Trace formula consists of 94 conjuncts, 2 conjunts are in the unsatisfiable core [2019-12-07 10:07:41,155 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 10:07:41,164 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 13 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-12-07 10:07:41,164 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 10:07:41,171 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 13 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-12-07 10:07:41,171 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [48047311] [2019-12-07 10:07:41,172 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-12-07 10:07:41,172 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 3 [2019-12-07 10:07:41,172 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [850798405] [2019-12-07 10:07:41,173 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 10:07:41,173 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-12-07 10:07:41,173 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 10:07:41,174 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 10:07:41,174 INFO L87 Difference]: Start difference. First operand 126 states and 188 transitions. Second operand 3 states. [2019-12-07 10:07:41,282 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 10:07:41,283 INFO L93 Difference]: Finished difference Result 264 states and 399 transitions. [2019-12-07 10:07:41,283 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 10:07:41,283 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 49 [2019-12-07 10:07:41,283 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 10:07:41,285 INFO L225 Difference]: With dead ends: 264 [2019-12-07 10:07:41,285 INFO L226 Difference]: Without dead ends: 147 [2019-12-07 10:07:41,286 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 96 GetRequests, 95 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 10:07:41,287 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 147 states. [2019-12-07 10:07:41,295 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 147 to 143. [2019-12-07 10:07:41,295 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 143 states. [2019-12-07 10:07:41,296 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 143 states to 143 states and 210 transitions. [2019-12-07 10:07:41,297 INFO L78 Accepts]: Start accepts. Automaton has 143 states and 210 transitions. Word has length 49 [2019-12-07 10:07:41,297 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 10:07:41,297 INFO L462 AbstractCegarLoop]: Abstraction has 143 states and 210 transitions. [2019-12-07 10:07:41,297 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 10:07:41,297 INFO L276 IsEmpty]: Start isEmpty. Operand 143 states and 210 transitions. [2019-12-07 10:07:41,299 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-12-07 10:07:41,299 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 10:07:41,299 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 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] [2019-12-07 10:07:41,500 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 mathsat -unsat_core_generation=3 [2019-12-07 10:07:41,500 INFO L410 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 10:07:41,500 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 10:07:41,501 INFO L82 PathProgramCache]: Analyzing trace with hash -1841896084, now seen corresponding path program 1 times [2019-12-07 10:07:41,501 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-12-07 10:07:41,502 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1400513271] [2019-12-07 10:07:41,502 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_b73ae0b1-f3a2-46c9-8e3b-fe3c43b0904d/bin/uautomizer/mathsat Starting monitored process 5 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with mathsat -unsat_core_generation=3 [2019-12-07 10:07:41,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 10:07:41,571 INFO L264 TraceCheckSpWp]: Trace formula consists of 112 conjuncts, 2 conjunts are in the unsatisfiable core [2019-12-07 10:07:41,573 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 10:07:41,583 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 38 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-12-07 10:07:41,583 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 10:07:41,590 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 38 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-12-07 10:07:41,591 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1400513271] [2019-12-07 10:07:41,591 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-12-07 10:07:41,591 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 3 [2019-12-07 10:07:41,591 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1584081523] [2019-12-07 10:07:41,591 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 10:07:41,591 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-12-07 10:07:41,592 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 10:07:41,592 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 10:07:41,592 INFO L87 Difference]: Start difference. First operand 143 states and 210 transitions. Second operand 3 states. [2019-12-07 10:07:41,611 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 10:07:41,611 INFO L93 Difference]: Finished difference Result 298 states and 435 transitions. [2019-12-07 10:07:41,611 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 10:07:41,611 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 66 [2019-12-07 10:07:41,612 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 10:07:41,613 INFO L225 Difference]: With dead ends: 298 [2019-12-07 10:07:41,613 INFO L226 Difference]: Without dead ends: 164 [2019-12-07 10:07:41,614 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 130 GetRequests, 129 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 10:07:41,614 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 164 states. [2019-12-07 10:07:41,620 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 164 to 164. [2019-12-07 10:07:41,620 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 164 states. [2019-12-07 10:07:41,621 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 164 states to 164 states and 237 transitions. [2019-12-07 10:07:41,621 INFO L78 Accepts]: Start accepts. Automaton has 164 states and 237 transitions. Word has length 66 [2019-12-07 10:07:41,622 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 10:07:41,622 INFO L462 AbstractCegarLoop]: Abstraction has 164 states and 237 transitions. [2019-12-07 10:07:41,622 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 10:07:41,622 INFO L276 IsEmpty]: Start isEmpty. Operand 164 states and 237 transitions. [2019-12-07 10:07:41,623 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-12-07 10:07:41,623 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 10:07:41,623 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 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] [2019-12-07 10:07:41,824 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 mathsat -unsat_core_generation=3 [2019-12-07 10:07:41,824 INFO L410 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 10:07:41,824 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 10:07:41,825 INFO L82 PathProgramCache]: Analyzing trace with hash -1982444694, now seen corresponding path program 1 times [2019-12-07 10:07:41,825 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-12-07 10:07:41,826 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [846756000] [2019-12-07 10:07:41,826 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_b73ae0b1-f3a2-46c9-8e3b-fe3c43b0904d/bin/uautomizer/mathsat Starting monitored process 6 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with mathsat -unsat_core_generation=3 [2019-12-07 10:07:41,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 10:07:41,890 INFO L264 TraceCheckSpWp]: Trace formula consists of 113 conjuncts, 2 conjunts are in the unsatisfiable core [2019-12-07 10:07:41,892 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 10:07:41,901 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 25 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2019-12-07 10:07:41,901 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 10:07:41,912 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 25 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2019-12-07 10:07:41,912 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [846756000] [2019-12-07 10:07:41,913 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-12-07 10:07:41,913 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 4 [2019-12-07 10:07:41,913 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [840784378] [2019-12-07 10:07:41,914 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 10:07:41,914 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-12-07 10:07:41,914 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 10:07:41,914 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-07 10:07:41,914 INFO L87 Difference]: Start difference. First operand 164 states and 237 transitions. Second operand 4 states. [2019-12-07 10:07:42,091 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 10:07:42,091 INFO L93 Difference]: Finished difference Result 390 states and 587 transitions. [2019-12-07 10:07:42,091 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 10:07:42,091 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 66 [2019-12-07 10:07:42,092 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 10:07:42,093 INFO L225 Difference]: With dead ends: 390 [2019-12-07 10:07:42,093 INFO L226 Difference]: Without dead ends: 235 [2019-12-07 10:07:42,094 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 130 GetRequests, 128 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-07 10:07:42,094 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 235 states. [2019-12-07 10:07:42,102 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 235 to 227. [2019-12-07 10:07:42,102 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 227 states. [2019-12-07 10:07:42,103 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 227 states to 227 states and 323 transitions. [2019-12-07 10:07:42,103 INFO L78 Accepts]: Start accepts. Automaton has 227 states and 323 transitions. Word has length 66 [2019-12-07 10:07:42,104 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 10:07:42,104 INFO L462 AbstractCegarLoop]: Abstraction has 227 states and 323 transitions. [2019-12-07 10:07:42,104 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 10:07:42,104 INFO L276 IsEmpty]: Start isEmpty. Operand 227 states and 323 transitions. [2019-12-07 10:07:42,105 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-12-07 10:07:42,105 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 10:07:42,105 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 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] [2019-12-07 10:07:42,306 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 mathsat -unsat_core_generation=3 [2019-12-07 10:07:42,306 INFO L410 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 10:07:42,307 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 10:07:42,307 INFO L82 PathProgramCache]: Analyzing trace with hash -1464883036, now seen corresponding path program 1 times [2019-12-07 10:07:42,308 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-12-07 10:07:42,308 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [584177029] [2019-12-07 10:07:42,308 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_b73ae0b1-f3a2-46c9-8e3b-fe3c43b0904d/bin/uautomizer/mathsat Starting monitored process 7 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with mathsat -unsat_core_generation=3 [2019-12-07 10:07:42,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 10:07:42,398 INFO L264 TraceCheckSpWp]: Trace formula consists of 114 conjuncts, 2 conjunts are in the unsatisfiable core [2019-12-07 10:07:42,400 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 10:07:42,407 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 25 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2019-12-07 10:07:42,407 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 10:07:42,413 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 25 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2019-12-07 10:07:42,413 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [584177029] [2019-12-07 10:07:42,413 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-12-07 10:07:42,413 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 3 [2019-12-07 10:07:42,414 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [438759103] [2019-12-07 10:07:42,414 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 10:07:42,414 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-12-07 10:07:42,414 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 10:07:42,415 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 10:07:42,415 INFO L87 Difference]: Start difference. First operand 227 states and 323 transitions. Second operand 3 states. [2019-12-07 10:07:42,509 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 10:07:42,510 INFO L93 Difference]: Finished difference Result 468 states and 673 transitions. [2019-12-07 10:07:42,510 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 10:07:42,510 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 67 [2019-12-07 10:07:42,510 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 10:07:42,511 INFO L225 Difference]: With dead ends: 468 [2019-12-07 10:07:42,511 INFO L226 Difference]: Without dead ends: 250 [2019-12-07 10:07:42,512 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 132 GetRequests, 131 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 10:07:42,512 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 250 states. [2019-12-07 10:07:42,518 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 250 to 246. [2019-12-07 10:07:42,518 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 246 states. [2019-12-07 10:07:42,519 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 246 states to 246 states and 347 transitions. [2019-12-07 10:07:42,519 INFO L78 Accepts]: Start accepts. Automaton has 246 states and 347 transitions. Word has length 67 [2019-12-07 10:07:42,519 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 10:07:42,519 INFO L462 AbstractCegarLoop]: Abstraction has 246 states and 347 transitions. [2019-12-07 10:07:42,520 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 10:07:42,520 INFO L276 IsEmpty]: Start isEmpty. Operand 246 states and 347 transitions. [2019-12-07 10:07:42,521 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2019-12-07 10:07:42,521 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 10:07:42,521 INFO L410 BasicCegarLoop]: trace histogram [5, 5, 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] [2019-12-07 10:07:42,721 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 mathsat -unsat_core_generation=3 [2019-12-07 10:07:42,722 INFO L410 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 10:07:42,722 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 10:07:42,722 INFO L82 PathProgramCache]: Analyzing trace with hash 1271135886, now seen corresponding path program 1 times [2019-12-07 10:07:42,723 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-12-07 10:07:42,723 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1500086776] [2019-12-07 10:07:42,723 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_b73ae0b1-f3a2-46c9-8e3b-fe3c43b0904d/bin/uautomizer/mathsat Starting monitored process 8 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with mathsat -unsat_core_generation=3 [2019-12-07 10:07:42,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 10:07:42,789 INFO L264 TraceCheckSpWp]: Trace formula consists of 133 conjuncts, 2 conjunts are in the unsatisfiable core [2019-12-07 10:07:42,791 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 10:07:42,799 INFO L134 CoverageAnalysis]: Checked inductivity of 80 backedges. 39 proven. 0 refuted. 0 times theorem prover too weak. 41 trivial. 0 not checked. [2019-12-07 10:07:42,799 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 10:07:42,805 INFO L134 CoverageAnalysis]: Checked inductivity of 80 backedges. 39 proven. 0 refuted. 0 times theorem prover too weak. 41 trivial. 0 not checked. [2019-12-07 10:07:42,805 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1500086776] [2019-12-07 10:07:42,805 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-12-07 10:07:42,805 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 3 [2019-12-07 10:07:42,805 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [900457171] [2019-12-07 10:07:42,805 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 10:07:42,805 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-12-07 10:07:42,806 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 10:07:42,806 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 10:07:42,806 INFO L87 Difference]: Start difference. First operand 246 states and 347 transitions. Second operand 3 states. [2019-12-07 10:07:42,889 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 10:07:42,889 INFO L93 Difference]: Finished difference Result 507 states and 723 transitions. [2019-12-07 10:07:42,889 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 10:07:42,889 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 83 [2019-12-07 10:07:42,890 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 10:07:42,891 INFO L225 Difference]: With dead ends: 507 [2019-12-07 10:07:42,891 INFO L226 Difference]: Without dead ends: 270 [2019-12-07 10:07:42,891 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 164 GetRequests, 163 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 10:07:42,892 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 270 states. [2019-12-07 10:07:42,897 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 270 to 267. [2019-12-07 10:07:42,897 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 267 states. [2019-12-07 10:07:42,898 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 267 states to 267 states and 373 transitions. [2019-12-07 10:07:42,898 INFO L78 Accepts]: Start accepts. Automaton has 267 states and 373 transitions. Word has length 83 [2019-12-07 10:07:42,898 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 10:07:42,898 INFO L462 AbstractCegarLoop]: Abstraction has 267 states and 373 transitions. [2019-12-07 10:07:42,898 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 10:07:42,898 INFO L276 IsEmpty]: Start isEmpty. Operand 267 states and 373 transitions. [2019-12-07 10:07:42,899 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2019-12-07 10:07:42,899 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 10:07:42,899 INFO L410 BasicCegarLoop]: trace histogram [6, 6, 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] [2019-12-07 10:07:43,099 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 mathsat -unsat_core_generation=3 [2019-12-07 10:07:43,100 INFO L410 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 10:07:43,100 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 10:07:43,100 INFO L82 PathProgramCache]: Analyzing trace with hash -272398982, now seen corresponding path program 1 times [2019-12-07 10:07:43,100 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-12-07 10:07:43,101 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [689022440] [2019-12-07 10:07:43,101 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_b73ae0b1-f3a2-46c9-8e3b-fe3c43b0904d/bin/uautomizer/mathsat Starting monitored process 9 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with mathsat -unsat_core_generation=3 [2019-12-07 10:07:43,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 10:07:43,144 INFO L264 TraceCheckSpWp]: Trace formula consists of 156 conjuncts, 2 conjunts are in the unsatisfiable core [2019-12-07 10:07:43,146 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 10:07:43,160 INFO L134 CoverageAnalysis]: Checked inductivity of 135 backedges. 105 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2019-12-07 10:07:43,160 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 10:07:43,172 INFO L134 CoverageAnalysis]: Checked inductivity of 135 backedges. 105 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2019-12-07 10:07:43,172 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [689022440] [2019-12-07 10:07:43,173 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-12-07 10:07:43,173 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 4 [2019-12-07 10:07:43,173 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1712157732] [2019-12-07 10:07:43,173 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 10:07:43,173 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-12-07 10:07:43,173 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 10:07:43,173 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-07 10:07:43,174 INFO L87 Difference]: Start difference. First operand 267 states and 373 transitions. Second operand 4 states. [2019-12-07 10:07:43,210 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 10:07:43,210 INFO L93 Difference]: Finished difference Result 784 states and 1095 transitions. [2019-12-07 10:07:43,210 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 10:07:43,211 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 102 [2019-12-07 10:07:43,211 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 10:07:43,213 INFO L225 Difference]: With dead ends: 784 [2019-12-07 10:07:43,213 INFO L226 Difference]: Without dead ends: 526 [2019-12-07 10:07:43,214 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 202 GetRequests, 200 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-07 10:07:43,215 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 526 states. [2019-12-07 10:07:43,228 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 526 to 526. [2019-12-07 10:07:43,228 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 526 states. [2019-12-07 10:07:43,230 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 526 states to 526 states and 728 transitions. [2019-12-07 10:07:43,230 INFO L78 Accepts]: Start accepts. Automaton has 526 states and 728 transitions. Word has length 102 [2019-12-07 10:07:43,231 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 10:07:43,231 INFO L462 AbstractCegarLoop]: Abstraction has 526 states and 728 transitions. [2019-12-07 10:07:43,231 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 10:07:43,231 INFO L276 IsEmpty]: Start isEmpty. Operand 526 states and 728 transitions. [2019-12-07 10:07:43,232 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2019-12-07 10:07:43,232 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 10:07:43,233 INFO L410 BasicCegarLoop]: trace histogram [6, 6, 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] [2019-12-07 10:07:43,433 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 mathsat -unsat_core_generation=3 [2019-12-07 10:07:43,434 INFO L410 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 10:07:43,434 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 10:07:43,434 INFO L82 PathProgramCache]: Analyzing trace with hash 302681874, now seen corresponding path program 1 times [2019-12-07 10:07:43,435 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-12-07 10:07:43,435 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [632428653] [2019-12-07 10:07:43,435 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_b73ae0b1-f3a2-46c9-8e3b-fe3c43b0904d/bin/uautomizer/mathsat Starting monitored process 10 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with mathsat -unsat_core_generation=3 [2019-12-07 10:07:43,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 10:07:43,494 INFO L264 TraceCheckSpWp]: Trace formula consists of 155 conjuncts, 2 conjunts are in the unsatisfiable core [2019-12-07 10:07:43,495 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 10:07:43,505 INFO L134 CoverageAnalysis]: Checked inductivity of 135 backedges. 52 proven. 0 refuted. 0 times theorem prover too weak. 83 trivial. 0 not checked. [2019-12-07 10:07:43,506 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 10:07:43,514 INFO L134 CoverageAnalysis]: Checked inductivity of 135 backedges. 52 proven. 0 refuted. 0 times theorem prover too weak. 83 trivial. 0 not checked. [2019-12-07 10:07:43,515 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [632428653] [2019-12-07 10:07:43,515 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-12-07 10:07:43,515 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2, 2] imperfect sequences [] total 2 [2019-12-07 10:07:43,515 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1852835897] [2019-12-07 10:07:43,515 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 10:07:43,515 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-12-07 10:07:43,516 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 10:07:43,516 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 10:07:43,516 INFO L87 Difference]: Start difference. First operand 526 states and 728 transitions. Second operand 3 states. [2019-12-07 10:07:43,538 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 10:07:43,538 INFO L93 Difference]: Finished difference Result 1069 states and 1477 transitions. [2019-12-07 10:07:43,538 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 10:07:43,538 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 103 [2019-12-07 10:07:43,539 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 10:07:43,541 INFO L225 Difference]: With dead ends: 1069 [2019-12-07 10:07:43,542 INFO L226 Difference]: Without dead ends: 552 [2019-12-07 10:07:43,543 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 204 GetRequests, 203 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 10:07:43,544 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 552 states. [2019-12-07 10:07:43,555 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 552 to 552. [2019-12-07 10:07:43,556 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 552 states. [2019-12-07 10:07:43,558 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 552 states to 552 states and 761 transitions. [2019-12-07 10:07:43,558 INFO L78 Accepts]: Start accepts. Automaton has 552 states and 761 transitions. Word has length 103 [2019-12-07 10:07:43,558 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 10:07:43,558 INFO L462 AbstractCegarLoop]: Abstraction has 552 states and 761 transitions. [2019-12-07 10:07:43,558 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 10:07:43,558 INFO L276 IsEmpty]: Start isEmpty. Operand 552 states and 761 transitions. [2019-12-07 10:07:43,559 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2019-12-07 10:07:43,560 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 10:07:43,560 INFO L410 BasicCegarLoop]: trace histogram [6, 6, 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] [2019-12-07 10:07:43,760 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 mathsat -unsat_core_generation=3 [2019-12-07 10:07:43,761 INFO L410 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 10:07:43,761 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 10:07:43,761 INFO L82 PathProgramCache]: Analyzing trace with hash -1688750428, now seen corresponding path program 1 times [2019-12-07 10:07:43,761 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-12-07 10:07:43,761 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2117797750] [2019-12-07 10:07:43,761 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_b73ae0b1-f3a2-46c9-8e3b-fe3c43b0904d/bin/uautomizer/mathsat Starting monitored process 11 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with mathsat -unsat_core_generation=3 [2019-12-07 10:07:43,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 10:07:43,810 INFO L264 TraceCheckSpWp]: Trace formula consists of 159 conjuncts, 2 conjunts are in the unsatisfiable core [2019-12-07 10:07:43,813 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 10:07:43,824 INFO L134 CoverageAnalysis]: Checked inductivity of 135 backedges. 55 proven. 0 refuted. 0 times theorem prover too weak. 80 trivial. 0 not checked. [2019-12-07 10:07:43,824 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 10:07:43,835 INFO L134 CoverageAnalysis]: Checked inductivity of 135 backedges. 55 proven. 0 refuted. 0 times theorem prover too weak. 80 trivial. 0 not checked. [2019-12-07 10:07:43,835 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2117797750] [2019-12-07 10:07:43,835 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-12-07 10:07:43,835 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 4 [2019-12-07 10:07:43,836 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1023616094] [2019-12-07 10:07:43,836 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 10:07:43,836 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-12-07 10:07:43,836 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 10:07:43,836 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-07 10:07:43,836 INFO L87 Difference]: Start difference. First operand 552 states and 761 transitions. Second operand 4 states. [2019-12-07 10:07:43,891 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 10:07:43,891 INFO L93 Difference]: Finished difference Result 1519 states and 2112 transitions. [2019-12-07 10:07:43,892 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 10:07:43,892 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 104 [2019-12-07 10:07:43,892 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 10:07:43,897 INFO L225 Difference]: With dead ends: 1519 [2019-12-07 10:07:43,897 INFO L226 Difference]: Without dead ends: 1002 [2019-12-07 10:07:43,898 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 206 GetRequests, 204 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-07 10:07:43,900 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1002 states. [2019-12-07 10:07:43,921 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1002 to 1002. [2019-12-07 10:07:43,921 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1002 states. [2019-12-07 10:07:43,924 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1002 states to 1002 states and 1391 transitions. [2019-12-07 10:07:43,924 INFO L78 Accepts]: Start accepts. Automaton has 1002 states and 1391 transitions. Word has length 104 [2019-12-07 10:07:43,924 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 10:07:43,924 INFO L462 AbstractCegarLoop]: Abstraction has 1002 states and 1391 transitions. [2019-12-07 10:07:43,924 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 10:07:43,924 INFO L276 IsEmpty]: Start isEmpty. Operand 1002 states and 1391 transitions. [2019-12-07 10:07:43,926 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 173 [2019-12-07 10:07:43,926 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 10:07:43,926 INFO L410 BasicCegarLoop]: trace histogram [10, 10, 9, 9, 9, 9, 9, 9, 9, 7, 7, 5, 5, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 10:07:44,127 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 mathsat -unsat_core_generation=3 [2019-12-07 10:07:44,127 INFO L410 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 10:07:44,127 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 10:07:44,127 INFO L82 PathProgramCache]: Analyzing trace with hash 439361019, now seen corresponding path program 1 times [2019-12-07 10:07:44,128 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-12-07 10:07:44,128 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2033239960] [2019-12-07 10:07:44,128 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_b73ae0b1-f3a2-46c9-8e3b-fe3c43b0904d/bin/uautomizer/mathsat Starting monitored process 12 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with mathsat -unsat_core_generation=3 [2019-12-07 10:07:44,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 10:07:44,181 INFO L264 TraceCheckSpWp]: Trace formula consists of 238 conjuncts, 2 conjunts are in the unsatisfiable core [2019-12-07 10:07:44,183 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 10:07:44,212 INFO L134 CoverageAnalysis]: Checked inductivity of 470 backedges. 310 proven. 0 refuted. 0 times theorem prover too weak. 160 trivial. 0 not checked. [2019-12-07 10:07:44,213 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 10:07:44,253 INFO L134 CoverageAnalysis]: Checked inductivity of 470 backedges. 310 proven. 0 refuted. 0 times theorem prover too weak. 160 trivial. 0 not checked. [2019-12-07 10:07:44,254 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2033239960] [2019-12-07 10:07:44,254 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-12-07 10:07:44,254 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 4 [2019-12-07 10:07:44,254 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2036006462] [2019-12-07 10:07:44,255 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 10:07:44,255 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-12-07 10:07:44,255 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 10:07:44,255 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-07 10:07:44,255 INFO L87 Difference]: Start difference. First operand 1002 states and 1391 transitions. Second operand 4 states. [2019-12-07 10:07:44,423 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 10:07:44,423 INFO L93 Difference]: Finished difference Result 2090 states and 2937 transitions. [2019-12-07 10:07:44,423 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 10:07:44,423 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 172 [2019-12-07 10:07:44,424 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 10:07:44,428 INFO L225 Difference]: With dead ends: 2090 [2019-12-07 10:07:44,428 INFO L226 Difference]: Without dead ends: 1123 [2019-12-07 10:07:44,429 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 342 GetRequests, 340 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-07 10:07:44,430 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1123 states. [2019-12-07 10:07:44,447 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1123 to 1094. [2019-12-07 10:07:44,448 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1094 states. [2019-12-07 10:07:44,450 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1094 states to 1094 states and 1499 transitions. [2019-12-07 10:07:44,450 INFO L78 Accepts]: Start accepts. Automaton has 1094 states and 1499 transitions. Word has length 172 [2019-12-07 10:07:44,450 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 10:07:44,450 INFO L462 AbstractCegarLoop]: Abstraction has 1094 states and 1499 transitions. [2019-12-07 10:07:44,450 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 10:07:44,450 INFO L276 IsEmpty]: Start isEmpty. Operand 1094 states and 1499 transitions. [2019-12-07 10:07:44,452 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 194 [2019-12-07 10:07:44,453 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 10:07:44,453 INFO L410 BasicCegarLoop]: trace histogram [11, 11, 10, 10, 10, 10, 10, 10, 10, 8, 8, 6, 6, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 10:07:44,653 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 mathsat -unsat_core_generation=3 [2019-12-07 10:07:44,653 INFO L410 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 10:07:44,654 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 10:07:44,654 INFO L82 PathProgramCache]: Analyzing trace with hash -1444142562, now seen corresponding path program 1 times [2019-12-07 10:07:44,654 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-12-07 10:07:44,654 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1549633493] [2019-12-07 10:07:44,654 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_b73ae0b1-f3a2-46c9-8e3b-fe3c43b0904d/bin/uautomizer/mathsat Starting monitored process 13 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with mathsat -unsat_core_generation=3 [2019-12-07 10:07:44,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 10:07:44,716 INFO L264 TraceCheckSpWp]: Trace formula consists of 261 conjuncts, 4 conjunts are in the unsatisfiable core [2019-12-07 10:07:44,718 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 10:07:44,758 INFO L134 CoverageAnalysis]: Checked inductivity of 597 backedges. 456 proven. 20 refuted. 0 times theorem prover too weak. 121 trivial. 0 not checked. [2019-12-07 10:07:44,758 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 10:07:44,804 INFO L134 CoverageAnalysis]: Checked inductivity of 597 backedges. 440 proven. 36 refuted. 0 times theorem prover too weak. 121 trivial. 0 not checked. [2019-12-07 10:07:44,804 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1549633493] [2019-12-07 10:07:44,804 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-07 10:07:44,804 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 8 [2019-12-07 10:07:44,805 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [556890054] [2019-12-07 10:07:44,805 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-12-07 10:07:44,805 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-12-07 10:07:44,805 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-12-07 10:07:44,805 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2019-12-07 10:07:44,805 INFO L87 Difference]: Start difference. First operand 1094 states and 1499 transitions. Second operand 8 states. [2019-12-07 10:07:45,297 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 10:07:45,297 INFO L93 Difference]: Finished difference Result 2571 states and 3549 transitions. [2019-12-07 10:07:45,297 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-12-07 10:07:45,298 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 193 [2019-12-07 10:07:45,298 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 10:07:45,303 INFO L225 Difference]: With dead ends: 2571 [2019-12-07 10:07:45,303 INFO L226 Difference]: Without dead ends: 1512 [2019-12-07 10:07:45,305 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 390 GetRequests, 381 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=41, Invalid=69, Unknown=0, NotChecked=0, Total=110 [2019-12-07 10:07:45,306 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1512 states. [2019-12-07 10:07:45,331 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1512 to 1403. [2019-12-07 10:07:45,331 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1403 states. [2019-12-07 10:07:45,334 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1403 states to 1403 states and 1913 transitions. [2019-12-07 10:07:45,334 INFO L78 Accepts]: Start accepts. Automaton has 1403 states and 1913 transitions. Word has length 193 [2019-12-07 10:07:45,334 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 10:07:45,334 INFO L462 AbstractCegarLoop]: Abstraction has 1403 states and 1913 transitions. [2019-12-07 10:07:45,334 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-12-07 10:07:45,334 INFO L276 IsEmpty]: Start isEmpty. Operand 1403 states and 1913 transitions. [2019-12-07 10:07:45,337 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 219 [2019-12-07 10:07:45,337 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 10:07:45,337 INFO L410 BasicCegarLoop]: trace histogram [12, 12, 11, 11, 11, 11, 11, 11, 11, 10, 9, 7, 7, 5, 5, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 10:07:45,538 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 mathsat -unsat_core_generation=3 [2019-12-07 10:07:45,538 INFO L410 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 10:07:45,538 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 10:07:45,538 INFO L82 PathProgramCache]: Analyzing trace with hash 975443763, now seen corresponding path program 1 times [2019-12-07 10:07:45,539 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-12-07 10:07:45,539 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [45994391] [2019-12-07 10:07:45,539 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_b73ae0b1-f3a2-46c9-8e3b-fe3c43b0904d/bin/uautomizer/mathsat Starting monitored process 14 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 14 with mathsat -unsat_core_generation=3 [2019-12-07 10:07:45,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 10:07:45,605 INFO L264 TraceCheckSpWp]: Trace formula consists of 287 conjuncts, 2 conjunts are in the unsatisfiable core [2019-12-07 10:07:45,606 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 10:07:45,631 INFO L134 CoverageAnalysis]: Checked inductivity of 749 backedges. 461 proven. 0 refuted. 0 times theorem prover too weak. 288 trivial. 0 not checked. [2019-12-07 10:07:45,631 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 10:07:45,669 INFO L134 CoverageAnalysis]: Checked inductivity of 749 backedges. 461 proven. 0 refuted. 0 times theorem prover too weak. 288 trivial. 0 not checked. [2019-12-07 10:07:45,670 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [45994391] [2019-12-07 10:07:45,670 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-12-07 10:07:45,670 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 4 [2019-12-07 10:07:45,670 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1838795346] [2019-12-07 10:07:45,671 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 10:07:45,671 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-12-07 10:07:45,671 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 10:07:45,671 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-07 10:07:45,671 INFO L87 Difference]: Start difference. First operand 1403 states and 1913 transitions. Second operand 4 states. [2019-12-07 10:07:45,865 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 10:07:45,865 INFO L93 Difference]: Finished difference Result 2920 states and 4032 transitions. [2019-12-07 10:07:45,865 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 10:07:45,865 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 218 [2019-12-07 10:07:45,866 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 10:07:45,871 INFO L225 Difference]: With dead ends: 2920 [2019-12-07 10:07:45,871 INFO L226 Difference]: Without dead ends: 1573 [2019-12-07 10:07:45,872 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 434 GetRequests, 432 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-07 10:07:45,874 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1573 states. [2019-12-07 10:07:45,899 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1573 to 1543. [2019-12-07 10:07:45,899 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1543 states. [2019-12-07 10:07:45,902 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1543 states to 1543 states and 2073 transitions. [2019-12-07 10:07:45,902 INFO L78 Accepts]: Start accepts. Automaton has 1543 states and 2073 transitions. Word has length 218 [2019-12-07 10:07:45,902 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 10:07:45,902 INFO L462 AbstractCegarLoop]: Abstraction has 1543 states and 2073 transitions. [2019-12-07 10:07:45,902 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 10:07:45,902 INFO L276 IsEmpty]: Start isEmpty. Operand 1543 states and 2073 transitions. [2019-12-07 10:07:45,905 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 230 [2019-12-07 10:07:45,905 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 10:07:45,905 INFO L410 BasicCegarLoop]: trace histogram [13, 13, 12, 12, 11, 11, 11, 11, 11, 9, 9, 7, 7, 5, 5, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 10:07:46,105 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 mathsat -unsat_core_generation=3 [2019-12-07 10:07:46,106 INFO L410 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 10:07:46,106 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 10:07:46,106 INFO L82 PathProgramCache]: Analyzing trace with hash -1205507187, now seen corresponding path program 1 times [2019-12-07 10:07:46,106 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-12-07 10:07:46,107 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [73347060] [2019-12-07 10:07:46,107 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_b73ae0b1-f3a2-46c9-8e3b-fe3c43b0904d/bin/uautomizer/mathsat Starting monitored process 15 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 15 with mathsat -unsat_core_generation=3 [2019-12-07 10:07:46,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 10:07:46,178 INFO L264 TraceCheckSpWp]: Trace formula consists of 304 conjuncts, 2 conjunts are in the unsatisfiable core [2019-12-07 10:07:46,181 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 10:07:46,211 INFO L134 CoverageAnalysis]: Checked inductivity of 805 backedges. 477 proven. 0 refuted. 0 times theorem prover too weak. 328 trivial. 0 not checked. [2019-12-07 10:07:46,211 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 10:07:46,240 INFO L134 CoverageAnalysis]: Checked inductivity of 805 backedges. 477 proven. 0 refuted. 0 times theorem prover too weak. 328 trivial. 0 not checked. [2019-12-07 10:07:46,240 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [73347060] [2019-12-07 10:07:46,240 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-12-07 10:07:46,241 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 4 [2019-12-07 10:07:46,241 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [100356751] [2019-12-07 10:07:46,241 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 10:07:46,241 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-12-07 10:07:46,241 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 10:07:46,241 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-07 10:07:46,242 INFO L87 Difference]: Start difference. First operand 1543 states and 2073 transitions. Second operand 4 states. [2019-12-07 10:07:46,407 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 10:07:46,407 INFO L93 Difference]: Finished difference Result 3200 states and 4368 transitions. [2019-12-07 10:07:46,408 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 10:07:46,408 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 229 [2019-12-07 10:07:46,408 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 10:07:46,414 INFO L225 Difference]: With dead ends: 3200 [2019-12-07 10:07:46,414 INFO L226 Difference]: Without dead ends: 1713 [2019-12-07 10:07:46,416 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 456 GetRequests, 454 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-07 10:07:46,417 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1713 states. [2019-12-07 10:07:46,444 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1713 to 1698. [2019-12-07 10:07:46,444 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1698 states. [2019-12-07 10:07:46,447 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1698 states to 1698 states and 2248 transitions. [2019-12-07 10:07:46,447 INFO L78 Accepts]: Start accepts. Automaton has 1698 states and 2248 transitions. Word has length 229 [2019-12-07 10:07:46,447 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 10:07:46,447 INFO L462 AbstractCegarLoop]: Abstraction has 1698 states and 2248 transitions. [2019-12-07 10:07:46,447 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 10:07:46,447 INFO L276 IsEmpty]: Start isEmpty. Operand 1698 states and 2248 transitions. [2019-12-07 10:07:46,451 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 260 [2019-12-07 10:07:46,451 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 10:07:46,451 INFO L410 BasicCegarLoop]: trace histogram [14, 14, 13, 13, 13, 12, 12, 12, 12, 10, 10, 8, 8, 6, 6, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 10:07:46,651 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 mathsat -unsat_core_generation=3 [2019-12-07 10:07:46,652 INFO L410 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 10:07:46,652 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 10:07:46,652 INFO L82 PathProgramCache]: Analyzing trace with hash 926940847, now seen corresponding path program 1 times [2019-12-07 10:07:46,652 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-12-07 10:07:46,652 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [373730126] [2019-12-07 10:07:46,652 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_b73ae0b1-f3a2-46c9-8e3b-fe3c43b0904d/bin/uautomizer/mathsat Starting monitored process 16 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 16 with mathsat -unsat_core_generation=3 [2019-12-07 10:07:46,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 10:07:46,720 INFO L264 TraceCheckSpWp]: Trace formula consists of 335 conjuncts, 2 conjunts are in the unsatisfiable core [2019-12-07 10:07:46,722 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 10:07:46,762 INFO L134 CoverageAnalysis]: Checked inductivity of 984 backedges. 563 proven. 0 refuted. 0 times theorem prover too weak. 421 trivial. 0 not checked. [2019-12-07 10:07:46,762 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 10:07:46,801 INFO L134 CoverageAnalysis]: Checked inductivity of 984 backedges. 563 proven. 0 refuted. 0 times theorem prover too weak. 421 trivial. 0 not checked. [2019-12-07 10:07:46,801 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [373730126] [2019-12-07 10:07:46,801 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-12-07 10:07:46,801 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 4 [2019-12-07 10:07:46,801 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1151194996] [2019-12-07 10:07:46,802 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 10:07:46,802 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-12-07 10:07:46,802 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 10:07:46,802 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-07 10:07:46,802 INFO L87 Difference]: Start difference. First operand 1698 states and 2248 transitions. Second operand 4 states. [2019-12-07 10:07:46,987 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 10:07:46,987 INFO L93 Difference]: Finished difference Result 3575 states and 4803 transitions. [2019-12-07 10:07:46,988 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 10:07:46,988 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 259 [2019-12-07 10:07:46,988 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 10:07:46,996 INFO L225 Difference]: With dead ends: 3575 [2019-12-07 10:07:46,997 INFO L226 Difference]: Without dead ends: 1933 [2019-12-07 10:07:46,999 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 516 GetRequests, 514 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-07 10:07:47,001 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1933 states. [2019-12-07 10:07:47,041 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1933 to 1883. [2019-12-07 10:07:47,041 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1883 states. [2019-12-07 10:07:47,044 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1883 states to 1883 states and 2453 transitions. [2019-12-07 10:07:47,045 INFO L78 Accepts]: Start accepts. Automaton has 1883 states and 2453 transitions. Word has length 259 [2019-12-07 10:07:47,045 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 10:07:47,045 INFO L462 AbstractCegarLoop]: Abstraction has 1883 states and 2453 transitions. [2019-12-07 10:07:47,045 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 10:07:47,045 INFO L276 IsEmpty]: Start isEmpty. Operand 1883 states and 2453 transitions. [2019-12-07 10:07:47,049 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 261 [2019-12-07 10:07:47,049 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 10:07:47,049 INFO L410 BasicCegarLoop]: trace histogram [14, 14, 13, 13, 13, 13, 12, 12, 12, 10, 10, 8, 8, 6, 6, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 10:07:47,250 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 mathsat -unsat_core_generation=3 [2019-12-07 10:07:47,250 INFO L410 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 10:07:47,250 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 10:07:47,250 INFO L82 PathProgramCache]: Analyzing trace with hash 790534677, now seen corresponding path program 1 times [2019-12-07 10:07:47,251 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-12-07 10:07:47,251 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [979858313] [2019-12-07 10:07:47,251 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_b73ae0b1-f3a2-46c9-8e3b-fe3c43b0904d/bin/uautomizer/mathsat Starting monitored process 17 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 17 with mathsat -unsat_core_generation=3 [2019-12-07 10:07:47,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 10:07:47,354 INFO L264 TraceCheckSpWp]: Trace formula consists of 335 conjuncts, 2 conjunts are in the unsatisfiable core [2019-12-07 10:07:47,357 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 10:07:47,391 INFO L134 CoverageAnalysis]: Checked inductivity of 996 backedges. 633 proven. 0 refuted. 0 times theorem prover too weak. 363 trivial. 0 not checked. [2019-12-07 10:07:47,392 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 10:07:47,432 INFO L134 CoverageAnalysis]: Checked inductivity of 996 backedges. 633 proven. 0 refuted. 0 times theorem prover too weak. 363 trivial. 0 not checked. [2019-12-07 10:07:47,432 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [979858313] [2019-12-07 10:07:47,432 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-12-07 10:07:47,432 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 4 [2019-12-07 10:07:47,432 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [118764489] [2019-12-07 10:07:47,433 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 10:07:47,433 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-12-07 10:07:47,433 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 10:07:47,433 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-07 10:07:47,433 INFO L87 Difference]: Start difference. First operand 1883 states and 2453 transitions. Second operand 4 states. [2019-12-07 10:07:47,502 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 10:07:47,502 INFO L93 Difference]: Finished difference Result 7199 states and 9403 transitions. [2019-12-07 10:07:47,502 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 10:07:47,502 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 260 [2019-12-07 10:07:47,503 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 10:07:47,520 INFO L225 Difference]: With dead ends: 7199 [2019-12-07 10:07:47,520 INFO L226 Difference]: Without dead ends: 5372 [2019-12-07 10:07:47,522 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 518 GetRequests, 516 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-07 10:07:47,527 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5372 states. [2019-12-07 10:07:47,603 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5372 to 5368. [2019-12-07 10:07:47,603 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5368 states. [2019-12-07 10:07:47,610 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5368 states to 5368 states and 7006 transitions. [2019-12-07 10:07:47,611 INFO L78 Accepts]: Start accepts. Automaton has 5368 states and 7006 transitions. Word has length 260 [2019-12-07 10:07:47,611 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 10:07:47,611 INFO L462 AbstractCegarLoop]: Abstraction has 5368 states and 7006 transitions. [2019-12-07 10:07:47,611 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 10:07:47,611 INFO L276 IsEmpty]: Start isEmpty. Operand 5368 states and 7006 transitions. [2019-12-07 10:07:47,619 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 285 [2019-12-07 10:07:47,619 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 10:07:47,619 INFO L410 BasicCegarLoop]: trace histogram [15, 15, 14, 14, 14, 14, 13, 13, 13, 11, 11, 9, 9, 7, 7, 5, 5, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 10:07:47,819 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 mathsat -unsat_core_generation=3 [2019-12-07 10:07:47,820 INFO L410 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 10:07:47,820 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 10:07:47,820 INFO L82 PathProgramCache]: Analyzing trace with hash 1455171307, now seen corresponding path program 1 times [2019-12-07 10:07:47,821 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-12-07 10:07:47,821 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [838404170] [2019-12-07 10:07:47,821 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_b73ae0b1-f3a2-46c9-8e3b-fe3c43b0904d/bin/uautomizer/mathsat Starting monitored process 18 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 18 with mathsat -unsat_core_generation=3 [2019-12-07 10:07:47,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 10:07:47,936 INFO L264 TraceCheckSpWp]: Trace formula consists of 361 conjuncts, 2 conjunts are in the unsatisfiable core [2019-12-07 10:07:47,938 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 10:07:47,977 INFO L134 CoverageAnalysis]: Checked inductivity of 1188 backedges. 652 proven. 0 refuted. 0 times theorem prover too weak. 536 trivial. 0 not checked. [2019-12-07 10:07:47,977 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 10:07:48,042 INFO L134 CoverageAnalysis]: Checked inductivity of 1188 backedges. 652 proven. 0 refuted. 0 times theorem prover too weak. 536 trivial. 0 not checked. [2019-12-07 10:07:48,042 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [838404170] [2019-12-07 10:07:48,042 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-12-07 10:07:48,042 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 4 [2019-12-07 10:07:48,043 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [945971211] [2019-12-07 10:07:48,043 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 10:07:48,043 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-12-07 10:07:48,043 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 10:07:48,043 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-07 10:07:48,043 INFO L87 Difference]: Start difference. First operand 5368 states and 7006 transitions. Second operand 4 states. [2019-12-07 10:07:48,230 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 10:07:48,230 INFO L93 Difference]: Finished difference Result 10995 states and 14404 transitions. [2019-12-07 10:07:48,231 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 10:07:48,231 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 284 [2019-12-07 10:07:48,231 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 10:07:48,253 INFO L225 Difference]: With dead ends: 10995 [2019-12-07 10:07:48,253 INFO L226 Difference]: Without dead ends: 5683 [2019-12-07 10:07:48,256 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 566 GetRequests, 564 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-07 10:07:48,261 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5683 states. [2019-12-07 10:07:48,337 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5683 to 5533. [2019-12-07 10:07:48,337 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5533 states. [2019-12-07 10:07:48,344 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5533 states to 5533 states and 7181 transitions. [2019-12-07 10:07:48,344 INFO L78 Accepts]: Start accepts. Automaton has 5533 states and 7181 transitions. Word has length 284 [2019-12-07 10:07:48,344 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 10:07:48,345 INFO L462 AbstractCegarLoop]: Abstraction has 5533 states and 7181 transitions. [2019-12-07 10:07:48,345 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 10:07:48,345 INFO L276 IsEmpty]: Start isEmpty. Operand 5533 states and 7181 transitions. [2019-12-07 10:07:48,352 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 297 [2019-12-07 10:07:48,352 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 10:07:48,352 INFO L410 BasicCegarLoop]: trace histogram [15, 15, 14, 14, 14, 14, 14, 13, 13, 11, 11, 9, 9, 7, 7, 5, 5, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 10:07:48,553 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 18 mathsat -unsat_core_generation=3 [2019-12-07 10:07:48,553 INFO L410 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 10:07:48,554 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 10:07:48,554 INFO L82 PathProgramCache]: Analyzing trace with hash 1908177262, now seen corresponding path program 1 times [2019-12-07 10:07:48,555 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-12-07 10:07:48,555 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2105786864] [2019-12-07 10:07:48,555 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_b73ae0b1-f3a2-46c9-8e3b-fe3c43b0904d/bin/uautomizer/mathsat Starting monitored process 19 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 19 with mathsat -unsat_core_generation=3 [2019-12-07 10:07:48,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 10:07:48,656 INFO L264 TraceCheckSpWp]: Trace formula consists of 376 conjuncts, 2 conjunts are in the unsatisfiable core [2019-12-07 10:07:48,658 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 10:07:48,699 INFO L134 CoverageAnalysis]: Checked inductivity of 1205 backedges. 665 proven. 0 refuted. 0 times theorem prover too weak. 540 trivial. 0 not checked. [2019-12-07 10:07:48,699 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 10:07:48,743 INFO L134 CoverageAnalysis]: Checked inductivity of 1205 backedges. 665 proven. 0 refuted. 0 times theorem prover too weak. 540 trivial. 0 not checked. [2019-12-07 10:07:48,743 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2105786864] [2019-12-07 10:07:48,744 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-12-07 10:07:48,744 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 4 [2019-12-07 10:07:48,744 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [310927223] [2019-12-07 10:07:48,744 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 10:07:48,744 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-12-07 10:07:48,745 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 10:07:48,745 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-07 10:07:48,745 INFO L87 Difference]: Start difference. First operand 5533 states and 7181 transitions. Second operand 4 states. [2019-12-07 10:07:48,924 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 10:07:48,924 INFO L93 Difference]: Finished difference Result 11715 states and 15429 transitions. [2019-12-07 10:07:48,924 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 10:07:48,924 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 296 [2019-12-07 10:07:48,925 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 10:07:48,948 INFO L225 Difference]: With dead ends: 11715 [2019-12-07 10:07:48,948 INFO L226 Difference]: Without dead ends: 6238 [2019-12-07 10:07:48,953 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 590 GetRequests, 588 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-07 10:07:48,957 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6238 states. [2019-12-07 10:07:49,038 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6238 to 6088. [2019-12-07 10:07:49,038 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6088 states. [2019-12-07 10:07:49,043 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6088 states to 6088 states and 7796 transitions. [2019-12-07 10:07:49,043 INFO L78 Accepts]: Start accepts. Automaton has 6088 states and 7796 transitions. Word has length 296 [2019-12-07 10:07:49,044 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 10:07:49,044 INFO L462 AbstractCegarLoop]: Abstraction has 6088 states and 7796 transitions. [2019-12-07 10:07:49,044 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 10:07:49,044 INFO L276 IsEmpty]: Start isEmpty. Operand 6088 states and 7796 transitions. [2019-12-07 10:07:49,049 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 334 [2019-12-07 10:07:49,049 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 10:07:49,050 INFO L410 BasicCegarLoop]: trace histogram [16, 16, 15, 15, 15, 15, 15, 15, 14, 12, 12, 10, 10, 8, 8, 6, 6, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 10:07:49,250 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 19 mathsat -unsat_core_generation=3 [2019-12-07 10:07:49,250 INFO L410 AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 10:07:49,250 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 10:07:49,251 INFO L82 PathProgramCache]: Analyzing trace with hash 1858495225, now seen corresponding path program 1 times [2019-12-07 10:07:49,252 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-12-07 10:07:49,252 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [307685103] [2019-12-07 10:07:49,252 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_b73ae0b1-f3a2-46c9-8e3b-fe3c43b0904d/bin/uautomizer/mathsat Starting monitored process 20 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 20 with mathsat -unsat_core_generation=3 [2019-12-07 10:07:49,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 10:07:49,365 INFO L264 TraceCheckSpWp]: Trace formula consists of 416 conjuncts, 2 conjunts are in the unsatisfiable core [2019-12-07 10:07:49,369 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 10:07:49,435 INFO L134 CoverageAnalysis]: Checked inductivity of 1446 backedges. 757 proven. 0 refuted. 0 times theorem prover too weak. 689 trivial. 0 not checked. [2019-12-07 10:07:49,435 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 10:07:49,486 INFO L134 CoverageAnalysis]: Checked inductivity of 1446 backedges. 757 proven. 0 refuted. 0 times theorem prover too weak. 689 trivial. 0 not checked. [2019-12-07 10:07:49,487 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [307685103] [2019-12-07 10:07:49,487 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-12-07 10:07:49,487 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 4 [2019-12-07 10:07:49,487 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1734559248] [2019-12-07 10:07:49,488 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 10:07:49,488 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-12-07 10:07:49,488 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 10:07:49,488 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-07 10:07:49,488 INFO L87 Difference]: Start difference. First operand 6088 states and 7796 transitions. Second operand 4 states. [2019-12-07 10:07:49,680 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 10:07:49,680 INFO L93 Difference]: Finished difference Result 12870 states and 16734 transitions. [2019-12-07 10:07:49,680 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 10:07:49,680 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 333 [2019-12-07 10:07:49,681 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 10:07:49,688 INFO L225 Difference]: With dead ends: 12870 [2019-12-07 10:07:49,688 INFO L226 Difference]: Without dead ends: 6838 [2019-12-07 10:07:49,692 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 664 GetRequests, 662 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-07 10:07:49,697 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6838 states. [2019-12-07 10:07:49,778 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6838 to 6703. [2019-12-07 10:07:49,779 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6703 states. [2019-12-07 10:07:49,788 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6703 states to 6703 states and 8471 transitions. [2019-12-07 10:07:49,788 INFO L78 Accepts]: Start accepts. Automaton has 6703 states and 8471 transitions. Word has length 333 [2019-12-07 10:07:49,788 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 10:07:49,789 INFO L462 AbstractCegarLoop]: Abstraction has 6703 states and 8471 transitions. [2019-12-07 10:07:49,789 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 10:07:49,789 INFO L276 IsEmpty]: Start isEmpty. Operand 6703 states and 8471 transitions. [2019-12-07 10:07:49,798 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 357 [2019-12-07 10:07:49,798 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 10:07:49,799 INFO L410 BasicCegarLoop]: trace histogram [16, 16, 15, 15, 15, 15, 15, 15, 15, 13, 13, 11, 11, 9, 9, 7, 7, 5, 5, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 10:07:49,999 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 20 mathsat -unsat_core_generation=3 [2019-12-07 10:07:49,999 INFO L410 AbstractCegarLoop]: === Iteration 20 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 10:07:49,999 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 10:07:49,999 INFO L82 PathProgramCache]: Analyzing trace with hash -1851925234, now seen corresponding path program 1 times [2019-12-07 10:07:50,000 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-12-07 10:07:50,000 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [233006247] [2019-12-07 10:07:50,001 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_b73ae0b1-f3a2-46c9-8e3b-fe3c43b0904d/bin/uautomizer/mathsat Starting monitored process 21 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 21 with mathsat -unsat_core_generation=3 [2019-12-07 10:07:50,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 10:07:50,106 INFO L264 TraceCheckSpWp]: Trace formula consists of 435 conjuncts, 3 conjunts are in the unsatisfiable core [2019-12-07 10:07:50,109 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 10:07:50,201 INFO L134 CoverageAnalysis]: Checked inductivity of 1562 backedges. 903 proven. 10 refuted. 0 times theorem prover too weak. 649 trivial. 0 not checked. [2019-12-07 10:07:50,201 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 10:07:50,271 INFO L134 CoverageAnalysis]: Checked inductivity of 1562 backedges. 903 proven. 10 refuted. 0 times theorem prover too weak. 649 trivial. 0 not checked. [2019-12-07 10:07:50,271 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [233006247] [2019-12-07 10:07:50,271 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-07 10:07:50,271 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 6 [2019-12-07 10:07:50,271 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [442175749] [2019-12-07 10:07:50,272 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-07 10:07:50,272 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-12-07 10:07:50,272 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-07 10:07:50,272 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-12-07 10:07:50,272 INFO L87 Difference]: Start difference. First operand 6703 states and 8471 transitions. Second operand 6 states. [2019-12-07 10:07:50,828 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 10:07:50,828 INFO L93 Difference]: Finished difference Result 21874 states and 27686 transitions. [2019-12-07 10:07:50,829 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-12-07 10:07:50,829 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 356 [2019-12-07 10:07:50,829 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 10:07:50,848 INFO L225 Difference]: With dead ends: 21874 [2019-12-07 10:07:50,848 INFO L226 Difference]: Without dead ends: 15227 [2019-12-07 10:07:50,855 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 718 GetRequests, 710 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=36, Invalid=54, Unknown=0, NotChecked=0, Total=90 [2019-12-07 10:07:50,868 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15227 states. [2019-12-07 10:07:51,019 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15227 to 9231. [2019-12-07 10:07:51,019 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9231 states. [2019-12-07 10:07:51,027 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9231 states to 9231 states and 11822 transitions. [2019-12-07 10:07:51,027 INFO L78 Accepts]: Start accepts. Automaton has 9231 states and 11822 transitions. Word has length 356 [2019-12-07 10:07:51,027 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 10:07:51,027 INFO L462 AbstractCegarLoop]: Abstraction has 9231 states and 11822 transitions. [2019-12-07 10:07:51,027 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-07 10:07:51,027 INFO L276 IsEmpty]: Start isEmpty. Operand 9231 states and 11822 transitions. [2019-12-07 10:07:51,036 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 359 [2019-12-07 10:07:51,037 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 10:07:51,037 INFO L410 BasicCegarLoop]: trace histogram [16, 16, 15, 15, 15, 15, 15, 15, 15, 14, 13, 11, 11, 9, 9, 7, 7, 5, 5, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 10:07:51,237 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 21 mathsat -unsat_core_generation=3 [2019-12-07 10:07:51,237 INFO L410 AbstractCegarLoop]: === Iteration 21 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 10:07:51,238 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 10:07:51,238 INFO L82 PathProgramCache]: Analyzing trace with hash -1715121415, now seen corresponding path program 1 times [2019-12-07 10:07:51,239 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-12-07 10:07:51,239 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1477827325] [2019-12-07 10:07:51,239 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_b73ae0b1-f3a2-46c9-8e3b-fe3c43b0904d/bin/uautomizer/mathsat Starting monitored process 22 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 22 with mathsat -unsat_core_generation=3 [2019-12-07 10:07:51,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 10:07:51,346 INFO L264 TraceCheckSpWp]: Trace formula consists of 440 conjuncts, 2 conjunts are in the unsatisfiable core [2019-12-07 10:07:51,349 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 10:07:51,417 INFO L134 CoverageAnalysis]: Checked inductivity of 1575 backedges. 928 proven. 0 refuted. 0 times theorem prover too weak. 647 trivial. 0 not checked. [2019-12-07 10:07:51,417 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 10:07:51,484 INFO L134 CoverageAnalysis]: Checked inductivity of 1575 backedges. 928 proven. 0 refuted. 0 times theorem prover too weak. 647 trivial. 0 not checked. [2019-12-07 10:07:51,484 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1477827325] [2019-12-07 10:07:51,484 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-12-07 10:07:51,484 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 3 [2019-12-07 10:07:51,484 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [614517203] [2019-12-07 10:07:51,485 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 10:07:51,485 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-12-07 10:07:51,485 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 10:07:51,485 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 10:07:51,485 INFO L87 Difference]: Start difference. First operand 9231 states and 11822 transitions. Second operand 3 states. [2019-12-07 10:07:51,596 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 10:07:51,596 INFO L93 Difference]: Finished difference Result 19628 states and 24778 transitions. [2019-12-07 10:07:51,596 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 10:07:51,596 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 358 [2019-12-07 10:07:51,597 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 10:07:51,607 INFO L225 Difference]: With dead ends: 19628 [2019-12-07 10:07:51,607 INFO L226 Difference]: Without dead ends: 10453 [2019-12-07 10:07:51,613 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 714 GetRequests, 713 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 10:07:51,622 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10453 states. [2019-12-07 10:07:51,749 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10453 to 10023. [2019-12-07 10:07:51,749 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10023 states. [2019-12-07 10:07:51,757 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10023 states to 10023 states and 12494 transitions. [2019-12-07 10:07:51,757 INFO L78 Accepts]: Start accepts. Automaton has 10023 states and 12494 transitions. Word has length 358 [2019-12-07 10:07:51,757 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 10:07:51,757 INFO L462 AbstractCegarLoop]: Abstraction has 10023 states and 12494 transitions. [2019-12-07 10:07:51,758 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 10:07:51,758 INFO L276 IsEmpty]: Start isEmpty. Operand 10023 states and 12494 transitions. [2019-12-07 10:07:51,767 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 434 [2019-12-07 10:07:51,767 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 10:07:51,768 INFO L410 BasicCegarLoop]: trace histogram [17, 17, 16, 16, 16, 16, 16, 16, 16, 15, 14, 12, 12, 11, 11, 10, 10, 9, 8, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 10:07:51,968 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 22 mathsat -unsat_core_generation=3 [2019-12-07 10:07:51,968 INFO L410 AbstractCegarLoop]: === Iteration 22 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 10:07:51,968 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 10:07:51,969 INFO L82 PathProgramCache]: Analyzing trace with hash 1353488943, now seen corresponding path program 1 times [2019-12-07 10:07:51,969 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-12-07 10:07:51,969 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [657838574] [2019-12-07 10:07:51,969 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_b73ae0b1-f3a2-46c9-8e3b-fe3c43b0904d/bin/uautomizer/mathsat Starting monitored process 23 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 23 with mathsat -unsat_core_generation=3 [2019-12-07 10:07:52,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 10:07:52,059 INFO L264 TraceCheckSpWp]: Trace formula consists of 520 conjuncts, 2 conjunts are in the unsatisfiable core [2019-12-07 10:07:52,063 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 10:07:52,225 INFO L134 CoverageAnalysis]: Checked inductivity of 2061 backedges. 1034 proven. 0 refuted. 0 times theorem prover too weak. 1027 trivial. 0 not checked. [2019-12-07 10:07:52,226 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 10:07:52,356 INFO L134 CoverageAnalysis]: Checked inductivity of 2061 backedges. 1034 proven. 0 refuted. 0 times theorem prover too weak. 1027 trivial. 0 not checked. [2019-12-07 10:07:52,357 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [657838574] [2019-12-07 10:07:52,357 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-12-07 10:07:52,357 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 3 [2019-12-07 10:07:52,357 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2114514675] [2019-12-07 10:07:52,357 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 10:07:52,358 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-12-07 10:07:52,358 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 10:07:52,358 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 10:07:52,358 INFO L87 Difference]: Start difference. First operand 10023 states and 12494 transitions. Second operand 3 states. [2019-12-07 10:07:52,463 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 10:07:52,463 INFO L93 Difference]: Finished difference Result 15257 states and 19065 transitions. [2019-12-07 10:07:52,463 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 10:07:52,463 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 433 [2019-12-07 10:07:52,464 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 10:07:52,468 INFO L225 Difference]: With dead ends: 15257 [2019-12-07 10:07:52,468 INFO L226 Difference]: Without dead ends: 6495 [2019-12-07 10:07:52,473 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 864 GetRequests, 863 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 10:07:52,477 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6495 states. [2019-12-07 10:07:52,562 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6495 to 6493. [2019-12-07 10:07:52,562 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6493 states. [2019-12-07 10:07:52,567 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6493 states to 6493 states and 8174 transitions. [2019-12-07 10:07:52,567 INFO L78 Accepts]: Start accepts. Automaton has 6493 states and 8174 transitions. Word has length 433 [2019-12-07 10:07:52,567 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 10:07:52,568 INFO L462 AbstractCegarLoop]: Abstraction has 6493 states and 8174 transitions. [2019-12-07 10:07:52,568 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 10:07:52,568 INFO L276 IsEmpty]: Start isEmpty. Operand 6493 states and 8174 transitions. [2019-12-07 10:07:52,575 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 544 [2019-12-07 10:07:52,575 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 10:07:52,575 INFO L410 BasicCegarLoop]: trace histogram [20, 20, 19, 19, 19, 19, 19, 19, 19, 18, 17, 15, 15, 14, 14, 13, 13, 12, 11, 10, 10, 10, 10, 10, 10, 9, 9, 9, 9, 6, 6, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 10:07:52,775 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 23 mathsat -unsat_core_generation=3 [2019-12-07 10:07:52,776 INFO L410 AbstractCegarLoop]: === Iteration 23 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 10:07:52,776 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 10:07:52,776 INFO L82 PathProgramCache]: Analyzing trace with hash 1635223835, now seen corresponding path program 1 times [2019-12-07 10:07:52,778 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-12-07 10:07:52,778 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [679622543] [2019-12-07 10:07:52,778 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_b73ae0b1-f3a2-46c9-8e3b-fe3c43b0904d/bin/uautomizer/mathsat Starting monitored process 24 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 24 with mathsat -unsat_core_generation=3 [2019-12-07 10:07:52,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 10:07:52,918 INFO L264 TraceCheckSpWp]: Trace formula consists of 641 conjuncts, 2 conjunts are in the unsatisfiable core [2019-12-07 10:07:52,922 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 10:07:53,055 INFO L134 CoverageAnalysis]: Checked inductivity of 3220 backedges. 1527 proven. 0 refuted. 0 times theorem prover too weak. 1693 trivial. 0 not checked. [2019-12-07 10:07:53,055 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 10:07:53,176 INFO L134 CoverageAnalysis]: Checked inductivity of 3220 backedges. 1527 proven. 0 refuted. 0 times theorem prover too weak. 1693 trivial. 0 not checked. [2019-12-07 10:07:53,177 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [679622543] [2019-12-07 10:07:53,177 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-12-07 10:07:53,177 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 4 [2019-12-07 10:07:53,177 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1809708101] [2019-12-07 10:07:53,178 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 10:07:53,178 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-12-07 10:07:53,178 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 10:07:53,178 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-07 10:07:53,178 INFO L87 Difference]: Start difference. First operand 6493 states and 8174 transitions. Second operand 4 states. [2019-12-07 10:07:53,390 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 10:07:53,390 INFO L93 Difference]: Finished difference Result 13251 states and 16869 transitions. [2019-12-07 10:07:53,391 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 10:07:53,391 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 543 [2019-12-07 10:07:53,391 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 10:07:53,395 INFO L225 Difference]: With dead ends: 13251 [2019-12-07 10:07:53,395 INFO L226 Difference]: Without dead ends: 6184 [2019-12-07 10:07:53,400 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 1084 GetRequests, 1082 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-07 10:07:53,403 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6184 states. [2019-12-07 10:07:53,508 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6184 to 6133. [2019-12-07 10:07:53,509 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6133 states. [2019-12-07 10:07:53,513 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6133 states to 6133 states and 7634 transitions. [2019-12-07 10:07:53,514 INFO L78 Accepts]: Start accepts. Automaton has 6133 states and 7634 transitions. Word has length 543 [2019-12-07 10:07:53,514 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 10:07:53,514 INFO L462 AbstractCegarLoop]: Abstraction has 6133 states and 7634 transitions. [2019-12-07 10:07:53,514 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 10:07:53,514 INFO L276 IsEmpty]: Start isEmpty. Operand 6133 states and 7634 transitions. [2019-12-07 10:07:53,521 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 619 [2019-12-07 10:07:53,521 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 10:07:53,522 INFO L410 BasicCegarLoop]: trace histogram [22, 22, 21, 21, 21, 21, 21, 21, 21, 20, 19, 17, 17, 16, 16, 15, 15, 13, 13, 12, 12, 12, 12, 12, 12, 11, 11, 11, 11, 8, 8, 5, 5, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 10:07:53,722 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 24 mathsat -unsat_core_generation=3 [2019-12-07 10:07:53,722 INFO L410 AbstractCegarLoop]: === Iteration 24 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 10:07:53,723 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 10:07:53,723 INFO L82 PathProgramCache]: Analyzing trace with hash 1765106863, now seen corresponding path program 1 times [2019-12-07 10:07:53,724 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-12-07 10:07:53,724 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1461051267] [2019-12-07 10:07:53,725 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_b73ae0b1-f3a2-46c9-8e3b-fe3c43b0904d/bin/uautomizer/mathsat Starting monitored process 25 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 25 with mathsat -unsat_core_generation=3 [2019-12-07 10:07:53,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 10:07:53,860 INFO L264 TraceCheckSpWp]: Trace formula consists of 707 conjuncts, 3 conjunts are in the unsatisfiable core [2019-12-07 10:07:53,863 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 10:07:54,046 INFO L134 CoverageAnalysis]: Checked inductivity of 4151 backedges. 2135 proven. 14 refuted. 0 times theorem prover too weak. 2002 trivial. 0 not checked. [2019-12-07 10:07:54,046 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 10:07:54,236 INFO L134 CoverageAnalysis]: Checked inductivity of 4151 backedges. 2135 proven. 14 refuted. 0 times theorem prover too weak. 2002 trivial. 0 not checked. [2019-12-07 10:07:54,237 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1461051267] [2019-12-07 10:07:54,237 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-07 10:07:54,237 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 6 [2019-12-07 10:07:54,237 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1464983149] [2019-12-07 10:07:54,238 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-07 10:07:54,238 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-12-07 10:07:54,238 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-07 10:07:54,238 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-12-07 10:07:54,238 INFO L87 Difference]: Start difference. First operand 6133 states and 7634 transitions. Second operand 6 states. [2019-12-07 10:07:54,496 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 10:07:54,496 INFO L93 Difference]: Finished difference Result 6346 states and 7904 transitions. [2019-12-07 10:07:54,496 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-07 10:07:54,496 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 618 [2019-12-07 10:07:54,496 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 10:07:54,496 INFO L225 Difference]: With dead ends: 6346 [2019-12-07 10:07:54,496 INFO L226 Difference]: Without dead ends: 0 [2019-12-07 10:07:54,499 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 1238 GetRequests, 1232 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2019-12-07 10:07:54,499 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-12-07 10:07:54,499 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-12-07 10:07:54,499 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-12-07 10:07:54,499 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-12-07 10:07:54,500 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 618 [2019-12-07 10:07:54,500 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 10:07:54,500 INFO L462 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-12-07 10:07:54,500 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-07 10:07:54,500 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-12-07 10:07:54,500 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-12-07 10:07:54,700 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 25 mathsat -unsat_core_generation=3 [2019-12-07 10:07:54,703 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2019-12-07 10:07:54,870 WARN L192 SmtUtils]: Spent 120.00 ms on a formula simplification. DAG size of input: 128 DAG size of output: 128 [2019-12-07 10:07:55,334 WARN L192 SmtUtils]: Spent 222.00 ms on a formula simplification. DAG size of input: 526 DAG size of output: 180 [2019-12-07 10:07:55,646 WARN L192 SmtUtils]: Spent 282.00 ms on a formula simplification. DAG size of input: 128 DAG size of output: 57 [2019-12-07 10:07:55,822 WARN L192 SmtUtils]: Spent 122.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 56 [2019-12-07 10:07:56,039 WARN L192 SmtUtils]: Spent 154.00 ms on a formula simplification. DAG size of input: 110 DAG size of output: 47 [2019-12-07 10:07:56,173 WARN L192 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 31 [2019-12-07 10:07:56,500 WARN L192 SmtUtils]: Spent 326.00 ms on a formula simplification. DAG size of input: 128 DAG size of output: 47 [2019-12-07 10:07:56,627 WARN L192 SmtUtils]: Spent 125.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 53 [2019-12-07 10:07:57,039 WARN L192 SmtUtils]: Spent 383.00 ms on a formula simplification. DAG size of input: 146 DAG size of output: 57 [2019-12-07 10:07:57,896 WARN L192 SmtUtils]: Spent 797.00 ms on a formula simplification. DAG size of input: 147 DAG size of output: 101 [2019-12-07 10:07:58,078 WARN L192 SmtUtils]: Spent 163.00 ms on a formula simplification. DAG size of input: 113 DAG size of output: 47 [2019-12-07 10:07:58,202 WARN L192 SmtUtils]: Spent 123.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 55 [2019-12-07 10:07:58,205 INFO L249 CegarLoopResult]: At program point L597(lines 92 598) the Hoare annotation is: true [2019-12-07 10:07:58,205 INFO L246 CegarLoopResult]: For program point L168(lines 168 541) no Hoare annotation was computed. [2019-12-07 10:07:58,205 INFO L246 CegarLoopResult]: For program point L135(lines 135 552) no Hoare annotation was computed. [2019-12-07 10:07:58,205 INFO L246 CegarLoopResult]: For program point L102(lines 102 563) no Hoare annotation was computed. [2019-12-07 10:07:58,205 INFO L246 CegarLoopResult]: For program point L367(lines 367 371) no Hoare annotation was computed. [2019-12-07 10:07:58,205 INFO L246 CegarLoopResult]: For program point L367-2(lines 367 371) no Hoare annotation was computed. [2019-12-07 10:07:58,205 INFO L246 CegarLoopResult]: For program point L301-1(lines 301 315) no Hoare annotation was computed. [2019-12-07 10:07:58,206 INFO L242 CegarLoopResult]: At program point L202(lines 99 564) the Hoare annotation is: (and (not (= (_ bv4099 32) ULTIMATE.start_ssl3_connect_~s__state~0)) (not (= (_ bv4432 32) ULTIMATE.start_ssl3_connect_~s__state~0)) (= (_ bv0 32) ULTIMATE.start_ssl3_connect_~blastFlag~0) (not (= (_ bv4369 32) ULTIMATE.start_ssl3_connect_~s__state~0)) (not (= (_ bv0 32) (bvadd ULTIMATE.start_ssl3_connect_~s__state~0 (_ bv4294955004 32)))) (not (= (_ bv4400 32) ULTIMATE.start_ssl3_connect_~s__state~0)) (not (= (bvadd ULTIMATE.start_ssl3_connect_~s__state~0 (_ bv4294950912 32)) (_ bv0 32))) (not (= (_ bv0 32) (bvadd ULTIMATE.start_ssl3_connect_~s__state~0 (_ bv4294946816 32)))) (not (= (_ bv4368 32) ULTIMATE.start_ssl3_connect_~s__state~0))) [2019-12-07 10:07:58,206 INFO L242 CegarLoopResult]: At program point L169(lines 165 542) the Hoare annotation is: (and (= ULTIMATE.start_ssl3_connect_~s__hit~0 (_ bv0 32)) (not (= (_ bv4432 32) ULTIMATE.start_ssl3_connect_~s__state~0)) (not (= (_ bv3 32) ULTIMATE.start_ssl3_connect_~blastFlag~0)) (not (= (_ bv4369 32) ULTIMATE.start_ssl3_connect_~s__state~0)) (not (= (_ bv0 32) (bvadd ULTIMATE.start_ssl3_connect_~s__state~0 (_ bv4294955004 32)))) (not (= (_ bv5 32) ULTIMATE.start_ssl3_connect_~blastFlag~0)) (not (= (bvadd ULTIMATE.start_ssl3_connect_~s__state~0 (_ bv4294950912 32)) (_ bv0 32))) (not (= (_ bv0 32) (bvadd ULTIMATE.start_ssl3_connect_~s__state~0 (_ bv4294946816 32)))) (= (_ bv61087 32) ULTIMATE.start_ssl3_connect_~ag_Y~0) (not (= (_ bv4368 32) ULTIMATE.start_ssl3_connect_~s__state~0)) (not (= (_ bv4099 32) ULTIMATE.start_ssl3_connect_~s__state~0)) (not (= (_ bv4096 32) ULTIMATE.start_ssl3_connect_~s__state~0)) (= (_ bv65535 32) ULTIMATE.start_ssl3_connect_~ag_X~0)) [2019-12-07 10:07:58,206 INFO L246 CegarLoopResult]: For program point L566(lines 566 594) no Hoare annotation was computed. [2019-12-07 10:07:58,206 INFO L246 CegarLoopResult]: For program point L567(lines 567 591) no Hoare annotation was computed. [2019-12-07 10:07:58,206 INFO L246 CegarLoopResult]: For program point L501-1(lines 197 529) no Hoare annotation was computed. [2019-12-07 10:07:58,206 INFO L246 CegarLoopResult]: For program point L336(lines 336 341) no Hoare annotation was computed. [2019-12-07 10:07:58,206 INFO L246 CegarLoopResult]: For program point L171(lines 171 540) no Hoare annotation was computed. [2019-12-07 10:07:58,206 INFO L246 CegarLoopResult]: For program point L138(lines 138 551) no Hoare annotation was computed. [2019-12-07 10:07:58,206 INFO L246 CegarLoopResult]: For program point L105(lines 105 562) no Hoare annotation was computed. [2019-12-07 10:07:58,206 INFO L246 CegarLoopResult]: For program point L601(lines 601 605) no Hoare annotation was computed. [2019-12-07 10:07:58,207 INFO L246 CegarLoopResult]: For program point L568(lines 568 577) no Hoare annotation was computed. [2019-12-07 10:07:58,207 INFO L246 CegarLoopResult]: For program point L601-2(lines 601 605) no Hoare annotation was computed. [2019-12-07 10:07:58,207 INFO L246 CegarLoopResult]: For program point L568-2(lines 567 589) no Hoare annotation was computed. [2019-12-07 10:07:58,207 INFO L242 CegarLoopResult]: At program point L139(lines 135 552) the Hoare annotation is: (and (not (= (_ bv4099 32) ULTIMATE.start_ssl3_connect_~s__state~0)) (= ULTIMATE.start_ssl3_connect_~s__hit~0 (_ bv0 32)) (not (= (_ bv3 32) ULTIMATE.start_ssl3_connect_~blastFlag~0)) (not (= (_ bv4096 32) ULTIMATE.start_ssl3_connect_~s__state~0)) (not (= (_ bv4369 32) ULTIMATE.start_ssl3_connect_~s__state~0)) (not (= (_ bv0 32) (bvadd ULTIMATE.start_ssl3_connect_~s__state~0 (_ bv4294955004 32)))) (not (= (_ bv5 32) ULTIMATE.start_ssl3_connect_~blastFlag~0)) (= (_ bv65535 32) ULTIMATE.start_ssl3_connect_~ag_X~0) (not (= (bvadd ULTIMATE.start_ssl3_connect_~s__state~0 (_ bv4294950912 32)) (_ bv0 32))) (not (= (_ bv0 32) (bvadd ULTIMATE.start_ssl3_connect_~s__state~0 (_ bv4294946816 32)))) (= (_ bv61087 32) ULTIMATE.start_ssl3_connect_~ag_Y~0) (not (= (_ bv4368 32) ULTIMATE.start_ssl3_connect_~s__state~0))) [2019-12-07 10:07:58,207 INFO L246 CegarLoopResult]: For program point L73(lines 73 81) no Hoare annotation was computed. [2019-12-07 10:07:58,207 INFO L246 CegarLoopResult]: For program point L305(lines 305 309) no Hoare annotation was computed. [2019-12-07 10:07:58,207 INFO L246 CegarLoopResult]: For program point L305-2(lines 303 315) no Hoare annotation was computed. [2019-12-07 10:07:58,207 INFO L246 CegarLoopResult]: For program point L570(lines 570 574) no Hoare annotation was computed. [2019-12-07 10:07:58,207 INFO L246 CegarLoopResult]: For program point L438(lines 438 443) no Hoare annotation was computed. [2019-12-07 10:07:58,207 INFO L246 CegarLoopResult]: For program point L273(lines 273 277) no Hoare annotation was computed. [2019-12-07 10:07:58,207 INFO L246 CegarLoopResult]: For program point L207(lines 207 211) no Hoare annotation was computed. [2019-12-07 10:07:58,208 INFO L246 CegarLoopResult]: For program point L174(lines 174 539) no Hoare annotation was computed. [2019-12-07 10:07:58,208 INFO L246 CegarLoopResult]: For program point L141(lines 141 550) no Hoare annotation was computed. [2019-12-07 10:07:58,208 INFO L246 CegarLoopResult]: For program point L207-2(lines 197 529) no Hoare annotation was computed. [2019-12-07 10:07:58,208 INFO L246 CegarLoopResult]: For program point L108(lines 108 561) no Hoare annotation was computed. [2019-12-07 10:07:58,208 INFO L246 CegarLoopResult]: For program point L472(lines 472 476) no Hoare annotation was computed. [2019-12-07 10:07:58,208 INFO L242 CegarLoopResult]: At program point L175(lines 171 540) the Hoare annotation is: (let ((.cse5 (= ULTIMATE.start_ssl3_connect_~s__hit~0 (_ bv0 32))) (.cse1 (not (= (_ bv4432 32) ULTIMATE.start_ssl3_connect_~s__state~0))) (.cse3 (not (= (_ bv4369 32) ULTIMATE.start_ssl3_connect_~s__state~0))) (.cse4 (not (= (_ bv0 32) (bvadd ULTIMATE.start_ssl3_connect_~s__state~0 (_ bv4294955004 32))))) (.cse6 (not (= (bvadd ULTIMATE.start_ssl3_connect_~s__state~0 (_ bv4294950912 32)) (_ bv0 32)))) (.cse7 (not (= (_ bv0 32) (bvadd ULTIMATE.start_ssl3_connect_~s__state~0 (_ bv4294946816 32))))) (.cse8 (not (= (_ bv4368 32) ULTIMATE.start_ssl3_connect_~s__state~0))) (.cse0 (not (= (_ bv4099 32) ULTIMATE.start_ssl3_connect_~s__state~0))) (.cse2 (not (= (_ bv4096 32) ULTIMATE.start_ssl3_connect_~s__state~0)))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 (not .cse5) (not (= (_ bv4400 32) ULTIMATE.start_ssl3_connect_~s__state~0)) (= (_ bv2 32) ULTIMATE.start_ssl3_connect_~blastFlag~0) .cse6 .cse7 .cse8) (and .cse5 .cse1 (not (= (_ bv3 32) ULTIMATE.start_ssl3_connect_~blastFlag~0)) .cse3 .cse4 (not (= (_ bv5 32) ULTIMATE.start_ssl3_connect_~blastFlag~0)) .cse6 .cse7 (= (_ bv61087 32) ULTIMATE.start_ssl3_connect_~ag_Y~0) .cse8 .cse0 .cse2 (= (_ bv65535 32) ULTIMATE.start_ssl3_connect_~ag_X~0)))) [2019-12-07 10:07:58,208 INFO L246 CegarLoopResult]: For program point L76(lines 76 80) no Hoare annotation was computed. [2019-12-07 10:07:58,208 INFO L246 CegarLoopResult]: For program point L76-2(lines 73 81) no Hoare annotation was computed. [2019-12-07 10:07:58,208 INFO L246 CegarLoopResult]: For program point L506-1(lines 506 510) no Hoare annotation was computed. [2019-12-07 10:07:58,208 INFO L246 CegarLoopResult]: For program point L407(lines 407 411) no Hoare annotation was computed. [2019-12-07 10:07:58,208 INFO L246 CegarLoopResult]: For program point L243(lines 243 248) no Hoare annotation was computed. [2019-12-07 10:07:58,208 INFO L246 CegarLoopResult]: For program point L177(lines 177 538) no Hoare annotation was computed. [2019-12-07 10:07:58,208 INFO L246 CegarLoopResult]: For program point L144(lines 144 549) no Hoare annotation was computed. [2019-12-07 10:07:58,209 INFO L246 CegarLoopResult]: For program point L111(lines 111 560) no Hoare annotation was computed. [2019-12-07 10:07:58,209 INFO L242 CegarLoopResult]: At program point L145(lines 141 550) the Hoare annotation is: (and (= ULTIMATE.start_ssl3_connect_~s__hit~0 (_ bv0 32)) (not (= (_ bv4432 32) ULTIMATE.start_ssl3_connect_~s__state~0)) (not (= (_ bv3 32) ULTIMATE.start_ssl3_connect_~blastFlag~0)) (not (= (_ bv4369 32) ULTIMATE.start_ssl3_connect_~s__state~0)) (not (= (_ bv0 32) (bvadd ULTIMATE.start_ssl3_connect_~s__state~0 (_ bv4294955004 32)))) (not (= (_ bv5 32) ULTIMATE.start_ssl3_connect_~blastFlag~0)) (not (= (bvadd ULTIMATE.start_ssl3_connect_~s__state~0 (_ bv4294950912 32)) (_ bv0 32))) (not (= (_ bv0 32) (bvadd ULTIMATE.start_ssl3_connect_~s__state~0 (_ bv4294946816 32)))) (= (_ bv61087 32) ULTIMATE.start_ssl3_connect_~ag_Y~0) (not (= (_ bv4368 32) ULTIMATE.start_ssl3_connect_~s__state~0)) (not (= (_ bv4099 32) ULTIMATE.start_ssl3_connect_~s__state~0)) (not (= (_ bv4096 32) ULTIMATE.start_ssl3_connect_~s__state~0)) (= (_ bv65535 32) ULTIMATE.start_ssl3_connect_~ag_X~0)) [2019-12-07 10:07:58,209 INFO L246 CegarLoopResult]: For program point L477(lines 477 481) no Hoare annotation was computed. [2019-12-07 10:07:58,209 INFO L246 CegarLoopResult]: For program point L477-2(lines 477 481) no Hoare annotation was computed. [2019-12-07 10:07:58,209 INFO L246 CegarLoopResult]: For program point L180(lines 180 537) no Hoare annotation was computed. [2019-12-07 10:07:58,209 INFO L246 CegarLoopResult]: For program point L147(lines 147 548) no Hoare annotation was computed. [2019-12-07 10:07:58,209 INFO L246 CegarLoopResult]: For program point L114(lines 114 559) no Hoare annotation was computed. [2019-12-07 10:07:58,209 INFO L246 CegarLoopResult]: For program point L379(lines 379 383) no Hoare annotation was computed. [2019-12-07 10:07:58,209 INFO L246 CegarLoopResult]: For program point L346(lines 346 350) no Hoare annotation was computed. [2019-12-07 10:07:58,209 INFO L242 CegarLoopResult]: At program point L181(lines 177 538) the Hoare annotation is: (let ((.cse5 (= ULTIMATE.start_ssl3_connect_~s__hit~0 (_ bv0 32))) (.cse1 (not (= (_ bv4432 32) ULTIMATE.start_ssl3_connect_~s__state~0))) (.cse3 (not (= (_ bv4369 32) ULTIMATE.start_ssl3_connect_~s__state~0))) (.cse4 (not (= (_ bv0 32) (bvadd ULTIMATE.start_ssl3_connect_~s__state~0 (_ bv4294955004 32))))) (.cse6 (not (= (bvadd ULTIMATE.start_ssl3_connect_~s__state~0 (_ bv4294950912 32)) (_ bv0 32)))) (.cse7 (not (= (_ bv0 32) (bvadd ULTIMATE.start_ssl3_connect_~s__state~0 (_ bv4294946816 32))))) (.cse8 (not (= (_ bv4368 32) ULTIMATE.start_ssl3_connect_~s__state~0))) (.cse0 (not (= (_ bv4099 32) ULTIMATE.start_ssl3_connect_~s__state~0))) (.cse2 (not (= (_ bv4096 32) ULTIMATE.start_ssl3_connect_~s__state~0)))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 (not .cse5) (not (= (_ bv4400 32) ULTIMATE.start_ssl3_connect_~s__state~0)) (= (_ bv2 32) ULTIMATE.start_ssl3_connect_~blastFlag~0) .cse6 .cse7 .cse8) (and .cse5 .cse1 (not (= (_ bv3 32) ULTIMATE.start_ssl3_connect_~blastFlag~0)) .cse3 .cse4 (not (= (_ bv5 32) ULTIMATE.start_ssl3_connect_~blastFlag~0)) .cse6 .cse7 (= (_ bv61087 32) ULTIMATE.start_ssl3_connect_~ag_Y~0) .cse8 .cse0 .cse2 (= (_ bv65535 32) ULTIMATE.start_ssl3_connect_~ag_X~0)))) [2019-12-07 10:07:58,210 INFO L242 CegarLoopResult]: At program point L115(lines 111 560) the Hoare annotation is: (and (not (= (_ bv4099 32) ULTIMATE.start_ssl3_connect_~s__state~0)) (not (= (_ bv4432 32) ULTIMATE.start_ssl3_connect_~s__state~0)) (not (= (_ bv4096 32) ULTIMATE.start_ssl3_connect_~s__state~0)) (= (_ bv0 32) ULTIMATE.start_ssl3_connect_~blastFlag~0) (not (= (_ bv4369 32) ULTIMATE.start_ssl3_connect_~s__state~0)) (not (= (_ bv0 32) (bvadd ULTIMATE.start_ssl3_connect_~s__state~0 (_ bv4294955004 32)))) (not (= (_ bv4400 32) ULTIMATE.start_ssl3_connect_~s__state~0)) (not (= (bvadd ULTIMATE.start_ssl3_connect_~s__state~0 (_ bv4294950912 32)) (_ bv0 32))) (not (= (_ bv0 32) (bvadd ULTIMATE.start_ssl3_connect_~s__state~0 (_ bv4294946816 32))))) [2019-12-07 10:07:58,210 INFO L242 CegarLoopResult]: At program point L347(lines 65 614) the Hoare annotation is: false [2019-12-07 10:07:58,210 INFO L246 CegarLoopResult]: For program point L83(lines 83 91) no Hoare annotation was computed. [2019-12-07 10:07:58,210 INFO L249 CegarLoopResult]: At program point L612(lines 65 614) the Hoare annotation is: true [2019-12-07 10:07:58,210 INFO L246 CegarLoopResult]: For program point L579(lines 579 585) no Hoare annotation was computed. [2019-12-07 10:07:58,210 INFO L246 CegarLoopResult]: For program point L513(lines 513 517) no Hoare annotation was computed. [2019-12-07 10:07:58,210 INFO L246 CegarLoopResult]: For program point L513-2(lines 513 517) no Hoare annotation was computed. [2019-12-07 10:07:58,210 INFO L246 CegarLoopResult]: For program point L282(lines 282 286) no Hoare annotation was computed. [2019-12-07 10:07:58,210 INFO L246 CegarLoopResult]: For program point L282-2(lines 197 529) no Hoare annotation was computed. [2019-12-07 10:07:58,210 INFO L246 CegarLoopResult]: For program point L183(lines 183 536) no Hoare annotation was computed. [2019-12-07 10:07:58,210 INFO L246 CegarLoopResult]: For program point L150(lines 150 547) no Hoare annotation was computed. [2019-12-07 10:07:58,210 INFO L246 CegarLoopResult]: For program point L117(lines 117 558) no Hoare annotation was computed. [2019-12-07 10:07:58,210 INFO L246 CegarLoopResult]: For program point L84(lines 84 88) no Hoare annotation was computed. [2019-12-07 10:07:58,211 INFO L249 CegarLoopResult]: At program point L613(lines 8 615) the Hoare annotation is: true [2019-12-07 10:07:58,211 INFO L246 CegarLoopResult]: For program point L448(lines 448 452) no Hoare annotation was computed. [2019-12-07 10:07:58,211 INFO L246 CegarLoopResult]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2019-12-07 10:07:58,211 INFO L246 CegarLoopResult]: For program point L351(lines 351 355) no Hoare annotation was computed. [2019-12-07 10:07:58,211 INFO L246 CegarLoopResult]: For program point L219(lines 219 236) no Hoare annotation was computed. [2019-12-07 10:07:58,211 INFO L246 CegarLoopResult]: For program point L186(lines 186 535) no Hoare annotation was computed. [2019-12-07 10:07:58,211 INFO L246 CegarLoopResult]: For program point L153(lines 153 546) no Hoare annotation was computed. [2019-12-07 10:07:58,211 INFO L246 CegarLoopResult]: For program point L219-2(lines 197 529) no Hoare annotation was computed. [2019-12-07 10:07:58,211 INFO L246 CegarLoopResult]: For program point L120(lines 120 557) no Hoare annotation was computed. [2019-12-07 10:07:58,211 INFO L242 CegarLoopResult]: At program point L187(lines 183 536) the Hoare annotation is: (let ((.cse7 (not (= (_ bv4099 32) ULTIMATE.start_ssl3_connect_~s__state~0))) (.cse1 (not (= (_ bv4432 32) ULTIMATE.start_ssl3_connect_~s__state~0))) (.cse8 (not (= (_ bv4096 32) ULTIMATE.start_ssl3_connect_~s__state~0))) (.cse2 (not (= (_ bv4369 32) ULTIMATE.start_ssl3_connect_~s__state~0))) (.cse3 (not (= (_ bv0 32) (bvadd ULTIMATE.start_ssl3_connect_~s__state~0 (_ bv4294955004 32))))) (.cse0 (= ULTIMATE.start_ssl3_connect_~s__hit~0 (_ bv0 32))) (.cse4 (not (= (bvadd ULTIMATE.start_ssl3_connect_~s__state~0 (_ bv4294950912 32)) (_ bv0 32)))) (.cse5 (not (= (_ bv0 32) (bvadd ULTIMATE.start_ssl3_connect_~s__state~0 (_ bv4294946816 32))))) (.cse6 (not (= (_ bv4368 32) ULTIMATE.start_ssl3_connect_~s__state~0)))) (or (and .cse0 (not (= (_ bv3 32) ULTIMATE.start_ssl3_connect_~blastFlag~0)) .cse1 (= (_ bv4560 32) ULTIMATE.start_ssl3_connect_~s__s3__tmp__next_state___0~0) .cse2 .cse3 (not (= (_ bv5 32) ULTIMATE.start_ssl3_connect_~blastFlag~0)) .cse4 .cse5 (= (_ bv61087 32) ULTIMATE.start_ssl3_connect_~ag_Y~0) .cse6 .cse7 .cse8 (= (_ bv65535 32) ULTIMATE.start_ssl3_connect_~ag_X~0)) (and .cse7 .cse1 .cse8 .cse2 .cse3 (not .cse0) (not (= (_ bv4400 32) ULTIMATE.start_ssl3_connect_~s__state~0)) (= (_ bv2 32) ULTIMATE.start_ssl3_connect_~blastFlag~0) .cse4 .cse5 .cse6))) [2019-12-07 10:07:58,211 INFO L242 CegarLoopResult]: At program point L121(lines 117 558) the Hoare annotation is: (let ((.cse1 (not (= (_ bv4432 32) ULTIMATE.start_ssl3_connect_~s__state~0))) (.cse3 (not (= (_ bv4369 32) ULTIMATE.start_ssl3_connect_~s__state~0))) (.cse4 (not (= (_ bv0 32) (bvadd ULTIMATE.start_ssl3_connect_~s__state~0 (_ bv4294955004 32))))) (.cse5 (not (= (bvadd ULTIMATE.start_ssl3_connect_~s__state~0 (_ bv4294950912 32)) (_ bv0 32)))) (.cse6 (not (= (_ bv0 32) (bvadd ULTIMATE.start_ssl3_connect_~s__state~0 (_ bv4294946816 32))))) (.cse7 (not (= (_ bv4368 32) ULTIMATE.start_ssl3_connect_~s__state~0))) (.cse0 (not (= (_ bv4099 32) ULTIMATE.start_ssl3_connect_~s__state~0))) (.cse2 (not (= (_ bv4096 32) ULTIMATE.start_ssl3_connect_~s__state~0)))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 (not (= (_ bv4400 32) ULTIMATE.start_ssl3_connect_~s__state~0)) .cse5 .cse6 (= (_ bv1 32) ULTIMATE.start_ssl3_connect_~blastFlag~0) .cse7) (and (= ULTIMATE.start_ssl3_connect_~s__hit~0 (_ bv0 32)) .cse1 (not (= (_ bv3 32) ULTIMATE.start_ssl3_connect_~blastFlag~0)) (= (_ bv4560 32) ULTIMATE.start_ssl3_connect_~s__s3__tmp__next_state___0~0) .cse3 .cse4 (not (= (_ bv5 32) ULTIMATE.start_ssl3_connect_~blastFlag~0)) .cse5 .cse6 (= (_ bv61087 32) ULTIMATE.start_ssl3_connect_~ag_Y~0) .cse7 .cse0 .cse2 (= (_ bv65535 32) ULTIMATE.start_ssl3_connect_~ag_X~0)))) [2019-12-07 10:07:58,212 INFO L246 CegarLoopResult]: For program point L485-1(lines 485 497) no Hoare annotation was computed. [2019-12-07 10:07:58,212 INFO L246 CegarLoopResult]: For program point L419(lines 419 423) no Hoare annotation was computed. [2019-12-07 10:07:58,212 INFO L246 CegarLoopResult]: For program point L221(lines 221 226) no Hoare annotation was computed. [2019-12-07 10:07:58,212 INFO L246 CegarLoopResult]: For program point L189(lines 189 534) no Hoare annotation was computed. [2019-12-07 10:07:58,212 INFO L246 CegarLoopResult]: For program point L156(lines 156 545) no Hoare annotation was computed. [2019-12-07 10:07:58,212 INFO L246 CegarLoopResult]: For program point L123(lines 123 556) no Hoare annotation was computed. [2019-12-07 10:07:58,212 INFO L246 CegarLoopResult]: For program point L520(lines 520 524) no Hoare annotation was computed. [2019-12-07 10:07:58,212 INFO L246 CegarLoopResult]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2019-12-07 10:07:58,212 INFO L242 CegarLoopResult]: At program point L190(lines 189 534) the Hoare annotation is: (let ((.cse1 (= ULTIMATE.start_ssl3_connect_~s__hit~0 (_ bv0 32))) (.cse0 (= (_ bv4352 32) ULTIMATE.start_ssl3_connect_~s__state~0))) (or (and (= (_ bv0 32) (bvadd ULTIMATE.start_ssl3_connect_~s__s3__tmp__next_state___0~0 (_ bv4294967293 32))) .cse0 (not .cse1) (= (_ bv2 32) ULTIMATE.start_ssl3_connect_~blastFlag~0)) (and .cse1 (not (= (_ bv3 32) ULTIMATE.start_ssl3_connect_~blastFlag~0)) (= (_ bv4560 32) ULTIMATE.start_ssl3_connect_~s__s3__tmp__next_state___0~0) .cse0 (not (= (_ bv5 32) ULTIMATE.start_ssl3_connect_~blastFlag~0)) (= (_ bv65535 32) ULTIMATE.start_ssl3_connect_~ag_X~0) (= (_ bv61087 32) ULTIMATE.start_ssl3_connect_~ag_Y~0)))) [2019-12-07 10:07:58,212 INFO L242 CegarLoopResult]: At program point L157(lines 147 548) the Hoare annotation is: (and (= ULTIMATE.start_ssl3_connect_~s__hit~0 (_ bv0 32)) (not (= (_ bv4432 32) ULTIMATE.start_ssl3_connect_~s__state~0)) (not (= (_ bv3 32) ULTIMATE.start_ssl3_connect_~blastFlag~0)) (not (= (_ bv4369 32) ULTIMATE.start_ssl3_connect_~s__state~0)) (not (= (_ bv0 32) (bvadd ULTIMATE.start_ssl3_connect_~s__state~0 (_ bv4294955004 32)))) (not (= (_ bv5 32) ULTIMATE.start_ssl3_connect_~blastFlag~0)) (not (= (bvadd ULTIMATE.start_ssl3_connect_~s__state~0 (_ bv4294950912 32)) (_ bv0 32))) (not (= (_ bv0 32) (bvadd ULTIMATE.start_ssl3_connect_~s__state~0 (_ bv4294946816 32)))) (= (_ bv61087 32) ULTIMATE.start_ssl3_connect_~ag_Y~0) (not (= (_ bv4368 32) ULTIMATE.start_ssl3_connect_~s__state~0)) (not (= (_ bv4099 32) ULTIMATE.start_ssl3_connect_~s__state~0)) (not (= (_ bv4096 32) ULTIMATE.start_ssl3_connect_~s__state~0)) (= (_ bv65535 32) ULTIMATE.start_ssl3_connect_~ag_X~0)) [2019-12-07 10:07:58,212 INFO L246 CegarLoopResult]: For program point L488(lines 488 493) no Hoare annotation was computed. [2019-12-07 10:07:58,212 INFO L246 CegarLoopResult]: For program point L455(lines 455 466) no Hoare annotation was computed. [2019-12-07 10:07:58,213 INFO L246 CegarLoopResult]: For program point L455-1(lines 455 466) no Hoare annotation was computed. [2019-12-07 10:07:58,213 INFO L246 CegarLoopResult]: For program point L323(lines 323 327) no Hoare annotation was computed. [2019-12-07 10:07:58,213 INFO L246 CegarLoopResult]: For program point L257(lines 257 265) no Hoare annotation was computed. [2019-12-07 10:07:58,213 INFO L246 CegarLoopResult]: For program point L323-2(lines 197 529) no Hoare annotation was computed. [2019-12-07 10:07:58,213 INFO L246 CegarLoopResult]: For program point L390(lines 390 394) no Hoare annotation was computed. [2019-12-07 10:07:58,213 INFO L246 CegarLoopResult]: For program point L192(lines 192 533) no Hoare annotation was computed. [2019-12-07 10:07:58,213 INFO L246 CegarLoopResult]: For program point L159(lines 159 544) no Hoare annotation was computed. [2019-12-07 10:07:58,213 INFO L246 CegarLoopResult]: For program point L126(lines 126 555) no Hoare annotation was computed. [2019-12-07 10:07:58,213 INFO L246 CegarLoopResult]: For program point L93-1(lines 65 614) no Hoare annotation was computed. [2019-12-07 10:07:58,213 INFO L246 CegarLoopResult]: For program point L457(lines 457 463) no Hoare annotation was computed. [2019-12-07 10:07:58,213 INFO L246 CegarLoopResult]: For program point L292(lines 292 296) no Hoare annotation was computed. [2019-12-07 10:07:58,213 INFO L246 CegarLoopResult]: For program point L292-2(lines 292 296) no Hoare annotation was computed. [2019-12-07 10:07:58,213 INFO L249 CegarLoopResult]: At program point L193(lines 192 533) the Hoare annotation is: true [2019-12-07 10:07:58,213 INFO L242 CegarLoopResult]: At program point L127(lines 123 556) the Hoare annotation is: (let ((.cse7 (not (= (_ bv4099 32) ULTIMATE.start_ssl3_connect_~s__state~0))) (.cse0 (= ULTIMATE.start_ssl3_connect_~s__hit~0 (_ bv0 32))) (.cse1 (not (= (_ bv4432 32) ULTIMATE.start_ssl3_connect_~s__state~0))) (.cse8 (not (= (_ bv4096 32) ULTIMATE.start_ssl3_connect_~s__state~0))) (.cse2 (not (= (_ bv4369 32) ULTIMATE.start_ssl3_connect_~s__state~0))) (.cse3 (not (= (_ bv0 32) (bvadd ULTIMATE.start_ssl3_connect_~s__state~0 (_ bv4294955004 32))))) (.cse4 (not (= (bvadd ULTIMATE.start_ssl3_connect_~s__state~0 (_ bv4294950912 32)) (_ bv0 32)))) (.cse5 (not (= (_ bv0 32) (bvadd ULTIMATE.start_ssl3_connect_~s__state~0 (_ bv4294946816 32))))) (.cse6 (not (= (_ bv4368 32) ULTIMATE.start_ssl3_connect_~s__state~0)))) (or (and .cse0 (not (= (_ bv3 32) ULTIMATE.start_ssl3_connect_~blastFlag~0)) .cse1 .cse2 .cse3 (not (= (_ bv5 32) ULTIMATE.start_ssl3_connect_~blastFlag~0)) .cse4 .cse5 (not (= (_ bv4368 32) ULTIMATE.start_ssl3_connect_~s__s3__tmp__next_state___0~0)) (= (_ bv61087 32) ULTIMATE.start_ssl3_connect_~ag_Y~0) .cse6 .cse7 .cse8 (= (_ bv65535 32) ULTIMATE.start_ssl3_connect_~ag_X~0)) (and .cse7 .cse0 .cse1 .cse8 .cse2 .cse3 (= (_ bv2 32) ULTIMATE.start_ssl3_connect_~blastFlag~0) .cse4 .cse5 .cse6))) [2019-12-07 10:07:58,214 INFO L246 CegarLoopResult]: For program point L94(line 94) no Hoare annotation was computed. [2019-12-07 10:07:58,214 INFO L246 CegarLoopResult]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2019-12-07 10:07:58,214 INFO L246 CegarLoopResult]: For program point L260(lines 260 264) no Hoare annotation was computed. [2019-12-07 10:07:58,214 INFO L246 CegarLoopResult]: For program point L227(lines 227 232) no Hoare annotation was computed. [2019-12-07 10:07:58,214 INFO L246 CegarLoopResult]: For program point L260-2(lines 197 529) no Hoare annotation was computed. [2019-12-07 10:07:58,214 INFO L249 CegarLoopResult]: At program point L624(lines 616 626) the Hoare annotation is: true [2019-12-07 10:07:58,214 INFO L246 CegarLoopResult]: For program point L162(lines 162 543) no Hoare annotation was computed. [2019-12-07 10:07:58,214 INFO L246 CegarLoopResult]: For program point L129(lines 129 554) no Hoare annotation was computed. [2019-12-07 10:07:58,214 INFO L246 CegarLoopResult]: For program point L96(lines 96 565) no Hoare annotation was computed. [2019-12-07 10:07:58,214 INFO L246 CegarLoopResult]: For program point L427(lines 427 431) no Hoare annotation was computed. [2019-12-07 10:07:58,214 INFO L246 CegarLoopResult]: For program point L427-2(lines 197 529) no Hoare annotation was computed. [2019-12-07 10:07:58,214 INFO L249 CegarLoopResult]: At program point L196(lines 195 532) the Hoare annotation is: true [2019-12-07 10:07:58,214 INFO L242 CegarLoopResult]: At program point L163(lines 159 544) the Hoare annotation is: (and (= ULTIMATE.start_ssl3_connect_~s__hit~0 (_ bv0 32)) (not (= (_ bv4432 32) ULTIMATE.start_ssl3_connect_~s__state~0)) (not (= (_ bv3 32) ULTIMATE.start_ssl3_connect_~blastFlag~0)) (not (= (_ bv4369 32) ULTIMATE.start_ssl3_connect_~s__state~0)) (not (= (_ bv0 32) (bvadd ULTIMATE.start_ssl3_connect_~s__state~0 (_ bv4294955004 32)))) (not (= (_ bv5 32) ULTIMATE.start_ssl3_connect_~blastFlag~0)) (not (= (bvadd ULTIMATE.start_ssl3_connect_~s__state~0 (_ bv4294950912 32)) (_ bv0 32))) (not (= (_ bv0 32) (bvadd ULTIMATE.start_ssl3_connect_~s__state~0 (_ bv4294946816 32)))) (= (_ bv61087 32) ULTIMATE.start_ssl3_connect_~ag_Y~0) (not (= (_ bv4368 32) ULTIMATE.start_ssl3_connect_~s__state~0)) (not (= (_ bv4099 32) ULTIMATE.start_ssl3_connect_~s__state~0)) (not (= (_ bv4096 32) ULTIMATE.start_ssl3_connect_~s__state~0)) (= (_ bv65535 32) ULTIMATE.start_ssl3_connect_~ag_X~0)) [2019-12-07 10:07:58,215 INFO L242 CegarLoopResult]: At program point L97(lines 96 565) the Hoare annotation is: (and (= (_ bv0 32) (bvadd ULTIMATE.start_ssl3_connect_~s__state~0 (_ bv4294955004 32))) (= (_ bv0 32) ULTIMATE.start_ssl3_connect_~blastFlag~0)) [2019-12-07 10:07:58,215 INFO L246 CegarLoopResult]: For program point L362(lines 362 366) no Hoare annotation was computed. [2019-12-07 10:07:58,215 INFO L246 CegarLoopResult]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 608) no Hoare annotation was computed. [2019-12-07 10:07:58,215 INFO L246 CegarLoopResult]: For program point L396(lines 396 401) no Hoare annotation was computed. [2019-12-07 10:07:58,215 INFO L246 CegarLoopResult]: For program point L396-2(lines 396 401) no Hoare annotation was computed. [2019-12-07 10:07:58,215 INFO L246 CegarLoopResult]: For program point L165(lines 165 542) no Hoare annotation was computed. [2019-12-07 10:07:58,215 INFO L246 CegarLoopResult]: For program point L132(lines 132 553) no Hoare annotation was computed. [2019-12-07 10:07:58,215 INFO L246 CegarLoopResult]: For program point L99(lines 99 564) no Hoare annotation was computed. [2019-12-07 10:07:58,215 INFO L242 CegarLoopResult]: At program point L133(lines 129 554) the Hoare annotation is: (and (not (= (_ bv4099 32) ULTIMATE.start_ssl3_connect_~s__state~0)) (= ULTIMATE.start_ssl3_connect_~s__hit~0 (_ bv0 32)) (not (= (_ bv4432 32) ULTIMATE.start_ssl3_connect_~s__state~0)) (not (= (_ bv4096 32) ULTIMATE.start_ssl3_connect_~s__state~0)) (not (= (_ bv4369 32) ULTIMATE.start_ssl3_connect_~s__state~0)) (not (= (_ bv0 32) (bvadd ULTIMATE.start_ssl3_connect_~s__state~0 (_ bv4294955004 32)))) (not (= (_ bv5 32) ULTIMATE.start_ssl3_connect_~blastFlag~0)) (not (= (bvadd ULTIMATE.start_ssl3_connect_~s__state~0 (_ bv4294950912 32)) (_ bv0 32))) (not (= (_ bv0 32) (bvadd ULTIMATE.start_ssl3_connect_~s__state~0 (_ bv4294946816 32)))) (= (_ bv61087 32) ULTIMATE.start_ssl3_connect_~ag_Y~0) (not (= (_ bv4368 32) ULTIMATE.start_ssl3_connect_~s__state~0))) [2019-12-07 10:07:58,216 INFO L242 CegarLoopResult]: At program point L530(lines 93 596) the Hoare annotation is: (let ((.cse0 (= ULTIMATE.start_ssl3_connect_~s__hit~0 (_ bv0 32)))) (let ((.cse11 (= (_ bv4528 32) ULTIMATE.start_ssl3_connect_~s__state~0)) (.cse6 (= (bvadd ULTIMATE.start_ssl3_connect_~s__state~0 (_ bv4294967293 32)) (_ bv0 32))) (.cse5 (= (_ bv4368 32) ULTIMATE.start_ssl3_connect_~s__state~0)) (.cse12 (= (_ bv4400 32) ULTIMATE.start_ssl3_connect_~s__state~0)) (.cse9 (not (= (_ bv4368 32) ULTIMATE.start_ssl3_connect_~s__s3__tmp__next_state___0~0))) (.cse1 (not (= (_ bv3 32) ULTIMATE.start_ssl3_connect_~blastFlag~0))) (.cse3 (= (_ bv65535 32) ULTIMATE.start_ssl3_connect_~ag_X~0)) (.cse7 (not .cse0)) (.cse8 (= (_ bv2 32) ULTIMATE.start_ssl3_connect_~blastFlag~0)) (.cse10 (= (_ bv4512 32) ULTIMATE.start_ssl3_connect_~s__state~0)) (.cse2 (not (= (_ bv5 32) ULTIMATE.start_ssl3_connect_~blastFlag~0))) (.cse4 (= (_ bv61087 32) ULTIMATE.start_ssl3_connect_~ag_Y~0))) (or (and .cse0 (= (_ bv4496 32) ULTIMATE.start_ssl3_connect_~s__state~0) .cse1 .cse2 .cse3 .cse4) (and .cse0 .cse1 (= (_ bv4560 32) ULTIMATE.start_ssl3_connect_~s__s3__tmp__next_state___0~0) (not (= (_ bv4369 32) ULTIMATE.start_ssl3_connect_~s__state~0)) (not (= (_ bv0 32) (bvadd ULTIMATE.start_ssl3_connect_~s__state~0 (_ bv4294955004 32)))) .cse2 (not (= (bvadd ULTIMATE.start_ssl3_connect_~s__state~0 (_ bv4294950912 32)) (_ bv0 32))) (not (= (_ bv0 32) (bvadd ULTIMATE.start_ssl3_connect_~s__state~0 (_ bv4294946816 32)))) .cse4 (not .cse5) (not (= (_ bv4099 32) ULTIMATE.start_ssl3_connect_~s__state~0)) (not (= (_ bv4096 32) ULTIMATE.start_ssl3_connect_~s__state~0)) .cse3) (and .cse6 .cse7 .cse8 .cse9) (and .cse0 .cse1 .cse2 .cse3 .cse10 .cse4) (and .cse7 (= (_ bv4560 32) ULTIMATE.start_ssl3_connect_~s__state~0) .cse8) (and .cse0 .cse1 .cse11 .cse2 .cse3 .cse4) (and (= (_ bv1 32) ULTIMATE.start_ssl3_connect_~blastFlag~0) (= (_ bv4384 32) ULTIMATE.start_ssl3_connect_~s__state~0)) (and .cse0 .cse8 .cse12) (and .cse11 .cse7 .cse8) (and .cse0 .cse1 (= (_ bv4480 32) ULTIMATE.start_ssl3_connect_~s__state~0) .cse2 .cse3 .cse4) (and .cse0 .cse1 .cse2 .cse3 (= (_ bv4464 32) ULTIMATE.start_ssl3_connect_~s__state~0) .cse4) (and .cse0 .cse1 .cse2 .cse3 .cse4 (= (_ bv4432 32) ULTIMATE.start_ssl3_connect_~s__state~0)) (and (= (_ bv0 32) (bvadd ULTIMATE.start_ssl3_connect_~s__s3__tmp__next_state___0~0 (_ bv4294967293 32))) (= (_ bv4352 32) ULTIMATE.start_ssl3_connect_~s__state~0) .cse7 .cse8) (and .cse1 .cse6 .cse7 .cse3 .cse9 .cse4) (and (= (_ bv0 32) ULTIMATE.start_ssl3_connect_~blastFlag~0) .cse5) (and .cse0 .cse1 .cse2 .cse12 .cse3 .cse9 .cse4) (and .cse0 .cse1 .cse2 .cse3 .cse4 (= (_ bv4448 32) ULTIMATE.start_ssl3_connect_~s__state~0)) (and .cse7 .cse8 .cse10) (and .cse0 (= (_ bv4416 32) ULTIMATE.start_ssl3_connect_~s__state~0) .cse2 .cse4)))) [2019-12-07 10:07:58,239 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 07.12 10:07:58 BoogieIcfgContainer [2019-12-07 10:07:58,239 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-07 10:07:58,239 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-12-07 10:07:58,239 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-12-07 10:07:58,239 INFO L275 PluginConnector]: Witness Printer initialized [2019-12-07 10:07:58,240 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 10:07:40" (3/4) ... [2019-12-07 10:07:58,242 INFO L137 WitnessPrinter]: Generating witness for correct program [2019-12-07 10:07:58,253 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2019-12-07 10:07:58,254 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2019-12-07 10:07:58,326 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/run_dir_b73ae0b1-f3a2-46c9-8e3b-fe3c43b0904d/bin/uautomizer/witness.graphml [2019-12-07 10:07:58,326 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-12-07 10:07:58,328 INFO L168 Benchmark]: Toolchain (without parser) took 18892.68 ms. Allocated memory was 1.0 GB in the beginning and 2.0 GB in the end (delta: 972.6 MB). Free memory was 952.4 MB in the beginning and 828.2 MB in the end (delta: 124.2 MB). Peak memory consumption was 1.1 GB. Max. memory is 11.5 GB. [2019-12-07 10:07:58,328 INFO L168 Benchmark]: CDTParser took 0.14 ms. Allocated memory is still 1.0 GB. Free memory is still 981.9 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-12-07 10:07:58,328 INFO L168 Benchmark]: CACSL2BoogieTranslator took 248.92 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 137.4 MB). Free memory was 952.4 MB in the beginning and 1.1 GB in the end (delta: -173.8 MB). Peak memory consumption was 26.7 MB. Max. memory is 11.5 GB. [2019-12-07 10:07:58,328 INFO L168 Benchmark]: Boogie Procedure Inliner took 35.43 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-12-07 10:07:58,328 INFO L168 Benchmark]: Boogie Preprocessor took 26.51 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-12-07 10:07:58,329 INFO L168 Benchmark]: RCFGBuilder took 401.57 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 53.1 MB). Peak memory consumption was 53.1 MB. Max. memory is 11.5 GB. [2019-12-07 10:07:58,329 INFO L168 Benchmark]: TraceAbstraction took 18089.31 ms. Allocated memory was 1.2 GB in the beginning and 2.0 GB in the end (delta: 835.2 MB). Free memory was 1.1 GB in the beginning and 828.2 MB in the end (delta: 244.9 MB). Peak memory consumption was 1.1 GB. Max. memory is 11.5 GB. [2019-12-07 10:07:58,329 INFO L168 Benchmark]: Witness Printer took 87.57 ms. Allocated memory is still 2.0 GB. Free memory was 828.2 MB in the beginning and 828.2 MB in the end (delta: 24 B). Peak memory consumption was 24 B. Max. memory is 11.5 GB. [2019-12-07 10:07:58,330 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.14 ms. Allocated memory is still 1.0 GB. Free memory is still 981.9 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 248.92 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 137.4 MB). Free memory was 952.4 MB in the beginning and 1.1 GB in the end (delta: -173.8 MB). Peak memory consumption was 26.7 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 35.43 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * Boogie Preprocessor took 26.51 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 401.57 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 53.1 MB). Peak memory consumption was 53.1 MB. Max. memory is 11.5 GB. * TraceAbstraction took 18089.31 ms. Allocated memory was 1.2 GB in the beginning and 2.0 GB in the end (delta: 835.2 MB). Free memory was 1.1 GB in the beginning and 828.2 MB in the end (delta: 244.9 MB). Peak memory consumption was 1.1 GB. Max. memory is 11.5 GB. * Witness Printer took 87.57 ms. Allocated memory is still 2.0 GB. Free memory was 828.2 MB in the beginning and 828.2 MB in the end (delta: 24 B). Peak memory consumption was 24 B. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 608]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 65]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 171]: Loop Invariant Derived loop invariant: ((((((((((!(4099bv32 == s__state) && !(4432bv32 == s__state)) && !(4096bv32 == s__state)) && !(4369bv32 == s__state)) && !(0bv32 == ~bvadd64(s__state, 4294955004bv32))) && !(s__hit == 0bv32)) && !(4400bv32 == s__state)) && 2bv32 == blastFlag) && !(~bvadd64(s__state, 4294950912bv32) == 0bv32)) && !(0bv32 == ~bvadd64(s__state, 4294946816bv32))) && !(4368bv32 == s__state)) || ((((((((((((s__hit == 0bv32 && !(4432bv32 == s__state)) && !(3bv32 == blastFlag)) && !(4369bv32 == s__state)) && !(0bv32 == ~bvadd64(s__state, 4294955004bv32))) && !(5bv32 == blastFlag)) && !(~bvadd64(s__state, 4294950912bv32) == 0bv32)) && !(0bv32 == ~bvadd64(s__state, 4294946816bv32))) && 61087bv32 == ag_Y) && !(4368bv32 == s__state)) && !(4099bv32 == s__state)) && !(4096bv32 == s__state)) && 65535bv32 == ag_X) - InvariantResult [Line: 129]: Loop Invariant Derived loop invariant: (((((((((!(4099bv32 == s__state) && s__hit == 0bv32) && !(4432bv32 == s__state)) && !(4096bv32 == s__state)) && !(4369bv32 == s__state)) && !(0bv32 == ~bvadd64(s__state, 4294955004bv32))) && !(5bv32 == blastFlag)) && !(~bvadd64(s__state, 4294950912bv32) == 0bv32)) && !(0bv32 == ~bvadd64(s__state, 4294946816bv32))) && 61087bv32 == ag_Y) && !(4368bv32 == s__state) - InvariantResult [Line: 183]: Loop Invariant Derived loop invariant: (((((((((((((s__hit == 0bv32 && !(3bv32 == blastFlag)) && !(4432bv32 == s__state)) && 4560bv32 == s__s3__tmp__next_state___0) && !(4369bv32 == s__state)) && !(0bv32 == ~bvadd64(s__state, 4294955004bv32))) && !(5bv32 == blastFlag)) && !(~bvadd64(s__state, 4294950912bv32) == 0bv32)) && !(0bv32 == ~bvadd64(s__state, 4294946816bv32))) && 61087bv32 == ag_Y) && !(4368bv32 == s__state)) && !(4099bv32 == s__state)) && !(4096bv32 == s__state)) && 65535bv32 == ag_X) || ((((((((((!(4099bv32 == s__state) && !(4432bv32 == s__state)) && !(4096bv32 == s__state)) && !(4369bv32 == s__state)) && !(0bv32 == ~bvadd64(s__state, 4294955004bv32))) && !(s__hit == 0bv32)) && !(4400bv32 == s__state)) && 2bv32 == blastFlag) && !(~bvadd64(s__state, 4294950912bv32) == 0bv32)) && !(0bv32 == ~bvadd64(s__state, 4294946816bv32))) && !(4368bv32 == s__state)) - InvariantResult [Line: 141]: Loop Invariant Derived loop invariant: (((((((((((s__hit == 0bv32 && !(4432bv32 == s__state)) && !(3bv32 == blastFlag)) && !(4369bv32 == s__state)) && !(0bv32 == ~bvadd64(s__state, 4294955004bv32))) && !(5bv32 == blastFlag)) && !(~bvadd64(s__state, 4294950912bv32) == 0bv32)) && !(0bv32 == ~bvadd64(s__state, 4294946816bv32))) && 61087bv32 == ag_Y) && !(4368bv32 == s__state)) && !(4099bv32 == s__state)) && !(4096bv32 == s__state)) && 65535bv32 == ag_X - InvariantResult [Line: 147]: Loop Invariant Derived loop invariant: (((((((((((s__hit == 0bv32 && !(4432bv32 == s__state)) && !(3bv32 == blastFlag)) && !(4369bv32 == s__state)) && !(0bv32 == ~bvadd64(s__state, 4294955004bv32))) && !(5bv32 == blastFlag)) && !(~bvadd64(s__state, 4294950912bv32) == 0bv32)) && !(0bv32 == ~bvadd64(s__state, 4294946816bv32))) && 61087bv32 == ag_Y) && !(4368bv32 == s__state)) && !(4099bv32 == s__state)) && !(4096bv32 == s__state)) && 65535bv32 == ag_X - InvariantResult [Line: 111]: Loop Invariant Derived loop invariant: (((((((!(4099bv32 == s__state) && !(4432bv32 == s__state)) && !(4096bv32 == s__state)) && 0bv32 == blastFlag) && !(4369bv32 == s__state)) && !(0bv32 == ~bvadd64(s__state, 4294955004bv32))) && !(4400bv32 == s__state)) && !(~bvadd64(s__state, 4294950912bv32) == 0bv32)) && !(0bv32 == ~bvadd64(s__state, 4294946816bv32)) - InvariantResult [Line: 92]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 189]: Loop Invariant Derived loop invariant: (((0bv32 == ~bvadd64(s__s3__tmp__next_state___0, 4294967293bv32) && 4352bv32 == s__state) && !(s__hit == 0bv32)) && 2bv32 == blastFlag) || ((((((s__hit == 0bv32 && !(3bv32 == blastFlag)) && 4560bv32 == s__s3__tmp__next_state___0) && 4352bv32 == s__state) && !(5bv32 == blastFlag)) && 65535bv32 == ag_X) && 61087bv32 == ag_Y) - InvariantResult [Line: 165]: Loop Invariant Derived loop invariant: (((((((((((s__hit == 0bv32 && !(4432bv32 == s__state)) && !(3bv32 == blastFlag)) && !(4369bv32 == s__state)) && !(0bv32 == ~bvadd64(s__state, 4294955004bv32))) && !(5bv32 == blastFlag)) && !(~bvadd64(s__state, 4294950912bv32) == 0bv32)) && !(0bv32 == ~bvadd64(s__state, 4294946816bv32))) && 61087bv32 == ag_Y) && !(4368bv32 == s__state)) && !(4099bv32 == s__state)) && !(4096bv32 == s__state)) && 65535bv32 == ag_X - InvariantResult [Line: 123]: Loop Invariant Derived loop invariant: (((((((((((((s__hit == 0bv32 && !(3bv32 == blastFlag)) && !(4432bv32 == s__state)) && !(4369bv32 == s__state)) && !(0bv32 == ~bvadd64(s__state, 4294955004bv32))) && !(5bv32 == blastFlag)) && !(~bvadd64(s__state, 4294950912bv32) == 0bv32)) && !(0bv32 == ~bvadd64(s__state, 4294946816bv32))) && !(4368bv32 == s__s3__tmp__next_state___0)) && 61087bv32 == ag_Y) && !(4368bv32 == s__state)) && !(4099bv32 == s__state)) && !(4096bv32 == s__state)) && 65535bv32 == ag_X) || (((((((((!(4099bv32 == s__state) && s__hit == 0bv32) && !(4432bv32 == s__state)) && !(4096bv32 == s__state)) && !(4369bv32 == s__state)) && !(0bv32 == ~bvadd64(s__state, 4294955004bv32))) && 2bv32 == blastFlag) && !(~bvadd64(s__state, 4294950912bv32) == 0bv32)) && !(0bv32 == ~bvadd64(s__state, 4294946816bv32))) && !(4368bv32 == s__state)) - InvariantResult [Line: 99]: Loop Invariant Derived loop invariant: (((((((!(4099bv32 == s__state) && !(4432bv32 == s__state)) && 0bv32 == blastFlag) && !(4369bv32 == s__state)) && !(0bv32 == ~bvadd64(s__state, 4294955004bv32))) && !(4400bv32 == s__state)) && !(~bvadd64(s__state, 4294950912bv32) == 0bv32)) && !(0bv32 == ~bvadd64(s__state, 4294946816bv32))) && !(4368bv32 == s__state) - InvariantResult [Line: 177]: Loop Invariant Derived loop invariant: ((((((((((!(4099bv32 == s__state) && !(4432bv32 == s__state)) && !(4096bv32 == s__state)) && !(4369bv32 == s__state)) && !(0bv32 == ~bvadd64(s__state, 4294955004bv32))) && !(s__hit == 0bv32)) && !(4400bv32 == s__state)) && 2bv32 == blastFlag) && !(~bvadd64(s__state, 4294950912bv32) == 0bv32)) && !(0bv32 == ~bvadd64(s__state, 4294946816bv32))) && !(4368bv32 == s__state)) || ((((((((((((s__hit == 0bv32 && !(4432bv32 == s__state)) && !(3bv32 == blastFlag)) && !(4369bv32 == s__state)) && !(0bv32 == ~bvadd64(s__state, 4294955004bv32))) && !(5bv32 == blastFlag)) && !(~bvadd64(s__state, 4294950912bv32) == 0bv32)) && !(0bv32 == ~bvadd64(s__state, 4294946816bv32))) && 61087bv32 == ag_Y) && !(4368bv32 == s__state)) && !(4099bv32 == s__state)) && !(4096bv32 == s__state)) && 65535bv32 == ag_X) - InvariantResult [Line: 135]: Loop Invariant Derived loop invariant: ((((((((((!(4099bv32 == s__state) && s__hit == 0bv32) && !(3bv32 == blastFlag)) && !(4096bv32 == s__state)) && !(4369bv32 == s__state)) && !(0bv32 == ~bvadd64(s__state, 4294955004bv32))) && !(5bv32 == blastFlag)) && 65535bv32 == ag_X) && !(~bvadd64(s__state, 4294950912bv32) == 0bv32)) && !(0bv32 == ~bvadd64(s__state, 4294946816bv32))) && 61087bv32 == ag_Y) && !(4368bv32 == s__state) - InvariantResult [Line: 96]: Loop Invariant Derived loop invariant: 0bv32 == ~bvadd64(s__state, 4294955004bv32) && 0bv32 == blastFlag - InvariantResult [Line: 93]: Loop Invariant Derived loop invariant: ((((((((((((((((((((((s__hit == 0bv32 && 4496bv32 == s__state) && !(3bv32 == blastFlag)) && !(5bv32 == blastFlag)) && 65535bv32 == ag_X) && 61087bv32 == ag_Y) || ((((((((((((s__hit == 0bv32 && !(3bv32 == blastFlag)) && 4560bv32 == s__s3__tmp__next_state___0) && !(4369bv32 == s__state)) && !(0bv32 == ~bvadd64(s__state, 4294955004bv32))) && !(5bv32 == blastFlag)) && !(~bvadd64(s__state, 4294950912bv32) == 0bv32)) && !(0bv32 == ~bvadd64(s__state, 4294946816bv32))) && 61087bv32 == ag_Y) && !(4368bv32 == s__state)) && !(4099bv32 == s__state)) && !(4096bv32 == s__state)) && 65535bv32 == ag_X)) || (((~bvadd64(s__state, 4294967293bv32) == 0bv32 && !(s__hit == 0bv32)) && 2bv32 == blastFlag) && !(4368bv32 == s__s3__tmp__next_state___0))) || (((((s__hit == 0bv32 && !(3bv32 == blastFlag)) && !(5bv32 == blastFlag)) && 65535bv32 == ag_X) && 4512bv32 == s__state) && 61087bv32 == ag_Y)) || ((!(s__hit == 0bv32) && 4560bv32 == s__state) && 2bv32 == blastFlag)) || (((((s__hit == 0bv32 && !(3bv32 == blastFlag)) && 4528bv32 == s__state) && !(5bv32 == blastFlag)) && 65535bv32 == ag_X) && 61087bv32 == ag_Y)) || (1bv32 == blastFlag && 4384bv32 == s__state)) || ((s__hit == 0bv32 && 2bv32 == blastFlag) && 4400bv32 == s__state)) || ((4528bv32 == s__state && !(s__hit == 0bv32)) && 2bv32 == blastFlag)) || (((((s__hit == 0bv32 && !(3bv32 == blastFlag)) && 4480bv32 == s__state) && !(5bv32 == blastFlag)) && 65535bv32 == ag_X) && 61087bv32 == ag_Y)) || (((((s__hit == 0bv32 && !(3bv32 == blastFlag)) && !(5bv32 == blastFlag)) && 65535bv32 == ag_X) && 4464bv32 == s__state) && 61087bv32 == ag_Y)) || (((((s__hit == 0bv32 && !(3bv32 == blastFlag)) && !(5bv32 == blastFlag)) && 65535bv32 == ag_X) && 61087bv32 == ag_Y) && 4432bv32 == s__state)) || (((0bv32 == ~bvadd64(s__s3__tmp__next_state___0, 4294967293bv32) && 4352bv32 == s__state) && !(s__hit == 0bv32)) && 2bv32 == blastFlag)) || (((((!(3bv32 == blastFlag) && ~bvadd64(s__state, 4294967293bv32) == 0bv32) && !(s__hit == 0bv32)) && 65535bv32 == ag_X) && !(4368bv32 == s__s3__tmp__next_state___0)) && 61087bv32 == ag_Y)) || (0bv32 == blastFlag && 4368bv32 == s__state)) || ((((((s__hit == 0bv32 && !(3bv32 == blastFlag)) && !(5bv32 == blastFlag)) && 4400bv32 == s__state) && 65535bv32 == ag_X) && !(4368bv32 == s__s3__tmp__next_state___0)) && 61087bv32 == ag_Y)) || (((((s__hit == 0bv32 && !(3bv32 == blastFlag)) && !(5bv32 == blastFlag)) && 65535bv32 == ag_X) && 61087bv32 == ag_Y) && 4448bv32 == s__state)) || ((!(s__hit == 0bv32) && 2bv32 == blastFlag) && 4512bv32 == s__state)) || (((s__hit == 0bv32 && 4416bv32 == s__state) && !(5bv32 == blastFlag)) && 61087bv32 == ag_Y) - InvariantResult [Line: 192]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 65]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 616]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 159]: Loop Invariant Derived loop invariant: (((((((((((s__hit == 0bv32 && !(4432bv32 == s__state)) && !(3bv32 == blastFlag)) && !(4369bv32 == s__state)) && !(0bv32 == ~bvadd64(s__state, 4294955004bv32))) && !(5bv32 == blastFlag)) && !(~bvadd64(s__state, 4294950912bv32) == 0bv32)) && !(0bv32 == ~bvadd64(s__state, 4294946816bv32))) && 61087bv32 == ag_Y) && !(4368bv32 == s__state)) && !(4099bv32 == s__state)) && !(4096bv32 == s__state)) && 65535bv32 == ag_X - InvariantResult [Line: 8]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 117]: Loop Invariant Derived loop invariant: (((((((((!(4099bv32 == s__state) && !(4432bv32 == s__state)) && !(4096bv32 == s__state)) && !(4369bv32 == s__state)) && !(0bv32 == ~bvadd64(s__state, 4294955004bv32))) && !(4400bv32 == s__state)) && !(~bvadd64(s__state, 4294950912bv32) == 0bv32)) && !(0bv32 == ~bvadd64(s__state, 4294946816bv32))) && 1bv32 == blastFlag) && !(4368bv32 == s__state)) || (((((((((((((s__hit == 0bv32 && !(4432bv32 == s__state)) && !(3bv32 == blastFlag)) && 4560bv32 == s__s3__tmp__next_state___0) && !(4369bv32 == s__state)) && !(0bv32 == ~bvadd64(s__state, 4294955004bv32))) && !(5bv32 == blastFlag)) && !(~bvadd64(s__state, 4294950912bv32) == 0bv32)) && !(0bv32 == ~bvadd64(s__state, 4294946816bv32))) && 61087bv32 == ag_Y) && !(4368bv32 == s__state)) && !(4099bv32 == s__state)) && !(4096bv32 == s__state)) && 65535bv32 == ag_X) - InvariantResult [Line: 195]: Loop Invariant Derived loop invariant: 1 - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 124 locations, 1 error locations. Result: SAFE, OverallTime: 14.5s, OverallIterations: 24, TraceHistogramMax: 22, AutomataDifference: 4.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 3.5s, HoareTripleCheckerStatistics: 4314 SDtfs, 3643 SDslu, 3957 SDs, 0 SdLazy, 3716 SolverSat, 660 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 2.2s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 10470 GetRequests, 10414 SyntacticMatches, 0 SemanticMatches, 56 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=10023occurred in iteration=21, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 1.1s AutomataMinimizationTime, 24 MinimizatonAttempts, 7174 StatesRemovedByMinimization, 18 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 23 LocationsWithAnnotation, 23 PreInvPairs, 272 NumberOfFragments, 1358 HoareAnnotationTreeSize, 23 FomulaSimplifications, 21204 FormulaSimplificationTreeSizeReduction, 0.6s HoareSimplificationTime, 23 FomulaSimplificationsInter, 14727 FormulaSimplificationTreeSizeReductionInter, 2.8s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.3s SsaConstructionTime, 1.0s SatisfiabilityAnalysisTime, 2.3s InterpolantComputationTime, 5250 NumberOfCodeBlocks, 5250 NumberOfCodeBlocksAsserted, 24 NumberOfCheckSat, 10452 ConstructedInterpolants, 0 QuantifiedInterpolants, 4827765 SizeOfPredicates, 20 NumberOfNonLiveVariables, 6826 ConjunctsInSsa, 52 ConjunctsInUnsatCore, 48 InterpolantComputations, 42 PerfectInterpolantSequences, 43168/43272 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...