./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/pthread-wmm/rfi004_tso.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/working_dir_7d94c1f7-2083-43c7-b4c1-263a327cc652/bin/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_7d94c1f7-2083-43c7-b4c1-263a327cc652/bin/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_7d94c1f7-2083-43c7-b4c1-263a327cc652/bin/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_7d94c1f7-2083-43c7-b4c1-263a327cc652/bin/uautomizer/config/AutomizerReach.xml -i ../../sv-benchmarks/c/pthread-wmm/rfi004_tso.oepc.i -s /tmp/vcloud-vcloud-master/worker/working_dir_7d94c1f7-2083-43c7-b4c1-263a327cc652/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_7d94c1f7-2083-43c7-b4c1-263a327cc652/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 095dbfc602375483c24b33b3278269c21ee024e9 .................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... 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-10-22 09:02:18,428 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-10-22 09:02:18,429 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-10-22 09:02:18,438 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-10-22 09:02:18,439 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-10-22 09:02:18,440 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-10-22 09:02:18,441 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-10-22 09:02:18,442 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-10-22 09:02:18,443 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-10-22 09:02:18,444 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-10-22 09:02:18,445 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-10-22 09:02:18,445 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-10-22 09:02:18,446 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-10-22 09:02:18,446 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-10-22 09:02:18,447 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-10-22 09:02:18,448 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-10-22 09:02:18,448 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-10-22 09:02:18,449 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-10-22 09:02:18,450 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-10-22 09:02:18,451 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-10-22 09:02:18,453 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-10-22 09:02:18,453 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-10-22 09:02:18,454 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-10-22 09:02:18,455 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-10-22 09:02:18,457 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-10-22 09:02:18,457 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-10-22 09:02:18,457 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-10-22 09:02:18,458 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-10-22 09:02:18,458 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-10-22 09:02:18,459 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-10-22 09:02:18,459 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-10-22 09:02:18,460 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-10-22 09:02:18,460 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-10-22 09:02:18,461 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-10-22 09:02:18,462 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-10-22 09:02:18,462 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-10-22 09:02:18,462 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-10-22 09:02:18,463 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-10-22 09:02:18,463 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-10-22 09:02:18,464 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-10-22 09:02:18,464 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-10-22 09:02:18,465 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_7d94c1f7-2083-43c7-b4c1-263a327cc652/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf [2019-10-22 09:02:18,475 INFO L113 SettingsManager]: Loading preferences was successful [2019-10-22 09:02:18,475 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-10-22 09:02:18,476 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-10-22 09:02:18,476 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-10-22 09:02:18,477 INFO L138 SettingsManager]: * Use SBE=true [2019-10-22 09:02:18,477 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-10-22 09:02:18,477 INFO L138 SettingsManager]: * sizeof long=4 [2019-10-22 09:02:18,477 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-10-22 09:02:18,477 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-10-22 09:02:18,477 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-10-22 09:02:18,478 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-10-22 09:02:18,478 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-10-22 09:02:18,478 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-10-22 09:02:18,478 INFO L138 SettingsManager]: * sizeof long double=12 [2019-10-22 09:02:18,478 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-10-22 09:02:18,478 INFO L138 SettingsManager]: * Use constant arrays=true [2019-10-22 09:02:18,479 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-10-22 09:02:18,479 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-10-22 09:02:18,479 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-10-22 09:02:18,479 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-10-22 09:02:18,479 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-10-22 09:02:18,479 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-10-22 09:02:18,480 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-10-22 09:02:18,480 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-10-22 09:02:18,480 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-10-22 09:02:18,480 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-10-22 09:02:18,480 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-10-22 09:02:18,480 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-10-22 09:02:18,481 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/working_dir_7d94c1f7-2083-43c7-b4c1-263a327cc652/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 -> 095dbfc602375483c24b33b3278269c21ee024e9 [2019-10-22 09:02:18,505 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-10-22 09:02:18,520 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-10-22 09:02:18,523 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-10-22 09:02:18,524 INFO L271 PluginConnector]: Initializing CDTParser... [2019-10-22 09:02:18,526 INFO L275 PluginConnector]: CDTParser initialized [2019-10-22 09:02:18,527 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_7d94c1f7-2083-43c7-b4c1-263a327cc652/bin/uautomizer/../../sv-benchmarks/c/pthread-wmm/rfi004_tso.oepc.i [2019-10-22 09:02:18,577 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_7d94c1f7-2083-43c7-b4c1-263a327cc652/bin/uautomizer/data/2861a6141/71b3d8fc64f046e5a961338d8a085cb1/FLAGf59de3e95 [2019-10-22 09:02:19,004 INFO L306 CDTParser]: Found 1 translation units. [2019-10-22 09:02:19,004 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_7d94c1f7-2083-43c7-b4c1-263a327cc652/sv-benchmarks/c/pthread-wmm/rfi004_tso.oepc.i [2019-10-22 09:02:19,014 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_7d94c1f7-2083-43c7-b4c1-263a327cc652/bin/uautomizer/data/2861a6141/71b3d8fc64f046e5a961338d8a085cb1/FLAGf59de3e95 [2019-10-22 09:02:19,027 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_7d94c1f7-2083-43c7-b4c1-263a327cc652/bin/uautomizer/data/2861a6141/71b3d8fc64f046e5a961338d8a085cb1 [2019-10-22 09:02:19,030 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-10-22 09:02:19,030 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-10-22 09:02:19,032 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-10-22 09:02:19,032 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-10-22 09:02:19,036 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-10-22 09:02:19,040 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.10 09:02:19" (1/1) ... [2019-10-22 09:02:19,043 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1c1881a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 09:02:19, skipping insertion in model container [2019-10-22 09:02:19,043 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.10 09:02:19" (1/1) ... [2019-10-22 09:02:19,050 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-10-22 09:02:19,099 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-10-22 09:02:19,500 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-22 09:02:19,519 INFO L188 MainTranslator]: Completed pre-run [2019-10-22 09:02:19,572 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-22 09:02:19,648 INFO L192 MainTranslator]: Completed translation [2019-10-22 09:02:19,648 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 09:02:19 WrapperNode [2019-10-22 09:02:19,648 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-10-22 09:02:19,649 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-10-22 09:02:19,649 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-10-22 09:02:19,649 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-10-22 09:02:19,657 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 09:02:19" (1/1) ... [2019-10-22 09:02:19,673 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 09:02:19" (1/1) ... [2019-10-22 09:02:19,709 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-10-22 09:02:19,710 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-10-22 09:02:19,710 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-10-22 09:02:19,710 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-10-22 09:02:19,721 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 09:02:19" (1/1) ... [2019-10-22 09:02:19,721 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 09:02:19" (1/1) ... [2019-10-22 09:02:19,724 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 09:02:19" (1/1) ... [2019-10-22 09:02:19,724 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 09:02:19" (1/1) ... [2019-10-22 09:02:19,738 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 09:02:19" (1/1) ... [2019-10-22 09:02:19,742 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 09:02:19" (1/1) ... [2019-10-22 09:02:19,744 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 09:02:19" (1/1) ... [2019-10-22 09:02:19,748 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-10-22 09:02:19,752 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-10-22 09:02:19,752 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-10-22 09:02:19,752 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-10-22 09:02:19,753 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 09:02:19" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_7d94c1f7-2083-43c7-b4c1-263a327cc652/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-10-22 09:02:19,812 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-10-22 09:02:19,812 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2019-10-22 09:02:19,812 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-10-22 09:02:19,812 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-10-22 09:02:19,812 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2019-10-22 09:02:19,812 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2019-10-22 09:02:19,813 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2019-10-22 09:02:19,813 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2019-10-22 09:02:19,813 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2019-10-22 09:02:19,813 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-10-22 09:02:19,813 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-10-22 09:02:19,815 WARN L202 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2019-10-22 09:02:20,349 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-10-22 09:02:20,349 INFO L284 CfgBuilder]: Removed 8 assume(true) statements. [2019-10-22 09:02:20,350 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.10 09:02:20 BoogieIcfgContainer [2019-10-22 09:02:20,350 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-10-22 09:02:20,351 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-10-22 09:02:20,351 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-10-22 09:02:20,355 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-10-22 09:02:20,355 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 22.10 09:02:19" (1/3) ... [2019-10-22 09:02:20,357 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@22d69f6c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.10 09:02:20, skipping insertion in model container [2019-10-22 09:02:20,357 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 09:02:19" (2/3) ... [2019-10-22 09:02:20,357 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@22d69f6c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.10 09:02:20, skipping insertion in model container [2019-10-22 09:02:20,357 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.10 09:02:20" (3/3) ... [2019-10-22 09:02:20,360 INFO L109 eAbstractionObserver]: Analyzing ICFG rfi004_tso.oepc.i [2019-10-22 09:02:20,401 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 09:02:20,401 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 09:02:20,402 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 09:02:20,402 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 09:02:20,402 WARN L315 ript$VariableManager]: TermVariabe Thread0_P0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 09:02:20,402 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 09:02:20,402 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 09:02:20,404 WARN L315 ript$VariableManager]: TermVariabe Thread0_P0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 09:02:20,404 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 09:02:20,405 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 09:02:20,405 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 09:02:20,405 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 09:02:20,405 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 09:02:20,405 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 09:02:20,406 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 09:02:20,406 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 09:02:20,407 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 09:02:20,407 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 09:02:20,407 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 09:02:20,407 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 09:02:20,407 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 09:02:20,408 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 09:02:20,408 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 09:02:20,409 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 09:02:20,409 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 09:02:20,409 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 09:02:20,409 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 09:02:20,413 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 09:02:20,413 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 09:02:20,413 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 09:02:20,413 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 09:02:20,413 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 09:02:20,414 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 09:02:20,414 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 09:02:20,414 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 09:02:20,414 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 09:02:20,414 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 09:02:20,414 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 09:02:20,414 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 09:02:20,415 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 09:02:20,415 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 09:02:20,415 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 09:02:20,415 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 09:02:20,415 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 09:02:20,415 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 09:02:20,416 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 09:02:20,416 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 09:02:20,416 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 09:02:20,416 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 09:02:20,416 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 09:02:20,416 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 09:02:20,417 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 09:02:20,417 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 09:02:20,417 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 09:02:20,417 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 09:02:20,417 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 09:02:20,417 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 09:02:20,417 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 09:02:20,418 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 09:02:20,418 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 09:02:20,418 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 09:02:20,418 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 09:02:20,418 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 09:02:20,418 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 09:02:20,419 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 09:02:20,419 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 09:02:20,419 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 09:02:20,419 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 09:02:20,419 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 09:02:20,419 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 09:02:20,419 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 09:02:20,420 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 09:02:20,420 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 09:02:20,420 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 09:02:20,420 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 09:02:20,421 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 09:02:20,421 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 09:02:20,422 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 09:02:20,422 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 09:02:20,422 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 09:02:20,422 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 09:02:20,422 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 09:02:20,422 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 09:02:20,423 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 09:02:20,423 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 09:02:20,423 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 09:02:20,423 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 09:02:20,423 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 09:02:20,423 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 09:02:20,423 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 09:02:20,424 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 09:02:20,424 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 09:02:20,424 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~nondet26.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 09:02:20,424 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~nondet26.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 09:02:20,424 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 09:02:20,424 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 09:02:20,427 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~nondet26.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 09:02:20,427 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~nondet26.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 09:02:20,427 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 09:02:20,428 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 09:02:20,428 WARN L315 ript$VariableManager]: TermVariabe Thread1_P1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 09:02:20,428 WARN L315 ript$VariableManager]: TermVariabe Thread1_P1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 09:02:20,428 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 09:02:20,428 WARN L315 ript$VariableManager]: TermVariabe Thread1_P1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 09:02:20,428 WARN L315 ript$VariableManager]: TermVariabe Thread1_P1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 09:02:20,429 WARN L315 ript$VariableManager]: TermVariabe Thread1_P1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 09:02:20,429 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 09:02:20,429 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 09:02:20,429 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 09:02:20,429 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 09:02:20,429 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 09:02:20,430 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 09:02:20,430 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 09:02:20,430 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 09:02:20,430 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 09:02:20,430 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 09:02:20,430 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 09:02:20,431 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 09:02:20,431 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 09:02:20,431 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 09:02:20,431 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 09:02:20,431 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 09:02:20,433 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 09:02:20,434 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 09:02:20,434 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 09:02:20,434 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 09:02:20,434 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 09:02:20,434 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 09:02:20,434 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 09:02:20,435 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 09:02:20,435 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet33.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 09:02:20,435 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet33.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 09:02:20,435 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 09:02:20,435 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 09:02:20,435 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet33.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 09:02:20,435 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet33.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 09:02:20,440 WARN L141 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-10-22 09:02:20,441 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-10-22 09:02:20,448 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 3 error locations. [2019-10-22 09:02:20,459 INFO L249 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2019-10-22 09:02:20,480 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-10-22 09:02:20,480 INFO L374 AbstractCegarLoop]: Hoare is true [2019-10-22 09:02:20,480 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-10-22 09:02:20,480 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-10-22 09:02:20,480 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-10-22 09:02:20,480 INFO L378 AbstractCegarLoop]: Difference is false [2019-10-22 09:02:20,480 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-10-22 09:02:20,481 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-10-22 09:02:20,492 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 132 places, 164 transitions [2019-10-22 09:02:22,565 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 27856 states. [2019-10-22 09:02:22,567 INFO L276 IsEmpty]: Start isEmpty. Operand 27856 states. [2019-10-22 09:02:22,575 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2019-10-22 09:02:22,576 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 09:02:22,576 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-10-22 09:02:22,578 INFO L410 AbstractCegarLoop]: === Iteration 1 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 09:02:22,584 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 09:02:22,584 INFO L82 PathProgramCache]: Analyzing trace with hash 1406083354, now seen corresponding path program 1 times [2019-10-22 09:02:22,592 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 09:02:22,593 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1665180871] [2019-10-22 09:02:22,593 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:02:22,593 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:02:22,593 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 09:02:22,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 09:02:22,864 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 09:02:22,864 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1665180871] [2019-10-22 09:02:22,865 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 09:02:22,866 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-22 09:02:22,866 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1034848656] [2019-10-22 09:02:22,870 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-22 09:02:22,871 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 09:02:22,883 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-22 09:02:22,883 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-22 09:02:22,885 INFO L87 Difference]: Start difference. First operand 27856 states. Second operand 4 states. [2019-10-22 09:02:23,379 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 09:02:23,380 INFO L93 Difference]: Finished difference Result 28524 states and 108881 transitions. [2019-10-22 09:02:23,380 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-22 09:02:23,381 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 39 [2019-10-22 09:02:23,382 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 09:02:23,723 INFO L225 Difference]: With dead ends: 28524 [2019-10-22 09:02:23,725 INFO L226 Difference]: Without dead ends: 21756 [2019-10-22 09:02:23,727 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-10-22 09:02:23,969 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21756 states. [2019-10-22 09:02:24,482 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21756 to 21756. [2019-10-22 09:02:24,483 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21756 states. [2019-10-22 09:02:24,629 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21756 states to 21756 states and 83441 transitions. [2019-10-22 09:02:24,630 INFO L78 Accepts]: Start accepts. Automaton has 21756 states and 83441 transitions. Word has length 39 [2019-10-22 09:02:24,631 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 09:02:24,632 INFO L462 AbstractCegarLoop]: Abstraction has 21756 states and 83441 transitions. [2019-10-22 09:02:24,632 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-22 09:02:24,632 INFO L276 IsEmpty]: Start isEmpty. Operand 21756 states and 83441 transitions. [2019-10-22 09:02:24,641 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2019-10-22 09:02:24,645 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 09:02:24,645 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-10-22 09:02:24,645 INFO L410 AbstractCegarLoop]: === Iteration 2 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 09:02:24,646 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 09:02:24,646 INFO L82 PathProgramCache]: Analyzing trace with hash -322753813, now seen corresponding path program 1 times [2019-10-22 09:02:24,646 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 09:02:24,646 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1723878978] [2019-10-22 09:02:24,646 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:02:24,646 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:02:24,647 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 09:02:24,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 09:02:24,775 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 09:02:24,775 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1723878978] [2019-10-22 09:02:24,776 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 09:02:24,776 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-22 09:02:24,776 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [671077003] [2019-10-22 09:02:24,777 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-22 09:02:24,778 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 09:02:24,778 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-22 09:02:24,778 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-22 09:02:24,778 INFO L87 Difference]: Start difference. First operand 21756 states and 83441 transitions. Second operand 5 states. [2019-10-22 09:02:25,583 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 09:02:25,584 INFO L93 Difference]: Finished difference Result 34170 states and 124041 transitions. [2019-10-22 09:02:25,584 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-10-22 09:02:25,584 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 47 [2019-10-22 09:02:25,584 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 09:02:25,704 INFO L225 Difference]: With dead ends: 34170 [2019-10-22 09:02:25,704 INFO L226 Difference]: Without dead ends: 33602 [2019-10-22 09:02:25,705 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-10-22 09:02:25,912 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33602 states. [2019-10-22 09:02:26,509 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33602 to 31796. [2019-10-22 09:02:26,509 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31796 states. [2019-10-22 09:02:26,606 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31796 states to 31796 states and 116819 transitions. [2019-10-22 09:02:26,606 INFO L78 Accepts]: Start accepts. Automaton has 31796 states and 116819 transitions. Word has length 47 [2019-10-22 09:02:26,607 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 09:02:26,607 INFO L462 AbstractCegarLoop]: Abstraction has 31796 states and 116819 transitions. [2019-10-22 09:02:26,607 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-22 09:02:26,607 INFO L276 IsEmpty]: Start isEmpty. Operand 31796 states and 116819 transitions. [2019-10-22 09:02:26,611 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2019-10-22 09:02:26,611 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 09:02:26,611 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-10-22 09:02:26,611 INFO L410 AbstractCegarLoop]: === Iteration 3 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 09:02:26,612 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 09:02:26,612 INFO L82 PathProgramCache]: Analyzing trace with hash -38024889, now seen corresponding path program 1 times [2019-10-22 09:02:26,612 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 09:02:26,612 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [537524332] [2019-10-22 09:02:26,613 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:02:26,613 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:02:26,613 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 09:02:26,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 09:02:26,994 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 09:02:26,995 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [537524332] [2019-10-22 09:02:26,995 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 09:02:26,995 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-22 09:02:26,995 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [98543543] [2019-10-22 09:02:26,996 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-22 09:02:26,996 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 09:02:26,996 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-22 09:02:26,997 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-22 09:02:26,999 INFO L87 Difference]: Start difference. First operand 31796 states and 116819 transitions. Second operand 5 states. [2019-10-22 09:02:27,414 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 09:02:27,414 INFO L93 Difference]: Finished difference Result 41644 states and 149743 transitions. [2019-10-22 09:02:27,414 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-10-22 09:02:27,415 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 48 [2019-10-22 09:02:27,415 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 09:02:27,572 INFO L225 Difference]: With dead ends: 41644 [2019-10-22 09:02:27,572 INFO L226 Difference]: Without dead ends: 41180 [2019-10-22 09:02:27,572 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-10-22 09:02:27,824 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41180 states. [2019-10-22 09:02:28,383 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41180 to 35364. [2019-10-22 09:02:28,384 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35364 states. [2019-10-22 09:02:28,528 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35364 states to 35364 states and 128877 transitions. [2019-10-22 09:02:28,528 INFO L78 Accepts]: Start accepts. Automaton has 35364 states and 128877 transitions. Word has length 48 [2019-10-22 09:02:28,529 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 09:02:28,529 INFO L462 AbstractCegarLoop]: Abstraction has 35364 states and 128877 transitions. [2019-10-22 09:02:28,529 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-22 09:02:28,529 INFO L276 IsEmpty]: Start isEmpty. Operand 35364 states and 128877 transitions. [2019-10-22 09:02:28,536 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2019-10-22 09:02:28,536 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 09:02:28,536 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-10-22 09:02:28,537 INFO L410 AbstractCegarLoop]: === Iteration 4 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 09:02:28,537 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 09:02:28,537 INFO L82 PathProgramCache]: Analyzing trace with hash 606739501, now seen corresponding path program 1 times [2019-10-22 09:02:28,538 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 09:02:28,538 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [601843761] [2019-10-22 09:02:28,538 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:02:28,538 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:02:28,538 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 09:02:28,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 09:02:28,586 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 09:02:28,586 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [601843761] [2019-10-22 09:02:28,586 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 09:02:28,587 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-22 09:02:28,587 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [147705098] [2019-10-22 09:02:28,587 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-22 09:02:28,587 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 09:02:28,587 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-22 09:02:28,588 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-22 09:02:28,588 INFO L87 Difference]: Start difference. First operand 35364 states and 128877 transitions. Second operand 3 states. [2019-10-22 09:02:29,163 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 09:02:29,163 INFO L93 Difference]: Finished difference Result 45910 states and 163945 transitions. [2019-10-22 09:02:29,164 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-22 09:02:29,164 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 50 [2019-10-22 09:02:29,164 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 09:02:29,278 INFO L225 Difference]: With dead ends: 45910 [2019-10-22 09:02:29,278 INFO L226 Difference]: Without dead ends: 45910 [2019-10-22 09:02:29,278 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-10-22 09:02:29,544 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45910 states. [2019-10-22 09:02:30,072 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45910 to 40247. [2019-10-22 09:02:30,072 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40247 states. [2019-10-22 09:02:30,158 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40247 states to 40247 states and 145215 transitions. [2019-10-22 09:02:30,158 INFO L78 Accepts]: Start accepts. Automaton has 40247 states and 145215 transitions. Word has length 50 [2019-10-22 09:02:30,159 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 09:02:30,159 INFO L462 AbstractCegarLoop]: Abstraction has 40247 states and 145215 transitions. [2019-10-22 09:02:30,159 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-22 09:02:30,159 INFO L276 IsEmpty]: Start isEmpty. Operand 40247 states and 145215 transitions. [2019-10-22 09:02:30,170 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-10-22 09:02:30,170 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 09:02:30,170 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-10-22 09:02:30,170 INFO L410 AbstractCegarLoop]: === Iteration 5 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 09:02:30,170 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 09:02:30,171 INFO L82 PathProgramCache]: Analyzing trace with hash -807412104, now seen corresponding path program 1 times [2019-10-22 09:02:30,171 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 09:02:30,171 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1514376778] [2019-10-22 09:02:30,171 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:02:30,171 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:02:30,171 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 09:02:30,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 09:02:30,238 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 09:02:30,238 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1514376778] [2019-10-22 09:02:30,238 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 09:02:30,238 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-10-22 09:02:30,238 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [460713176] [2019-10-22 09:02:30,239 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-22 09:02:30,239 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 09:02:30,239 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-22 09:02:30,239 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-10-22 09:02:30,239 INFO L87 Difference]: Start difference. First operand 40247 states and 145215 transitions. Second operand 6 states. [2019-10-22 09:02:31,185 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 09:02:31,185 INFO L93 Difference]: Finished difference Result 52466 states and 185477 transitions. [2019-10-22 09:02:31,186 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-10-22 09:02:31,186 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 54 [2019-10-22 09:02:31,186 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 09:02:31,290 INFO L225 Difference]: With dead ends: 52466 [2019-10-22 09:02:31,290 INFO L226 Difference]: Without dead ends: 51930 [2019-10-22 09:02:31,290 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-10-22 09:02:31,491 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51930 states. [2019-10-22 09:02:31,937 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51930 to 40898. [2019-10-22 09:02:31,938 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40898 states. [2019-10-22 09:02:32,027 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40898 states to 40898 states and 147668 transitions. [2019-10-22 09:02:32,028 INFO L78 Accepts]: Start accepts. Automaton has 40898 states and 147668 transitions. Word has length 54 [2019-10-22 09:02:32,028 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 09:02:32,028 INFO L462 AbstractCegarLoop]: Abstraction has 40898 states and 147668 transitions. [2019-10-22 09:02:32,028 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-22 09:02:32,028 INFO L276 IsEmpty]: Start isEmpty. Operand 40898 states and 147668 transitions. [2019-10-22 09:02:32,041 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-10-22 09:02:32,041 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 09:02:32,041 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-10-22 09:02:32,042 INFO L410 AbstractCegarLoop]: === Iteration 6 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 09:02:32,042 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 09:02:32,042 INFO L82 PathProgramCache]: Analyzing trace with hash 1566342864, now seen corresponding path program 1 times [2019-10-22 09:02:32,042 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 09:02:32,042 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1815780237] [2019-10-22 09:02:32,043 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:02:32,043 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:02:32,043 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 09:02:32,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 09:02:32,133 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 09:02:32,133 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1815780237] [2019-10-22 09:02:32,133 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 09:02:32,134 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-10-22 09:02:32,134 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [310586755] [2019-10-22 09:02:32,134 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-22 09:02:32,134 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 09:02:32,134 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-22 09:02:32,135 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-10-22 09:02:32,135 INFO L87 Difference]: Start difference. First operand 40898 states and 147668 transitions. Second operand 6 states. [2019-10-22 09:02:32,732 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 09:02:32,733 INFO L93 Difference]: Finished difference Result 56599 states and 201648 transitions. [2019-10-22 09:02:32,737 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-10-22 09:02:32,738 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 54 [2019-10-22 09:02:32,738 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 09:02:32,854 INFO L225 Difference]: With dead ends: 56599 [2019-10-22 09:02:32,854 INFO L226 Difference]: Without dead ends: 55460 [2019-10-22 09:02:32,854 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-10-22 09:02:33,067 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55460 states. [2019-10-22 09:02:34,113 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55460 to 51955. [2019-10-22 09:02:34,113 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 51955 states. [2019-10-22 09:02:34,231 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51955 states to 51955 states and 186007 transitions. [2019-10-22 09:02:34,232 INFO L78 Accepts]: Start accepts. Automaton has 51955 states and 186007 transitions. Word has length 54 [2019-10-22 09:02:34,232 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 09:02:34,232 INFO L462 AbstractCegarLoop]: Abstraction has 51955 states and 186007 transitions. [2019-10-22 09:02:34,232 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-22 09:02:34,232 INFO L276 IsEmpty]: Start isEmpty. Operand 51955 states and 186007 transitions. [2019-10-22 09:02:34,247 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-10-22 09:02:34,247 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 09:02:34,247 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-10-22 09:02:34,248 INFO L410 AbstractCegarLoop]: === Iteration 7 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 09:02:34,248 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 09:02:34,248 INFO L82 PathProgramCache]: Analyzing trace with hash -230608495, now seen corresponding path program 1 times [2019-10-22 09:02:34,248 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 09:02:34,248 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [919069726] [2019-10-22 09:02:34,248 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:02:34,249 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:02:34,249 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 09:02:34,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 09:02:34,316 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 09:02:34,316 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [919069726] [2019-10-22 09:02:34,316 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 09:02:34,316 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-22 09:02:34,316 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1476705882] [2019-10-22 09:02:34,318 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-22 09:02:34,318 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 09:02:34,318 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-22 09:02:34,318 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-22 09:02:34,318 INFO L87 Difference]: Start difference. First operand 51955 states and 186007 transitions. Second operand 3 states. [2019-10-22 09:02:34,518 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 09:02:34,518 INFO L93 Difference]: Finished difference Result 46767 states and 162434 transitions. [2019-10-22 09:02:34,518 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-22 09:02:34,518 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 54 [2019-10-22 09:02:34,518 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 09:02:34,604 INFO L225 Difference]: With dead ends: 46767 [2019-10-22 09:02:34,604 INFO L226 Difference]: Without dead ends: 46187 [2019-10-22 09:02:34,604 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-22 09:02:34,797 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46187 states. [2019-10-22 09:02:35,230 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46187 to 44422. [2019-10-22 09:02:35,230 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44422 states. [2019-10-22 09:02:35,318 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44422 states to 44422 states and 155155 transitions. [2019-10-22 09:02:35,318 INFO L78 Accepts]: Start accepts. Automaton has 44422 states and 155155 transitions. Word has length 54 [2019-10-22 09:02:35,318 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 09:02:35,318 INFO L462 AbstractCegarLoop]: Abstraction has 44422 states and 155155 transitions. [2019-10-22 09:02:35,318 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-22 09:02:35,319 INFO L276 IsEmpty]: Start isEmpty. Operand 44422 states and 155155 transitions. [2019-10-22 09:02:35,327 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2019-10-22 09:02:35,328 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 09:02:35,328 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] [2019-10-22 09:02:35,328 INFO L410 AbstractCegarLoop]: === Iteration 8 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 09:02:35,328 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 09:02:35,328 INFO L82 PathProgramCache]: Analyzing trace with hash 617907270, now seen corresponding path program 1 times [2019-10-22 09:02:35,329 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 09:02:35,329 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [787582022] [2019-10-22 09:02:35,329 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:02:35,329 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:02:35,329 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 09:02:35,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 09:02:35,392 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 09:02:35,392 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [787582022] [2019-10-22 09:02:35,393 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 09:02:35,393 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-22 09:02:35,393 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [268380396] [2019-10-22 09:02:35,393 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-22 09:02:35,393 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 09:02:35,393 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-22 09:02:35,394 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-22 09:02:35,394 INFO L87 Difference]: Start difference. First operand 44422 states and 155155 transitions. Second operand 4 states. [2019-10-22 09:02:35,454 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 09:02:35,454 INFO L93 Difference]: Finished difference Result 10152 states and 31522 transitions. [2019-10-22 09:02:35,454 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-22 09:02:35,454 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 55 [2019-10-22 09:02:35,454 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 09:02:35,470 INFO L225 Difference]: With dead ends: 10152 [2019-10-22 09:02:35,470 INFO L226 Difference]: Without dead ends: 8646 [2019-10-22 09:02:35,470 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-10-22 09:02:35,496 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8646 states. [2019-10-22 09:02:35,593 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8646 to 8598. [2019-10-22 09:02:35,593 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8598 states. [2019-10-22 09:02:35,614 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8598 states to 8598 states and 26467 transitions. [2019-10-22 09:02:35,614 INFO L78 Accepts]: Start accepts. Automaton has 8598 states and 26467 transitions. Word has length 55 [2019-10-22 09:02:35,615 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 09:02:35,615 INFO L462 AbstractCegarLoop]: Abstraction has 8598 states and 26467 transitions. [2019-10-22 09:02:35,615 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-22 09:02:35,615 INFO L276 IsEmpty]: Start isEmpty. Operand 8598 states and 26467 transitions. [2019-10-22 09:02:35,619 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-10-22 09:02:35,619 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 09:02:35,619 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-10-22 09:02:35,619 INFO L410 AbstractCegarLoop]: === Iteration 9 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 09:02:35,620 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 09:02:35,620 INFO L82 PathProgramCache]: Analyzing trace with hash 1743224388, now seen corresponding path program 1 times [2019-10-22 09:02:35,620 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 09:02:35,620 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1213325359] [2019-10-22 09:02:35,620 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:02:35,621 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:02:35,621 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 09:02:35,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 09:02:35,691 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 09:02:35,691 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1213325359] [2019-10-22 09:02:35,691 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 09:02:35,691 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-22 09:02:35,691 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1815632355] [2019-10-22 09:02:35,692 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-22 09:02:35,692 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 09:02:35,692 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-22 09:02:35,692 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-22 09:02:35,692 INFO L87 Difference]: Start difference. First operand 8598 states and 26467 transitions. Second operand 4 states. [2019-10-22 09:02:35,830 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 09:02:35,830 INFO L93 Difference]: Finished difference Result 10217 states and 31174 transitions. [2019-10-22 09:02:35,830 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-22 09:02:35,831 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 64 [2019-10-22 09:02:35,831 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 09:02:35,848 INFO L225 Difference]: With dead ends: 10217 [2019-10-22 09:02:35,848 INFO L226 Difference]: Without dead ends: 10217 [2019-10-22 09:02:35,848 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-10-22 09:02:35,875 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10217 states. [2019-10-22 09:02:35,986 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10217 to 9249. [2019-10-22 09:02:35,987 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9249 states. [2019-10-22 09:02:36,007 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9249 states to 9249 states and 28328 transitions. [2019-10-22 09:02:36,010 INFO L78 Accepts]: Start accepts. Automaton has 9249 states and 28328 transitions. Word has length 64 [2019-10-22 09:02:36,010 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 09:02:36,010 INFO L462 AbstractCegarLoop]: Abstraction has 9249 states and 28328 transitions. [2019-10-22 09:02:36,010 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-22 09:02:36,010 INFO L276 IsEmpty]: Start isEmpty. Operand 9249 states and 28328 transitions. [2019-10-22 09:02:36,015 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-10-22 09:02:36,015 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 09:02:36,015 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-10-22 09:02:36,015 INFO L410 AbstractCegarLoop]: === Iteration 10 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 09:02:36,016 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 09:02:36,016 INFO L82 PathProgramCache]: Analyzing trace with hash -808932573, now seen corresponding path program 1 times [2019-10-22 09:02:36,016 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 09:02:36,016 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1627736487] [2019-10-22 09:02:36,016 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:02:36,017 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:02:36,017 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 09:02:36,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 09:02:36,088 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 09:02:36,088 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1627736487] [2019-10-22 09:02:36,089 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 09:02:36,089 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-10-22 09:02:36,089 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [736597356] [2019-10-22 09:02:36,089 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-22 09:02:36,089 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 09:02:36,089 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-22 09:02:36,090 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-10-22 09:02:36,090 INFO L87 Difference]: Start difference. First operand 9249 states and 28328 transitions. Second operand 6 states. [2019-10-22 09:02:36,429 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 09:02:36,429 INFO L93 Difference]: Finished difference Result 12022 states and 36327 transitions. [2019-10-22 09:02:36,429 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-10-22 09:02:36,430 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 64 [2019-10-22 09:02:36,430 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 09:02:36,448 INFO L225 Difference]: With dead ends: 12022 [2019-10-22 09:02:36,449 INFO L226 Difference]: Without dead ends: 11958 [2019-10-22 09:02:36,449 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=37, Invalid=95, Unknown=0, NotChecked=0, Total=132 [2019-10-22 09:02:36,478 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11958 states. [2019-10-22 09:02:36,586 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11958 to 10330. [2019-10-22 09:02:36,587 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10330 states. [2019-10-22 09:02:36,603 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10330 states to 10330 states and 31497 transitions. [2019-10-22 09:02:36,604 INFO L78 Accepts]: Start accepts. Automaton has 10330 states and 31497 transitions. Word has length 64 [2019-10-22 09:02:36,604 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 09:02:36,604 INFO L462 AbstractCegarLoop]: Abstraction has 10330 states and 31497 transitions. [2019-10-22 09:02:36,604 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-22 09:02:36,604 INFO L276 IsEmpty]: Start isEmpty. Operand 10330 states and 31497 transitions. [2019-10-22 09:02:36,609 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2019-10-22 09:02:36,609 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 09:02:36,610 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-10-22 09:02:36,610 INFO L410 AbstractCegarLoop]: === Iteration 11 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 09:02:36,610 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 09:02:36,610 INFO L82 PathProgramCache]: Analyzing trace with hash 2016404966, now seen corresponding path program 1 times [2019-10-22 09:02:36,610 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 09:02:36,610 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [269335227] [2019-10-22 09:02:36,611 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:02:36,611 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:02:36,611 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 09:02:36,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 09:02:36,700 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 09:02:36,700 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [269335227] [2019-10-22 09:02:36,700 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 09:02:36,700 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-10-22 09:02:36,701 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2129084751] [2019-10-22 09:02:36,701 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-22 09:02:36,701 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 09:02:36,701 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-22 09:02:36,701 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-10-22 09:02:36,701 INFO L87 Difference]: Start difference. First operand 10330 states and 31497 transitions. Second operand 6 states. [2019-10-22 09:02:37,140 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 09:02:37,141 INFO L93 Difference]: Finished difference Result 11717 states and 35093 transitions. [2019-10-22 09:02:37,141 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-10-22 09:02:37,141 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 68 [2019-10-22 09:02:37,141 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 09:02:37,155 INFO L225 Difference]: With dead ends: 11717 [2019-10-22 09:02:37,155 INFO L226 Difference]: Without dead ends: 11717 [2019-10-22 09:02:37,155 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-10-22 09:02:37,177 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11717 states. [2019-10-22 09:02:37,269 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11717 to 11383. [2019-10-22 09:02:37,269 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11383 states. [2019-10-22 09:02:37,288 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11383 states to 11383 states and 34215 transitions. [2019-10-22 09:02:37,288 INFO L78 Accepts]: Start accepts. Automaton has 11383 states and 34215 transitions. Word has length 68 [2019-10-22 09:02:37,289 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 09:02:37,289 INFO L462 AbstractCegarLoop]: Abstraction has 11383 states and 34215 transitions. [2019-10-22 09:02:37,289 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-22 09:02:37,289 INFO L276 IsEmpty]: Start isEmpty. Operand 11383 states and 34215 transitions. [2019-10-22 09:02:37,295 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2019-10-22 09:02:37,295 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 09:02:37,296 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-10-22 09:02:37,296 INFO L410 AbstractCegarLoop]: === Iteration 12 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 09:02:37,296 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 09:02:37,296 INFO L82 PathProgramCache]: Analyzing trace with hash 771640485, now seen corresponding path program 1 times [2019-10-22 09:02:37,296 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 09:02:37,296 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1133886870] [2019-10-22 09:02:37,296 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:02:37,296 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:02:37,296 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 09:02:37,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 09:02:37,364 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 09:02:37,364 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1133886870] [2019-10-22 09:02:37,364 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 09:02:37,364 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-22 09:02:37,364 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1418032428] [2019-10-22 09:02:37,364 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-22 09:02:37,365 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 09:02:37,365 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-22 09:02:37,365 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-22 09:02:37,365 INFO L87 Difference]: Start difference. First operand 11383 states and 34215 transitions. Second operand 4 states. [2019-10-22 09:02:37,585 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 09:02:37,585 INFO L93 Difference]: Finished difference Result 14998 states and 44528 transitions. [2019-10-22 09:02:37,585 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-22 09:02:37,585 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 68 [2019-10-22 09:02:37,585 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 09:02:37,612 INFO L225 Difference]: With dead ends: 14998 [2019-10-22 09:02:37,612 INFO L226 Difference]: Without dead ends: 14998 [2019-10-22 09:02:37,612 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-10-22 09:02:37,644 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14998 states. [2019-10-22 09:02:37,760 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14998 to 12734. [2019-10-22 09:02:37,761 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12734 states. [2019-10-22 09:02:37,780 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12734 states to 12734 states and 37974 transitions. [2019-10-22 09:02:37,780 INFO L78 Accepts]: Start accepts. Automaton has 12734 states and 37974 transitions. Word has length 68 [2019-10-22 09:02:37,780 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 09:02:37,780 INFO L462 AbstractCegarLoop]: Abstraction has 12734 states and 37974 transitions. [2019-10-22 09:02:37,780 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-22 09:02:37,780 INFO L276 IsEmpty]: Start isEmpty. Operand 12734 states and 37974 transitions. [2019-10-22 09:02:37,787 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2019-10-22 09:02:37,787 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 09:02:37,787 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-10-22 09:02:37,787 INFO L410 AbstractCegarLoop]: === Iteration 13 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 09:02:37,787 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 09:02:37,787 INFO L82 PathProgramCache]: Analyzing trace with hash -60804377, now seen corresponding path program 1 times [2019-10-22 09:02:37,788 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 09:02:37,788 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1177715151] [2019-10-22 09:02:37,788 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:02:37,788 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:02:37,788 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 09:02:37,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 09:02:37,874 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 09:02:37,875 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1177715151] [2019-10-22 09:02:37,875 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 09:02:37,875 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-10-22 09:02:37,875 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1078595438] [2019-10-22 09:02:37,875 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-22 09:02:37,875 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 09:02:37,876 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-22 09:02:37,876 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-10-22 09:02:37,876 INFO L87 Difference]: Start difference. First operand 12734 states and 37974 transitions. Second operand 6 states. [2019-10-22 09:02:38,204 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 09:02:38,204 INFO L93 Difference]: Finished difference Result 15083 states and 43757 transitions. [2019-10-22 09:02:38,205 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-10-22 09:02:38,205 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 68 [2019-10-22 09:02:38,205 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 09:02:38,235 INFO L225 Difference]: With dead ends: 15083 [2019-10-22 09:02:38,235 INFO L226 Difference]: Without dead ends: 15083 [2019-10-22 09:02:38,235 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=26, Invalid=46, Unknown=0, NotChecked=0, Total=72 [2019-10-22 09:02:38,272 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15083 states. [2019-10-22 09:02:38,401 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15083 to 12973. [2019-10-22 09:02:38,402 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12973 states. [2019-10-22 09:02:38,434 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12973 states to 12973 states and 38018 transitions. [2019-10-22 09:02:38,434 INFO L78 Accepts]: Start accepts. Automaton has 12973 states and 38018 transitions. Word has length 68 [2019-10-22 09:02:38,435 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 09:02:38,435 INFO L462 AbstractCegarLoop]: Abstraction has 12973 states and 38018 transitions. [2019-10-22 09:02:38,435 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-22 09:02:38,435 INFO L276 IsEmpty]: Start isEmpty. Operand 12973 states and 38018 transitions. [2019-10-22 09:02:38,447 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2019-10-22 09:02:38,447 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 09:02:38,447 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-10-22 09:02:38,448 INFO L410 AbstractCegarLoop]: === Iteration 14 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 09:02:38,448 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 09:02:38,448 INFO L82 PathProgramCache]: Analyzing trace with hash 150546536, now seen corresponding path program 1 times [2019-10-22 09:02:38,448 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 09:02:38,449 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1054234539] [2019-10-22 09:02:38,449 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:02:38,449 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:02:38,449 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 09:02:38,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 09:02:38,515 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 09:02:38,516 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1054234539] [2019-10-22 09:02:38,516 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 09:02:38,516 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-22 09:02:38,516 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1159265516] [2019-10-22 09:02:38,516 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-22 09:02:38,516 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 09:02:38,516 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-22 09:02:38,517 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-22 09:02:38,517 INFO L87 Difference]: Start difference. First operand 12973 states and 38018 transitions. Second operand 5 states. [2019-10-22 09:02:38,791 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 09:02:38,791 INFO L93 Difference]: Finished difference Result 15978 states and 46602 transitions. [2019-10-22 09:02:38,791 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-10-22 09:02:38,791 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 68 [2019-10-22 09:02:38,792 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 09:02:38,818 INFO L225 Difference]: With dead ends: 15978 [2019-10-22 09:02:38,818 INFO L226 Difference]: Without dead ends: 15978 [2019-10-22 09:02:38,819 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-10-22 09:02:38,858 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15978 states. [2019-10-22 09:02:38,982 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15978 to 13916. [2019-10-22 09:02:38,982 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13916 states. [2019-10-22 09:02:39,005 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13916 states to 13916 states and 40448 transitions. [2019-10-22 09:02:39,005 INFO L78 Accepts]: Start accepts. Automaton has 13916 states and 40448 transitions. Word has length 68 [2019-10-22 09:02:39,005 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 09:02:39,005 INFO L462 AbstractCegarLoop]: Abstraction has 13916 states and 40448 transitions. [2019-10-22 09:02:39,005 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-22 09:02:39,005 INFO L276 IsEmpty]: Start isEmpty. Operand 13916 states and 40448 transitions. [2019-10-22 09:02:39,014 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2019-10-22 09:02:39,014 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 09:02:39,015 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-10-22 09:02:39,015 INFO L410 AbstractCegarLoop]: === Iteration 15 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 09:02:39,015 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 09:02:39,015 INFO L82 PathProgramCache]: Analyzing trace with hash -359987641, now seen corresponding path program 1 times [2019-10-22 09:02:39,015 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 09:02:39,015 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [444434540] [2019-10-22 09:02:39,015 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:02:39,015 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:02:39,015 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 09:02:39,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 09:02:39,073 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 09:02:39,074 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [444434540] [2019-10-22 09:02:39,074 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 09:02:39,074 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-22 09:02:39,074 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1836688963] [2019-10-22 09:02:39,074 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-22 09:02:39,074 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 09:02:39,075 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-22 09:02:39,075 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-22 09:02:39,075 INFO L87 Difference]: Start difference. First operand 13916 states and 40448 transitions. Second operand 4 states. [2019-10-22 09:02:39,415 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 09:02:39,415 INFO L93 Difference]: Finished difference Result 17364 states and 50542 transitions. [2019-10-22 09:02:39,415 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-22 09:02:39,416 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 68 [2019-10-22 09:02:39,416 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 09:02:39,436 INFO L225 Difference]: With dead ends: 17364 [2019-10-22 09:02:39,437 INFO L226 Difference]: Without dead ends: 16852 [2019-10-22 09:02:39,437 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-10-22 09:02:39,467 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16852 states. [2019-10-22 09:02:39,614 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16852 to 16120. [2019-10-22 09:02:39,614 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16120 states. [2019-10-22 09:02:39,641 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16120 states to 16120 states and 46797 transitions. [2019-10-22 09:02:39,641 INFO L78 Accepts]: Start accepts. Automaton has 16120 states and 46797 transitions. Word has length 68 [2019-10-22 09:02:39,641 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 09:02:39,641 INFO L462 AbstractCegarLoop]: Abstraction has 16120 states and 46797 transitions. [2019-10-22 09:02:39,641 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-22 09:02:39,641 INFO L276 IsEmpty]: Start isEmpty. Operand 16120 states and 46797 transitions. [2019-10-22 09:02:39,650 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2019-10-22 09:02:39,650 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 09:02:39,650 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-10-22 09:02:39,650 INFO L410 AbstractCegarLoop]: === Iteration 16 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 09:02:39,651 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 09:02:39,651 INFO L82 PathProgramCache]: Analyzing trace with hash 2138028296, now seen corresponding path program 1 times [2019-10-22 09:02:39,651 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 09:02:39,651 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1718574248] [2019-10-22 09:02:39,651 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:02:39,651 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:02:39,651 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 09:02:39,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 09:02:39,713 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 09:02:39,713 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1718574248] [2019-10-22 09:02:39,713 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 09:02:39,714 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-22 09:02:39,714 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1353409887] [2019-10-22 09:02:39,714 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-22 09:02:39,714 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 09:02:39,714 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-22 09:02:39,714 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-10-22 09:02:39,714 INFO L87 Difference]: Start difference. First operand 16120 states and 46797 transitions. Second operand 5 states. [2019-10-22 09:02:39,762 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 09:02:39,762 INFO L93 Difference]: Finished difference Result 5108 states and 12214 transitions. [2019-10-22 09:02:39,763 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-10-22 09:02:39,763 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 68 [2019-10-22 09:02:39,763 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 09:02:39,768 INFO L225 Difference]: With dead ends: 5108 [2019-10-22 09:02:39,768 INFO L226 Difference]: Without dead ends: 4115 [2019-10-22 09:02:39,768 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-10-22 09:02:39,773 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4115 states. [2019-10-22 09:02:39,798 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4115 to 3574. [2019-10-22 09:02:39,798 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3574 states. [2019-10-22 09:02:39,802 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3574 states to 3574 states and 8322 transitions. [2019-10-22 09:02:39,802 INFO L78 Accepts]: Start accepts. Automaton has 3574 states and 8322 transitions. Word has length 68 [2019-10-22 09:02:39,802 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 09:02:39,803 INFO L462 AbstractCegarLoop]: Abstraction has 3574 states and 8322 transitions. [2019-10-22 09:02:39,803 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-22 09:02:39,803 INFO L276 IsEmpty]: Start isEmpty. Operand 3574 states and 8322 transitions. [2019-10-22 09:02:39,805 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2019-10-22 09:02:39,806 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 09:02:39,806 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-22 09:02:39,806 INFO L410 AbstractCegarLoop]: === Iteration 17 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 09:02:39,806 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 09:02:39,806 INFO L82 PathProgramCache]: Analyzing trace with hash -294280364, now seen corresponding path program 1 times [2019-10-22 09:02:39,806 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 09:02:39,807 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1548804287] [2019-10-22 09:02:39,807 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:02:39,807 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:02:39,807 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 09:02:39,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 09:02:39,897 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 09:02:39,898 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1548804287] [2019-10-22 09:02:39,898 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 09:02:39,898 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-10-22 09:02:39,898 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1514667680] [2019-10-22 09:02:39,898 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-22 09:02:39,898 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 09:02:39,899 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-22 09:02:39,899 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2019-10-22 09:02:39,899 INFO L87 Difference]: Start difference. First operand 3574 states and 8322 transitions. Second operand 6 states. [2019-10-22 09:02:40,081 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 09:02:40,082 INFO L93 Difference]: Finished difference Result 3956 states and 9125 transitions. [2019-10-22 09:02:40,082 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-10-22 09:02:40,082 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 85 [2019-10-22 09:02:40,082 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 09:02:40,085 INFO L225 Difference]: With dead ends: 3956 [2019-10-22 09:02:40,085 INFO L226 Difference]: Without dead ends: 3879 [2019-10-22 09:02:40,085 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-10-22 09:02:40,090 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3879 states. [2019-10-22 09:02:40,113 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3879 to 3503. [2019-10-22 09:02:40,113 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3503 states. [2019-10-22 09:02:40,116 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3503 states to 3503 states and 8121 transitions. [2019-10-22 09:02:40,117 INFO L78 Accepts]: Start accepts. Automaton has 3503 states and 8121 transitions. Word has length 85 [2019-10-22 09:02:40,117 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 09:02:40,117 INFO L462 AbstractCegarLoop]: Abstraction has 3503 states and 8121 transitions. [2019-10-22 09:02:40,117 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-22 09:02:40,117 INFO L276 IsEmpty]: Start isEmpty. Operand 3503 states and 8121 transitions. [2019-10-22 09:02:40,119 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2019-10-22 09:02:40,120 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 09:02:40,120 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-10-22 09:02:40,120 INFO L410 AbstractCegarLoop]: === Iteration 18 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 09:02:40,120 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 09:02:40,120 INFO L82 PathProgramCache]: Analyzing trace with hash 1758468627, now seen corresponding path program 1 times [2019-10-22 09:02:40,120 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 09:02:40,120 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [21857444] [2019-10-22 09:02:40,120 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:02:40,120 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:02:40,121 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 09:02:40,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 09:02:40,175 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 09:02:40,176 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [21857444] [2019-10-22 09:02:40,176 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 09:02:40,176 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-22 09:02:40,176 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [249353798] [2019-10-22 09:02:40,176 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-22 09:02:40,177 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 09:02:40,177 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-22 09:02:40,177 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-22 09:02:40,177 INFO L87 Difference]: Start difference. First operand 3503 states and 8121 transitions. Second operand 4 states. [2019-10-22 09:02:40,205 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 09:02:40,206 INFO L93 Difference]: Finished difference Result 3423 states and 7889 transitions. [2019-10-22 09:02:40,206 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-22 09:02:40,206 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 85 [2019-10-22 09:02:40,206 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 09:02:40,210 INFO L225 Difference]: With dead ends: 3423 [2019-10-22 09:02:40,211 INFO L226 Difference]: Without dead ends: 3423 [2019-10-22 09:02:40,211 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-10-22 09:02:40,217 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3423 states. [2019-10-22 09:02:40,243 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3423 to 2914. [2019-10-22 09:02:40,243 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2914 states. [2019-10-22 09:02:40,247 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2914 states to 2914 states and 6692 transitions. [2019-10-22 09:02:40,248 INFO L78 Accepts]: Start accepts. Automaton has 2914 states and 6692 transitions. Word has length 85 [2019-10-22 09:02:40,248 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 09:02:40,248 INFO L462 AbstractCegarLoop]: Abstraction has 2914 states and 6692 transitions. [2019-10-22 09:02:40,248 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-22 09:02:40,248 INFO L276 IsEmpty]: Start isEmpty. Operand 2914 states and 6692 transitions. [2019-10-22 09:02:40,251 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2019-10-22 09:02:40,251 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 09:02:40,251 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-10-22 09:02:40,251 INFO L410 AbstractCegarLoop]: === Iteration 19 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 09:02:40,251 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 09:02:40,251 INFO L82 PathProgramCache]: Analyzing trace with hash -549016909, now seen corresponding path program 1 times [2019-10-22 09:02:40,252 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 09:02:40,252 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1587943532] [2019-10-22 09:02:40,252 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:02:40,252 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:02:40,252 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 09:02:40,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 09:02:40,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-10-22 09:02:40,402 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1587943532] [2019-10-22 09:02:40,402 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 09:02:40,402 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-10-22 09:02:40,402 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1973518357] [2019-10-22 09:02:40,403 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-10-22 09:02:40,403 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 09:02:40,404 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-10-22 09:02:40,404 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2019-10-22 09:02:40,404 INFO L87 Difference]: Start difference. First operand 2914 states and 6692 transitions. Second operand 8 states. [2019-10-22 09:02:40,491 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 09:02:40,491 INFO L93 Difference]: Finished difference Result 5099 states and 11804 transitions. [2019-10-22 09:02:40,492 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-10-22 09:02:40,492 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 85 [2019-10-22 09:02:40,492 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 09:02:40,495 INFO L225 Difference]: With dead ends: 5099 [2019-10-22 09:02:40,495 INFO L226 Difference]: Without dead ends: 2292 [2019-10-22 09:02:40,496 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-10-22 09:02:40,500 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2292 states. [2019-10-22 09:02:40,520 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2292 to 2292. [2019-10-22 09:02:40,520 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2292 states. [2019-10-22 09:02:40,524 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2292 states to 2292 states and 5304 transitions. [2019-10-22 09:02:40,524 INFO L78 Accepts]: Start accepts. Automaton has 2292 states and 5304 transitions. Word has length 85 [2019-10-22 09:02:40,524 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 09:02:40,524 INFO L462 AbstractCegarLoop]: Abstraction has 2292 states and 5304 transitions. [2019-10-22 09:02:40,524 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-10-22 09:02:40,524 INFO L276 IsEmpty]: Start isEmpty. Operand 2292 states and 5304 transitions. [2019-10-22 09:02:40,527 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2019-10-22 09:02:40,527 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 09:02:40,527 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-10-22 09:02:40,527 INFO L410 AbstractCegarLoop]: === Iteration 20 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 09:02:40,528 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 09:02:40,528 INFO L82 PathProgramCache]: Analyzing trace with hash -131826502, now seen corresponding path program 2 times [2019-10-22 09:02:40,528 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 09:02:40,528 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1150053260] [2019-10-22 09:02:40,528 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:02:40,529 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:02:40,529 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 09:02:40,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 09:02:40,627 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 09:02:40,627 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1150053260] [2019-10-22 09:02:40,627 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 09:02:40,627 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-10-22 09:02:40,627 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1274339198] [2019-10-22 09:02:40,628 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-22 09:02:40,628 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 09:02:40,628 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-22 09:02:40,628 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2019-10-22 09:02:40,628 INFO L87 Difference]: Start difference. First operand 2292 states and 5304 transitions. Second operand 6 states. [2019-10-22 09:02:40,767 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 09:02:40,768 INFO L93 Difference]: Finished difference Result 2604 states and 5987 transitions. [2019-10-22 09:02:40,768 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-10-22 09:02:40,768 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 85 [2019-10-22 09:02:40,768 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 09:02:40,770 INFO L225 Difference]: With dead ends: 2604 [2019-10-22 09:02:40,770 INFO L226 Difference]: Without dead ends: 2604 [2019-10-22 09:02:40,770 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2019-10-22 09:02:40,773 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2604 states. [2019-10-22 09:02:40,787 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2604 to 2236. [2019-10-22 09:02:40,787 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2236 states. [2019-10-22 09:02:40,790 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2236 states to 2236 states and 5186 transitions. [2019-10-22 09:02:40,790 INFO L78 Accepts]: Start accepts. Automaton has 2236 states and 5186 transitions. Word has length 85 [2019-10-22 09:02:40,790 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 09:02:40,790 INFO L462 AbstractCegarLoop]: Abstraction has 2236 states and 5186 transitions. [2019-10-22 09:02:40,790 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-22 09:02:40,790 INFO L276 IsEmpty]: Start isEmpty. Operand 2236 states and 5186 transitions. [2019-10-22 09:02:40,792 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2019-10-22 09:02:40,792 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 09:02:40,792 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-10-22 09:02:40,792 INFO L410 AbstractCegarLoop]: === Iteration 21 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 09:02:40,792 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 09:02:40,792 INFO L82 PathProgramCache]: Analyzing trace with hash 327331241, now seen corresponding path program 2 times [2019-10-22 09:02:40,792 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 09:02:40,793 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [787867925] [2019-10-22 09:02:40,793 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:02:40,793 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:02:40,793 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 09:02:40,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 09:02:40,924 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 09:02:40,924 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [787867925] [2019-10-22 09:02:40,924 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 09:02:40,924 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-10-22 09:02:40,924 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [685358128] [2019-10-22 09:02:40,925 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-10-22 09:02:40,925 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 09:02:40,925 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-10-22 09:02:40,925 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2019-10-22 09:02:40,925 INFO L87 Difference]: Start difference. First operand 2236 states and 5186 transitions. Second operand 10 states. [2019-10-22 09:02:41,195 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 09:02:41,195 INFO L93 Difference]: Finished difference Result 3776 states and 8759 transitions. [2019-10-22 09:02:41,196 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-10-22 09:02:41,196 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 85 [2019-10-22 09:02:41,196 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 09:02:41,199 INFO L225 Difference]: With dead ends: 3776 [2019-10-22 09:02:41,199 INFO L226 Difference]: Without dead ends: 2473 [2019-10-22 09:02:41,200 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=53, Invalid=219, Unknown=0, NotChecked=0, Total=272 [2019-10-22 09:02:41,206 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2473 states. [2019-10-22 09:02:41,234 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2473 to 2267. [2019-10-22 09:02:41,234 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2267 states. [2019-10-22 09:02:41,239 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2267 states to 2267 states and 5207 transitions. [2019-10-22 09:02:41,239 INFO L78 Accepts]: Start accepts. Automaton has 2267 states and 5207 transitions. Word has length 85 [2019-10-22 09:02:41,239 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 09:02:41,239 INFO L462 AbstractCegarLoop]: Abstraction has 2267 states and 5207 transitions. [2019-10-22 09:02:41,239 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-10-22 09:02:41,240 INFO L276 IsEmpty]: Start isEmpty. Operand 2267 states and 5207 transitions. [2019-10-22 09:02:41,243 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2019-10-22 09:02:41,244 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 09:02:41,245 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-10-22 09:02:41,245 INFO L410 AbstractCegarLoop]: === Iteration 22 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 09:02:41,245 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 09:02:41,245 INFO L82 PathProgramCache]: Analyzing trace with hash 727139273, now seen corresponding path program 3 times [2019-10-22 09:02:41,245 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 09:02:41,246 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1547689886] [2019-10-22 09:02:41,246 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:02:41,246 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:02:41,246 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 09:02:41,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 09:02:41,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 09:02:41,335 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-10-22 09:02:41,335 INFO L445 BasicCegarLoop]: Counterexample might be feasible [2019-10-22 09:02:41,457 INFO L303 ceAbstractionStarter]: Did not count any witness invariants because Icfg is not BoogieIcfg [2019-10-22 09:02:41,459 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 22.10 09:02:41 BasicIcfg [2019-10-22 09:02:41,459 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-10-22 09:02:41,459 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-10-22 09:02:41,459 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-10-22 09:02:41,460 INFO L275 PluginConnector]: Witness Printer initialized [2019-10-22 09:02:41,460 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.10 09:02:20" (3/4) ... [2019-10-22 09:02:41,463 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2019-10-22 09:02:41,638 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/working_dir_7d94c1f7-2083-43c7-b4c1-263a327cc652/bin/uautomizer/witness.graphml [2019-10-22 09:02:41,640 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-10-22 09:02:41,643 INFO L168 Benchmark]: Toolchain (without parser) took 22611.51 ms. Allocated memory was 1.0 GB in the beginning and 3.2 GB in the end (delta: 2.1 GB). Free memory was 940.7 MB in the beginning and 2.8 GB in the end (delta: -1.9 GB). Peak memory consumption was 2.2 GB. Max. memory is 11.5 GB. [2019-10-22 09:02:41,644 INFO L168 Benchmark]: CDTParser took 0.17 ms. Allocated memory is still 1.0 GB. Free memory is still 962.2 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-10-22 09:02:41,644 INFO L168 Benchmark]: CACSL2BoogieTranslator took 616.57 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 170.4 MB). Free memory was 940.7 MB in the beginning and 1.1 GB in the end (delta: -198.2 MB). Peak memory consumption was 20.0 MB. Max. memory is 11.5 GB. [2019-10-22 09:02:41,645 INFO L168 Benchmark]: Boogie Procedure Inliner took 60.65 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.8 MB). Peak memory consumption was 6.8 MB. Max. memory is 11.5 GB. [2019-10-22 09:02:41,645 INFO L168 Benchmark]: Boogie Preprocessor took 38.28 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-10-22 09:02:41,645 INFO L168 Benchmark]: RCFGBuilder took 598.26 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: 48.9 MB). Peak memory consumption was 48.9 MB. Max. memory is 11.5 GB. [2019-10-22 09:02:41,645 INFO L168 Benchmark]: TraceAbstraction took 21108.00 ms. Allocated memory was 1.2 GB in the beginning and 3.1 GB in the end (delta: 1.9 GB). Free memory was 1.1 GB in the beginning and 822.2 MB in the end (delta: 260.9 MB). Peak memory consumption was 2.2 GB. Max. memory is 11.5 GB. [2019-10-22 09:02:41,646 INFO L168 Benchmark]: Witness Printer took 181.53 ms. Allocated memory was 3.1 GB in the beginning and 3.2 GB in the end (delta: 36.2 MB). Free memory was 822.2 MB in the beginning and 2.8 GB in the end (delta: -2.0 GB). Peak memory consumption was 6.2 MB. Max. memory is 11.5 GB. [2019-10-22 09:02:41,647 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.17 ms. Allocated memory is still 1.0 GB. Free memory is still 962.2 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 616.57 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 170.4 MB). Free memory was 940.7 MB in the beginning and 1.1 GB in the end (delta: -198.2 MB). Peak memory consumption was 20.0 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 60.65 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.8 MB). Peak memory consumption was 6.8 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 38.28 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 598.26 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: 48.9 MB). Peak memory consumption was 48.9 MB. Max. memory is 11.5 GB. * TraceAbstraction took 21108.00 ms. Allocated memory was 1.2 GB in the beginning and 3.1 GB in the end (delta: 1.9 GB). Free memory was 1.1 GB in the beginning and 822.2 MB in the end (delta: 260.9 MB). Peak memory consumption was 2.2 GB. Max. memory is 11.5 GB. * Witness Printer took 181.53 ms. Allocated memory was 3.1 GB in the beginning and 3.2 GB in the end (delta: 36.2 MB). Free memory was 822.2 MB in the beginning and 2.8 GB in the end (delta: -2.0 GB). Peak memory consumption was 6.2 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 t1661; 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(&t1661, ((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 t1662; 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(&t1662, ((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] [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}, 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] [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 [!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=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 [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=0, 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=0, 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)) [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=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=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=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=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=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=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=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=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] [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=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, 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))=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=0, 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=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, 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=0, 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=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, 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=0, 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=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, 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=0, 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=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=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=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=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=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, 200 locations, 3 error locations. Result: UNSAFE, OverallTime: 20.9s, OverallIterations: 22, TraceHistogramMax: 1, AutomataDifference: 8.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 5341 SDtfs, 5964 SDslu, 11324 SDs, 0 SdLazy, 3415 SolverSat, 246 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 2.8s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 175 GetRequests, 51 SyntacticMatches, 9 SemanticMatches, 115 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 72 ImplicationChecksByTransitivity, 1.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=51955occurred in iteration=6, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 7.9s AutomataMinimizationTime, 21 MinimizatonAttempts, 41733 StatesRemovedByMinimization, 19 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 1.6s InterpolantComputationTime, 1447 NumberOfCodeBlocks, 1447 NumberOfCodeBlocksAsserted, 22 NumberOfCheckSat, 1341 ConstructedInterpolants, 0 QuantifiedInterpolants, 233420 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 21 InterpolantComputations, 21 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...