./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/ssh-simplified/s3_clnt_3.cil-3.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 678e0110 Calling Ultimate with: /usr/lib/jvm/java-8-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/run_dir_51d892bb-c17d-4536-9550-f6b03eb54ca9/bin/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/run_dir_51d892bb-c17d-4536-9550-f6b03eb54ca9/bin/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_51d892bb-c17d-4536-9550-f6b03eb54ca9/bin/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_51d892bb-c17d-4536-9550-f6b03eb54ca9/bin/uautomizer/config/AutomizerReach.xml -i ../../sv-benchmarks/c/ssh-simplified/s3_clnt_3.cil-3.c -s /tmp/vcloud-vcloud-master/worker/run_dir_51d892bb-c17d-4536-9550-f6b03eb54ca9/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_51d892bb-c17d-4536-9550-f6b03eb54ca9/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 b1d7062786d1cbe42a29d98cc634a5c85ac9a3f1 ............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................. Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.24-678e011 [2019-11-20 02:12:20,636 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-20 02:12:20,638 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-20 02:12:20,656 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-20 02:12:20,656 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-20 02:12:20,658 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-20 02:12:20,660 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-20 02:12:20,670 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-20 02:12:20,676 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-20 02:12:20,679 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-20 02:12:20,680 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-20 02:12:20,681 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-20 02:12:20,682 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-20 02:12:20,683 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-20 02:12:20,684 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-20 02:12:20,685 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-20 02:12:20,686 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-20 02:12:20,687 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-20 02:12:20,688 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-20 02:12:20,693 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-20 02:12:20,698 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-20 02:12:20,700 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-20 02:12:20,703 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-20 02:12:20,704 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-20 02:12:20,709 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-20 02:12:20,710 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-20 02:12:20,711 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-20 02:12:20,713 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-20 02:12:20,714 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-20 02:12:20,716 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-20 02:12:20,716 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-20 02:12:20,717 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-20 02:12:20,717 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-20 02:12:20,718 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-20 02:12:20,719 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-20 02:12:20,720 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-20 02:12:20,720 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-20 02:12:20,720 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-20 02:12:20,721 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-20 02:12:20,722 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-20 02:12:20,723 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-20 02:12:20,724 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_51d892bb-c17d-4536-9550-f6b03eb54ca9/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf [2019-11-20 02:12:20,754 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-20 02:12:20,754 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-20 02:12:20,756 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-20 02:12:20,756 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-20 02:12:20,756 INFO L138 SettingsManager]: * Use SBE=true [2019-11-20 02:12:20,756 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-20 02:12:20,757 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-20 02:12:20,757 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-20 02:12:20,757 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-20 02:12:20,757 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-20 02:12:20,757 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-11-20 02:12:20,758 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-20 02:12:20,758 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-11-20 02:12:20,758 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-20 02:12:20,758 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-20 02:12:20,758 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-20 02:12:20,759 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-11-20 02:12:20,759 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-20 02:12:20,759 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-20 02:12:20,759 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-20 02:12:20,760 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-20 02:12:20,760 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-20 02:12:20,760 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-20 02:12:20,760 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-20 02:12:20,761 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-11-20 02:12:20,761 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-11-20 02:12:20,761 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-11-20 02:12:20,761 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-11-20 02:12:20,761 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_51d892bb-c17d-4536-9550-f6b03eb54ca9/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 -> b1d7062786d1cbe42a29d98cc634a5c85ac9a3f1 [2019-11-20 02:12:20,936 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-20 02:12:20,951 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-20 02:12:20,954 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-20 02:12:20,955 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-20 02:12:20,956 INFO L275 PluginConnector]: CDTParser initialized [2019-11-20 02:12:20,957 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_51d892bb-c17d-4536-9550-f6b03eb54ca9/bin/uautomizer/../../sv-benchmarks/c/ssh-simplified/s3_clnt_3.cil-3.c [2019-11-20 02:12:21,016 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_51d892bb-c17d-4536-9550-f6b03eb54ca9/bin/uautomizer/data/c00850694/9894e2e0fe5743b5a0257740b8c28bae/FLAG4d25cc76e [2019-11-20 02:12:21,615 INFO L306 CDTParser]: Found 1 translation units. [2019-11-20 02:12:21,616 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_51d892bb-c17d-4536-9550-f6b03eb54ca9/sv-benchmarks/c/ssh-simplified/s3_clnt_3.cil-3.c [2019-11-20 02:12:21,627 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_51d892bb-c17d-4536-9550-f6b03eb54ca9/bin/uautomizer/data/c00850694/9894e2e0fe5743b5a0257740b8c28bae/FLAG4d25cc76e [2019-11-20 02:12:21,916 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_51d892bb-c17d-4536-9550-f6b03eb54ca9/bin/uautomizer/data/c00850694/9894e2e0fe5743b5a0257740b8c28bae [2019-11-20 02:12:21,919 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-20 02:12:21,921 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-11-20 02:12:21,923 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-20 02:12:21,923 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-20 02:12:21,927 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-20 02:12:21,928 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.11 02:12:21" (1/1) ... [2019-11-20 02:12:21,930 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@48078027 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 02:12:21, skipping insertion in model container [2019-11-20 02:12:21,930 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.11 02:12:21" (1/1) ... [2019-11-20 02:12:21,938 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-11-20 02:12:21,981 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-11-20 02:12:22,330 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-20 02:12:22,340 INFO L188 MainTranslator]: Completed pre-run [2019-11-20 02:12:22,412 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-20 02:12:22,432 INFO L192 MainTranslator]: Completed translation [2019-11-20 02:12:22,433 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 02:12:22 WrapperNode [2019-11-20 02:12:22,433 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-20 02:12:22,434 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-11-20 02:12:22,434 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-11-20 02:12:22,434 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-11-20 02:12:22,443 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 02:12:22" (1/1) ... [2019-11-20 02:12:22,455 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 02:12:22" (1/1) ... [2019-11-20 02:12:22,516 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-11-20 02:12:22,516 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-20 02:12:22,517 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-20 02:12:22,517 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-20 02:12:22,527 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 02:12:22" (1/1) ... [2019-11-20 02:12:22,535 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 02:12:22" (1/1) ... [2019-11-20 02:12:22,539 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 02:12:22" (1/1) ... [2019-11-20 02:12:22,540 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 02:12:22" (1/1) ... [2019-11-20 02:12:22,549 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 02:12:22" (1/1) ... [2019-11-20 02:12:22,573 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 02:12:22" (1/1) ... [2019-11-20 02:12:22,592 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 02:12:22" (1/1) ... [2019-11-20 02:12:22,597 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-20 02:12:22,597 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-20 02:12:22,598 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-20 02:12:22,598 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-20 02:12:22,599 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 02:12:22" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_51d892bb-c17d-4536-9550-f6b03eb54ca9/bin/uautomizer/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-20 02:12:22,689 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-20 02:12:22,690 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-20 02:12:22,853 WARN L736 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-11-20 02:12:23,570 INFO L689 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##85: assume !false; [2019-11-20 02:12:23,571 INFO L689 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##84: assume false; [2019-11-20 02:12:23,572 INFO L280 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-20 02:12:23,572 INFO L285 CfgBuilder]: Removed 7 assume(true) statements. [2019-11-20 02:12:23,574 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 02:12:23 BoogieIcfgContainer [2019-11-20 02:12:23,574 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-20 02:12:23,578 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-20 02:12:23,581 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-20 02:12:23,584 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-20 02:12:23,585 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.11 02:12:21" (1/3) ... [2019-11-20 02:12:23,586 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3b2d29e0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.11 02:12:23, skipping insertion in model container [2019-11-20 02:12:23,586 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 02:12:22" (2/3) ... [2019-11-20 02:12:23,587 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3b2d29e0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.11 02:12:23, skipping insertion in model container [2019-11-20 02:12:23,587 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 02:12:23" (3/3) ... [2019-11-20 02:12:23,590 INFO L109 eAbstractionObserver]: Analyzing ICFG s3_clnt_3.cil-3.c [2019-11-20 02:12:23,601 INFO L153 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-20 02:12:23,611 INFO L165 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-11-20 02:12:23,623 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-11-20 02:12:23,663 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-20 02:12:23,663 INFO L374 AbstractCegarLoop]: Hoare is true [2019-11-20 02:12:23,663 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-20 02:12:23,663 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-20 02:12:23,664 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-20 02:12:23,664 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-20 02:12:23,664 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-20 02:12:23,664 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-20 02:12:23,684 INFO L276 IsEmpty]: Start isEmpty. Operand 127 states. [2019-11-20 02:12:23,693 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2019-11-20 02:12:23,693 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 02:12:23,694 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-11-20 02:12:23,694 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 02:12:23,701 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 02:12:23,702 INFO L82 PathProgramCache]: Analyzing trace with hash -1449576961, now seen corresponding path program 1 times [2019-11-20 02:12:23,712 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 02:12:23,712 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [362707014] [2019-11-20 02:12:23,713 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 02:12:23,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 02:12:23,924 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 02:12:23,925 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [362707014] [2019-11-20 02:12:23,926 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 02:12:23,926 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-20 02:12:23,928 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [265272261] [2019-11-20 02:12:23,933 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-20 02:12:23,934 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 02:12:23,949 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-20 02:12:23,950 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-20 02:12:23,952 INFO L87 Difference]: Start difference. First operand 127 states. Second operand 3 states. [2019-11-20 02:12:24,228 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 02:12:24,228 INFO L93 Difference]: Finished difference Result 251 states and 426 transitions. [2019-11-20 02:12:24,229 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-20 02:12:24,230 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 23 [2019-11-20 02:12:24,231 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 02:12:24,244 INFO L225 Difference]: With dead ends: 251 [2019-11-20 02:12:24,244 INFO L226 Difference]: Without dead ends: 114 [2019-11-20 02:12:24,248 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-11-20 02:12:24,268 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 114 states. [2019-11-20 02:12:24,296 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 114 to 114. [2019-11-20 02:12:24,298 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 114 states. [2019-11-20 02:12:24,300 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 114 states to 114 states and 171 transitions. [2019-11-20 02:12:24,302 INFO L78 Accepts]: Start accepts. Automaton has 114 states and 171 transitions. Word has length 23 [2019-11-20 02:12:24,302 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 02:12:24,302 INFO L462 AbstractCegarLoop]: Abstraction has 114 states and 171 transitions. [2019-11-20 02:12:24,303 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-20 02:12:24,303 INFO L276 IsEmpty]: Start isEmpty. Operand 114 states and 171 transitions. [2019-11-20 02:12:24,304 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2019-11-20 02:12:24,305 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 02:12:24,305 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 02:12:24,305 INFO L410 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 02:12:24,306 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 02:12:24,306 INFO L82 PathProgramCache]: Analyzing trace with hash 1395170557, now seen corresponding path program 1 times [2019-11-20 02:12:24,306 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 02:12:24,306 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1469414164] [2019-11-20 02:12:24,307 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 02:12:24,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 02:12:24,410 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 02:12:24,411 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1469414164] [2019-11-20 02:12:24,411 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 02:12:24,411 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-20 02:12:24,411 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1771569655] [2019-11-20 02:12:24,419 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-20 02:12:24,420 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 02:12:24,420 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-20 02:12:24,420 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-20 02:12:24,420 INFO L87 Difference]: Start difference. First operand 114 states and 171 transitions. Second operand 3 states. [2019-11-20 02:12:24,670 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 02:12:24,670 INFO L93 Difference]: Finished difference Result 237 states and 359 transitions. [2019-11-20 02:12:24,671 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-20 02:12:24,671 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 36 [2019-11-20 02:12:24,671 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 02:12:24,673 INFO L225 Difference]: With dead ends: 237 [2019-11-20 02:12:24,673 INFO L226 Difference]: Without dead ends: 132 [2019-11-20 02:12:24,675 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-20 02:12:24,676 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 132 states. [2019-11-20 02:12:24,693 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 132 to 129. [2019-11-20 02:12:24,699 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 129 states. [2019-11-20 02:12:24,706 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 129 states to 129 states and 191 transitions. [2019-11-20 02:12:24,706 INFO L78 Accepts]: Start accepts. Automaton has 129 states and 191 transitions. Word has length 36 [2019-11-20 02:12:24,707 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 02:12:24,707 INFO L462 AbstractCegarLoop]: Abstraction has 129 states and 191 transitions. [2019-11-20 02:12:24,707 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-20 02:12:24,707 INFO L276 IsEmpty]: Start isEmpty. Operand 129 states and 191 transitions. [2019-11-20 02:12:24,714 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2019-11-20 02:12:24,714 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 02:12:24,714 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, 1] [2019-11-20 02:12:24,714 INFO L410 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 02:12:24,715 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 02:12:24,715 INFO L82 PathProgramCache]: Analyzing trace with hash -462623258, now seen corresponding path program 1 times [2019-11-20 02:12:24,715 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 02:12:24,715 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [248023715] [2019-11-20 02:12:24,716 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 02:12:24,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 02:12:24,836 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 13 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-11-20 02:12:24,837 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [248023715] [2019-11-20 02:12:24,837 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 02:12:24,837 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-20 02:12:24,837 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1396723535] [2019-11-20 02:12:24,838 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-20 02:12:24,838 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 02:12:24,839 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-20 02:12:24,839 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-20 02:12:24,839 INFO L87 Difference]: Start difference. First operand 129 states and 191 transitions. Second operand 3 states. [2019-11-20 02:12:25,042 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 02:12:25,043 INFO L93 Difference]: Finished difference Result 271 states and 407 transitions. [2019-11-20 02:12:25,044 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-20 02:12:25,045 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 50 [2019-11-20 02:12:25,045 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 02:12:25,047 INFO L225 Difference]: With dead ends: 271 [2019-11-20 02:12:25,048 INFO L226 Difference]: Without dead ends: 151 [2019-11-20 02:12:25,049 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-20 02:12:25,050 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 151 states. [2019-11-20 02:12:25,073 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 151 to 146. [2019-11-20 02:12:25,073 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 146 states. [2019-11-20 02:12:25,074 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 146 states to 146 states and 213 transitions. [2019-11-20 02:12:25,074 INFO L78 Accepts]: Start accepts. Automaton has 146 states and 213 transitions. Word has length 50 [2019-11-20 02:12:25,075 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 02:12:25,075 INFO L462 AbstractCegarLoop]: Abstraction has 146 states and 213 transitions. [2019-11-20 02:12:25,075 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-20 02:12:25,076 INFO L276 IsEmpty]: Start isEmpty. Operand 146 states and 213 transitions. [2019-11-20 02:12:25,077 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-11-20 02:12:25,089 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 02:12:25,089 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-11-20 02:12:25,089 INFO L410 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 02:12:25,090 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 02:12:25,090 INFO L82 PathProgramCache]: Analyzing trace with hash -1174891697, now seen corresponding path program 1 times [2019-11-20 02:12:25,090 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 02:12:25,091 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1277473257] [2019-11-20 02:12:25,091 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 02:12:25,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 02:12:25,282 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 25 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2019-11-20 02:12:25,283 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1277473257] [2019-11-20 02:12:25,283 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 02:12:25,283 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-20 02:12:25,284 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1375918271] [2019-11-20 02:12:25,286 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-20 02:12:25,286 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 02:12:25,287 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-20 02:12:25,287 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-20 02:12:25,287 INFO L87 Difference]: Start difference. First operand 146 states and 213 transitions. Second operand 3 states. [2019-11-20 02:12:25,558 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 02:12:25,558 INFO L93 Difference]: Finished difference Result 334 states and 502 transitions. [2019-11-20 02:12:25,559 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-20 02:12:25,559 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 67 [2019-11-20 02:12:25,560 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 02:12:25,562 INFO L225 Difference]: With dead ends: 334 [2019-11-20 02:12:25,562 INFO L226 Difference]: Without dead ends: 196 [2019-11-20 02:12:25,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-11-20 02:12:25,565 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 196 states. [2019-11-20 02:12:25,579 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 196 to 187. [2019-11-20 02:12:25,579 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 187 states. [2019-11-20 02:12:25,581 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 187 states to 187 states and 263 transitions. [2019-11-20 02:12:25,581 INFO L78 Accepts]: Start accepts. Automaton has 187 states and 263 transitions. Word has length 67 [2019-11-20 02:12:25,582 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 02:12:25,582 INFO L462 AbstractCegarLoop]: Abstraction has 187 states and 263 transitions. [2019-11-20 02:12:25,582 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-20 02:12:25,583 INFO L276 IsEmpty]: Start isEmpty. Operand 187 states and 263 transitions. [2019-11-20 02:12:25,585 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-11-20 02:12:25,585 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 02:12:25,585 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-11-20 02:12:25,586 INFO L410 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 02:12:25,586 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 02:12:25,586 INFO L82 PathProgramCache]: Analyzing trace with hash 1314637265, now seen corresponding path program 1 times [2019-11-20 02:12:25,587 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 02:12:25,587 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [90572892] [2019-11-20 02:12:25,587 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 02:12:25,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 02:12:25,659 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 25 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2019-11-20 02:12:25,659 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [90572892] [2019-11-20 02:12:25,660 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 02:12:25,660 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-20 02:12:25,661 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [798535836] [2019-11-20 02:12:25,661 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-20 02:12:25,662 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 02:12:25,662 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-20 02:12:25,662 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-20 02:12:25,663 INFO L87 Difference]: Start difference. First operand 187 states and 263 transitions. Second operand 3 states. [2019-11-20 02:12:25,857 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 02:12:25,857 INFO L93 Difference]: Finished difference Result 389 states and 554 transitions. [2019-11-20 02:12:25,858 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-20 02:12:25,858 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 67 [2019-11-20 02:12:25,858 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 02:12:25,860 INFO L225 Difference]: With dead ends: 389 [2019-11-20 02:12:25,860 INFO L226 Difference]: Without dead ends: 211 [2019-11-20 02:12:25,862 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-20 02:12:25,863 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 211 states. [2019-11-20 02:12:25,877 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 211 to 206. [2019-11-20 02:12:25,877 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 206 states. [2019-11-20 02:12:25,879 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 206 states to 206 states and 287 transitions. [2019-11-20 02:12:25,879 INFO L78 Accepts]: Start accepts. Automaton has 206 states and 287 transitions. Word has length 67 [2019-11-20 02:12:25,880 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 02:12:25,880 INFO L462 AbstractCegarLoop]: Abstraction has 206 states and 287 transitions. [2019-11-20 02:12:25,880 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-20 02:12:25,881 INFO L276 IsEmpty]: Start isEmpty. Operand 206 states and 287 transitions. [2019-11-20 02:12:25,883 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2019-11-20 02:12:25,883 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 02:12:25,884 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, 1] [2019-11-20 02:12:25,884 INFO L410 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 02:12:25,885 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 02:12:25,885 INFO L82 PathProgramCache]: Analyzing trace with hash -1231866158, now seen corresponding path program 1 times [2019-11-20 02:12:25,885 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 02:12:25,886 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1277335278] [2019-11-20 02:12:25,886 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 02:12:25,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 02:12:25,976 INFO L134 CoverageAnalysis]: Checked inductivity of 80 backedges. 39 proven. 0 refuted. 0 times theorem prover too weak. 41 trivial. 0 not checked. [2019-11-20 02:12:25,978 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1277335278] [2019-11-20 02:12:25,979 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 02:12:25,979 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-20 02:12:25,980 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [130012990] [2019-11-20 02:12:25,981 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-20 02:12:25,982 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 02:12:25,982 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-20 02:12:25,982 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-20 02:12:25,983 INFO L87 Difference]: Start difference. First operand 206 states and 287 transitions. Second operand 3 states. [2019-11-20 02:12:26,194 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 02:12:26,195 INFO L93 Difference]: Finished difference Result 427 states and 603 transitions. [2019-11-20 02:12:26,195 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-20 02:12:26,195 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 84 [2019-11-20 02:12:26,196 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 02:12:26,198 INFO L225 Difference]: With dead ends: 427 [2019-11-20 02:12:26,198 INFO L226 Difference]: Without dead ends: 230 [2019-11-20 02:12:26,199 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-20 02:12:26,202 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 230 states. [2019-11-20 02:12:26,215 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 230 to 227. [2019-11-20 02:12:26,215 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 227 states. [2019-11-20 02:12:26,217 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 227 states to 227 states and 313 transitions. [2019-11-20 02:12:26,217 INFO L78 Accepts]: Start accepts. Automaton has 227 states and 313 transitions. Word has length 84 [2019-11-20 02:12:26,217 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 02:12:26,218 INFO L462 AbstractCegarLoop]: Abstraction has 227 states and 313 transitions. [2019-11-20 02:12:26,218 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-20 02:12:26,218 INFO L276 IsEmpty]: Start isEmpty. Operand 227 states and 313 transitions. [2019-11-20 02:12:26,221 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2019-11-20 02:12:26,221 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 02:12:26,221 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-11-20 02:12:26,222 INFO L410 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 02:12:26,222 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 02:12:26,222 INFO L82 PathProgramCache]: Analyzing trace with hash 266431114, now seen corresponding path program 1 times [2019-11-20 02:12:26,222 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 02:12:26,223 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [920379866] [2019-11-20 02:12:26,223 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 02:12:26,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 02:12:26,346 INFO L134 CoverageAnalysis]: Checked inductivity of 135 backedges. 105 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2019-11-20 02:12:26,347 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [920379866] [2019-11-20 02:12:26,347 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 02:12:26,348 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-20 02:12:26,358 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1640786525] [2019-11-20 02:12:26,359 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-20 02:12:26,360 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 02:12:26,360 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-20 02:12:26,361 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-20 02:12:26,362 INFO L87 Difference]: Start difference. First operand 227 states and 313 transitions. Second operand 3 states. [2019-11-20 02:12:26,423 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 02:12:26,423 INFO L93 Difference]: Finished difference Result 661 states and 912 transitions. [2019-11-20 02:12:26,424 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-20 02:12:26,424 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 104 [2019-11-20 02:12:26,424 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 02:12:26,428 INFO L225 Difference]: With dead ends: 661 [2019-11-20 02:12:26,428 INFO L226 Difference]: Without dead ends: 443 [2019-11-20 02:12:26,429 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-20 02:12:26,430 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 443 states. [2019-11-20 02:12:26,446 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 443 to 443. [2019-11-20 02:12:26,446 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 443 states. [2019-11-20 02:12:26,449 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 443 states to 443 states and 609 transitions. [2019-11-20 02:12:26,449 INFO L78 Accepts]: Start accepts. Automaton has 443 states and 609 transitions. Word has length 104 [2019-11-20 02:12:26,450 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 02:12:26,450 INFO L462 AbstractCegarLoop]: Abstraction has 443 states and 609 transitions. [2019-11-20 02:12:26,450 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-20 02:12:26,450 INFO L276 IsEmpty]: Start isEmpty. Operand 443 states and 609 transitions. [2019-11-20 02:12:26,452 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2019-11-20 02:12:26,452 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 02:12:26,453 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, 1, 1] [2019-11-20 02:12:26,453 INFO L410 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 02:12:26,453 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 02:12:26,454 INFO L82 PathProgramCache]: Analyzing trace with hash -1706663820, now seen corresponding path program 1 times [2019-11-20 02:12:26,454 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 02:12:26,454 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [536954320] [2019-11-20 02:12:26,454 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 02:12:26,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 02:12:26,571 INFO L134 CoverageAnalysis]: Checked inductivity of 135 backedges. 55 proven. 0 refuted. 0 times theorem prover too weak. 80 trivial. 0 not checked. [2019-11-20 02:12:26,572 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [536954320] [2019-11-20 02:12:26,572 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 02:12:26,572 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-20 02:12:26,572 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [962705015] [2019-11-20 02:12:26,573 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-20 02:12:26,573 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 02:12:26,573 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-20 02:12:26,574 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-20 02:12:26,574 INFO L87 Difference]: Start difference. First operand 443 states and 609 transitions. Second operand 3 states. [2019-11-20 02:12:26,626 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 02:12:26,626 INFO L93 Difference]: Finished difference Result 661 states and 909 transitions. [2019-11-20 02:12:26,627 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-20 02:12:26,627 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 106 [2019-11-20 02:12:26,628 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 02:12:26,632 INFO L225 Difference]: With dead ends: 661 [2019-11-20 02:12:26,633 INFO L226 Difference]: Without dead ends: 659 [2019-11-20 02:12:26,633 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-20 02:12:26,635 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 659 states. [2019-11-20 02:12:26,651 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 659 to 659. [2019-11-20 02:12:26,651 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 659 states. [2019-11-20 02:12:26,655 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 659 states to 659 states and 907 transitions. [2019-11-20 02:12:26,655 INFO L78 Accepts]: Start accepts. Automaton has 659 states and 907 transitions. Word has length 106 [2019-11-20 02:12:26,656 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 02:12:26,656 INFO L462 AbstractCegarLoop]: Abstraction has 659 states and 907 transitions. [2019-11-20 02:12:26,656 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-20 02:12:26,656 INFO L276 IsEmpty]: Start isEmpty. Operand 659 states and 907 transitions. [2019-11-20 02:12:26,659 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 162 [2019-11-20 02:12:26,659 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 02:12:26,660 INFO L410 BasicCegarLoop]: trace histogram [9, 9, 8, 8, 8, 8, 8, 8, 8, 7, 7, 5, 5, 3, 3, 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] [2019-11-20 02:12:26,660 INFO L410 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 02:12:26,660 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 02:12:26,660 INFO L82 PathProgramCache]: Analyzing trace with hash 589479754, now seen corresponding path program 1 times [2019-11-20 02:12:26,661 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 02:12:26,661 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1083847976] [2019-11-20 02:12:26,661 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 02:12:26,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 02:12:26,748 INFO L134 CoverageAnalysis]: Checked inductivity of 384 backedges. 260 proven. 0 refuted. 0 times theorem prover too weak. 124 trivial. 0 not checked. [2019-11-20 02:12:26,749 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1083847976] [2019-11-20 02:12:26,749 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 02:12:26,749 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-20 02:12:26,750 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1529254349] [2019-11-20 02:12:26,750 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-20 02:12:26,750 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 02:12:26,751 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-20 02:12:26,751 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-20 02:12:26,751 INFO L87 Difference]: Start difference. First operand 659 states and 907 transitions. Second operand 3 states. [2019-11-20 02:12:26,961 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 02:12:26,961 INFO L93 Difference]: Finished difference Result 1462 states and 2068 transitions. [2019-11-20 02:12:26,961 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-20 02:12:26,961 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 161 [2019-11-20 02:12:26,962 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 02:12:26,968 INFO L225 Difference]: With dead ends: 1462 [2019-11-20 02:12:26,968 INFO L226 Difference]: Without dead ends: 809 [2019-11-20 02:12:26,969 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-20 02:12:26,971 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 809 states. [2019-11-20 02:12:26,992 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 809 to 776. [2019-11-20 02:12:26,992 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 776 states. [2019-11-20 02:12:26,996 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 776 states to 776 states and 1096 transitions. [2019-11-20 02:12:26,997 INFO L78 Accepts]: Start accepts. Automaton has 776 states and 1096 transitions. Word has length 161 [2019-11-20 02:12:26,997 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 02:12:26,997 INFO L462 AbstractCegarLoop]: Abstraction has 776 states and 1096 transitions. [2019-11-20 02:12:26,998 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-20 02:12:26,998 INFO L276 IsEmpty]: Start isEmpty. Operand 776 states and 1096 transitions. [2019-11-20 02:12:27,001 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 189 [2019-11-20 02:12:27,001 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 02:12:27,002 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, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 02:12:27,002 INFO L410 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 02:12:27,002 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 02:12:27,003 INFO L82 PathProgramCache]: Analyzing trace with hash 1596288335, now seen corresponding path program 1 times [2019-11-20 02:12:27,003 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 02:12:27,003 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1725729591] [2019-11-20 02:12:27,003 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 02:12:27,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 02:12:27,076 INFO L134 CoverageAnalysis]: Checked inductivity of 527 backedges. 327 proven. 0 refuted. 0 times theorem prover too weak. 200 trivial. 0 not checked. [2019-11-20 02:12:27,076 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1725729591] [2019-11-20 02:12:27,077 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 02:12:27,077 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-20 02:12:27,077 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1604437694] [2019-11-20 02:12:27,078 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-20 02:12:27,078 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 02:12:27,078 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-20 02:12:27,078 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-20 02:12:27,078 INFO L87 Difference]: Start difference. First operand 776 states and 1096 transitions. Second operand 3 states. [2019-11-20 02:12:27,313 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 02:12:27,313 INFO L93 Difference]: Finished difference Result 1824 states and 2649 transitions. [2019-11-20 02:12:27,314 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-20 02:12:27,314 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 188 [2019-11-20 02:12:27,314 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 02:12:27,321 INFO L225 Difference]: With dead ends: 1824 [2019-11-20 02:12:27,322 INFO L226 Difference]: Without dead ends: 1006 [2019-11-20 02:12:27,324 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-20 02:12:27,326 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1006 states. [2019-11-20 02:12:27,351 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1006 to 965. [2019-11-20 02:12:27,352 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 965 states. [2019-11-20 02:12:27,356 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 965 states to 965 states and 1348 transitions. [2019-11-20 02:12:27,357 INFO L78 Accepts]: Start accepts. Automaton has 965 states and 1348 transitions. Word has length 188 [2019-11-20 02:12:27,357 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 02:12:27,357 INFO L462 AbstractCegarLoop]: Abstraction has 965 states and 1348 transitions. [2019-11-20 02:12:27,357 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-20 02:12:27,357 INFO L276 IsEmpty]: Start isEmpty. Operand 965 states and 1348 transitions. [2019-11-20 02:12:27,361 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 210 [2019-11-20 02:12:27,361 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 02:12:27,361 INFO L410 BasicCegarLoop]: trace histogram [12, 12, 11, 11, 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, 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] [2019-11-20 02:12:27,362 INFO L410 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 02:12:27,362 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 02:12:27,362 INFO L82 PathProgramCache]: Analyzing trace with hash -1275827432, now seen corresponding path program 1 times [2019-11-20 02:12:27,362 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 02:12:27,363 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1115292717] [2019-11-20 02:12:27,363 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 02:12:27,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 02:12:27,440 INFO L134 CoverageAnalysis]: Checked inductivity of 659 backedges. 404 proven. 0 refuted. 0 times theorem prover too weak. 255 trivial. 0 not checked. [2019-11-20 02:12:27,440 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1115292717] [2019-11-20 02:12:27,441 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 02:12:27,441 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-20 02:12:27,441 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [922605380] [2019-11-20 02:12:27,442 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-20 02:12:27,442 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 02:12:27,442 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-20 02:12:27,442 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-20 02:12:27,442 INFO L87 Difference]: Start difference. First operand 965 states and 1348 transitions. Second operand 3 states. [2019-11-20 02:12:27,661 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 02:12:27,662 INFO L93 Difference]: Finished difference Result 2080 states and 2926 transitions. [2019-11-20 02:12:27,662 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-20 02:12:27,662 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 209 [2019-11-20 02:12:27,663 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 02:12:27,670 INFO L225 Difference]: With dead ends: 2080 [2019-11-20 02:12:27,670 INFO L226 Difference]: Without dead ends: 1079 [2019-11-20 02:12:27,672 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-20 02:12:27,674 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1079 states. [2019-11-20 02:12:27,703 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1079 to 1040. [2019-11-20 02:12:27,703 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1040 states. [2019-11-20 02:12:27,708 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1040 states to 1040 states and 1444 transitions. [2019-11-20 02:12:27,708 INFO L78 Accepts]: Start accepts. Automaton has 1040 states and 1444 transitions. Word has length 209 [2019-11-20 02:12:27,709 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 02:12:27,709 INFO L462 AbstractCegarLoop]: Abstraction has 1040 states and 1444 transitions. [2019-11-20 02:12:27,709 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-20 02:12:27,709 INFO L276 IsEmpty]: Start isEmpty. Operand 1040 states and 1444 transitions. [2019-11-20 02:12:27,714 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 234 [2019-11-20 02:12:27,714 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 02:12:27,715 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, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 02:12:27,715 INFO L410 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 02:12:27,715 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 02:12:27,715 INFO L82 PathProgramCache]: Analyzing trace with hash 1859847365, now seen corresponding path program 1 times [2019-11-20 02:12:27,716 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 02:12:27,716 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [62063215] [2019-11-20 02:12:27,716 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 02:12:27,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 02:12:27,846 INFO L134 CoverageAnalysis]: Checked inductivity of 807 backedges. 479 proven. 0 refuted. 0 times theorem prover too weak. 328 trivial. 0 not checked. [2019-11-20 02:12:27,846 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [62063215] [2019-11-20 02:12:27,847 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 02:12:27,847 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-20 02:12:27,847 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1235407883] [2019-11-20 02:12:27,848 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-20 02:12:27,848 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 02:12:27,848 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-20 02:12:27,848 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-20 02:12:27,849 INFO L87 Difference]: Start difference. First operand 1040 states and 1444 transitions. Second operand 3 states. [2019-11-20 02:12:28,096 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 02:12:28,096 INFO L93 Difference]: Finished difference Result 2230 states and 3115 transitions. [2019-11-20 02:12:28,097 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-20 02:12:28,097 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 233 [2019-11-20 02:12:28,098 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 02:12:28,105 INFO L225 Difference]: With dead ends: 2230 [2019-11-20 02:12:28,105 INFO L226 Difference]: Without dead ends: 1160 [2019-11-20 02:12:28,107 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-20 02:12:28,109 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1160 states. [2019-11-20 02:12:28,169 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1160 to 1124. [2019-11-20 02:12:28,170 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1124 states. [2019-11-20 02:12:28,175 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1124 states to 1124 states and 1555 transitions. [2019-11-20 02:12:28,175 INFO L78 Accepts]: Start accepts. Automaton has 1124 states and 1555 transitions. Word has length 233 [2019-11-20 02:12:28,175 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 02:12:28,175 INFO L462 AbstractCegarLoop]: Abstraction has 1124 states and 1555 transitions. [2019-11-20 02:12:28,176 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-20 02:12:28,176 INFO L276 IsEmpty]: Start isEmpty. Operand 1124 states and 1555 transitions. [2019-11-20 02:12:28,180 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 234 [2019-11-20 02:12:28,180 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 02:12:28,180 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, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 02:12:28,180 INFO L410 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 02:12:28,180 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 02:12:28,181 INFO L82 PathProgramCache]: Analyzing trace with hash 1978288839, now seen corresponding path program 1 times [2019-11-20 02:12:28,181 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 02:12:28,181 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [859236066] [2019-11-20 02:12:28,181 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 02:12:28,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 02:12:28,265 INFO L134 CoverageAnalysis]: Checked inductivity of 807 backedges. 479 proven. 0 refuted. 0 times theorem prover too weak. 328 trivial. 0 not checked. [2019-11-20 02:12:28,266 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [859236066] [2019-11-20 02:12:28,266 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 02:12:28,266 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-20 02:12:28,266 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1713223173] [2019-11-20 02:12:28,267 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-20 02:12:28,267 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 02:12:28,267 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-20 02:12:28,268 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-20 02:12:28,268 INFO L87 Difference]: Start difference. First operand 1124 states and 1555 transitions. Second operand 3 states. [2019-11-20 02:12:28,485 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 02:12:28,485 INFO L93 Difference]: Finished difference Result 2398 states and 3340 transitions. [2019-11-20 02:12:28,485 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-20 02:12:28,485 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 233 [2019-11-20 02:12:28,486 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 02:12:28,493 INFO L225 Difference]: With dead ends: 2398 [2019-11-20 02:12:28,493 INFO L226 Difference]: Without dead ends: 1256 [2019-11-20 02:12:28,495 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-20 02:12:28,498 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1256 states. [2019-11-20 02:12:28,527 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1256 to 1217. [2019-11-20 02:12:28,528 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1217 states. [2019-11-20 02:12:28,533 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1217 states to 1217 states and 1687 transitions. [2019-11-20 02:12:28,534 INFO L78 Accepts]: Start accepts. Automaton has 1217 states and 1687 transitions. Word has length 233 [2019-11-20 02:12:28,534 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 02:12:28,534 INFO L462 AbstractCegarLoop]: Abstraction has 1217 states and 1687 transitions. [2019-11-20 02:12:28,534 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-20 02:12:28,535 INFO L276 IsEmpty]: Start isEmpty. Operand 1217 states and 1687 transitions. [2019-11-20 02:12:28,541 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 264 [2019-11-20 02:12:28,541 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 02:12:28,541 INFO L410 BasicCegarLoop]: trace histogram [14, 14, 13, 13, 12, 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, 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] [2019-11-20 02:12:28,542 INFO L410 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 02:12:28,542 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 02:12:28,542 INFO L82 PathProgramCache]: Analyzing trace with hash 1116608197, now seen corresponding path program 1 times [2019-11-20 02:12:28,542 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 02:12:28,547 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1771522106] [2019-11-20 02:12:28,547 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 02:12:28,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 02:12:28,666 INFO L134 CoverageAnalysis]: Checked inductivity of 975 backedges. 622 proven. 0 refuted. 0 times theorem prover too weak. 353 trivial. 0 not checked. [2019-11-20 02:12:28,667 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1771522106] [2019-11-20 02:12:28,667 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 02:12:28,667 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-20 02:12:28,667 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1105830633] [2019-11-20 02:12:28,668 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-20 02:12:28,668 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 02:12:28,668 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-20 02:12:28,669 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-20 02:12:28,669 INFO L87 Difference]: Start difference. First operand 1217 states and 1687 transitions. Second operand 3 states. [2019-11-20 02:12:28,724 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 02:12:28,724 INFO L93 Difference]: Finished difference Result 3630 states and 5032 transitions. [2019-11-20 02:12:28,724 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-20 02:12:28,725 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 263 [2019-11-20 02:12:28,725 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 02:12:28,741 INFO L225 Difference]: With dead ends: 3630 [2019-11-20 02:12:28,741 INFO L226 Difference]: Without dead ends: 2422 [2019-11-20 02:12:28,744 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-20 02:12:28,748 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2422 states. [2019-11-20 02:12:28,809 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2422 to 2420. [2019-11-20 02:12:28,809 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2420 states. [2019-11-20 02:12:28,821 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2420 states to 2420 states and 3354 transitions. [2019-11-20 02:12:28,821 INFO L78 Accepts]: Start accepts. Automaton has 2420 states and 3354 transitions. Word has length 263 [2019-11-20 02:12:28,822 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 02:12:28,822 INFO L462 AbstractCegarLoop]: Abstraction has 2420 states and 3354 transitions. [2019-11-20 02:12:28,822 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-20 02:12:28,822 INFO L276 IsEmpty]: Start isEmpty. Operand 2420 states and 3354 transitions. [2019-11-20 02:12:28,830 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 264 [2019-11-20 02:12:28,830 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 02:12:28,831 INFO L410 BasicCegarLoop]: trace histogram [14, 14, 13, 13, 12, 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, 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] [2019-11-20 02:12:28,831 INFO L410 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 02:12:28,831 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 02:12:28,831 INFO L82 PathProgramCache]: Analyzing trace with hash 1235049671, now seen corresponding path program 1 times [2019-11-20 02:12:28,832 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 02:12:28,832 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [34582840] [2019-11-20 02:12:28,832 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 02:12:28,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 02:12:28,946 INFO L134 CoverageAnalysis]: Checked inductivity of 975 backedges. 554 proven. 0 refuted. 0 times theorem prover too weak. 421 trivial. 0 not checked. [2019-11-20 02:12:28,946 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [34582840] [2019-11-20 02:12:28,946 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 02:12:28,947 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-20 02:12:28,947 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [330960464] [2019-11-20 02:12:28,947 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-20 02:12:28,948 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 02:12:28,948 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-20 02:12:28,949 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-20 02:12:28,949 INFO L87 Difference]: Start difference. First operand 2420 states and 3354 transitions. Second operand 3 states. [2019-11-20 02:12:29,205 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 02:12:29,205 INFO L93 Difference]: Finished difference Result 5143 states and 7169 transitions. [2019-11-20 02:12:29,206 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-20 02:12:29,206 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 263 [2019-11-20 02:12:29,206 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 02:12:29,224 INFO L225 Difference]: With dead ends: 5143 [2019-11-20 02:12:29,224 INFO L226 Difference]: Without dead ends: 2702 [2019-11-20 02:12:29,230 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-20 02:12:29,234 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2702 states. [2019-11-20 02:12:29,311 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2702 to 2630. [2019-11-20 02:12:29,311 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2630 states. [2019-11-20 02:12:29,326 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2630 states to 2630 states and 3666 transitions. [2019-11-20 02:12:29,326 INFO L78 Accepts]: Start accepts. Automaton has 2630 states and 3666 transitions. Word has length 263 [2019-11-20 02:12:29,327 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 02:12:29,327 INFO L462 AbstractCegarLoop]: Abstraction has 2630 states and 3666 transitions. [2019-11-20 02:12:29,327 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-20 02:12:29,328 INFO L276 IsEmpty]: Start isEmpty. Operand 2630 states and 3666 transitions. [2019-11-20 02:12:29,338 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 299 [2019-11-20 02:12:29,338 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 02:12:29,339 INFO L410 BasicCegarLoop]: trace histogram [15, 15, 14, 14, 13, 13, 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, 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-11-20 02:12:29,339 INFO L410 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 02:12:29,339 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 02:12:29,339 INFO L82 PathProgramCache]: Analyzing trace with hash 2135776069, now seen corresponding path program 1 times [2019-11-20 02:12:29,340 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 02:12:29,340 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [692360151] [2019-11-20 02:12:29,340 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 02:12:29,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 02:12:29,533 INFO L134 CoverageAnalysis]: Checked inductivity of 1169 backedges. 629 proven. 0 refuted. 0 times theorem prover too weak. 540 trivial. 0 not checked. [2019-11-20 02:12:29,534 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [692360151] [2019-11-20 02:12:29,536 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 02:12:29,536 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-20 02:12:29,536 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1912265296] [2019-11-20 02:12:29,537 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-20 02:12:29,537 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 02:12:29,537 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-20 02:12:29,537 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-20 02:12:29,538 INFO L87 Difference]: Start difference. First operand 2630 states and 3666 transitions. Second operand 3 states. [2019-11-20 02:12:29,817 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 02:12:29,817 INFO L93 Difference]: Finished difference Result 5335 states and 7421 transitions. [2019-11-20 02:12:29,817 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-20 02:12:29,817 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 298 [2019-11-20 02:12:29,818 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 02:12:29,835 INFO L225 Difference]: With dead ends: 5335 [2019-11-20 02:12:29,836 INFO L226 Difference]: Without dead ends: 2696 [2019-11-20 02:12:29,839 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-20 02:12:29,844 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2696 states. [2019-11-20 02:12:29,927 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2696 to 2624. [2019-11-20 02:12:29,927 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2624 states. [2019-11-20 02:12:29,939 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2624 states to 2624 states and 3630 transitions. [2019-11-20 02:12:29,940 INFO L78 Accepts]: Start accepts. Automaton has 2624 states and 3630 transitions. Word has length 298 [2019-11-20 02:12:29,941 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 02:12:29,941 INFO L462 AbstractCegarLoop]: Abstraction has 2624 states and 3630 transitions. [2019-11-20 02:12:29,941 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-20 02:12:29,941 INFO L276 IsEmpty]: Start isEmpty. Operand 2624 states and 3630 transitions. [2019-11-20 02:12:29,950 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 308 [2019-11-20 02:12:29,950 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 02:12:29,950 INFO L410 BasicCegarLoop]: trace histogram [14, 14, 13, 13, 13, 13, 13, 13, 13, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 02:12:29,951 INFO L410 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 02:12:29,951 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 02:12:29,951 INFO L82 PathProgramCache]: Analyzing trace with hash -901475869, now seen corresponding path program 1 times [2019-11-20 02:12:29,951 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 02:12:29,951 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1847436915] [2019-11-20 02:12:29,952 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 02:12:29,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 02:12:30,090 INFO L134 CoverageAnalysis]: Checked inductivity of 1175 backedges. 562 proven. 0 refuted. 0 times theorem prover too weak. 613 trivial. 0 not checked. [2019-11-20 02:12:30,090 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1847436915] [2019-11-20 02:12:30,091 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 02:12:30,091 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-20 02:12:30,091 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1399456499] [2019-11-20 02:12:30,092 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-20 02:12:30,092 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 02:12:30,092 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-20 02:12:30,092 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-20 02:12:30,093 INFO L87 Difference]: Start difference. First operand 2624 states and 3630 transitions. Second operand 3 states. [2019-11-20 02:12:30,315 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 02:12:30,315 INFO L93 Difference]: Finished difference Result 5299 states and 7319 transitions. [2019-11-20 02:12:30,316 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-20 02:12:30,316 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 307 [2019-11-20 02:12:30,317 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 02:12:30,334 INFO L225 Difference]: With dead ends: 5299 [2019-11-20 02:12:30,334 INFO L226 Difference]: Without dead ends: 2684 [2019-11-20 02:12:30,338 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-20 02:12:30,343 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2684 states. [2019-11-20 02:12:30,418 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2684 to 2624. [2019-11-20 02:12:30,418 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2624 states. [2019-11-20 02:12:30,425 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2624 states to 2624 states and 3576 transitions. [2019-11-20 02:12:30,425 INFO L78 Accepts]: Start accepts. Automaton has 2624 states and 3576 transitions. Word has length 307 [2019-11-20 02:12:30,426 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 02:12:30,426 INFO L462 AbstractCegarLoop]: Abstraction has 2624 states and 3576 transitions. [2019-11-20 02:12:30,426 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-20 02:12:30,426 INFO L276 IsEmpty]: Start isEmpty. Operand 2624 states and 3576 transitions. [2019-11-20 02:12:30,436 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 336 [2019-11-20 02:12:30,436 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 02:12:30,437 INFO L410 BasicCegarLoop]: trace histogram [16, 16, 15, 15, 15, 15, 14, 14, 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, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 02:12:30,437 INFO L410 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 02:12:30,437 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 02:12:30,437 INFO L82 PathProgramCache]: Analyzing trace with hash 503398906, now seen corresponding path program 1 times [2019-11-20 02:12:30,437 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 02:12:30,438 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [851480239] [2019-11-20 02:12:30,438 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 02:12:30,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 02:12:30,589 INFO L134 CoverageAnalysis]: Checked inductivity of 1420 backedges. 731 proven. 0 refuted. 0 times theorem prover too weak. 689 trivial. 0 not checked. [2019-11-20 02:12:30,589 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [851480239] [2019-11-20 02:12:30,590 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 02:12:30,590 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-20 02:12:30,590 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [723355331] [2019-11-20 02:12:30,591 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-20 02:12:30,595 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 02:12:30,596 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-20 02:12:30,596 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-20 02:12:30,596 INFO L87 Difference]: Start difference. First operand 2624 states and 3576 transitions. Second operand 3 states. [2019-11-20 02:12:30,893 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 02:12:30,893 INFO L93 Difference]: Finished difference Result 5545 states and 7499 transitions. [2019-11-20 02:12:30,894 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-20 02:12:30,894 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 335 [2019-11-20 02:12:30,895 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 02:12:30,913 INFO L225 Difference]: With dead ends: 5545 [2019-11-20 02:12:30,913 INFO L226 Difference]: Without dead ends: 2930 [2019-11-20 02:12:30,917 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-20 02:12:30,921 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2930 states. [2019-11-20 02:12:31,003 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2930 to 2714. [2019-11-20 02:12:31,004 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2714 states. [2019-11-20 02:12:31,010 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2714 states to 2714 states and 3696 transitions. [2019-11-20 02:12:31,011 INFO L78 Accepts]: Start accepts. Automaton has 2714 states and 3696 transitions. Word has length 335 [2019-11-20 02:12:31,011 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 02:12:31,012 INFO L462 AbstractCegarLoop]: Abstraction has 2714 states and 3696 transitions. [2019-11-20 02:12:31,012 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-20 02:12:31,012 INFO L276 IsEmpty]: Start isEmpty. Operand 2714 states and 3696 transitions. [2019-11-20 02:12:31,021 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 337 [2019-11-20 02:12:31,021 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 02:12:31,022 INFO L410 BasicCegarLoop]: trace histogram [16, 16, 15, 15, 15, 15, 14, 14, 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, 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] [2019-11-20 02:12:31,022 INFO L410 AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 02:12:31,022 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 02:12:31,023 INFO L82 PathProgramCache]: Analyzing trace with hash -121520003, now seen corresponding path program 1 times [2019-11-20 02:12:31,025 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 02:12:31,025 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [619726261] [2019-11-20 02:12:31,025 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 02:12:31,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 02:12:31,224 INFO L134 CoverageAnalysis]: Checked inductivity of 1420 backedges. 871 proven. 0 refuted. 0 times theorem prover too weak. 549 trivial. 0 not checked. [2019-11-20 02:12:31,224 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [619726261] [2019-11-20 02:12:31,224 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 02:12:31,225 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-20 02:12:31,225 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1991079580] [2019-11-20 02:12:31,226 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-20 02:12:31,227 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 02:12:31,227 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-20 02:12:31,227 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-20 02:12:31,227 INFO L87 Difference]: Start difference. First operand 2714 states and 3696 transitions. Second operand 3 states. [2019-11-20 02:12:31,331 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 02:12:31,331 INFO L93 Difference]: Finished difference Result 7734 states and 10582 transitions. [2019-11-20 02:12:31,332 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-20 02:12:31,332 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 336 [2019-11-20 02:12:31,333 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 02:12:31,388 INFO L225 Difference]: With dead ends: 7734 [2019-11-20 02:12:31,388 INFO L226 Difference]: Without dead ends: 5029 [2019-11-20 02:12:31,393 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-20 02:12:31,400 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5029 states. [2019-11-20 02:12:31,539 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5029 to 5027. [2019-11-20 02:12:31,540 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5027 states. [2019-11-20 02:12:31,548 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5027 states to 5027 states and 6880 transitions. [2019-11-20 02:12:31,548 INFO L78 Accepts]: Start accepts. Automaton has 5027 states and 6880 transitions. Word has length 336 [2019-11-20 02:12:31,549 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 02:12:31,549 INFO L462 AbstractCegarLoop]: Abstraction has 5027 states and 6880 transitions. [2019-11-20 02:12:31,549 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-20 02:12:31,549 INFO L276 IsEmpty]: Start isEmpty. Operand 5027 states and 6880 transitions. [2019-11-20 02:12:31,560 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 347 [2019-11-20 02:12:31,561 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 02:12:31,561 INFO L410 BasicCegarLoop]: trace histogram [15, 15, 14, 14, 14, 14, 14, 14, 14, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 02:12:31,561 INFO L410 AbstractCegarLoop]: === Iteration 20 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 02:12:31,561 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 02:12:31,562 INFO L82 PathProgramCache]: Analyzing trace with hash -1651416633, now seen corresponding path program 1 times [2019-11-20 02:12:31,562 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 02:12:31,562 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [521947068] [2019-11-20 02:12:31,562 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 02:12:31,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 02:12:31,734 INFO L134 CoverageAnalysis]: Checked inductivity of 1416 backedges. 791 proven. 12 refuted. 0 times theorem prover too weak. 613 trivial. 0 not checked. [2019-11-20 02:12:31,735 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [521947068] [2019-11-20 02:12:31,735 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1905725036] [2019-11-20 02:12:31,735 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_51d892bb-c17d-4536-9550-f6b03eb54ca9/bin/uautomizer/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-20 02:12:31,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 02:12:31,914 INFO L255 TraceCheckSpWp]: Trace formula consists of 623 conjuncts, 3 conjunts are in the unsatisfiable core [2019-11-20 02:12:31,954 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 02:12:32,248 INFO L134 CoverageAnalysis]: Checked inductivity of 1416 backedges. 791 proven. 12 refuted. 0 times theorem prover too weak. 613 trivial. 0 not checked. [2019-11-20 02:12:32,249 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-20 02:12:32,249 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 4 [2019-11-20 02:12:32,249 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1461204478] [2019-11-20 02:12:32,250 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-20 02:12:32,251 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 02:12:32,251 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-20 02:12:32,251 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-20 02:12:32,251 INFO L87 Difference]: Start difference. First operand 5027 states and 6880 transitions. Second operand 4 states. [2019-11-20 02:12:32,808 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 02:12:32,808 INFO L93 Difference]: Finished difference Result 9987 states and 13646 transitions. [2019-11-20 02:12:32,808 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-20 02:12:32,808 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 346 [2019-11-20 02:12:32,809 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 02:12:32,826 INFO L225 Difference]: With dead ends: 9987 [2019-11-20 02:12:32,826 INFO L226 Difference]: Without dead ends: 7540 [2019-11-20 02:12:32,832 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 351 GetRequests, 348 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-20 02:12:32,844 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7540 states. [2019-11-20 02:12:33,009 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7540 to 5561. [2019-11-20 02:12:33,009 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5561 states. [2019-11-20 02:12:33,019 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5561 states to 5561 states and 7516 transitions. [2019-11-20 02:12:33,019 INFO L78 Accepts]: Start accepts. Automaton has 5561 states and 7516 transitions. Word has length 346 [2019-11-20 02:12:33,020 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 02:12:33,020 INFO L462 AbstractCegarLoop]: Abstraction has 5561 states and 7516 transitions. [2019-11-20 02:12:33,020 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-20 02:12:33,020 INFO L276 IsEmpty]: Start isEmpty. Operand 5561 states and 7516 transitions. [2019-11-20 02:12:33,034 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 374 [2019-11-20 02:12:33,034 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 02:12:33,035 INFO L410 BasicCegarLoop]: trace histogram [17, 17, 16, 16, 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 02:12:33,241 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-20 02:12:33,241 INFO L410 AbstractCegarLoop]: === Iteration 21 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 02:12:33,241 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 02:12:33,242 INFO L82 PathProgramCache]: Analyzing trace with hash -1397611342, now seen corresponding path program 1 times [2019-11-20 02:12:33,243 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 02:12:33,243 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [370563982] [2019-11-20 02:12:33,243 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 02:12:33,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 02:12:33,442 INFO L134 CoverageAnalysis]: Checked inductivity of 1649 backedges. 955 proven. 5 refuted. 0 times theorem prover too weak. 689 trivial. 0 not checked. [2019-11-20 02:12:33,442 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [370563982] [2019-11-20 02:12:33,443 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [103306138] [2019-11-20 02:12:33,443 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_51d892bb-c17d-4536-9550-f6b03eb54ca9/bin/uautomizer/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-20 02:12:33,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 02:12:33,625 INFO L255 TraceCheckSpWp]: Trace formula consists of 693 conjuncts, 3 conjunts are in the unsatisfiable core [2019-11-20 02:12:33,640 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 02:12:33,761 INFO L134 CoverageAnalysis]: Checked inductivity of 1649 backedges. 955 proven. 5 refuted. 0 times theorem prover too weak. 689 trivial. 0 not checked. [2019-11-20 02:12:33,761 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-20 02:12:33,761 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 4 [2019-11-20 02:12:33,763 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1546920617] [2019-11-20 02:12:33,764 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-20 02:12:33,764 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 02:12:33,764 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-20 02:12:33,764 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-20 02:12:33,765 INFO L87 Difference]: Start difference. First operand 5561 states and 7516 transitions. Second operand 4 states. [2019-11-20 02:12:34,342 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 02:12:34,342 INFO L93 Difference]: Finished difference Result 12544 states and 16972 transitions. [2019-11-20 02:12:34,343 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-20 02:12:34,343 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 373 [2019-11-20 02:12:34,344 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 02:12:34,357 INFO L225 Difference]: With dead ends: 12544 [2019-11-20 02:12:34,357 INFO L226 Difference]: Without dead ends: 6979 [2019-11-20 02:12:34,365 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 378 GetRequests, 375 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-20 02:12:34,376 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6979 states. [2019-11-20 02:12:34,514 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6979 to 5709. [2019-11-20 02:12:34,514 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5709 states. [2019-11-20 02:12:34,524 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5709 states to 5709 states and 7634 transitions. [2019-11-20 02:12:34,524 INFO L78 Accepts]: Start accepts. Automaton has 5709 states and 7634 transitions. Word has length 373 [2019-11-20 02:12:34,525 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 02:12:34,525 INFO L462 AbstractCegarLoop]: Abstraction has 5709 states and 7634 transitions. [2019-11-20 02:12:34,525 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-20 02:12:34,526 INFO L276 IsEmpty]: Start isEmpty. Operand 5709 states and 7634 transitions. [2019-11-20 02:12:34,541 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 413 [2019-11-20 02:12:34,542 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 02:12:34,542 INFO L410 BasicCegarLoop]: trace histogram [18, 18, 17, 17, 17, 17, 16, 16, 16, 14, 14, 12, 12, 10, 10, 8, 8, 6, 6, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 02:12:34,747 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-20 02:12:34,748 INFO L410 AbstractCegarLoop]: === Iteration 22 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 02:12:34,748 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 02:12:34,748 INFO L82 PathProgramCache]: Analyzing trace with hash -236946382, now seen corresponding path program 1 times [2019-11-20 02:12:34,748 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 02:12:34,749 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [335270681] [2019-11-20 02:12:34,749 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 02:12:34,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 02:12:34,944 INFO L134 CoverageAnalysis]: Checked inductivity of 1970 backedges. 885 proven. 0 refuted. 0 times theorem prover too weak. 1085 trivial. 0 not checked. [2019-11-20 02:12:34,945 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [335270681] [2019-11-20 02:12:34,945 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 02:12:34,945 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-20 02:12:34,946 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [490831109] [2019-11-20 02:12:34,946 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-20 02:12:34,947 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 02:12:34,947 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-20 02:12:34,947 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-20 02:12:34,947 INFO L87 Difference]: Start difference. First operand 5709 states and 7634 transitions. Second operand 3 states. [2019-11-20 02:12:35,190 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 02:12:35,192 INFO L93 Difference]: Finished difference Result 11015 states and 14510 transitions. [2019-11-20 02:12:35,192 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-20 02:12:35,193 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 412 [2019-11-20 02:12:35,193 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 02:12:35,199 INFO L225 Difference]: With dead ends: 11015 [2019-11-20 02:12:35,200 INFO L226 Difference]: Without dead ends: 3069 [2019-11-20 02:12:35,211 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-20 02:12:35,216 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3069 states. [2019-11-20 02:12:35,279 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3069 to 2976. [2019-11-20 02:12:35,280 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2976 states. [2019-11-20 02:12:35,284 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2976 states to 2976 states and 3983 transitions. [2019-11-20 02:12:35,285 INFO L78 Accepts]: Start accepts. Automaton has 2976 states and 3983 transitions. Word has length 412 [2019-11-20 02:12:35,285 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 02:12:35,286 INFO L462 AbstractCegarLoop]: Abstraction has 2976 states and 3983 transitions. [2019-11-20 02:12:35,286 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-20 02:12:35,286 INFO L276 IsEmpty]: Start isEmpty. Operand 2976 states and 3983 transitions. [2019-11-20 02:12:35,300 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 497 [2019-11-20 02:12:35,300 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 02:12:35,301 INFO L410 BasicCegarLoop]: trace histogram [19, 19, 18, 18, 18, 18, 18, 18, 18, 17, 17, 15, 15, 13, 13, 11, 11, 9, 9, 8, 8, 8, 8, 8, 8, 7, 7, 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, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 02:12:35,301 INFO L410 AbstractCegarLoop]: === Iteration 23 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 02:12:35,301 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 02:12:35,302 INFO L82 PathProgramCache]: Analyzing trace with hash -788979008, now seen corresponding path program 1 times [2019-11-20 02:12:35,307 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 02:12:35,307 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1887901328] [2019-11-20 02:12:35,308 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 02:12:35,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 02:12:35,572 INFO L134 CoverageAnalysis]: Checked inductivity of 2711 backedges. 1571 proven. 14 refuted. 0 times theorem prover too weak. 1126 trivial. 0 not checked. [2019-11-20 02:12:35,573 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1887901328] [2019-11-20 02:12:35,573 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1201330390] [2019-11-20 02:12:35,574 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_51d892bb-c17d-4536-9550-f6b03eb54ca9/bin/uautomizer/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-20 02:12:35,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 02:12:35,784 INFO L255 TraceCheckSpWp]: Trace formula consists of 823 conjuncts, 3 conjunts are in the unsatisfiable core [2019-11-20 02:12:35,795 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 02:12:36,308 INFO L134 CoverageAnalysis]: Checked inductivity of 2711 backedges. 1018 proven. 0 refuted. 0 times theorem prover too weak. 1693 trivial. 0 not checked. [2019-11-20 02:12:36,308 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-11-20 02:12:36,309 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 5 [2019-11-20 02:12:36,309 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [949623820] [2019-11-20 02:12:36,311 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-20 02:12:36,312 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 02:12:36,312 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-20 02:12:36,312 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-20 02:12:36,313 INFO L87 Difference]: Start difference. First operand 2976 states and 3983 transitions. Second operand 3 states. [2019-11-20 02:12:36,362 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 02:12:36,362 INFO L93 Difference]: Finished difference Result 3028 states and 4049 transitions. [2019-11-20 02:12:36,363 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-20 02:12:36,363 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 496 [2019-11-20 02:12:36,364 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 02:12:36,369 INFO L225 Difference]: With dead ends: 3028 [2019-11-20 02:12:36,369 INFO L226 Difference]: Without dead ends: 2531 [2019-11-20 02:12:36,372 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 499 GetRequests, 496 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-20 02:12:36,376 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2531 states. [2019-11-20 02:12:36,426 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2531 to 2481. [2019-11-20 02:12:36,426 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2481 states. [2019-11-20 02:12:36,430 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2481 states to 2481 states and 3319 transitions. [2019-11-20 02:12:36,430 INFO L78 Accepts]: Start accepts. Automaton has 2481 states and 3319 transitions. Word has length 496 [2019-11-20 02:12:36,431 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 02:12:36,431 INFO L462 AbstractCegarLoop]: Abstraction has 2481 states and 3319 transitions. [2019-11-20 02:12:36,431 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-20 02:12:36,431 INFO L276 IsEmpty]: Start isEmpty. Operand 2481 states and 3319 transitions. [2019-11-20 02:12:36,443 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 498 [2019-11-20 02:12:36,443 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 02:12:36,445 INFO L410 BasicCegarLoop]: trace histogram [18, 18, 17, 17, 17, 17, 17, 17, 17, 16, 16, 14, 14, 13, 13, 12, 12, 10, 10, 9, 9, 9, 9, 9, 9, 8, 8, 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, 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] [2019-11-20 02:12:36,654 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-20 02:12:36,654 INFO L410 AbstractCegarLoop]: === Iteration 24 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 02:12:36,654 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 02:12:36,654 INFO L82 PathProgramCache]: Analyzing trace with hash 866163585, now seen corresponding path program 1 times [2019-11-20 02:12:36,655 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 02:12:36,655 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [504857670] [2019-11-20 02:12:36,655 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 02:12:36,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 02:12:36,938 INFO L134 CoverageAnalysis]: Checked inductivity of 2607 backedges. 1546 proven. 14 refuted. 0 times theorem prover too weak. 1047 trivial. 0 not checked. [2019-11-20 02:12:36,939 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [504857670] [2019-11-20 02:12:36,939 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1633928068] [2019-11-20 02:12:36,939 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_51d892bb-c17d-4536-9550-f6b03eb54ca9/bin/uautomizer/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-20 02:12:37,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 02:12:37,132 INFO L255 TraceCheckSpWp]: Trace formula consists of 813 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-20 02:12:37,139 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 02:12:37,334 INFO L134 CoverageAnalysis]: Checked inductivity of 2607 backedges. 268 proven. 0 refuted. 0 times theorem prover too weak. 2339 trivial. 0 not checked. [2019-11-20 02:12:37,335 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-11-20 02:12:37,335 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 5 [2019-11-20 02:12:37,336 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1287165713] [2019-11-20 02:12:37,338 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-20 02:12:37,338 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 02:12:37,338 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-20 02:12:37,339 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-20 02:12:37,339 INFO L87 Difference]: Start difference. First operand 2481 states and 3319 transitions. Second operand 3 states. [2019-11-20 02:12:37,646 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 02:12:37,646 INFO L93 Difference]: Finished difference Result 5060 states and 6783 transitions. [2019-11-20 02:12:37,647 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-20 02:12:37,647 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 497 [2019-11-20 02:12:37,648 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 02:12:37,653 INFO L225 Difference]: With dead ends: 5060 [2019-11-20 02:12:37,654 INFO L226 Difference]: Without dead ends: 2589 [2019-11-20 02:12:37,658 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 500 GetRequests, 497 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-20 02:12:37,662 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2589 states. [2019-11-20 02:12:37,715 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2589 to 2586. [2019-11-20 02:12:37,715 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2586 states. [2019-11-20 02:12:37,719 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2586 states to 2586 states and 3331 transitions. [2019-11-20 02:12:37,720 INFO L78 Accepts]: Start accepts. Automaton has 2586 states and 3331 transitions. Word has length 497 [2019-11-20 02:12:37,721 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 02:12:37,721 INFO L462 AbstractCegarLoop]: Abstraction has 2586 states and 3331 transitions. [2019-11-20 02:12:37,721 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-20 02:12:37,721 INFO L276 IsEmpty]: Start isEmpty. Operand 2586 states and 3331 transitions. [2019-11-20 02:12:37,742 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 609 [2019-11-20 02:12:37,743 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 02:12:37,743 INFO L410 BasicCegarLoop]: trace histogram [21, 21, 20, 20, 20, 20, 20, 20, 20, 19, 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, 3, 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] [2019-11-20 02:12:37,949 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-20 02:12:37,949 INFO L410 AbstractCegarLoop]: === Iteration 25 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 02:12:37,950 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 02:12:37,951 INFO L82 PathProgramCache]: Analyzing trace with hash -1604973917, now seen corresponding path program 2 times [2019-11-20 02:12:37,951 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 02:12:37,952 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1550799809] [2019-11-20 02:12:37,952 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 02:12:37,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 02:12:38,329 INFO L134 CoverageAnalysis]: Checked inductivity of 3928 backedges. 2054 proven. 14 refuted. 0 times theorem prover too weak. 1860 trivial. 0 not checked. [2019-11-20 02:12:38,330 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1550799809] [2019-11-20 02:12:38,330 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1648476702] [2019-11-20 02:12:38,330 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_51d892bb-c17d-4536-9550-f6b03eb54ca9/bin/uautomizer/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-20 02:12:38,545 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-11-20 02:12:38,545 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-20 02:12:38,548 INFO L255 TraceCheckSpWp]: Trace formula consists of 964 conjuncts, 3 conjunts are in the unsatisfiable core [2019-11-20 02:12:38,556 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 02:12:38,843 INFO L134 CoverageAnalysis]: Checked inductivity of 3928 backedges. 2054 proven. 14 refuted. 0 times theorem prover too weak. 1860 trivial. 0 not checked. [2019-11-20 02:12:38,843 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-20 02:12:38,844 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 4 [2019-11-20 02:12:38,844 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [969908726] [2019-11-20 02:12:38,846 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-20 02:12:38,846 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 02:12:38,846 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-20 02:12:38,846 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-20 02:12:38,847 INFO L87 Difference]: Start difference. First operand 2586 states and 3331 transitions. Second operand 4 states. [2019-11-20 02:12:39,093 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 02:12:39,093 INFO L93 Difference]: Finished difference Result 2848 states and 3664 transitions. [2019-11-20 02:12:39,094 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-20 02:12:39,094 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 608 [2019-11-20 02:12:39,095 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 02:12:39,095 INFO L225 Difference]: With dead ends: 2848 [2019-11-20 02:12:39,095 INFO L226 Difference]: Without dead ends: 0 [2019-11-20 02:12:39,099 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 613 GetRequests, 610 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-20 02:12:39,099 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-11-20 02:12:39,100 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-11-20 02:12:39,100 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-11-20 02:12:39,100 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-11-20 02:12:39,100 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 608 [2019-11-20 02:12:39,101 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 02:12:39,101 INFO L462 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-11-20 02:12:39,101 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-20 02:12:39,102 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-11-20 02:12:39,102 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-11-20 02:12:39,308 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-20 02:12:39,313 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2019-11-20 02:12:39,860 WARN L191 SmtUtils]: Spent 344.00 ms on a formula simplification. DAG size of input: 253 DAG size of output: 111 [2019-11-20 02:12:41,113 WARN L191 SmtUtils]: Spent 582.00 ms on a formula simplification. DAG size of input: 84 DAG size of output: 50 [2019-11-20 02:12:41,244 WARN L191 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 35 DAG size of output: 20 [2019-11-20 02:12:41,442 WARN L191 SmtUtils]: Spent 197.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 7 [2019-11-20 02:12:41,609 WARN L191 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 31 DAG size of output: 19 [2019-11-20 02:12:41,723 WARN L191 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 33 DAG size of output: 22 [2019-11-20 02:12:41,799 INFO L440 ceAbstractionStarter]: At program point L201(lines 197 514) the Hoare annotation is: (let ((.cse2 (= 0 ULTIMATE.start_ssl3_connect_~s__hit~0)) (.cse0 (<= 4560 ULTIMATE.start_ssl3_connect_~s__state~0)) (.cse1 (<= ULTIMATE.start_ssl3_connect_~s__state~0 4560))) (or (and .cse0 .cse1 (<= 4560 ULTIMATE.start_ssl3_connect_~s__s3__tmp__next_state___0~0) .cse2 (<= ULTIMATE.start_ssl3_connect_~s__s3__tmp__next_state___0~0 4560)) (and (not .cse2) .cse0 .cse1 (<= ULTIMATE.start_ssl3_connect_~blastFlag~0 2)))) [2019-11-20 02:12:41,799 INFO L440 ceAbstractionStarter]: At program point L135(lines 131 536) the Hoare annotation is: (and (<= ULTIMATE.start_ssl3_connect_~blastFlag~0 2) (<= ULTIMATE.start_ssl3_connect_~s__state~0 4432) (<= 4352 ULTIMATE.start_ssl3_connect_~s__state~0)) [2019-11-20 02:12:41,799 INFO L444 ceAbstractionStarter]: For program point L102(lines 102 104) no Hoare annotation was computed. [2019-11-20 02:12:41,800 INFO L444 ceAbstractionStarter]: For program point L235(lines 235 251) no Hoare annotation was computed. [2019-11-20 02:12:41,800 INFO L444 ceAbstractionStarter]: For program point L235-2(lines 210 508) no Hoare annotation was computed. [2019-11-20 02:12:41,800 INFO L444 ceAbstractionStarter]: For program point L467(lines 467 479) no Hoare annotation was computed. [2019-11-20 02:12:41,800 INFO L444 ceAbstractionStarter]: For program point L434(lines 434 448) no Hoare annotation was computed. [2019-11-20 02:12:41,800 INFO L444 ceAbstractionStarter]: For program point L434-1(lines 434 448) no Hoare annotation was computed. [2019-11-20 02:12:41,800 INFO L444 ceAbstractionStarter]: For program point L467-2(lines 467 479) no Hoare annotation was computed. [2019-11-20 02:12:41,800 INFO L444 ceAbstractionStarter]: For program point L335(lines 335 338) no Hoare annotation was computed. [2019-11-20 02:12:41,800 INFO L444 ceAbstractionStarter]: For program point L269(lines 269 271) no Hoare annotation was computed. [2019-11-20 02:12:41,800 INFO L444 ceAbstractionStarter]: For program point L203(lines 203 512) no Hoare annotation was computed. [2019-11-20 02:12:41,800 INFO L444 ceAbstractionStarter]: For program point L269-2(lines 210 508) no Hoare annotation was computed. [2019-11-20 02:12:41,801 INFO L444 ceAbstractionStarter]: For program point L170(lines 170 523) no Hoare annotation was computed. [2019-11-20 02:12:41,801 INFO L444 ceAbstractionStarter]: For program point L137(lines 137 534) no Hoare annotation was computed. [2019-11-20 02:12:41,801 INFO L444 ceAbstractionStarter]: For program point L501(lines 501 503) no Hoare annotation was computed. [2019-11-20 02:12:41,802 INFO L440 ceAbstractionStarter]: At program point L204(lines 203 512) the Hoare annotation is: (let ((.cse1 (<= ULTIMATE.start_ssl3_connect_~s__state~0 4352)) (.cse2 (<= 4352 ULTIMATE.start_ssl3_connect_~s__state~0)) (.cse0 (= 0 ULTIMATE.start_ssl3_connect_~s__hit~0))) (or (and (<= ULTIMATE.start_ssl3_connect_~blastFlag~0 2) (not .cse0) .cse1 (<= ULTIMATE.start_ssl3_connect_~s__s3__tmp__next_state___0~0 3) .cse2) (and .cse1 .cse2 (<= 4560 ULTIMATE.start_ssl3_connect_~s__s3__tmp__next_state___0~0) .cse0 (<= ULTIMATE.start_ssl3_connect_~s__s3__tmp__next_state___0~0 4560)))) [2019-11-20 02:12:41,803 INFO L440 ceAbstractionStarter]: At program point L171(lines 161 526) the Hoare annotation is: (and (<= ULTIMATE.start_ssl3_connect_~s__state~0 4480) (<= ULTIMATE.start_ssl3_connect_~blastFlag~0 4) (= 0 ULTIMATE.start_ssl3_connect_~s__hit~0) (<= 4432 ULTIMATE.start_ssl3_connect_~s__state~0)) [2019-11-20 02:12:41,804 INFO L444 ceAbstractionStarter]: For program point L568(lines 568 570) no Hoare annotation was computed. [2019-11-20 02:12:41,804 INFO L444 ceAbstractionStarter]: For program point L568-2(lines 568 570) no Hoare annotation was computed. [2019-11-20 02:12:41,804 INFO L444 ceAbstractionStarter]: For program point L370(lines 370 372) no Hoare annotation was computed. [2019-11-20 02:12:41,806 INFO L444 ceAbstractionStarter]: For program point L404(lines 404 406) no Hoare annotation was computed. [2019-11-20 02:12:41,806 INFO L444 ceAbstractionStarter]: For program point L206(lines 206 511) no Hoare annotation was computed. [2019-11-20 02:12:41,806 INFO L444 ceAbstractionStarter]: For program point L173(lines 173 522) no Hoare annotation was computed. [2019-11-20 02:12:41,806 INFO L444 ceAbstractionStarter]: For program point L140(lines 140 533) no Hoare annotation was computed. [2019-11-20 02:12:41,807 INFO L444 ceAbstractionStarter]: For program point L107-1(lines 84 574) no Hoare annotation was computed. [2019-11-20 02:12:41,807 INFO L444 ceAbstractionStarter]: For program point L438(lines 438 444) no Hoare annotation was computed. [2019-11-20 02:12:41,807 INFO L447 ceAbstractionStarter]: At program point L207(lines 206 511) the Hoare annotation is: true [2019-11-20 02:12:41,807 INFO L440 ceAbstractionStarter]: At program point L141(lines 137 534) the Hoare annotation is: (let ((.cse0 (<= ULTIMATE.start_ssl3_connect_~s__state~0 4432)) (.cse1 (<= 4352 ULTIMATE.start_ssl3_connect_~s__state~0)) (.cse2 (= 0 ULTIMATE.start_ssl3_connect_~s__hit~0))) (or (and (<= ULTIMATE.start_ssl3_connect_~blastFlag~0 2) .cse0 .cse1 .cse2) (and (<= ULTIMATE.start_ssl3_connect_~blastFlag~0 4) .cse0 .cse1 .cse2 (<= ULTIMATE.start_ssl3_connect_~s__s3__tmp__next_state___0~0 4560)))) [2019-11-20 02:12:41,807 INFO L444 ceAbstractionStarter]: For program point L108(line 108) no Hoare annotation was computed. [2019-11-20 02:12:41,808 INFO L444 ceAbstractionStarter]: For program point L241(lines 241 244) no Hoare annotation was computed. [2019-11-20 02:12:41,808 INFO L444 ceAbstractionStarter]: For program point L473(lines 473 476) no Hoare annotation was computed. [2019-11-20 02:12:41,808 INFO L447 ceAbstractionStarter]: At program point L209(lines 208 511) the Hoare annotation is: true [2019-11-20 02:12:41,808 INFO L444 ceAbstractionStarter]: For program point L176(lines 176 521) no Hoare annotation was computed. [2019-11-20 02:12:41,808 INFO L444 ceAbstractionStarter]: For program point L143(lines 143 532) no Hoare annotation was computed. [2019-11-20 02:12:41,809 INFO L444 ceAbstractionStarter]: For program point L110(lines 110 543) no Hoare annotation was computed. [2019-11-20 02:12:41,809 INFO L447 ceAbstractionStarter]: At program point L573(lines 10 575) the Hoare annotation is: true [2019-11-20 02:12:41,809 INFO L444 ceAbstractionStarter]: For program point L309(lines 309 319) no Hoare annotation was computed. [2019-11-20 02:12:41,810 INFO L444 ceAbstractionStarter]: For program point L309-2(lines 309 319) no Hoare annotation was computed. [2019-11-20 02:12:41,810 INFO L440 ceAbstractionStarter]: At program point L177(lines 173 522) the Hoare annotation is: (and (<= ULTIMATE.start_ssl3_connect_~s__state~0 4512) (<= ULTIMATE.start_ssl3_connect_~blastFlag~0 4) (= 0 ULTIMATE.start_ssl3_connect_~s__hit~0) (<= 4432 ULTIMATE.start_ssl3_connect_~s__state~0)) [2019-11-20 02:12:41,810 INFO L440 ceAbstractionStarter]: At program point L111(lines 110 543) the Hoare annotation is: (and (<= ULTIMATE.start_ssl3_connect_~blastFlag~0 2) (= 12292 ULTIMATE.start_ssl3_connect_~s__state~0)) [2019-11-20 02:12:41,811 INFO L444 ceAbstractionStarter]: For program point L343(lines 343 345) no Hoare annotation was computed. [2019-11-20 02:12:41,811 INFO L440 ceAbstractionStarter]: At program point L509(lines 107 562) the Hoare annotation is: (let ((.cse4 (= 0 ULTIMATE.start_ssl3_connect_~s__hit~0))) (let ((.cse1 (<= ULTIMATE.start_ssl3_connect_~s__state~0 4352)) (.cse2 (<= 4352 ULTIMATE.start_ssl3_connect_~s__state~0)) (.cse6 (not .cse4)) (.cse12 (<= ULTIMATE.start_ssl3_connect_~s__state~0 4528)) (.cse10 (<= 4560 ULTIMATE.start_ssl3_connect_~s__state~0)) (.cse11 (<= ULTIMATE.start_ssl3_connect_~s__state~0 4560)) (.cse3 (<= 4560 ULTIMATE.start_ssl3_connect_~s__s3__tmp__next_state___0~0)) (.cse0 (<= ULTIMATE.start_ssl3_connect_~blastFlag~0 2)) (.cse9 (= 4400 ULTIMATE.start_ssl3_connect_~s__state~0)) (.cse8 (<= ULTIMATE.start_ssl3_connect_~blastFlag~0 4)) (.cse7 (<= ULTIMATE.start_ssl3_connect_~s__state~0 3)) (.cse5 (<= ULTIMATE.start_ssl3_connect_~s__s3__tmp__next_state___0~0 4560))) (or (and .cse0 (= 4368 ULTIMATE.start_ssl3_connect_~s__state~0)) (and .cse1 .cse2 .cse3 .cse4 .cse5) (and .cse0 .cse6 .cse1 (<= ULTIMATE.start_ssl3_connect_~s__s3__tmp__next_state___0~0 3) .cse2) (and .cse0 .cse7 .cse4) (and .cse8 .cse4 .cse5 .cse9) (and .cse6 .cse10 .cse11 .cse0) (and .cse12 .cse8 .cse4 (<= 4432 ULTIMATE.start_ssl3_connect_~s__state~0)) (and (<= 4512 ULTIMATE.start_ssl3_connect_~s__state~0) .cse12 .cse0) (and .cse10 .cse11 .cse3 .cse4 .cse5) (and (= ULTIMATE.start_ssl3_connect_~s__state~0 4384) .cse0) (and .cse0 .cse4 .cse9) (and (= 4416 ULTIMATE.start_ssl3_connect_~s__state~0) .cse8 .cse4) (and .cse7 .cse5)))) [2019-11-20 02:12:41,812 INFO L444 ceAbstractionStarter]: For program point L410(lines 410 414) no Hoare annotation was computed. [2019-11-20 02:12:41,812 INFO L440 ceAbstractionStarter]: At program point L344(lines 84 574) the Hoare annotation is: false [2019-11-20 02:12:41,812 INFO L444 ceAbstractionStarter]: For program point L410-2(lines 210 508) no Hoare annotation was computed. [2019-11-20 02:12:41,813 INFO L444 ceAbstractionStarter]: For program point L179(lines 179 520) no Hoare annotation was computed. [2019-11-20 02:12:41,813 INFO L444 ceAbstractionStarter]: For program point L146(lines 146 531) no Hoare annotation was computed. [2019-11-20 02:12:41,813 INFO L444 ceAbstractionStarter]: For program point L113(lines 113 542) no Hoare annotation was computed. [2019-11-20 02:12:41,813 INFO L444 ceAbstractionStarter]: For program point L246(lines 246 249) no Hoare annotation was computed. [2019-11-20 02:12:41,814 INFO L440 ceAbstractionStarter]: At program point L147(lines 143 532) the Hoare annotation is: (and (<= ULTIMATE.start_ssl3_connect_~blastFlag~0 4) (<= ULTIMATE.start_ssl3_connect_~s__state~0 4432) (<= 4352 ULTIMATE.start_ssl3_connect_~s__state~0) (= 0 ULTIMATE.start_ssl3_connect_~s__hit~0)) [2019-11-20 02:12:41,814 INFO L444 ceAbstractionStarter]: For program point L544(lines 544 560) no Hoare annotation was computed. [2019-11-20 02:12:41,814 INFO L444 ceAbstractionStarter]: For program point L379(lines 379 381) no Hoare annotation was computed. [2019-11-20 02:12:41,814 INFO L444 ceAbstractionStarter]: For program point L346(lines 346 348) no Hoare annotation was computed. [2019-11-20 02:12:41,814 INFO L444 ceAbstractionStarter]: For program point L313(lines 313 315) no Hoare annotation was computed. [2019-11-20 02:12:41,815 INFO L444 ceAbstractionStarter]: For program point L280(lines 280 282) no Hoare annotation was computed. [2019-11-20 02:12:41,815 INFO L444 ceAbstractionStarter]: For program point L313-2(lines 311 319) no Hoare annotation was computed. [2019-11-20 02:12:41,815 INFO L444 ceAbstractionStarter]: For program point L545(lines 545 559) no Hoare annotation was computed. [2019-11-20 02:12:41,815 INFO L440 ceAbstractionStarter]: At program point L215(lines 113 542) the Hoare annotation is: (and (<= ULTIMATE.start_ssl3_connect_~s__state~0 4560) (<= ULTIMATE.start_ssl3_connect_~blastFlag~0 2)) [2019-11-20 02:12:41,815 INFO L444 ceAbstractionStarter]: For program point L182(lines 182 519) no Hoare annotation was computed. [2019-11-20 02:12:41,815 INFO L444 ceAbstractionStarter]: For program point L149(lines 149 530) no Hoare annotation was computed. [2019-11-20 02:12:41,816 INFO L444 ceAbstractionStarter]: For program point L116(lines 116 541) no Hoare annotation was computed. [2019-11-20 02:12:41,816 INFO L444 ceAbstractionStarter]: For program point L546(lines 546 551) no Hoare annotation was computed. [2019-11-20 02:12:41,816 INFO L444 ceAbstractionStarter]: For program point L546-2(lines 545 559) no Hoare annotation was computed. [2019-11-20 02:12:41,816 INFO L440 ceAbstractionStarter]: At program point L183(lines 179 520) the Hoare annotation is: (and (<= ULTIMATE.start_ssl3_connect_~s__state~0 4512) (<= ULTIMATE.start_ssl3_connect_~blastFlag~0 4) (= 0 ULTIMATE.start_ssl3_connect_~s__hit~0) (<= 4432 ULTIMATE.start_ssl3_connect_~s__state~0)) [2019-11-20 02:12:41,816 INFO L444 ceAbstractionStarter]: For program point L548(lines 548 550) no Hoare annotation was computed. [2019-11-20 02:12:41,817 INFO L444 ceAbstractionStarter]: For program point L383(lines 383 388) no Hoare annotation was computed. [2019-11-20 02:12:41,817 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2019-11-20 02:12:41,817 INFO L444 ceAbstractionStarter]: For program point L383-2(lines 383 388) no Hoare annotation was computed. [2019-11-20 02:12:41,817 INFO L444 ceAbstractionStarter]: For program point L185(lines 185 518) no Hoare annotation was computed. [2019-11-20 02:12:41,817 INFO L444 ceAbstractionStarter]: For program point L152(lines 152 529) no Hoare annotation was computed. [2019-11-20 02:12:41,818 INFO L444 ceAbstractionStarter]: For program point L119(lines 119 540) no Hoare annotation was computed. [2019-11-20 02:12:41,818 INFO L440 ceAbstractionStarter]: At program point L153(lines 149 530) the Hoare annotation is: (and (<= ULTIMATE.start_ssl3_connect_~blastFlag~0 4) (<= ULTIMATE.start_ssl3_connect_~s__state~0 4448) (= 0 ULTIMATE.start_ssl3_connect_~s__hit~0) (<= 4432 ULTIMATE.start_ssl3_connect_~s__state~0)) [2019-11-20 02:12:41,818 INFO L444 ceAbstractionStarter]: For program point L484-1(lines 484 486) no Hoare annotation was computed. [2019-11-20 02:12:41,818 INFO L444 ceAbstractionStarter]: For program point L220(lines 220 222) no Hoare annotation was computed. [2019-11-20 02:12:41,818 INFO L444 ceAbstractionStarter]: For program point L220-2(lines 220 222) no Hoare annotation was computed. [2019-11-20 02:12:41,818 INFO L447 ceAbstractionStarter]: At program point L584(lines 576 586) the Hoare annotation is: true [2019-11-20 02:12:41,819 INFO L444 ceAbstractionStarter]: For program point L419(lines 419 422) no Hoare annotation was computed. [2019-11-20 02:12:41,819 INFO L444 ceAbstractionStarter]: For program point L188(lines 188 517) no Hoare annotation was computed. [2019-11-20 02:12:41,819 INFO L444 ceAbstractionStarter]: For program point L155(lines 155 528) no Hoare annotation was computed. [2019-11-20 02:12:41,819 INFO L444 ceAbstractionStarter]: For program point L122(lines 122 539) no Hoare annotation was computed. [2019-11-20 02:12:41,819 INFO L444 ceAbstractionStarter]: For program point L288(lines 288 294) no Hoare annotation was computed. [2019-11-20 02:12:41,820 INFO L440 ceAbstractionStarter]: At program point L189(lines 185 518) the Hoare annotation is: (let ((.cse0 (<= ULTIMATE.start_ssl3_connect_~s__state~0 4528))) (or (and .cse0 (<= ULTIMATE.start_ssl3_connect_~blastFlag~0 4) (= 0 ULTIMATE.start_ssl3_connect_~s__hit~0) (<= 4432 ULTIMATE.start_ssl3_connect_~s__state~0)) (and (<= 4512 ULTIMATE.start_ssl3_connect_~s__state~0) (and .cse0 (<= ULTIMATE.start_ssl3_connect_~blastFlag~0 2))))) [2019-11-20 02:12:41,820 INFO L444 ceAbstractionStarter]: For program point L553(lines 553 557) no Hoare annotation was computed. [2019-11-20 02:12:41,820 INFO L444 ceAbstractionStarter]: For program point L454(lines 454 456) no Hoare annotation was computed. [2019-11-20 02:12:41,820 INFO L444 ceAbstractionStarter]: For program point L355(lines 355 357) no Hoare annotation was computed. [2019-11-20 02:12:41,820 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2019-11-20 02:12:41,821 INFO L444 ceAbstractionStarter]: For program point L257(lines 257 260) no Hoare annotation was computed. [2019-11-20 02:12:41,821 INFO L444 ceAbstractionStarter]: For program point L191(lines 191 516) no Hoare annotation was computed. [2019-11-20 02:12:41,821 INFO L444 ceAbstractionStarter]: For program point L158(lines 158 527) no Hoare annotation was computed. [2019-11-20 02:12:41,822 INFO L444 ceAbstractionStarter]: For program point L125(lines 125 538) no Hoare annotation was computed. [2019-11-20 02:12:41,822 INFO L444 ceAbstractionStarter]: For program point L291(lines 291 293) no Hoare annotation was computed. [2019-11-20 02:12:41,822 INFO L444 ceAbstractionStarter]: For program point L225(lines 225 228) no Hoare annotation was computed. [2019-11-20 02:12:41,822 INFO L444 ceAbstractionStarter]: For program point L291-2(lines 210 508) no Hoare annotation was computed. [2019-11-20 02:12:41,822 INFO L440 ceAbstractionStarter]: At program point L159(lines 155 528) the Hoare annotation is: (and (<= ULTIMATE.start_ssl3_connect_~s__state~0 4464) (<= ULTIMATE.start_ssl3_connect_~blastFlag~0 4) (= 0 ULTIMATE.start_ssl3_connect_~s__hit~0) (<= 4432 ULTIMATE.start_ssl3_connect_~s__state~0)) [2019-11-20 02:12:41,822 INFO L444 ceAbstractionStarter]: For program point L93(lines 93 99) no Hoare annotation was computed. [2019-11-20 02:12:41,823 INFO L444 ceAbstractionStarter]: For program point L490(lines 490 492) no Hoare annotation was computed. [2019-11-20 02:12:41,823 INFO L444 ceAbstractionStarter]: For program point L457(lines 457 461) no Hoare annotation was computed. [2019-11-20 02:12:41,823 INFO L444 ceAbstractionStarter]: For program point L490-2(lines 490 492) no Hoare annotation was computed. [2019-11-20 02:12:41,823 INFO L444 ceAbstractionStarter]: For program point L457-2(lines 457 461) no Hoare annotation was computed. [2019-11-20 02:12:41,823 INFO L444 ceAbstractionStarter]: For program point L358(lines 358 362) no Hoare annotation was computed. [2019-11-20 02:12:41,823 INFO L444 ceAbstractionStarter]: For program point L358-2(lines 358 362) no Hoare annotation was computed. [2019-11-20 02:12:41,824 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2019-11-20 02:12:41,824 INFO L444 ceAbstractionStarter]: For program point L194(lines 194 515) no Hoare annotation was computed. [2019-11-20 02:12:41,824 INFO L444 ceAbstractionStarter]: For program point L161(lines 161 526) no Hoare annotation was computed. [2019-11-20 02:12:41,824 INFO L444 ceAbstractionStarter]: For program point L128(lines 128 537) no Hoare annotation was computed. [2019-11-20 02:12:41,824 INFO L444 ceAbstractionStarter]: For program point L327(lines 327 329) no Hoare annotation was computed. [2019-11-20 02:12:41,824 INFO L444 ceAbstractionStarter]: For program point L327-2(lines 210 508) no Hoare annotation was computed. [2019-11-20 02:12:41,825 INFO L440 ceAbstractionStarter]: At program point L195(lines 191 516) the Hoare annotation is: (let ((.cse1 (= 0 ULTIMATE.start_ssl3_connect_~s__hit~0)) (.cse2 (<= 4432 ULTIMATE.start_ssl3_connect_~s__state~0)) (.cse0 (<= ULTIMATE.start_ssl3_connect_~s__state~0 4560))) (or (and (<= 4512 ULTIMATE.start_ssl3_connect_~s__state~0) .cse0 (<= ULTIMATE.start_ssl3_connect_~blastFlag~0 2)) (and .cse0 .cse1 (<= ULTIMATE.start_ssl3_connect_~s__s3__tmp__next_state___0~0 4560) .cse2) (and (and (<= ULTIMATE.start_ssl3_connect_~blastFlag~0 4) .cse1 .cse2) .cse0))) [2019-11-20 02:12:41,825 INFO L440 ceAbstractionStarter]: At program point L129(lines 125 538) the Hoare annotation is: (and (<= ULTIMATE.start_ssl3_connect_~blastFlag~0 2) (<= ULTIMATE.start_ssl3_connect_~s__state~0 4432) (<= 4352 ULTIMATE.start_ssl3_connect_~s__state~0)) [2019-11-20 02:12:41,825 INFO L444 ceAbstractionStarter]: For program point L96(lines 96 98) no Hoare annotation was computed. [2019-11-20 02:12:41,825 INFO L444 ceAbstractionStarter]: For program point L96-2(lines 93 99) no Hoare annotation was computed. [2019-11-20 02:12:41,825 INFO L444 ceAbstractionStarter]: For program point L427(lines 427 429) no Hoare annotation was computed. [2019-11-20 02:12:41,826 INFO L444 ceAbstractionStarter]: For program point L394(lines 394 396) no Hoare annotation was computed. [2019-11-20 02:12:41,826 INFO L444 ceAbstractionStarter]: For program point L197(lines 197 514) no Hoare annotation was computed. [2019-11-20 02:12:41,826 INFO L444 ceAbstractionStarter]: For program point L164(lines 164 525) no Hoare annotation was computed. [2019-11-20 02:12:41,826 INFO L444 ceAbstractionStarter]: For program point L131(lines 131 536) no Hoare annotation was computed. [2019-11-20 02:12:41,826 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 572) no Hoare annotation was computed. [2019-11-20 02:12:41,827 INFO L444 ceAbstractionStarter]: For program point L496(lines 496 498) no Hoare annotation was computed. [2019-11-20 02:12:41,827 INFO L444 ceAbstractionStarter]: For program point L496-2(lines 496 498) no Hoare annotation was computed. [2019-11-20 02:12:41,827 INFO L444 ceAbstractionStarter]: For program point L298(lines 298 302) no Hoare annotation was computed. [2019-11-20 02:12:41,827 INFO L444 ceAbstractionStarter]: For program point L298-2(lines 298 302) no Hoare annotation was computed. [2019-11-20 02:12:41,827 INFO L447 ceAbstractionStarter]: At program point L563(lines 106 564) the Hoare annotation is: true [2019-11-20 02:12:41,827 INFO L444 ceAbstractionStarter]: For program point L200(lines 200 513) no Hoare annotation was computed. [2019-11-20 02:12:41,828 INFO L444 ceAbstractionStarter]: For program point L167(lines 167 524) no Hoare annotation was computed. [2019-11-20 02:12:41,828 INFO L444 ceAbstractionStarter]: For program point L134(lines 134 535) no Hoare annotation was computed. [2019-11-20 02:12:41,828 INFO L444 ceAbstractionStarter]: For program point L101(lines 101 105) no Hoare annotation was computed. [2019-11-20 02:12:41,869 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 20.11 02:12:41 BoogieIcfgContainer [2019-11-20 02:12:41,870 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-11-20 02:12:41,871 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-11-20 02:12:41,871 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-11-20 02:12:41,871 INFO L275 PluginConnector]: Witness Printer initialized [2019-11-20 02:12:41,872 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 02:12:23" (3/4) ... [2019-11-20 02:12:41,877 INFO L137 WitnessPrinter]: Generating witness for correct program [2019-11-20 02:12:41,908 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2019-11-20 02:12:41,909 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2019-11-20 02:12:42,100 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/run_dir_51d892bb-c17d-4536-9550-f6b03eb54ca9/bin/uautomizer/witness.graphml [2019-11-20 02:12:42,100 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-11-20 02:12:42,102 INFO L168 Benchmark]: Toolchain (without parser) took 20181.44 ms. Allocated memory was 1.0 GB in the beginning and 2.1 GB in the end (delta: 1.0 GB). Free memory was 946.1 MB in the beginning and 1.8 GB in the end (delta: -850.4 MB). Peak memory consumption was 177.2 MB. Max. memory is 11.5 GB. [2019-11-20 02:12:42,102 INFO L168 Benchmark]: CDTParser took 0.30 ms. Allocated memory is still 1.0 GB. Free memory is still 967.5 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-20 02:12:42,103 INFO L168 Benchmark]: CACSL2BoogieTranslator took 510.75 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 129.0 MB). Free memory was 946.1 MB in the beginning and 1.1 GB in the end (delta: -173.7 MB). Peak memory consumption was 23.5 MB. Max. memory is 11.5 GB. [2019-11-20 02:12:42,103 INFO L168 Benchmark]: Boogie Procedure Inliner took 82.34 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.9 MB). Peak memory consumption was 6.9 MB. Max. memory is 11.5 GB. [2019-11-20 02:12:42,103 INFO L168 Benchmark]: Boogie Preprocessor took 80.53 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: 1.7 MB). Peak memory consumption was 1.7 MB. Max. memory is 11.5 GB. [2019-11-20 02:12:42,104 INFO L168 Benchmark]: RCFGBuilder took 977.32 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: 56.4 MB). Peak memory consumption was 56.4 MB. Max. memory is 11.5 GB. [2019-11-20 02:12:42,104 INFO L168 Benchmark]: TraceAbstraction took 18292.22 ms. Allocated memory was 1.2 GB in the beginning and 2.1 GB in the end (delta: 898.6 MB). Free memory was 1.1 GB in the beginning and 1.8 GB in the end (delta: -749.7 MB). Peak memory consumption was 1.2 GB. Max. memory is 11.5 GB. [2019-11-20 02:12:42,105 INFO L168 Benchmark]: Witness Printer took 229.62 ms. Allocated memory is still 2.1 GB. Free memory was 1.8 GB in the beginning and 1.8 GB in the end (delta: 8.0 MB). Peak memory consumption was 8.0 MB. Max. memory is 11.5 GB. [2019-11-20 02:12:42,107 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.30 ms. Allocated memory is still 1.0 GB. Free memory is still 967.5 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 510.75 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 129.0 MB). Free memory was 946.1 MB in the beginning and 1.1 GB in the end (delta: -173.7 MB). Peak memory consumption was 23.5 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 82.34 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.9 MB). Peak memory consumption was 6.9 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 80.53 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: 1.7 MB). Peak memory consumption was 1.7 MB. Max. memory is 11.5 GB. * RCFGBuilder took 977.32 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: 56.4 MB). Peak memory consumption was 56.4 MB. Max. memory is 11.5 GB. * TraceAbstraction took 18292.22 ms. Allocated memory was 1.2 GB in the beginning and 2.1 GB in the end (delta: 898.6 MB). Free memory was 1.1 GB in the beginning and 1.8 GB in the end (delta: -749.7 MB). Peak memory consumption was 1.2 GB. Max. memory is 11.5 GB. * Witness Printer took 229.62 ms. Allocated memory is still 2.1 GB. Free memory was 1.8 GB in the beginning and 1.8 GB in the end (delta: 8.0 MB). Peak memory consumption was 8.0 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 572]: 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: 110]: Loop Invariant Derived loop invariant: blastFlag <= 2 && 12292 == s__state - InvariantResult [Line: 206]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 84]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 173]: Loop Invariant Derived loop invariant: ((s__state <= 4512 && blastFlag <= 4) && 0 == s__hit) && 4432 <= s__state - InvariantResult [Line: 208]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 131]: Loop Invariant Derived loop invariant: (blastFlag <= 2 && s__state <= 4432) && 4352 <= s__state - InvariantResult [Line: 185]: Loop Invariant Derived loop invariant: (((s__state <= 4528 && blastFlag <= 4) && 0 == s__hit) && 4432 <= s__state) || (4512 <= s__state && s__state <= 4528 && blastFlag <= 2) - InvariantResult [Line: 143]: Loop Invariant Derived loop invariant: ((blastFlag <= 4 && s__state <= 4432) && 4352 <= s__state) && 0 == s__hit - InvariantResult [Line: 197]: Loop Invariant Derived loop invariant: ((((4560 <= s__state && s__state <= 4560) && 4560 <= s__s3__tmp__next_state___0) && 0 == s__hit) && s__s3__tmp__next_state___0 <= 4560) || (((!(0 == s__hit) && 4560 <= s__state) && s__state <= 4560) && blastFlag <= 2) - InvariantResult [Line: 155]: Loop Invariant Derived loop invariant: ((s__state <= 4464 && blastFlag <= 4) && 0 == s__hit) && 4432 <= s__state - InvariantResult [Line: 106]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 576]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 161]: Loop Invariant Derived loop invariant: ((s__state <= 4480 && blastFlag <= 4) && 0 == s__hit) && 4432 <= s__state - InvariantResult [Line: 10]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 107]: Loop Invariant Derived loop invariant: ((((((((((((blastFlag <= 2 && 4368 == s__state) || ((((s__state <= 4352 && 4352 <= s__state) && 4560 <= s__s3__tmp__next_state___0) && 0 == s__hit) && s__s3__tmp__next_state___0 <= 4560)) || ((((blastFlag <= 2 && !(0 == s__hit)) && s__state <= 4352) && s__s3__tmp__next_state___0 <= 3) && 4352 <= s__state)) || ((blastFlag <= 2 && s__state <= 3) && 0 == s__hit)) || (((blastFlag <= 4 && 0 == s__hit) && s__s3__tmp__next_state___0 <= 4560) && 4400 == s__state)) || (((!(0 == s__hit) && 4560 <= s__state) && s__state <= 4560) && blastFlag <= 2)) || (((s__state <= 4528 && blastFlag <= 4) && 0 == s__hit) && 4432 <= s__state)) || ((4512 <= s__state && s__state <= 4528) && blastFlag <= 2)) || ((((4560 <= s__state && s__state <= 4560) && 4560 <= s__s3__tmp__next_state___0) && 0 == s__hit) && s__s3__tmp__next_state___0 <= 4560)) || (s__state == 4384 && blastFlag <= 2)) || ((blastFlag <= 2 && 0 == s__hit) && 4400 == s__state)) || ((4416 == s__state && blastFlag <= 4) && 0 == s__hit)) || (s__state <= 3 && s__s3__tmp__next_state___0 <= 4560) - InvariantResult [Line: 125]: Loop Invariant Derived loop invariant: (blastFlag <= 2 && s__state <= 4432) && 4352 <= s__state - InvariantResult [Line: 203]: Loop Invariant Derived loop invariant: ((((blastFlag <= 2 && !(0 == s__hit)) && s__state <= 4352) && s__s3__tmp__next_state___0 <= 3) && 4352 <= s__state) || ((((s__state <= 4352 && 4352 <= s__state) && 4560 <= s__s3__tmp__next_state___0) && 0 == s__hit) && s__s3__tmp__next_state___0 <= 4560) - InvariantResult [Line: 113]: Loop Invariant Derived loop invariant: s__state <= 4560 && blastFlag <= 2 - InvariantResult [Line: 179]: Loop Invariant Derived loop invariant: ((s__state <= 4512 && blastFlag <= 4) && 0 == s__hit) && 4432 <= s__state - InvariantResult [Line: 137]: Loop Invariant Derived loop invariant: (((blastFlag <= 2 && s__state <= 4432) && 4352 <= s__state) && 0 == s__hit) || ((((blastFlag <= 4 && s__state <= 4432) && 4352 <= s__state) && 0 == s__hit) && s__s3__tmp__next_state___0 <= 4560) - InvariantResult [Line: 191]: Loop Invariant Derived loop invariant: (((4512 <= s__state && s__state <= 4560) && blastFlag <= 2) || (((s__state <= 4560 && 0 == s__hit) && s__s3__tmp__next_state___0 <= 4560) && 4432 <= s__state)) || (((blastFlag <= 4 && 0 == s__hit) && 4432 <= s__state) && s__state <= 4560) - InvariantResult [Line: 149]: Loop Invariant Derived loop invariant: ((blastFlag <= 4 && s__state <= 4448) && 0 == s__hit) && 4432 <= s__state - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 127 locations, 1 error locations. Result: SAFE, OverallTime: 18.1s, OverallIterations: 25, TraceHistogramMax: 21, AutomataDifference: 6.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 2.4s, HoareTripleCheckerStatistics: 4490 SDtfs, 2114 SDslu, 2318 SDs, 0 SdLazy, 2460 SolverSat, 611 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 3.6s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 2400 GetRequests, 2365 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=5709occurred 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.5s AutomataMinimizationTime, 25 MinimizatonAttempts, 4032 StatesRemovedByMinimization, 21 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 22 LocationsWithAnnotation, 22 PreInvPairs, 155 NumberOfFragments, 427 HoareAnnotationTreeSize, 22 FomulaSimplifications, 29279 FormulaSimplificationTreeSizeReduction, 0.6s HoareSimplificationTime, 22 FomulaSimplificationsInter, 24849 FormulaSimplificationTreeSizeReductionInter, 1.7s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 1.1s SatisfiabilityAnalysisTime, 2.9s InterpolantComputationTime, 8415 NumberOfCodeBlocks, 8415 NumberOfCodeBlocksAsserted, 31 NumberOfCheckSat, 8385 ConstructedInterpolants, 0 QuantifiedInterpolants, 4385301 SizeOfPredicates, 7 NumberOfNonLiveVariables, 3916 ConjunctsInSsa, 14 ConjunctsInUnsatCore, 30 InterpolantComputations, 22 PerfectInterpolantSequences, 37271/37361 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...