./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/ssh-simplified/s3_srvr_14.cil.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_9ce7fe60-4a07-4e4e-b8b2-b4ec354c7618/bin/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/run_dir_9ce7fe60-4a07-4e4e-b8b2-b4ec354c7618/bin/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_9ce7fe60-4a07-4e4e-b8b2-b4ec354c7618/bin/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_9ce7fe60-4a07-4e4e-b8b2-b4ec354c7618/bin/uautomizer/config/AutomizerReach.xml -i ../../sv-benchmarks/c/ssh-simplified/s3_srvr_14.cil.c -s /tmp/vcloud-vcloud-master/worker/run_dir_9ce7fe60-4a07-4e4e-b8b2-b4ec354c7618/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_9ce7fe60-4a07-4e4e-b8b2-b4ec354c7618/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 f0194e72737fa00e9def2494335d4249cbea0bcd .................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE --- Real Ultimate output --- This is Ultimate 0.1.24-678e011 [2019-11-20 05:48:02,731 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-20 05:48:02,733 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-20 05:48:02,746 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-20 05:48:02,747 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-20 05:48:02,748 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-20 05:48:02,750 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-20 05:48:02,758 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-20 05:48:02,763 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-20 05:48:02,766 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-20 05:48:02,768 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-20 05:48:02,769 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-20 05:48:02,769 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-20 05:48:02,771 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-20 05:48:02,772 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-20 05:48:02,773 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-20 05:48:02,774 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-20 05:48:02,775 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-20 05:48:02,777 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-20 05:48:02,781 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-20 05:48:02,784 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-20 05:48:02,786 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-20 05:48:02,788 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-20 05:48:02,789 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-20 05:48:02,791 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-20 05:48:02,791 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-20 05:48:02,791 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-20 05:48:02,793 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-20 05:48:02,793 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-20 05:48:02,794 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-20 05:48:02,794 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-20 05:48:02,795 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-20 05:48:02,795 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-20 05:48:02,796 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-20 05:48:02,797 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-20 05:48:02,797 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-20 05:48:02,798 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-20 05:48:02,798 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-20 05:48:02,798 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-20 05:48:02,799 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-20 05:48:02,800 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-20 05:48:02,801 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_9ce7fe60-4a07-4e4e-b8b2-b4ec354c7618/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf [2019-11-20 05:48:02,824 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-20 05:48:02,834 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-20 05:48:02,835 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-20 05:48:02,835 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-20 05:48:02,835 INFO L138 SettingsManager]: * Use SBE=true [2019-11-20 05:48:02,835 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-20 05:48:02,836 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-20 05:48:02,836 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-20 05:48:02,836 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-20 05:48:02,836 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-20 05:48:02,836 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-11-20 05:48:02,837 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-20 05:48:02,837 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-11-20 05:48:02,837 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-20 05:48:02,837 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-20 05:48:02,837 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-20 05:48:02,838 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-11-20 05:48:02,838 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-20 05:48:02,839 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-20 05:48:02,839 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-20 05:48:02,839 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-20 05:48:02,839 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-20 05:48:02,840 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-20 05:48:02,840 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-20 05:48:02,840 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-11-20 05:48:02,840 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-11-20 05:48:02,840 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-11-20 05:48:02,841 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-11-20 05:48:02,841 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_9ce7fe60-4a07-4e4e-b8b2-b4ec354c7618/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 -> f0194e72737fa00e9def2494335d4249cbea0bcd [2019-11-20 05:48:02,996 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-20 05:48:03,006 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-20 05:48:03,009 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-20 05:48:03,010 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-20 05:48:03,010 INFO L275 PluginConnector]: CDTParser initialized [2019-11-20 05:48:03,011 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_9ce7fe60-4a07-4e4e-b8b2-b4ec354c7618/bin/uautomizer/../../sv-benchmarks/c/ssh-simplified/s3_srvr_14.cil.c [2019-11-20 05:48:03,063 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_9ce7fe60-4a07-4e4e-b8b2-b4ec354c7618/bin/uautomizer/data/b4d683b9e/160ab7897ce346b0bd03c5a4204be3b0/FLAG63d7186c7 [2019-11-20 05:48:03,476 INFO L306 CDTParser]: Found 1 translation units. [2019-11-20 05:48:03,477 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_9ce7fe60-4a07-4e4e-b8b2-b4ec354c7618/sv-benchmarks/c/ssh-simplified/s3_srvr_14.cil.c [2019-11-20 05:48:03,502 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_9ce7fe60-4a07-4e4e-b8b2-b4ec354c7618/bin/uautomizer/data/b4d683b9e/160ab7897ce346b0bd03c5a4204be3b0/FLAG63d7186c7 [2019-11-20 05:48:03,808 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_9ce7fe60-4a07-4e4e-b8b2-b4ec354c7618/bin/uautomizer/data/b4d683b9e/160ab7897ce346b0bd03c5a4204be3b0 [2019-11-20 05:48:03,811 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-20 05:48:03,812 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-11-20 05:48:03,812 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-20 05:48:03,813 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-20 05:48:03,816 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-20 05:48:03,816 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.11 05:48:03" (1/1) ... [2019-11-20 05:48:03,818 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6f29b82b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 05:48:03, skipping insertion in model container [2019-11-20 05:48:03,818 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.11 05:48:03" (1/1) ... [2019-11-20 05:48:03,824 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-11-20 05:48:03,862 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-11-20 05:48:04,193 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-20 05:48:04,197 INFO L188 MainTranslator]: Completed pre-run [2019-11-20 05:48:04,282 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-20 05:48:04,301 INFO L192 MainTranslator]: Completed translation [2019-11-20 05:48:04,301 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 05:48:04 WrapperNode [2019-11-20 05:48:04,301 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-20 05:48:04,302 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-11-20 05:48:04,302 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-11-20 05:48:04,302 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-11-20 05:48:04,309 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 05:48:04" (1/1) ... [2019-11-20 05:48:04,318 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 05:48:04" (1/1) ... [2019-11-20 05:48:04,355 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-11-20 05:48:04,355 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-20 05:48:04,355 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-20 05:48:04,356 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-20 05:48:04,366 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 05:48:04" (1/1) ... [2019-11-20 05:48:04,367 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 05:48:04" (1/1) ... [2019-11-20 05:48:04,370 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 05:48:04" (1/1) ... [2019-11-20 05:48:04,370 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 05:48:04" (1/1) ... [2019-11-20 05:48:04,378 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 05:48:04" (1/1) ... [2019-11-20 05:48:04,404 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 05:48:04" (1/1) ... [2019-11-20 05:48:04,406 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 05:48:04" (1/1) ... [2019-11-20 05:48:04,410 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-20 05:48:04,410 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-20 05:48:04,411 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-20 05:48:04,411 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-20 05:48:04,411 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 05:48:04" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_9ce7fe60-4a07-4e4e-b8b2-b4ec354c7618/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 05:48:04,480 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-20 05:48:04,480 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-20 05:48:04,611 WARN L736 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-11-20 05:48:05,277 INFO L689 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##90: assume false; [2019-11-20 05:48:05,277 INFO L689 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##91: assume !false; [2019-11-20 05:48:05,278 INFO L280 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-20 05:48:05,278 INFO L285 CfgBuilder]: Removed 7 assume(true) statements. [2019-11-20 05:48:05,279 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 05:48:05 BoogieIcfgContainer [2019-11-20 05:48:05,280 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-20 05:48:05,281 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-20 05:48:05,281 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-20 05:48:05,283 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-20 05:48:05,284 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.11 05:48:03" (1/3) ... [2019-11-20 05:48:05,285 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@cbfc085 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.11 05:48:05, skipping insertion in model container [2019-11-20 05:48:05,285 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 05:48:04" (2/3) ... [2019-11-20 05:48:05,285 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@cbfc085 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.11 05:48:05, skipping insertion in model container [2019-11-20 05:48:05,285 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 05:48:05" (3/3) ... [2019-11-20 05:48:05,286 INFO L109 eAbstractionObserver]: Analyzing ICFG s3_srvr_14.cil.c [2019-11-20 05:48:05,295 INFO L153 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-20 05:48:05,301 INFO L165 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-11-20 05:48:05,310 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-11-20 05:48:05,332 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-20 05:48:05,332 INFO L374 AbstractCegarLoop]: Hoare is true [2019-11-20 05:48:05,332 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-20 05:48:05,332 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-20 05:48:05,333 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-20 05:48:05,333 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-20 05:48:05,333 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-20 05:48:05,333 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-20 05:48:05,350 INFO L276 IsEmpty]: Start isEmpty. Operand 150 states. [2019-11-20 05:48:05,355 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-11-20 05:48:05,355 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 05:48:05,356 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] [2019-11-20 05:48:05,356 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 05:48:05,362 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 05:48:05,362 INFO L82 PathProgramCache]: Analyzing trace with hash 1734880928, now seen corresponding path program 1 times [2019-11-20 05:48:05,370 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 05:48:05,370 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1752452344] [2019-11-20 05:48:05,370 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 05:48:05,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 05:48:05,543 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 05:48:05,543 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1752452344] [2019-11-20 05:48:05,544 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 05:48:05,544 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-20 05:48:05,546 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1470406885] [2019-11-20 05:48:05,549 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-20 05:48:05,550 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 05:48:05,561 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-20 05:48:05,562 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-20 05:48:05,564 INFO L87 Difference]: Start difference. First operand 150 states. Second operand 3 states. [2019-11-20 05:48:05,797 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 05:48:05,797 INFO L93 Difference]: Finished difference Result 323 states and 555 transitions. [2019-11-20 05:48:05,799 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-20 05:48:05,801 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 22 [2019-11-20 05:48:05,801 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 05:48:05,813 INFO L225 Difference]: With dead ends: 323 [2019-11-20 05:48:05,814 INFO L226 Difference]: Without dead ends: 160 [2019-11-20 05:48:05,819 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 05:48:05,835 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 160 states. [2019-11-20 05:48:05,860 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 160 to 156. [2019-11-20 05:48:05,861 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 156 states. [2019-11-20 05:48:05,863 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 156 states to 156 states and 248 transitions. [2019-11-20 05:48:05,864 INFO L78 Accepts]: Start accepts. Automaton has 156 states and 248 transitions. Word has length 22 [2019-11-20 05:48:05,864 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 05:48:05,864 INFO L462 AbstractCegarLoop]: Abstraction has 156 states and 248 transitions. [2019-11-20 05:48:05,864 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-20 05:48:05,865 INFO L276 IsEmpty]: Start isEmpty. Operand 156 states and 248 transitions. [2019-11-20 05:48:05,866 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2019-11-20 05:48:05,866 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 05:48:05,866 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 05:48:05,866 INFO L410 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 05:48:05,867 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 05:48:05,867 INFO L82 PathProgramCache]: Analyzing trace with hash -923936279, now seen corresponding path program 1 times [2019-11-20 05:48:05,867 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 05:48:05,867 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1981391740] [2019-11-20 05:48:05,867 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 05:48:05,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 05:48:05,928 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 05:48:05,928 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1981391740] [2019-11-20 05:48:05,928 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 05:48:05,928 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-20 05:48:05,929 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [619755841] [2019-11-20 05:48:05,930 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-20 05:48:05,930 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 05:48:05,930 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-20 05:48:05,931 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-20 05:48:05,931 INFO L87 Difference]: Start difference. First operand 156 states and 248 transitions. Second operand 3 states. [2019-11-20 05:48:06,076 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 05:48:06,077 INFO L93 Difference]: Finished difference Result 330 states and 522 transitions. [2019-11-20 05:48:06,077 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-20 05:48:06,077 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 23 [2019-11-20 05:48:06,077 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 05:48:06,080 INFO L225 Difference]: With dead ends: 330 [2019-11-20 05:48:06,080 INFO L226 Difference]: Without dead ends: 181 [2019-11-20 05:48:06,081 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 05:48:06,082 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 181 states. [2019-11-20 05:48:06,105 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 181 to 179. [2019-11-20 05:48:06,105 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 179 states. [2019-11-20 05:48:06,106 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 179 states to 179 states and 281 transitions. [2019-11-20 05:48:06,107 INFO L78 Accepts]: Start accepts. Automaton has 179 states and 281 transitions. Word has length 23 [2019-11-20 05:48:06,107 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 05:48:06,107 INFO L462 AbstractCegarLoop]: Abstraction has 179 states and 281 transitions. [2019-11-20 05:48:06,107 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-20 05:48:06,107 INFO L276 IsEmpty]: Start isEmpty. Operand 179 states and 281 transitions. [2019-11-20 05:48:06,108 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2019-11-20 05:48:06,108 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 05:48:06,108 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 05:48:06,109 INFO L410 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 05:48:06,109 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 05:48:06,109 INFO L82 PathProgramCache]: Analyzing trace with hash -936892908, now seen corresponding path program 1 times [2019-11-20 05:48:06,109 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 05:48:06,109 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [564204024] [2019-11-20 05:48:06,110 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 05:48:06,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 05:48:06,159 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 05:48:06,160 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [564204024] [2019-11-20 05:48:06,160 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 05:48:06,160 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-20 05:48:06,160 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [632942171] [2019-11-20 05:48:06,161 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-20 05:48:06,161 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 05:48:06,161 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-20 05:48:06,161 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-20 05:48:06,161 INFO L87 Difference]: Start difference. First operand 179 states and 281 transitions. Second operand 3 states. [2019-11-20 05:48:06,313 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 05:48:06,313 INFO L93 Difference]: Finished difference Result 361 states and 566 transitions. [2019-11-20 05:48:06,315 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-20 05:48:06,315 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 23 [2019-11-20 05:48:06,316 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 05:48:06,318 INFO L225 Difference]: With dead ends: 361 [2019-11-20 05:48:06,318 INFO L226 Difference]: Without dead ends: 189 [2019-11-20 05:48:06,319 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 05:48:06,320 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 189 states. [2019-11-20 05:48:06,343 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 189 to 185. [2019-11-20 05:48:06,345 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 185 states. [2019-11-20 05:48:06,347 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 185 states to 185 states and 292 transitions. [2019-11-20 05:48:06,347 INFO L78 Accepts]: Start accepts. Automaton has 185 states and 292 transitions. Word has length 23 [2019-11-20 05:48:06,347 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 05:48:06,355 INFO L462 AbstractCegarLoop]: Abstraction has 185 states and 292 transitions. [2019-11-20 05:48:06,355 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-20 05:48:06,355 INFO L276 IsEmpty]: Start isEmpty. Operand 185 states and 292 transitions. [2019-11-20 05:48:06,357 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2019-11-20 05:48:06,358 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 05:48:06,358 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 05:48:06,359 INFO L410 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 05:48:06,359 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 05:48:06,359 INFO L82 PathProgramCache]: Analyzing trace with hash -1640243884, now seen corresponding path program 1 times [2019-11-20 05:48:06,360 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 05:48:06,360 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1068666481] [2019-11-20 05:48:06,360 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 05:48:06,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 05:48:06,447 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 05:48:06,447 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1068666481] [2019-11-20 05:48:06,448 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 05:48:06,448 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-20 05:48:06,448 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1872848032] [2019-11-20 05:48:06,448 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-20 05:48:06,449 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 05:48:06,449 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-20 05:48:06,449 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-20 05:48:06,449 INFO L87 Difference]: Start difference. First operand 185 states and 292 transitions. Second operand 3 states. [2019-11-20 05:48:06,624 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 05:48:06,624 INFO L93 Difference]: Finished difference Result 366 states and 576 transitions. [2019-11-20 05:48:06,624 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-20 05:48:06,625 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 23 [2019-11-20 05:48:06,625 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 05:48:06,626 INFO L225 Difference]: With dead ends: 366 [2019-11-20 05:48:06,627 INFO L226 Difference]: Without dead ends: 188 [2019-11-20 05:48:06,628 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 05:48:06,629 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 188 states. [2019-11-20 05:48:06,639 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 188 to 186. [2019-11-20 05:48:06,639 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 186 states. [2019-11-20 05:48:06,641 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 186 states to 186 states and 293 transitions. [2019-11-20 05:48:06,641 INFO L78 Accepts]: Start accepts. Automaton has 186 states and 293 transitions. Word has length 23 [2019-11-20 05:48:06,641 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 05:48:06,641 INFO L462 AbstractCegarLoop]: Abstraction has 186 states and 293 transitions. [2019-11-20 05:48:06,642 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-20 05:48:06,642 INFO L276 IsEmpty]: Start isEmpty. Operand 186 states and 293 transitions. [2019-11-20 05:48:06,643 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2019-11-20 05:48:06,643 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 05:48:06,643 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 05:48:06,643 INFO L410 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 05:48:06,644 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 05:48:06,644 INFO L82 PathProgramCache]: Analyzing trace with hash 940477948, now seen corresponding path program 1 times [2019-11-20 05:48:06,644 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 05:48:06,645 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [64911427] [2019-11-20 05:48:06,645 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 05:48:06,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 05:48:06,692 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 05:48:06,692 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [64911427] [2019-11-20 05:48:06,692 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 05:48:06,692 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-20 05:48:06,693 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1069415798] [2019-11-20 05:48:06,693 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-20 05:48:06,693 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 05:48:06,693 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-20 05:48:06,694 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-20 05:48:06,694 INFO L87 Difference]: Start difference. First operand 186 states and 293 transitions. Second operand 3 states. [2019-11-20 05:48:06,826 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 05:48:06,827 INFO L93 Difference]: Finished difference Result 377 states and 588 transitions. [2019-11-20 05:48:06,827 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-20 05:48:06,827 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 24 [2019-11-20 05:48:06,828 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 05:48:06,829 INFO L225 Difference]: With dead ends: 377 [2019-11-20 05:48:06,829 INFO L226 Difference]: Without dead ends: 198 [2019-11-20 05:48:06,830 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 05:48:06,831 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 198 states. [2019-11-20 05:48:06,846 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 198 to 186. [2019-11-20 05:48:06,846 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 186 states. [2019-11-20 05:48:06,847 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 186 states to 186 states and 291 transitions. [2019-11-20 05:48:06,847 INFO L78 Accepts]: Start accepts. Automaton has 186 states and 291 transitions. Word has length 24 [2019-11-20 05:48:06,847 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 05:48:06,847 INFO L462 AbstractCegarLoop]: Abstraction has 186 states and 291 transitions. [2019-11-20 05:48:06,847 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-20 05:48:06,847 INFO L276 IsEmpty]: Start isEmpty. Operand 186 states and 291 transitions. [2019-11-20 05:48:06,848 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-11-20 05:48:06,848 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 05:48:06,848 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 05:48:06,849 INFO L410 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 05:48:06,849 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 05:48:06,853 INFO L82 PathProgramCache]: Analyzing trace with hash 1862867376, now seen corresponding path program 1 times [2019-11-20 05:48:06,853 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 05:48:06,853 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1352793441] [2019-11-20 05:48:06,853 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 05:48:06,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 05:48:06,904 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 05:48:06,904 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1352793441] [2019-11-20 05:48:06,905 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 05:48:06,905 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-20 05:48:06,905 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [902068560] [2019-11-20 05:48:06,905 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-20 05:48:06,906 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 05:48:06,906 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-20 05:48:06,906 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-20 05:48:06,906 INFO L87 Difference]: Start difference. First operand 186 states and 291 transitions. Second operand 3 states. [2019-11-20 05:48:07,073 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 05:48:07,073 INFO L93 Difference]: Finished difference Result 377 states and 584 transitions. [2019-11-20 05:48:07,074 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-20 05:48:07,074 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 25 [2019-11-20 05:48:07,074 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 05:48:07,075 INFO L225 Difference]: With dead ends: 377 [2019-11-20 05:48:07,075 INFO L226 Difference]: Without dead ends: 198 [2019-11-20 05:48:07,076 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 05:48:07,077 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 198 states. [2019-11-20 05:48:07,083 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 198 to 186. [2019-11-20 05:48:07,083 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 186 states. [2019-11-20 05:48:07,084 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 186 states to 186 states and 289 transitions. [2019-11-20 05:48:07,084 INFO L78 Accepts]: Start accepts. Automaton has 186 states and 289 transitions. Word has length 25 [2019-11-20 05:48:07,084 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 05:48:07,084 INFO L462 AbstractCegarLoop]: Abstraction has 186 states and 289 transitions. [2019-11-20 05:48:07,084 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-20 05:48:07,085 INFO L276 IsEmpty]: Start isEmpty. Operand 186 states and 289 transitions. [2019-11-20 05:48:07,085 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-11-20 05:48:07,085 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 05:48:07,086 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 05:48:07,086 INFO L410 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 05:48:07,086 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 05:48:07,086 INFO L82 PathProgramCache]: Analyzing trace with hash 2134464983, now seen corresponding path program 1 times [2019-11-20 05:48:07,086 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 05:48:07,087 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1048576520] [2019-11-20 05:48:07,087 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 05:48:07,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 05:48:07,110 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 05:48:07,110 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1048576520] [2019-11-20 05:48:07,110 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 05:48:07,110 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-20 05:48:07,111 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [782375264] [2019-11-20 05:48:07,111 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-20 05:48:07,111 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 05:48:07,111 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-20 05:48:07,111 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-20 05:48:07,112 INFO L87 Difference]: Start difference. First operand 186 states and 289 transitions. Second operand 3 states. [2019-11-20 05:48:07,242 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 05:48:07,242 INFO L93 Difference]: Finished difference Result 377 states and 580 transitions. [2019-11-20 05:48:07,243 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-20 05:48:07,243 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 26 [2019-11-20 05:48:07,243 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 05:48:07,244 INFO L225 Difference]: With dead ends: 377 [2019-11-20 05:48:07,245 INFO L226 Difference]: Without dead ends: 198 [2019-11-20 05:48:07,245 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 05:48:07,246 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 198 states. [2019-11-20 05:48:07,251 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 198 to 186. [2019-11-20 05:48:07,252 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 186 states. [2019-11-20 05:48:07,252 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 186 states to 186 states and 287 transitions. [2019-11-20 05:48:07,253 INFO L78 Accepts]: Start accepts. Automaton has 186 states and 287 transitions. Word has length 26 [2019-11-20 05:48:07,253 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 05:48:07,253 INFO L462 AbstractCegarLoop]: Abstraction has 186 states and 287 transitions. [2019-11-20 05:48:07,253 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-20 05:48:07,253 INFO L276 IsEmpty]: Start isEmpty. Operand 186 states and 287 transitions. [2019-11-20 05:48:07,254 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-11-20 05:48:07,254 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 05:48:07,254 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 05:48:07,254 INFO L410 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 05:48:07,254 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 05:48:07,255 INFO L82 PathProgramCache]: Analyzing trace with hash 744248342, now seen corresponding path program 1 times [2019-11-20 05:48:07,255 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 05:48:07,255 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1018475956] [2019-11-20 05:48:07,255 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 05:48:07,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 05:48:07,280 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 05:48:07,280 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1018475956] [2019-11-20 05:48:07,280 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 05:48:07,280 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-20 05:48:07,280 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1190752750] [2019-11-20 05:48:07,281 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-20 05:48:07,281 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 05:48:07,281 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-20 05:48:07,281 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-20 05:48:07,281 INFO L87 Difference]: Start difference. First operand 186 states and 287 transitions. Second operand 3 states. [2019-11-20 05:48:07,300 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 05:48:07,301 INFO L93 Difference]: Finished difference Result 536 states and 822 transitions. [2019-11-20 05:48:07,301 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-20 05:48:07,301 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 26 [2019-11-20 05:48:07,301 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 05:48:07,303 INFO L225 Difference]: With dead ends: 536 [2019-11-20 05:48:07,304 INFO L226 Difference]: Without dead ends: 357 [2019-11-20 05:48:07,304 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 05:48:07,305 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 357 states. [2019-11-20 05:48:07,317 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 357 to 355. [2019-11-20 05:48:07,317 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 355 states. [2019-11-20 05:48:07,319 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 355 states to 355 states and 542 transitions. [2019-11-20 05:48:07,319 INFO L78 Accepts]: Start accepts. Automaton has 355 states and 542 transitions. Word has length 26 [2019-11-20 05:48:07,319 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 05:48:07,319 INFO L462 AbstractCegarLoop]: Abstraction has 355 states and 542 transitions. [2019-11-20 05:48:07,319 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-20 05:48:07,319 INFO L276 IsEmpty]: Start isEmpty. Operand 355 states and 542 transitions. [2019-11-20 05:48:07,320 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-11-20 05:48:07,320 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 05:48:07,320 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 05:48:07,321 INFO L410 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 05:48:07,321 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 05:48:07,321 INFO L82 PathProgramCache]: Analyzing trace with hash 1232648243, now seen corresponding path program 1 times [2019-11-20 05:48:07,321 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 05:48:07,321 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1701430920] [2019-11-20 05:48:07,321 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 05:48:07,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 05:48:07,352 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 05:48:07,352 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1701430920] [2019-11-20 05:48:07,352 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 05:48:07,352 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-20 05:48:07,353 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [682183737] [2019-11-20 05:48:07,353 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-20 05:48:07,353 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 05:48:07,353 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-20 05:48:07,353 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-20 05:48:07,354 INFO L87 Difference]: Start difference. First operand 355 states and 542 transitions. Second operand 4 states. [2019-11-20 05:48:07,618 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 05:48:07,619 INFO L93 Difference]: Finished difference Result 1099 states and 1679 transitions. [2019-11-20 05:48:07,619 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-20 05:48:07,619 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 27 [2019-11-20 05:48:07,619 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 05:48:07,624 INFO L225 Difference]: With dead ends: 1099 [2019-11-20 05:48:07,624 INFO L226 Difference]: Without dead ends: 752 [2019-11-20 05:48:07,625 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 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 05:48:07,626 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 752 states. [2019-11-20 05:48:07,647 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 752 to 598. [2019-11-20 05:48:07,647 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 598 states. [2019-11-20 05:48:07,650 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 598 states to 598 states and 927 transitions. [2019-11-20 05:48:07,650 INFO L78 Accepts]: Start accepts. Automaton has 598 states and 927 transitions. Word has length 27 [2019-11-20 05:48:07,650 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 05:48:07,650 INFO L462 AbstractCegarLoop]: Abstraction has 598 states and 927 transitions. [2019-11-20 05:48:07,650 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-20 05:48:07,650 INFO L276 IsEmpty]: Start isEmpty. Operand 598 states and 927 transitions. [2019-11-20 05:48:07,652 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2019-11-20 05:48:07,652 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 05:48:07,652 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 05:48:07,652 INFO L410 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 05:48:07,652 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 05:48:07,653 INFO L82 PathProgramCache]: Analyzing trace with hash 1405707043, now seen corresponding path program 1 times [2019-11-20 05:48:07,653 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 05:48:07,653 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1427348568] [2019-11-20 05:48:07,653 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 05:48:07,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 05:48:07,685 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 05:48:07,685 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1427348568] [2019-11-20 05:48:07,685 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 05:48:07,685 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-20 05:48:07,686 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1770776031] [2019-11-20 05:48:07,686 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-20 05:48:07,686 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 05:48:07,686 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-20 05:48:07,686 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-20 05:48:07,687 INFO L87 Difference]: Start difference. First operand 598 states and 927 transitions. Second operand 3 states. [2019-11-20 05:48:07,867 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 05:48:07,867 INFO L93 Difference]: Finished difference Result 1330 states and 2091 transitions. [2019-11-20 05:48:07,867 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-20 05:48:07,867 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 41 [2019-11-20 05:48:07,868 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 05:48:07,872 INFO L225 Difference]: With dead ends: 1330 [2019-11-20 05:48:07,872 INFO L226 Difference]: Without dead ends: 740 [2019-11-20 05:48:07,873 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 05:48:07,875 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 740 states. [2019-11-20 05:48:07,899 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 740 to 720. [2019-11-20 05:48:07,900 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 720 states. [2019-11-20 05:48:07,903 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 720 states to 720 states and 1142 transitions. [2019-11-20 05:48:07,903 INFO L78 Accepts]: Start accepts. Automaton has 720 states and 1142 transitions. Word has length 41 [2019-11-20 05:48:07,904 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 05:48:07,904 INFO L462 AbstractCegarLoop]: Abstraction has 720 states and 1142 transitions. [2019-11-20 05:48:07,904 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-20 05:48:07,904 INFO L276 IsEmpty]: Start isEmpty. Operand 720 states and 1142 transitions. [2019-11-20 05:48:07,905 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2019-11-20 05:48:07,905 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 05:48:07,906 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 05:48:07,906 INFO L410 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 05:48:07,906 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 05:48:07,906 INFO L82 PathProgramCache]: Analyzing trace with hash -1323716310, now seen corresponding path program 1 times [2019-11-20 05:48:07,906 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 05:48:07,907 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1291278078] [2019-11-20 05:48:07,907 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 05:48:07,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 05:48:07,943 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 05:48:07,944 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1291278078] [2019-11-20 05:48:07,944 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 05:48:07,944 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-20 05:48:07,944 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1505608539] [2019-11-20 05:48:07,945 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-20 05:48:07,945 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 05:48:07,945 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-20 05:48:07,945 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-20 05:48:07,945 INFO L87 Difference]: Start difference. First operand 720 states and 1142 transitions. Second operand 3 states. [2019-11-20 05:48:08,138 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 05:48:08,138 INFO L93 Difference]: Finished difference Result 1497 states and 2391 transitions. [2019-11-20 05:48:08,138 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-20 05:48:08,139 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 42 [2019-11-20 05:48:08,139 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 05:48:08,143 INFO L225 Difference]: With dead ends: 1497 [2019-11-20 05:48:08,144 INFO L226 Difference]: Without dead ends: 785 [2019-11-20 05:48:08,145 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 05:48:08,146 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 785 states. [2019-11-20 05:48:08,172 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 785 to 765. [2019-11-20 05:48:08,172 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 765 states. [2019-11-20 05:48:08,175 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 765 states to 765 states and 1227 transitions. [2019-11-20 05:48:08,175 INFO L78 Accepts]: Start accepts. Automaton has 765 states and 1227 transitions. Word has length 42 [2019-11-20 05:48:08,176 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 05:48:08,176 INFO L462 AbstractCegarLoop]: Abstraction has 765 states and 1227 transitions. [2019-11-20 05:48:08,176 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-20 05:48:08,176 INFO L276 IsEmpty]: Start isEmpty. Operand 765 states and 1227 transitions. [2019-11-20 05:48:08,177 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2019-11-20 05:48:08,178 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 05:48:08,178 INFO L410 BasicCegarLoop]: trace histogram [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] [2019-11-20 05:48:08,178 INFO L410 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 05:48:08,178 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 05:48:08,178 INFO L82 PathProgramCache]: Analyzing trace with hash 477806323, now seen corresponding path program 1 times [2019-11-20 05:48:08,179 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 05:48:08,179 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1947147890] [2019-11-20 05:48:08,179 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 05:48:08,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 05:48:08,206 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 15 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 05:48:08,207 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1947147890] [2019-11-20 05:48:08,207 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 05:48:08,207 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-20 05:48:08,207 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1417163726] [2019-11-20 05:48:08,207 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-20 05:48:08,208 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 05:48:08,208 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-20 05:48:08,208 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-20 05:48:08,208 INFO L87 Difference]: Start difference. First operand 765 states and 1227 transitions. Second operand 3 states. [2019-11-20 05:48:08,233 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 05:48:08,233 INFO L93 Difference]: Finished difference Result 1522 states and 2442 transitions. [2019-11-20 05:48:08,234 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-20 05:48:08,234 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 43 [2019-11-20 05:48:08,234 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 05:48:08,239 INFO L225 Difference]: With dead ends: 1522 [2019-11-20 05:48:08,239 INFO L226 Difference]: Without dead ends: 765 [2019-11-20 05:48:08,240 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 05:48:08,241 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 765 states. [2019-11-20 05:48:08,282 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 765 to 765. [2019-11-20 05:48:08,282 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 765 states. [2019-11-20 05:48:08,285 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 765 states to 765 states and 1210 transitions. [2019-11-20 05:48:08,286 INFO L78 Accepts]: Start accepts. Automaton has 765 states and 1210 transitions. Word has length 43 [2019-11-20 05:48:08,286 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 05:48:08,286 INFO L462 AbstractCegarLoop]: Abstraction has 765 states and 1210 transitions. [2019-11-20 05:48:08,286 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-20 05:48:08,286 INFO L276 IsEmpty]: Start isEmpty. Operand 765 states and 1210 transitions. [2019-11-20 05:48:08,287 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2019-11-20 05:48:08,288 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 05:48:08,288 INFO L410 BasicCegarLoop]: trace histogram [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] [2019-11-20 05:48:08,288 INFO L410 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 05:48:08,288 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 05:48:08,288 INFO L82 PathProgramCache]: Analyzing trace with hash -701855575, now seen corresponding path program 1 times [2019-11-20 05:48:08,288 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 05:48:08,289 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [800067667] [2019-11-20 05:48:08,289 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 05:48:08,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 05:48:08,316 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 05:48:08,316 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [800067667] [2019-11-20 05:48:08,316 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 05:48:08,316 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-20 05:48:08,317 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1812187568] [2019-11-20 05:48:08,317 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-20 05:48:08,317 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 05:48:08,317 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-20 05:48:08,317 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-20 05:48:08,317 INFO L87 Difference]: Start difference. First operand 765 states and 1210 transitions. Second operand 3 states. [2019-11-20 05:48:08,354 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 05:48:08,355 INFO L93 Difference]: Finished difference Result 1536 states and 2425 transitions. [2019-11-20 05:48:08,355 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-20 05:48:08,355 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 44 [2019-11-20 05:48:08,355 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 05:48:08,360 INFO L225 Difference]: With dead ends: 1536 [2019-11-20 05:48:08,360 INFO L226 Difference]: Without dead ends: 779 [2019-11-20 05:48:08,361 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 05:48:08,362 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 779 states. [2019-11-20 05:48:08,387 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 779 to 777. [2019-11-20 05:48:08,387 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 777 states. [2019-11-20 05:48:08,391 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 777 states to 777 states and 1208 transitions. [2019-11-20 05:48:08,391 INFO L78 Accepts]: Start accepts. Automaton has 777 states and 1208 transitions. Word has length 44 [2019-11-20 05:48:08,391 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 05:48:08,391 INFO L462 AbstractCegarLoop]: Abstraction has 777 states and 1208 transitions. [2019-11-20 05:48:08,391 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-20 05:48:08,392 INFO L276 IsEmpty]: Start isEmpty. Operand 777 states and 1208 transitions. [2019-11-20 05:48:08,393 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2019-11-20 05:48:08,393 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 05:48:08,393 INFO L410 BasicCegarLoop]: trace histogram [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] [2019-11-20 05:48:08,393 INFO L410 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 05:48:08,393 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 05:48:08,394 INFO L82 PathProgramCache]: Analyzing trace with hash 616075766, now seen corresponding path program 1 times [2019-11-20 05:48:08,394 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 05:48:08,394 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1000370202] [2019-11-20 05:48:08,394 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 05:48:08,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 05:48:08,420 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 19 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 05:48:08,420 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1000370202] [2019-11-20 05:48:08,421 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 05:48:08,421 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-20 05:48:08,421 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [438312766] [2019-11-20 05:48:08,421 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-20 05:48:08,421 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 05:48:08,422 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-20 05:48:08,422 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-20 05:48:08,422 INFO L87 Difference]: Start difference. First operand 777 states and 1208 transitions. Second operand 3 states. [2019-11-20 05:48:08,471 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 05:48:08,472 INFO L93 Difference]: Finished difference Result 2298 states and 3572 transitions. [2019-11-20 05:48:08,472 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-20 05:48:08,472 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 49 [2019-11-20 05:48:08,472 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 05:48:08,481 INFO L225 Difference]: With dead ends: 2298 [2019-11-20 05:48:08,481 INFO L226 Difference]: Without dead ends: 1529 [2019-11-20 05:48:08,482 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 05:48:08,484 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1529 states. [2019-11-20 05:48:08,526 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1529 to 1217. [2019-11-20 05:48:08,526 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1217 states. [2019-11-20 05:48:08,531 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1217 states to 1217 states and 1884 transitions. [2019-11-20 05:48:08,531 INFO L78 Accepts]: Start accepts. Automaton has 1217 states and 1884 transitions. Word has length 49 [2019-11-20 05:48:08,531 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 05:48:08,531 INFO L462 AbstractCegarLoop]: Abstraction has 1217 states and 1884 transitions. [2019-11-20 05:48:08,532 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-20 05:48:08,532 INFO L276 IsEmpty]: Start isEmpty. Operand 1217 states and 1884 transitions. [2019-11-20 05:48:08,533 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2019-11-20 05:48:08,533 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 05:48:08,534 INFO L410 BasicCegarLoop]: trace histogram [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] [2019-11-20 05:48:08,534 INFO L410 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 05:48:08,534 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 05:48:08,534 INFO L82 PathProgramCache]: Analyzing trace with hash 1509562104, now seen corresponding path program 1 times [2019-11-20 05:48:08,534 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 05:48:08,535 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1391177768] [2019-11-20 05:48:08,535 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 05:48:08,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 05:48:08,557 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 19 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 05:48:08,557 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1391177768] [2019-11-20 05:48:08,558 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 05:48:08,558 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-20 05:48:08,558 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1724033628] [2019-11-20 05:48:08,558 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-20 05:48:08,558 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 05:48:08,558 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-20 05:48:08,559 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-20 05:48:08,559 INFO L87 Difference]: Start difference. First operand 1217 states and 1884 transitions. Second operand 3 states. [2019-11-20 05:48:08,760 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 05:48:08,760 INFO L93 Difference]: Finished difference Result 2638 states and 4072 transitions. [2019-11-20 05:48:08,761 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-20 05:48:08,761 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 49 [2019-11-20 05:48:08,761 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 05:48:08,769 INFO L225 Difference]: With dead ends: 2638 [2019-11-20 05:48:08,769 INFO L226 Difference]: Without dead ends: 1430 [2019-11-20 05:48:08,771 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 05:48:08,773 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1430 states. [2019-11-20 05:48:08,817 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1430 to 1324. [2019-11-20 05:48:08,817 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1324 states. [2019-11-20 05:48:08,822 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1324 states to 1324 states and 1999 transitions. [2019-11-20 05:48:08,822 INFO L78 Accepts]: Start accepts. Automaton has 1324 states and 1999 transitions. Word has length 49 [2019-11-20 05:48:08,823 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 05:48:08,823 INFO L462 AbstractCegarLoop]: Abstraction has 1324 states and 1999 transitions. [2019-11-20 05:48:08,823 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-20 05:48:08,823 INFO L276 IsEmpty]: Start isEmpty. Operand 1324 states and 1999 transitions. [2019-11-20 05:48:08,825 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-11-20 05:48:08,825 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 05:48:08,825 INFO L410 BasicCegarLoop]: trace histogram [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 05:48:08,826 INFO L410 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 05:48:08,826 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 05:48:08,826 INFO L82 PathProgramCache]: Analyzing trace with hash 531471331, now seen corresponding path program 1 times [2019-11-20 05:48:08,826 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 05:48:08,826 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [180719266] [2019-11-20 05:48:08,827 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 05:48:08,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 05:48:08,854 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2019-11-20 05:48:08,854 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [180719266] [2019-11-20 05:48:08,854 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 05:48:08,854 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-20 05:48:08,855 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1647563819] [2019-11-20 05:48:08,855 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-20 05:48:08,855 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 05:48:08,855 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-20 05:48:08,856 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-20 05:48:08,856 INFO L87 Difference]: Start difference. First operand 1324 states and 1999 transitions. Second operand 3 states. [2019-11-20 05:48:08,907 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 05:48:08,908 INFO L93 Difference]: Finished difference Result 2486 states and 3735 transitions. [2019-11-20 05:48:08,908 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-20 05:48:08,908 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 54 [2019-11-20 05:48:08,908 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 05:48:08,917 INFO L225 Difference]: With dead ends: 2486 [2019-11-20 05:48:08,917 INFO L226 Difference]: Without dead ends: 1659 [2019-11-20 05:48:08,919 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 05:48:08,921 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1659 states. [2019-11-20 05:48:08,965 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1659 to 1185. [2019-11-20 05:48:08,965 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1185 states. [2019-11-20 05:48:08,970 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1185 states to 1185 states and 1780 transitions. [2019-11-20 05:48:08,970 INFO L78 Accepts]: Start accepts. Automaton has 1185 states and 1780 transitions. Word has length 54 [2019-11-20 05:48:08,970 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 05:48:08,970 INFO L462 AbstractCegarLoop]: Abstraction has 1185 states and 1780 transitions. [2019-11-20 05:48:08,971 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-20 05:48:08,971 INFO L276 IsEmpty]: Start isEmpty. Operand 1185 states and 1780 transitions. [2019-11-20 05:48:08,973 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2019-11-20 05:48:08,973 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 05:48:08,973 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 05:48:08,973 INFO L410 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 05:48:08,974 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 05:48:08,974 INFO L82 PathProgramCache]: Analyzing trace with hash -1599732210, now seen corresponding path program 1 times [2019-11-20 05:48:08,974 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 05:48:08,974 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [981003060] [2019-11-20 05:48:08,974 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 05:48:08,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 05:48:09,010 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 17 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 05:48:09,010 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [981003060] [2019-11-20 05:48:09,010 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 05:48:09,010 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-20 05:48:09,011 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1645767876] [2019-11-20 05:48:09,011 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-20 05:48:09,011 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 05:48:09,011 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-20 05:48:09,012 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-20 05:48:09,012 INFO L87 Difference]: Start difference. First operand 1185 states and 1780 transitions. Second operand 3 states. [2019-11-20 05:48:09,089 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 05:48:09,089 INFO L93 Difference]: Finished difference Result 3421 states and 5102 transitions. [2019-11-20 05:48:09,090 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-20 05:48:09,090 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 55 [2019-11-20 05:48:09,090 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 05:48:09,102 INFO L225 Difference]: With dead ends: 3421 [2019-11-20 05:48:09,102 INFO L226 Difference]: Without dead ends: 2245 [2019-11-20 05:48:09,104 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 05:48:09,106 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2245 states. [2019-11-20 05:48:09,185 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2245 to 2243. [2019-11-20 05:48:09,185 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2243 states. [2019-11-20 05:48:09,194 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2243 states to 2243 states and 3304 transitions. [2019-11-20 05:48:09,194 INFO L78 Accepts]: Start accepts. Automaton has 2243 states and 3304 transitions. Word has length 55 [2019-11-20 05:48:09,194 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 05:48:09,194 INFO L462 AbstractCegarLoop]: Abstraction has 2243 states and 3304 transitions. [2019-11-20 05:48:09,194 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-20 05:48:09,195 INFO L276 IsEmpty]: Start isEmpty. Operand 2243 states and 3304 transitions. [2019-11-20 05:48:09,198 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2019-11-20 05:48:09,199 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 05:48:09,199 INFO L410 BasicCegarLoop]: trace histogram [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 05:48:09,199 INFO L410 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 05:48:09,199 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 05:48:09,199 INFO L82 PathProgramCache]: Analyzing trace with hash 1445576834, now seen corresponding path program 1 times [2019-11-20 05:48:09,200 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 05:48:09,200 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [12151482] [2019-11-20 05:48:09,200 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 05:48:09,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-20 05:48:09,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-20 05:48:09,249 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-20 05:48:09,249 INFO L475 BasicCegarLoop]: Counterexample might be feasible [2019-11-20 05:48:09,298 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 20.11 05:48:09 BoogieIcfgContainer [2019-11-20 05:48:09,298 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-11-20 05:48:09,299 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-11-20 05:48:09,299 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-11-20 05:48:09,299 INFO L275 PluginConnector]: Witness Printer initialized [2019-11-20 05:48:09,300 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 05:48:05" (3/4) ... [2019-11-20 05:48:09,302 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2019-11-20 05:48:09,424 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/run_dir_9ce7fe60-4a07-4e4e-b8b2-b4ec354c7618/bin/uautomizer/witness.graphml [2019-11-20 05:48:09,425 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-11-20 05:48:09,427 INFO L168 Benchmark]: Toolchain (without parser) took 5614.29 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 196.1 MB). Free memory was 950.1 MB in the beginning and 888.4 MB in the end (delta: 61.7 MB). Peak memory consumption was 257.8 MB. Max. memory is 11.5 GB. [2019-11-20 05:48:09,427 INFO L168 Benchmark]: CDTParser took 0.21 ms. Allocated memory is still 1.0 GB. Free memory is still 967.6 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-20 05:48:09,427 INFO L168 Benchmark]: CACSL2BoogieTranslator took 489.26 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 141.6 MB). Free memory was 950.1 MB in the beginning and 1.1 GB in the end (delta: -179.4 MB). Peak memory consumption was 23.4 MB. Max. memory is 11.5 GB. [2019-11-20 05:48:09,427 INFO L168 Benchmark]: Boogie Procedure Inliner took 53.06 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-20 05:48:09,429 INFO L168 Benchmark]: Boogie Preprocessor took 54.83 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: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. [2019-11-20 05:48:09,429 INFO L168 Benchmark]: RCFGBuilder took 869.44 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: 60.0 MB). Peak memory consumption was 60.0 MB. Max. memory is 11.5 GB. [2019-11-20 05:48:09,430 INFO L168 Benchmark]: TraceAbstraction took 4017.99 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 54.5 MB). Free memory was 1.1 GB in the beginning and 896.8 MB in the end (delta: 167.3 MB). Peak memory consumption was 221.8 MB. Max. memory is 11.5 GB. [2019-11-20 05:48:09,430 INFO L168 Benchmark]: Witness Printer took 125.68 ms. Allocated memory is still 1.2 GB. Free memory was 896.8 MB in the beginning and 888.4 MB in the end (delta: 8.4 MB). Peak memory consumption was 8.4 MB. Max. memory is 11.5 GB. [2019-11-20 05:48:09,432 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.21 ms. Allocated memory is still 1.0 GB. Free memory is still 967.6 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 489.26 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 141.6 MB). Free memory was 950.1 MB in the beginning and 1.1 GB in the end (delta: -179.4 MB). Peak memory consumption was 23.4 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 53.06 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * Boogie Preprocessor took 54.83 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: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. * RCFGBuilder took 869.44 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: 60.0 MB). Peak memory consumption was 60.0 MB. Max. memory is 11.5 GB. * TraceAbstraction took 4017.99 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 54.5 MB). Free memory was 1.1 GB in the beginning and 896.8 MB in the end (delta: 167.3 MB). Peak memory consumption was 221.8 MB. Max. memory is 11.5 GB. * Witness Printer took 125.68 ms. Allocated memory is still 1.2 GB. Free memory was 896.8 MB in the beginning and 888.4 MB in the end (delta: 8.4 MB). Peak memory consumption was 8.4 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 640]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L645] int s ; [L646] int tmp ; [L650] s = 8464 [L11] int s__info_callback = __VERIFIER_nondet_int() ; [L12] int s__in_handshake = __VERIFIER_nondet_int() ; [L13] int s__state ; [L14] int s__new_session ; [L15] int s__server ; [L16] int s__version = __VERIFIER_nondet_int() ; [L17] int s__type ; [L18] int s__init_num ; [L19] int s__hit = __VERIFIER_nondet_int() ; [L20] int s__rwstate ; [L21] int s__init_buf___0 = 1; [L22] int s__debug = __VERIFIER_nondet_int() ; [L23] int s__shutdown ; [L24] int s__cert = __VERIFIER_nondet_int() ; [L25] int s__options = __VERIFIER_nondet_int() ; [L26] int s__verify_mode = __VERIFIER_nondet_int() ; [L27] int s__session__peer = __VERIFIER_nondet_int() ; [L28] int s__cert__pkeys__AT0__privatekey = __VERIFIER_nondet_int() ; [L29] int s__ctx__info_callback = __VERIFIER_nondet_int() ; [L30] int s__ctx__stats__sess_accept_renegotiate = __VERIFIER_nondet_int() ; [L31] int s__ctx__stats__sess_accept = __VERIFIER_nondet_int() ; [L32] int s__ctx__stats__sess_accept_good = __VERIFIER_nondet_int() ; [L33] int s__s3__tmp__cert_request ; [L34] int s__s3__tmp__reuse_message ; [L35] int s__s3__tmp__use_rsa_tmp ; [L36] int s__s3__tmp__new_cipher = __VERIFIER_nondet_int() ; [L37] int s__s3__tmp__new_cipher__algorithms = __VERIFIER_nondet_int() ; [L38] int s__s3__tmp__next_state___0 ; [L39] int s__s3__tmp__new_cipher__algo_strength = __VERIFIER_nondet_int() ; [L40] int s__session__cipher ; [L41] int buf ; [L42] unsigned long l ; [L43] unsigned long Time ; [L44] unsigned long tmp ; [L45] int cb ; [L46] long num1 = __VERIFIER_nondet_long() ; [L47] int ret ; [L48] int new_state ; [L49] int state ; [L50] int skip ; [L51] int got_new_session ; [L52] int tmp___1 = __VERIFIER_nondet_int() ; [L53] int tmp___2 = __VERIFIER_nondet_int() ; [L54] int tmp___3 = __VERIFIER_nondet_int() ; [L55] int tmp___4 = __VERIFIER_nondet_int() ; [L56] int tmp___5 = __VERIFIER_nondet_int() ; [L57] int tmp___6 = __VERIFIER_nondet_int() ; [L58] int tmp___7 ; [L59] long tmp___8 = __VERIFIER_nondet_long() ; [L60] int tmp___9 = __VERIFIER_nondet_int() ; [L61] int tmp___10 = __VERIFIER_nondet_int() ; [L62] int blastFlag ; [L63] int __cil_tmp55 ; [L64] unsigned long __cil_tmp56 ; [L65] unsigned long __cil_tmp57 ; [L66] unsigned long __cil_tmp58 ; [L67] unsigned long __cil_tmp59 ; [L68] int __cil_tmp60 ; [L69] unsigned long __cil_tmp61 ; [L72] s__s3__tmp__reuse_message = 0 [L73] s__state = initial_state [L74] blastFlag = 0 [L75] tmp = __VERIFIER_nondet_int() [L76] Time = tmp [L77] cb = 0 [L78] ret = -1 [L79] skip = 0 [L80] got_new_session = 0 [L81] COND TRUE s__info_callback != 0 [L82] cb = s__info_callback [L88] s__in_handshake ++ [L89] COND TRUE tmp___1 + 12288 [L90] COND TRUE tmp___2 + 16384 [L94] COND FALSE !(s__cert == 0) [L98] COND TRUE 1 [L100] state = s__state [L101] COND FALSE !(s__state == 12292) [L104] COND FALSE !(s__state == 16384) [L107] COND FALSE !(s__state == 8192) [L110] COND FALSE !(s__state == 24576) [L113] COND FALSE !(s__state == 8195) [L116] COND FALSE !(s__state == 8480) [L119] COND FALSE !(s__state == 8481) [L122] COND FALSE !(s__state == 8482) [L125] COND TRUE s__state == 8464 [L271] s__shutdown = 0 [L272] ret = __VERIFIER_nondet_int() [L273] COND TRUE blastFlag == 0 [L274] blastFlag = 1 [L276] COND FALSE !(ret <= 0) [L279] got_new_session = 1 [L280] s__state = 8496 [L281] s__init_num = 0 [L602] COND TRUE ! s__s3__tmp__reuse_message [L603] COND TRUE ! skip [L604] COND TRUE tmp___1 != -12288 [L605] COND TRUE s__state != 8656 [L606] COND TRUE tmp___2 != -16384 [L607] COND FALSE !(state == 8496) [L614] COND FALSE !(\read(s__debug)) [L620] COND TRUE cb != 0 [L621] COND TRUE s__state != state [L622] new_state = s__state [L623] s__state = state [L624] s__state = new_state [L629] skip = 0 [L98] COND TRUE 1 [L100] state = s__state [L101] COND FALSE !(s__state == 12292) [L104] COND FALSE !(s__state == 16384) [L107] COND FALSE !(s__state == 8192) [L110] COND FALSE !(s__state == 24576) [L113] COND FALSE !(s__state == 8195) [L116] COND FALSE !(s__state == 8480) [L119] COND FALSE !(s__state == 8481) [L122] COND FALSE !(s__state == 8482) [L125] COND FALSE !(s__state == 8464) [L128] COND FALSE !(s__state == 8465) [L131] COND FALSE !(s__state == 8466) [L134] COND TRUE s__state == 8496 [L285] ret = __VERIFIER_nondet_int() [L286] COND TRUE blastFlag == 1 [L287] blastFlag = 2 [L289] COND FALSE !(ret <= 0) [L292] COND FALSE !(\read(s__hit)) [L295] s__state = 8512 [L297] s__init_num = 0 [L602] COND TRUE ! s__s3__tmp__reuse_message [L603] COND TRUE ! skip [L604] COND TRUE tmp___1 != -12288 [L605] COND TRUE s__state != 8656 [L606] COND TRUE tmp___2 != -16384 [L607] COND TRUE state == 8496 [L640] __VERIFIER_error() - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 150 locations, 1 error locations. Result: UNSAFE, OverallTime: 3.9s, OverallIterations: 18, TraceHistogramMax: 2, AutomataDifference: 2.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 3434 SDtfs, 3298 SDslu, 1317 SDs, 0 SdLazy, 1077 SolverSat, 427 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 1.3s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 41 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=2243occurred in iteration=17, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.5s AutomataMinimizationTime, 17 MinimizatonAttempts, 1140 StatesRemovedByMinimization, 16 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.4s InterpolantComputationTime, 652 NumberOfCodeBlocks, 652 NumberOfCodeBlocksAsserted, 18 NumberOfCheckSat, 579 ConstructedInterpolants, 0 QuantifiedInterpolants, 70785 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 17 InterpolantComputations, 17 PerfectInterpolantSequences, 102/102 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! Received shutdown request...