./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/psyco/psyco_net_1.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_d42c7e2a-b988-4dde-b80d-33c6a89a15c9/bin/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/run_dir_d42c7e2a-b988-4dde-b80d-33c6a89a15c9/bin/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_d42c7e2a-b988-4dde-b80d-33c6a89a15c9/bin/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_d42c7e2a-b988-4dde-b80d-33c6a89a15c9/bin/uautomizer/config/AutomizerReach.xml -i ../../sv-benchmarks/c/psyco/psyco_net_1.c -s /tmp/vcloud-vcloud-master/worker/run_dir_d42c7e2a-b988-4dde-b80d-33c6a89a15c9/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_d42c7e2a-b988-4dde-b80d-33c6a89a15c9/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 7e30af526e16c58deb50a12d2f5da235c49261ec ........................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... 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:36:50,990 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-20 05:36:50,992 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-20 05:36:51,006 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-20 05:36:51,007 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-20 05:36:51,008 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-20 05:36:51,010 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-20 05:36:51,018 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-20 05:36:51,023 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-20 05:36:51,027 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-20 05:36:51,028 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-20 05:36:51,029 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-20 05:36:51,030 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-20 05:36:51,032 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-20 05:36:51,033 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-20 05:36:51,034 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-20 05:36:51,035 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-20 05:36:51,035 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-20 05:36:51,038 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-20 05:36:51,041 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-20 05:36:51,045 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-20 05:36:51,047 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-20 05:36:51,050 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-20 05:36:51,051 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-20 05:36:51,054 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-20 05:36:51,054 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-20 05:36:51,054 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-20 05:36:51,056 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-20 05:36:51,056 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-20 05:36:51,057 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-20 05:36:51,057 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-20 05:36:51,058 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-20 05:36:51,058 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-20 05:36:51,059 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-20 05:36:51,060 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-20 05:36:51,061 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-20 05:36:51,061 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-20 05:36:51,061 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-20 05:36:51,062 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-20 05:36:51,062 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-20 05:36:51,063 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-20 05:36:51,064 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_d42c7e2a-b988-4dde-b80d-33c6a89a15c9/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf [2019-11-20 05:36:51,088 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-20 05:36:51,097 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-20 05:36:51,098 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-20 05:36:51,098 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-20 05:36:51,099 INFO L138 SettingsManager]: * Use SBE=true [2019-11-20 05:36:51,099 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-20 05:36:51,099 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-20 05:36:51,099 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-20 05:36:51,099 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-20 05:36:51,100 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-20 05:36:51,100 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-11-20 05:36:51,100 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-20 05:36:51,100 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-11-20 05:36:51,101 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-20 05:36:51,102 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-20 05:36:51,102 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-20 05:36:51,102 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-11-20 05:36:51,102 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-20 05:36:51,103 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-20 05:36:51,103 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-20 05:36:51,103 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-20 05:36:51,103 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-20 05:36:51,103 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-20 05:36:51,104 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-20 05:36:51,104 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-11-20 05:36:51,104 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-11-20 05:36:51,105 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-11-20 05:36:51,105 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-11-20 05:36:51,105 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_d42c7e2a-b988-4dde-b80d-33c6a89a15c9/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 -> 7e30af526e16c58deb50a12d2f5da235c49261ec [2019-11-20 05:36:51,277 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-20 05:36:51,294 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-20 05:36:51,297 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-20 05:36:51,298 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-20 05:36:51,298 INFO L275 PluginConnector]: CDTParser initialized [2019-11-20 05:36:51,299 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_d42c7e2a-b988-4dde-b80d-33c6a89a15c9/bin/uautomizer/../../sv-benchmarks/c/psyco/psyco_net_1.c [2019-11-20 05:36:51,349 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_d42c7e2a-b988-4dde-b80d-33c6a89a15c9/bin/uautomizer/data/68f184d5a/8cdfedd37a8947e6bbfcffef5d8dbc02/FLAG42d9b2ccd [2019-11-20 05:36:52,333 INFO L306 CDTParser]: Found 1 translation units. [2019-11-20 05:36:52,333 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_d42c7e2a-b988-4dde-b80d-33c6a89a15c9/sv-benchmarks/c/psyco/psyco_net_1.c [2019-11-20 05:36:52,424 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_d42c7e2a-b988-4dde-b80d-33c6a89a15c9/bin/uautomizer/data/68f184d5a/8cdfedd37a8947e6bbfcffef5d8dbc02/FLAG42d9b2ccd [2019-11-20 05:36:52,819 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_d42c7e2a-b988-4dde-b80d-33c6a89a15c9/bin/uautomizer/data/68f184d5a/8cdfedd37a8947e6bbfcffef5d8dbc02 [2019-11-20 05:36:52,821 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-20 05:36:52,822 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-11-20 05:36:52,823 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-20 05:36:52,823 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-20 05:36:52,827 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-20 05:36:52,828 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.11 05:36:52" (1/1) ... [2019-11-20 05:36:52,830 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5583bf7f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 05:36:52, skipping insertion in model container [2019-11-20 05:36:52,830 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.11 05:36:52" (1/1) ... [2019-11-20 05:36:52,837 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-11-20 05:36:53,427 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-11-20 05:36:55,174 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-20 05:36:55,183 INFO L188 MainTranslator]: Completed pre-run [2019-11-20 05:36:56,304 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-20 05:36:56,320 INFO L192 MainTranslator]: Completed translation [2019-11-20 05:36:56,321 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 05:36:56 WrapperNode [2019-11-20 05:36:56,321 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-20 05:36:56,322 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-11-20 05:36:56,322 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-11-20 05:36:56,323 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-11-20 05:36:56,330 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:36:56" (1/1) ... [2019-11-20 05:36:56,457 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:36:56" (1/1) ... [2019-11-20 05:36:56,912 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-11-20 05:36:56,913 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-20 05:36:56,914 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-20 05:36:56,914 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-20 05:36:56,923 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 05:36:56" (1/1) ... [2019-11-20 05:36:56,923 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 05:36:56" (1/1) ... [2019-11-20 05:36:57,004 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 05:36:56" (1/1) ... [2019-11-20 05:36:57,004 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 05:36:56" (1/1) ... [2019-11-20 05:36:57,309 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 05:36:56" (1/1) ... [2019-11-20 05:36:57,450 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 05:36:56" (1/1) ... [2019-11-20 05:36:57,544 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 05:36:56" (1/1) ... [2019-11-20 05:36:58,121 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-20 05:36:58,121 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-20 05:36:58,121 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-20 05:36:58,122 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-20 05:36:58,122 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 05:36:56" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_d42c7e2a-b988-4dde-b80d-33c6a89a15c9/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:36:58,177 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-20 05:36:58,178 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-20 05:37:15,899 INFO L280 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-20 05:37:15,899 INFO L285 CfgBuilder]: Removed 1134 assume(true) statements. [2019-11-20 05:37:15,904 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 05:37:15 BoogieIcfgContainer [2019-11-20 05:37:15,904 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-20 05:37:15,905 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-20 05:37:15,905 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-20 05:37:15,907 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-20 05:37:15,907 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.11 05:36:52" (1/3) ... [2019-11-20 05:37:15,908 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@e4e2708 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.11 05:37:15, skipping insertion in model container [2019-11-20 05:37:15,908 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 05:36:56" (2/3) ... [2019-11-20 05:37:15,909 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@e4e2708 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.11 05:37:15, skipping insertion in model container [2019-11-20 05:37:15,909 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 05:37:15" (3/3) ... [2019-11-20 05:37:15,910 INFO L109 eAbstractionObserver]: Analyzing ICFG psyco_net_1.c [2019-11-20 05:37:15,917 INFO L153 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-20 05:37:15,930 INFO L165 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-11-20 05:37:15,937 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-11-20 05:37:15,992 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-20 05:37:15,993 INFO L374 AbstractCegarLoop]: Hoare is true [2019-11-20 05:37:15,993 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-20 05:37:15,993 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-20 05:37:15,993 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-20 05:37:15,993 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-20 05:37:15,994 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-20 05:37:15,994 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-20 05:37:16,102 INFO L276 IsEmpty]: Start isEmpty. Operand 9211 states. [2019-11-20 05:37:16,107 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2019-11-20 05:37:16,108 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 05:37:16,108 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 05:37:16,109 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 05:37:16,114 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 05:37:16,114 INFO L82 PathProgramCache]: Analyzing trace with hash 352619045, now seen corresponding path program 1 times [2019-11-20 05:37:16,123 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 05:37:16,123 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [40267958] [2019-11-20 05:37:16,123 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 05:37:16,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 05:37:16,332 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:37:16,333 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [40267958] [2019-11-20 05:37:16,333 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 05:37:16,334 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-20 05:37:16,335 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [983130739] [2019-11-20 05:37:16,339 INFO L442 AbstractCegarLoop]: Interpolant automaton has 2 states [2019-11-20 05:37:16,339 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 05:37:16,351 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2019-11-20 05:37:16,352 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-11-20 05:37:16,354 INFO L87 Difference]: Start difference. First operand 9211 states. Second operand 2 states. [2019-11-20 05:37:16,611 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 05:37:16,611 INFO L93 Difference]: Finished difference Result 17698 states and 35380 transitions. [2019-11-20 05:37:16,611 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2019-11-20 05:37:16,613 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 9 [2019-11-20 05:37:16,613 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 05:37:16,674 INFO L225 Difference]: With dead ends: 17698 [2019-11-20 05:37:16,674 INFO L226 Difference]: Without dead ends: 8280 [2019-11-20 05:37:16,692 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-11-20 05:37:16,729 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8280 states. [2019-11-20 05:37:16,888 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8280 to 8280. [2019-11-20 05:37:16,889 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8280 states. [2019-11-20 05:37:16,921 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8280 states to 8280 states and 12997 transitions. [2019-11-20 05:37:16,923 INFO L78 Accepts]: Start accepts. Automaton has 8280 states and 12997 transitions. Word has length 9 [2019-11-20 05:37:16,923 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 05:37:16,923 INFO L462 AbstractCegarLoop]: Abstraction has 8280 states and 12997 transitions. [2019-11-20 05:37:16,924 INFO L463 AbstractCegarLoop]: Interpolant automaton has 2 states. [2019-11-20 05:37:16,924 INFO L276 IsEmpty]: Start isEmpty. Operand 8280 states and 12997 transitions. [2019-11-20 05:37:16,924 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2019-11-20 05:37:16,925 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 05:37:16,925 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 05:37:16,925 INFO L410 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 05:37:16,925 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 05:37:16,926 INFO L82 PathProgramCache]: Analyzing trace with hash -1422650027, now seen corresponding path program 1 times [2019-11-20 05:37:16,926 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 05:37:16,926 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1204721255] [2019-11-20 05:37:16,926 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 05:37:16,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 05:37:17,029 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:37:17,029 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1204721255] [2019-11-20 05:37:17,030 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 05:37:17,030 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-20 05:37:17,030 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1466264516] [2019-11-20 05:37:17,031 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-20 05:37:17,031 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 05:37:17,032 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-20 05:37:17,032 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-20 05:37:17,032 INFO L87 Difference]: Start difference. First operand 8280 states and 12997 transitions. Second operand 3 states. [2019-11-20 05:37:19,642 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 05:37:19,642 INFO L93 Difference]: Finished difference Result 16561 states and 25996 transitions. [2019-11-20 05:37:19,643 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-20 05:37:19,643 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 10 [2019-11-20 05:37:19,643 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 05:37:19,691 INFO L225 Difference]: With dead ends: 16561 [2019-11-20 05:37:19,691 INFO L226 Difference]: Without dead ends: 8283 [2019-11-20 05:37:19,703 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:37:19,725 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8283 states. [2019-11-20 05:37:19,864 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8283 to 8283. [2019-11-20 05:37:19,865 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8283 states. [2019-11-20 05:37:19,897 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8283 states to 8283 states and 13000 transitions. [2019-11-20 05:37:19,897 INFO L78 Accepts]: Start accepts. Automaton has 8283 states and 13000 transitions. Word has length 10 [2019-11-20 05:37:19,897 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 05:37:19,897 INFO L462 AbstractCegarLoop]: Abstraction has 8283 states and 13000 transitions. [2019-11-20 05:37:19,898 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-20 05:37:19,898 INFO L276 IsEmpty]: Start isEmpty. Operand 8283 states and 13000 transitions. [2019-11-20 05:37:19,899 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-11-20 05:37:19,899 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 05:37:19,899 INFO L410 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 05:37:19,899 INFO L410 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 05:37:19,899 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 05:37:19,900 INFO L82 PathProgramCache]: Analyzing trace with hash 658080264, now seen corresponding path program 1 times [2019-11-20 05:37:19,900 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 05:37:19,900 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [590737894] [2019-11-20 05:37:19,900 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 05:37:19,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 05:37:20,052 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 05:37:20,052 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [590737894] [2019-11-20 05:37:20,052 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 05:37:20,052 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-20 05:37:20,052 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [809853494] [2019-11-20 05:37:20,053 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-20 05:37:20,053 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 05:37:20,053 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-20 05:37:20,053 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-20 05:37:20,053 INFO L87 Difference]: Start difference. First operand 8283 states and 13000 transitions. Second operand 3 states. [2019-11-20 05:37:21,957 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 05:37:21,957 INFO L93 Difference]: Finished difference Result 16456 states and 25845 transitions. [2019-11-20 05:37:21,957 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-20 05:37:21,957 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 15 [2019-11-20 05:37:21,958 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 05:37:22,017 INFO L225 Difference]: With dead ends: 16456 [2019-11-20 05:37:22,019 INFO L226 Difference]: Without dead ends: 8176 [2019-11-20 05:37:22,031 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:37:22,052 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8176 states. [2019-11-20 05:37:22,192 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8176 to 8176. [2019-11-20 05:37:22,192 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8176 states. [2019-11-20 05:37:22,205 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8176 states to 8176 states and 12846 transitions. [2019-11-20 05:37:22,206 INFO L78 Accepts]: Start accepts. Automaton has 8176 states and 12846 transitions. Word has length 15 [2019-11-20 05:37:22,206 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 05:37:22,207 INFO L462 AbstractCegarLoop]: Abstraction has 8176 states and 12846 transitions. [2019-11-20 05:37:22,207 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-20 05:37:22,207 INFO L276 IsEmpty]: Start isEmpty. Operand 8176 states and 12846 transitions. [2019-11-20 05:37:22,216 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-11-20 05:37:22,216 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 05:37:22,217 INFO L410 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 05:37:22,217 INFO L410 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 05:37:22,217 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 05:37:22,217 INFO L82 PathProgramCache]: Analyzing trace with hash 505082677, now seen corresponding path program 1 times [2019-11-20 05:37:22,218 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 05:37:22,218 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [810348803] [2019-11-20 05:37:22,218 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 05:37:22,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 05:37:22,318 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 05:37:22,318 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [810348803] [2019-11-20 05:37:22,319 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 05:37:22,319 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-20 05:37:22,319 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1861882616] [2019-11-20 05:37:22,319 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-20 05:37:22,319 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 05:37:22,320 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-20 05:37:22,320 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-20 05:37:22,320 INFO L87 Difference]: Start difference. First operand 8176 states and 12846 transitions. Second operand 3 states. [2019-11-20 05:37:26,425 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 05:37:26,425 INFO L93 Difference]: Finished difference Result 16264 states and 25563 transitions. [2019-11-20 05:37:26,425 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-20 05:37:26,425 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 19 [2019-11-20 05:37:26,426 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 05:37:26,442 INFO L225 Difference]: With dead ends: 16264 [2019-11-20 05:37:26,442 INFO L226 Difference]: Without dead ends: 8056 [2019-11-20 05:37:26,452 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:37:26,468 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8056 states. [2019-11-20 05:37:26,581 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8056 to 8056. [2019-11-20 05:37:26,582 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8056 states. [2019-11-20 05:37:26,593 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8056 states to 8056 states and 12226 transitions. [2019-11-20 05:37:26,594 INFO L78 Accepts]: Start accepts. Automaton has 8056 states and 12226 transitions. Word has length 19 [2019-11-20 05:37:26,594 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 05:37:26,594 INFO L462 AbstractCegarLoop]: Abstraction has 8056 states and 12226 transitions. [2019-11-20 05:37:26,594 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-20 05:37:26,594 INFO L276 IsEmpty]: Start isEmpty. Operand 8056 states and 12226 transitions. [2019-11-20 05:37:26,596 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-11-20 05:37:26,596 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 05:37:26,596 INFO L410 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 05:37:26,597 INFO L410 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 05:37:26,597 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 05:37:26,597 INFO L82 PathProgramCache]: Analyzing trace with hash -945434933, now seen corresponding path program 1 times [2019-11-20 05:37:26,597 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 05:37:26,598 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [9265654] [2019-11-20 05:37:26,598 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 05:37:26,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 05:37:26,662 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 05:37:26,662 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [9265654] [2019-11-20 05:37:26,663 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 05:37:26,663 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-20 05:37:26,663 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1196512396] [2019-11-20 05:37:26,663 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-20 05:37:26,663 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 05:37:26,664 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-20 05:37:26,664 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-20 05:37:26,664 INFO L87 Difference]: Start difference. First operand 8056 states and 12226 transitions. Second operand 3 states. [2019-11-20 05:37:28,275 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 05:37:28,275 INFO L93 Difference]: Finished difference Result 16110 states and 24449 transitions. [2019-11-20 05:37:28,275 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-20 05:37:28,276 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 22 [2019-11-20 05:37:28,276 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 05:37:28,295 INFO L225 Difference]: With dead ends: 16110 [2019-11-20 05:37:28,295 INFO L226 Difference]: Without dead ends: 8062 [2019-11-20 05:37:28,305 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:37:28,319 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8062 states. [2019-11-20 05:37:28,414 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8062 to 8060. [2019-11-20 05:37:28,414 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8060 states. [2019-11-20 05:37:28,425 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8060 states to 8060 states and 12230 transitions. [2019-11-20 05:37:28,426 INFO L78 Accepts]: Start accepts. Automaton has 8060 states and 12230 transitions. Word has length 22 [2019-11-20 05:37:28,426 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 05:37:28,426 INFO L462 AbstractCegarLoop]: Abstraction has 8060 states and 12230 transitions. [2019-11-20 05:37:28,426 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-20 05:37:28,426 INFO L276 IsEmpty]: Start isEmpty. Operand 8060 states and 12230 transitions. [2019-11-20 05:37:28,427 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2019-11-20 05:37:28,427 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 05:37:28,428 INFO L410 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 05:37:28,432 INFO L410 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 05:37:28,432 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 05:37:28,433 INFO L82 PathProgramCache]: Analyzing trace with hash -1597993323, now seen corresponding path program 1 times [2019-11-20 05:37:28,433 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 05:37:28,433 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [412961139] [2019-11-20 05:37:28,433 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 05:37:28,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 05:37:28,518 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 05:37:28,519 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [412961139] [2019-11-20 05:37:28,519 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 05:37:28,519 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-20 05:37:28,519 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [384686697] [2019-11-20 05:37:28,519 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-20 05:37:28,520 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 05:37:28,520 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-20 05:37:28,520 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-20 05:37:28,520 INFO L87 Difference]: Start difference. First operand 8060 states and 12230 transitions. Second operand 3 states. [2019-11-20 05:37:32,194 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 05:37:32,194 INFO L93 Difference]: Finished difference Result 24164 states and 36672 transitions. [2019-11-20 05:37:32,197 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-20 05:37:32,197 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 23 [2019-11-20 05:37:32,197 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 05:37:32,234 INFO L225 Difference]: With dead ends: 24164 [2019-11-20 05:37:32,235 INFO L226 Difference]: Without dead ends: 16064 [2019-11-20 05:37:32,247 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:37:32,270 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16064 states. [2019-11-20 05:37:32,555 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16064 to 14806. [2019-11-20 05:37:32,555 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14806 states. [2019-11-20 05:37:32,575 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14806 states to 14806 states and 23042 transitions. [2019-11-20 05:37:32,576 INFO L78 Accepts]: Start accepts. Automaton has 14806 states and 23042 transitions. Word has length 23 [2019-11-20 05:37:32,576 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 05:37:32,576 INFO L462 AbstractCegarLoop]: Abstraction has 14806 states and 23042 transitions. [2019-11-20 05:37:32,576 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-20 05:37:32,576 INFO L276 IsEmpty]: Start isEmpty. Operand 14806 states and 23042 transitions. [2019-11-20 05:37:32,577 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-11-20 05:37:32,577 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 05:37:32,578 INFO L410 BasicCegarLoop]: trace histogram [2, 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:37:32,578 INFO L410 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 05:37:32,578 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 05:37:32,583 INFO L82 PathProgramCache]: Analyzing trace with hash -2046252058, now seen corresponding path program 1 times [2019-11-20 05:37:32,583 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 05:37:32,583 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1112539210] [2019-11-20 05:37:32,583 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 05:37:32,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 05:37:32,655 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 05:37:32,656 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1112539210] [2019-11-20 05:37:32,656 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 05:37:32,656 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-20 05:37:32,656 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1523561173] [2019-11-20 05:37:32,657 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-20 05:37:32,657 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 05:37:32,657 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-20 05:37:32,657 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-20 05:37:32,657 INFO L87 Difference]: Start difference. First operand 14806 states and 23042 transitions. Second operand 3 states. [2019-11-20 05:37:37,834 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 05:37:37,834 INFO L93 Difference]: Finished difference Result 37336 states and 57904 transitions. [2019-11-20 05:37:37,835 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-20 05:37:37,835 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 25 [2019-11-20 05:37:37,835 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 05:37:37,879 INFO L225 Difference]: With dead ends: 37336 [2019-11-20 05:37:37,879 INFO L226 Difference]: Without dead ends: 22266 [2019-11-20 05:37:37,898 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:37:37,928 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22266 states. [2019-11-20 05:37:38,158 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22266 to 21072. [2019-11-20 05:37:38,158 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21072 states. [2019-11-20 05:37:38,186 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21072 states to 21072 states and 32684 transitions. [2019-11-20 05:37:38,186 INFO L78 Accepts]: Start accepts. Automaton has 21072 states and 32684 transitions. Word has length 25 [2019-11-20 05:37:38,187 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 05:37:38,187 INFO L462 AbstractCegarLoop]: Abstraction has 21072 states and 32684 transitions. [2019-11-20 05:37:38,187 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-20 05:37:38,187 INFO L276 IsEmpty]: Start isEmpty. Operand 21072 states and 32684 transitions. [2019-11-20 05:37:38,188 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2019-11-20 05:37:38,188 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 05:37:38,188 INFO L410 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 05:37:38,188 INFO L410 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 05:37:38,189 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 05:37:38,189 INFO L82 PathProgramCache]: Analyzing trace with hash -1701022621, now seen corresponding path program 1 times [2019-11-20 05:37:38,189 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 05:37:38,190 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1400644607] [2019-11-20 05:37:38,190 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 05:37:38,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 05:37:38,270 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 05:37:38,270 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1400644607] [2019-11-20 05:37:38,271 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 05:37:38,271 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-20 05:37:38,271 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1093400220] [2019-11-20 05:37:38,271 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-20 05:37:38,271 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 05:37:38,271 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-20 05:37:38,272 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-20 05:37:38,272 INFO L87 Difference]: Start difference. First operand 21072 states and 32684 transitions. Second operand 3 states. [2019-11-20 05:37:43,984 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 05:37:43,984 INFO L93 Difference]: Finished difference Result 63170 states and 97974 transitions. [2019-11-20 05:37:43,985 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-20 05:37:43,985 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 30 [2019-11-20 05:37:43,985 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 05:37:44,082 INFO L225 Difference]: With dead ends: 63170 [2019-11-20 05:37:44,082 INFO L226 Difference]: Without dead ends: 42106 [2019-11-20 05:37:44,103 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:37:44,154 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42106 states. [2019-11-20 05:37:44,587 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42106 to 40080. [2019-11-20 05:37:44,587 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40080 states. [2019-11-20 05:37:44,646 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40080 states to 40080 states and 63058 transitions. [2019-11-20 05:37:44,646 INFO L78 Accepts]: Start accepts. Automaton has 40080 states and 63058 transitions. Word has length 30 [2019-11-20 05:37:44,648 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 05:37:44,648 INFO L462 AbstractCegarLoop]: Abstraction has 40080 states and 63058 transitions. [2019-11-20 05:37:44,648 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-20 05:37:44,648 INFO L276 IsEmpty]: Start isEmpty. Operand 40080 states and 63058 transitions. [2019-11-20 05:37:44,651 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2019-11-20 05:37:44,652 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 05:37:44,652 INFO L410 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 05:37:44,652 INFO L410 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 05:37:44,652 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 05:37:44,652 INFO L82 PathProgramCache]: Analyzing trace with hash -421428809, now seen corresponding path program 1 times [2019-11-20 05:37:44,653 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 05:37:44,653 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [227062907] [2019-11-20 05:37:44,653 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 05:37:44,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 05:37:44,760 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 05:37:44,760 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [227062907] [2019-11-20 05:37:44,760 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 05:37:44,760 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-20 05:37:44,760 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [675419488] [2019-11-20 05:37:44,761 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-20 05:37:44,761 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 05:37:44,761 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-20 05:37:44,761 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-20 05:37:44,761 INFO L87 Difference]: Start difference. First operand 40080 states and 63058 transitions. Second operand 3 states. [2019-11-20 05:37:48,052 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 05:37:48,052 INFO L93 Difference]: Finished difference Result 107942 states and 170044 transitions. [2019-11-20 05:37:48,052 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-20 05:37:48,052 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 39 [2019-11-20 05:37:48,053 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 05:37:48,143 INFO L225 Difference]: With dead ends: 107942 [2019-11-20 05:37:48,143 INFO L226 Difference]: Without dead ends: 67822 [2019-11-20 05:37:48,187 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:37:48,276 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67822 states. [2019-11-20 05:37:49,137 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67822 to 66148. [2019-11-20 05:37:49,137 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 66148 states. [2019-11-20 05:37:49,236 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66148 states to 66148 states and 104778 transitions. [2019-11-20 05:37:49,237 INFO L78 Accepts]: Start accepts. Automaton has 66148 states and 104778 transitions. Word has length 39 [2019-11-20 05:37:49,237 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 05:37:49,237 INFO L462 AbstractCegarLoop]: Abstraction has 66148 states and 104778 transitions. [2019-11-20 05:37:49,237 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-20 05:37:49,238 INFO L276 IsEmpty]: Start isEmpty. Operand 66148 states and 104778 transitions. [2019-11-20 05:37:49,238 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2019-11-20 05:37:49,238 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 05:37:49,239 INFO L410 BasicCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 05:37:49,239 INFO L410 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 05:37:49,239 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 05:37:49,239 INFO L82 PathProgramCache]: Analyzing trace with hash -1116669619, now seen corresponding path program 1 times [2019-11-20 05:37:49,240 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 05:37:49,240 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [42686195] [2019-11-20 05:37:49,240 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 05:37:49,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 05:37:49,304 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-11-20 05:37:49,304 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [42686195] [2019-11-20 05:37:49,305 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 05:37:49,305 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-20 05:37:49,305 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1109729130] [2019-11-20 05:37:49,305 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-20 05:37:49,305 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 05:37:49,306 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-20 05:37:49,306 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-20 05:37:49,306 INFO L87 Difference]: Start difference. First operand 66148 states and 104778 transitions. Second operand 3 states. [2019-11-20 05:37:50,892 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 05:37:50,892 INFO L93 Difference]: Finished difference Result 132340 states and 209618 transitions. [2019-11-20 05:37:50,894 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-20 05:37:50,894 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 43 [2019-11-20 05:37:50,895 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 05:37:50,966 INFO L225 Difference]: With dead ends: 132340 [2019-11-20 05:37:50,966 INFO L226 Difference]: Without dead ends: 66200 [2019-11-20 05:37:51,002 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:37:51,052 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66200 states. [2019-11-20 05:37:51,525 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66200 to 66198. [2019-11-20 05:37:51,525 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 66198 states. [2019-11-20 05:37:51,597 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66198 states to 66198 states and 104828 transitions. [2019-11-20 05:37:51,597 INFO L78 Accepts]: Start accepts. Automaton has 66198 states and 104828 transitions. Word has length 43 [2019-11-20 05:37:51,597 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 05:37:51,597 INFO L462 AbstractCegarLoop]: Abstraction has 66198 states and 104828 transitions. [2019-11-20 05:37:51,597 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-20 05:37:51,597 INFO L276 IsEmpty]: Start isEmpty. Operand 66198 states and 104828 transitions. [2019-11-20 05:37:51,598 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2019-11-20 05:37:51,598 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 05:37:51,598 INFO L410 BasicCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 05:37:51,598 INFO L410 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 05:37:51,599 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 05:37:51,599 INFO L82 PathProgramCache]: Analyzing trace with hash 1299656225, now seen corresponding path program 1 times [2019-11-20 05:37:51,599 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 05:37:51,599 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2123535182] [2019-11-20 05:37:51,599 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 05:37:51,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 05:37:51,732 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 05:37:51,732 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2123535182] [2019-11-20 05:37:51,733 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 05:37:51,733 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-20 05:37:51,733 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [625168046] [2019-11-20 05:37:51,733 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-20 05:37:51,734 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 05:37:51,734 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-20 05:37:51,734 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-20 05:37:51,734 INFO L87 Difference]: Start difference. First operand 66198 states and 104828 transitions. Second operand 4 states. [2019-11-20 05:37:57,881 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 05:37:57,881 INFO L93 Difference]: Finished difference Result 126785 states and 200685 transitions. [2019-11-20 05:37:57,881 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-20 05:37:57,881 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 52 [2019-11-20 05:37:57,882 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 05:37:57,966 INFO L225 Difference]: With dead ends: 126785 [2019-11-20 05:37:57,967 INFO L226 Difference]: Without dead ends: 66492 [2019-11-20 05:37:57,998 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-20 05:37:58,054 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66492 states. [2019-11-20 05:38:02,820 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66492 to 63918. [2019-11-20 05:38:02,820 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 63918 states. [2019-11-20 05:38:02,898 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63918 states to 63918 states and 99848 transitions. [2019-11-20 05:38:02,898 INFO L78 Accepts]: Start accepts. Automaton has 63918 states and 99848 transitions. Word has length 52 [2019-11-20 05:38:02,898 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 05:38:02,898 INFO L462 AbstractCegarLoop]: Abstraction has 63918 states and 99848 transitions. [2019-11-20 05:38:02,898 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-20 05:38:02,898 INFO L276 IsEmpty]: Start isEmpty. Operand 63918 states and 99848 transitions. [2019-11-20 05:38:02,899 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2019-11-20 05:38:02,899 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 05:38:02,900 INFO L410 BasicCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 05:38:02,900 INFO L410 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 05:38:02,900 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 05:38:02,900 INFO L82 PathProgramCache]: Analyzing trace with hash 1610447069, now seen corresponding path program 1 times [2019-11-20 05:38:02,900 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 05:38:02,901 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [709646987] [2019-11-20 05:38:02,901 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 05:38:02,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 05:38:02,977 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-11-20 05:38:02,977 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [709646987] [2019-11-20 05:38:02,978 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 05:38:02,978 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-20 05:38:02,978 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1754865219] [2019-11-20 05:38:02,978 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-20 05:38:02,978 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 05:38:02,978 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-20 05:38:02,978 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-20 05:38:02,978 INFO L87 Difference]: Start difference. First operand 63918 states and 99848 transitions. Second operand 3 states. [2019-11-20 05:38:04,395 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 05:38:04,396 INFO L93 Difference]: Finished difference Result 127890 states and 199778 transitions. [2019-11-20 05:38:04,396 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-20 05:38:04,396 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 53 [2019-11-20 05:38:04,396 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 05:38:04,470 INFO L225 Difference]: With dead ends: 127890 [2019-11-20 05:38:04,470 INFO L226 Difference]: Without dead ends: 63980 [2019-11-20 05:38:04,501 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:38:04,553 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63980 states. [2019-11-20 05:38:05,030 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63980 to 63978. [2019-11-20 05:38:05,030 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 63978 states. [2019-11-20 05:38:05,109 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63978 states to 63978 states and 99908 transitions. [2019-11-20 05:38:05,109 INFO L78 Accepts]: Start accepts. Automaton has 63978 states and 99908 transitions. Word has length 53 [2019-11-20 05:38:05,109 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 05:38:05,110 INFO L462 AbstractCegarLoop]: Abstraction has 63978 states and 99908 transitions. [2019-11-20 05:38:05,110 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-20 05:38:05,110 INFO L276 IsEmpty]: Start isEmpty. Operand 63978 states and 99908 transitions. [2019-11-20 05:38:05,111 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2019-11-20 05:38:05,111 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 05:38:05,111 INFO L410 BasicCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 05:38:05,111 INFO L410 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 05:38:05,111 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 05:38:05,112 INFO L82 PathProgramCache]: Analyzing trace with hash -2089054241, now seen corresponding path program 1 times [2019-11-20 05:38:05,112 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 05:38:05,112 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1382632045] [2019-11-20 05:38:05,112 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 05:38:05,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 05:38:05,191 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-11-20 05:38:05,192 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1382632045] [2019-11-20 05:38:05,192 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 05:38:05,192 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-20 05:38:05,192 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1146416198] [2019-11-20 05:38:05,193 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-20 05:38:05,193 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 05:38:05,193 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-20 05:38:05,193 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-20 05:38:05,193 INFO L87 Difference]: Start difference. First operand 63978 states and 99908 transitions. Second operand 4 states. [2019-11-20 05:38:09,524 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 05:38:09,525 INFO L93 Difference]: Finished difference Result 116798 states and 181838 transitions. [2019-11-20 05:38:09,525 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-20 05:38:09,525 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 58 [2019-11-20 05:38:09,525 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 05:38:09,601 INFO L225 Difference]: With dead ends: 116798 [2019-11-20 05:38:09,601 INFO L226 Difference]: Without dead ends: 64988 [2019-11-20 05:38:09,643 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-20 05:38:09,694 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64988 states. [2019-11-20 05:38:10,137 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64988 to 63722. [2019-11-20 05:38:10,137 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 63722 states. [2019-11-20 05:38:10,213 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63722 states to 63722 states and 98884 transitions. [2019-11-20 05:38:10,213 INFO L78 Accepts]: Start accepts. Automaton has 63722 states and 98884 transitions. Word has length 58 [2019-11-20 05:38:10,213 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 05:38:10,213 INFO L462 AbstractCegarLoop]: Abstraction has 63722 states and 98884 transitions. [2019-11-20 05:38:10,213 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-20 05:38:10,213 INFO L276 IsEmpty]: Start isEmpty. Operand 63722 states and 98884 transitions. [2019-11-20 05:38:10,214 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-11-20 05:38:10,214 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 05:38:10,214 INFO L410 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 05:38:10,214 INFO L410 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 05:38:10,214 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 05:38:10,215 INFO L82 PathProgramCache]: Analyzing trace with hash 1311774324, now seen corresponding path program 1 times [2019-11-20 05:38:10,215 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 05:38:10,215 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1904829417] [2019-11-20 05:38:10,215 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 05:38:10,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 05:38:10,285 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 05:38:10,285 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1904829417] [2019-11-20 05:38:10,286 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 05:38:10,286 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-20 05:38:10,286 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [147412181] [2019-11-20 05:38:10,286 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-20 05:38:10,287 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 05:38:10,287 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-20 05:38:10,287 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-20 05:38:10,287 INFO L87 Difference]: Start difference. First operand 63722 states and 98884 transitions. Second operand 3 states. [2019-11-20 05:38:15,165 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 05:38:15,165 INFO L93 Difference]: Finished difference Result 129850 states and 200364 transitions. [2019-11-20 05:38:15,166 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-20 05:38:15,166 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 64 [2019-11-20 05:38:15,166 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 05:38:15,244 INFO L225 Difference]: With dead ends: 129850 [2019-11-20 05:38:15,244 INFO L226 Difference]: Without dead ends: 66096 [2019-11-20 05:38:15,286 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:38:15,340 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66096 states. [2019-11-20 05:38:15,809 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66096 to 63402. [2019-11-20 05:38:15,809 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 63402 states. [2019-11-20 05:38:15,900 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63402 states to 63402 states and 98164 transitions. [2019-11-20 05:38:15,900 INFO L78 Accepts]: Start accepts. Automaton has 63402 states and 98164 transitions. Word has length 64 [2019-11-20 05:38:15,900 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 05:38:15,901 INFO L462 AbstractCegarLoop]: Abstraction has 63402 states and 98164 transitions. [2019-11-20 05:38:15,901 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-20 05:38:15,901 INFO L276 IsEmpty]: Start isEmpty. Operand 63402 states and 98164 transitions. [2019-11-20 05:38:15,901 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2019-11-20 05:38:15,902 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 05:38:15,902 INFO L410 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 05:38:15,902 INFO L410 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 05:38:15,902 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 05:38:15,903 INFO L82 PathProgramCache]: Analyzing trace with hash -1468274043, now seen corresponding path program 1 times [2019-11-20 05:38:15,903 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 05:38:15,903 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1803137985] [2019-11-20 05:38:15,903 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 05:38:15,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 05:38:16,026 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 05:38:16,026 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1803137985] [2019-11-20 05:38:16,027 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 05:38:16,027 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-20 05:38:16,027 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [758296897] [2019-11-20 05:38:16,027 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-20 05:38:16,028 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 05:38:16,028 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-20 05:38:16,028 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-20 05:38:16,028 INFO L87 Difference]: Start difference. First operand 63402 states and 98164 transitions. Second operand 3 states. [2019-11-20 05:38:21,372 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 05:38:21,373 INFO L93 Difference]: Finished difference Result 103470 states and 158960 transitions. [2019-11-20 05:38:21,373 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-20 05:38:21,373 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 74 [2019-11-20 05:38:21,373 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 05:38:21,453 INFO L225 Difference]: With dead ends: 103470 [2019-11-20 05:38:21,453 INFO L226 Difference]: Without dead ends: 76820 [2019-11-20 05:38:21,474 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:38:21,531 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76820 states. [2019-11-20 05:38:22,045 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76820 to 74946. [2019-11-20 05:38:22,045 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 74946 states. [2019-11-20 05:38:22,149 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74946 states to 74946 states and 116158 transitions. [2019-11-20 05:38:22,149 INFO L78 Accepts]: Start accepts. Automaton has 74946 states and 116158 transitions. Word has length 74 [2019-11-20 05:38:22,150 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 05:38:22,150 INFO L462 AbstractCegarLoop]: Abstraction has 74946 states and 116158 transitions. [2019-11-20 05:38:22,150 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-20 05:38:22,150 INFO L276 IsEmpty]: Start isEmpty. Operand 74946 states and 116158 transitions. [2019-11-20 05:38:22,152 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2019-11-20 05:38:22,152 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 05:38:22,152 INFO L410 BasicCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:38:22,152 INFO L410 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 05:38:22,152 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 05:38:22,153 INFO L82 PathProgramCache]: Analyzing trace with hash 1736777499, now seen corresponding path program 1 times [2019-11-20 05:38:22,153 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 05:38:22,153 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [679058355] [2019-11-20 05:38:22,153 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 05:38:22,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 05:38:22,237 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-11-20 05:38:22,238 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [679058355] [2019-11-20 05:38:22,238 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 05:38:22,238 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-20 05:38:22,238 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1279952332] [2019-11-20 05:38:22,239 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-20 05:38:22,239 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 05:38:22,239 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-20 05:38:22,239 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-20 05:38:22,240 INFO L87 Difference]: Start difference. First operand 74946 states and 116158 transitions. Second operand 3 states. [2019-11-20 05:38:24,119 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 05:38:24,119 INFO L93 Difference]: Finished difference Result 143371 states and 222219 transitions. [2019-11-20 05:38:24,119 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-20 05:38:24,120 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 81 [2019-11-20 05:38:24,120 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 05:38:24,187 INFO L225 Difference]: With dead ends: 143371 [2019-11-20 05:38:24,188 INFO L226 Difference]: Without dead ends: 68433 [2019-11-20 05:38:24,214 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:38:24,263 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68433 states. [2019-11-20 05:38:24,699 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68433 to 68431. [2019-11-20 05:38:24,699 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 68431 states. [2019-11-20 05:38:24,773 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68431 states to 68431 states and 106021 transitions. [2019-11-20 05:38:24,773 INFO L78 Accepts]: Start accepts. Automaton has 68431 states and 106021 transitions. Word has length 81 [2019-11-20 05:38:24,773 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 05:38:24,773 INFO L462 AbstractCegarLoop]: Abstraction has 68431 states and 106021 transitions. [2019-11-20 05:38:24,774 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-20 05:38:24,774 INFO L276 IsEmpty]: Start isEmpty. Operand 68431 states and 106021 transitions. [2019-11-20 05:38:24,775 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2019-11-20 05:38:24,775 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 05:38:24,775 INFO L410 BasicCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:38:24,775 INFO L410 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 05:38:24,775 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 05:38:24,776 INFO L82 PathProgramCache]: Analyzing trace with hash -1749163296, now seen corresponding path program 1 times [2019-11-20 05:38:24,776 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 05:38:24,776 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [618069876] [2019-11-20 05:38:24,776 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 05:38:24,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 05:38:24,846 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-11-20 05:38:24,846 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [618069876] [2019-11-20 05:38:24,847 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 05:38:24,847 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-20 05:38:24,847 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1752395851] [2019-11-20 05:38:24,847 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-20 05:38:24,848 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 05:38:24,848 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-20 05:38:24,848 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-20 05:38:24,848 INFO L87 Difference]: Start difference. First operand 68431 states and 106021 transitions. Second operand 3 states. [2019-11-20 05:38:26,114 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 05:38:26,114 INFO L93 Difference]: Finished difference Result 136168 states and 210970 transitions. [2019-11-20 05:38:26,114 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-20 05:38:26,114 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 84 [2019-11-20 05:38:26,115 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 05:38:26,186 INFO L225 Difference]: With dead ends: 136168 [2019-11-20 05:38:26,186 INFO L226 Difference]: Without dead ends: 68529 [2019-11-20 05:38:26,216 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:38:26,265 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68529 states. [2019-11-20 05:38:26,712 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68529 to 68527. [2019-11-20 05:38:26,712 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 68527 states. [2019-11-20 05:38:26,785 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68527 states to 68527 states and 106117 transitions. [2019-11-20 05:38:26,785 INFO L78 Accepts]: Start accepts. Automaton has 68527 states and 106117 transitions. Word has length 84 [2019-11-20 05:38:26,786 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 05:38:26,786 INFO L462 AbstractCegarLoop]: Abstraction has 68527 states and 106117 transitions. [2019-11-20 05:38:26,786 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-20 05:38:26,786 INFO L276 IsEmpty]: Start isEmpty. Operand 68527 states and 106117 transitions. [2019-11-20 05:38:26,787 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2019-11-20 05:38:26,787 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 05:38:26,787 INFO L410 BasicCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:38:26,787 INFO L410 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 05:38:26,787 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 05:38:26,788 INFO L82 PathProgramCache]: Analyzing trace with hash 668432337, now seen corresponding path program 1 times [2019-11-20 05:38:26,788 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 05:38:26,788 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1871559993] [2019-11-20 05:38:26,788 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 05:38:26,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 05:38:26,971 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 05:38:26,971 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1871559993] [2019-11-20 05:38:26,971 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 05:38:26,972 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-20 05:38:26,972 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [114043768] [2019-11-20 05:38:26,972 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-20 05:38:26,972 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 05:38:26,972 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-20 05:38:26,972 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-20 05:38:26,973 INFO L87 Difference]: Start difference. First operand 68527 states and 106117 transitions. Second operand 4 states. [2019-11-20 05:38:31,760 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 05:38:31,761 INFO L93 Difference]: Finished difference Result 93509 states and 143768 transitions. [2019-11-20 05:38:31,761 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-20 05:38:31,762 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 88 [2019-11-20 05:38:31,762 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 05:38:31,809 INFO L225 Difference]: With dead ends: 93509 [2019-11-20 05:38:31,810 INFO L226 Difference]: Without dead ends: 47150 [2019-11-20 05:38:31,831 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-20 05:38:31,866 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47150 states. [2019-11-20 05:38:32,158 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47150 to 45905. [2019-11-20 05:38:32,159 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45905 states. [2019-11-20 05:38:32,205 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45905 states to 45905 states and 70582 transitions. [2019-11-20 05:38:32,205 INFO L78 Accepts]: Start accepts. Automaton has 45905 states and 70582 transitions. Word has length 88 [2019-11-20 05:38:32,205 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 05:38:32,205 INFO L462 AbstractCegarLoop]: Abstraction has 45905 states and 70582 transitions. [2019-11-20 05:38:32,205 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-20 05:38:32,206 INFO L276 IsEmpty]: Start isEmpty. Operand 45905 states and 70582 transitions. [2019-11-20 05:38:32,207 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2019-11-20 05:38:32,207 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 05:38:32,207 INFO L410 BasicCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:38:32,207 INFO L410 AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 05:38:32,207 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 05:38:32,207 INFO L82 PathProgramCache]: Analyzing trace with hash -1526878815, now seen corresponding path program 1 times [2019-11-20 05:38:32,207 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 05:38:32,208 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2093415227] [2019-11-20 05:38:32,208 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 05:38:32,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 05:38:32,382 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 05:38:32,382 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2093415227] [2019-11-20 05:38:32,383 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 05:38:32,383 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-20 05:38:32,383 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1338326664] [2019-11-20 05:38:32,384 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-20 05:38:32,385 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 05:38:32,385 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-20 05:38:32,386 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-20 05:38:32,386 INFO L87 Difference]: Start difference. First operand 45905 states and 70582 transitions. Second operand 4 states. [2019-11-20 05:38:37,490 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 05:38:37,491 INFO L93 Difference]: Finished difference Result 59587 states and 90513 transitions. [2019-11-20 05:38:37,491 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-20 05:38:37,491 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 90 [2019-11-20 05:38:37,491 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 05:38:37,528 INFO L225 Difference]: With dead ends: 59587 [2019-11-20 05:38:37,528 INFO L226 Difference]: Without dead ends: 35850 [2019-11-20 05:38:37,539 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-20 05:38:37,566 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35850 states. [2019-11-20 05:38:37,812 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35850 to 34605. [2019-11-20 05:38:37,812 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34605 states. [2019-11-20 05:38:37,847 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34605 states to 34605 states and 52922 transitions. [2019-11-20 05:38:37,847 INFO L78 Accepts]: Start accepts. Automaton has 34605 states and 52922 transitions. Word has length 90 [2019-11-20 05:38:37,847 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 05:38:37,848 INFO L462 AbstractCegarLoop]: Abstraction has 34605 states and 52922 transitions. [2019-11-20 05:38:37,848 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-20 05:38:37,848 INFO L276 IsEmpty]: Start isEmpty. Operand 34605 states and 52922 transitions. [2019-11-20 05:38:37,849 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2019-11-20 05:38:37,849 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 05:38:37,849 INFO L410 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:38:37,850 INFO L410 AbstractCegarLoop]: === Iteration 20 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 05:38:37,850 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 05:38:37,850 INFO L82 PathProgramCache]: Analyzing trace with hash -447066393, now seen corresponding path program 1 times [2019-11-20 05:38:37,850 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 05:38:37,850 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [670239648] [2019-11-20 05:38:37,850 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 05:38:37,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 05:38:37,924 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 05:38:37,924 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [670239648] [2019-11-20 05:38:37,924 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 05:38:37,924 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-20 05:38:37,925 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [115974795] [2019-11-20 05:38:37,925 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-20 05:38:37,925 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 05:38:37,925 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-20 05:38:37,926 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-20 05:38:37,926 INFO L87 Difference]: Start difference. First operand 34605 states and 52922 transitions. Second operand 3 states. [2019-11-20 05:38:39,190 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 05:38:39,190 INFO L93 Difference]: Finished difference Result 35778 states and 54653 transitions. [2019-11-20 05:38:39,190 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-20 05:38:39,190 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 98 [2019-11-20 05:38:39,190 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 05:38:39,224 INFO L225 Difference]: With dead ends: 35778 [2019-11-20 05:38:39,224 INFO L226 Difference]: Without dead ends: 35776 [2019-11-20 05:38:39,230 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-20 05:38:39,257 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35776 states. [2019-11-20 05:38:39,503 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35776 to 35770. [2019-11-20 05:38:39,503 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35770 states. [2019-11-20 05:38:39,544 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35770 states to 35770 states and 54635 transitions. [2019-11-20 05:38:39,544 INFO L78 Accepts]: Start accepts. Automaton has 35770 states and 54635 transitions. Word has length 98 [2019-11-20 05:38:39,544 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 05:38:39,544 INFO L462 AbstractCegarLoop]: Abstraction has 35770 states and 54635 transitions. [2019-11-20 05:38:39,544 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-20 05:38:39,544 INFO L276 IsEmpty]: Start isEmpty. Operand 35770 states and 54635 transitions. [2019-11-20 05:38:39,546 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2019-11-20 05:38:39,546 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 05:38:39,547 INFO L410 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 05:38:39,547 INFO L410 AbstractCegarLoop]: === Iteration 21 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 05:38:39,547 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 05:38:39,547 INFO L82 PathProgramCache]: Analyzing trace with hash 42027815, now seen corresponding path program 1 times [2019-11-20 05:38:39,547 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 05:38:39,548 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1179386239] [2019-11-20 05:38:39,548 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 05:38:39,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 05:38:39,610 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 27 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 05:38:39,610 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1179386239] [2019-11-20 05:38:39,610 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 05:38:39,610 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-20 05:38:39,611 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [764392527] [2019-11-20 05:38:39,611 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-20 05:38:39,611 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 05:38:39,611 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-20 05:38:39,612 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-20 05:38:39,612 INFO L87 Difference]: Start difference. First operand 35770 states and 54635 transitions. Second operand 3 states. [2019-11-20 05:38:41,046 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 05:38:41,047 INFO L93 Difference]: Finished difference Result 60064 states and 91592 transitions. [2019-11-20 05:38:41,047 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-20 05:38:41,047 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 99 [2019-11-20 05:38:41,047 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 05:38:41,080 INFO L225 Difference]: With dead ends: 60064 [2019-11-20 05:38:41,081 INFO L226 Difference]: Without dead ends: 35466 [2019-11-20 05:38:41,093 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:38:41,120 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35466 states. [2019-11-20 05:38:41,370 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35466 to 35466. [2019-11-20 05:38:41,370 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35466 states. [2019-11-20 05:38:41,406 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35466 states to 35466 states and 53873 transitions. [2019-11-20 05:38:41,407 INFO L78 Accepts]: Start accepts. Automaton has 35466 states and 53873 transitions. Word has length 99 [2019-11-20 05:38:41,407 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 05:38:41,407 INFO L462 AbstractCegarLoop]: Abstraction has 35466 states and 53873 transitions. [2019-11-20 05:38:41,407 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-20 05:38:41,407 INFO L276 IsEmpty]: Start isEmpty. Operand 35466 states and 53873 transitions. [2019-11-20 05:38:41,409 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2019-11-20 05:38:41,409 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 05:38:41,410 INFO L410 BasicCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:38:41,410 INFO L410 AbstractCegarLoop]: === Iteration 22 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 05:38:41,410 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 05:38:41,410 INFO L82 PathProgramCache]: Analyzing trace with hash -602210607, now seen corresponding path program 1 times [2019-11-20 05:38:41,411 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 05:38:41,411 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1595659187] [2019-11-20 05:38:41,411 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 05:38:41,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 05:38:41,599 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 05:38:41,600 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1595659187] [2019-11-20 05:38:41,600 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 05:38:41,600 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-20 05:38:41,600 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1094369294] [2019-11-20 05:38:41,600 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-20 05:38:41,601 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 05:38:41,601 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-20 05:38:41,601 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-20 05:38:41,601 INFO L87 Difference]: Start difference. First operand 35466 states and 53873 transitions. Second operand 4 states. [2019-11-20 05:38:46,421 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 05:38:46,422 INFO L93 Difference]: Finished difference Result 42478 states and 64025 transitions. [2019-11-20 05:38:46,422 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-20 05:38:46,422 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 112 [2019-11-20 05:38:46,423 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 05:38:46,467 INFO L225 Difference]: With dead ends: 42478 [2019-11-20 05:38:46,467 INFO L226 Difference]: Without dead ends: 42406 [2019-11-20 05:38:46,474 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-20 05:38:46,510 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42406 states. [2019-11-20 05:38:46,795 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42406 to 41267. [2019-11-20 05:38:46,796 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41267 states. [2019-11-20 05:38:47,094 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41267 states to 41267 states and 62728 transitions. [2019-11-20 05:38:47,094 INFO L78 Accepts]: Start accepts. Automaton has 41267 states and 62728 transitions. Word has length 112 [2019-11-20 05:38:47,094 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 05:38:47,094 INFO L462 AbstractCegarLoop]: Abstraction has 41267 states and 62728 transitions. [2019-11-20 05:38:47,094 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-20 05:38:47,095 INFO L276 IsEmpty]: Start isEmpty. Operand 41267 states and 62728 transitions. [2019-11-20 05:38:47,097 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2019-11-20 05:38:47,097 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 05:38:47,097 INFO L410 BasicCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:38:47,098 INFO L410 AbstractCegarLoop]: === Iteration 23 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 05:38:47,098 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 05:38:47,098 INFO L82 PathProgramCache]: Analyzing trace with hash -930949646, now seen corresponding path program 1 times [2019-11-20 05:38:47,099 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 05:38:47,103 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [362667344] [2019-11-20 05:38:47,104 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 05:38:47,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 05:38:47,176 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-11-20 05:38:47,176 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [362667344] [2019-11-20 05:38:47,176 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 05:38:47,177 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-20 05:38:47,177 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [654453211] [2019-11-20 05:38:47,177 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-20 05:38:47,179 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 05:38:47,179 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-20 05:38:47,180 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-20 05:38:47,180 INFO L87 Difference]: Start difference. First operand 41267 states and 62728 transitions. Second operand 3 states. [2019-11-20 05:38:48,306 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 05:38:48,306 INFO L93 Difference]: Finished difference Result 70593 states and 107045 transitions. [2019-11-20 05:38:48,306 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-20 05:38:48,306 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 114 [2019-11-20 05:38:48,307 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 05:38:48,337 INFO L225 Difference]: With dead ends: 70593 [2019-11-20 05:38:48,337 INFO L226 Difference]: Without dead ends: 31456 [2019-11-20 05:38:48,354 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:38:48,378 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31456 states. [2019-11-20 05:38:48,577 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31456 to 31454. [2019-11-20 05:38:48,577 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31454 states. [2019-11-20 05:38:48,608 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31454 states to 31454 states and 47429 transitions. [2019-11-20 05:38:48,608 INFO L78 Accepts]: Start accepts. Automaton has 31454 states and 47429 transitions. Word has length 114 [2019-11-20 05:38:48,608 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 05:38:48,608 INFO L462 AbstractCegarLoop]: Abstraction has 31454 states and 47429 transitions. [2019-11-20 05:38:48,608 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-20 05:38:48,608 INFO L276 IsEmpty]: Start isEmpty. Operand 31454 states and 47429 transitions. [2019-11-20 05:38:48,611 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2019-11-20 05:38:48,611 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 05:38:48,611 INFO L410 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 05:38:48,611 INFO L410 AbstractCegarLoop]: === Iteration 24 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 05:38:48,612 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 05:38:48,612 INFO L82 PathProgramCache]: Analyzing trace with hash -1870082462, now seen corresponding path program 1 times [2019-11-20 05:38:48,612 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 05:38:48,612 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1815736667] [2019-11-20 05:38:48,612 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 05:38:48,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 05:38:48,890 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 46 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 05:38:48,891 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1815736667] [2019-11-20 05:38:48,891 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 05:38:48,891 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-20 05:38:48,891 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1309698659] [2019-11-20 05:38:48,892 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-20 05:38:48,892 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 05:38:48,893 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-20 05:38:48,893 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-20 05:38:48,893 INFO L87 Difference]: Start difference. First operand 31454 states and 47429 transitions. Second operand 4 states. [2019-11-20 05:38:56,197 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 05:38:56,197 INFO L93 Difference]: Finished difference Result 46689 states and 68857 transitions. [2019-11-20 05:38:56,197 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-20 05:38:56,197 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 118 [2019-11-20 05:38:56,197 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 05:38:56,235 INFO L225 Difference]: With dead ends: 46689 [2019-11-20 05:38:56,235 INFO L226 Difference]: Without dead ends: 33800 [2019-11-20 05:38:56,246 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-20 05:38:56,274 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33800 states. [2019-11-20 05:38:56,483 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33800 to 25127. [2019-11-20 05:38:56,483 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25127 states. [2019-11-20 05:38:56,508 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25127 states to 25127 states and 37661 transitions. [2019-11-20 05:38:56,508 INFO L78 Accepts]: Start accepts. Automaton has 25127 states and 37661 transitions. Word has length 118 [2019-11-20 05:38:56,508 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 05:38:56,508 INFO L462 AbstractCegarLoop]: Abstraction has 25127 states and 37661 transitions. [2019-11-20 05:38:56,509 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-20 05:38:56,509 INFO L276 IsEmpty]: Start isEmpty. Operand 25127 states and 37661 transitions. [2019-11-20 05:38:56,511 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2019-11-20 05:38:56,511 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 05:38:56,512 INFO L410 BasicCegarLoop]: trace histogram [4, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:38:56,512 INFO L410 AbstractCegarLoop]: === Iteration 25 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 05:38:56,512 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 05:38:56,512 INFO L82 PathProgramCache]: Analyzing trace with hash -1991972653, now seen corresponding path program 1 times [2019-11-20 05:38:56,512 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 05:38:56,513 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1286050799] [2019-11-20 05:38:56,513 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 05:38:56,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 05:38:56,596 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2019-11-20 05:38:56,596 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1286050799] [2019-11-20 05:38:56,597 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 05:38:56,597 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-20 05:38:56,597 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1256124316] [2019-11-20 05:38:56,597 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-20 05:38:56,598 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 05:38:56,598 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-20 05:38:56,598 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-20 05:38:56,598 INFO L87 Difference]: Start difference. First operand 25127 states and 37661 transitions. Second operand 3 states. [2019-11-20 05:38:57,412 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 05:38:57,412 INFO L93 Difference]: Finished difference Result 46628 states and 70013 transitions. [2019-11-20 05:38:57,413 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-20 05:38:57,413 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 136 [2019-11-20 05:38:57,413 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 05:38:57,434 INFO L225 Difference]: With dead ends: 46628 [2019-11-20 05:38:57,434 INFO L226 Difference]: Without dead ends: 23023 [2019-11-20 05:38:57,444 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:38:57,463 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23023 states. [2019-11-20 05:38:57,602 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23023 to 23021. [2019-11-20 05:38:57,602 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23021 states. [2019-11-20 05:38:57,623 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23021 states to 23021 states and 34510 transitions. [2019-11-20 05:38:57,623 INFO L78 Accepts]: Start accepts. Automaton has 23021 states and 34510 transitions. Word has length 136 [2019-11-20 05:38:57,623 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 05:38:57,623 INFO L462 AbstractCegarLoop]: Abstraction has 23021 states and 34510 transitions. [2019-11-20 05:38:57,624 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-20 05:38:57,624 INFO L276 IsEmpty]: Start isEmpty. Operand 23021 states and 34510 transitions. [2019-11-20 05:38:57,626 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 139 [2019-11-20 05:38:57,626 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 05:38:57,627 INFO L410 BasicCegarLoop]: trace histogram [4, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:38:57,627 INFO L410 AbstractCegarLoop]: === Iteration 26 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 05:38:57,627 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 05:38:57,627 INFO L82 PathProgramCache]: Analyzing trace with hash 1587573456, now seen corresponding path program 1 times [2019-11-20 05:38:57,627 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 05:38:57,628 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [277270750] [2019-11-20 05:38:57,628 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 05:38:57,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 05:38:57,720 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2019-11-20 05:38:57,720 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [277270750] [2019-11-20 05:38:57,720 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 05:38:57,720 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-20 05:38:57,721 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [272628687] [2019-11-20 05:38:57,721 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-20 05:38:57,721 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 05:38:57,721 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-20 05:38:57,722 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-20 05:38:57,722 INFO L87 Difference]: Start difference. First operand 23021 states and 34510 transitions. Second operand 3 states. [2019-11-20 05:38:58,756 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 05:38:58,756 INFO L93 Difference]: Finished difference Result 39201 states and 58798 transitions. [2019-11-20 05:38:58,757 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-20 05:38:58,757 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 138 [2019-11-20 05:38:58,757 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 05:38:58,773 INFO L225 Difference]: With dead ends: 39201 [2019-11-20 05:38:58,773 INFO L226 Difference]: Without dead ends: 18276 [2019-11-20 05:38:58,783 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:38:58,798 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18276 states. [2019-11-20 05:38:58,910 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18276 to 18274. [2019-11-20 05:38:58,910 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18274 states. [2019-11-20 05:38:58,927 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18274 states to 18274 states and 27278 transitions. [2019-11-20 05:38:58,927 INFO L78 Accepts]: Start accepts. Automaton has 18274 states and 27278 transitions. Word has length 138 [2019-11-20 05:38:58,927 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 05:38:58,927 INFO L462 AbstractCegarLoop]: Abstraction has 18274 states and 27278 transitions. [2019-11-20 05:38:58,927 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-20 05:38:58,927 INFO L276 IsEmpty]: Start isEmpty. Operand 18274 states and 27278 transitions. [2019-11-20 05:38:58,932 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 143 [2019-11-20 05:38:58,933 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 05:38:58,933 INFO L410 BasicCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:38:58,933 INFO L410 AbstractCegarLoop]: === Iteration 27 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 05:38:58,933 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 05:38:58,934 INFO L82 PathProgramCache]: Analyzing trace with hash -986919862, now seen corresponding path program 1 times [2019-11-20 05:38:58,934 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 05:38:58,934 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1998909073] [2019-11-20 05:38:58,934 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 05:38:58,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 05:38:59,185 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 05:38:59,185 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1998909073] [2019-11-20 05:38:59,186 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 05:38:59,186 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-20 05:38:59,186 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1127459902] [2019-11-20 05:38:59,186 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-20 05:38:59,187 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 05:38:59,187 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-20 05:38:59,187 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-20 05:38:59,187 INFO L87 Difference]: Start difference. First operand 18274 states and 27278 transitions. Second operand 4 states. [2019-11-20 05:39:03,708 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 05:39:03,708 INFO L93 Difference]: Finished difference Result 31236 states and 46451 transitions. [2019-11-20 05:39:03,709 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-20 05:39:03,709 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 142 [2019-11-20 05:39:03,709 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 05:39:03,739 INFO L225 Difference]: With dead ends: 31236 [2019-11-20 05:39:03,739 INFO L226 Difference]: Without dead ends: 31166 [2019-11-20 05:39:03,745 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-20 05:39:03,770 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31166 states. [2019-11-20 05:39:03,977 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31166 to 29812. [2019-11-20 05:39:03,977 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29812 states. [2019-11-20 05:39:04,007 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29812 states to 29812 states and 44886 transitions. [2019-11-20 05:39:04,007 INFO L78 Accepts]: Start accepts. Automaton has 29812 states and 44886 transitions. Word has length 142 [2019-11-20 05:39:04,008 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 05:39:04,008 INFO L462 AbstractCegarLoop]: Abstraction has 29812 states and 44886 transitions. [2019-11-20 05:39:04,008 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-20 05:39:04,008 INFO L276 IsEmpty]: Start isEmpty. Operand 29812 states and 44886 transitions. [2019-11-20 05:39:04,010 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2019-11-20 05:39:04,010 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 05:39:04,010 INFO L410 BasicCegarLoop]: trace histogram [4, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:39:04,011 INFO L410 AbstractCegarLoop]: === Iteration 28 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 05:39:04,011 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 05:39:04,011 INFO L82 PathProgramCache]: Analyzing trace with hash 119023117, now seen corresponding path program 1 times [2019-11-20 05:39:04,011 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 05:39:04,011 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2091770068] [2019-11-20 05:39:04,012 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 05:39:04,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 05:39:04,108 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2019-11-20 05:39:04,108 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2091770068] [2019-11-20 05:39:04,109 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 05:39:04,109 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-20 05:39:04,109 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1364542044] [2019-11-20 05:39:04,109 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-20 05:39:04,110 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 05:39:04,110 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-20 05:39:04,110 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-20 05:39:04,110 INFO L87 Difference]: Start difference. First operand 29812 states and 44886 transitions. Second operand 3 states. [2019-11-20 05:39:05,243 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 05:39:05,243 INFO L93 Difference]: Finished difference Result 54280 states and 82053 transitions. [2019-11-20 05:39:05,243 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-20 05:39:05,243 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 144 [2019-11-20 05:39:05,244 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 05:39:05,272 INFO L225 Difference]: With dead ends: 54280 [2019-11-20 05:39:05,272 INFO L226 Difference]: Without dead ends: 28620 [2019-11-20 05:39:05,284 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:39:05,309 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28620 states. [2019-11-20 05:39:05,494 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28620 to 28618. [2019-11-20 05:39:05,494 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28618 states. [2019-11-20 05:39:05,524 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28618 states to 28618 states and 43085 transitions. [2019-11-20 05:39:05,524 INFO L78 Accepts]: Start accepts. Automaton has 28618 states and 43085 transitions. Word has length 144 [2019-11-20 05:39:05,524 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 05:39:05,524 INFO L462 AbstractCegarLoop]: Abstraction has 28618 states and 43085 transitions. [2019-11-20 05:39:05,524 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-20 05:39:05,524 INFO L276 IsEmpty]: Start isEmpty. Operand 28618 states and 43085 transitions. [2019-11-20 05:39:05,526 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 149 [2019-11-20 05:39:05,526 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 05:39:05,527 INFO L410 BasicCegarLoop]: trace histogram [4, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:39:05,527 INFO L410 AbstractCegarLoop]: === Iteration 29 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 05:39:05,527 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 05:39:05,527 INFO L82 PathProgramCache]: Analyzing trace with hash 1059270226, now seen corresponding path program 1 times [2019-11-20 05:39:05,527 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 05:39:05,527 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1366755437] [2019-11-20 05:39:05,527 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 05:39:05,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 05:39:05,614 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2019-11-20 05:39:05,615 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1366755437] [2019-11-20 05:39:05,615 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 05:39:05,615 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-20 05:39:05,615 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1512773017] [2019-11-20 05:39:05,616 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-20 05:39:05,616 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 05:39:05,616 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-20 05:39:05,616 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-20 05:39:05,616 INFO L87 Difference]: Start difference. First operand 28618 states and 43085 transitions. Second operand 3 states. [2019-11-20 05:39:06,728 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 05:39:06,728 INFO L93 Difference]: Finished difference Result 53161 states and 80312 transitions. [2019-11-20 05:39:06,728 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-20 05:39:06,729 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 148 [2019-11-20 05:39:06,729 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 05:39:06,756 INFO L225 Difference]: With dead ends: 53161 [2019-11-20 05:39:06,756 INFO L226 Difference]: Without dead ends: 28695 [2019-11-20 05:39:06,768 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:39:06,791 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28695 states. [2019-11-20 05:39:06,986 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28695 to 28693. [2019-11-20 05:39:06,986 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28693 states. [2019-11-20 05:39:07,017 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28693 states to 28693 states and 43160 transitions. [2019-11-20 05:39:07,018 INFO L78 Accepts]: Start accepts. Automaton has 28693 states and 43160 transitions. Word has length 148 [2019-11-20 05:39:07,018 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 05:39:07,018 INFO L462 AbstractCegarLoop]: Abstraction has 28693 states and 43160 transitions. [2019-11-20 05:39:07,018 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-20 05:39:07,018 INFO L276 IsEmpty]: Start isEmpty. Operand 28693 states and 43160 transitions. [2019-11-20 05:39:07,021 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 179 [2019-11-20 05:39:07,021 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 05:39:07,021 INFO L410 BasicCegarLoop]: trace histogram [4, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:39:07,022 INFO L410 AbstractCegarLoop]: === Iteration 30 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 05:39:07,022 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 05:39:07,022 INFO L82 PathProgramCache]: Analyzing trace with hash -1097377653, now seen corresponding path program 1 times [2019-11-20 05:39:07,022 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 05:39:07,022 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [389094046] [2019-11-20 05:39:07,022 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 05:39:07,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 05:39:07,115 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2019-11-20 05:39:07,116 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [389094046] [2019-11-20 05:39:07,116 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 05:39:07,116 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-20 05:39:07,116 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1443320568] [2019-11-20 05:39:07,117 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-20 05:39:07,117 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 05:39:07,117 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-20 05:39:07,117 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-20 05:39:07,118 INFO L87 Difference]: Start difference. First operand 28693 states and 43160 transitions. Second operand 3 states. [2019-11-20 05:39:07,787 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 05:39:07,787 INFO L93 Difference]: Finished difference Result 47539 states and 71811 transitions. [2019-11-20 05:39:07,787 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-20 05:39:07,787 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 178 [2019-11-20 05:39:07,788 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 05:39:07,807 INFO L225 Difference]: With dead ends: 47539 [2019-11-20 05:39:07,807 INFO L226 Difference]: Without dead ends: 22998 [2019-11-20 05:39:07,818 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:39:07,836 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22998 states. [2019-11-20 05:39:07,979 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22998 to 22996. [2019-11-20 05:39:07,979 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22996 states. [2019-11-20 05:39:07,999 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22996 states to 22996 states and 34564 transitions. [2019-11-20 05:39:07,999 INFO L78 Accepts]: Start accepts. Automaton has 22996 states and 34564 transitions. Word has length 178 [2019-11-20 05:39:08,000 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 05:39:08,000 INFO L462 AbstractCegarLoop]: Abstraction has 22996 states and 34564 transitions. [2019-11-20 05:39:08,000 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-20 05:39:08,000 INFO L276 IsEmpty]: Start isEmpty. Operand 22996 states and 34564 transitions. [2019-11-20 05:39:08,003 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 184 [2019-11-20 05:39:08,003 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 05:39:08,003 INFO L410 BasicCegarLoop]: trace histogram [4, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:39:08,003 INFO L410 AbstractCegarLoop]: === Iteration 31 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 05:39:08,003 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 05:39:08,004 INFO L82 PathProgramCache]: Analyzing trace with hash -73762474, now seen corresponding path program 1 times [2019-11-20 05:39:08,004 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 05:39:08,004 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [776632829] [2019-11-20 05:39:08,004 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 05:39:08,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 05:39:08,097 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2019-11-20 05:39:08,097 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [776632829] [2019-11-20 05:39:08,098 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 05:39:08,098 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-20 05:39:08,098 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1069383228] [2019-11-20 05:39:08,098 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-20 05:39:08,098 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 05:39:08,099 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-20 05:39:08,099 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-20 05:39:08,099 INFO L87 Difference]: Start difference. First operand 22996 states and 34564 transitions. Second operand 3 states. [2019-11-20 05:39:08,423 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 05:39:08,423 INFO L93 Difference]: Finished difference Result 23980 states and 35952 transitions. [2019-11-20 05:39:08,424 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-20 05:39:08,424 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 183 [2019-11-20 05:39:08,424 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 05:39:08,428 INFO L225 Difference]: With dead ends: 23980 [2019-11-20 05:39:08,428 INFO L226 Difference]: Without dead ends: 5144 [2019-11-20 05:39:08,434 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:39:08,438 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5144 states. [2019-11-20 05:39:08,473 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5144 to 5142. [2019-11-20 05:39:08,473 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5142 states. [2019-11-20 05:39:08,478 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5142 states to 5142 states and 7332 transitions. [2019-11-20 05:39:08,478 INFO L78 Accepts]: Start accepts. Automaton has 5142 states and 7332 transitions. Word has length 183 [2019-11-20 05:39:08,479 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 05:39:08,479 INFO L462 AbstractCegarLoop]: Abstraction has 5142 states and 7332 transitions. [2019-11-20 05:39:08,479 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-20 05:39:08,479 INFO L276 IsEmpty]: Start isEmpty. Operand 5142 states and 7332 transitions. [2019-11-20 05:39:08,482 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 187 [2019-11-20 05:39:08,482 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 05:39:08,482 INFO L410 BasicCegarLoop]: trace histogram [4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:39:08,482 INFO L410 AbstractCegarLoop]: === Iteration 32 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 05:39:08,483 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 05:39:08,483 INFO L82 PathProgramCache]: Analyzing trace with hash 216076711, now seen corresponding path program 1 times [2019-11-20 05:39:08,483 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 05:39:08,483 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1931506312] [2019-11-20 05:39:08,483 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 05:39:08,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 05:39:08,733 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 56 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 05:39:08,734 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1931506312] [2019-11-20 05:39:08,734 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 05:39:08,734 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-20 05:39:08,734 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [778535333] [2019-11-20 05:39:08,735 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-20 05:39:08,735 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 05:39:08,735 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-20 05:39:08,736 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-11-20 05:39:08,736 INFO L87 Difference]: Start difference. First operand 5142 states and 7332 transitions. Second operand 5 states. [2019-11-20 05:39:10,089 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 05:39:10,089 INFO L93 Difference]: Finished difference Result 6364 states and 9047 transitions. [2019-11-20 05:39:10,089 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-20 05:39:10,090 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 186 [2019-11-20 05:39:10,090 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 05:39:10,095 INFO L225 Difference]: With dead ends: 6364 [2019-11-20 05:39:10,095 INFO L226 Difference]: Without dead ends: 6354 [2019-11-20 05:39:10,096 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-11-20 05:39:10,100 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6354 states. [2019-11-20 05:39:10,134 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6354 to 5704. [2019-11-20 05:39:10,134 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5704 states. [2019-11-20 05:39:10,139 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5704 states to 5704 states and 8136 transitions. [2019-11-20 05:39:10,139 INFO L78 Accepts]: Start accepts. Automaton has 5704 states and 8136 transitions. Word has length 186 [2019-11-20 05:39:10,139 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 05:39:10,139 INFO L462 AbstractCegarLoop]: Abstraction has 5704 states and 8136 transitions. [2019-11-20 05:39:10,140 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-20 05:39:10,140 INFO L276 IsEmpty]: Start isEmpty. Operand 5704 states and 8136 transitions. [2019-11-20 05:39:10,143 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 189 [2019-11-20 05:39:10,143 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 05:39:10,143 INFO L410 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 05:39:10,143 INFO L410 AbstractCegarLoop]: === Iteration 33 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 05:39:10,144 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 05:39:10,144 INFO L82 PathProgramCache]: Analyzing trace with hash -621968245, now seen corresponding path program 1 times [2019-11-20 05:39:10,144 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 05:39:10,144 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [548581443] [2019-11-20 05:39:10,144 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 05:39:10,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-20 05:39:10,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-20 05:39:10,475 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-20 05:39:10,476 INFO L475 BasicCegarLoop]: Counterexample might be feasible [2019-11-20 05:39:10,666 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 20.11 05:39:10 BoogieIcfgContainer [2019-11-20 05:39:10,666 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-11-20 05:39:10,667 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-11-20 05:39:10,667 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-11-20 05:39:10,667 INFO L275 PluginConnector]: Witness Printer initialized [2019-11-20 05:39:10,667 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 05:37:15" (3/4) ... [2019-11-20 05:39:10,669 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2019-11-20 05:39:10,870 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/run_dir_d42c7e2a-b988-4dde-b80d-33c6a89a15c9/bin/uautomizer/witness.graphml [2019-11-20 05:39:10,871 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-11-20 05:39:10,872 INFO L168 Benchmark]: Toolchain (without parser) took 138049.86 ms. Allocated memory was 1.0 GB in the beginning and 5.5 GB in the end (delta: 4.4 GB). Free memory was 891.0 MB in the beginning and 1.3 GB in the end (delta: -387.3 MB). Peak memory consumption was 4.1 GB. Max. memory is 11.5 GB. [2019-11-20 05:39:10,873 INFO L168 Benchmark]: CDTParser took 0.21 ms. Allocated memory is still 1.0 GB. Free memory is still 967.5 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-20 05:39:10,873 INFO L168 Benchmark]: CACSL2BoogieTranslator took 3498.88 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 205.5 MB). Free memory was 891.0 MB in the beginning and 928.6 MB in the end (delta: -37.5 MB). Peak memory consumption was 461.1 MB. Max. memory is 11.5 GB. [2019-11-20 05:39:10,874 INFO L168 Benchmark]: Boogie Procedure Inliner took 591.09 ms. Allocated memory is still 1.2 GB. Free memory was 928.6 MB in the beginning and 763.8 MB in the end (delta: 164.7 MB). Peak memory consumption was 164.7 MB. Max. memory is 11.5 GB. [2019-11-20 05:39:10,874 INFO L168 Benchmark]: Boogie Preprocessor took 1207.42 ms. Allocated memory was 1.2 GB in the beginning and 1.5 GB in the end (delta: 249.6 MB). Free memory was 763.8 MB in the beginning and 1.2 GB in the end (delta: -410.9 MB). Peak memory consumption was 299.3 MB. Max. memory is 11.5 GB. [2019-11-20 05:39:10,875 INFO L168 Benchmark]: RCFGBuilder took 17782.68 ms. Allocated memory was 1.5 GB in the beginning and 2.5 GB in the end (delta: 1.0 GB). Free memory was 1.2 GB in the beginning and 2.0 GB in the end (delta: -836.2 MB). Peak memory consumption was 1.3 GB. Max. memory is 11.5 GB. [2019-11-20 05:39:10,875 INFO L168 Benchmark]: TraceAbstraction took 114761.69 ms. Allocated memory was 2.5 GB in the beginning and 5.5 GB in the end (delta: 3.0 GB). Free memory was 2.0 GB in the beginning and 1.3 GB in the end (delta: 717.2 MB). Peak memory consumption was 3.7 GB. Max. memory is 11.5 GB. [2019-11-20 05:39:10,875 INFO L168 Benchmark]: Witness Printer took 204.03 ms. Allocated memory is still 5.5 GB. Free memory was 1.3 GB in the beginning and 1.3 GB in the end (delta: 15.4 MB). Peak memory consumption was 15.4 MB. Max. memory is 11.5 GB. [2019-11-20 05:39:10,878 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.5 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 3498.88 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 205.5 MB). Free memory was 891.0 MB in the beginning and 928.6 MB in the end (delta: -37.5 MB). Peak memory consumption was 461.1 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 591.09 ms. Allocated memory is still 1.2 GB. Free memory was 928.6 MB in the beginning and 763.8 MB in the end (delta: 164.7 MB). Peak memory consumption was 164.7 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 1207.42 ms. Allocated memory was 1.2 GB in the beginning and 1.5 GB in the end (delta: 249.6 MB). Free memory was 763.8 MB in the beginning and 1.2 GB in the end (delta: -410.9 MB). Peak memory consumption was 299.3 MB. Max. memory is 11.5 GB. * RCFGBuilder took 17782.68 ms. Allocated memory was 1.5 GB in the beginning and 2.5 GB in the end (delta: 1.0 GB). Free memory was 1.2 GB in the beginning and 2.0 GB in the end (delta: -836.2 MB). Peak memory consumption was 1.3 GB. Max. memory is 11.5 GB. * TraceAbstraction took 114761.69 ms. Allocated memory was 2.5 GB in the beginning and 5.5 GB in the end (delta: 3.0 GB). Free memory was 2.0 GB in the beginning and 1.3 GB in the end (delta: 717.2 MB). Peak memory consumption was 3.7 GB. Max. memory is 11.5 GB. * Witness Printer took 204.03 ms. Allocated memory is still 5.5 GB. Free memory was 1.3 GB in the beginning and 1.3 GB in the end (delta: 15.4 MB). Peak memory consumption was 15.4 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 49138]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L5] int m_getInetAddress = 1; [L6] int m_getOOBInline = 2; [L7] int m_getLocalPort = 3; [L8] int m_isInputShutdown = 4; [L9] int m_setTcpNoDelay = 5; [L10] int m_isConnected = 6; [L11] int m_getKeepAlive = 7; [L12] int m_getLocalAddress = 8; [L13] int m_bind = 9; [L14] int m_getChannel = 10; [L15] int m_getSoLinger = 11; [L16] int m_getImpl = 12; [L17] int m_getTcpNoDelay = 13; [L18] int m_getSoTimeout = 14; [L19] int m_isOutputShutdown = 15; [L20] int m_postAccept = 16; [L21] int m_close = 17; [L22] int m_setOOBInline = 18; [L23] int m_getLocalSocketAddress = 19; [L24] int m_getReceiveBufferSize = 20; [L25] int m_setReuseAddress = 21; [L26] int m_getTrafficClass = 22; [L27] int m_getReuseAddress = 23; [L28] int m_createImpl = 24; [L29] int m_setCreated = 25; [L30] int m_setKeepAlive = 26; [L31] int m_getInputStream = 27; [L32] int m_shutdownOutput = 28; [L33] int m_shutdownInput = 29; [L34] int m_setPerformancePreferences = 30; [L35] int m_getPort = 31; [L36] int m_sendUrgentData = 32; [L37] int m_isClosed = 33; [L38] int m_isBound = 34; [L39] int m_setBound = 35; [L40] int m_getSendBufferSize = 36; [L41] int m_getOutputStream = 37; [L42] int m_setConnected = 38; [L43] int m_Socket = 39; [L44] int m_getRemoteSocketAddress = 40; [L45] int m_setReceiveBufferSize_1 = 41; [L46] int m_setReceiveBufferSize_2 = 42; [L47] int m_connect2_1 = 43; [L48] int m_connect2_2 = 44; [L49] int m_setSoLinger_1 = 45; [L50] int m_setSoLinger_2 = 46; [L51] int m_connect1_1 = 47; [L52] int m_connect1_2 = 48; [L53] int m_setTrafficClass_1 = 49; [L54] int m_setTrafficClass_2 = 50; [L55] int m_setSoTimeout_1 = 51; [L56] int m_setSoTimeout_2 = 52; [L57] int m_setSendBufferSize_1 = 53; [L58] int m_setSendBufferSize_2 = 54; [L59] int m_setSocketImplFactory_1 = 55; [L60] int m_setSocketImplFactory_2 = 56; VAL [m_bind=9, m_close=17, m_connect1_1=47, m_connect1_2=48, m_connect2_1=43, m_connect2_2=44, m_createImpl=24, m_getChannel=10, m_getImpl=12, m_getInetAddress=1, m_getInputStream=27, m_getKeepAlive=7, m_getLocalAddress=8, m_getLocalPort=3, m_getLocalSocketAddress=19, m_getOOBInline=2, m_getOutputStream=37, m_getPort=31, m_getReceiveBufferSize=20, m_getRemoteSocketAddress=40, m_getReuseAddress=23, m_getSendBufferSize=36, m_getSoLinger=11, m_getSoTimeout=14, m_getTcpNoDelay=13, m_getTrafficClass=22, m_isBound=34, m_isClosed=33, m_isConnected=6, m_isInputShutdown=4, m_isOutputShutdown=15, m_postAccept=16, m_sendUrgentData=32, m_setBound=35, m_setConnected=38, m_setCreated=25, m_setKeepAlive=26, m_setOOBInline=18, m_setPerformancePreferences=30, m_setReceiveBufferSize_1=41, m_setReceiveBufferSize_2=42, m_setReuseAddress=21, m_setSendBufferSize_1=53, m_setSendBufferSize_2=54, m_setSocketImplFactory_1=55, m_setSocketImplFactory_2=56, m_setSoLinger_1=45, m_setSoLinger_2=46, m_setSoTimeout_1=51, m_setSoTimeout_2=52, m_setTcpNoDelay=5, m_setTrafficClass_1=49, m_setTrafficClass_2=50, m_shutdownInput=29, m_shutdownOutput=28, m_Socket=39] [L65] int q = 0; [L66] int method_id; [L69] int this_oldImpl = 0; [L70] int this_factory = 0; [L71] int this_shutOut = 0; [L72] int this_created = 0; [L73] int this_shutIn = 0; [L74] int this_closed = 0; [L75] int this_bound = 0; [L76] int this_impl = 1; [L77] int this_connected = 0; VAL [m_bind=9, m_close=17, m_connect1_1=47, m_connect1_2=48, m_connect2_1=43, m_connect2_2=44, m_createImpl=24, m_getChannel=10, m_getImpl=12, m_getInetAddress=1, m_getInputStream=27, m_getKeepAlive=7, m_getLocalAddress=8, m_getLocalPort=3, m_getLocalSocketAddress=19, m_getOOBInline=2, m_getOutputStream=37, m_getPort=31, m_getReceiveBufferSize=20, m_getRemoteSocketAddress=40, m_getReuseAddress=23, m_getSendBufferSize=36, m_getSoLinger=11, m_getSoTimeout=14, m_getTcpNoDelay=13, m_getTrafficClass=22, m_isBound=34, m_isClosed=33, m_isConnected=6, m_isInputShutdown=4, m_isOutputShutdown=15, m_postAccept=16, m_sendUrgentData=32, m_setBound=35, m_setConnected=38, m_setCreated=25, m_setKeepAlive=26, m_setOOBInline=18, m_setPerformancePreferences=30, m_setReceiveBufferSize_1=41, m_setReceiveBufferSize_2=42, m_setReuseAddress=21, m_setSendBufferSize_1=53, m_setSendBufferSize_2=54, m_setSocketImplFactory_1=55, m_setSocketImplFactory_2=56, m_setSoLinger_1=45, m_setSoLinger_2=46, m_setSoTimeout_1=51, m_setSoTimeout_2=52, m_setTcpNoDelay=5, m_setTrafficClass_1=49, m_setTrafficClass_2=50, m_shutdownInput=29, m_shutdownOutput=28, m_Socket=39] [L80] COND TRUE 1 [L83] _Bool P1=__VERIFIER_nondet_int(); [L84] int P2=__VERIFIER_nondet_int(); [L85] _Bool P3=__VERIFIER_nondet_int(); [L86] _Bool P4=__VERIFIER_nondet_int(); [L87] _Bool P5=__VERIFIER_nondet_int(); [L88] _Bool P6=__VERIFIER_nondet_int(); [L89] int P7=__VERIFIER_nondet_int(); [L90] int P8=__VERIFIER_nondet_int(); [L91] int P9=__VERIFIER_nondet_int(); [L92] int P10=__VERIFIER_nondet_int(); [L93] int P11=__VERIFIER_nondet_int(); [L94] int P12=__VERIFIER_nondet_int(); [L95] int P13=__VERIFIER_nondet_int(); [L96] int P14=__VERIFIER_nondet_int(); [L97] int P15=__VERIFIER_nondet_int(); [L98] int P16=__VERIFIER_nondet_int(); [L99] _Bool P17=__VERIFIER_nondet_int(); [L100] int P18=__VERIFIER_nondet_int(); [L101] _Bool P19=__VERIFIER_nondet_int(); [L102] int P20=__VERIFIER_nondet_int(); [L103] int P21=__VERIFIER_nondet_int(); [L104] int P22=__VERIFIER_nondet_int(); [L105] int P23=__VERIFIER_nondet_int(); [L106] int P24=__VERIFIER_nondet_int(); [L107] int P25=__VERIFIER_nondet_int(); [L108] int P26=__VERIFIER_nondet_int(); [L109] int P27=__VERIFIER_nondet_int(); [L110] int P28=__VERIFIER_nondet_int(); [L111] int P29=__VERIFIER_nondet_int(); [L112] int P30=__VERIFIER_nondet_int(); [L116] COND TRUE q == 0 [L117] COND TRUE __VERIFIER_nondet_int() [L121] method_id = 39 VAL [m_bind=9, m_close=17, m_connect1_1=47, m_connect1_2=48, m_connect2_1=43, m_connect2_2=44, m_createImpl=24, m_getChannel=10, m_getImpl=12, m_getInetAddress=1, m_getInputStream=27, m_getKeepAlive=7, m_getLocalAddress=8, m_getLocalPort=3, m_getLocalSocketAddress=19, m_getOOBInline=2, m_getOutputStream=37, m_getPort=31, m_getReceiveBufferSize=20, m_getRemoteSocketAddress=40, m_getReuseAddress=23, m_getSendBufferSize=36, m_getSoLinger=11, m_getSoTimeout=14, m_getTcpNoDelay=13, m_getTrafficClass=22, m_isBound=34, m_isClosed=33, m_isConnected=6, m_isInputShutdown=4, m_isOutputShutdown=15, m_postAccept=16, m_sendUrgentData=32, m_setBound=35, m_setConnected=38, m_setCreated=25, m_setKeepAlive=26, m_setOOBInline=18, m_setPerformancePreferences=30, m_setReceiveBufferSize_1=41, m_setReceiveBufferSize_2=42, m_setReuseAddress=21, m_setSendBufferSize_1=53, m_setSendBufferSize_2=54, m_setSocketImplFactory_1=55, m_setSocketImplFactory_2=56, m_setSoLinger_1=45, m_setSoLinger_2=46, m_setSoTimeout_1=51, m_setSoTimeout_2=52, m_setTcpNoDelay=5, m_setTrafficClass_1=49, m_setTrafficClass_2=50, m_shutdownInput=29, m_shutdownOutput=28, m_Socket=39] [L123] COND FALSE !(0) [L127] q = 2 [L129] this_factory=0 [L129] this_shutIn=0 [L129] this_connected=0 [L129] this_closed=0 [L129] this_shutOut=0 [L129] this_created=0 [L129] this_impl=1 [L129] this_bound=0 [L129] this_oldImpl=0 VAL [m_bind=9, m_close=17, m_connect1_1=47, m_connect1_2=48, m_connect2_1=43, m_connect2_2=44, m_createImpl=24, m_getChannel=10, m_getImpl=12, m_getInetAddress=1, m_getInputStream=27, m_getKeepAlive=7, m_getLocalAddress=8, m_getLocalPort=3, m_getLocalSocketAddress=19, m_getOOBInline=2, m_getOutputStream=37, m_getPort=31, m_getReceiveBufferSize=20, m_getRemoteSocketAddress=40, m_getReuseAddress=23, m_getSendBufferSize=36, m_getSoLinger=11, m_getSoTimeout=14, m_getTcpNoDelay=13, m_getTrafficClass=22, m_isBound=34, m_isClosed=33, m_isConnected=6, m_isInputShutdown=4, m_isOutputShutdown=15, m_postAccept=16, m_sendUrgentData=32, m_setBound=35, m_setConnected=38, m_setCreated=25, m_setKeepAlive=26, m_setOOBInline=18, m_setPerformancePreferences=30, m_setReceiveBufferSize_1=41, m_setReceiveBufferSize_2=42, m_setReuseAddress=21, m_setSendBufferSize_1=53, m_setSendBufferSize_2=54, m_setSocketImplFactory_1=55, m_setSocketImplFactory_2=56, m_setSoLinger_1=45, m_setSoLinger_2=46, m_setSoTimeout_1=51, m_setSoTimeout_2=52, m_setTcpNoDelay=5, m_setTrafficClass_1=49, m_setTrafficClass_2=50, m_shutdownInput=29, m_shutdownOutput=28, m_Socket=39] [L80] COND TRUE 1 [L83] _Bool P1=__VERIFIER_nondet_int(); [L84] int P2=__VERIFIER_nondet_int(); [L85] _Bool P3=__VERIFIER_nondet_int(); [L86] _Bool P4=__VERIFIER_nondet_int(); [L87] _Bool P5=__VERIFIER_nondet_int(); [L88] _Bool P6=__VERIFIER_nondet_int(); [L89] int P7=__VERIFIER_nondet_int(); [L90] int P8=__VERIFIER_nondet_int(); [L91] int P9=__VERIFIER_nondet_int(); [L92] int P10=__VERIFIER_nondet_int(); [L93] int P11=__VERIFIER_nondet_int(); [L94] int P12=__VERIFIER_nondet_int(); [L95] int P13=__VERIFIER_nondet_int(); [L96] int P14=__VERIFIER_nondet_int(); [L97] int P15=__VERIFIER_nondet_int(); [L98] int P16=__VERIFIER_nondet_int(); [L99] _Bool P17=__VERIFIER_nondet_int(); [L100] int P18=__VERIFIER_nondet_int(); [L101] _Bool P19=__VERIFIER_nondet_int(); [L102] int P20=__VERIFIER_nondet_int(); [L103] int P21=__VERIFIER_nondet_int(); [L104] int P22=__VERIFIER_nondet_int(); [L105] int P23=__VERIFIER_nondet_int(); [L106] int P24=__VERIFIER_nondet_int(); [L107] int P25=__VERIFIER_nondet_int(); [L108] int P26=__VERIFIER_nondet_int(); [L109] int P27=__VERIFIER_nondet_int(); [L110] int P28=__VERIFIER_nondet_int(); [L111] int P29=__VERIFIER_nondet_int(); [L112] int P30=__VERIFIER_nondet_int(); [L116] COND FALSE !(q == 0) VAL [m_bind=9, m_close=17, m_connect1_1=47, m_connect1_2=48, m_connect2_1=43, m_connect2_2=44, m_createImpl=24, m_getChannel=10, m_getImpl=12, m_getInetAddress=1, m_getInputStream=27, m_getKeepAlive=7, m_getLocalAddress=8, m_getLocalPort=3, m_getLocalSocketAddress=19, m_getOOBInline=2, m_getOutputStream=37, m_getPort=31, m_getReceiveBufferSize=20, m_getRemoteSocketAddress=40, m_getReuseAddress=23, m_getSendBufferSize=36, m_getSoLinger=11, m_getSoTimeout=14, m_getTcpNoDelay=13, m_getTrafficClass=22, m_isBound=34, m_isClosed=33, m_isConnected=6, m_isInputShutdown=4, m_isOutputShutdown=15, m_postAccept=16, m_sendUrgentData=32, m_setBound=35, m_setConnected=38, m_setCreated=25, m_setKeepAlive=26, m_setOOBInline=18, m_setPerformancePreferences=30, m_setReceiveBufferSize_1=41, m_setReceiveBufferSize_2=42, m_setReuseAddress=21, m_setSendBufferSize_1=53, m_setSendBufferSize_2=54, m_setSocketImplFactory_1=55, m_setSocketImplFactory_2=56, m_setSoLinger_1=45, m_setSoLinger_2=46, m_setSoTimeout_1=51, m_setSoTimeout_2=52, m_setTcpNoDelay=5, m_setTrafficClass_1=49, m_setTrafficClass_2=50, m_shutdownInput=29, m_shutdownOutput=28, m_Socket=39] [L136] COND FALSE !(q == 1) VAL [m_bind=9, m_close=17, m_connect1_1=47, m_connect1_2=48, m_connect2_1=43, m_connect2_2=44, m_createImpl=24, m_getChannel=10, m_getImpl=12, m_getInetAddress=1, m_getInputStream=27, m_getKeepAlive=7, m_getLocalAddress=8, m_getLocalPort=3, m_getLocalSocketAddress=19, m_getOOBInline=2, m_getOutputStream=37, m_getPort=31, m_getReceiveBufferSize=20, m_getRemoteSocketAddress=40, m_getReuseAddress=23, m_getSendBufferSize=36, m_getSoLinger=11, m_getSoTimeout=14, m_getTcpNoDelay=13, m_getTrafficClass=22, m_isBound=34, m_isClosed=33, m_isConnected=6, m_isInputShutdown=4, m_isOutputShutdown=15, m_postAccept=16, m_sendUrgentData=32, m_setBound=35, m_setConnected=38, m_setCreated=25, m_setKeepAlive=26, m_setOOBInline=18, m_setPerformancePreferences=30, m_setReceiveBufferSize_1=41, m_setReceiveBufferSize_2=42, m_setReuseAddress=21, m_setSendBufferSize_1=53, m_setSendBufferSize_2=54, m_setSocketImplFactory_1=55, m_setSocketImplFactory_2=56, m_setSoLinger_1=45, m_setSoLinger_2=46, m_setSoTimeout_1=51, m_setSoTimeout_2=52, m_setTcpNoDelay=5, m_setTrafficClass_1=49, m_setTrafficClass_2=50, m_shutdownInput=29, m_shutdownOutput=28, m_Socket=39] [L748] COND TRUE q == 2 [L749] COND FALSE !(__VERIFIER_nondet_int()) [L765] COND FALSE !(__VERIFIER_nondet_int()) [L781] COND FALSE !(__VERIFIER_nondet_int()) [L797] COND FALSE !(__VERIFIER_nondet_int()) [L813] COND FALSE !(__VERIFIER_nondet_int()) [L829] COND FALSE !(__VERIFIER_nondet_int()) [L845] COND FALSE !(__VERIFIER_nondet_int()) [L861] COND FALSE !(__VERIFIER_nondet_int()) [L877] COND FALSE !(__VERIFIER_nondet_int()) [L893] COND FALSE !(__VERIFIER_nondet_int()) [L909] COND FALSE !(__VERIFIER_nondet_int()) [L925] COND FALSE !(__VERIFIER_nondet_int()) [L941] COND FALSE !(__VERIFIER_nondet_int()) [L957] COND FALSE !(__VERIFIER_nondet_int()) [L973] COND FALSE !(__VERIFIER_nondet_int()) [L989] COND FALSE !(__VERIFIER_nondet_int()) [L1005] COND FALSE !(__VERIFIER_nondet_int()) [L1021] COND FALSE !(__VERIFIER_nondet_int()) [L1037] COND FALSE !(__VERIFIER_nondet_int()) [L1053] COND FALSE !(__VERIFIER_nondet_int()) [L1069] COND FALSE !(__VERIFIER_nondet_int()) [L1085] COND FALSE !(__VERIFIER_nondet_int()) [L1101] COND FALSE !(__VERIFIER_nondet_int()) [L1117] COND FALSE !(__VERIFIER_nondet_int()) [L1133] COND FALSE !(__VERIFIER_nondet_int()) [L1149] COND FALSE !(__VERIFIER_nondet_int()) [L1165] COND FALSE !(__VERIFIER_nondet_int()) [L1181] COND FALSE !(__VERIFIER_nondet_int()) [L1197] COND FALSE !(__VERIFIER_nondet_int()) [L1213] COND FALSE !(__VERIFIER_nondet_int()) [L1229] COND FALSE !(__VERIFIER_nondet_int()) [L1245] COND FALSE !(__VERIFIER_nondet_int()) [L1261] COND FALSE !(__VERIFIER_nondet_int()) [L1277] COND FALSE !(__VERIFIER_nondet_int()) [L1293] COND FALSE !(__VERIFIER_nondet_int()) [L1309] COND FALSE !(__VERIFIER_nondet_int()) [L1325] COND FALSE !(__VERIFIER_nondet_int()) [L1341] COND FALSE !(__VERIFIER_nondet_int()) [L1357] COND FALSE !(__VERIFIER_nondet_int()) [L1373] COND FALSE !(__VERIFIER_nondet_int()) [L1389] COND FALSE !(__VERIFIER_nondet_int()) [L1405] COND FALSE !(__VERIFIER_nondet_int()) [L1421] COND FALSE !(__VERIFIER_nondet_int()) [L1437] COND FALSE !(__VERIFIER_nondet_int()) [L1453] COND FALSE !(__VERIFIER_nondet_int()) [L1469] COND FALSE !(__VERIFIER_nondet_int()) [L1485] COND FALSE !(__VERIFIER_nondet_int()) [L1501] COND FALSE !(__VERIFIER_nondet_int()) [L1517] COND FALSE !(__VERIFIER_nondet_int()) [L1533] COND FALSE !(__VERIFIER_nondet_int()) [L1549] COND FALSE !(__VERIFIER_nondet_int()) [L1565] COND FALSE !(__VERIFIER_nondet_int()) [L1581] COND FALSE !(__VERIFIER_nondet_int()) [L1597] COND FALSE !(__VERIFIER_nondet_int()) [L1613] COND FALSE !(__VERIFIER_nondet_int()) [L1629] COND FALSE !(__VERIFIER_nondet_int()) [L1645] COND FALSE !(__VERIFIER_nondet_int()) [L1661] COND FALSE !(__VERIFIER_nondet_int()) [L1677] COND FALSE !(__VERIFIER_nondet_int()) [L1693] COND FALSE !(__VERIFIER_nondet_int()) [L1709] COND FALSE !(__VERIFIER_nondet_int()) [L1725] COND FALSE !(__VERIFIER_nondet_int()) [L1741] COND FALSE !(__VERIFIER_nondet_int()) [L1757] COND FALSE !(__VERIFIER_nondet_int()) [L1773] COND FALSE !(__VERIFIER_nondet_int()) [L1789] COND FALSE !(__VERIFIER_nondet_int()) [L1805] COND FALSE !(__VERIFIER_nondet_int()) [L1821] COND FALSE !(__VERIFIER_nondet_int()) [L1837] COND FALSE !(__VERIFIER_nondet_int()) [L1853] COND FALSE !(__VERIFIER_nondet_int()) [L1869] COND FALSE !(__VERIFIER_nondet_int()) [L1885] COND FALSE !(__VERIFIER_nondet_int()) [L1901] COND FALSE !(__VERIFIER_nondet_int()) [L1917] COND FALSE !(__VERIFIER_nondet_int()) [L1933] COND FALSE !(__VERIFIER_nondet_int()) [L1949] COND FALSE !(__VERIFIER_nondet_int()) [L1965] COND FALSE !(__VERIFIER_nondet_int()) [L1981] COND FALSE !(__VERIFIER_nondet_int()) [L1997] COND FALSE !(__VERIFIER_nondet_int()) [L2013] COND FALSE !(__VERIFIER_nondet_int()) [L2029] COND FALSE !(__VERIFIER_nondet_int()) [L2045] COND FALSE !(__VERIFIER_nondet_int()) [L2061] COND FALSE !(__VERIFIER_nondet_int()) [L2077] COND TRUE __VERIFIER_nondet_int() [L2079] COND TRUE !(P1 != 0) [L2081] method_id = 56 VAL [m_bind=9, m_close=17, m_connect1_1=47, m_connect1_2=48, m_connect2_1=43, m_connect2_2=44, m_createImpl=24, m_getChannel=10, m_getImpl=12, m_getInetAddress=1, m_getInputStream=27, m_getKeepAlive=7, m_getLocalAddress=8, m_getLocalPort=3, m_getLocalSocketAddress=19, m_getOOBInline=2, m_getOutputStream=37, m_getPort=31, m_getReceiveBufferSize=20, m_getRemoteSocketAddress=40, m_getReuseAddress=23, m_getSendBufferSize=36, m_getSoLinger=11, m_getSoTimeout=14, m_getTcpNoDelay=13, m_getTrafficClass=22, m_isBound=34, m_isClosed=33, m_isConnected=6, m_isInputShutdown=4, m_isOutputShutdown=15, m_postAccept=16, m_sendUrgentData=32, m_setBound=35, m_setConnected=38, m_setCreated=25, m_setKeepAlive=26, m_setOOBInline=18, m_setPerformancePreferences=30, m_setReceiveBufferSize_1=41, m_setReceiveBufferSize_2=42, m_setReuseAddress=21, m_setSendBufferSize_1=53, m_setSendBufferSize_2=54, m_setSocketImplFactory_1=55, m_setSocketImplFactory_2=56, m_setSoLinger_1=45, m_setSoLinger_2=46, m_setSoTimeout_1=51, m_setSoTimeout_2=52, m_setTcpNoDelay=5, m_setTrafficClass_1=49, m_setTrafficClass_2=50, m_shutdownInput=29, m_shutdownOutput=28, m_Socket=39] [L2083] COND FALSE !(((this_factory != 0) && !(P30 != 0))) [L2087] q = 2 [L2089] this_factory=P30 [L2089] this_shutIn=this_shutIn [L2089] this_connected=this_connected [L2089] this_closed=this_closed [L2089] this_shutOut=this_shutOut [L2089] this_created=this_created [L2089] this_impl=this_impl [L2089] this_bound=this_bound [L2089] this_oldImpl=this_oldImpl VAL [m_bind=9, m_close=17, m_connect1_1=47, m_connect1_2=48, m_connect2_1=43, m_connect2_2=44, m_createImpl=24, m_getChannel=10, m_getImpl=12, m_getInetAddress=1, m_getInputStream=27, m_getKeepAlive=7, m_getLocalAddress=8, m_getLocalPort=3, m_getLocalSocketAddress=19, m_getOOBInline=2, m_getOutputStream=37, m_getPort=31, m_getReceiveBufferSize=20, m_getRemoteSocketAddress=40, m_getReuseAddress=23, m_getSendBufferSize=36, m_getSoLinger=11, m_getSoTimeout=14, m_getTcpNoDelay=13, m_getTrafficClass=22, m_isBound=34, m_isClosed=33, m_isConnected=6, m_isInputShutdown=4, m_isOutputShutdown=15, m_postAccept=16, m_sendUrgentData=32, m_setBound=35, m_setConnected=38, m_setCreated=25, m_setKeepAlive=26, m_setOOBInline=18, m_setPerformancePreferences=30, m_setReceiveBufferSize_1=41, m_setReceiveBufferSize_2=42, m_setReuseAddress=21, m_setSendBufferSize_1=53, m_setSendBufferSize_2=54, m_setSocketImplFactory_1=55, m_setSocketImplFactory_2=56, m_setSoLinger_1=45, m_setSoLinger_2=46, m_setSoTimeout_1=51, m_setSoTimeout_2=52, m_setTcpNoDelay=5, m_setTrafficClass_1=49, m_setTrafficClass_2=50, m_shutdownInput=29, m_shutdownOutput=28, m_Socket=39] [L80] COND TRUE 1 [L83] _Bool P1=__VERIFIER_nondet_int(); [L84] int P2=__VERIFIER_nondet_int(); [L85] _Bool P3=__VERIFIER_nondet_int(); [L86] _Bool P4=__VERIFIER_nondet_int(); [L87] _Bool P5=__VERIFIER_nondet_int(); [L88] _Bool P6=__VERIFIER_nondet_int(); [L89] int P7=__VERIFIER_nondet_int(); [L90] int P8=__VERIFIER_nondet_int(); [L91] int P9=__VERIFIER_nondet_int(); [L92] int P10=__VERIFIER_nondet_int(); [L93] int P11=__VERIFIER_nondet_int(); [L94] int P12=__VERIFIER_nondet_int(); [L95] int P13=__VERIFIER_nondet_int(); [L96] int P14=__VERIFIER_nondet_int(); [L97] int P15=__VERIFIER_nondet_int(); [L98] int P16=__VERIFIER_nondet_int(); [L99] _Bool P17=__VERIFIER_nondet_int(); [L100] int P18=__VERIFIER_nondet_int(); [L101] _Bool P19=__VERIFIER_nondet_int(); [L102] int P20=__VERIFIER_nondet_int(); [L103] int P21=__VERIFIER_nondet_int(); [L104] int P22=__VERIFIER_nondet_int(); [L105] int P23=__VERIFIER_nondet_int(); [L106] int P24=__VERIFIER_nondet_int(); [L107] int P25=__VERIFIER_nondet_int(); [L108] int P26=__VERIFIER_nondet_int(); [L109] int P27=__VERIFIER_nondet_int(); [L110] int P28=__VERIFIER_nondet_int(); [L111] int P29=__VERIFIER_nondet_int(); [L112] int P30=__VERIFIER_nondet_int(); [L116] COND FALSE !(q == 0) VAL [m_bind=9, m_close=17, m_connect1_1=47, m_connect1_2=48, m_connect2_1=43, m_connect2_2=44, m_createImpl=24, m_getChannel=10, m_getImpl=12, m_getInetAddress=1, m_getInputStream=27, m_getKeepAlive=7, m_getLocalAddress=8, m_getLocalPort=3, m_getLocalSocketAddress=19, m_getOOBInline=2, m_getOutputStream=37, m_getPort=31, m_getReceiveBufferSize=20, m_getRemoteSocketAddress=40, m_getReuseAddress=23, m_getSendBufferSize=36, m_getSoLinger=11, m_getSoTimeout=14, m_getTcpNoDelay=13, m_getTrafficClass=22, m_isBound=34, m_isClosed=33, m_isConnected=6, m_isInputShutdown=4, m_isOutputShutdown=15, m_postAccept=16, m_sendUrgentData=32, m_setBound=35, m_setConnected=38, m_setCreated=25, m_setKeepAlive=26, m_setOOBInline=18, m_setPerformancePreferences=30, m_setReceiveBufferSize_1=41, m_setReceiveBufferSize_2=42, m_setReuseAddress=21, m_setSendBufferSize_1=53, m_setSendBufferSize_2=54, m_setSocketImplFactory_1=55, m_setSocketImplFactory_2=56, m_setSoLinger_1=45, m_setSoLinger_2=46, m_setSoTimeout_1=51, m_setSoTimeout_2=52, m_setTcpNoDelay=5, m_setTrafficClass_1=49, m_setTrafficClass_2=50, m_shutdownInput=29, m_shutdownOutput=28, m_Socket=39] [L136] COND FALSE !(q == 1) VAL [m_bind=9, m_close=17, m_connect1_1=47, m_connect1_2=48, m_connect2_1=43, m_connect2_2=44, m_createImpl=24, m_getChannel=10, m_getImpl=12, m_getInetAddress=1, m_getInputStream=27, m_getKeepAlive=7, m_getLocalAddress=8, m_getLocalPort=3, m_getLocalSocketAddress=19, m_getOOBInline=2, m_getOutputStream=37, m_getPort=31, m_getReceiveBufferSize=20, m_getRemoteSocketAddress=40, m_getReuseAddress=23, m_getSendBufferSize=36, m_getSoLinger=11, m_getSoTimeout=14, m_getTcpNoDelay=13, m_getTrafficClass=22, m_isBound=34, m_isClosed=33, m_isConnected=6, m_isInputShutdown=4, m_isOutputShutdown=15, m_postAccept=16, m_sendUrgentData=32, m_setBound=35, m_setConnected=38, m_setCreated=25, m_setKeepAlive=26, m_setOOBInline=18, m_setPerformancePreferences=30, m_setReceiveBufferSize_1=41, m_setReceiveBufferSize_2=42, m_setReuseAddress=21, m_setSendBufferSize_1=53, m_setSendBufferSize_2=54, m_setSocketImplFactory_1=55, m_setSocketImplFactory_2=56, m_setSoLinger_1=45, m_setSoLinger_2=46, m_setSoTimeout_1=51, m_setSoTimeout_2=52, m_setTcpNoDelay=5, m_setTrafficClass_1=49, m_setTrafficClass_2=50, m_shutdownInput=29, m_shutdownOutput=28, m_Socket=39] [L748] COND TRUE q == 2 [L749] COND FALSE !(__VERIFIER_nondet_int()) [L765] COND FALSE !(__VERIFIER_nondet_int()) [L781] COND FALSE !(__VERIFIER_nondet_int()) [L797] COND FALSE !(__VERIFIER_nondet_int()) [L813] COND FALSE !(__VERIFIER_nondet_int()) [L829] COND FALSE !(__VERIFIER_nondet_int()) [L845] COND FALSE !(__VERIFIER_nondet_int()) [L861] COND FALSE !(__VERIFIER_nondet_int()) [L877] COND FALSE !(__VERIFIER_nondet_int()) [L893] COND FALSE !(__VERIFIER_nondet_int()) [L909] COND FALSE !(__VERIFIER_nondet_int()) [L925] COND FALSE !(__VERIFIER_nondet_int()) [L941] COND FALSE !(__VERIFIER_nondet_int()) [L957] COND FALSE !(__VERIFIER_nondet_int()) [L973] COND FALSE !(__VERIFIER_nondet_int()) [L989] COND FALSE !(__VERIFIER_nondet_int()) [L1005] COND FALSE !(__VERIFIER_nondet_int()) [L1021] COND FALSE !(__VERIFIER_nondet_int()) [L1037] COND FALSE !(__VERIFIER_nondet_int()) [L1053] COND FALSE !(__VERIFIER_nondet_int()) [L1069] COND FALSE !(__VERIFIER_nondet_int()) [L1085] COND FALSE !(__VERIFIER_nondet_int()) [L1101] COND FALSE !(__VERIFIER_nondet_int()) [L1117] COND FALSE !(__VERIFIER_nondet_int()) [L1133] COND FALSE !(__VERIFIER_nondet_int()) [L1149] COND FALSE !(__VERIFIER_nondet_int()) [L1165] COND FALSE !(__VERIFIER_nondet_int()) [L1181] COND FALSE !(__VERIFIER_nondet_int()) [L1197] COND FALSE !(__VERIFIER_nondet_int()) [L1213] COND FALSE !(__VERIFIER_nondet_int()) [L1229] COND FALSE !(__VERIFIER_nondet_int()) [L1245] COND FALSE !(__VERIFIER_nondet_int()) [L1261] COND FALSE !(__VERIFIER_nondet_int()) [L1277] COND FALSE !(__VERIFIER_nondet_int()) [L1293] COND FALSE !(__VERIFIER_nondet_int()) [L1309] COND FALSE !(__VERIFIER_nondet_int()) [L1325] COND FALSE !(__VERIFIER_nondet_int()) [L1341] COND FALSE !(__VERIFIER_nondet_int()) [L1357] COND FALSE !(__VERIFIER_nondet_int()) [L1373] COND FALSE !(__VERIFIER_nondet_int()) [L1389] COND FALSE !(__VERIFIER_nondet_int()) [L1405] COND FALSE !(__VERIFIER_nondet_int()) [L1421] COND FALSE !(__VERIFIER_nondet_int()) [L1437] COND FALSE !(__VERIFIER_nondet_int()) [L1453] COND FALSE !(__VERIFIER_nondet_int()) [L1469] COND FALSE !(__VERIFIER_nondet_int()) [L1485] COND FALSE !(__VERIFIER_nondet_int()) [L1501] COND FALSE !(__VERIFIER_nondet_int()) [L1517] COND FALSE !(__VERIFIER_nondet_int()) [L1533] COND FALSE !(__VERIFIER_nondet_int()) [L1549] COND FALSE !(__VERIFIER_nondet_int()) [L1565] COND FALSE !(__VERIFIER_nondet_int()) [L1581] COND FALSE !(__VERIFIER_nondet_int()) [L1597] COND FALSE !(__VERIFIER_nondet_int()) [L1613] COND FALSE !(__VERIFIER_nondet_int()) [L1629] COND FALSE !(__VERIFIER_nondet_int()) [L1645] COND FALSE !(__VERIFIER_nondet_int()) [L1661] COND FALSE !(__VERIFIER_nondet_int()) [L1677] COND FALSE !(__VERIFIER_nondet_int()) [L1693] COND FALSE !(__VERIFIER_nondet_int()) [L1709] COND FALSE !(__VERIFIER_nondet_int()) [L1725] COND FALSE !(__VERIFIER_nondet_int()) [L1741] COND FALSE !(__VERIFIER_nondet_int()) [L1757] COND FALSE !(__VERIFIER_nondet_int()) [L1773] COND FALSE !(__VERIFIER_nondet_int()) [L1789] COND FALSE !(__VERIFIER_nondet_int()) [L1805] COND FALSE !(__VERIFIER_nondet_int()) [L1821] COND FALSE !(__VERIFIER_nondet_int()) [L1837] COND FALSE !(__VERIFIER_nondet_int()) [L1853] COND FALSE !(__VERIFIER_nondet_int()) [L1869] COND FALSE !(__VERIFIER_nondet_int()) [L1885] COND FALSE !(__VERIFIER_nondet_int()) [L1901] COND FALSE !(__VERIFIER_nondet_int()) [L1917] COND FALSE !(__VERIFIER_nondet_int()) [L1933] COND FALSE !(__VERIFIER_nondet_int()) [L1949] COND FALSE !(__VERIFIER_nondet_int()) [L1965] COND FALSE !(__VERIFIER_nondet_int()) [L1981] COND FALSE !(__VERIFIER_nondet_int()) [L1997] COND FALSE !(__VERIFIER_nondet_int()) [L2013] COND FALSE !(__VERIFIER_nondet_int()) [L2029] COND FALSE !(__VERIFIER_nondet_int()) [L2045] COND FALSE !(__VERIFIER_nondet_int()) [L2061] COND TRUE __VERIFIER_nondet_int() [L2063] COND TRUE (P1 != 0) [L2065] method_id = 55 VAL [m_bind=9, m_close=17, m_connect1_1=47, m_connect1_2=48, m_connect2_1=43, m_connect2_2=44, m_createImpl=24, m_getChannel=10, m_getImpl=12, m_getInetAddress=1, m_getInputStream=27, m_getKeepAlive=7, m_getLocalAddress=8, m_getLocalPort=3, m_getLocalSocketAddress=19, m_getOOBInline=2, m_getOutputStream=37, m_getPort=31, m_getReceiveBufferSize=20, m_getRemoteSocketAddress=40, m_getReuseAddress=23, m_getSendBufferSize=36, m_getSoLinger=11, m_getSoTimeout=14, m_getTcpNoDelay=13, m_getTrafficClass=22, m_isBound=34, m_isClosed=33, m_isConnected=6, m_isInputShutdown=4, m_isOutputShutdown=15, m_postAccept=16, m_sendUrgentData=32, m_setBound=35, m_setConnected=38, m_setCreated=25, m_setKeepAlive=26, m_setOOBInline=18, m_setPerformancePreferences=30, m_setReceiveBufferSize_1=41, m_setReceiveBufferSize_2=42, m_setReuseAddress=21, m_setSendBufferSize_1=53, m_setSendBufferSize_2=54, m_setSocketImplFactory_1=55, m_setSocketImplFactory_2=56, m_setSoLinger_1=45, m_setSoLinger_2=46, m_setSoTimeout_1=51, m_setSoTimeout_2=52, m_setTcpNoDelay=5, m_setTrafficClass_1=49, m_setTrafficClass_2=50, m_shutdownInput=29, m_shutdownOutput=28, m_Socket=39] [L2067] COND TRUE ((this_factory != 0) && (P29 != 0)) VAL [m_bind=9, m_close=17, m_connect1_1=47, m_connect1_2=48, m_connect2_1=43, m_connect2_2=44, m_createImpl=24, m_getChannel=10, m_getImpl=12, m_getInetAddress=1, m_getInputStream=27, m_getKeepAlive=7, m_getLocalAddress=8, m_getLocalPort=3, m_getLocalSocketAddress=19, m_getOOBInline=2, m_getOutputStream=37, m_getPort=31, m_getReceiveBufferSize=20, m_getRemoteSocketAddress=40, m_getReuseAddress=23, m_getSendBufferSize=36, m_getSoLinger=11, m_getSoTimeout=14, m_getTcpNoDelay=13, m_getTrafficClass=22, m_isBound=34, m_isClosed=33, m_isConnected=6, m_isInputShutdown=4, m_isOutputShutdown=15, m_postAccept=16, m_sendUrgentData=32, m_setBound=35, m_setConnected=38, m_setCreated=25, m_setKeepAlive=26, m_setOOBInline=18, m_setPerformancePreferences=30, m_setReceiveBufferSize_1=41, m_setReceiveBufferSize_2=42, m_setReuseAddress=21, m_setSendBufferSize_1=53, m_setSendBufferSize_2=54, m_setSocketImplFactory_1=55, m_setSocketImplFactory_2=56, m_setSoLinger_1=45, m_setSoLinger_2=46, m_setSoTimeout_1=51, m_setSoTimeout_2=52, m_setTcpNoDelay=5, m_setTrafficClass_1=49, m_setTrafficClass_2=50, m_shutdownInput=29, m_shutdownOutput=28, m_Socket=39] [L49138] __VERIFIER_error() VAL [m_bind=9, m_close=17, m_connect1_1=47, m_connect1_2=48, m_connect2_1=43, m_connect2_2=44, m_createImpl=24, m_getChannel=10, m_getImpl=12, m_getInetAddress=1, m_getInputStream=27, m_getKeepAlive=7, m_getLocalAddress=8, m_getLocalPort=3, m_getLocalSocketAddress=19, m_getOOBInline=2, m_getOutputStream=37, m_getPort=31, m_getReceiveBufferSize=20, m_getRemoteSocketAddress=40, m_getReuseAddress=23, m_getSendBufferSize=36, m_getSoLinger=11, m_getSoTimeout=14, m_getTcpNoDelay=13, m_getTrafficClass=22, m_isBound=34, m_isClosed=33, m_isConnected=6, m_isInputShutdown=4, m_isOutputShutdown=15, m_postAccept=16, m_sendUrgentData=32, m_setBound=35, m_setConnected=38, m_setCreated=25, m_setKeepAlive=26, m_setOOBInline=18, m_setPerformancePreferences=30, m_setReceiveBufferSize_1=41, m_setReceiveBufferSize_2=42, m_setReuseAddress=21, m_setSendBufferSize_1=53, m_setSendBufferSize_2=54, m_setSocketImplFactory_1=55, m_setSocketImplFactory_2=56, m_setSoLinger_1=45, m_setSoLinger_2=46, m_setSoTimeout_1=51, m_setSoTimeout_2=52, m_setTcpNoDelay=5, m_setTrafficClass_1=49, m_setTrafficClass_2=50, m_shutdownInput=29, m_shutdownOutput=28, m_Socket=39] - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 9211 locations, 1 error locations. Result: UNSAFE, OverallTime: 114.6s, OverallIterations: 33, TraceHistogramMax: 4, AutomataDifference: 94.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 376273 SDtfs, 265731 SDslu, 249271 SDs, 0 SdLazy, 75777 SolverSat, 25856 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 67.4s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 107 GetRequests, 64 SyntacticMatches, 3 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=74946occurred in iteration=15, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 15.9s AutomataMinimizationTime, 32 MinimizatonAttempts, 28896 StatesRemovedByMinimization, 27 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.5s SsaConstructionTime, 0.7s SatisfiabilityAnalysisTime, 1.8s InterpolantComputationTime, 2863 NumberOfCodeBlocks, 2863 NumberOfCodeBlocksAsserted, 33 NumberOfCheckSat, 2643 ConstructedInterpolants, 0 QuantifiedInterpolants, 1771431 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 32 InterpolantComputations, 32 PerfectInterpolantSequences, 359/359 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...