./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/pthread-wmm/mix048_pso.opt.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version cad46833 Calling Ultimate with: /usr/lib/jvm/java-8-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/run_dir_e44fc151-c981-4b39-8bff-c707f8e364e7/bin/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/run_dir_e44fc151-c981-4b39-8bff-c707f8e364e7/bin/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_e44fc151-c981-4b39-8bff-c707f8e364e7/bin/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_e44fc151-c981-4b39-8bff-c707f8e364e7/bin/uautomizer/config/AutomizerReach.xml -i ../../sv-benchmarks/c/pthread-wmm/mix048_pso.opt.i -s /tmp/vcloud-vcloud-master/worker/run_dir_e44fc151-c981-4b39-8bff-c707f8e364e7/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_e44fc151-c981-4b39-8bff-c707f8e364e7/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 711257b3ee0c9d02c2ed443d9c0f84975558d4c1 ............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... 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-cad4683 [2019-11-16 00:16:46,184 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-16 00:16:46,186 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-16 00:16:46,200 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-16 00:16:46,201 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-16 00:16:46,202 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-16 00:16:46,204 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-16 00:16:46,215 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-16 00:16:46,217 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-16 00:16:46,218 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-16 00:16:46,218 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-16 00:16:46,219 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-16 00:16:46,219 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-16 00:16:46,220 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-16 00:16:46,221 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-16 00:16:46,221 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-16 00:16:46,222 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-16 00:16:46,223 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-16 00:16:46,224 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-16 00:16:46,226 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-16 00:16:46,228 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-16 00:16:46,229 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-16 00:16:46,230 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-16 00:16:46,230 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-16 00:16:46,233 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-16 00:16:46,233 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-16 00:16:46,233 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-16 00:16:46,234 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-16 00:16:46,235 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-16 00:16:46,236 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-16 00:16:46,236 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-16 00:16:46,236 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-16 00:16:46,237 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-16 00:16:46,238 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-16 00:16:46,239 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-16 00:16:46,239 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-16 00:16:46,239 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-16 00:16:46,240 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-16 00:16:46,240 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-16 00:16:46,241 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-16 00:16:46,241 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-16 00:16:46,242 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_e44fc151-c981-4b39-8bff-c707f8e364e7/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf [2019-11-16 00:16:46,255 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-16 00:16:46,256 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-16 00:16:46,257 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-16 00:16:46,257 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-16 00:16:46,257 INFO L138 SettingsManager]: * Use SBE=true [2019-11-16 00:16:46,258 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-16 00:16:46,258 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-16 00:16:46,258 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-16 00:16:46,258 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-16 00:16:46,258 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-16 00:16:46,259 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-11-16 00:16:46,259 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-16 00:16:46,259 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-11-16 00:16:46,259 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-16 00:16:46,260 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-16 00:16:46,260 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-16 00:16:46,260 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-11-16 00:16:46,260 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-16 00:16:46,261 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-16 00:16:46,261 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-16 00:16:46,261 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-16 00:16:46,261 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-16 00:16:46,262 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-16 00:16:46,262 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-16 00:16:46,262 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-11-16 00:16:46,262 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-11-16 00:16:46,262 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-11-16 00:16:46,263 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-11-16 00:16:46,263 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_e44fc151-c981-4b39-8bff-c707f8e364e7/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 -> 711257b3ee0c9d02c2ed443d9c0f84975558d4c1 [2019-11-16 00:16:46,291 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-16 00:16:46,302 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-16 00:16:46,305 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-16 00:16:46,307 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-16 00:16:46,307 INFO L275 PluginConnector]: CDTParser initialized [2019-11-16 00:16:46,308 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_e44fc151-c981-4b39-8bff-c707f8e364e7/bin/uautomizer/../../sv-benchmarks/c/pthread-wmm/mix048_pso.opt.i [2019-11-16 00:16:46,359 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_e44fc151-c981-4b39-8bff-c707f8e364e7/bin/uautomizer/data/e969fd22e/b37ef42f85ec4d9aa8cdd351049ec24b/FLAGf3b6bf9fc [2019-11-16 00:16:46,835 INFO L306 CDTParser]: Found 1 translation units. [2019-11-16 00:16:46,846 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_e44fc151-c981-4b39-8bff-c707f8e364e7/sv-benchmarks/c/pthread-wmm/mix048_pso.opt.i [2019-11-16 00:16:46,867 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_e44fc151-c981-4b39-8bff-c707f8e364e7/bin/uautomizer/data/e969fd22e/b37ef42f85ec4d9aa8cdd351049ec24b/FLAGf3b6bf9fc [2019-11-16 00:16:47,378 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_e44fc151-c981-4b39-8bff-c707f8e364e7/bin/uautomizer/data/e969fd22e/b37ef42f85ec4d9aa8cdd351049ec24b [2019-11-16 00:16:47,381 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-16 00:16:47,383 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-11-16 00:16:47,383 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-16 00:16:47,384 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-16 00:16:47,387 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-16 00:16:47,388 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.11 12:16:47" (1/1) ... [2019-11-16 00:16:47,391 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4f6156a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:16:47, skipping insertion in model container [2019-11-16 00:16:47,391 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.11 12:16:47" (1/1) ... [2019-11-16 00:16:47,399 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-11-16 00:16:47,440 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-11-16 00:16:47,866 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-16 00:16:47,879 INFO L188 MainTranslator]: Completed pre-run [2019-11-16 00:16:47,938 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-16 00:16:48,015 INFO L192 MainTranslator]: Completed translation [2019-11-16 00:16:48,016 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:16:48 WrapperNode [2019-11-16 00:16:48,016 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-16 00:16:48,017 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-11-16 00:16:48,017 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-11-16 00:16:48,017 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-11-16 00:16:48,024 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:16:48" (1/1) ... [2019-11-16 00:16:48,046 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:16:48" (1/1) ... [2019-11-16 00:16:48,079 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-11-16 00:16:48,079 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-16 00:16:48,079 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-16 00:16:48,079 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-16 00:16:48,090 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:16:48" (1/1) ... [2019-11-16 00:16:48,090 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:16:48" (1/1) ... [2019-11-16 00:16:48,106 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:16:48" (1/1) ... [2019-11-16 00:16:48,107 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:16:48" (1/1) ... [2019-11-16 00:16:48,125 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:16:48" (1/1) ... [2019-11-16 00:16:48,130 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:16:48" (1/1) ... [2019-11-16 00:16:48,133 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:16:48" (1/1) ... [2019-11-16 00:16:48,138 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-16 00:16:48,138 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-16 00:16:48,139 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-16 00:16:48,139 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-16 00:16:48,140 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:16:48" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_e44fc151-c981-4b39-8bff-c707f8e364e7/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-16 00:16:48,223 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-11-16 00:16:48,223 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2019-11-16 00:16:48,224 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-11-16 00:16:48,224 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-11-16 00:16:48,225 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2019-11-16 00:16:48,226 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2019-11-16 00:16:48,226 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2019-11-16 00:16:48,226 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2019-11-16 00:16:48,226 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2019-11-16 00:16:48,227 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-16 00:16:48,229 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-16 00:16:48,231 WARN L202 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2019-11-16 00:16:49,026 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-16 00:16:49,026 INFO L284 CfgBuilder]: Removed 8 assume(true) statements. [2019-11-16 00:16:49,028 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.11 12:16:49 BoogieIcfgContainer [2019-11-16 00:16:49,028 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-16 00:16:49,029 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-16 00:16:49,029 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-16 00:16:49,032 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-16 00:16:49,032 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 16.11 12:16:47" (1/3) ... [2019-11-16 00:16:49,033 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@12dfb4ca and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.11 12:16:49, skipping insertion in model container [2019-11-16 00:16:49,033 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:16:48" (2/3) ... [2019-11-16 00:16:49,033 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@12dfb4ca and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.11 12:16:49, skipping insertion in model container [2019-11-16 00:16:49,033 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.11 12:16:49" (3/3) ... [2019-11-16 00:16:49,035 INFO L109 eAbstractionObserver]: Analyzing ICFG mix048_pso.opt.i [2019-11-16 00:16:49,074 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:16:49,074 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:16:49,075 WARN L315 ript$VariableManager]: TermVariabe Thread0_P0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:16:49,075 WARN L315 ript$VariableManager]: TermVariabe Thread0_P0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:16:49,075 WARN L315 ript$VariableManager]: TermVariabe Thread0_P0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:16:49,075 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:16:49,076 WARN L315 ript$VariableManager]: TermVariabe Thread0_P0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:16:49,076 WARN L315 ript$VariableManager]: TermVariabe Thread0_P0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:16:49,076 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:16:49,076 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:16:49,077 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:16:49,077 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:16:49,077 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:16:49,077 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:16:49,077 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:16:49,078 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:16:49,078 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:16:49,078 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:16:49,078 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:16:49,078 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:16:49,079 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:16:49,079 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:16:49,079 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:16:49,079 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:16:49,080 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:16:49,080 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:16:49,080 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:16:49,080 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:16:49,081 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:16:49,081 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:16:49,081 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:16:49,081 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:16:49,081 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:16:49,082 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:16:49,083 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:16:49,083 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:16:49,083 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:16:49,083 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:16:49,084 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:16:49,084 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:16:49,084 WARN L315 ript$VariableManager]: TermVariabe Thread1_P1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:16:49,084 WARN L315 ript$VariableManager]: TermVariabe Thread1_P1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:16:49,084 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:16:49,085 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:16:49,085 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:16:49,085 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:16:49,085 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:16:49,086 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:16:49,086 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:16:49,086 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:16:49,086 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:16:49,087 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:16:49,087 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:16:49,087 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:16:49,087 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:16:49,087 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:16:49,088 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:16:49,088 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:16:49,088 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:16:49,088 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:16:49,088 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:16:49,089 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:16:49,089 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:16:49,089 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:16:49,089 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:16:49,090 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:16:49,090 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:16:49,090 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:16:49,090 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:16:49,091 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:16:49,091 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:16:49,091 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:16:49,091 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:16:49,091 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:16:49,092 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:16:49,092 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:16:49,092 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:16:49,092 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:16:49,093 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:16:49,093 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:16:49,093 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:16:49,093 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:16:49,093 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:16:49,094 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:16:49,094 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:16:49,094 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:16:49,094 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:16:49,094 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:16:49,095 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:16:49,095 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:16:49,095 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:16:49,095 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:16:49,096 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:16:49,096 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:16:49,096 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:16:49,096 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:16:49,096 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:16:49,097 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:16:49,097 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:16:49,097 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:16:49,097 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:16:49,098 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:16:49,098 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:16:49,098 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:16:49,098 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:16:49,098 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:16:49,099 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:16:49,099 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:16:49,099 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:16:49,099 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:16:49,100 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:16:49,100 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:16:49,100 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:16:49,100 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:16:49,100 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:16:49,101 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:16:49,101 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:16:49,101 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:16:49,101 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:16:49,101 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:16:49,102 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:16:49,102 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:16:49,102 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:16:49,102 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:16:49,103 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:16:49,103 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:16:49,103 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:16:49,103 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:16:49,103 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:16:49,104 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:16:49,104 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:16:49,104 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:16:49,104 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:16:49,104 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:16:49,105 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:16:49,105 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:16:49,105 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:16:49,105 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:16:49,105 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:16:49,106 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:16:49,106 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:16:49,106 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:16:49,106 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:16:49,107 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:16:49,107 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:16:49,107 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:16:49,107 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:16:49,107 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:16:49,108 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:16:49,108 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:16:49,108 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:16:49,108 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:16:49,114 WARN L141 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-11-16 00:16:49,114 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-16 00:16:49,122 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 3 error locations. [2019-11-16 00:16:49,132 INFO L249 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2019-11-16 00:16:49,149 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-16 00:16:49,149 INFO L374 AbstractCegarLoop]: Hoare is true [2019-11-16 00:16:49,149 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-16 00:16:49,149 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-16 00:16:49,149 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-16 00:16:49,149 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-16 00:16:49,150 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-16 00:16:49,150 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-16 00:16:49,162 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 140 places, 178 transitions [2019-11-16 00:16:51,872 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 32590 states. [2019-11-16 00:16:51,874 INFO L276 IsEmpty]: Start isEmpty. Operand 32590 states. [2019-11-16 00:16:51,882 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2019-11-16 00:16:51,882 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:16:51,883 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-16 00:16:51,885 INFO L410 AbstractCegarLoop]: === Iteration 1 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:16:51,890 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:16:51,891 INFO L82 PathProgramCache]: Analyzing trace with hash -254800073, now seen corresponding path program 1 times [2019-11-16 00:16:51,899 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:16:51,899 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1468144841] [2019-11-16 00:16:51,900 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:16:51,900 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:16:51,900 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:16:52,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:16:52,170 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-16 00:16:52,171 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1468144841] [2019-11-16 00:16:52,172 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:16:52,172 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-16 00:16:52,172 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [329879285] [2019-11-16 00:16:52,176 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-16 00:16:52,177 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:16:52,188 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-16 00:16:52,189 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-16 00:16:52,190 INFO L87 Difference]: Start difference. First operand 32590 states. Second operand 4 states. [2019-11-16 00:16:52,943 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:16:52,943 INFO L93 Difference]: Finished difference Result 33590 states and 129567 transitions. [2019-11-16 00:16:52,944 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-16 00:16:52,945 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 33 [2019-11-16 00:16:52,946 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:16:53,209 INFO L225 Difference]: With dead ends: 33590 [2019-11-16 00:16:53,210 INFO L226 Difference]: Without dead ends: 25702 [2019-11-16 00:16:53,212 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-16 00:16:53,569 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25702 states. [2019-11-16 00:16:54,627 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25702 to 25702. [2019-11-16 00:16:54,629 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25702 states. [2019-11-16 00:16:54,938 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25702 states to 25702 states and 99583 transitions. [2019-11-16 00:16:54,939 INFO L78 Accepts]: Start accepts. Automaton has 25702 states and 99583 transitions. Word has length 33 [2019-11-16 00:16:54,940 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:16:54,940 INFO L462 AbstractCegarLoop]: Abstraction has 25702 states and 99583 transitions. [2019-11-16 00:16:54,940 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-16 00:16:54,940 INFO L276 IsEmpty]: Start isEmpty. Operand 25702 states and 99583 transitions. [2019-11-16 00:16:54,959 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2019-11-16 00:16:54,959 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:16:54,960 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-16 00:16:54,960 INFO L410 AbstractCegarLoop]: === Iteration 2 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:16:54,961 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:16:54,961 INFO L82 PathProgramCache]: Analyzing trace with hash -250081261, now seen corresponding path program 1 times [2019-11-16 00:16:54,961 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:16:54,962 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [350623225] [2019-11-16 00:16:54,962 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:16:54,962 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:16:54,962 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:16:55,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:16:55,149 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-16 00:16:55,150 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [350623225] [2019-11-16 00:16:55,151 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:16:55,151 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-16 00:16:55,151 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [246647700] [2019-11-16 00:16:55,154 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-16 00:16:55,154 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:16:55,154 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-16 00:16:55,155 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-16 00:16:55,155 INFO L87 Difference]: Start difference. First operand 25702 states and 99583 transitions. Second operand 5 states. [2019-11-16 00:16:56,219 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:16:56,219 INFO L93 Difference]: Finished difference Result 41080 states and 150430 transitions. [2019-11-16 00:16:56,220 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-11-16 00:16:56,220 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 45 [2019-11-16 00:16:56,221 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:16:56,408 INFO L225 Difference]: With dead ends: 41080 [2019-11-16 00:16:56,409 INFO L226 Difference]: Without dead ends: 40544 [2019-11-16 00:16:56,410 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2019-11-16 00:16:56,670 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40544 states. [2019-11-16 00:16:57,828 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40544 to 38924. [2019-11-16 00:16:57,829 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38924 states. [2019-11-16 00:16:57,941 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38924 states to 38924 states and 143580 transitions. [2019-11-16 00:16:57,942 INFO L78 Accepts]: Start accepts. Automaton has 38924 states and 143580 transitions. Word has length 45 [2019-11-16 00:16:57,943 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:16:57,944 INFO L462 AbstractCegarLoop]: Abstraction has 38924 states and 143580 transitions. [2019-11-16 00:16:57,944 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-16 00:16:57,944 INFO L276 IsEmpty]: Start isEmpty. Operand 38924 states and 143580 transitions. [2019-11-16 00:16:57,952 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2019-11-16 00:16:57,953 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:16:57,953 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-16 00:16:57,953 INFO L410 AbstractCegarLoop]: === Iteration 3 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:16:57,954 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:16:57,954 INFO L82 PathProgramCache]: Analyzing trace with hash -1037182150, now seen corresponding path program 1 times [2019-11-16 00:16:57,954 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:16:57,954 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [240305564] [2019-11-16 00:16:57,955 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:16:57,955 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:16:57,955 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:16:57,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:16:58,042 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-16 00:16:58,043 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [240305564] [2019-11-16 00:16:58,043 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:16:58,043 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-16 00:16:58,043 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [308089288] [2019-11-16 00:16:58,044 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-16 00:16:58,044 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:16:58,044 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-16 00:16:58,044 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-16 00:16:58,045 INFO L87 Difference]: Start difference. First operand 38924 states and 143580 transitions. Second operand 5 states. [2019-11-16 00:16:58,687 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:16:58,687 INFO L93 Difference]: Finished difference Result 49777 states and 180632 transitions. [2019-11-16 00:16:58,688 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-11-16 00:16:58,688 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 46 [2019-11-16 00:16:58,689 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:16:58,974 INFO L225 Difference]: With dead ends: 49777 [2019-11-16 00:16:58,974 INFO L226 Difference]: Without dead ends: 49273 [2019-11-16 00:16:58,975 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2019-11-16 00:16:59,316 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49273 states. [2019-11-16 00:17:00,611 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49273 to 42676. [2019-11-16 00:17:00,611 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42676 states. [2019-11-16 00:17:00,718 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42676 states to 42676 states and 156591 transitions. [2019-11-16 00:17:00,718 INFO L78 Accepts]: Start accepts. Automaton has 42676 states and 156591 transitions. Word has length 46 [2019-11-16 00:17:00,718 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:17:00,719 INFO L462 AbstractCegarLoop]: Abstraction has 42676 states and 156591 transitions. [2019-11-16 00:17:00,719 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-16 00:17:00,719 INFO L276 IsEmpty]: Start isEmpty. Operand 42676 states and 156591 transitions. [2019-11-16 00:17:00,730 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2019-11-16 00:17:00,730 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:17:00,731 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-16 00:17:00,731 INFO L410 AbstractCegarLoop]: === Iteration 4 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:17:00,731 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:17:00,732 INFO L82 PathProgramCache]: Analyzing trace with hash 671596896, now seen corresponding path program 1 times [2019-11-16 00:17:00,732 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:17:00,732 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [755198917] [2019-11-16 00:17:00,732 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:17:00,733 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:17:00,733 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:17:00,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:17:00,780 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-16 00:17:00,780 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [755198917] [2019-11-16 00:17:00,781 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:17:00,781 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-16 00:17:00,781 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [230201362] [2019-11-16 00:17:00,781 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-16 00:17:00,782 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:17:00,782 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-16 00:17:00,782 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-16 00:17:00,782 INFO L87 Difference]: Start difference. First operand 42676 states and 156591 transitions. Second operand 3 states. [2019-11-16 00:17:01,153 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:17:01,153 INFO L93 Difference]: Finished difference Result 61086 states and 221429 transitions. [2019-11-16 00:17:01,154 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-16 00:17:01,155 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 48 [2019-11-16 00:17:01,157 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:17:01,356 INFO L225 Difference]: With dead ends: 61086 [2019-11-16 00:17:01,357 INFO L226 Difference]: Without dead ends: 61086 [2019-11-16 00:17:01,357 INFO L600 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-16 00:17:02,453 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61086 states. [2019-11-16 00:17:03,044 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61086 to 48015. [2019-11-16 00:17:03,044 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48015 states. [2019-11-16 00:17:03,163 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48015 states to 48015 states and 174178 transitions. [2019-11-16 00:17:03,164 INFO L78 Accepts]: Start accepts. Automaton has 48015 states and 174178 transitions. Word has length 48 [2019-11-16 00:17:03,164 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:17:03,164 INFO L462 AbstractCegarLoop]: Abstraction has 48015 states and 174178 transitions. [2019-11-16 00:17:03,164 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-16 00:17:03,164 INFO L276 IsEmpty]: Start isEmpty. Operand 48015 states and 174178 transitions. [2019-11-16 00:17:03,181 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2019-11-16 00:17:03,181 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:17:03,182 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-16 00:17:03,182 INFO L410 AbstractCegarLoop]: === Iteration 5 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:17:03,182 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:17:03,183 INFO L82 PathProgramCache]: Analyzing trace with hash -934557998, now seen corresponding path program 1 times [2019-11-16 00:17:03,183 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:17:03,183 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1746447613] [2019-11-16 00:17:03,183 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:17:03,183 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:17:03,184 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:17:03,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:17:03,341 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-16 00:17:03,341 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1746447613] [2019-11-16 00:17:03,342 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:17:03,342 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-11-16 00:17:03,342 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1036729649] [2019-11-16 00:17:03,343 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-16 00:17:03,343 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:17:03,343 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-16 00:17:03,343 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-11-16 00:17:03,344 INFO L87 Difference]: Start difference. First operand 48015 states and 174178 transitions. Second operand 6 states. [2019-11-16 00:17:04,334 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:17:04,335 INFO L93 Difference]: Finished difference Result 63755 states and 229378 transitions. [2019-11-16 00:17:04,335 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-11-16 00:17:04,335 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 52 [2019-11-16 00:17:04,335 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:17:04,509 INFO L225 Difference]: With dead ends: 63755 [2019-11-16 00:17:04,510 INFO L226 Difference]: Without dead ends: 63755 [2019-11-16 00:17:04,510 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2019-11-16 00:17:04,839 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63755 states. [2019-11-16 00:17:06,636 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63755 to 59948. [2019-11-16 00:17:06,636 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 59948 states. [2019-11-16 00:17:06,785 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59948 states to 59948 states and 215671 transitions. [2019-11-16 00:17:06,785 INFO L78 Accepts]: Start accepts. Automaton has 59948 states and 215671 transitions. Word has length 52 [2019-11-16 00:17:06,786 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:17:06,786 INFO L462 AbstractCegarLoop]: Abstraction has 59948 states and 215671 transitions. [2019-11-16 00:17:06,786 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-16 00:17:06,786 INFO L276 IsEmpty]: Start isEmpty. Operand 59948 states and 215671 transitions. [2019-11-16 00:17:06,805 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2019-11-16 00:17:06,806 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:17:06,806 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-16 00:17:06,806 INFO L410 AbstractCegarLoop]: === Iteration 6 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:17:06,807 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:17:06,807 INFO L82 PathProgramCache]: Analyzing trace with hash 1563457939, now seen corresponding path program 1 times [2019-11-16 00:17:06,807 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:17:06,807 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [39621492] [2019-11-16 00:17:06,808 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:17:06,808 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:17:06,808 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:17:06,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:17:06,914 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-16 00:17:06,915 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [39621492] [2019-11-16 00:17:06,915 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:17:06,915 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-11-16 00:17:06,915 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [654478293] [2019-11-16 00:17:06,915 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-11-16 00:17:06,916 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:17:06,916 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-11-16 00:17:06,916 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2019-11-16 00:17:06,916 INFO L87 Difference]: Start difference. First operand 59948 states and 215671 transitions. Second operand 7 states. [2019-11-16 00:17:08,177 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:17:08,178 INFO L93 Difference]: Finished difference Result 83684 states and 290096 transitions. [2019-11-16 00:17:08,178 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-11-16 00:17:08,178 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 52 [2019-11-16 00:17:08,179 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:17:08,368 INFO L225 Difference]: With dead ends: 83684 [2019-11-16 00:17:08,368 INFO L226 Difference]: Without dead ends: 83684 [2019-11-16 00:17:08,369 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2019-11-16 00:17:08,739 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83684 states. [2019-11-16 00:17:14,139 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83684 to 71011. [2019-11-16 00:17:14,139 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 71011 states. [2019-11-16 00:17:14,324 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71011 states to 71011 states and 249885 transitions. [2019-11-16 00:17:14,324 INFO L78 Accepts]: Start accepts. Automaton has 71011 states and 249885 transitions. Word has length 52 [2019-11-16 00:17:14,324 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:17:14,325 INFO L462 AbstractCegarLoop]: Abstraction has 71011 states and 249885 transitions. [2019-11-16 00:17:14,325 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-11-16 00:17:14,325 INFO L276 IsEmpty]: Start isEmpty. Operand 71011 states and 249885 transitions. [2019-11-16 00:17:14,339 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2019-11-16 00:17:14,339 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:17:14,340 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-16 00:17:14,340 INFO L410 AbstractCegarLoop]: === Iteration 7 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:17:14,340 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:17:14,341 INFO L82 PathProgramCache]: Analyzing trace with hash -1844005676, now seen corresponding path program 1 times [2019-11-16 00:17:14,341 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:17:14,341 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1257168638] [2019-11-16 00:17:14,341 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:17:14,341 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:17:14,341 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:17:14,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:17:14,408 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-16 00:17:14,408 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1257168638] [2019-11-16 00:17:14,409 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:17:14,409 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-16 00:17:14,409 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2016332133] [2019-11-16 00:17:14,409 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-16 00:17:14,409 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:17:14,410 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-16 00:17:14,410 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-16 00:17:14,410 INFO L87 Difference]: Start difference. First operand 71011 states and 249885 transitions. Second operand 3 states. [2019-11-16 00:17:14,721 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:17:14,721 INFO L93 Difference]: Finished difference Result 54020 states and 188917 transitions. [2019-11-16 00:17:14,722 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-16 00:17:14,722 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 52 [2019-11-16 00:17:14,722 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:17:14,844 INFO L225 Difference]: With dead ends: 54020 [2019-11-16 00:17:14,844 INFO L226 Difference]: Without dead ends: 54020 [2019-11-16 00:17:14,844 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-16 00:17:15,121 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54020 states. [2019-11-16 00:17:15,752 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54020 to 53405. [2019-11-16 00:17:15,752 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 53405 states. [2019-11-16 00:17:15,881 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53405 states to 53405 states and 187036 transitions. [2019-11-16 00:17:15,881 INFO L78 Accepts]: Start accepts. Automaton has 53405 states and 187036 transitions. Word has length 52 [2019-11-16 00:17:15,881 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:17:15,882 INFO L462 AbstractCegarLoop]: Abstraction has 53405 states and 187036 transitions. [2019-11-16 00:17:15,882 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-16 00:17:15,882 INFO L276 IsEmpty]: Start isEmpty. Operand 53405 states and 187036 transitions. [2019-11-16 00:17:15,895 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2019-11-16 00:17:15,895 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:17:15,895 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-16 00:17:15,896 INFO L410 AbstractCegarLoop]: === Iteration 8 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:17:15,896 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:17:15,896 INFO L82 PathProgramCache]: Analyzing trace with hash -456832597, now seen corresponding path program 1 times [2019-11-16 00:17:15,896 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:17:15,896 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1154648806] [2019-11-16 00:17:15,896 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:17:15,896 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:17:15,896 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:17:15,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:17:15,964 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-16 00:17:15,964 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1154648806] [2019-11-16 00:17:15,965 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:17:15,965 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-11-16 00:17:15,965 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1719657569] [2019-11-16 00:17:15,965 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-16 00:17:15,965 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:17:15,966 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-16 00:17:15,966 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-11-16 00:17:15,966 INFO L87 Difference]: Start difference. First operand 53405 states and 187036 transitions. Second operand 6 states. [2019-11-16 00:17:16,707 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:17:16,707 INFO L93 Difference]: Finished difference Result 68645 states and 237300 transitions. [2019-11-16 00:17:16,708 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-11-16 00:17:16,708 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 52 [2019-11-16 00:17:16,708 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:17:16,858 INFO L225 Difference]: With dead ends: 68645 [2019-11-16 00:17:16,858 INFO L226 Difference]: Without dead ends: 68077 [2019-11-16 00:17:16,858 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=49, Invalid=133, Unknown=0, NotChecked=0, Total=182 [2019-11-16 00:17:18,112 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68077 states. [2019-11-16 00:17:18,805 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68077 to 53489. [2019-11-16 00:17:18,806 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 53489 states. [2019-11-16 00:17:18,938 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53489 states to 53489 states and 187733 transitions. [2019-11-16 00:17:18,938 INFO L78 Accepts]: Start accepts. Automaton has 53489 states and 187733 transitions. Word has length 52 [2019-11-16 00:17:18,938 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:17:18,938 INFO L462 AbstractCegarLoop]: Abstraction has 53489 states and 187733 transitions. [2019-11-16 00:17:18,938 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-16 00:17:18,939 INFO L276 IsEmpty]: Start isEmpty. Operand 53489 states and 187733 transitions. [2019-11-16 00:17:18,951 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2019-11-16 00:17:18,951 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:17:18,951 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-16 00:17:18,952 INFO L410 AbstractCegarLoop]: === Iteration 9 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:17:18,952 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:17:18,952 INFO L82 PathProgramCache]: Analyzing trace with hash -1423918431, now seen corresponding path program 1 times [2019-11-16 00:17:18,952 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:17:18,953 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1251297022] [2019-11-16 00:17:18,953 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:17:18,953 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:17:18,953 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:17:18,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:17:19,075 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-16 00:17:19,078 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1251297022] [2019-11-16 00:17:19,079 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:17:19,079 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-11-16 00:17:19,080 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1635418812] [2019-11-16 00:17:19,080 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-16 00:17:19,082 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:17:19,082 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-16 00:17:19,083 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-11-16 00:17:19,083 INFO L87 Difference]: Start difference. First operand 53489 states and 187733 transitions. Second operand 6 states. [2019-11-16 00:17:19,984 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:17:19,985 INFO L93 Difference]: Finished difference Result 96424 states and 331752 transitions. [2019-11-16 00:17:19,985 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-11-16 00:17:19,985 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 53 [2019-11-16 00:17:19,986 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:17:20,265 INFO L225 Difference]: With dead ends: 96424 [2019-11-16 00:17:20,265 INFO L226 Difference]: Without dead ends: 96424 [2019-11-16 00:17:20,265 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2019-11-16 00:17:20,632 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96424 states. [2019-11-16 00:17:22,789 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96424 to 70773. [2019-11-16 00:17:22,789 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 70773 states. [2019-11-16 00:17:22,950 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70773 states to 70773 states and 244809 transitions. [2019-11-16 00:17:22,951 INFO L78 Accepts]: Start accepts. Automaton has 70773 states and 244809 transitions. Word has length 53 [2019-11-16 00:17:22,951 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:17:22,951 INFO L462 AbstractCegarLoop]: Abstraction has 70773 states and 244809 transitions. [2019-11-16 00:17:22,951 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-16 00:17:22,951 INFO L276 IsEmpty]: Start isEmpty. Operand 70773 states and 244809 transitions. [2019-11-16 00:17:22,962 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2019-11-16 00:17:22,962 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:17:22,962 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-16 00:17:22,962 INFO L410 AbstractCegarLoop]: === Iteration 10 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:17:22,962 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:17:22,962 INFO L82 PathProgramCache]: Analyzing trace with hash -536414750, now seen corresponding path program 1 times [2019-11-16 00:17:22,962 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:17:22,963 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [253145825] [2019-11-16 00:17:22,963 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:17:22,963 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:17:22,963 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:17:22,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:17:23,047 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-16 00:17:23,047 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [253145825] [2019-11-16 00:17:23,047 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:17:23,048 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-16 00:17:23,048 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [80152640] [2019-11-16 00:17:23,048 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-16 00:17:23,048 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:17:23,049 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-16 00:17:23,049 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-16 00:17:23,049 INFO L87 Difference]: Start difference. First operand 70773 states and 244809 transitions. Second operand 4 states. [2019-11-16 00:17:23,119 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:17:23,119 INFO L93 Difference]: Finished difference Result 12386 states and 37621 transitions. [2019-11-16 00:17:23,120 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-16 00:17:23,120 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 53 [2019-11-16 00:17:23,120 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:17:23,135 INFO L225 Difference]: With dead ends: 12386 [2019-11-16 00:17:23,135 INFO L226 Difference]: Without dead ends: 10681 [2019-11-16 00:17:23,136 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-16 00:17:23,159 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10681 states. [2019-11-16 00:17:23,260 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10681 to 10633. [2019-11-16 00:17:23,260 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10633 states. [2019-11-16 00:17:23,279 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10633 states to 10633 states and 31700 transitions. [2019-11-16 00:17:23,280 INFO L78 Accepts]: Start accepts. Automaton has 10633 states and 31700 transitions. Word has length 53 [2019-11-16 00:17:23,280 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:17:23,280 INFO L462 AbstractCegarLoop]: Abstraction has 10633 states and 31700 transitions. [2019-11-16 00:17:23,280 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-16 00:17:23,280 INFO L276 IsEmpty]: Start isEmpty. Operand 10633 states and 31700 transitions. [2019-11-16 00:17:23,283 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2019-11-16 00:17:23,283 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:17:23,283 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-16 00:17:23,283 INFO L410 AbstractCegarLoop]: === Iteration 11 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:17:23,284 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:17:23,284 INFO L82 PathProgramCache]: Analyzing trace with hash -257891193, now seen corresponding path program 1 times [2019-11-16 00:17:23,284 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:17:23,284 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1863253578] [2019-11-16 00:17:23,284 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:17:23,284 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:17:23,285 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:17:23,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:17:23,337 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-16 00:17:23,338 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1863253578] [2019-11-16 00:17:23,338 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:17:23,338 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-16 00:17:23,339 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1101121066] [2019-11-16 00:17:23,339 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-16 00:17:23,339 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:17:23,339 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-16 00:17:23,340 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-16 00:17:23,340 INFO L87 Difference]: Start difference. First operand 10633 states and 31700 transitions. Second operand 4 states. [2019-11-16 00:17:23,521 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:17:23,522 INFO L93 Difference]: Finished difference Result 12165 states and 36338 transitions. [2019-11-16 00:17:23,522 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-16 00:17:23,522 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 60 [2019-11-16 00:17:23,523 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:17:23,545 INFO L225 Difference]: With dead ends: 12165 [2019-11-16 00:17:23,545 INFO L226 Difference]: Without dead ends: 12165 [2019-11-16 00:17:23,546 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-16 00:17:23,580 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12165 states. [2019-11-16 00:17:23,710 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12165 to 10963. [2019-11-16 00:17:23,710 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10963 states. [2019-11-16 00:17:23,731 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10963 states to 10963 states and 32702 transitions. [2019-11-16 00:17:23,731 INFO L78 Accepts]: Start accepts. Automaton has 10963 states and 32702 transitions. Word has length 60 [2019-11-16 00:17:23,732 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:17:23,732 INFO L462 AbstractCegarLoop]: Abstraction has 10963 states and 32702 transitions. [2019-11-16 00:17:23,732 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-16 00:17:23,732 INFO L276 IsEmpty]: Start isEmpty. Operand 10963 states and 32702 transitions. [2019-11-16 00:17:23,735 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2019-11-16 00:17:23,735 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:17:23,735 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-16 00:17:23,735 INFO L410 AbstractCegarLoop]: === Iteration 12 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:17:23,736 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:17:23,736 INFO L82 PathProgramCache]: Analyzing trace with hash 1484919142, now seen corresponding path program 1 times [2019-11-16 00:17:23,736 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:17:23,736 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1450188567] [2019-11-16 00:17:23,736 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:17:23,736 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:17:23,736 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:17:23,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:17:23,811 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-16 00:17:23,812 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1450188567] [2019-11-16 00:17:23,812 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:17:23,812 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-11-16 00:17:23,813 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1327637476] [2019-11-16 00:17:23,813 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-16 00:17:23,813 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:17:23,814 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-16 00:17:23,814 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-11-16 00:17:23,814 INFO L87 Difference]: Start difference. First operand 10963 states and 32702 transitions. Second operand 6 states. [2019-11-16 00:17:24,265 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:17:24,265 INFO L93 Difference]: Finished difference Result 13789 states and 40570 transitions. [2019-11-16 00:17:24,266 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-11-16 00:17:24,266 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 60 [2019-11-16 00:17:24,266 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:17:24,287 INFO L225 Difference]: With dead ends: 13789 [2019-11-16 00:17:24,287 INFO L226 Difference]: Without dead ends: 13728 [2019-11-16 00:17:24,287 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=37, Invalid=95, Unknown=0, NotChecked=0, Total=132 [2019-11-16 00:17:24,315 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13728 states. [2019-11-16 00:17:24,452 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13728 to 12854. [2019-11-16 00:17:24,452 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12854 states. [2019-11-16 00:17:24,476 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12854 states to 12854 states and 38040 transitions. [2019-11-16 00:17:24,476 INFO L78 Accepts]: Start accepts. Automaton has 12854 states and 38040 transitions. Word has length 60 [2019-11-16 00:17:24,476 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:17:24,476 INFO L462 AbstractCegarLoop]: Abstraction has 12854 states and 38040 transitions. [2019-11-16 00:17:24,476 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-16 00:17:24,476 INFO L276 IsEmpty]: Start isEmpty. Operand 12854 states and 38040 transitions. [2019-11-16 00:17:24,482 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-11-16 00:17:24,482 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:17:24,482 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-16 00:17:24,483 INFO L410 AbstractCegarLoop]: === Iteration 13 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:17:24,483 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:17:24,483 INFO L82 PathProgramCache]: Analyzing trace with hash -1235676948, now seen corresponding path program 1 times [2019-11-16 00:17:24,483 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:17:24,483 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2095755563] [2019-11-16 00:17:24,483 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:17:24,484 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:17:24,484 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:17:24,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:17:24,548 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-16 00:17:24,548 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2095755563] [2019-11-16 00:17:24,548 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:17:24,549 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-16 00:17:24,549 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1203713512] [2019-11-16 00:17:24,549 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-16 00:17:24,549 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:17:24,549 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-16 00:17:24,549 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-16 00:17:24,550 INFO L87 Difference]: Start difference. First operand 12854 states and 38040 transitions. Second operand 4 states. [2019-11-16 00:17:24,859 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:17:24,859 INFO L93 Difference]: Finished difference Result 15947 states and 46763 transitions. [2019-11-16 00:17:24,859 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-16 00:17:24,859 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 66 [2019-11-16 00:17:24,860 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:17:24,882 INFO L225 Difference]: With dead ends: 15947 [2019-11-16 00:17:24,882 INFO L226 Difference]: Without dead ends: 15947 [2019-11-16 00:17:24,883 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 3 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-16 00:17:24,913 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15947 states. [2019-11-16 00:17:25,062 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15947 to 14216. [2019-11-16 00:17:25,062 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14216 states. [2019-11-16 00:17:25,089 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14216 states to 14216 states and 41815 transitions. [2019-11-16 00:17:25,089 INFO L78 Accepts]: Start accepts. Automaton has 14216 states and 41815 transitions. Word has length 66 [2019-11-16 00:17:25,089 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:17:25,089 INFO L462 AbstractCegarLoop]: Abstraction has 14216 states and 41815 transitions. [2019-11-16 00:17:25,089 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-16 00:17:25,090 INFO L276 IsEmpty]: Start isEmpty. Operand 14216 states and 41815 transitions. [2019-11-16 00:17:25,097 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-11-16 00:17:25,097 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:17:25,097 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-16 00:17:25,098 INFO L410 AbstractCegarLoop]: === Iteration 14 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:17:25,098 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:17:25,098 INFO L82 PathProgramCache]: Analyzing trace with hash 982081005, now seen corresponding path program 1 times [2019-11-16 00:17:25,098 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:17:25,098 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [347687552] [2019-11-16 00:17:25,098 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:17:25,098 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:17:25,099 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:17:25,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:17:25,191 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-16 00:17:25,191 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [347687552] [2019-11-16 00:17:25,192 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:17:25,192 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-11-16 00:17:25,192 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1511831890] [2019-11-16 00:17:25,192 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-16 00:17:25,192 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:17:25,193 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-16 00:17:25,193 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-11-16 00:17:25,193 INFO L87 Difference]: Start difference. First operand 14216 states and 41815 transitions. Second operand 6 states. [2019-11-16 00:17:25,689 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:17:25,690 INFO L93 Difference]: Finished difference Result 15413 states and 44700 transitions. [2019-11-16 00:17:25,690 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-11-16 00:17:25,690 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 66 [2019-11-16 00:17:25,690 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:17:25,712 INFO L225 Difference]: With dead ends: 15413 [2019-11-16 00:17:25,712 INFO L226 Difference]: Without dead ends: 15413 [2019-11-16 00:17:25,713 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2019-11-16 00:17:25,743 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15413 states. [2019-11-16 00:17:25,895 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15413 to 15089. [2019-11-16 00:17:25,895 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15089 states. [2019-11-16 00:17:25,923 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15089 states to 15089 states and 43878 transitions. [2019-11-16 00:17:25,923 INFO L78 Accepts]: Start accepts. Automaton has 15089 states and 43878 transitions. Word has length 66 [2019-11-16 00:17:25,923 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:17:25,924 INFO L462 AbstractCegarLoop]: Abstraction has 15089 states and 43878 transitions. [2019-11-16 00:17:25,924 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-16 00:17:25,924 INFO L276 IsEmpty]: Start isEmpty. Operand 15089 states and 43878 transitions. [2019-11-16 00:17:25,934 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-11-16 00:17:25,934 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:17:25,934 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-16 00:17:25,935 INFO L410 AbstractCegarLoop]: === Iteration 15 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:17:25,935 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:17:25,935 INFO L82 PathProgramCache]: Analyzing trace with hash 1943695022, now seen corresponding path program 1 times [2019-11-16 00:17:25,935 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:17:25,935 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1479280198] [2019-11-16 00:17:25,935 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:17:25,936 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:17:25,936 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:17:25,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:17:26,031 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-16 00:17:26,031 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1479280198] [2019-11-16 00:17:26,032 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:17:26,032 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-11-16 00:17:26,032 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [994621763] [2019-11-16 00:17:26,033 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-16 00:17:26,033 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:17:26,033 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-16 00:17:26,034 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-11-16 00:17:26,034 INFO L87 Difference]: Start difference. First operand 15089 states and 43878 transitions. Second operand 6 states. [2019-11-16 00:17:26,439 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:17:26,439 INFO L93 Difference]: Finished difference Result 17155 states and 48592 transitions. [2019-11-16 00:17:26,439 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-11-16 00:17:26,440 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 66 [2019-11-16 00:17:26,440 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:17:26,463 INFO L225 Difference]: With dead ends: 17155 [2019-11-16 00:17:26,463 INFO L226 Difference]: Without dead ends: 17155 [2019-11-16 00:17:26,463 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=26, Invalid=46, Unknown=0, NotChecked=0, Total=72 [2019-11-16 00:17:26,497 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17155 states. [2019-11-16 00:17:26,653 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17155 to 15619. [2019-11-16 00:17:26,653 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15619 states. [2019-11-16 00:17:26,681 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15619 states to 15619 states and 44726 transitions. [2019-11-16 00:17:26,681 INFO L78 Accepts]: Start accepts. Automaton has 15619 states and 44726 transitions. Word has length 66 [2019-11-16 00:17:26,681 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:17:26,681 INFO L462 AbstractCegarLoop]: Abstraction has 15619 states and 44726 transitions. [2019-11-16 00:17:26,681 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-16 00:17:26,682 INFO L276 IsEmpty]: Start isEmpty. Operand 15619 states and 44726 transitions. [2019-11-16 00:17:26,691 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-11-16 00:17:26,691 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:17:26,691 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-16 00:17:26,691 INFO L410 AbstractCegarLoop]: === Iteration 16 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:17:26,691 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:17:26,691 INFO L82 PathProgramCache]: Analyzing trace with hash -1106507793, now seen corresponding path program 1 times [2019-11-16 00:17:26,692 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:17:26,692 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [267888774] [2019-11-16 00:17:26,692 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:17:26,692 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:17:26,692 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:17:26,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:17:26,764 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-16 00:17:26,764 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [267888774] [2019-11-16 00:17:26,765 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:17:26,765 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-16 00:17:26,765 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [14334496] [2019-11-16 00:17:26,766 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-16 00:17:26,766 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:17:26,766 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-16 00:17:26,766 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-16 00:17:26,766 INFO L87 Difference]: Start difference. First operand 15619 states and 44726 transitions. Second operand 5 states. [2019-11-16 00:17:27,190 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:17:27,190 INFO L93 Difference]: Finished difference Result 19634 states and 55999 transitions. [2019-11-16 00:17:27,190 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-11-16 00:17:27,190 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 66 [2019-11-16 00:17:27,190 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:17:27,217 INFO L225 Difference]: With dead ends: 19634 [2019-11-16 00:17:27,217 INFO L226 Difference]: Without dead ends: 19634 [2019-11-16 00:17:27,217 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-11-16 00:17:27,253 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19634 states. [2019-11-16 00:17:27,432 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19634 to 18191. [2019-11-16 00:17:27,432 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18191 states. [2019-11-16 00:17:27,463 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18191 states to 18191 states and 51753 transitions. [2019-11-16 00:17:27,464 INFO L78 Accepts]: Start accepts. Automaton has 18191 states and 51753 transitions. Word has length 66 [2019-11-16 00:17:27,464 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:17:27,464 INFO L462 AbstractCegarLoop]: Abstraction has 18191 states and 51753 transitions. [2019-11-16 00:17:27,464 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-16 00:17:27,464 INFO L276 IsEmpty]: Start isEmpty. Operand 18191 states and 51753 transitions. [2019-11-16 00:17:27,472 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-11-16 00:17:27,473 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:17:27,473 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-16 00:17:27,473 INFO L410 AbstractCegarLoop]: === Iteration 17 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:17:27,473 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:17:27,474 INFO L82 PathProgramCache]: Analyzing trace with hash -1617041970, now seen corresponding path program 1 times [2019-11-16 00:17:27,474 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:17:27,474 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1111559126] [2019-11-16 00:17:27,474 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:17:27,475 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:17:27,475 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:17:27,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:17:27,540 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-16 00:17:27,540 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1111559126] [2019-11-16 00:17:27,540 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:17:27,541 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-16 00:17:27,541 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [917357931] [2019-11-16 00:17:27,541 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-16 00:17:27,541 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:17:27,542 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-16 00:17:27,542 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-16 00:17:27,542 INFO L87 Difference]: Start difference. First operand 18191 states and 51753 transitions. Second operand 4 states. [2019-11-16 00:17:28,122 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:17:28,122 INFO L93 Difference]: Finished difference Result 21605 states and 61304 transitions. [2019-11-16 00:17:28,123 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-16 00:17:28,123 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 66 [2019-11-16 00:17:28,123 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:17:28,154 INFO L225 Difference]: With dead ends: 21605 [2019-11-16 00:17:28,154 INFO L226 Difference]: Without dead ends: 21383 [2019-11-16 00:17:28,154 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-16 00:17:28,200 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21383 states. [2019-11-16 00:17:28,417 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21383 to 20513. [2019-11-16 00:17:28,417 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20513 states. [2019-11-16 00:17:28,455 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20513 states to 20513 states and 58140 transitions. [2019-11-16 00:17:28,456 INFO L78 Accepts]: Start accepts. Automaton has 20513 states and 58140 transitions. Word has length 66 [2019-11-16 00:17:28,456 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:17:28,456 INFO L462 AbstractCegarLoop]: Abstraction has 20513 states and 58140 transitions. [2019-11-16 00:17:28,456 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-16 00:17:28,456 INFO L276 IsEmpty]: Start isEmpty. Operand 20513 states and 58140 transitions. [2019-11-16 00:17:28,464 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-11-16 00:17:28,464 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:17:28,464 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-16 00:17:28,465 INFO L410 AbstractCegarLoop]: === Iteration 18 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:17:28,465 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:17:28,465 INFO L82 PathProgramCache]: Analyzing trace with hash -6529714, now seen corresponding path program 1 times [2019-11-16 00:17:28,465 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:17:28,466 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1211296690] [2019-11-16 00:17:28,466 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:17:28,466 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:17:28,466 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:17:28,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:17:28,596 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-16 00:17:28,597 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1211296690] [2019-11-16 00:17:28,597 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:17:28,597 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-11-16 00:17:28,597 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [334087867] [2019-11-16 00:17:28,597 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-11-16 00:17:28,597 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:17:28,597 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-11-16 00:17:28,597 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2019-11-16 00:17:28,598 INFO L87 Difference]: Start difference. First operand 20513 states and 58140 transitions. Second operand 9 states. [2019-11-16 00:17:29,637 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:17:29,637 INFO L93 Difference]: Finished difference Result 27608 states and 77920 transitions. [2019-11-16 00:17:29,637 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-11-16 00:17:29,637 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 66 [2019-11-16 00:17:29,638 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:17:29,686 INFO L225 Difference]: With dead ends: 27608 [2019-11-16 00:17:29,686 INFO L226 Difference]: Without dead ends: 27608 [2019-11-16 00:17:29,686 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 4 SyntacticMatches, 1 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=39, Invalid=93, Unknown=0, NotChecked=0, Total=132 [2019-11-16 00:17:29,737 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27608 states. [2019-11-16 00:17:29,998 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27608 to 23102. [2019-11-16 00:17:29,998 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23102 states. [2019-11-16 00:17:30,261 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23102 states to 23102 states and 65204 transitions. [2019-11-16 00:17:30,262 INFO L78 Accepts]: Start accepts. Automaton has 23102 states and 65204 transitions. Word has length 66 [2019-11-16 00:17:30,262 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:17:30,262 INFO L462 AbstractCegarLoop]: Abstraction has 23102 states and 65204 transitions. [2019-11-16 00:17:30,263 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-11-16 00:17:30,263 INFO L276 IsEmpty]: Start isEmpty. Operand 23102 states and 65204 transitions. [2019-11-16 00:17:30,270 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-11-16 00:17:30,270 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:17:30,270 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-16 00:17:30,270 INFO L410 AbstractCegarLoop]: === Iteration 19 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:17:30,270 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:17:30,271 INFO L82 PathProgramCache]: Analyzing trace with hash 880973967, now seen corresponding path program 1 times [2019-11-16 00:17:30,271 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:17:30,271 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [694183983] [2019-11-16 00:17:30,271 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:17:30,271 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:17:30,271 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:17:30,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:17:30,388 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-16 00:17:30,389 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [694183983] [2019-11-16 00:17:30,389 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:17:30,389 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-16 00:17:30,389 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1382036079] [2019-11-16 00:17:30,390 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-16 00:17:30,390 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:17:30,390 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-16 00:17:30,390 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-11-16 00:17:30,391 INFO L87 Difference]: Start difference. First operand 23102 states and 65204 transitions. Second operand 5 states. [2019-11-16 00:17:30,460 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:17:30,460 INFO L93 Difference]: Finished difference Result 6392 states and 15091 transitions. [2019-11-16 00:17:30,461 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-16 00:17:30,461 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 66 [2019-11-16 00:17:30,461 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:17:30,469 INFO L225 Difference]: With dead ends: 6392 [2019-11-16 00:17:30,469 INFO L226 Difference]: Without dead ends: 5432 [2019-11-16 00:17:30,469 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-11-16 00:17:30,481 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5432 states. [2019-11-16 00:17:30,534 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5432 to 4684. [2019-11-16 00:17:30,534 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4684 states. [2019-11-16 00:17:30,543 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4684 states to 4684 states and 10759 transitions. [2019-11-16 00:17:30,544 INFO L78 Accepts]: Start accepts. Automaton has 4684 states and 10759 transitions. Word has length 66 [2019-11-16 00:17:30,544 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:17:30,544 INFO L462 AbstractCegarLoop]: Abstraction has 4684 states and 10759 transitions. [2019-11-16 00:17:30,544 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-16 00:17:30,545 INFO L276 IsEmpty]: Start isEmpty. Operand 4684 states and 10759 transitions. [2019-11-16 00:17:30,549 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-11-16 00:17:30,550 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:17:30,550 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-16 00:17:30,550 INFO L410 AbstractCegarLoop]: === Iteration 20 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:17:30,551 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:17:30,551 INFO L82 PathProgramCache]: Analyzing trace with hash -1738873321, now seen corresponding path program 1 times [2019-11-16 00:17:30,551 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:17:30,551 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [193136461] [2019-11-16 00:17:30,551 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:17:30,552 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:17:30,552 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:17:30,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:17:30,580 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-16 00:17:30,580 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [193136461] [2019-11-16 00:17:30,580 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:17:30,581 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-16 00:17:30,581 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1374849615] [2019-11-16 00:17:30,581 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-16 00:17:30,582 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:17:30,582 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-16 00:17:30,582 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-16 00:17:30,582 INFO L87 Difference]: Start difference. First operand 4684 states and 10759 transitions. Second operand 3 states. [2019-11-16 00:17:30,626 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:17:30,626 INFO L93 Difference]: Finished difference Result 5801 states and 13142 transitions. [2019-11-16 00:17:30,627 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-16 00:17:30,627 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 66 [2019-11-16 00:17:30,627 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:17:30,633 INFO L225 Difference]: With dead ends: 5801 [2019-11-16 00:17:30,633 INFO L226 Difference]: Without dead ends: 5801 [2019-11-16 00:17:30,634 INFO L600 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-16 00:17:30,644 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5801 states. [2019-11-16 00:17:30,691 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5801 to 4607. [2019-11-16 00:17:30,691 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4607 states. [2019-11-16 00:17:30,698 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4607 states to 4607 states and 10306 transitions. [2019-11-16 00:17:30,699 INFO L78 Accepts]: Start accepts. Automaton has 4607 states and 10306 transitions. Word has length 66 [2019-11-16 00:17:30,699 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:17:30,699 INFO L462 AbstractCegarLoop]: Abstraction has 4607 states and 10306 transitions. [2019-11-16 00:17:30,699 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-16 00:17:30,699 INFO L276 IsEmpty]: Start isEmpty. Operand 4607 states and 10306 transitions. [2019-11-16 00:17:30,704 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2019-11-16 00:17:30,704 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:17:30,704 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-16 00:17:30,704 INFO L410 AbstractCegarLoop]: === Iteration 21 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:17:30,705 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:17:30,705 INFO L82 PathProgramCache]: Analyzing trace with hash 1014352042, now seen corresponding path program 1 times [2019-11-16 00:17:30,705 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:17:30,705 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [545794467] [2019-11-16 00:17:30,705 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:17:30,706 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:17:30,706 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:17:30,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:17:30,767 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-16 00:17:30,767 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [545794467] [2019-11-16 00:17:30,768 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:17:30,768 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-16 00:17:30,768 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [750781646] [2019-11-16 00:17:30,769 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-16 00:17:30,769 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:17:30,769 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-16 00:17:30,772 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-16 00:17:30,772 INFO L87 Difference]: Start difference. First operand 4607 states and 10306 transitions. Second operand 5 states. [2019-11-16 00:17:30,990 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:17:30,991 INFO L93 Difference]: Finished difference Result 5678 states and 12754 transitions. [2019-11-16 00:17:30,991 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-11-16 00:17:30,991 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 72 [2019-11-16 00:17:30,991 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:17:30,999 INFO L225 Difference]: With dead ends: 5678 [2019-11-16 00:17:30,999 INFO L226 Difference]: Without dead ends: 5678 [2019-11-16 00:17:31,001 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2019-11-16 00:17:31,013 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5678 states. [2019-11-16 00:17:31,072 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5678 to 5027. [2019-11-16 00:17:31,072 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5027 states. [2019-11-16 00:17:31,081 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5027 states to 5027 states and 11264 transitions. [2019-11-16 00:17:31,082 INFO L78 Accepts]: Start accepts. Automaton has 5027 states and 11264 transitions. Word has length 72 [2019-11-16 00:17:31,082 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:17:31,082 INFO L462 AbstractCegarLoop]: Abstraction has 5027 states and 11264 transitions. [2019-11-16 00:17:31,082 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-16 00:17:31,082 INFO L276 IsEmpty]: Start isEmpty. Operand 5027 states and 11264 transitions. [2019-11-16 00:17:31,089 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2019-11-16 00:17:31,089 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:17:31,090 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-16 00:17:31,090 INFO L410 AbstractCegarLoop]: === Iteration 22 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:17:31,090 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:17:31,090 INFO L82 PathProgramCache]: Analyzing trace with hash -1537804919, now seen corresponding path program 1 times [2019-11-16 00:17:31,091 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:17:31,091 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [610807626] [2019-11-16 00:17:31,091 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:17:31,091 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:17:31,091 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:17:31,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:17:31,176 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-16 00:17:31,176 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [610807626] [2019-11-16 00:17:31,177 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:17:31,177 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-11-16 00:17:31,177 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1948142452] [2019-11-16 00:17:31,178 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-11-16 00:17:31,178 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:17:31,178 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-11-16 00:17:31,178 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-11-16 00:17:31,178 INFO L87 Difference]: Start difference. First operand 5027 states and 11264 transitions. Second operand 7 states. [2019-11-16 00:17:31,699 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:17:31,699 INFO L93 Difference]: Finished difference Result 5893 states and 13110 transitions. [2019-11-16 00:17:31,699 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-11-16 00:17:31,700 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 72 [2019-11-16 00:17:31,700 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:17:31,707 INFO L225 Difference]: With dead ends: 5893 [2019-11-16 00:17:31,707 INFO L226 Difference]: Without dead ends: 5840 [2019-11-16 00:17:31,707 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 38 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=61, Invalid=211, Unknown=0, NotChecked=0, Total=272 [2019-11-16 00:17:31,719 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5840 states. [2019-11-16 00:17:31,779 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5840 to 5058. [2019-11-16 00:17:31,779 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5058 states. [2019-11-16 00:17:31,789 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5058 states to 5058 states and 11264 transitions. [2019-11-16 00:17:31,789 INFO L78 Accepts]: Start accepts. Automaton has 5058 states and 11264 transitions. Word has length 72 [2019-11-16 00:17:31,789 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:17:31,790 INFO L462 AbstractCegarLoop]: Abstraction has 5058 states and 11264 transitions. [2019-11-16 00:17:31,790 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-11-16 00:17:31,790 INFO L276 IsEmpty]: Start isEmpty. Operand 5058 states and 11264 transitions. [2019-11-16 00:17:31,797 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2019-11-16 00:17:31,797 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:17:31,797 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-16 00:17:31,798 INFO L410 AbstractCegarLoop]: === Iteration 23 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:17:31,798 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:17:31,798 INFO L82 PathProgramCache]: Analyzing trace with hash -1799811038, now seen corresponding path program 1 times [2019-11-16 00:17:31,798 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:17:31,798 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2015155301] [2019-11-16 00:17:31,799 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:17:31,799 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:17:31,799 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:17:31,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:17:31,872 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-16 00:17:31,873 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2015155301] [2019-11-16 00:17:31,873 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:17:31,873 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-16 00:17:31,873 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1485244201] [2019-11-16 00:17:31,874 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-16 00:17:31,874 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:17:31,874 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-16 00:17:31,875 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-16 00:17:31,875 INFO L87 Difference]: Start difference. First operand 5058 states and 11264 transitions. Second operand 4 states. [2019-11-16 00:17:32,024 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:17:32,024 INFO L93 Difference]: Finished difference Result 6057 states and 13398 transitions. [2019-11-16 00:17:32,024 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-16 00:17:32,025 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 93 [2019-11-16 00:17:32,025 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:17:32,032 INFO L225 Difference]: With dead ends: 6057 [2019-11-16 00:17:32,032 INFO L226 Difference]: Without dead ends: 6057 [2019-11-16 00:17:32,033 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-16 00:17:32,044 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6057 states. [2019-11-16 00:17:32,088 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6057 to 5344. [2019-11-16 00:17:32,089 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5344 states. [2019-11-16 00:17:32,095 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5344 states to 5344 states and 11888 transitions. [2019-11-16 00:17:32,096 INFO L78 Accepts]: Start accepts. Automaton has 5344 states and 11888 transitions. Word has length 93 [2019-11-16 00:17:32,096 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:17:32,096 INFO L462 AbstractCegarLoop]: Abstraction has 5344 states and 11888 transitions. [2019-11-16 00:17:32,096 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-16 00:17:32,096 INFO L276 IsEmpty]: Start isEmpty. Operand 5344 states and 11888 transitions. [2019-11-16 00:17:32,101 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2019-11-16 00:17:32,102 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:17:32,102 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-16 00:17:32,102 INFO L410 AbstractCegarLoop]: === Iteration 24 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:17:32,102 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:17:32,103 INFO L82 PathProgramCache]: Analyzing trace with hash -1588217784, now seen corresponding path program 1 times [2019-11-16 00:17:32,103 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:17:32,103 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1622358533] [2019-11-16 00:17:32,103 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:17:32,104 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:17:32,104 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:17:32,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:17:32,173 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-16 00:17:32,174 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1622358533] [2019-11-16 00:17:32,174 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:17:32,174 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-16 00:17:32,175 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1160650777] [2019-11-16 00:17:32,175 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-16 00:17:32,175 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:17:32,176 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-16 00:17:32,176 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-16 00:17:32,176 INFO L87 Difference]: Start difference. First operand 5344 states and 11888 transitions. Second operand 5 states. [2019-11-16 00:17:32,314 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:17:32,315 INFO L93 Difference]: Finished difference Result 5833 states and 12951 transitions. [2019-11-16 00:17:32,315 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-11-16 00:17:32,315 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 95 [2019-11-16 00:17:32,315 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:17:32,322 INFO L225 Difference]: With dead ends: 5833 [2019-11-16 00:17:32,323 INFO L226 Difference]: Without dead ends: 5833 [2019-11-16 00:17:32,323 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-11-16 00:17:32,333 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5833 states. [2019-11-16 00:17:32,372 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5833 to 4469. [2019-11-16 00:17:32,372 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4469 states. [2019-11-16 00:17:32,378 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4469 states to 4469 states and 9934 transitions. [2019-11-16 00:17:32,378 INFO L78 Accepts]: Start accepts. Automaton has 4469 states and 9934 transitions. Word has length 95 [2019-11-16 00:17:32,378 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:17:32,378 INFO L462 AbstractCegarLoop]: Abstraction has 4469 states and 9934 transitions. [2019-11-16 00:17:32,378 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-16 00:17:32,379 INFO L276 IsEmpty]: Start isEmpty. Operand 4469 states and 9934 transitions. [2019-11-16 00:17:32,382 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2019-11-16 00:17:32,382 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:17:32,383 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-16 00:17:32,383 INFO L410 AbstractCegarLoop]: === Iteration 25 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:17:32,383 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:17:32,383 INFO L82 PathProgramCache]: Analyzing trace with hash -1576901657, now seen corresponding path program 1 times [2019-11-16 00:17:32,383 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:17:32,384 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2099344204] [2019-11-16 00:17:32,384 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:17:32,384 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:17:32,384 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:17:32,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:17:32,453 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-16 00:17:32,454 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2099344204] [2019-11-16 00:17:32,455 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:17:32,455 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-16 00:17:32,455 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [280833659] [2019-11-16 00:17:32,455 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-16 00:17:32,456 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:17:32,456 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-16 00:17:32,456 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-16 00:17:32,456 INFO L87 Difference]: Start difference. First operand 4469 states and 9934 transitions. Second operand 4 states. [2019-11-16 00:17:32,552 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:17:32,552 INFO L93 Difference]: Finished difference Result 4900 states and 10901 transitions. [2019-11-16 00:17:32,552 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-16 00:17:32,552 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 95 [2019-11-16 00:17:32,553 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:17:32,557 INFO L225 Difference]: With dead ends: 4900 [2019-11-16 00:17:32,557 INFO L226 Difference]: Without dead ends: 4900 [2019-11-16 00:17:32,557 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-16 00:17:32,562 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4900 states. [2019-11-16 00:17:32,593 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4900 to 4540. [2019-11-16 00:17:32,593 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4540 states. [2019-11-16 00:17:32,598 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4540 states to 4540 states and 10085 transitions. [2019-11-16 00:17:32,599 INFO L78 Accepts]: Start accepts. Automaton has 4540 states and 10085 transitions. Word has length 95 [2019-11-16 00:17:32,599 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:17:32,599 INFO L462 AbstractCegarLoop]: Abstraction has 4540 states and 10085 transitions. [2019-11-16 00:17:32,599 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-16 00:17:32,599 INFO L276 IsEmpty]: Start isEmpty. Operand 4540 states and 10085 transitions. [2019-11-16 00:17:32,604 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2019-11-16 00:17:32,604 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:17:32,605 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-16 00:17:32,605 INFO L410 AbstractCegarLoop]: === Iteration 26 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:17:32,605 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:17:32,605 INFO L82 PathProgramCache]: Analyzing trace with hash -476923578, now seen corresponding path program 1 times [2019-11-16 00:17:32,606 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:17:32,606 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [724775504] [2019-11-16 00:17:32,606 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:17:32,606 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:17:32,606 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:17:32,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:17:32,665 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-16 00:17:32,666 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [724775504] [2019-11-16 00:17:32,666 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:17:32,666 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-16 00:17:32,666 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2060424752] [2019-11-16 00:17:32,667 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-16 00:17:32,667 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:17:32,667 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-16 00:17:32,667 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-16 00:17:32,667 INFO L87 Difference]: Start difference. First operand 4540 states and 10085 transitions. Second operand 4 states. [2019-11-16 00:17:32,865 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:17:32,866 INFO L93 Difference]: Finished difference Result 5768 states and 12740 transitions. [2019-11-16 00:17:32,866 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-16 00:17:32,866 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 95 [2019-11-16 00:17:32,866 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:17:32,872 INFO L225 Difference]: With dead ends: 5768 [2019-11-16 00:17:32,873 INFO L226 Difference]: Without dead ends: 5716 [2019-11-16 00:17:32,875 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-16 00:17:32,885 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5716 states. [2019-11-16 00:17:32,938 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5716 to 5413. [2019-11-16 00:17:32,938 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5413 states. [2019-11-16 00:17:32,946 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5413 states to 5413 states and 11982 transitions. [2019-11-16 00:17:32,947 INFO L78 Accepts]: Start accepts. Automaton has 5413 states and 11982 transitions. Word has length 95 [2019-11-16 00:17:32,947 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:17:32,947 INFO L462 AbstractCegarLoop]: Abstraction has 5413 states and 11982 transitions. [2019-11-16 00:17:32,947 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-16 00:17:32,947 INFO L276 IsEmpty]: Start isEmpty. Operand 5413 states and 11982 transitions. [2019-11-16 00:17:32,953 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2019-11-16 00:17:32,953 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:17:32,954 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-16 00:17:32,954 INFO L410 AbstractCegarLoop]: === Iteration 27 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:17:32,955 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:17:32,955 INFO L82 PathProgramCache]: Analyzing trace with hash 640856296, now seen corresponding path program 1 times [2019-11-16 00:17:32,955 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:17:32,955 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1573374876] [2019-11-16 00:17:32,955 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:17:32,956 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:17:32,956 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:17:32,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:17:33,051 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-16 00:17:33,051 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1573374876] [2019-11-16 00:17:33,052 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:17:33,052 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-11-16 00:17:33,052 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1381330482] [2019-11-16 00:17:33,052 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-11-16 00:17:33,052 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:17:33,053 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-11-16 00:17:33,053 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-11-16 00:17:33,054 INFO L87 Difference]: Start difference. First operand 5413 states and 11982 transitions. Second operand 7 states. [2019-11-16 00:17:33,396 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:17:33,397 INFO L93 Difference]: Finished difference Result 7243 states and 15991 transitions. [2019-11-16 00:17:33,397 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-11-16 00:17:33,397 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 95 [2019-11-16 00:17:33,397 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:17:33,403 INFO L225 Difference]: With dead ends: 7243 [2019-11-16 00:17:33,403 INFO L226 Difference]: Without dead ends: 7243 [2019-11-16 00:17:33,403 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 5 SyntacticMatches, 2 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=51, Invalid=159, Unknown=0, NotChecked=0, Total=210 [2019-11-16 00:17:33,411 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7243 states. [2019-11-16 00:17:33,459 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7243 to 6514. [2019-11-16 00:17:33,459 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6514 states. [2019-11-16 00:17:33,467 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6514 states to 6514 states and 14409 transitions. [2019-11-16 00:17:33,467 INFO L78 Accepts]: Start accepts. Automaton has 6514 states and 14409 transitions. Word has length 95 [2019-11-16 00:17:33,467 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:17:33,468 INFO L462 AbstractCegarLoop]: Abstraction has 6514 states and 14409 transitions. [2019-11-16 00:17:33,468 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-11-16 00:17:33,468 INFO L276 IsEmpty]: Start isEmpty. Operand 6514 states and 14409 transitions. [2019-11-16 00:17:33,472 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2019-11-16 00:17:33,473 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:17:33,473 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-16 00:17:33,473 INFO L410 AbstractCegarLoop]: === Iteration 28 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:17:33,473 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:17:33,474 INFO L82 PathProgramCache]: Analyzing trace with hash 1740834375, now seen corresponding path program 1 times [2019-11-16 00:17:33,474 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:17:33,474 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [967941836] [2019-11-16 00:17:33,474 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:17:33,474 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:17:33,475 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:17:33,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:17:33,621 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-16 00:17:33,622 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [967941836] [2019-11-16 00:17:33,622 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:17:33,622 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-11-16 00:17:33,622 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [428831776] [2019-11-16 00:17:33,622 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-11-16 00:17:33,622 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:17:33,623 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-11-16 00:17:33,623 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2019-11-16 00:17:33,623 INFO L87 Difference]: Start difference. First operand 6514 states and 14409 transitions. Second operand 9 states. [2019-11-16 00:17:34,311 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:17:34,312 INFO L93 Difference]: Finished difference Result 8383 states and 18331 transitions. [2019-11-16 00:17:34,312 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2019-11-16 00:17:34,312 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 95 [2019-11-16 00:17:34,312 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:17:34,321 INFO L225 Difference]: With dead ends: 8383 [2019-11-16 00:17:34,321 INFO L226 Difference]: Without dead ends: 8383 [2019-11-16 00:17:34,321 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 4 SyntacticMatches, 5 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 54 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=100, Invalid=320, Unknown=0, NotChecked=0, Total=420 [2019-11-16 00:17:34,334 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8383 states. [2019-11-16 00:17:34,407 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8383 to 7231. [2019-11-16 00:17:34,408 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7231 states. [2019-11-16 00:17:34,419 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7231 states to 7231 states and 15884 transitions. [2019-11-16 00:17:34,419 INFO L78 Accepts]: Start accepts. Automaton has 7231 states and 15884 transitions. Word has length 95 [2019-11-16 00:17:34,419 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:17:34,420 INFO L462 AbstractCegarLoop]: Abstraction has 7231 states and 15884 transitions. [2019-11-16 00:17:34,420 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-11-16 00:17:34,420 INFO L276 IsEmpty]: Start isEmpty. Operand 7231 states and 15884 transitions. [2019-11-16 00:17:34,427 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2019-11-16 00:17:34,427 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:17:34,427 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-16 00:17:34,427 INFO L410 AbstractCegarLoop]: === Iteration 29 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:17:34,429 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:17:34,430 INFO L82 PathProgramCache]: Analyzing trace with hash 1952185288, now seen corresponding path program 1 times [2019-11-16 00:17:34,430 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:17:34,430 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [377376546] [2019-11-16 00:17:34,430 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:17:34,430 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:17:34,430 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:17:34,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:17:34,532 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-16 00:17:34,533 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [377376546] [2019-11-16 00:17:34,533 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:17:34,533 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-16 00:17:34,533 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [515316741] [2019-11-16 00:17:34,534 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-16 00:17:34,534 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:17:34,534 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-16 00:17:34,534 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-11-16 00:17:34,534 INFO L87 Difference]: Start difference. First operand 7231 states and 15884 transitions. Second operand 5 states. [2019-11-16 00:17:34,580 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:17:34,580 INFO L93 Difference]: Finished difference Result 7150 states and 15668 transitions. [2019-11-16 00:17:34,581 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-16 00:17:34,581 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 95 [2019-11-16 00:17:34,581 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:17:34,589 INFO L225 Difference]: With dead ends: 7150 [2019-11-16 00:17:34,589 INFO L226 Difference]: Without dead ends: 7150 [2019-11-16 00:17:34,591 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2019-11-16 00:17:34,602 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7150 states. [2019-11-16 00:17:34,660 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7150 to 5484. [2019-11-16 00:17:34,661 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5484 states. [2019-11-16 00:17:34,668 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5484 states to 5484 states and 12005 transitions. [2019-11-16 00:17:34,669 INFO L78 Accepts]: Start accepts. Automaton has 5484 states and 12005 transitions. Word has length 95 [2019-11-16 00:17:34,669 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:17:34,669 INFO L462 AbstractCegarLoop]: Abstraction has 5484 states and 12005 transitions. [2019-11-16 00:17:34,669 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-16 00:17:34,670 INFO L276 IsEmpty]: Start isEmpty. Operand 5484 states and 12005 transitions. [2019-11-16 00:17:34,674 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2019-11-16 00:17:34,675 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:17:34,675 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-16 00:17:34,675 INFO L410 AbstractCegarLoop]: === Iteration 30 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:17:34,675 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:17:34,676 INFO L82 PathProgramCache]: Analyzing trace with hash -1455278327, now seen corresponding path program 1 times [2019-11-16 00:17:34,676 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:17:34,676 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [973055810] [2019-11-16 00:17:34,676 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:17:34,676 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:17:34,676 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:17:34,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:17:34,850 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-16 00:17:34,850 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [973055810] [2019-11-16 00:17:34,851 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:17:34,851 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-11-16 00:17:34,851 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1729472649] [2019-11-16 00:17:34,851 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-11-16 00:17:34,852 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:17:34,852 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-11-16 00:17:34,852 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2019-11-16 00:17:34,852 INFO L87 Difference]: Start difference. First operand 5484 states and 12005 transitions. Second operand 10 states. [2019-11-16 00:17:35,360 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:17:35,360 INFO L93 Difference]: Finished difference Result 16370 states and 36408 transitions. [2019-11-16 00:17:35,361 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-11-16 00:17:35,361 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 95 [2019-11-16 00:17:35,361 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:17:35,373 INFO L225 Difference]: With dead ends: 16370 [2019-11-16 00:17:35,373 INFO L226 Difference]: Without dead ends: 10815 [2019-11-16 00:17:35,374 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 48 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=95, Invalid=367, Unknown=0, NotChecked=0, Total=462 [2019-11-16 00:17:35,390 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10815 states. [2019-11-16 00:17:35,461 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10815 to 5433. [2019-11-16 00:17:35,461 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5433 states. [2019-11-16 00:17:35,469 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5433 states to 5433 states and 11822 transitions. [2019-11-16 00:17:35,469 INFO L78 Accepts]: Start accepts. Automaton has 5433 states and 11822 transitions. Word has length 95 [2019-11-16 00:17:35,470 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:17:35,470 INFO L462 AbstractCegarLoop]: Abstraction has 5433 states and 11822 transitions. [2019-11-16 00:17:35,470 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-11-16 00:17:35,470 INFO L276 IsEmpty]: Start isEmpty. Operand 5433 states and 11822 transitions. [2019-11-16 00:17:35,475 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2019-11-16 00:17:35,475 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:17:35,476 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-16 00:17:35,476 INFO L410 AbstractCegarLoop]: === Iteration 31 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:17:35,476 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:17:35,476 INFO L82 PathProgramCache]: Analyzing trace with hash 873793154, now seen corresponding path program 1 times [2019-11-16 00:17:35,477 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:17:35,477 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [202132741] [2019-11-16 00:17:35,477 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:17:35,477 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:17:35,477 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:17:35,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:17:35,602 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-16 00:17:35,602 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [202132741] [2019-11-16 00:17:35,603 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:17:35,603 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-11-16 00:17:35,603 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [67140169] [2019-11-16 00:17:35,603 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-16 00:17:35,603 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:17:35,604 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-16 00:17:35,604 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2019-11-16 00:17:35,604 INFO L87 Difference]: Start difference. First operand 5433 states and 11822 transitions. Second operand 6 states. [2019-11-16 00:17:35,794 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:17:35,794 INFO L93 Difference]: Finished difference Result 6236 states and 13436 transitions. [2019-11-16 00:17:35,795 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-11-16 00:17:35,795 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 95 [2019-11-16 00:17:35,795 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:17:35,802 INFO L225 Difference]: With dead ends: 6236 [2019-11-16 00:17:35,802 INFO L226 Difference]: Without dead ends: 6207 [2019-11-16 00:17:35,802 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2019-11-16 00:17:35,812 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6207 states. [2019-11-16 00:17:35,872 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6207 to 5538. [2019-11-16 00:17:35,873 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5538 states. [2019-11-16 00:17:35,882 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5538 states to 5538 states and 11978 transitions. [2019-11-16 00:17:35,883 INFO L78 Accepts]: Start accepts. Automaton has 5538 states and 11978 transitions. Word has length 95 [2019-11-16 00:17:35,883 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:17:35,883 INFO L462 AbstractCegarLoop]: Abstraction has 5538 states and 11978 transitions. [2019-11-16 00:17:35,883 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-16 00:17:35,883 INFO L276 IsEmpty]: Start isEmpty. Operand 5538 states and 11978 transitions. [2019-11-16 00:17:35,889 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2019-11-16 00:17:35,890 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:17:35,890 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-16 00:17:35,891 INFO L410 AbstractCegarLoop]: === Iteration 32 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:17:35,891 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:17:35,891 INFO L82 PathProgramCache]: Analyzing trace with hash 465601634, now seen corresponding path program 2 times [2019-11-16 00:17:35,891 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:17:35,893 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [182932722] [2019-11-16 00:17:35,893 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:17:35,894 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:17:35,894 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:17:35,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:17:36,001 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-16 00:17:36,005 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [182932722] [2019-11-16 00:17:36,005 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:17:36,005 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-11-16 00:17:36,005 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1746395750] [2019-11-16 00:17:36,006 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-11-16 00:17:36,006 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:17:36,006 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-11-16 00:17:36,007 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2019-11-16 00:17:36,007 INFO L87 Difference]: Start difference. First operand 5538 states and 11978 transitions. Second operand 7 states. [2019-11-16 00:17:36,379 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:17:36,379 INFO L93 Difference]: Finished difference Result 5728 states and 12350 transitions. [2019-11-16 00:17:36,379 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-11-16 00:17:36,380 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 95 [2019-11-16 00:17:36,380 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:17:36,385 INFO L225 Difference]: With dead ends: 5728 [2019-11-16 00:17:36,386 INFO L226 Difference]: Without dead ends: 5728 [2019-11-16 00:17:36,387 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=50, Invalid=106, Unknown=0, NotChecked=0, Total=156 [2019-11-16 00:17:36,397 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5728 states. [2019-11-16 00:17:36,448 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5728 to 5398. [2019-11-16 00:17:36,449 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5398 states. [2019-11-16 00:17:36,457 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5398 states to 5398 states and 11664 transitions. [2019-11-16 00:17:36,457 INFO L78 Accepts]: Start accepts. Automaton has 5398 states and 11664 transitions. Word has length 95 [2019-11-16 00:17:36,458 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:17:36,458 INFO L462 AbstractCegarLoop]: Abstraction has 5398 states and 11664 transitions. [2019-11-16 00:17:36,458 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-11-16 00:17:36,458 INFO L276 IsEmpty]: Start isEmpty. Operand 5398 states and 11664 transitions. [2019-11-16 00:17:36,463 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2019-11-16 00:17:36,463 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:17:36,464 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-16 00:17:36,464 INFO L410 AbstractCegarLoop]: === Iteration 33 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:17:36,464 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:17:36,464 INFO L82 PathProgramCache]: Analyzing trace with hash 425096515, now seen corresponding path program 2 times [2019-11-16 00:17:36,464 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:17:36,465 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2071702411] [2019-11-16 00:17:36,465 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:17:36,465 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:17:36,465 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:17:36,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-16 00:17:36,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-16 00:17:36,579 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-16 00:17:36,579 INFO L445 BasicCegarLoop]: Counterexample might be feasible [2019-11-16 00:17:36,753 INFO L303 ceAbstractionStarter]: Did not count any witness invariants because Icfg is not BoogieIcfg [2019-11-16 00:17:36,757 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 16.11 12:17:36 BasicIcfg [2019-11-16 00:17:36,757 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-11-16 00:17:36,758 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-11-16 00:17:36,758 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-11-16 00:17:36,758 INFO L275 PluginConnector]: Witness Printer initialized [2019-11-16 00:17:36,758 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.11 12:16:49" (3/4) ... [2019-11-16 00:17:36,767 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2019-11-16 00:17:36,935 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/run_dir_e44fc151-c981-4b39-8bff-c707f8e364e7/bin/uautomizer/witness.graphml [2019-11-16 00:17:36,936 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-11-16 00:17:36,938 INFO L168 Benchmark]: Toolchain (without parser) took 49554.88 ms. Allocated memory was 1.0 GB in the beginning and 4.9 GB in the end (delta: 3.9 GB). Free memory was 939.4 MB in the beginning and 2.2 GB in the end (delta: -1.3 GB). Peak memory consumption was 2.6 GB. Max. memory is 11.5 GB. [2019-11-16 00:17:36,938 INFO L168 Benchmark]: CDTParser took 0.20 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-16 00:17:36,939 INFO L168 Benchmark]: CACSL2BoogieTranslator took 632.86 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 119.0 MB). Free memory was 939.4 MB in the beginning and 1.1 GB in the end (delta: -142.2 MB). Peak memory consumption was 18.5 MB. Max. memory is 11.5 GB. [2019-11-16 00:17:36,939 INFO L168 Benchmark]: Boogie Procedure Inliner took 62.21 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.7 MB). Peak memory consumption was 6.7 MB. Max. memory is 11.5 GB. [2019-11-16 00:17:36,940 INFO L168 Benchmark]: Boogie Preprocessor took 58.98 ms. Allocated memory is still 1.1 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-16 00:17:36,940 INFO L168 Benchmark]: RCFGBuilder took 889.48 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 48.1 MB). Peak memory consumption was 48.1 MB. Max. memory is 11.5 GB. [2019-11-16 00:17:36,940 INFO L168 Benchmark]: TraceAbstraction took 47728.32 ms. Allocated memory was 1.1 GB in the beginning and 4.9 GB in the end (delta: 3.8 GB). Free memory was 1.0 GB in the beginning and 2.3 GB in the end (delta: -1.3 GB). Peak memory consumption was 2.5 GB. Max. memory is 11.5 GB. [2019-11-16 00:17:36,943 INFO L168 Benchmark]: Witness Printer took 178.28 ms. Allocated memory is still 4.9 GB. Free memory was 2.3 GB in the beginning and 2.2 GB in the end (delta: 69.8 MB). Peak memory consumption was 69.8 MB. Max. memory is 11.5 GB. [2019-11-16 00:17:36,945 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.20 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 632.86 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 119.0 MB). Free memory was 939.4 MB in the beginning and 1.1 GB in the end (delta: -142.2 MB). Peak memory consumption was 18.5 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 62.21 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.7 MB). Peak memory consumption was 6.7 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 58.98 ms. Allocated memory is still 1.1 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 889.48 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 48.1 MB). Peak memory consumption was 48.1 MB. Max. memory is 11.5 GB. * TraceAbstraction took 47728.32 ms. Allocated memory was 1.1 GB in the beginning and 4.9 GB in the end (delta: 3.8 GB). Free memory was 1.0 GB in the beginning and 2.3 GB in the end (delta: -1.3 GB). Peak memory consumption was 2.5 GB. Max. memory is 11.5 GB. * Witness Printer took 178.28 ms. Allocated memory is still 4.9 GB. Free memory was 2.3 GB in the beginning and 2.2 GB in the end (delta: 69.8 MB). Peak memory consumption was 69.8 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 4]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L694] 0 int __unbuffered_cnt = 0; VAL [__unbuffered_cnt=0] [L696] 0 int __unbuffered_p0_EAX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0] [L698] 0 int __unbuffered_p1_EAX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0] [L699] 0 _Bool main$tmp_guard0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0] [L700] 0 _Bool main$tmp_guard1; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0] [L702] 0 int x = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0] [L704] 0 int y = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0] [L705] 0 _Bool y$flush_delayed; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0] [L706] 0 int y$mem_tmp; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0] [L707] 0 _Bool y$r_buff0_thd0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0] [L708] 0 _Bool y$r_buff0_thd1; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0] [L709] 0 _Bool y$r_buff0_thd2; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0] [L710] 0 _Bool y$r_buff1_thd0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0] [L711] 0 _Bool y$r_buff1_thd1; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0] [L712] 0 _Bool y$r_buff1_thd2; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0] [L713] 0 _Bool y$read_delayed; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0] [L714] 0 int *y$read_delayed_var; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}] [L715] 0 int y$w_buff0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0] [L716] 0 _Bool y$w_buff0_used; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0] [L717] 0 int y$w_buff1; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0] [L718] 0 _Bool y$w_buff1_used; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L719] 0 _Bool weak$$choice0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L720] 0 _Bool weak$$choice2; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L793] 0 pthread_t t1287; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L794] FCALL, FORK 0 pthread_create(&t1287, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L795] 0 pthread_t t1288; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L724] 1 y$w_buff1 = y$w_buff0 [L725] 1 y$w_buff0 = 1 [L726] 1 y$w_buff1_used = y$w_buff0_used [L727] 1 y$w_buff0_used = (_Bool)1 [L4] COND FALSE 1 !(!expression) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L729] 1 y$r_buff1_thd0 = y$r_buff0_thd0 [L730] 1 y$r_buff1_thd1 = y$r_buff0_thd1 [L731] 1 y$r_buff1_thd2 = y$r_buff0_thd2 [L732] 1 y$r_buff0_thd1 = (_Bool)1 [L735] 1 __unbuffered_p0_EAX = x VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L738] EXPR 1 y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd1 ? y$w_buff1 : y) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L796] FCALL, FORK 0 pthread_create(&t1288, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L752] 2 x = 1 [L755] 2 weak$$choice0 = __VERIFIER_nondet_bool() [L756] 2 weak$$choice2 = __VERIFIER_nondet_bool() [L757] 2 y$flush_delayed = weak$$choice2 [L758] 2 y$mem_tmp = y VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L759] EXPR 2 !y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff1) VAL [!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff1)=0, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L738] 1 y = y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd1 ? y$w_buff1 : y) [L739] EXPR 1 y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$w_buff0_used VAL [!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff1)=0, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=1, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L759] 2 y = !y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff1) [L739] 1 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$w_buff0_used [L760] EXPR 2 weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff0))=1, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L760] 2 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff0)) [L761] EXPR 2 weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff1 : y$w_buff1)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff1 : y$w_buff1))=0, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L761] 2 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff1 : y$w_buff1)) [L762] EXPR 2 weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used))=0, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L762] 2 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used)) [L763] EXPR 2 weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0))=0, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L763] 2 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L740] EXPR 1 y$w_buff0_used && y$r_buff0_thd1 || y$w_buff1_used && y$r_buff1_thd1 ? (_Bool)0 : y$w_buff1_used VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L740] 1 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd1 || y$w_buff1_used && y$r_buff1_thd1 ? (_Bool)0 : y$w_buff1_used [L741] EXPR 1 y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$r_buff0_thd1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L741] 1 y$r_buff0_thd1 = y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$r_buff0_thd1 [L742] EXPR 1 y$w_buff0_used && y$r_buff0_thd1 || y$w_buff1_used && y$r_buff1_thd1 ? (_Bool)0 : y$r_buff1_thd1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L742] 1 y$r_buff1_thd1 = y$w_buff0_used && y$r_buff0_thd1 || y$w_buff1_used && y$r_buff1_thd1 ? (_Bool)0 : y$r_buff1_thd1 [L745] 1 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L764] EXPR 2 weak$$choice2 ? y$r_buff0_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff0_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2)) VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, weak$$choice2 ? y$r_buff0_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff0_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2))=0, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L764] 2 y$r_buff0_thd2 = weak$$choice2 ? y$r_buff0_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff0_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2)) [L765] EXPR 2 weak$$choice2 ? y$r_buff1_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff1_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, weak$$choice2 ? y$r_buff1_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff1_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0))=0, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L765] 2 y$r_buff1_thd2 = weak$$choice2 ? y$r_buff1_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff1_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L766] 2 __unbuffered_p1_EAX = y VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L767] EXPR 2 y$flush_delayed ? y$mem_tmp : y VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=0, y$flush_delayed=1, y$flush_delayed ? y$mem_tmp : y=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L767] 2 y = y$flush_delayed ? y$mem_tmp : y [L768] 2 y$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L771] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L771] EXPR 2 y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y=0] [L771] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y)=0, y$w_buff1=0, y$w_buff1_used=0, y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y=0] [L771] 2 y = y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) [L772] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L772] 2 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used [L773] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$w_buff1_used VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$w_buff1_used=0, y$w_buff1=0, y$w_buff1_used=0] [L773] 2 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$w_buff1_used [L774] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2 VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2=0, y$w_buff1=0, y$w_buff1_used=0] [L774] 2 y$r_buff0_thd2 = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2 [L775] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$r_buff1_thd2 VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$r_buff1_thd2=0, y$w_buff1=0, y$w_buff1_used=0] [L775] 2 y$r_buff1_thd2 = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$r_buff1_thd2 [L778] 2 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L798] 0 main$tmp_guard0 = __unbuffered_cnt == 2 VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L802] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L802] EXPR 0 y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L802] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L802] 0 y = y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) [L803] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L803] 0 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L804] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$w_buff1_used VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L804] 0 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$w_buff1_used [L805] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L805] 0 y$r_buff0_thd0 = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 [L806] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$r_buff1_thd0 VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L806] 0 y$r_buff1_thd0 = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$r_buff1_thd0 [L809] 0 main$tmp_guard1 = !(__unbuffered_p0_EAX == 0 && __unbuffered_p1_EAX == 0) VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L4] COND TRUE 0 !expression VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L4] 0 __VERIFIER_error() VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 5 procedures, 218 locations, 3 error locations. Result: UNSAFE, OverallTime: 47.6s, OverallIterations: 33, TraceHistogramMax: 1, AutomataDifference: 16.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 8640 SDtfs, 9731 SDslu, 20299 SDs, 0 SdLazy, 7818 SolverSat, 458 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 7.9s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 325 GetRequests, 91 SyntacticMatches, 24 SemanticMatches, 210 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 250 ImplicationChecksByTransitivity, 2.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=71011occurred in iteration=6, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 24.1s AutomataMinimizationTime, 32 MinimizatonAttempts, 107199 StatesRemovedByMinimization, 31 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 2.3s InterpolantComputationTime, 2321 NumberOfCodeBlocks, 2321 NumberOfCodeBlocksAsserted, 33 NumberOfCheckSat, 2194 ConstructedInterpolants, 0 QuantifiedInterpolants, 420866 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 32 InterpolantComputations, 32 PerfectInterpolantSequences, 0/0 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...