./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/pthread-wmm/rfi004_pso.oepc.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_43f21288-80e1-44d1-bf39-9fbf15175947/bin/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/run_dir_43f21288-80e1-44d1-bf39-9fbf15175947/bin/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_43f21288-80e1-44d1-bf39-9fbf15175947/bin/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_43f21288-80e1-44d1-bf39-9fbf15175947/bin/uautomizer/config/AutomizerReach.xml -i ../../sv-benchmarks/c/pthread-wmm/rfi004_pso.oepc.i -s /tmp/vcloud-vcloud-master/worker/run_dir_43f21288-80e1-44d1-bf39-9fbf15175947/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_43f21288-80e1-44d1-bf39-9fbf15175947/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 cd0d88d2f020ad500dbef5f24f986f709ccc4001 ........................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... 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:24:25,280 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-16 00:24:25,282 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-16 00:24:25,293 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-16 00:24:25,294 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-16 00:24:25,295 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-16 00:24:25,296 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-16 00:24:25,298 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-16 00:24:25,301 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-16 00:24:25,308 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-16 00:24:25,309 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-16 00:24:25,310 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-16 00:24:25,310 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-16 00:24:25,311 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-16 00:24:25,312 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-16 00:24:25,313 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-16 00:24:25,314 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-16 00:24:25,314 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-16 00:24:25,316 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-16 00:24:25,319 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-16 00:24:25,323 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-16 00:24:25,326 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-16 00:24:25,327 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-16 00:24:25,328 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-16 00:24:25,333 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-16 00:24:25,333 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-16 00:24:25,333 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-16 00:24:25,334 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-16 00:24:25,334 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-16 00:24:25,335 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-16 00:24:25,335 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-16 00:24:25,336 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-16 00:24:25,336 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-16 00:24:25,337 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-16 00:24:25,338 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-16 00:24:25,338 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-16 00:24:25,339 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-16 00:24:25,339 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-16 00:24:25,339 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-16 00:24:25,340 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-16 00:24:25,340 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-16 00:24:25,341 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_43f21288-80e1-44d1-bf39-9fbf15175947/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf [2019-11-16 00:24:25,354 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-16 00:24:25,354 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-16 00:24:25,355 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-16 00:24:25,355 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-16 00:24:25,355 INFO L138 SettingsManager]: * Use SBE=true [2019-11-16 00:24:25,356 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-16 00:24:25,356 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-16 00:24:25,356 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-16 00:24:25,356 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-16 00:24:25,356 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-16 00:24:25,357 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-11-16 00:24:25,357 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-16 00:24:25,357 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-11-16 00:24:25,357 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-16 00:24:25,357 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-16 00:24:25,358 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-16 00:24:25,358 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-11-16 00:24:25,358 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-16 00:24:25,358 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-16 00:24:25,358 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-16 00:24:25,359 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-16 00:24:25,359 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-16 00:24:25,359 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-16 00:24:25,359 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-16 00:24:25,359 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-11-16 00:24:25,360 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-11-16 00:24:25,360 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-11-16 00:24:25,360 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-11-16 00:24:25,360 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_43f21288-80e1-44d1-bf39-9fbf15175947/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 -> cd0d88d2f020ad500dbef5f24f986f709ccc4001 [2019-11-16 00:24:25,397 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-16 00:24:25,415 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-16 00:24:25,422 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-16 00:24:25,424 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-16 00:24:25,424 INFO L275 PluginConnector]: CDTParser initialized [2019-11-16 00:24:25,425 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_43f21288-80e1-44d1-bf39-9fbf15175947/bin/uautomizer/../../sv-benchmarks/c/pthread-wmm/rfi004_pso.oepc.i [2019-11-16 00:24:25,480 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_43f21288-80e1-44d1-bf39-9fbf15175947/bin/uautomizer/data/85b1b62a5/fdea24fdb4874551bb9f2decc0bcf6b0/FLAG35c97b446 [2019-11-16 00:24:25,968 INFO L306 CDTParser]: Found 1 translation units. [2019-11-16 00:24:25,968 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_43f21288-80e1-44d1-bf39-9fbf15175947/sv-benchmarks/c/pthread-wmm/rfi004_pso.oepc.i [2019-11-16 00:24:25,982 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_43f21288-80e1-44d1-bf39-9fbf15175947/bin/uautomizer/data/85b1b62a5/fdea24fdb4874551bb9f2decc0bcf6b0/FLAG35c97b446 [2019-11-16 00:24:26,494 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_43f21288-80e1-44d1-bf39-9fbf15175947/bin/uautomizer/data/85b1b62a5/fdea24fdb4874551bb9f2decc0bcf6b0 [2019-11-16 00:24:26,497 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-16 00:24:26,498 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-11-16 00:24:26,499 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-16 00:24:26,499 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-16 00:24:26,502 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-16 00:24:26,503 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.11 12:24:26" (1/1) ... [2019-11-16 00:24:26,505 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@149f8d2c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:24:26, skipping insertion in model container [2019-11-16 00:24:26,506 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.11 12:24:26" (1/1) ... [2019-11-16 00:24:26,511 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-11-16 00:24:26,554 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-11-16 00:24:26,993 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-16 00:24:27,005 INFO L188 MainTranslator]: Completed pre-run [2019-11-16 00:24:27,056 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-16 00:24:27,125 INFO L192 MainTranslator]: Completed translation [2019-11-16 00:24:27,126 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:24:27 WrapperNode [2019-11-16 00:24:27,126 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-16 00:24:27,127 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-11-16 00:24:27,127 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-11-16 00:24:27,127 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-11-16 00:24:27,136 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:24:27" (1/1) ... [2019-11-16 00:24:27,154 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:24:27" (1/1) ... [2019-11-16 00:24:27,183 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-11-16 00:24:27,183 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-16 00:24:27,184 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-16 00:24:27,184 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-16 00:24:27,193 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:24:27" (1/1) ... [2019-11-16 00:24:27,193 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:24:27" (1/1) ... [2019-11-16 00:24:27,198 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:24:27" (1/1) ... [2019-11-16 00:24:27,198 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:24:27" (1/1) ... [2019-11-16 00:24:27,208 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:24:27" (1/1) ... [2019-11-16 00:24:27,212 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:24:27" (1/1) ... [2019-11-16 00:24:27,215 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:24:27" (1/1) ... [2019-11-16 00:24:27,220 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-16 00:24:27,220 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-16 00:24:27,220 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-16 00:24:27,220 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-16 00:24:27,221 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:24:27" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_43f21288-80e1-44d1-bf39-9fbf15175947/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:24:27,281 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-11-16 00:24:27,281 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2019-11-16 00:24:27,281 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-11-16 00:24:27,282 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-11-16 00:24:27,282 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2019-11-16 00:24:27,282 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2019-11-16 00:24:27,282 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2019-11-16 00:24:27,282 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2019-11-16 00:24:27,282 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2019-11-16 00:24:27,282 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-16 00:24:27,283 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-16 00:24:27,285 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:24:27,877 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-16 00:24:27,877 INFO L284 CfgBuilder]: Removed 8 assume(true) statements. [2019-11-16 00:24:27,878 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.11 12:24:27 BoogieIcfgContainer [2019-11-16 00:24:27,878 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-16 00:24:27,879 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-16 00:24:27,879 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-16 00:24:27,882 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-16 00:24:27,882 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 16.11 12:24:26" (1/3) ... [2019-11-16 00:24:27,883 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1b863726 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.11 12:24:27, skipping insertion in model container [2019-11-16 00:24:27,883 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:24:27" (2/3) ... [2019-11-16 00:24:27,884 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1b863726 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.11 12:24:27, skipping insertion in model container [2019-11-16 00:24:27,884 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.11 12:24:27" (3/3) ... [2019-11-16 00:24:27,885 INFO L109 eAbstractionObserver]: Analyzing ICFG rfi004_pso.oepc.i [2019-11-16 00:24:27,925 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:24:27,925 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:24:27,926 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P0_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:24:27,926 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:24:27,926 WARN L315 ript$VariableManager]: TermVariabe Thread1_P0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:24:27,926 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:24:27,926 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P0_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:24:27,926 WARN L315 ript$VariableManager]: TermVariabe Thread1_P0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:24:27,927 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:24:27,927 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:24:27,927 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:24:27,927 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:24:27,928 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:24:27,928 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:24:27,928 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:24:27,928 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:24:27,928 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:24:27,929 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:24:27,929 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:24:27,929 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:24:27,929 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:24:27,929 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:24:27,930 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:24:27,930 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:24:27,930 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:24:27,930 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:24:27,930 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:24:27,931 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:24:27,931 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:24:27,931 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:24:27,931 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:24:27,931 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:24:27,932 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:24:27,932 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:24:27,932 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:24:27,932 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:24:27,932 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:24:27,933 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:24:27,933 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:24:27,933 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:24:27,933 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:24:27,933 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:24:27,933 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:24:27,934 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:24:27,934 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:24:27,934 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:24:27,934 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:24:27,935 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:24:27,935 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:24:27,935 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:24:27,935 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:24:27,935 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:24:27,936 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:24:27,936 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:24:27,936 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:24:27,936 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:24:27,936 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:24:27,936 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:24:27,937 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:24:27,937 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:24:27,937 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:24:27,937 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:24:27,937 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:24:27,938 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:24:27,938 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:24:27,938 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:24:27,938 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:24:27,938 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:24:27,939 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:24:27,939 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:24:27,939 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:24:27,939 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:24:27,939 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:24:27,940 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:24:27,940 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:24:27,940 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:24:27,940 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:24:27,940 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:24:27,940 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:24:27,941 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:24:27,941 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:24:27,941 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:24:27,941 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:24:27,942 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:24:27,942 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:24:27,942 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:24:27,942 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:24:27,942 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:24:27,943 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:24:27,943 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:24:27,943 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:24:27,943 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:24:27,943 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:24:27,943 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:24:27,944 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:24:27,944 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:24:27,944 WARN L315 ript$VariableManager]: TermVariabe Thread0_P1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:24:27,945 WARN L315 ript$VariableManager]: TermVariabe Thread0_P1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:24:27,945 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:24:27,945 WARN L315 ript$VariableManager]: TermVariabe Thread0_P1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:24:27,945 WARN L315 ript$VariableManager]: TermVariabe Thread0_P1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:24:27,945 WARN L315 ript$VariableManager]: TermVariabe Thread0_P1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:24:27,946 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:24:27,946 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:24:27,946 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:24:27,946 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:24:27,947 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:24:27,947 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:24:27,947 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:24:27,947 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:24:27,947 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:24:27,948 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:24:27,948 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:24:27,948 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:24:27,948 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:24:27,948 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:24:27,949 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:24:27,949 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:24:27,949 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:24:27,949 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:24:27,949 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:24:27,950 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:24:27,950 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:24:27,950 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:24:27,950 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:24:27,950 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:24:27,951 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:24:27,951 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:24:27,957 WARN L141 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-11-16 00:24:27,957 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-16 00:24:27,966 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 3 error locations. [2019-11-16 00:24:27,979 INFO L249 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2019-11-16 00:24:28,000 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-16 00:24:28,000 INFO L374 AbstractCegarLoop]: Hoare is true [2019-11-16 00:24:28,000 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-16 00:24:28,001 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-16 00:24:28,001 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-16 00:24:28,002 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-16 00:24:28,002 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-16 00:24:28,002 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-16 00:24:28,026 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 130 places, 162 transitions [2019-11-16 00:24:30,190 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 25976 states. [2019-11-16 00:24:30,192 INFO L276 IsEmpty]: Start isEmpty. Operand 25976 states. [2019-11-16 00:24:30,204 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2019-11-16 00:24:30,204 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:24:30,205 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] [2019-11-16 00:24:30,208 INFO L410 AbstractCegarLoop]: === Iteration 1 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:24:30,213 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:24:30,213 INFO L82 PathProgramCache]: Analyzing trace with hash 607370489, now seen corresponding path program 1 times [2019-11-16 00:24:30,221 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:24:30,221 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [723125449] [2019-11-16 00:24:30,221 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:24:30,221 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:24:30,222 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:24:30,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:24:30,564 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:24:30,565 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [723125449] [2019-11-16 00:24:30,566 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:24:30,567 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-16 00:24:30,567 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [650798998] [2019-11-16 00:24:30,572 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-16 00:24:30,572 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:24:30,588 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-16 00:24:30,589 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-16 00:24:30,591 INFO L87 Difference]: Start difference. First operand 25976 states. Second operand 4 states. [2019-11-16 00:24:31,261 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:24:31,261 INFO L93 Difference]: Finished difference Result 26616 states and 102121 transitions. [2019-11-16 00:24:31,261 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-16 00:24:31,263 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 39 [2019-11-16 00:24:31,263 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:24:31,495 INFO L225 Difference]: With dead ends: 26616 [2019-11-16 00:24:31,495 INFO L226 Difference]: Without dead ends: 20360 [2019-11-16 00:24:31,497 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:24:31,773 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20360 states. [2019-11-16 00:24:32,575 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20360 to 20360. [2019-11-16 00:24:32,577 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20360 states. [2019-11-16 00:24:32,722 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20360 states to 20360 states and 78425 transitions. [2019-11-16 00:24:32,723 INFO L78 Accepts]: Start accepts. Automaton has 20360 states and 78425 transitions. Word has length 39 [2019-11-16 00:24:32,725 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:24:32,725 INFO L462 AbstractCegarLoop]: Abstraction has 20360 states and 78425 transitions. [2019-11-16 00:24:32,725 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-16 00:24:32,726 INFO L276 IsEmpty]: Start isEmpty. Operand 20360 states and 78425 transitions. [2019-11-16 00:24:32,748 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2019-11-16 00:24:32,748 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:24:32,748 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] [2019-11-16 00:24:32,748 INFO L410 AbstractCegarLoop]: === Iteration 2 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:24:32,753 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:24:32,753 INFO L82 PathProgramCache]: Analyzing trace with hash -885351668, now seen corresponding path program 1 times [2019-11-16 00:24:32,753 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:24:32,754 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [484729758] [2019-11-16 00:24:32,754 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:24:32,754 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:24:32,754 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:24:32,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:24:32,868 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:24:32,868 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [484729758] [2019-11-16 00:24:32,868 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:24:32,868 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-16 00:24:32,868 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [971995968] [2019-11-16 00:24:32,870 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-16 00:24:32,870 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:24:32,870 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-16 00:24:32,870 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-16 00:24:32,871 INFO L87 Difference]: Start difference. First operand 20360 states and 78425 transitions. Second operand 5 states. [2019-11-16 00:24:33,725 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:24:33,725 INFO L93 Difference]: Finished difference Result 31838 states and 116042 transitions. [2019-11-16 00:24:33,725 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-11-16 00:24:33,726 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 47 [2019-11-16 00:24:33,726 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:24:33,871 INFO L225 Difference]: With dead ends: 31838 [2019-11-16 00:24:33,872 INFO L226 Difference]: Without dead ends: 31286 [2019-11-16 00:24:33,873 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:24:34,453 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31286 states. [2019-11-16 00:24:35,084 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31286 to 29705. [2019-11-16 00:24:35,085 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29705 states. [2019-11-16 00:24:35,185 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29705 states to 29705 states and 109519 transitions. [2019-11-16 00:24:35,185 INFO L78 Accepts]: Start accepts. Automaton has 29705 states and 109519 transitions. Word has length 47 [2019-11-16 00:24:35,186 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:24:35,186 INFO L462 AbstractCegarLoop]: Abstraction has 29705 states and 109519 transitions. [2019-11-16 00:24:35,187 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-16 00:24:35,187 INFO L276 IsEmpty]: Start isEmpty. Operand 29705 states and 109519 transitions. [2019-11-16 00:24:35,192 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2019-11-16 00:24:35,192 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:24:35,193 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:24:35,193 INFO L410 AbstractCegarLoop]: === Iteration 3 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:24:35,193 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:24:35,193 INFO L82 PathProgramCache]: Analyzing trace with hash -117471466, now seen corresponding path program 1 times [2019-11-16 00:24:35,194 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:24:35,194 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [80866331] [2019-11-16 00:24:35,194 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:24:35,194 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:24:35,195 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:24:35,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:24:35,293 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:24:35,294 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [80866331] [2019-11-16 00:24:35,294 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:24:35,294 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-16 00:24:35,294 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [241649983] [2019-11-16 00:24:35,295 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-16 00:24:35,295 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:24:35,295 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-16 00:24:35,296 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-16 00:24:35,296 INFO L87 Difference]: Start difference. First operand 29705 states and 109519 transitions. Second operand 5 states. [2019-11-16 00:24:36,285 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:24:36,286 INFO L93 Difference]: Finished difference Result 38696 states and 139691 transitions. [2019-11-16 00:24:36,287 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-11-16 00:24:36,287 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 48 [2019-11-16 00:24:36,287 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:24:36,439 INFO L225 Difference]: With dead ends: 38696 [2019-11-16 00:24:36,440 INFO L226 Difference]: Without dead ends: 38248 [2019-11-16 00:24:36,440 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:24:36,725 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38248 states. [2019-11-16 00:24:37,397 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38248 to 32951. [2019-11-16 00:24:37,397 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32951 states. [2019-11-16 00:24:37,484 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32951 states to 32951 states and 120528 transitions. [2019-11-16 00:24:37,484 INFO L78 Accepts]: Start accepts. Automaton has 32951 states and 120528 transitions. Word has length 48 [2019-11-16 00:24:37,484 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:24:37,485 INFO L462 AbstractCegarLoop]: Abstraction has 32951 states and 120528 transitions. [2019-11-16 00:24:37,485 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-16 00:24:37,485 INFO L276 IsEmpty]: Start isEmpty. Operand 32951 states and 120528 transitions. [2019-11-16 00:24:37,494 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2019-11-16 00:24:37,495 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:24:37,495 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] [2019-11-16 00:24:37,495 INFO L410 AbstractCegarLoop]: === Iteration 4 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:24:37,496 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:24:37,496 INFO L82 PathProgramCache]: Analyzing trace with hash -337403140, now seen corresponding path program 1 times [2019-11-16 00:24:37,496 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:24:37,496 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [698561659] [2019-11-16 00:24:37,497 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:24:37,497 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:24:37,497 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:24:37,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:24:37,545 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:24:37,545 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [698561659] [2019-11-16 00:24:37,546 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:24:37,546 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-16 00:24:37,546 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [814160410] [2019-11-16 00:24:37,546 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-16 00:24:37,546 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:24:37,547 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-16 00:24:37,547 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-16 00:24:37,547 INFO L87 Difference]: Start difference. First operand 32951 states and 120528 transitions. Second operand 3 states. [2019-11-16 00:24:38,166 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:24:38,166 INFO L93 Difference]: Finished difference Result 42412 states and 152019 transitions. [2019-11-16 00:24:38,167 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-16 00:24:38,167 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 50 [2019-11-16 00:24:38,167 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:24:38,283 INFO L225 Difference]: With dead ends: 42412 [2019-11-16 00:24:38,283 INFO L226 Difference]: Without dead ends: 42412 [2019-11-16 00:24:38,283 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:24:38,512 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42412 states. [2019-11-16 00:24:39,036 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42412 to 37665. [2019-11-16 00:24:39,036 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37665 states. [2019-11-16 00:24:39,110 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37665 states to 37665 states and 136332 transitions. [2019-11-16 00:24:39,111 INFO L78 Accepts]: Start accepts. Automaton has 37665 states and 136332 transitions. Word has length 50 [2019-11-16 00:24:39,111 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:24:39,111 INFO L462 AbstractCegarLoop]: Abstraction has 37665 states and 136332 transitions. [2019-11-16 00:24:39,111 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-16 00:24:39,111 INFO L276 IsEmpty]: Start isEmpty. Operand 37665 states and 136332 transitions. [2019-11-16 00:24:39,127 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-11-16 00:24:39,127 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:24:39,128 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] [2019-11-16 00:24:39,128 INFO L410 AbstractCegarLoop]: === Iteration 5 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:24:39,128 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:24:39,128 INFO L82 PathProgramCache]: Analyzing trace with hash 259150685, now seen corresponding path program 1 times [2019-11-16 00:24:39,129 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:24:39,129 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1057352248] [2019-11-16 00:24:39,129 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:24:39,129 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:24:39,129 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:24:39,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:24:39,208 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:24:39,209 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1057352248] [2019-11-16 00:24:39,209 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:24:39,209 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-11-16 00:24:39,209 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1830673525] [2019-11-16 00:24:39,210 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-16 00:24:39,210 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:24:39,210 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-16 00:24:39,210 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-11-16 00:24:39,210 INFO L87 Difference]: Start difference. First operand 37665 states and 136332 transitions. Second operand 6 states. [2019-11-16 00:24:39,880 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:24:39,881 INFO L93 Difference]: Finished difference Result 48756 states and 172981 transitions. [2019-11-16 00:24:39,881 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-11-16 00:24:39,881 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 54 [2019-11-16 00:24:39,882 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:24:40,016 INFO L225 Difference]: With dead ends: 48756 [2019-11-16 00:24:40,016 INFO L226 Difference]: Without dead ends: 48236 [2019-11-16 00:24:40,018 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:24:40,328 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48236 states. [2019-11-16 00:24:41,279 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48236 to 38229. [2019-11-16 00:24:41,279 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38229 states. [2019-11-16 00:24:41,356 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38229 states to 38229 states and 138495 transitions. [2019-11-16 00:24:41,356 INFO L78 Accepts]: Start accepts. Automaton has 38229 states and 138495 transitions. Word has length 54 [2019-11-16 00:24:41,356 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:24:41,356 INFO L462 AbstractCegarLoop]: Abstraction has 38229 states and 138495 transitions. [2019-11-16 00:24:41,356 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-16 00:24:41,356 INFO L276 IsEmpty]: Start isEmpty. Operand 38229 states and 138495 transitions. [2019-11-16 00:24:41,369 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-11-16 00:24:41,369 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:24:41,369 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] [2019-11-16 00:24:41,370 INFO L410 AbstractCegarLoop]: === Iteration 6 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:24:41,370 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:24:41,370 INFO L82 PathProgramCache]: Analyzing trace with hash -1550627923, now seen corresponding path program 1 times [2019-11-16 00:24:41,370 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:24:41,371 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2138577671] [2019-11-16 00:24:41,371 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:24:41,371 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:24:41,371 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:24:41,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:24:41,500 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:24:41,500 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2138577671] [2019-11-16 00:24:41,500 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:24:41,501 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-11-16 00:24:41,501 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [78565591] [2019-11-16 00:24:41,501 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-16 00:24:41,501 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:24:41,501 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-16 00:24:41,502 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-11-16 00:24:41,502 INFO L87 Difference]: Start difference. First operand 38229 states and 138495 transitions. Second operand 6 states. [2019-11-16 00:24:42,216 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:24:42,216 INFO L93 Difference]: Finished difference Result 53005 states and 189571 transitions. [2019-11-16 00:24:42,217 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-11-16 00:24:42,217 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 54 [2019-11-16 00:24:42,217 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:24:42,324 INFO L225 Difference]: With dead ends: 53005 [2019-11-16 00:24:42,325 INFO L226 Difference]: Without dead ends: 52029 [2019-11-16 00:24:42,325 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:24:42,521 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52029 states. [2019-11-16 00:24:43,504 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52029 to 48782. [2019-11-16 00:24:43,504 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48782 states. [2019-11-16 00:24:43,626 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48782 states to 48782 states and 175226 transitions. [2019-11-16 00:24:43,626 INFO L78 Accepts]: Start accepts. Automaton has 48782 states and 175226 transitions. Word has length 54 [2019-11-16 00:24:43,626 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:24:43,626 INFO L462 AbstractCegarLoop]: Abstraction has 48782 states and 175226 transitions. [2019-11-16 00:24:43,626 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-16 00:24:43,627 INFO L276 IsEmpty]: Start isEmpty. Operand 48782 states and 175226 transitions. [2019-11-16 00:24:43,644 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-11-16 00:24:43,644 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:24:43,644 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] [2019-11-16 00:24:43,644 INFO L410 AbstractCegarLoop]: === Iteration 7 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:24:43,644 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:24:43,645 INFO L82 PathProgramCache]: Analyzing trace with hash 947388014, now seen corresponding path program 1 times [2019-11-16 00:24:43,645 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:24:43,645 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1700142404] [2019-11-16 00:24:43,645 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:24:43,645 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:24:43,645 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:24:43,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:24:43,784 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:24:43,786 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1700142404] [2019-11-16 00:24:43,786 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:24:43,786 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-11-16 00:24:43,787 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1985703916] [2019-11-16 00:24:43,787 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-11-16 00:24:43,787 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:24:43,788 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-11-16 00:24:43,789 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2019-11-16 00:24:43,790 INFO L87 Difference]: Start difference. First operand 48782 states and 175226 transitions. Second operand 7 states. [2019-11-16 00:24:45,149 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:24:45,149 INFO L93 Difference]: Finished difference Result 70897 states and 244523 transitions. [2019-11-16 00:24:45,150 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-11-16 00:24:45,150 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 54 [2019-11-16 00:24:45,150 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:24:45,294 INFO L225 Difference]: With dead ends: 70897 [2019-11-16 00:24:45,294 INFO L226 Difference]: Without dead ends: 70897 [2019-11-16 00:24:45,294 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2019-11-16 00:24:45,525 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70897 states. [2019-11-16 00:24:46,261 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70897 to 57890. [2019-11-16 00:24:46,261 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 57890 states. [2019-11-16 00:24:47,084 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57890 states to 57890 states and 203150 transitions. [2019-11-16 00:24:47,084 INFO L78 Accepts]: Start accepts. Automaton has 57890 states and 203150 transitions. Word has length 54 [2019-11-16 00:24:47,084 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:24:47,084 INFO L462 AbstractCegarLoop]: Abstraction has 57890 states and 203150 transitions. [2019-11-16 00:24:47,085 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-11-16 00:24:47,085 INFO L276 IsEmpty]: Start isEmpty. Operand 57890 states and 203150 transitions. [2019-11-16 00:24:47,097 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-11-16 00:24:47,097 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:24:47,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] [2019-11-16 00:24:47,097 INFO L410 AbstractCegarLoop]: === Iteration 8 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:24:47,097 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:24:47,097 INFO L82 PathProgramCache]: Analyzing trace with hash 1834891695, now seen corresponding path program 1 times [2019-11-16 00:24:47,097 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:24:47,097 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [322476393] [2019-11-16 00:24:47,098 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:24:47,098 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:24:47,098 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:24:47,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:24:47,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:24:47,171 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [322476393] [2019-11-16 00:24:47,171 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:24:47,171 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-16 00:24:47,171 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1906878914] [2019-11-16 00:24:47,171 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-16 00:24:47,171 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:24:47,172 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-16 00:24:47,172 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-16 00:24:47,172 INFO L87 Difference]: Start difference. First operand 57890 states and 203150 transitions. Second operand 4 states. [2019-11-16 00:24:47,226 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:24:47,226 INFO L93 Difference]: Finished difference Result 10860 states and 33395 transitions. [2019-11-16 00:24:47,227 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-16 00:24:47,227 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 54 [2019-11-16 00:24:47,227 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:24:47,238 INFO L225 Difference]: With dead ends: 10860 [2019-11-16 00:24:47,238 INFO L226 Difference]: Without dead ends: 9361 [2019-11-16 00:24:47,238 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:24:47,253 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9361 states. [2019-11-16 00:24:47,325 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9361 to 9313. [2019-11-16 00:24:47,325 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9313 states. [2019-11-16 00:24:47,338 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9313 states to 9313 states and 28345 transitions. [2019-11-16 00:24:47,338 INFO L78 Accepts]: Start accepts. Automaton has 9313 states and 28345 transitions. Word has length 54 [2019-11-16 00:24:47,338 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:24:47,338 INFO L462 AbstractCegarLoop]: Abstraction has 9313 states and 28345 transitions. [2019-11-16 00:24:47,338 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-16 00:24:47,338 INFO L276 IsEmpty]: Start isEmpty. Operand 9313 states and 28345 transitions. [2019-11-16 00:24:47,342 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-11-16 00:24:47,342 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:24:47,342 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] [2019-11-16 00:24:47,342 INFO L410 AbstractCegarLoop]: === Iteration 9 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:24:47,342 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:24:47,343 INFO L82 PathProgramCache]: Analyzing trace with hash 718943446, now seen corresponding path program 1 times [2019-11-16 00:24:47,343 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:24:47,343 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2140153125] [2019-11-16 00:24:47,343 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:24:47,343 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:24:47,343 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:24:47,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:24:47,401 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:24:47,403 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2140153125] [2019-11-16 00:24:47,403 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:24:47,404 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-16 00:24:47,404 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [219668589] [2019-11-16 00:24:47,405 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-16 00:24:47,405 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:24:47,405 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-16 00:24:47,406 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-16 00:24:47,406 INFO L87 Difference]: Start difference. First operand 9313 states and 28345 transitions. Second operand 4 states. [2019-11-16 00:24:47,561 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:24:47,561 INFO L93 Difference]: Finished difference Result 10888 states and 33037 transitions. [2019-11-16 00:24:47,561 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-16 00:24:47,561 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 64 [2019-11-16 00:24:47,562 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:24:47,575 INFO L225 Difference]: With dead ends: 10888 [2019-11-16 00:24:47,575 INFO L226 Difference]: Without dead ends: 10888 [2019-11-16 00:24:47,575 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:24:47,593 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10888 states. [2019-11-16 00:24:47,685 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10888 to 9880. [2019-11-16 00:24:47,685 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9880 states. [2019-11-16 00:24:47,699 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9880 states to 9880 states and 30016 transitions. [2019-11-16 00:24:47,700 INFO L78 Accepts]: Start accepts. Automaton has 9880 states and 30016 transitions. Word has length 64 [2019-11-16 00:24:47,700 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:24:47,700 INFO L462 AbstractCegarLoop]: Abstraction has 9880 states and 30016 transitions. [2019-11-16 00:24:47,700 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-16 00:24:47,700 INFO L276 IsEmpty]: Start isEmpty. Operand 9880 states and 30016 transitions. [2019-11-16 00:24:47,704 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-11-16 00:24:47,704 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:24:47,705 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] [2019-11-16 00:24:47,705 INFO L410 AbstractCegarLoop]: === Iteration 10 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:24:47,705 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:24:47,705 INFO L82 PathProgramCache]: Analyzing trace with hash -1833213515, now seen corresponding path program 1 times [2019-11-16 00:24:47,705 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:24:47,706 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [666365511] [2019-11-16 00:24:47,706 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:24:47,706 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:24:47,706 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:24:47,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:24:47,769 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:24:47,769 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [666365511] [2019-11-16 00:24:47,769 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:24:47,770 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-11-16 00:24:47,770 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [206768238] [2019-11-16 00:24:47,770 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-16 00:24:47,770 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:24:47,770 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-16 00:24:47,771 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-11-16 00:24:47,771 INFO L87 Difference]: Start difference. First operand 9880 states and 30016 transitions. Second operand 6 states. [2019-11-16 00:24:48,245 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:24:48,245 INFO L93 Difference]: Finished difference Result 12786 states and 38226 transitions. [2019-11-16 00:24:48,246 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-11-16 00:24:48,246 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 64 [2019-11-16 00:24:48,246 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:24:48,264 INFO L225 Difference]: With dead ends: 12786 [2019-11-16 00:24:48,264 INFO L226 Difference]: Without dead ends: 12738 [2019-11-16 00:24:48,265 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=52, Invalid=130, Unknown=0, NotChecked=0, Total=182 [2019-11-16 00:24:48,285 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12738 states. [2019-11-16 00:24:48,389 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12738 to 10619. [2019-11-16 00:24:48,389 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10619 states. [2019-11-16 00:24:48,406 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10619 states to 10619 states and 32069 transitions. [2019-11-16 00:24:48,407 INFO L78 Accepts]: Start accepts. Automaton has 10619 states and 32069 transitions. Word has length 64 [2019-11-16 00:24:48,407 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:24:48,407 INFO L462 AbstractCegarLoop]: Abstraction has 10619 states and 32069 transitions. [2019-11-16 00:24:48,407 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-16 00:24:48,407 INFO L276 IsEmpty]: Start isEmpty. Operand 10619 states and 32069 transitions. [2019-11-16 00:24:48,414 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-11-16 00:24:48,414 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:24:48,414 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:24:48,414 INFO L410 AbstractCegarLoop]: === Iteration 11 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:24:48,415 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:24:48,415 INFO L82 PathProgramCache]: Analyzing trace with hash -960211393, now seen corresponding path program 1 times [2019-11-16 00:24:48,415 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:24:48,415 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1077995404] [2019-11-16 00:24:48,415 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:24:48,416 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:24:48,416 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:24:48,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:24:48,492 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:24:48,492 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1077995404] [2019-11-16 00:24:48,492 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:24:48,492 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-16 00:24:48,493 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1730589469] [2019-11-16 00:24:48,493 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-16 00:24:48,493 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:24:48,493 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-16 00:24:48,493 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-16 00:24:48,493 INFO L87 Difference]: Start difference. First operand 10619 states and 32069 transitions. Second operand 4 states. [2019-11-16 00:24:48,716 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:24:48,716 INFO L93 Difference]: Finished difference Result 13321 states and 39671 transitions. [2019-11-16 00:24:48,717 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-16 00:24:48,717 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 66 [2019-11-16 00:24:48,717 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:24:48,734 INFO L225 Difference]: With dead ends: 13321 [2019-11-16 00:24:48,734 INFO L226 Difference]: Without dead ends: 13321 [2019-11-16 00:24:48,735 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:24:48,756 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13321 states. [2019-11-16 00:24:48,876 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13321 to 12175. [2019-11-16 00:24:48,876 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12175 states. [2019-11-16 00:24:48,899 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12175 states to 12175 states and 36360 transitions. [2019-11-16 00:24:48,899 INFO L78 Accepts]: Start accepts. Automaton has 12175 states and 36360 transitions. Word has length 66 [2019-11-16 00:24:48,899 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:24:48,899 INFO L462 AbstractCegarLoop]: Abstraction has 12175 states and 36360 transitions. [2019-11-16 00:24:48,899 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-16 00:24:48,899 INFO L276 IsEmpty]: Start isEmpty. Operand 12175 states and 36360 transitions. [2019-11-16 00:24:48,909 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-11-16 00:24:48,909 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:24:48,910 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:24:48,910 INFO L410 AbstractCegarLoop]: === Iteration 12 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:24:48,910 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:24:48,910 INFO L82 PathProgramCache]: Analyzing trace with hash 1257546560, now seen corresponding path program 1 times [2019-11-16 00:24:48,910 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:24:48,910 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [579734264] [2019-11-16 00:24:48,910 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:24:48,911 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:24:48,911 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:24:48,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:24:48,960 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:24:48,960 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [579734264] [2019-11-16 00:24:48,961 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:24:48,961 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-16 00:24:48,961 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [630962328] [2019-11-16 00:24:48,961 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-16 00:24:48,961 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:24:48,961 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-16 00:24:48,962 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-16 00:24:48,962 INFO L87 Difference]: Start difference. First operand 12175 states and 36360 transitions. Second operand 3 states. [2019-11-16 00:24:49,159 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:24:49,159 INFO L93 Difference]: Finished difference Result 12701 states and 37765 transitions. [2019-11-16 00:24:49,159 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-16 00:24:49,160 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 66 [2019-11-16 00:24:49,160 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:24:49,176 INFO L225 Difference]: With dead ends: 12701 [2019-11-16 00:24:49,177 INFO L226 Difference]: Without dead ends: 12701 [2019-11-16 00:24:49,177 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:24:49,199 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12701 states. [2019-11-16 00:24:49,320 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12701 to 12463. [2019-11-16 00:24:49,320 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12463 states. [2019-11-16 00:24:49,352 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12463 states to 12463 states and 37124 transitions. [2019-11-16 00:24:49,352 INFO L78 Accepts]: Start accepts. Automaton has 12463 states and 37124 transitions. Word has length 66 [2019-11-16 00:24:49,352 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:24:49,352 INFO L462 AbstractCegarLoop]: Abstraction has 12463 states and 37124 transitions. [2019-11-16 00:24:49,353 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-16 00:24:49,353 INFO L276 IsEmpty]: Start isEmpty. Operand 12463 states and 37124 transitions. [2019-11-16 00:24:49,367 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2019-11-16 00:24:49,367 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:24:49,368 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] [2019-11-16 00:24:49,368 INFO L410 AbstractCegarLoop]: === Iteration 13 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:24:49,368 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:24:49,368 INFO L82 PathProgramCache]: Analyzing trace with hash -749438172, now seen corresponding path program 1 times [2019-11-16 00:24:49,369 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:24:49,369 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2061698515] [2019-11-16 00:24:49,369 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:24:49,369 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:24:49,369 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:24:49,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:24:49,467 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:24:49,467 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2061698515] [2019-11-16 00:24:49,467 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:24:49,467 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-11-16 00:24:49,467 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1953015488] [2019-11-16 00:24:49,467 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-16 00:24:49,468 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:24:49,468 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-16 00:24:49,468 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-11-16 00:24:49,468 INFO L87 Difference]: Start difference. First operand 12463 states and 37124 transitions. Second operand 6 states. [2019-11-16 00:24:49,981 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:24:49,982 INFO L93 Difference]: Finished difference Result 13734 states and 40363 transitions. [2019-11-16 00:24:49,982 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-11-16 00:24:49,982 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 68 [2019-11-16 00:24:49,982 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:24:49,999 INFO L225 Difference]: With dead ends: 13734 [2019-11-16 00:24:49,999 INFO L226 Difference]: Without dead ends: 13734 [2019-11-16 00:24:49,999 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:24:50,020 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13734 states. [2019-11-16 00:24:50,141 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13734 to 13248. [2019-11-16 00:24:50,142 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13248 states. [2019-11-16 00:24:50,163 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13248 states to 13248 states and 39079 transitions. [2019-11-16 00:24:50,163 INFO L78 Accepts]: Start accepts. Automaton has 13248 states and 39079 transitions. Word has length 68 [2019-11-16 00:24:50,163 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:24:50,163 INFO L462 AbstractCegarLoop]: Abstraction has 13248 states and 39079 transitions. [2019-11-16 00:24:50,163 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-16 00:24:50,163 INFO L276 IsEmpty]: Start isEmpty. Operand 13248 states and 39079 transitions. [2019-11-16 00:24:50,174 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2019-11-16 00:24:50,174 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:24:50,174 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] [2019-11-16 00:24:50,174 INFO L410 AbstractCegarLoop]: === Iteration 14 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:24:50,175 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:24:50,175 INFO L82 PathProgramCache]: Analyzing trace with hash 1468319781, now seen corresponding path program 1 times [2019-11-16 00:24:50,175 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:24:50,175 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [514545234] [2019-11-16 00:24:50,175 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:24:50,176 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:24:50,176 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:24:50,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:24:50,302 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:24:50,302 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [514545234] [2019-11-16 00:24:50,302 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:24:50,303 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-11-16 00:24:50,303 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1806007650] [2019-11-16 00:24:50,303 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-16 00:24:50,303 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:24:50,303 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-16 00:24:50,304 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-11-16 00:24:50,304 INFO L87 Difference]: Start difference. First operand 13248 states and 39079 transitions. Second operand 6 states. [2019-11-16 00:24:50,663 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:24:50,664 INFO L93 Difference]: Finished difference Result 15571 states and 44589 transitions. [2019-11-16 00:24:50,664 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-11-16 00:24:50,664 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 68 [2019-11-16 00:24:50,665 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:24:50,683 INFO L225 Difference]: With dead ends: 15571 [2019-11-16 00:24:50,683 INFO L226 Difference]: Without dead ends: 15571 [2019-11-16 00:24:50,684 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=26, Invalid=46, Unknown=0, NotChecked=0, Total=72 [2019-11-16 00:24:50,710 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15571 states. [2019-11-16 00:24:51,208 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15571 to 13822. [2019-11-16 00:24:51,208 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13822 states. [2019-11-16 00:24:51,231 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13822 states to 13822 states and 39929 transitions. [2019-11-16 00:24:51,231 INFO L78 Accepts]: Start accepts. Automaton has 13822 states and 39929 transitions. Word has length 68 [2019-11-16 00:24:51,232 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:24:51,232 INFO L462 AbstractCegarLoop]: Abstraction has 13822 states and 39929 transitions. [2019-11-16 00:24:51,232 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-16 00:24:51,232 INFO L276 IsEmpty]: Start isEmpty. Operand 13822 states and 39929 transitions. [2019-11-16 00:24:51,242 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2019-11-16 00:24:51,242 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:24:51,242 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] [2019-11-16 00:24:51,242 INFO L410 AbstractCegarLoop]: === Iteration 15 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:24:51,242 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:24:51,242 INFO L82 PathProgramCache]: Analyzing trace with hash 1679670694, now seen corresponding path program 1 times [2019-11-16 00:24:51,242 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:24:51,243 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [137218359] [2019-11-16 00:24:51,243 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:24:51,243 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:24:51,243 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:24:51,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:24:51,306 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:24:51,306 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [137218359] [2019-11-16 00:24:51,306 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:24:51,306 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-16 00:24:51,306 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1640555026] [2019-11-16 00:24:51,307 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-16 00:24:51,307 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:24:51,307 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-16 00:24:51,307 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-16 00:24:51,307 INFO L87 Difference]: Start difference. First operand 13822 states and 39929 transitions. Second operand 5 states. [2019-11-16 00:24:51,606 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:24:51,606 INFO L93 Difference]: Finished difference Result 17383 states and 50008 transitions. [2019-11-16 00:24:51,606 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-11-16 00:24:51,606 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 68 [2019-11-16 00:24:51,606 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:24:51,626 INFO L225 Difference]: With dead ends: 17383 [2019-11-16 00:24:51,626 INFO L226 Difference]: Without dead ends: 17383 [2019-11-16 00:24:51,627 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:24:51,654 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17383 states. [2019-11-16 00:24:51,794 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17383 to 14860. [2019-11-16 00:24:51,794 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14860 states. [2019-11-16 00:24:51,817 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14860 states to 14860 states and 42561 transitions. [2019-11-16 00:24:51,817 INFO L78 Accepts]: Start accepts. Automaton has 14860 states and 42561 transitions. Word has length 68 [2019-11-16 00:24:51,817 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:24:51,817 INFO L462 AbstractCegarLoop]: Abstraction has 14860 states and 42561 transitions. [2019-11-16 00:24:51,817 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-16 00:24:51,818 INFO L276 IsEmpty]: Start isEmpty. Operand 14860 states and 42561 transitions. [2019-11-16 00:24:51,825 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2019-11-16 00:24:51,825 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:24:51,825 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] [2019-11-16 00:24:51,826 INFO L410 AbstractCegarLoop]: === Iteration 16 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:24:51,826 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:24:51,826 INFO L82 PathProgramCache]: Analyzing trace with hash 1169136517, now seen corresponding path program 1 times [2019-11-16 00:24:51,826 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:24:51,826 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2070806086] [2019-11-16 00:24:51,826 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:24:51,827 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:24:51,827 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:24:51,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:24:51,887 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:24:51,887 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2070806086] [2019-11-16 00:24:51,888 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:24:51,888 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-16 00:24:51,888 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1751483696] [2019-11-16 00:24:51,888 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-16 00:24:51,888 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:24:51,889 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-16 00:24:51,889 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-16 00:24:51,889 INFO L87 Difference]: Start difference. First operand 14860 states and 42561 transitions. Second operand 5 states. [2019-11-16 00:24:52,319 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:24:52,319 INFO L93 Difference]: Finished difference Result 19765 states and 56508 transitions. [2019-11-16 00:24:52,320 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-11-16 00:24:52,320 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 68 [2019-11-16 00:24:52,320 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:24:52,343 INFO L225 Difference]: With dead ends: 19765 [2019-11-16 00:24:52,343 INFO L226 Difference]: Without dead ends: 19765 [2019-11-16 00:24:52,344 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 3 SyntacticMatches, 2 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:24:52,372 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19765 states. [2019-11-16 00:24:52,537 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19765 to 15765. [2019-11-16 00:24:52,537 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15765 states. [2019-11-16 00:24:52,561 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15765 states to 15765 states and 45147 transitions. [2019-11-16 00:24:52,561 INFO L78 Accepts]: Start accepts. Automaton has 15765 states and 45147 transitions. Word has length 68 [2019-11-16 00:24:52,562 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:24:52,562 INFO L462 AbstractCegarLoop]: Abstraction has 15765 states and 45147 transitions. [2019-11-16 00:24:52,562 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-16 00:24:52,562 INFO L276 IsEmpty]: Start isEmpty. Operand 15765 states and 45147 transitions. [2019-11-16 00:24:52,569 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2019-11-16 00:24:52,570 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:24:52,570 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] [2019-11-16 00:24:52,570 INFO L410 AbstractCegarLoop]: === Iteration 17 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:24:52,570 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:24:52,570 INFO L82 PathProgramCache]: Analyzing trace with hash -638317946, now seen corresponding path program 1 times [2019-11-16 00:24:52,573 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:24:52,573 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1281844071] [2019-11-16 00:24:52,573 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:24:52,573 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:24:52,574 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:24:52,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:24:52,671 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:24:52,671 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1281844071] [2019-11-16 00:24:52,672 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:24:52,672 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-11-16 00:24:52,672 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1795978466] [2019-11-16 00:24:52,672 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-16 00:24:52,672 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:24:52,673 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-16 00:24:52,673 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-11-16 00:24:52,673 INFO L87 Difference]: Start difference. First operand 15765 states and 45147 transitions. Second operand 6 states. [2019-11-16 00:24:53,520 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:24:53,520 INFO L93 Difference]: Finished difference Result 24912 states and 71471 transitions. [2019-11-16 00:24:53,520 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-11-16 00:24:53,521 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 68 [2019-11-16 00:24:53,521 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:24:53,557 INFO L225 Difference]: With dead ends: 24912 [2019-11-16 00:24:53,557 INFO L226 Difference]: Without dead ends: 24912 [2019-11-16 00:24:53,557 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2019-11-16 00:24:53,596 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24912 states. [2019-11-16 00:24:53,815 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24912 to 19875. [2019-11-16 00:24:53,815 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19875 states. [2019-11-16 00:24:53,851 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19875 states to 19875 states and 57550 transitions. [2019-11-16 00:24:53,852 INFO L78 Accepts]: Start accepts. Automaton has 19875 states and 57550 transitions. Word has length 68 [2019-11-16 00:24:53,852 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:24:53,852 INFO L462 AbstractCegarLoop]: Abstraction has 19875 states and 57550 transitions. [2019-11-16 00:24:53,852 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-16 00:24:53,852 INFO L276 IsEmpty]: Start isEmpty. Operand 19875 states and 57550 transitions. [2019-11-16 00:24:53,862 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2019-11-16 00:24:53,863 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:24:53,863 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] [2019-11-16 00:24:53,863 INFO L410 AbstractCegarLoop]: === Iteration 18 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:24:53,864 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:24:53,864 INFO L82 PathProgramCache]: Analyzing trace with hash 249185735, now seen corresponding path program 1 times [2019-11-16 00:24:53,864 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:24:53,864 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [779400641] [2019-11-16 00:24:53,864 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:24:53,865 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:24:53,865 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:24:53,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:24:53,917 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:24:53,917 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [779400641] [2019-11-16 00:24:53,918 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:24:53,918 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-16 00:24:53,918 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [139404601] [2019-11-16 00:24:53,918 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-16 00:24:53,919 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:24:53,919 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-16 00:24:53,919 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-16 00:24:53,919 INFO L87 Difference]: Start difference. First operand 19875 states and 57550 transitions. Second operand 4 states. [2019-11-16 00:24:54,323 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:24:54,324 INFO L93 Difference]: Finished difference Result 21582 states and 61994 transitions. [2019-11-16 00:24:54,324 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-16 00:24:54,324 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 68 [2019-11-16 00:24:54,324 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:24:54,352 INFO L225 Difference]: With dead ends: 21582 [2019-11-16 00:24:54,353 INFO L226 Difference]: Without dead ends: 21246 [2019-11-16 00:24:54,353 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:24:54,384 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21246 states. [2019-11-16 00:24:54,578 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21246 to 19704. [2019-11-16 00:24:54,579 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19704 states. [2019-11-16 00:24:54,613 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19704 states to 19704 states and 56674 transitions. [2019-11-16 00:24:54,613 INFO L78 Accepts]: Start accepts. Automaton has 19704 states and 56674 transitions. Word has length 68 [2019-11-16 00:24:54,613 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:24:54,613 INFO L462 AbstractCegarLoop]: Abstraction has 19704 states and 56674 transitions. [2019-11-16 00:24:54,613 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-16 00:24:54,613 INFO L276 IsEmpty]: Start isEmpty. Operand 19704 states and 56674 transitions. [2019-11-16 00:24:54,624 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2019-11-16 00:24:54,625 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:24:54,625 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] [2019-11-16 00:24:54,625 INFO L410 AbstractCegarLoop]: === Iteration 19 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:24:54,625 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:24:54,625 INFO L82 PathProgramCache]: Analyzing trace with hash 1859697991, now seen corresponding path program 1 times [2019-11-16 00:24:54,626 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:24:54,626 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [881733904] [2019-11-16 00:24:54,626 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:24:54,626 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:24:54,626 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:24:54,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:24:54,739 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:24:54,739 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [881733904] [2019-11-16 00:24:54,739 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:24:54,739 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-11-16 00:24:54,739 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2040364901] [2019-11-16 00:24:54,740 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-11-16 00:24:54,740 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:24:54,740 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-11-16 00:24:54,740 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2019-11-16 00:24:54,740 INFO L87 Difference]: Start difference. First operand 19704 states and 56674 transitions. Second operand 9 states. [2019-11-16 00:24:55,262 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:24:55,263 INFO L93 Difference]: Finished difference Result 25031 states and 71607 transitions. [2019-11-16 00:24:55,264 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-11-16 00:24:55,264 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 68 [2019-11-16 00:24:55,264 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:24:55,298 INFO L225 Difference]: With dead ends: 25031 [2019-11-16 00:24:55,298 INFO L226 Difference]: Without dead ends: 25031 [2019-11-16 00:24:55,299 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 4 SyntacticMatches, 1 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=39, Invalid=93, Unknown=0, NotChecked=0, Total=132 [2019-11-16 00:24:55,335 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25031 states. [2019-11-16 00:24:55,553 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25031 to 21057. [2019-11-16 00:24:55,553 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21057 states. [2019-11-16 00:24:55,589 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21057 states to 21057 states and 60604 transitions. [2019-11-16 00:24:55,589 INFO L78 Accepts]: Start accepts. Automaton has 21057 states and 60604 transitions. Word has length 68 [2019-11-16 00:24:55,589 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:24:55,589 INFO L462 AbstractCegarLoop]: Abstraction has 21057 states and 60604 transitions. [2019-11-16 00:24:55,589 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-11-16 00:24:55,590 INFO L276 IsEmpty]: Start isEmpty. Operand 21057 states and 60604 transitions. [2019-11-16 00:24:55,603 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2019-11-16 00:24:55,603 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:24:55,603 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] [2019-11-16 00:24:55,603 INFO L410 AbstractCegarLoop]: === Iteration 20 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:24:55,604 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:24:55,604 INFO L82 PathProgramCache]: Analyzing trace with hash -1547765624, now seen corresponding path program 1 times [2019-11-16 00:24:55,604 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:24:55,604 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [995010681] [2019-11-16 00:24:55,604 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:24:55,605 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:24:55,605 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:24:55,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:24:55,677 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:24:55,678 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [995010681] [2019-11-16 00:24:55,678 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:24:55,678 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-16 00:24:55,678 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [623020096] [2019-11-16 00:24:55,678 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-16 00:24:55,679 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:24:55,679 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-16 00:24:55,679 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-11-16 00:24:55,679 INFO L87 Difference]: Start difference. First operand 21057 states and 60604 transitions. Second operand 5 states. [2019-11-16 00:24:55,733 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:24:55,733 INFO L93 Difference]: Finished difference Result 6189 states and 14491 transitions. [2019-11-16 00:24:55,734 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-16 00:24:55,734 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 68 [2019-11-16 00:24:55,734 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:24:55,739 INFO L225 Difference]: With dead ends: 6189 [2019-11-16 00:24:55,740 INFO L226 Difference]: Without dead ends: 5017 [2019-11-16 00:24:55,740 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:24:55,748 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5017 states. [2019-11-16 00:24:55,791 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5017 to 4280. [2019-11-16 00:24:55,791 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4280 states. [2019-11-16 00:24:55,797 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4280 states to 4280 states and 9827 transitions. [2019-11-16 00:24:55,798 INFO L78 Accepts]: Start accepts. Automaton has 4280 states and 9827 transitions. Word has length 68 [2019-11-16 00:24:55,798 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:24:55,798 INFO L462 AbstractCegarLoop]: Abstraction has 4280 states and 9827 transitions. [2019-11-16 00:24:55,798 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-16 00:24:55,798 INFO L276 IsEmpty]: Start isEmpty. Operand 4280 states and 9827 transitions. [2019-11-16 00:24:55,803 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2019-11-16 00:24:55,803 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:24:55,803 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] [2019-11-16 00:24:55,803 INFO L410 AbstractCegarLoop]: === Iteration 21 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:24:55,804 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:24:55,804 INFO L82 PathProgramCache]: Analyzing trace with hash 579153638, now seen corresponding path program 1 times [2019-11-16 00:24:55,804 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:24:55,804 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1061794840] [2019-11-16 00:24:55,804 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:24:55,805 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:24:55,805 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:24:55,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:24:55,856 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:24:55,856 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1061794840] [2019-11-16 00:24:55,856 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:24:55,856 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-16 00:24:55,857 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [189658946] [2019-11-16 00:24:55,857 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-16 00:24:55,857 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:24:55,857 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-16 00:24:55,858 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-16 00:24:55,858 INFO L87 Difference]: Start difference. First operand 4280 states and 9827 transitions. Second operand 5 states. [2019-11-16 00:24:56,077 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:24:56,077 INFO L93 Difference]: Finished difference Result 4933 states and 11178 transitions. [2019-11-16 00:24:56,078 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-11-16 00:24:56,078 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 83 [2019-11-16 00:24:56,078 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:24:56,082 INFO L225 Difference]: With dead ends: 4933 [2019-11-16 00:24:56,082 INFO L226 Difference]: Without dead ends: 4902 [2019-11-16 00:24:56,082 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 4 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:24:56,089 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4902 states. [2019-11-16 00:24:56,121 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4902 to 4417. [2019-11-16 00:24:56,122 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4417 states. [2019-11-16 00:24:56,127 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4417 states to 4417 states and 10096 transitions. [2019-11-16 00:24:56,127 INFO L78 Accepts]: Start accepts. Automaton has 4417 states and 10096 transitions. Word has length 83 [2019-11-16 00:24:56,127 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:24:56,127 INFO L462 AbstractCegarLoop]: Abstraction has 4417 states and 10096 transitions. [2019-11-16 00:24:56,127 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-16 00:24:56,127 INFO L276 IsEmpty]: Start isEmpty. Operand 4417 states and 10096 transitions. [2019-11-16 00:24:56,131 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2019-11-16 00:24:56,131 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:24:56,131 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] [2019-11-16 00:24:56,131 INFO L410 AbstractCegarLoop]: === Iteration 22 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:24:56,132 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:24:56,132 INFO L82 PathProgramCache]: Analyzing trace with hash -2096721841, now seen corresponding path program 1 times [2019-11-16 00:24:56,132 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:24:56,132 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1829991598] [2019-11-16 00:24:56,132 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:24:56,133 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:24:56,133 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:24:56,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:24:56,249 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:24:56,249 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1829991598] [2019-11-16 00:24:56,250 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:24:56,250 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-11-16 00:24:56,250 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1132468633] [2019-11-16 00:24:56,250 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-16 00:24:56,251 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:24:56,251 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-16 00:24:56,251 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-11-16 00:24:56,251 INFO L87 Difference]: Start difference. First operand 4417 states and 10096 transitions. Second operand 6 states. [2019-11-16 00:24:56,548 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:24:56,548 INFO L93 Difference]: Finished difference Result 5736 states and 13062 transitions. [2019-11-16 00:24:56,548 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-11-16 00:24:56,548 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 83 [2019-11-16 00:24:56,549 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:24:56,555 INFO L225 Difference]: With dead ends: 5736 [2019-11-16 00:24:56,555 INFO L226 Difference]: Without dead ends: 5718 [2019-11-16 00:24:56,556 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 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:24:56,567 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5718 states. [2019-11-16 00:24:56,634 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5718 to 4710. [2019-11-16 00:24:56,634 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4710 states. [2019-11-16 00:24:56,644 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4710 states to 4710 states and 10801 transitions. [2019-11-16 00:24:56,645 INFO L78 Accepts]: Start accepts. Automaton has 4710 states and 10801 transitions. Word has length 83 [2019-11-16 00:24:56,645 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:24:56,645 INFO L462 AbstractCegarLoop]: Abstraction has 4710 states and 10801 transitions. [2019-11-16 00:24:56,646 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-16 00:24:56,646 INFO L276 IsEmpty]: Start isEmpty. Operand 4710 states and 10801 transitions. [2019-11-16 00:24:56,652 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2019-11-16 00:24:56,653 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:24:56,653 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] [2019-11-16 00:24:56,653 INFO L410 AbstractCegarLoop]: === Iteration 23 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:24:56,654 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:24:56,654 INFO L82 PathProgramCache]: Analyzing trace with hash 401294096, now seen corresponding path program 1 times [2019-11-16 00:24:56,654 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:24:56,654 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [565390017] [2019-11-16 00:24:56,655 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:24:56,655 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:24:56,655 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:24:56,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:24:56,757 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:24:56,757 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [565390017] [2019-11-16 00:24:56,758 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:24:56,758 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-11-16 00:24:56,758 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2076035317] [2019-11-16 00:24:56,758 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-11-16 00:24:56,758 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:24:56,759 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-11-16 00:24:56,759 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2019-11-16 00:24:56,759 INFO L87 Difference]: Start difference. First operand 4710 states and 10801 transitions. Second operand 7 states. [2019-11-16 00:24:57,173 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:24:57,174 INFO L93 Difference]: Finished difference Result 6901 states and 15917 transitions. [2019-11-16 00:24:57,174 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-11-16 00:24:57,174 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 83 [2019-11-16 00:24:57,174 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:24:57,179 INFO L225 Difference]: With dead ends: 6901 [2019-11-16 00:24:57,179 INFO L226 Difference]: Without dead ends: 6901 [2019-11-16 00:24:57,179 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=41, Invalid=91, Unknown=0, NotChecked=0, Total=132 [2019-11-16 00:24:57,186 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6901 states. [2019-11-16 00:24:57,229 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6901 to 5159. [2019-11-16 00:24:57,230 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5159 states. [2019-11-16 00:24:57,235 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5159 states to 5159 states and 11889 transitions. [2019-11-16 00:24:57,236 INFO L78 Accepts]: Start accepts. Automaton has 5159 states and 11889 transitions. Word has length 83 [2019-11-16 00:24:57,236 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:24:57,236 INFO L462 AbstractCegarLoop]: Abstraction has 5159 states and 11889 transitions. [2019-11-16 00:24:57,236 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-11-16 00:24:57,236 INFO L276 IsEmpty]: Start isEmpty. Operand 5159 states and 11889 transitions. [2019-11-16 00:24:57,240 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2019-11-16 00:24:57,240 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:24:57,240 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] [2019-11-16 00:24:57,240 INFO L410 AbstractCegarLoop]: === Iteration 24 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:24:57,240 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:24:57,240 INFO L82 PathProgramCache]: Analyzing trace with hash 1288797777, now seen corresponding path program 1 times [2019-11-16 00:24:57,241 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:24:57,241 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [172604496] [2019-11-16 00:24:57,241 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:24:57,241 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:24:57,241 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:24:57,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:24:57,335 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:24:57,335 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [172604496] [2019-11-16 00:24:57,336 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:24:57,336 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-11-16 00:24:57,336 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [268138104] [2019-11-16 00:24:57,336 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-16 00:24:57,336 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:24:57,337 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-16 00:24:57,337 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2019-11-16 00:24:57,338 INFO L87 Difference]: Start difference. First operand 5159 states and 11889 transitions. Second operand 6 states. [2019-11-16 00:24:57,400 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:24:57,400 INFO L93 Difference]: Finished difference Result 5923 states and 13536 transitions. [2019-11-16 00:24:57,401 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-16 00:24:57,401 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 83 [2019-11-16 00:24:57,401 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:24:57,407 INFO L225 Difference]: With dead ends: 5923 [2019-11-16 00:24:57,407 INFO L226 Difference]: Without dead ends: 5923 [2019-11-16 00:24:57,407 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2019-11-16 00:24:57,416 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5923 states. [2019-11-16 00:24:57,461 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5923 to 4712. [2019-11-16 00:24:57,461 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4712 states. [2019-11-16 00:24:57,466 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4712 states to 4712 states and 10766 transitions. [2019-11-16 00:24:57,466 INFO L78 Accepts]: Start accepts. Automaton has 4712 states and 10766 transitions. Word has length 83 [2019-11-16 00:24:57,467 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:24:57,467 INFO L462 AbstractCegarLoop]: Abstraction has 4712 states and 10766 transitions. [2019-11-16 00:24:57,467 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-16 00:24:57,467 INFO L276 IsEmpty]: Start isEmpty. Operand 4712 states and 10766 transitions. [2019-11-16 00:24:57,470 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2019-11-16 00:24:57,470 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:24:57,470 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] [2019-11-16 00:24:57,470 INFO L410 AbstractCegarLoop]: === Iteration 25 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:24:57,470 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:24:57,471 INFO L82 PathProgramCache]: Analyzing trace with hash -988169739, now seen corresponding path program 1 times [2019-11-16 00:24:57,471 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:24:57,471 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1122218056] [2019-11-16 00:24:57,471 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:24:57,472 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:24:57,472 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:24:57,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:24:57,573 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:24:57,573 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1122218056] [2019-11-16 00:24:57,573 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:24:57,573 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-11-16 00:24:57,574 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1300427983] [2019-11-16 00:24:57,574 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-16 00:24:57,574 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:24:57,574 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-16 00:24:57,575 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-11-16 00:24:57,575 INFO L87 Difference]: Start difference. First operand 4712 states and 10766 transitions. Second operand 6 states. [2019-11-16 00:24:57,688 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:24:57,689 INFO L93 Difference]: Finished difference Result 4532 states and 10229 transitions. [2019-11-16 00:24:57,689 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-11-16 00:24:57,689 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 83 [2019-11-16 00:24:57,689 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:24:57,692 INFO L225 Difference]: With dead ends: 4532 [2019-11-16 00:24:57,692 INFO L226 Difference]: Without dead ends: 4532 [2019-11-16 00:24:57,693 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2019-11-16 00:24:57,697 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4532 states. [2019-11-16 00:24:57,724 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4532 to 3096. [2019-11-16 00:24:57,724 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3096 states. [2019-11-16 00:24:57,728 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3096 states to 3096 states and 7068 transitions. [2019-11-16 00:24:57,728 INFO L78 Accepts]: Start accepts. Automaton has 3096 states and 7068 transitions. Word has length 83 [2019-11-16 00:24:57,728 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:24:57,728 INFO L462 AbstractCegarLoop]: Abstraction has 3096 states and 7068 transitions. [2019-11-16 00:24:57,728 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-16 00:24:57,728 INFO L276 IsEmpty]: Start isEmpty. Operand 3096 states and 7068 transitions. [2019-11-16 00:24:57,731 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2019-11-16 00:24:57,731 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:24:57,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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:24:57,731 INFO L410 AbstractCegarLoop]: === Iteration 26 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:24:57,732 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:24:57,732 INFO L82 PathProgramCache]: Analyzing trace with hash 46869611, now seen corresponding path program 1 times [2019-11-16 00:24:57,732 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:24:57,732 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1810631682] [2019-11-16 00:24:57,732 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:24:57,733 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:24:57,733 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:24:57,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:24:57,893 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:24:57,893 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1810631682] [2019-11-16 00:24:57,894 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:24:57,894 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-11-16 00:24:57,894 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1554385938] [2019-11-16 00:24:57,894 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-11-16 00:24:57,894 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:24:57,895 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-11-16 00:24:57,895 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2019-11-16 00:24:57,895 INFO L87 Difference]: Start difference. First operand 3096 states and 7068 transitions. Second operand 8 states. [2019-11-16 00:24:58,197 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:24:58,197 INFO L93 Difference]: Finished difference Result 3596 states and 8134 transitions. [2019-11-16 00:24:58,197 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-11-16 00:24:58,197 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 85 [2019-11-16 00:24:58,197 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:24:58,200 INFO L225 Difference]: With dead ends: 3596 [2019-11-16 00:24:58,200 INFO L226 Difference]: Without dead ends: 3596 [2019-11-16 00:24:58,200 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 3 SyntacticMatches, 3 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=74, Invalid=166, Unknown=0, NotChecked=0, Total=240 [2019-11-16 00:24:58,204 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3596 states. [2019-11-16 00:24:58,225 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3596 to 3195. [2019-11-16 00:24:58,226 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3195 states. [2019-11-16 00:24:58,229 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3195 states to 3195 states and 7272 transitions. [2019-11-16 00:24:58,229 INFO L78 Accepts]: Start accepts. Automaton has 3195 states and 7272 transitions. Word has length 85 [2019-11-16 00:24:58,229 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:24:58,229 INFO L462 AbstractCegarLoop]: Abstraction has 3195 states and 7272 transitions. [2019-11-16 00:24:58,229 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-11-16 00:24:58,230 INFO L276 IsEmpty]: Start isEmpty. Operand 3195 states and 7272 transitions. [2019-11-16 00:24:58,232 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2019-11-16 00:24:58,232 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:24:58,232 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] [2019-11-16 00:24:58,233 INFO L410 AbstractCegarLoop]: === Iteration 27 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:24:58,233 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:24:58,233 INFO L82 PathProgramCache]: Analyzing trace with hash 934373292, now seen corresponding path program 1 times [2019-11-16 00:24:58,233 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:24:58,233 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1942591422] [2019-11-16 00:24:58,233 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:24:58,233 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:24:58,233 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:24:58,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:24:58,349 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:24:58,349 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1942591422] [2019-11-16 00:24:58,349 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:24:58,349 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-11-16 00:24:58,350 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1727457506] [2019-11-16 00:24:58,350 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-11-16 00:24:58,350 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:24:58,350 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-11-16 00:24:58,351 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2019-11-16 00:24:58,351 INFO L87 Difference]: Start difference. First operand 3195 states and 7272 transitions. Second operand 8 states. [2019-11-16 00:24:58,456 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:24:58,456 INFO L93 Difference]: Finished difference Result 5438 states and 12450 transitions. [2019-11-16 00:24:58,457 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-11-16 00:24:58,457 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 85 [2019-11-16 00:24:58,457 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:24:58,460 INFO L225 Difference]: With dead ends: 5438 [2019-11-16 00:24:58,460 INFO L226 Difference]: Without dead ends: 2332 [2019-11-16 00:24:58,460 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=46, Invalid=86, Unknown=0, NotChecked=0, Total=132 [2019-11-16 00:24:58,466 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2332 states. [2019-11-16 00:24:58,488 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2332 to 2332. [2019-11-16 00:24:58,488 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2332 states. [2019-11-16 00:24:58,492 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2332 states to 2332 states and 5323 transitions. [2019-11-16 00:24:58,492 INFO L78 Accepts]: Start accepts. Automaton has 2332 states and 5323 transitions. Word has length 85 [2019-11-16 00:24:58,492 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:24:58,492 INFO L462 AbstractCegarLoop]: Abstraction has 2332 states and 5323 transitions. [2019-11-16 00:24:58,493 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-11-16 00:24:58,493 INFO L276 IsEmpty]: Start isEmpty. Operand 2332 states and 5323 transitions. [2019-11-16 00:24:58,495 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2019-11-16 00:24:58,495 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:24:58,495 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] [2019-11-16 00:24:58,496 INFO L410 AbstractCegarLoop]: === Iteration 28 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:24:58,496 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:24:58,496 INFO L82 PathProgramCache]: Analyzing trace with hash -1245991308, now seen corresponding path program 2 times [2019-11-16 00:24:58,496 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:24:58,496 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [667760394] [2019-11-16 00:24:58,497 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:24:58,497 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:24:58,497 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:24:58,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:24:58,646 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:24:58,646 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [667760394] [2019-11-16 00:24:58,646 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:24:58,646 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-11-16 00:24:58,646 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [809511752] [2019-11-16 00:24:58,646 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-11-16 00:24:58,646 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:24:58,647 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-11-16 00:24:58,647 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-11-16 00:24:58,647 INFO L87 Difference]: Start difference. First operand 2332 states and 5323 transitions. Second operand 9 states. [2019-11-16 00:24:58,855 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:24:58,855 INFO L93 Difference]: Finished difference Result 3987 states and 9112 transitions. [2019-11-16 00:24:58,855 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-11-16 00:24:58,856 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 85 [2019-11-16 00:24:58,856 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:24:58,858 INFO L225 Difference]: With dead ends: 3987 [2019-11-16 00:24:58,858 INFO L226 Difference]: Without dead ends: 2607 [2019-11-16 00:24:58,858 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=45, Invalid=165, Unknown=0, NotChecked=0, Total=210 [2019-11-16 00:24:58,861 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2607 states. [2019-11-16 00:24:58,876 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2607 to 2387. [2019-11-16 00:24:58,876 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2387 states. [2019-11-16 00:24:58,878 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2387 states to 2387 states and 5392 transitions. [2019-11-16 00:24:58,878 INFO L78 Accepts]: Start accepts. Automaton has 2387 states and 5392 transitions. Word has length 85 [2019-11-16 00:24:58,878 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:24:58,879 INFO L462 AbstractCegarLoop]: Abstraction has 2387 states and 5392 transitions. [2019-11-16 00:24:58,879 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-11-16 00:24:58,879 INFO L276 IsEmpty]: Start isEmpty. Operand 2387 states and 5392 transitions. [2019-11-16 00:24:58,880 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2019-11-16 00:24:58,880 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:24:58,880 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] [2019-11-16 00:24:58,880 INFO L410 AbstractCegarLoop]: === Iteration 29 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:24:58,881 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:24:58,881 INFO L82 PathProgramCache]: Analyzing trace with hash -691653831, now seen corresponding path program 1 times [2019-11-16 00:24:58,881 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:24:58,881 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1256067951] [2019-11-16 00:24:58,881 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:24:58,881 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:24:58,881 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:24:58,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:24:58,995 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:24:58,995 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1256067951] [2019-11-16 00:24:58,996 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:24:58,996 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-11-16 00:24:58,996 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [396011623] [2019-11-16 00:24:58,996 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-16 00:24:58,996 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:24:58,997 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-16 00:24:58,997 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2019-11-16 00:24:58,997 INFO L87 Difference]: Start difference. First operand 2387 states and 5392 transitions. Second operand 6 states. [2019-11-16 00:24:59,162 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:24:59,162 INFO L93 Difference]: Finished difference Result 2636 states and 5907 transitions. [2019-11-16 00:24:59,163 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-11-16 00:24:59,163 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 85 [2019-11-16 00:24:59,163 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:24:59,165 INFO L225 Difference]: With dead ends: 2636 [2019-11-16 00:24:59,165 INFO L226 Difference]: Without dead ends: 2596 [2019-11-16 00:24:59,165 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:24:59,170 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2596 states. [2019-11-16 00:24:59,186 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2596 to 2334. [2019-11-16 00:24:59,186 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2334 states. [2019-11-16 00:24:59,189 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2334 states to 2334 states and 5239 transitions. [2019-11-16 00:24:59,189 INFO L78 Accepts]: Start accepts. Automaton has 2334 states and 5239 transitions. Word has length 85 [2019-11-16 00:24:59,189 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:24:59,189 INFO L462 AbstractCegarLoop]: Abstraction has 2334 states and 5239 transitions. [2019-11-16 00:24:59,189 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-16 00:24:59,189 INFO L276 IsEmpty]: Start isEmpty. Operand 2334 states and 5239 transitions. [2019-11-16 00:24:59,191 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2019-11-16 00:24:59,191 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:24:59,191 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] [2019-11-16 00:24:59,191 INFO L410 AbstractCegarLoop]: === Iteration 30 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:24:59,191 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:24:59,192 INFO L82 PathProgramCache]: Analyzing trace with hash 1526104122, now seen corresponding path program 3 times [2019-11-16 00:24:59,192 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:24:59,192 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [946194178] [2019-11-16 00:24:59,192 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:24:59,192 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:24:59,192 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:24:59,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:24:59,271 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:24:59,271 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [946194178] [2019-11-16 00:24:59,272 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:24:59,272 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-16 00:24:59,272 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [566953984] [2019-11-16 00:24:59,272 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-16 00:24:59,272 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:24:59,273 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-16 00:24:59,273 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-16 00:24:59,273 INFO L87 Difference]: Start difference. First operand 2334 states and 5239 transitions. Second operand 5 states. [2019-11-16 00:24:59,323 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:24:59,323 INFO L93 Difference]: Finished difference Result 2459 states and 5494 transitions. [2019-11-16 00:24:59,323 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-16 00:24:59,323 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 85 [2019-11-16 00:24:59,324 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:24:59,326 INFO L225 Difference]: With dead ends: 2459 [2019-11-16 00:24:59,326 INFO L226 Difference]: Without dead ends: 2459 [2019-11-16 00:24:59,327 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-16 00:24:59,331 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2459 states. [2019-11-16 00:24:59,353 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2459 to 2418. [2019-11-16 00:24:59,353 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2418 states. [2019-11-16 00:24:59,357 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2418 states to 2418 states and 5409 transitions. [2019-11-16 00:24:59,357 INFO L78 Accepts]: Start accepts. Automaton has 2418 states and 5409 transitions. Word has length 85 [2019-11-16 00:24:59,357 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:24:59,357 INFO L462 AbstractCegarLoop]: Abstraction has 2418 states and 5409 transitions. [2019-11-16 00:24:59,357 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-16 00:24:59,358 INFO L276 IsEmpty]: Start isEmpty. Operand 2418 states and 5409 transitions. [2019-11-16 00:24:59,360 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2019-11-16 00:24:59,360 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:24:59,360 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] [2019-11-16 00:24:59,361 INFO L410 AbstractCegarLoop]: === Iteration 31 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:24:59,361 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:24:59,361 INFO L82 PathProgramCache]: Analyzing trace with hash 243307137, now seen corresponding path program 1 times [2019-11-16 00:24:59,361 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:24:59,361 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1617412051] [2019-11-16 00:24:59,362 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:24:59,362 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:24:59,362 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:24:59,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-16 00:24:59,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-16 00:24:59,457 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-16 00:24:59,458 INFO L445 BasicCegarLoop]: Counterexample might be feasible [2019-11-16 00:24:59,588 INFO L303 ceAbstractionStarter]: Did not count any witness invariants because Icfg is not BoogieIcfg [2019-11-16 00:24:59,589 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 16.11 12:24:59 BasicIcfg [2019-11-16 00:24:59,589 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-11-16 00:24:59,590 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-11-16 00:24:59,590 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-11-16 00:24:59,590 INFO L275 PluginConnector]: Witness Printer initialized [2019-11-16 00:24:59,591 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.11 12:24:27" (3/4) ... [2019-11-16 00:24:59,593 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2019-11-16 00:24:59,750 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/run_dir_43f21288-80e1-44d1-bf39-9fbf15175947/bin/uautomizer/witness.graphml [2019-11-16 00:24:59,750 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-11-16 00:24:59,753 INFO L168 Benchmark]: Toolchain (without parser) took 33253.89 ms. Allocated memory was 1.0 GB in the beginning and 3.5 GB in the end (delta: 2.4 GB). Free memory was 946.2 MB in the beginning and 2.0 GB in the end (delta: -1.0 GB). Peak memory consumption was 1.4 GB. Max. memory is 11.5 GB. [2019-11-16 00:24:59,753 INFO L168 Benchmark]: CDTParser took 0.52 ms. Allocated memory is still 1.0 GB. Free memory is still 967.6 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-16 00:24:59,754 INFO L168 Benchmark]: CACSL2BoogieTranslator took 627.88 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 142.1 MB). Free memory was 946.2 MB in the beginning and 1.1 GB in the end (delta: -162.4 MB). Peak memory consumption was 18.2 MB. Max. memory is 11.5 GB. [2019-11-16 00:24:59,754 INFO L168 Benchmark]: Boogie Procedure Inliner took 56.28 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. [2019-11-16 00:24:59,754 INFO L168 Benchmark]: Boogie Preprocessor took 36.41 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-16 00:24:59,755 INFO L168 Benchmark]: RCFGBuilder took 658.21 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 49.2 MB). Peak memory consumption was 49.2 MB. Max. memory is 11.5 GB. [2019-11-16 00:24:59,755 INFO L168 Benchmark]: TraceAbstraction took 31710.38 ms. Allocated memory was 1.2 GB in the beginning and 3.5 GB in the end (delta: 2.3 GB). Free memory was 1.1 GB in the beginning and 2.0 GB in the end (delta: -989.2 MB). Peak memory consumption was 1.3 GB. Max. memory is 11.5 GB. [2019-11-16 00:24:59,755 INFO L168 Benchmark]: Witness Printer took 160.62 ms. Allocated memory is still 3.5 GB. Free memory was 2.0 GB in the beginning and 2.0 GB in the end (delta: 57.5 MB). Peak memory consumption was 57.5 MB. Max. memory is 11.5 GB. [2019-11-16 00:24:59,762 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.52 ms. Allocated memory is still 1.0 GB. Free memory is still 967.6 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 627.88 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 142.1 MB). Free memory was 946.2 MB in the beginning and 1.1 GB in the end (delta: -162.4 MB). Peak memory consumption was 18.2 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 56.28 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 36.41 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 658.21 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 49.2 MB). Peak memory consumption was 49.2 MB. Max. memory is 11.5 GB. * TraceAbstraction took 31710.38 ms. Allocated memory was 1.2 GB in the beginning and 3.5 GB in the end (delta: 2.3 GB). Free memory was 1.1 GB in the beginning and 2.0 GB in the end (delta: -989.2 MB). Peak memory consumption was 1.3 GB. Max. memory is 11.5 GB. * Witness Printer took 160.62 ms. Allocated memory is still 3.5 GB. Free memory was 2.0 GB in the beginning and 2.0 GB in the end (delta: 57.5 MB). Peak memory consumption was 57.5 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 5]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L695] 0 int __unbuffered_cnt = 0; VAL [__unbuffered_cnt=0] [L697] 0 int __unbuffered_p0_EAX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0] [L699] 0 int __unbuffered_p1_EAX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0] [L701] 0 int __unbuffered_p1_EBX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0] [L702] 0 _Bool main$tmp_guard0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0] [L703] 0 _Bool main$tmp_guard1; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0] [L705] 0 int x = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0] [L707] 0 int y = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0] [L708] 0 _Bool y$flush_delayed; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0] [L709] 0 int y$mem_tmp; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0] [L710] 0 _Bool y$r_buff0_thd0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=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] [L711] 0 _Bool y$r_buff0_thd1; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=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] [L712] 0 _Bool y$r_buff0_thd2; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=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] [L713] 0 _Bool y$r_buff1_thd0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=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] [L714] 0 _Bool y$r_buff1_thd1; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=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] [L715] 0 _Bool y$r_buff1_thd2; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=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] [L716] 0 _Bool y$read_delayed; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=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] [L717] 0 int *y$read_delayed_var; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=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}] [L718] 0 int y$w_buff0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=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] [L719] 0 _Bool y$w_buff0_used; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=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] [L720] 0 int y$w_buff1; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=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] [L721] 0 _Bool y$w_buff1_used; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=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] [L723] 0 int z = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=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, z=0] [L724] 0 _Bool weak$$choice0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=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, z=0] [L725] 0 _Bool weak$$choice2; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=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, z=0] [L801] 0 pthread_t t1653; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=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, z=0] [L802] FCALL, FORK 0 pthread_create(&t1653, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=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=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, z=0] [L803] 0 pthread_t t1654; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=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=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, z=0] [L804] FCALL, FORK 0 pthread_create(&t1654, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=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=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, z=0] [L759] 2 y$w_buff1 = y$w_buff0 [L760] 2 y$w_buff0 = 1 [L761] 2 y$w_buff1_used = y$w_buff0_used [L762] 2 y$w_buff0_used = (_Bool)1 [L5] COND FALSE 2 !(!expression) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=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=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, z=0] [L764] 2 y$r_buff1_thd0 = y$r_buff0_thd0 [L765] 2 y$r_buff1_thd1 = y$r_buff0_thd1 [L766] 2 y$r_buff1_thd2 = y$r_buff0_thd2 [L767] 2 y$r_buff0_thd2 = (_Bool)1 [L770] 2 z = 1 [L773] 2 __unbuffered_p1_EAX = z [L776] 2 __unbuffered_p1_EBX = x VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=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=0, y$r_buff0_thd2=1, 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, z=1] [L729] 1 x = 1 [L734] 1 weak$$choice0 = __VERIFIER_nondet_bool() [L735] 1 weak$$choice2 = __VERIFIER_nondet_bool() [L736] 1 y$flush_delayed = weak$$choice2 [L737] 1 y$mem_tmp = y VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=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=0, y$r_buff0_thd2=1, 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, z=1] [L738] EXPR 1 !y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : y$w_buff1) VAL [!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : y$w_buff1)=0, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=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=0, y$r_buff0_thd2=1, 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, z=1] [L738] 1 y = !y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : y$w_buff1) [L739] EXPR 1 weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : y$w_buff0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=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_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd1 ? 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=0, y$r_buff0_thd2=1, 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, z=1] [L779] 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=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=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_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd1 ? 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=0, y$r_buff0_thd2=1, 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, z=1] [L739] 1 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : y$w_buff0)) [L740] EXPR 1 weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff1 : y$w_buff1)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=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_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd1 ? 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=0, y$r_buff0_thd2=1, 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, z=1] [L740] 1 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff1 : y$w_buff1)) [L741] EXPR 1 weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$w_buff0_used)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=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_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$w_buff0_used))=1, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, 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, z=1] [L741] 1 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$w_buff0_used)) [L742] EXPR 1 weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=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_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd1 ? (_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=0, y$r_buff0_thd2=1, 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, z=1] [L742] 1 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L743] EXPR 1 weak$$choice2 ? y$r_buff0_thd1 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$r_buff0_thd1 : (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=1, __unbuffered_p1_EBX=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_thd1 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$r_buff0_thd1 : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$r_buff0_thd1))=0, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, 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, z=1] [L743] 1 y$r_buff0_thd1 = weak$$choice2 ? y$r_buff0_thd1 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$r_buff0_thd1 : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$r_buff0_thd1)) [L744] EXPR 1 weak$$choice2 ? y$r_buff1_thd1 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$r_buff1_thd1 : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=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_thd1 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$r_buff1_thd1 : (y$w_buff0_used && y$r_buff0_thd1 ? (_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=0, y$r_buff0_thd2=1, 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, z=1] [L744] 1 y$r_buff1_thd1 = weak$$choice2 ? y$r_buff1_thd1 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$r_buff1_thd1 : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L745] 1 __unbuffered_p0_EAX = y VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=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=0, y$r_buff0_thd2=1, 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, z=1] [L779] 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) [L780] EXPR 2 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=1, __unbuffered_p1_EBX=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=0, y$r_buff0_thd2=1, 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, z=1] [L780] 2 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used [L781] 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=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=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=0, y$r_buff0_thd2=1, 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, z=1] [L781] 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 [L782] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=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=0, y$r_buff0_thd2=1, 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, z=1] [L782] 2 y$r_buff0_thd2 = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2 [L783] 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=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=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=0, y$r_buff0_thd2=1, 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, z=1] [L746] EXPR 1 y$flush_delayed ? y$mem_tmp : y VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=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$flush_delayed ? y$mem_tmp : y=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, 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, z=1] [L746] 1 y = y$flush_delayed ? y$mem_tmp : y [L747] 1 y$flush_delayed = (_Bool)0 [L752] 1 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=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=0, y$r_buff0_thd2=1, 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, z=1] [L783] 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 [L786] 2 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=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=0, y$r_buff0_thd2=1, 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, z=1] [L806] 0 main$tmp_guard0 = __unbuffered_cnt == 2 VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=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=0, y$r_buff0_thd2=1, 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, z=1] [L810] 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=1, __unbuffered_p1_EBX=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=0, y$r_buff0_thd2=1, 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, z=1] [L810] 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=1, __unbuffered_p1_EBX=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=0, y$r_buff0_thd2=1, 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, z=1] [L810] 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=1, __unbuffered_p1_EBX=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=0, y$r_buff0_thd2=1, 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, z=1] [L810] 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) [L811] 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=1, __unbuffered_p1_EBX=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=0, y$r_buff0_thd2=1, 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, z=1] [L811] 0 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L812] 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=1, __unbuffered_p1_EBX=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=0, y$r_buff0_thd2=1, 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, z=1] [L812] 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 [L813] 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=1, __unbuffered_p1_EBX=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=0, y$r_buff0_thd2=1, 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, z=1] [L813] 0 y$r_buff0_thd0 = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 [L814] 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=1, __unbuffered_p1_EBX=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=0, y$r_buff0_thd2=1, 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, z=1] [L814] 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 [L817] 0 main$tmp_guard1 = !(__unbuffered_p0_EAX == 0 && __unbuffered_p1_EAX == 1 && __unbuffered_p1_EBX == 0) VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=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=0, y$r_buff0_thd2=1, 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, z=1] [L5] COND TRUE 0 !expression VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=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=0, y$r_buff0_thd2=1, 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, z=1] [L5] 0 __VERIFIER_error() VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=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=0, y$r_buff0_thd2=1, 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, z=1] - StatisticsResult: Ultimate Automizer benchmark data CFG has 5 procedures, 196 locations, 3 error locations. Result: UNSAFE, OverallTime: 31.5s, OverallIterations: 31, TraceHistogramMax: 1, AutomataDifference: 13.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 7908 SDtfs, 9076 SDslu, 17840 SDs, 0 SdLazy, 6553 SolverSat, 463 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 6.4s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 276 GetRequests, 77 SyntacticMatches, 13 SemanticMatches, 186 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 122 ImplicationChecksByTransitivity, 2.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=57890occurred in iteration=7, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 11.9s AutomataMinimizationTime, 30 MinimizatonAttempts, 69299 StatesRemovedByMinimization, 28 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 2.2s InterpolantComputationTime, 2129 NumberOfCodeBlocks, 2129 NumberOfCodeBlocksAsserted, 31 NumberOfCheckSat, 2014 ConstructedInterpolants, 0 QuantifiedInterpolants, 391575 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 30 InterpolantComputations, 30 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...