./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/pthread-wmm/mix031_tso.opt.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version f470102c Calling Ultimate with: /usr/lib/jvm/java-8-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/run_dir_ffa8625b-ea76-4e57-98f9-86248c4f3fd3/bin/utaipan/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/run_dir_ffa8625b-ea76-4e57-98f9-86248c4f3fd3/bin/utaipan/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_ffa8625b-ea76-4e57-98f9-86248c4f3fd3/bin/utaipan/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_ffa8625b-ea76-4e57-98f9-86248c4f3fd3/bin/utaipan/config/TaipanReach.xml -i ../../sv-benchmarks/c/pthread-wmm/mix031_tso.opt.i -s /tmp/vcloud-vcloud-master/worker/run_dir_ffa8625b-ea76-4e57-98f9-86248c4f3fd3/bin/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_ffa8625b-ea76-4e57-98f9-86248c4f3fd3/bin/utaipan --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 Taipan --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 5d2cd970f76a76b84bde79762c11ce7e22c69784 ............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... 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.25-f470102 [2019-12-07 14:04:42,610 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-07 14:04:42,611 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-07 14:04:42,619 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-07 14:04:42,619 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-07 14:04:42,620 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-07 14:04:42,620 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-07 14:04:42,622 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-07 14:04:42,623 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-07 14:04:42,624 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-07 14:04:42,624 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-07 14:04:42,625 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-07 14:04:42,625 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-07 14:04:42,626 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-07 14:04:42,626 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-07 14:04:42,627 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-07 14:04:42,628 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-07 14:04:42,628 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-07 14:04:42,630 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-07 14:04:42,631 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-07 14:04:42,632 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-07 14:04:42,633 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-07 14:04:42,634 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-07 14:04:42,634 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-07 14:04:42,636 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-07 14:04:42,636 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-07 14:04:42,636 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-07 14:04:42,636 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-07 14:04:42,637 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-07 14:04:42,637 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-07 14:04:42,637 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-07 14:04:42,638 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-07 14:04:42,638 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-07 14:04:42,639 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-07 14:04:42,639 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-07 14:04:42,639 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-07 14:04:42,640 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-07 14:04:42,640 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-07 14:04:42,640 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-07 14:04:42,641 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-07 14:04:42,641 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-07 14:04:42,641 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_ffa8625b-ea76-4e57-98f9-86248c4f3fd3/bin/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf [2019-12-07 14:04:42,651 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-07 14:04:42,652 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-07 14:04:42,652 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2019-12-07 14:04:42,652 INFO L138 SettingsManager]: * User list type=DISABLED [2019-12-07 14:04:42,652 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2019-12-07 14:04:42,653 INFO L138 SettingsManager]: * Explicit value domain=true [2019-12-07 14:04:42,653 INFO L138 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2019-12-07 14:04:42,653 INFO L138 SettingsManager]: * Octagon Domain=false [2019-12-07 14:04:42,653 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2019-12-07 14:04:42,653 INFO L138 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2019-12-07 14:04:42,653 INFO L138 SettingsManager]: * Use the RCFG-of-the-future interface=true [2019-12-07 14:04:42,653 INFO L138 SettingsManager]: * Interval Domain=false [2019-12-07 14:04:42,653 INFO L136 SettingsManager]: Preferences of Sifa differ from their defaults: [2019-12-07 14:04:42,654 INFO L138 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2019-12-07 14:04:42,654 INFO L138 SettingsManager]: * Simplification Technique=SIMPLIFY_QUICK [2019-12-07 14:04:42,654 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-07 14:04:42,654 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-07 14:04:42,654 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-07 14:04:42,655 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-07 14:04:42,655 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-07 14:04:42,655 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-07 14:04:42,655 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-07 14:04:42,655 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-07 14:04:42,655 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2019-12-07 14:04:42,655 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-07 14:04:42,655 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-07 14:04:42,655 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-07 14:04:42,656 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-07 14:04:42,656 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-07 14:04:42,656 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-07 14:04:42,656 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-07 14:04:42,656 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-07 14:04:42,656 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-07 14:04:42,656 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-07 14:04:42,656 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-07 14:04:42,657 INFO L138 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2019-12-07 14:04:42,657 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-07 14:04:42,657 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-07 14:04:42,657 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2019-12-07 14:04:42,657 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-12-07 14:04:42,657 INFO L138 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /tmp/vcloud-vcloud-master/worker/run_dir_ffa8625b-ea76-4e57-98f9-86248c4f3fd3/bin/utaipan 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 -> Taipan 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 -> 5d2cd970f76a76b84bde79762c11ce7e22c69784 [2019-12-07 14:04:42,755 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-07 14:04:42,763 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-07 14:04:42,765 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-07 14:04:42,766 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-07 14:04:42,766 INFO L275 PluginConnector]: CDTParser initialized [2019-12-07 14:04:42,767 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_ffa8625b-ea76-4e57-98f9-86248c4f3fd3/bin/utaipan/../../sv-benchmarks/c/pthread-wmm/mix031_tso.opt.i [2019-12-07 14:04:42,803 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_ffa8625b-ea76-4e57-98f9-86248c4f3fd3/bin/utaipan/data/4d5ddfbff/1c116d77f350496aa25afa77dbba6c8d/FLAG41923b70c [2019-12-07 14:04:43,258 INFO L306 CDTParser]: Found 1 translation units. [2019-12-07 14:04:43,259 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_ffa8625b-ea76-4e57-98f9-86248c4f3fd3/sv-benchmarks/c/pthread-wmm/mix031_tso.opt.i [2019-12-07 14:04:43,270 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_ffa8625b-ea76-4e57-98f9-86248c4f3fd3/bin/utaipan/data/4d5ddfbff/1c116d77f350496aa25afa77dbba6c8d/FLAG41923b70c [2019-12-07 14:04:43,279 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_ffa8625b-ea76-4e57-98f9-86248c4f3fd3/bin/utaipan/data/4d5ddfbff/1c116d77f350496aa25afa77dbba6c8d [2019-12-07 14:04:43,281 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-07 14:04:43,282 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-12-07 14:04:43,283 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-07 14:04:43,283 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-07 14:04:43,285 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-07 14:04:43,286 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.12 02:04:43" (1/1) ... [2019-12-07 14:04:43,288 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6a1693e9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 02:04:43, skipping insertion in model container [2019-12-07 14:04:43,288 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.12 02:04:43" (1/1) ... [2019-12-07 14:04:43,293 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-07 14:04:43,322 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-07 14:04:43,568 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-07 14:04:43,575 INFO L203 MainTranslator]: Completed pre-run [2019-12-07 14:04:43,616 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-07 14:04:43,660 INFO L208 MainTranslator]: Completed translation [2019-12-07 14:04:43,660 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 02:04:43 WrapperNode [2019-12-07 14:04:43,660 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-07 14:04:43,661 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-07 14:04:43,661 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-07 14:04:43,661 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-07 14:04:43,666 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 02:04:43" (1/1) ... [2019-12-07 14:04:43,679 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 02:04:43" (1/1) ... [2019-12-07 14:04:43,697 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-07 14:04:43,697 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-07 14:04:43,698 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-07 14:04:43,698 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-07 14:04:43,704 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 02:04:43" (1/1) ... [2019-12-07 14:04:43,704 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 02:04:43" (1/1) ... [2019-12-07 14:04:43,707 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 02:04:43" (1/1) ... [2019-12-07 14:04:43,708 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 02:04:43" (1/1) ... [2019-12-07 14:04:43,713 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 02:04:43" (1/1) ... [2019-12-07 14:04:43,716 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 02:04:43" (1/1) ... [2019-12-07 14:04:43,718 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 02:04:43" (1/1) ... [2019-12-07 14:04:43,721 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-07 14:04:43,721 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-07 14:04:43,721 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-07 14:04:43,721 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-07 14:04:43,722 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 02:04:43" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_ffa8625b-ea76-4e57-98f9-86248c4f3fd3/bin/utaipan/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-12-07 14:04:43,763 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-12-07 14:04:43,763 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2019-12-07 14:04:43,763 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-12-07 14:04:43,763 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-12-07 14:04:43,763 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2019-12-07 14:04:43,763 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2019-12-07 14:04:43,763 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2019-12-07 14:04:43,764 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2019-12-07 14:04:43,764 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2019-12-07 14:04:43,764 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-07 14:04:43,764 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-07 14:04:43,765 WARN L205 CfgBuilder]: User set CodeBlockSize to LoopFreeBlock but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2019-12-07 14:04:44,080 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-07 14:04:44,080 INFO L287 CfgBuilder]: Removed 8 assume(true) statements. [2019-12-07 14:04:44,081 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 02:04:44 BoogieIcfgContainer [2019-12-07 14:04:44,081 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-07 14:04:44,082 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-07 14:04:44,082 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-07 14:04:44,084 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-07 14:04:44,084 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.12 02:04:43" (1/3) ... [2019-12-07 14:04:44,084 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@59f0cb8e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.12 02:04:44, skipping insertion in model container [2019-12-07 14:04:44,084 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 02:04:43" (2/3) ... [2019-12-07 14:04:44,085 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@59f0cb8e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.12 02:04:44, skipping insertion in model container [2019-12-07 14:04:44,085 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 02:04:44" (3/3) ... [2019-12-07 14:04:44,086 INFO L109 eAbstractionObserver]: Analyzing ICFG mix031_tso.opt.i [2019-12-07 14:04:44,092 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-12-07 14:04:44,092 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-07 14:04:44,096 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2019-12-07 14:04:44,097 INFO L339 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2019-12-07 14:04:44,119 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:04:44,119 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:04:44,119 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:04:44,119 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:04:44,120 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:04:44,120 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:04:44,120 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:04:44,120 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:04:44,120 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:04:44,120 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:04:44,120 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:04:44,121 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:04:44,121 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:04:44,121 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:04:44,121 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:04:44,121 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:04:44,121 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:04:44,121 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:04:44,122 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:04:44,122 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:04:44,122 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:04:44,122 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:04:44,122 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:04:44,122 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:04:44,122 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:04:44,123 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:04:44,123 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:04:44,123 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:04:44,123 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:04:44,123 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:04:44,123 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:04:44,123 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:04:44,124 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:04:44,124 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:04:44,124 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:04:44,124 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:04:44,124 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:04:44,124 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:04:44,124 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:04:44,125 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:04:44,125 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:04:44,125 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:04:44,125 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:04:44,125 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:04:44,125 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:04:44,125 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:04:44,125 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:04:44,126 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:04:44,126 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:04:44,126 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:04:44,126 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:04:44,126 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:04:44,126 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:04:44,126 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:04:44,126 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:04:44,127 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:04:44,127 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:04:44,127 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:04:44,127 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:04:44,127 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:04:44,127 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:04:44,127 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:04:44,128 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:04:44,128 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:04:44,128 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:04:44,128 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:04:44,128 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:04:44,128 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:04:44,128 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:04:44,128 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:04:44,128 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:04:44,129 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:04:44,129 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:04:44,129 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:04:44,129 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:04:44,129 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:04:44,129 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:04:44,129 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:04:44,129 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:04:44,130 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:04:44,130 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:04:44,130 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:04:44,130 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:04:44,130 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:04:44,130 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:04:44,130 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:04:44,131 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:04:44,131 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:04:44,131 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:04:44,131 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:04:44,131 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:04:44,131 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:04:44,131 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:04:44,131 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:04:44,132 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:04:44,132 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:04:44,132 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:04:44,132 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:04:44,132 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:04:44,132 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:04:44,133 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:04:44,133 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:04:44,133 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:04:44,133 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:04:44,133 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:04:44,133 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:04:44,134 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:04:44,134 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:04:44,134 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:04:44,134 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:04:44,134 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:04:44,134 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:04:44,134 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:04:44,134 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:04:44,135 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:04:44,135 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:04:44,135 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:04:44,135 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:04:44,135 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:04:44,135 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:04:44,135 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:04:44,135 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:04:44,136 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:04:44,136 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:04:44,136 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:04:44,136 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:04:44,136 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:04:44,136 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:04:44,146 INFO L249 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2019-12-07 14:04:44,158 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-07 14:04:44,159 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-07 14:04:44,159 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-07 14:04:44,159 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-12-07 14:04:44,159 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-07 14:04:44,159 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-07 14:04:44,159 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-07 14:04:44,159 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-07 14:04:44,169 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 139 places, 167 transitions [2019-12-07 14:04:44,170 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 139 places, 167 transitions [2019-12-07 14:04:44,215 INFO L134 PetriNetUnfolder]: 35/165 cut-off events. [2019-12-07 14:04:44,215 INFO L135 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-07 14:04:44,223 INFO L76 FinitePrefix]: Finished finitePrefix Result has 172 conditions, 165 events. 35/165 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 12. Compared 559 event pairs. 6/134 useless extension candidates. Maximal degree in co-relation 132. Up to 2 conditions per place. [2019-12-07 14:04:44,233 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 139 places, 167 transitions [2019-12-07 14:04:44,254 INFO L134 PetriNetUnfolder]: 35/165 cut-off events. [2019-12-07 14:04:44,254 INFO L135 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-07 14:04:44,257 INFO L76 FinitePrefix]: Finished finitePrefix Result has 172 conditions, 165 events. 35/165 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 12. Compared 559 event pairs. 6/134 useless extension candidates. Maximal degree in co-relation 132. Up to 2 conditions per place. [2019-12-07 14:04:44,265 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 10216 [2019-12-07 14:04:44,266 INFO L170 etLargeBlockEncoding]: Semantic Check. [2019-12-07 14:04:46,704 WARN L192 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 45 DAG size of output: 41 [2019-12-07 14:04:46,853 WARN L192 SmtUtils]: Spent 124.00 ms on a formula simplification. DAG size of input: 84 DAG size of output: 82 [2019-12-07 14:04:47,128 INFO L206 etLargeBlockEncoding]: Checked pairs total: 44937 [2019-12-07 14:04:47,129 INFO L214 etLargeBlockEncoding]: Total number of compositions: 105 [2019-12-07 14:04:47,131 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 67 places, 78 transitions [2019-12-07 14:04:47,372 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 6574 states. [2019-12-07 14:04:47,374 INFO L276 IsEmpty]: Start isEmpty. Operand 6574 states. [2019-12-07 14:04:47,378 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-12-07 14:04:47,378 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 14:04:47,378 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-12-07 14:04:47,378 INFO L410 AbstractCegarLoop]: === Iteration 1 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 14:04:47,382 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 14:04:47,382 INFO L82 PathProgramCache]: Analyzing trace with hash 689015014, now seen corresponding path program 1 times [2019-12-07 14:04:47,388 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 14:04:47,389 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2033199938] [2019-12-07 14:04:47,389 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 14:04:47,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:04:47,527 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 14:04:47,527 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2033199938] [2019-12-07 14:04:47,528 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 14:04:47,528 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-07 14:04:47,529 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2051270783] [2019-12-07 14:04:47,532 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 14:04:47,532 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 14:04:47,541 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 14:04:47,541 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 14:04:47,543 INFO L87 Difference]: Start difference. First operand 6574 states. Second operand 3 states. [2019-12-07 14:04:47,710 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 14:04:47,711 INFO L93 Difference]: Finished difference Result 6414 states and 21608 transitions. [2019-12-07 14:04:47,711 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 14:04:47,712 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 5 [2019-12-07 14:04:47,712 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 14:04:47,762 INFO L225 Difference]: With dead ends: 6414 [2019-12-07 14:04:47,762 INFO L226 Difference]: Without dead ends: 6042 [2019-12-07 14:04:47,763 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 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-12-07 14:04:47,825 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6042 states. [2019-12-07 14:04:47,972 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6042 to 6042. [2019-12-07 14:04:47,973 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6042 states. [2019-12-07 14:04:47,994 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6042 states to 6042 states and 20317 transitions. [2019-12-07 14:04:47,995 INFO L78 Accepts]: Start accepts. Automaton has 6042 states and 20317 transitions. Word has length 5 [2019-12-07 14:04:47,996 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 14:04:47,996 INFO L462 AbstractCegarLoop]: Abstraction has 6042 states and 20317 transitions. [2019-12-07 14:04:47,996 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 14:04:47,996 INFO L276 IsEmpty]: Start isEmpty. Operand 6042 states and 20317 transitions. [2019-12-07 14:04:47,998 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-12-07 14:04:47,999 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 14:04:47,999 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 14:04:47,999 INFO L410 AbstractCegarLoop]: === Iteration 2 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 14:04:47,999 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 14:04:47,999 INFO L82 PathProgramCache]: Analyzing trace with hash 288534667, now seen corresponding path program 1 times [2019-12-07 14:04:48,000 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 14:04:48,000 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [864584076] [2019-12-07 14:04:48,000 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 14:04:48,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:04:48,075 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 14:04:48,075 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [864584076] [2019-12-07 14:04:48,076 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 14:04:48,076 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 14:04:48,076 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1912840446] [2019-12-07 14:04:48,077 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 14:04:48,077 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 14:04:48,077 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 14:04:48,078 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 14:04:48,078 INFO L87 Difference]: Start difference. First operand 6042 states and 20317 transitions. Second operand 4 states. [2019-12-07 14:04:48,272 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 14:04:48,272 INFO L93 Difference]: Finished difference Result 9128 states and 29363 transitions. [2019-12-07 14:04:48,272 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-07 14:04:48,272 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 11 [2019-12-07 14:04:48,273 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 14:04:48,330 INFO L225 Difference]: With dead ends: 9128 [2019-12-07 14:04:48,330 INFO L226 Difference]: Without dead ends: 9113 [2019-12-07 14:04:48,331 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-07 14:04:48,381 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9113 states. [2019-12-07 14:04:48,557 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9113 to 8369. [2019-12-07 14:04:48,557 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8369 states. [2019-12-07 14:04:48,574 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8369 states to 8369 states and 27318 transitions. [2019-12-07 14:04:48,574 INFO L78 Accepts]: Start accepts. Automaton has 8369 states and 27318 transitions. Word has length 11 [2019-12-07 14:04:48,574 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 14:04:48,574 INFO L462 AbstractCegarLoop]: Abstraction has 8369 states and 27318 transitions. [2019-12-07 14:04:48,574 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 14:04:48,574 INFO L276 IsEmpty]: Start isEmpty. Operand 8369 states and 27318 transitions. [2019-12-07 14:04:48,580 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-12-07 14:04:48,580 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 14:04:48,580 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 14:04:48,580 INFO L410 AbstractCegarLoop]: === Iteration 3 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 14:04:48,580 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 14:04:48,580 INFO L82 PathProgramCache]: Analyzing trace with hash -869921106, now seen corresponding path program 1 times [2019-12-07 14:04:48,581 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 14:04:48,581 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [27256914] [2019-12-07 14:04:48,581 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 14:04:48,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:04:48,611 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 14:04:48,611 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [27256914] [2019-12-07 14:04:48,611 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 14:04:48,612 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 14:04:48,612 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1859594040] [2019-12-07 14:04:48,612 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 14:04:48,612 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 14:04:48,612 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 14:04:48,613 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 14:04:48,613 INFO L87 Difference]: Start difference. First operand 8369 states and 27318 transitions. Second operand 3 states. [2019-12-07 14:04:48,676 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 14:04:48,676 INFO L93 Difference]: Finished difference Result 11252 states and 36788 transitions. [2019-12-07 14:04:48,677 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 14:04:48,677 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 14 [2019-12-07 14:04:48,677 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 14:04:48,715 INFO L225 Difference]: With dead ends: 11252 [2019-12-07 14:04:48,715 INFO L226 Difference]: Without dead ends: 11252 [2019-12-07 14:04:48,715 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 14:04:48,767 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11252 states. [2019-12-07 14:04:48,912 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11252 to 9819. [2019-12-07 14:04:48,912 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9819 states. [2019-12-07 14:04:48,935 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9819 states to 9819 states and 32327 transitions. [2019-12-07 14:04:48,935 INFO L78 Accepts]: Start accepts. Automaton has 9819 states and 32327 transitions. Word has length 14 [2019-12-07 14:04:48,936 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 14:04:48,936 INFO L462 AbstractCegarLoop]: Abstraction has 9819 states and 32327 transitions. [2019-12-07 14:04:48,936 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 14:04:48,936 INFO L276 IsEmpty]: Start isEmpty. Operand 9819 states and 32327 transitions. [2019-12-07 14:04:48,938 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-12-07 14:04:48,938 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 14:04:48,938 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 14:04:48,938 INFO L410 AbstractCegarLoop]: === Iteration 4 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 14:04:48,938 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 14:04:48,938 INFO L82 PathProgramCache]: Analyzing trace with hash -732651370, now seen corresponding path program 1 times [2019-12-07 14:04:48,938 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 14:04:48,938 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [212299766] [2019-12-07 14:04:48,938 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 14:04:48,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:04:48,975 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 14:04:48,975 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [212299766] [2019-12-07 14:04:48,975 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 14:04:48,975 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 14:04:48,975 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [548990217] [2019-12-07 14:04:48,975 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 14:04:48,976 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 14:04:48,976 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 14:04:48,976 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 14:04:48,976 INFO L87 Difference]: Start difference. First operand 9819 states and 32327 transitions. Second operand 4 states. [2019-12-07 14:04:49,115 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 14:04:49,115 INFO L93 Difference]: Finished difference Result 11915 states and 38297 transitions. [2019-12-07 14:04:49,116 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-07 14:04:49,116 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 14 [2019-12-07 14:04:49,116 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 14:04:49,147 INFO L225 Difference]: With dead ends: 11915 [2019-12-07 14:04:49,147 INFO L226 Difference]: Without dead ends: 11904 [2019-12-07 14:04:49,147 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-07 14:04:49,195 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11904 states. [2019-12-07 14:04:49,319 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11904 to 10744. [2019-12-07 14:04:49,319 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10744 states. [2019-12-07 14:04:49,385 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10744 states to 10744 states and 35020 transitions. [2019-12-07 14:04:49,385 INFO L78 Accepts]: Start accepts. Automaton has 10744 states and 35020 transitions. Word has length 14 [2019-12-07 14:04:49,386 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 14:04:49,386 INFO L462 AbstractCegarLoop]: Abstraction has 10744 states and 35020 transitions. [2019-12-07 14:04:49,386 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 14:04:49,386 INFO L276 IsEmpty]: Start isEmpty. Operand 10744 states and 35020 transitions. [2019-12-07 14:04:49,387 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-12-07 14:04:49,387 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 14:04:49,388 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 14:04:49,388 INFO L410 AbstractCegarLoop]: === Iteration 5 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 14:04:49,388 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 14:04:49,388 INFO L82 PathProgramCache]: Analyzing trace with hash -1514120075, now seen corresponding path program 1 times [2019-12-07 14:04:49,388 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 14:04:49,388 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [794894354] [2019-12-07 14:04:49,388 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 14:04:49,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:04:49,419 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 14:04:49,420 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [794894354] [2019-12-07 14:04:49,420 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 14:04:49,420 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 14:04:49,420 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [981805940] [2019-12-07 14:04:49,420 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 14:04:49,420 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 14:04:49,420 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 14:04:49,421 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 14:04:49,421 INFO L87 Difference]: Start difference. First operand 10744 states and 35020 transitions. Second operand 4 states. [2019-12-07 14:04:49,548 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 14:04:49,548 INFO L93 Difference]: Finished difference Result 12870 states and 41385 transitions. [2019-12-07 14:04:49,549 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-07 14:04:49,549 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 14 [2019-12-07 14:04:49,549 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 14:04:49,570 INFO L225 Difference]: With dead ends: 12870 [2019-12-07 14:04:49,571 INFO L226 Difference]: Without dead ends: 12857 [2019-12-07 14:04:49,571 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-07 14:04:49,624 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12857 states. [2019-12-07 14:04:49,744 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12857 to 10870. [2019-12-07 14:04:49,744 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10870 states. [2019-12-07 14:04:49,762 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10870 states to 10870 states and 35539 transitions. [2019-12-07 14:04:49,763 INFO L78 Accepts]: Start accepts. Automaton has 10870 states and 35539 transitions. Word has length 14 [2019-12-07 14:04:49,763 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 14:04:49,763 INFO L462 AbstractCegarLoop]: Abstraction has 10870 states and 35539 transitions. [2019-12-07 14:04:49,763 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 14:04:49,763 INFO L276 IsEmpty]: Start isEmpty. Operand 10870 states and 35539 transitions. [2019-12-07 14:04:49,766 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-12-07 14:04:49,766 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 14:04:49,766 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 14:04:49,766 INFO L410 AbstractCegarLoop]: === Iteration 6 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 14:04:49,766 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 14:04:49,766 INFO L82 PathProgramCache]: Analyzing trace with hash -133127032, now seen corresponding path program 1 times [2019-12-07 14:04:49,767 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 14:04:49,767 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1713435538] [2019-12-07 14:04:49,767 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 14:04:49,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:04:49,821 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 14:04:49,822 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1713435538] [2019-12-07 14:04:49,822 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 14:04:49,822 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-07 14:04:49,822 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1586639431] [2019-12-07 14:04:49,823 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 14:04:49,823 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 14:04:49,823 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 14:04:49,823 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 14:04:49,823 INFO L87 Difference]: Start difference. First operand 10870 states and 35539 transitions. Second operand 3 states. [2019-12-07 14:04:49,862 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 14:04:49,862 INFO L93 Difference]: Finished difference Result 10914 states and 35611 transitions. [2019-12-07 14:04:49,862 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 14:04:49,862 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 16 [2019-12-07 14:04:49,862 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 14:04:49,875 INFO L225 Difference]: With dead ends: 10914 [2019-12-07 14:04:49,875 INFO L226 Difference]: Without dead ends: 10914 [2019-12-07 14:04:49,875 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 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-12-07 14:04:49,915 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10914 states. [2019-12-07 14:04:50,014 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10914 to 10867. [2019-12-07 14:04:50,014 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10867 states. [2019-12-07 14:04:50,085 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10867 states to 10867 states and 35530 transitions. [2019-12-07 14:04:50,085 INFO L78 Accepts]: Start accepts. Automaton has 10867 states and 35530 transitions. Word has length 16 [2019-12-07 14:04:50,085 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 14:04:50,085 INFO L462 AbstractCegarLoop]: Abstraction has 10867 states and 35530 transitions. [2019-12-07 14:04:50,085 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 14:04:50,086 INFO L276 IsEmpty]: Start isEmpty. Operand 10867 states and 35530 transitions. [2019-12-07 14:04:50,089 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-12-07 14:04:50,089 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 14:04:50,089 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 14:04:50,089 INFO L410 AbstractCegarLoop]: === Iteration 7 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 14:04:50,089 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 14:04:50,089 INFO L82 PathProgramCache]: Analyzing trace with hash 1519842378, now seen corresponding path program 1 times [2019-12-07 14:04:50,089 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 14:04:50,089 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1879239491] [2019-12-07 14:04:50,090 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 14:04:50,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:04:50,130 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 14:04:50,131 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1879239491] [2019-12-07 14:04:50,131 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 14:04:50,131 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-07 14:04:50,131 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [322391603] [2019-12-07 14:04:50,131 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 14:04:50,131 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 14:04:50,132 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 14:04:50,132 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 14:04:50,132 INFO L87 Difference]: Start difference. First operand 10867 states and 35530 transitions. Second operand 3 states. [2019-12-07 14:04:50,171 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 14:04:50,171 INFO L93 Difference]: Finished difference Result 10731 states and 35082 transitions. [2019-12-07 14:04:50,172 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 14:04:50,172 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 17 [2019-12-07 14:04:50,172 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 14:04:50,184 INFO L225 Difference]: With dead ends: 10731 [2019-12-07 14:04:50,184 INFO L226 Difference]: Without dead ends: 10731 [2019-12-07 14:04:50,185 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 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-12-07 14:04:50,226 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10731 states. [2019-12-07 14:04:50,320 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10731 to 10731. [2019-12-07 14:04:50,320 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10731 states. [2019-12-07 14:04:50,338 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10731 states to 10731 states and 35082 transitions. [2019-12-07 14:04:50,338 INFO L78 Accepts]: Start accepts. Automaton has 10731 states and 35082 transitions. Word has length 17 [2019-12-07 14:04:50,338 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 14:04:50,338 INFO L462 AbstractCegarLoop]: Abstraction has 10731 states and 35082 transitions. [2019-12-07 14:04:50,338 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 14:04:50,338 INFO L276 IsEmpty]: Start isEmpty. Operand 10731 states and 35082 transitions. [2019-12-07 14:04:50,342 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-12-07 14:04:50,342 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 14:04:50,342 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 14:04:50,342 INFO L410 AbstractCegarLoop]: === Iteration 8 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 14:04:50,342 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 14:04:50,342 INFO L82 PathProgramCache]: Analyzing trace with hash 319851597, now seen corresponding path program 1 times [2019-12-07 14:04:50,342 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 14:04:50,343 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1048923536] [2019-12-07 14:04:50,343 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 14:04:50,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:04:50,370 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 14:04:50,371 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1048923536] [2019-12-07 14:04:50,371 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 14:04:50,371 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 14:04:50,371 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2024478299] [2019-12-07 14:04:50,372 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 14:04:50,372 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 14:04:50,372 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 14:04:50,372 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 14:04:50,372 INFO L87 Difference]: Start difference. First operand 10731 states and 35082 transitions. Second operand 3 states. [2019-12-07 14:04:50,407 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 14:04:50,407 INFO L93 Difference]: Finished difference Result 10169 states and 32732 transitions. [2019-12-07 14:04:50,408 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 14:04:50,408 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 17 [2019-12-07 14:04:50,408 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 14:04:50,420 INFO L225 Difference]: With dead ends: 10169 [2019-12-07 14:04:50,420 INFO L226 Difference]: Without dead ends: 10169 [2019-12-07 14:04:50,421 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 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-12-07 14:04:50,458 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10169 states. [2019-12-07 14:04:50,549 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10169 to 10069. [2019-12-07 14:04:50,549 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10069 states. [2019-12-07 14:04:50,565 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10069 states to 10069 states and 32442 transitions. [2019-12-07 14:04:50,565 INFO L78 Accepts]: Start accepts. Automaton has 10069 states and 32442 transitions. Word has length 17 [2019-12-07 14:04:50,565 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 14:04:50,565 INFO L462 AbstractCegarLoop]: Abstraction has 10069 states and 32442 transitions. [2019-12-07 14:04:50,565 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 14:04:50,565 INFO L276 IsEmpty]: Start isEmpty. Operand 10069 states and 32442 transitions. [2019-12-07 14:04:50,568 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-12-07 14:04:50,568 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 14:04:50,568 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 14:04:50,568 INFO L410 AbstractCegarLoop]: === Iteration 9 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 14:04:50,568 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 14:04:50,569 INFO L82 PathProgramCache]: Analyzing trace with hash 913825408, now seen corresponding path program 1 times [2019-12-07 14:04:50,569 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 14:04:50,569 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [435558748] [2019-12-07 14:04:50,569 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 14:04:50,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:04:50,609 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 14:04:50,609 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [435558748] [2019-12-07 14:04:50,609 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 14:04:50,609 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 14:04:50,609 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [274570593] [2019-12-07 14:04:50,609 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 14:04:50,609 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 14:04:50,610 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 14:04:50,610 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-07 14:04:50,610 INFO L87 Difference]: Start difference. First operand 10069 states and 32442 transitions. Second operand 4 states. [2019-12-07 14:04:50,649 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 14:04:50,649 INFO L93 Difference]: Finished difference Result 10094 states and 32458 transitions. [2019-12-07 14:04:50,649 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 14:04:50,649 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 18 [2019-12-07 14:04:50,649 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 14:04:50,661 INFO L225 Difference]: With dead ends: 10094 [2019-12-07 14:04:50,661 INFO L226 Difference]: Without dead ends: 10094 [2019-12-07 14:04:50,661 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-07 14:04:50,698 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10094 states. [2019-12-07 14:04:50,796 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10094 to 10047. [2019-12-07 14:04:50,796 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10047 states. [2019-12-07 14:04:50,818 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10047 states to 10047 states and 32377 transitions. [2019-12-07 14:04:50,818 INFO L78 Accepts]: Start accepts. Automaton has 10047 states and 32377 transitions. Word has length 18 [2019-12-07 14:04:50,818 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 14:04:50,818 INFO L462 AbstractCegarLoop]: Abstraction has 10047 states and 32377 transitions. [2019-12-07 14:04:50,818 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 14:04:50,818 INFO L276 IsEmpty]: Start isEmpty. Operand 10047 states and 32377 transitions. [2019-12-07 14:04:50,823 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-12-07 14:04:50,823 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 14:04:50,823 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 14:04:50,823 INFO L410 AbstractCegarLoop]: === Iteration 10 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 14:04:50,823 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 14:04:50,823 INFO L82 PathProgramCache]: Analyzing trace with hash 279528898, now seen corresponding path program 1 times [2019-12-07 14:04:50,823 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 14:04:50,823 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [735882109] [2019-12-07 14:04:50,824 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 14:04:50,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:04:50,868 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 14:04:50,869 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [735882109] [2019-12-07 14:04:50,869 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 14:04:50,869 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 14:04:50,869 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1123482310] [2019-12-07 14:04:50,870 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 14:04:50,870 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 14:04:50,870 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 14:04:50,870 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 14:04:50,870 INFO L87 Difference]: Start difference. First operand 10047 states and 32377 transitions. Second operand 4 states. [2019-12-07 14:04:50,975 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 14:04:50,975 INFO L93 Difference]: Finished difference Result 16813 states and 54403 transitions. [2019-12-07 14:04:50,976 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-07 14:04:50,976 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 19 [2019-12-07 14:04:50,976 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 14:04:50,996 INFO L225 Difference]: With dead ends: 16813 [2019-12-07 14:04:50,996 INFO L226 Difference]: Without dead ends: 16097 [2019-12-07 14:04:50,996 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-07 14:04:51,045 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16097 states. [2019-12-07 14:04:51,187 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16097 to 16050. [2019-12-07 14:04:51,187 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16050 states. [2019-12-07 14:04:51,214 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16050 states to 16050 states and 52130 transitions. [2019-12-07 14:04:51,214 INFO L78 Accepts]: Start accepts. Automaton has 16050 states and 52130 transitions. Word has length 19 [2019-12-07 14:04:51,214 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 14:04:51,214 INFO L462 AbstractCegarLoop]: Abstraction has 16050 states and 52130 transitions. [2019-12-07 14:04:51,214 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 14:04:51,214 INFO L276 IsEmpty]: Start isEmpty. Operand 16050 states and 52130 transitions. [2019-12-07 14:04:51,219 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-12-07 14:04:51,219 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 14:04:51,219 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 14:04:51,219 INFO L410 AbstractCegarLoop]: === Iteration 11 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 14:04:51,219 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 14:04:51,219 INFO L82 PathProgramCache]: Analyzing trace with hash -1736189218, now seen corresponding path program 2 times [2019-12-07 14:04:51,220 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 14:04:51,220 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2081222570] [2019-12-07 14:04:51,220 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 14:04:51,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:04:51,244 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 14:04:51,244 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2081222570] [2019-12-07 14:04:51,245 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 14:04:51,245 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 14:04:51,245 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1392175542] [2019-12-07 14:04:51,245 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 14:04:51,245 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 14:04:51,246 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 14:04:51,246 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 14:04:51,246 INFO L87 Difference]: Start difference. First operand 16050 states and 52130 transitions. Second operand 3 states. [2019-12-07 14:04:51,258 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 14:04:51,259 INFO L93 Difference]: Finished difference Result 2148 states and 5220 transitions. [2019-12-07 14:04:51,259 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 14:04:51,259 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 19 [2019-12-07 14:04:51,259 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 14:04:51,261 INFO L225 Difference]: With dead ends: 2148 [2019-12-07 14:04:51,262 INFO L226 Difference]: Without dead ends: 2148 [2019-12-07 14:04:51,262 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 14:04:51,266 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2148 states. [2019-12-07 14:04:51,282 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2148 to 2148. [2019-12-07 14:04:51,282 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2148 states. [2019-12-07 14:04:51,284 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2148 states to 2148 states and 5220 transitions. [2019-12-07 14:04:51,284 INFO L78 Accepts]: Start accepts. Automaton has 2148 states and 5220 transitions. Word has length 19 [2019-12-07 14:04:51,285 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 14:04:51,285 INFO L462 AbstractCegarLoop]: Abstraction has 2148 states and 5220 transitions. [2019-12-07 14:04:51,285 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 14:04:51,285 INFO L276 IsEmpty]: Start isEmpty. Operand 2148 states and 5220 transitions. [2019-12-07 14:04:51,286 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-12-07 14:04:51,286 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 14:04:51,286 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 14:04:51,287 INFO L410 AbstractCegarLoop]: === Iteration 12 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 14:04:51,287 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 14:04:51,287 INFO L82 PathProgramCache]: Analyzing trace with hash -1710596290, now seen corresponding path program 1 times [2019-12-07 14:04:51,287 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 14:04:51,287 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [990678177] [2019-12-07 14:04:51,287 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 14:04:51,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:04:51,322 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 14:04:51,322 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [990678177] [2019-12-07 14:04:51,322 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 14:04:51,322 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 14:04:51,323 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [308756018] [2019-12-07 14:04:51,323 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-07 14:04:51,323 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 14:04:51,323 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-07 14:04:51,323 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-07 14:04:51,324 INFO L87 Difference]: Start difference. First operand 2148 states and 5220 transitions. Second operand 5 states. [2019-12-07 14:04:51,440 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 14:04:51,440 INFO L93 Difference]: Finished difference Result 2712 states and 6453 transitions. [2019-12-07 14:04:51,441 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-07 14:04:51,441 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 26 [2019-12-07 14:04:51,441 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 14:04:51,443 INFO L225 Difference]: With dead ends: 2712 [2019-12-07 14:04:51,443 INFO L226 Difference]: Without dead ends: 2676 [2019-12-07 14:04:51,443 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-12-07 14:04:51,446 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2676 states. [2019-12-07 14:04:51,459 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2676 to 2248. [2019-12-07 14:04:51,460 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2248 states. [2019-12-07 14:04:51,462 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2248 states to 2248 states and 5430 transitions. [2019-12-07 14:04:51,462 INFO L78 Accepts]: Start accepts. Automaton has 2248 states and 5430 transitions. Word has length 26 [2019-12-07 14:04:51,462 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 14:04:51,462 INFO L462 AbstractCegarLoop]: Abstraction has 2248 states and 5430 transitions. [2019-12-07 14:04:51,462 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-07 14:04:51,462 INFO L276 IsEmpty]: Start isEmpty. Operand 2248 states and 5430 transitions. [2019-12-07 14:04:51,464 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-12-07 14:04:51,464 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 14:04:51,464 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 14:04:51,464 INFO L410 AbstractCegarLoop]: === Iteration 13 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 14:04:51,464 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 14:04:51,464 INFO L82 PathProgramCache]: Analyzing trace with hash 225797087, now seen corresponding path program 1 times [2019-12-07 14:04:51,464 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 14:04:51,464 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [985459515] [2019-12-07 14:04:51,464 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 14:04:51,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:04:51,496 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 14:04:51,496 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [985459515] [2019-12-07 14:04:51,496 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 14:04:51,496 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 14:04:51,496 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1388784530] [2019-12-07 14:04:51,496 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-07 14:04:51,497 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 14:04:51,497 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-07 14:04:51,497 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-07 14:04:51,497 INFO L87 Difference]: Start difference. First operand 2248 states and 5430 transitions. Second operand 5 states. [2019-12-07 14:04:51,610 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 14:04:51,610 INFO L93 Difference]: Finished difference Result 2669 states and 6370 transitions. [2019-12-07 14:04:51,611 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-07 14:04:51,611 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 27 [2019-12-07 14:04:51,611 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 14:04:51,613 INFO L225 Difference]: With dead ends: 2669 [2019-12-07 14:04:51,613 INFO L226 Difference]: Without dead ends: 2633 [2019-12-07 14:04:51,613 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-12-07 14:04:51,616 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2633 states. [2019-12-07 14:04:51,629 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2633 to 2120. [2019-12-07 14:04:51,629 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2120 states. [2019-12-07 14:04:51,632 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2120 states to 2120 states and 5179 transitions. [2019-12-07 14:04:51,633 INFO L78 Accepts]: Start accepts. Automaton has 2120 states and 5179 transitions. Word has length 27 [2019-12-07 14:04:51,633 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 14:04:51,633 INFO L462 AbstractCegarLoop]: Abstraction has 2120 states and 5179 transitions. [2019-12-07 14:04:51,633 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-07 14:04:51,633 INFO L276 IsEmpty]: Start isEmpty. Operand 2120 states and 5179 transitions. [2019-12-07 14:04:51,635 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2019-12-07 14:04:51,635 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 14:04:51,635 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 14:04:51,636 INFO L410 AbstractCegarLoop]: === Iteration 14 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 14:04:51,636 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 14:04:51,636 INFO L82 PathProgramCache]: Analyzing trace with hash -724042887, now seen corresponding path program 1 times [2019-12-07 14:04:51,636 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 14:04:51,636 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2050729126] [2019-12-07 14:04:51,636 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 14:04:51,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:04:51,674 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 14:04:51,674 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2050729126] [2019-12-07 14:04:51,674 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 14:04:51,674 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 14:04:51,675 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [228153560] [2019-12-07 14:04:51,675 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 14:04:51,675 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 14:04:51,675 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 14:04:51,675 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-07 14:04:51,675 INFO L87 Difference]: Start difference. First operand 2120 states and 5179 transitions. Second operand 4 states. [2019-12-07 14:04:51,689 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 14:04:51,689 INFO L93 Difference]: Finished difference Result 990 states and 2359 transitions. [2019-12-07 14:04:51,690 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 14:04:51,690 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 28 [2019-12-07 14:04:51,690 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 14:04:51,691 INFO L225 Difference]: With dead ends: 990 [2019-12-07 14:04:51,691 INFO L226 Difference]: Without dead ends: 990 [2019-12-07 14:04:51,691 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-07 14:04:51,692 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 990 states. [2019-12-07 14:04:51,697 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 990 to 649. [2019-12-07 14:04:51,697 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 649 states. [2019-12-07 14:04:51,698 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 649 states to 649 states and 1501 transitions. [2019-12-07 14:04:51,699 INFO L78 Accepts]: Start accepts. Automaton has 649 states and 1501 transitions. Word has length 28 [2019-12-07 14:04:51,699 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 14:04:51,699 INFO L462 AbstractCegarLoop]: Abstraction has 649 states and 1501 transitions. [2019-12-07 14:04:51,699 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 14:04:51,699 INFO L276 IsEmpty]: Start isEmpty. Operand 649 states and 1501 transitions. [2019-12-07 14:04:51,700 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2019-12-07 14:04:51,700 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 14:04:51,700 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 14:04:51,701 INFO L410 AbstractCegarLoop]: === Iteration 15 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 14:04:51,701 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 14:04:51,701 INFO L82 PathProgramCache]: Analyzing trace with hash -1722201146, now seen corresponding path program 1 times [2019-12-07 14:04:51,701 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 14:04:51,701 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [516597981] [2019-12-07 14:04:51,701 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 14:04:51,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:04:51,749 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 14:04:51,749 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [516597981] [2019-12-07 14:04:51,749 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 14:04:51,750 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 14:04:51,750 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1905571230] [2019-12-07 14:04:51,750 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 14:04:51,750 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 14:04:51,750 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 14:04:51,751 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 14:04:51,751 INFO L87 Difference]: Start difference. First operand 649 states and 1501 transitions. Second operand 4 states. [2019-12-07 14:04:51,764 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 14:04:51,764 INFO L93 Difference]: Finished difference Result 1056 states and 2480 transitions. [2019-12-07 14:04:51,764 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 14:04:51,764 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 42 [2019-12-07 14:04:51,765 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 14:04:51,765 INFO L225 Difference]: With dead ends: 1056 [2019-12-07 14:04:51,765 INFO L226 Difference]: Without dead ends: 426 [2019-12-07 14:04:51,766 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-07 14:04:51,767 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 426 states. [2019-12-07 14:04:51,770 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 426 to 426. [2019-12-07 14:04:51,770 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 426 states. [2019-12-07 14:04:51,771 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 426 states to 426 states and 1010 transitions. [2019-12-07 14:04:51,771 INFO L78 Accepts]: Start accepts. Automaton has 426 states and 1010 transitions. Word has length 42 [2019-12-07 14:04:51,771 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 14:04:51,771 INFO L462 AbstractCegarLoop]: Abstraction has 426 states and 1010 transitions. [2019-12-07 14:04:51,771 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 14:04:51,771 INFO L276 IsEmpty]: Start isEmpty. Operand 426 states and 1010 transitions. [2019-12-07 14:04:51,772 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2019-12-07 14:04:51,772 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 14:04:51,772 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 14:04:51,773 INFO L410 AbstractCegarLoop]: === Iteration 16 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 14:04:51,773 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 14:04:51,773 INFO L82 PathProgramCache]: Analyzing trace with hash -146556572, now seen corresponding path program 2 times [2019-12-07 14:04:51,773 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 14:04:51,773 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [18009743] [2019-12-07 14:04:51,773 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 14:04:51,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:04:51,832 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 14:04:51,833 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [18009743] [2019-12-07 14:04:51,833 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 14:04:51,833 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-07 14:04:51,833 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [293702479] [2019-12-07 14:04:51,833 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-07 14:04:51,833 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 14:04:51,834 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-07 14:04:51,834 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-12-07 14:04:51,834 INFO L87 Difference]: Start difference. First operand 426 states and 1010 transitions. Second operand 7 states. [2019-12-07 14:04:51,935 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 14:04:51,935 INFO L93 Difference]: Finished difference Result 818 states and 1885 transitions. [2019-12-07 14:04:51,935 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-12-07 14:04:51,935 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 42 [2019-12-07 14:04:51,935 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 14:04:51,936 INFO L225 Difference]: With dead ends: 818 [2019-12-07 14:04:51,936 INFO L226 Difference]: Without dead ends: 532 [2019-12-07 14:04:51,936 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=29, Invalid=81, Unknown=0, NotChecked=0, Total=110 [2019-12-07 14:04:51,937 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 532 states. [2019-12-07 14:04:51,939 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 532 to 474. [2019-12-07 14:04:51,939 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 474 states. [2019-12-07 14:04:51,940 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 474 states to 474 states and 1092 transitions. [2019-12-07 14:04:51,940 INFO L78 Accepts]: Start accepts. Automaton has 474 states and 1092 transitions. Word has length 42 [2019-12-07 14:04:51,940 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 14:04:51,940 INFO L462 AbstractCegarLoop]: Abstraction has 474 states and 1092 transitions. [2019-12-07 14:04:51,940 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-07 14:04:51,940 INFO L276 IsEmpty]: Start isEmpty. Operand 474 states and 1092 transitions. [2019-12-07 14:04:51,941 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2019-12-07 14:04:51,941 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 14:04:51,941 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 14:04:51,941 INFO L410 AbstractCegarLoop]: === Iteration 17 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 14:04:51,941 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 14:04:51,941 INFO L82 PathProgramCache]: Analyzing trace with hash -1106289564, now seen corresponding path program 3 times [2019-12-07 14:04:51,941 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 14:04:51,942 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [615306314] [2019-12-07 14:04:51,942 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 14:04:51,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-07 14:04:51,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-07 14:04:52,006 INFO L174 FreeRefinementEngine]: Strategy SIFA_TAIPAN found a feasible trace [2019-12-07 14:04:52,006 INFO L475 BasicCegarLoop]: Counterexample might be feasible [2019-12-07 14:04:52,008 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [696] [696] ULTIMATE.startENTRY-->L810: Formula: (let ((.cse0 (store |v_#valid_54| 0 0))) (and (= v_~__unbuffered_p1_EBX~0_96 0) (= 0 v_~y$read_delayed_var~0.offset_7) (= v_~y$r_buff0_thd1~0_280 0) (= v_~y$mem_tmp~0_16 0) (= 0 v_~weak$$choice0~0_14) (= v_~z~0_66 0) (= v_~y$read_delayed~0_7 0) (= v_~y$w_buff0_used~0_614 0) (= |v_#NULL.offset_3| 0) (= 0 v_~y$flush_delayed~0_46) (< |v_#StackHeapBarrier_14| |v_ULTIMATE.start_main_~#t847~0.base_37|) (= v_~x~0_15 0) (= |v_#valid_52| (store .cse0 |v_ULTIMATE.start_main_~#t847~0.base_37| 1)) (= v_~y$r_buff1_thd0~0_156 0) (= v_~y$w_buff1_used~0_428 0) (= |v_#length_15| (store |v_#length_16| |v_ULTIMATE.start_main_~#t847~0.base_37| 4)) (= 0 v_~y$r_buff1_thd2~0_121) (= 0 v_~y$w_buff0~0_385) (= 0 v_~__unbuffered_p0_EAX~0_43) (= v_~main$tmp_guard1~0_39 0) (= v_~y~0_143 0) (= v_~a~0_73 0) (< 0 |v_#StackHeapBarrier_14|) (= v_~__unbuffered_p0_EBX~0_65 0) (= (select .cse0 |v_ULTIMATE.start_main_~#t847~0.base_37|) 0) (= 0 v_~y$read_delayed_var~0.base_7) (= v_~main$tmp_guard0~0_21 0) (= 0 v_~y$r_buff0_thd2~0_193) (= v_~y$w_buff1~0_254 0) (= 0 |v_#NULL.base_3|) (= 0 |v_ULTIMATE.start_main_~#t847~0.offset_26|) (= v_~weak$$choice2~0_115 0) (= v_~y$r_buff1_thd1~0_232 0) (= 0 v_~__unbuffered_p1_EAX~0_96) (= v_~y$r_buff0_thd0~0_131 0) (= 0 v_~__unbuffered_cnt~0_84) (= (store |v_#memory_int_16| |v_ULTIMATE.start_main_~#t847~0.base_37| (store (select |v_#memory_int_16| |v_ULTIMATE.start_main_~#t847~0.base_37|) |v_ULTIMATE.start_main_~#t847~0.offset_26| 0)) |v_#memory_int_15|))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_14|, #valid=|v_#valid_54|, #memory_int=|v_#memory_int_16|, #length=|v_#length_16|} OutVars{ULTIMATE.start_main_#t~nondet32=|v_ULTIMATE.start_main_#t~nondet32_9|, ~y$read_delayed_var~0.offset=v_~y$read_delayed_var~0.offset_7, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_614, ULTIMATE.start_main_#t~nondet33=|v_ULTIMATE.start_main_#t~nondet33_19|, #NULL.offset=|v_#NULL.offset_3|, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_39, ULTIMATE.start_main_~#t848~0.offset=|v_ULTIMATE.start_main_~#t848~0.offset_18|, ~y$read_delayed~0=v_~y$read_delayed~0_7, ~y$r_buff1_thd1~0=v_~y$r_buff1_thd1~0_232, ~a~0=v_~a~0_73, ~y$mem_tmp~0=v_~y$mem_tmp~0_16, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_43, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_96, ~y$w_buff0~0=v_~y$w_buff0~0_385, ~y$r_buff0_thd1~0=v_~y$r_buff0_thd1~0_280, ~y$flush_delayed~0=v_~y$flush_delayed~0_46, #length=|v_#length_15|, ~y~0=v_~y~0_143, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_96, ~__unbuffered_p0_EBX~0=v_~__unbuffered_p0_EBX~0_65, ULTIMATE.start_main_#t~ite39=|v_ULTIMATE.start_main_#t~ite39_77|, ULTIMATE.start_main_#t~ite35=|v_ULTIMATE.start_main_#t~ite35_29|, ULTIMATE.start_main_#t~ite36=|v_ULTIMATE.start_main_#t~ite36_99|, ULTIMATE.start_main_#t~ite38=|v_ULTIMATE.start_main_#t~ite38_37|, ULTIMATE.start_main_#t~ite37=|v_ULTIMATE.start_main_#t~ite37_51|, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_21, ULTIMATE.start_main_~#t848~0.base=|v_ULTIMATE.start_main_~#t848~0.base_23|, #NULL.base=|v_#NULL.base_3|, ULTIMATE.start_main_#t~ite34=|v_ULTIMATE.start_main_#t~ite34_59|, ~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_121, ~weak$$choice0~0=v_~weak$$choice0~0_14, #StackHeapBarrier=|v_#StackHeapBarrier_14|, ULTIMATE.start_main_~#t847~0.base=|v_ULTIMATE.start_main_~#t847~0.base_37|, ~y$w_buff1~0=v_~y$w_buff1~0_254, ~y$read_delayed_var~0.base=v_~y$read_delayed_var~0.base_7, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_25|, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_131, #valid=|v_#valid_52|, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_193, #memory_int=|v_#memory_int_15|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_84, ~z~0=v_~z~0_66, ~weak$$choice2~0=v_~weak$$choice2~0_115, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_156, ~x~0=v_~x~0_15, ULTIMATE.start_main_~#t847~0.offset=|v_ULTIMATE.start_main_~#t847~0.offset_26|, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_428} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet32, ~y$read_delayed_var~0.offset, ~y$w_buff0_used~0, ULTIMATE.start_main_#t~nondet33, #NULL.offset, ~main$tmp_guard1~0, ULTIMATE.start_main_~#t848~0.offset, ~y$read_delayed~0, ~y$r_buff1_thd1~0, ~a~0, ~y$mem_tmp~0, ~__unbuffered_p0_EAX~0, ~__unbuffered_p1_EAX~0, ~y$w_buff0~0, ~y$r_buff0_thd1~0, ~y$flush_delayed~0, #length, ~y~0, ~__unbuffered_p1_EBX~0, ~__unbuffered_p0_EBX~0, ULTIMATE.start_main_#t~ite39, ULTIMATE.start_main_#t~ite35, ULTIMATE.start_main_#t~ite36, ULTIMATE.start_main_#t~ite38, ULTIMATE.start_main_#t~ite37, ~main$tmp_guard0~0, ULTIMATE.start_main_~#t848~0.base, #NULL.base, ULTIMATE.start_main_#t~ite34, ~y$r_buff1_thd2~0, ~weak$$choice0~0, ULTIMATE.start_main_~#t847~0.base, ~y$w_buff1~0, ~y$read_delayed_var~0.base, ULTIMATE.start_main_#res, ~y$r_buff0_thd0~0, #valid, ~y$r_buff0_thd2~0, #memory_int, ~__unbuffered_cnt~0, ~z~0, ~weak$$choice2~0, ~y$r_buff1_thd0~0, ~x~0, ULTIMATE.start_main_~#t847~0.offset, ~y$w_buff1_used~0] because there is no mapped edge [2019-12-07 14:04:52,009 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [672] [672] L810-1-->L812: Formula: (and (= |v_#valid_27| (store |v_#valid_28| |v_ULTIMATE.start_main_~#t848~0.base_12| 1)) (= 0 |v_ULTIMATE.start_main_~#t848~0.offset_10|) (< |v_#StackHeapBarrier_8| |v_ULTIMATE.start_main_~#t848~0.base_12|) (= (store |v_#length_10| |v_ULTIMATE.start_main_~#t848~0.base_12| 4) |v_#length_9|) (not (= 0 |v_ULTIMATE.start_main_~#t848~0.base_12|)) (= (store |v_#memory_int_10| |v_ULTIMATE.start_main_~#t848~0.base_12| (store (select |v_#memory_int_10| |v_ULTIMATE.start_main_~#t848~0.base_12|) |v_ULTIMATE.start_main_~#t848~0.offset_10| 1)) |v_#memory_int_9|) (= 0 (select |v_#valid_28| |v_ULTIMATE.start_main_~#t848~0.base_12|))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_8|, #valid=|v_#valid_28|, #memory_int=|v_#memory_int_10|, #length=|v_#length_10|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_8|, ULTIMATE.start_main_#t~nondet32=|v_ULTIMATE.start_main_#t~nondet32_4|, #valid=|v_#valid_27|, #memory_int=|v_#memory_int_9|, #length=|v_#length_9|, ULTIMATE.start_main_~#t848~0.base=|v_ULTIMATE.start_main_~#t848~0.base_12|, ULTIMATE.start_main_~#t848~0.offset=|v_ULTIMATE.start_main_~#t848~0.offset_10|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet32, #valid, #memory_int, #length, ULTIMATE.start_main_~#t848~0.base, ULTIMATE.start_main_~#t848~0.offset] because there is no mapped edge [2019-12-07 14:04:52,009 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [678] [678] L5-->L787: Formula: (and (= ~a~0_In1220771343 ~__unbuffered_p1_EBX~0_Out1220771343) (= ~z~0_Out1220771343 1) (not (= P1Thread1of1ForFork1___VERIFIER_assert_~expression_In1220771343 0)) (= ~y$r_buff1_thd2~0_Out1220771343 ~y$r_buff0_thd2~0_In1220771343) (= ~y$r_buff0_thd2~0_Out1220771343 1) (= ~y$r_buff0_thd0~0_In1220771343 ~y$r_buff1_thd0~0_Out1220771343) (= ~z~0_Out1220771343 ~__unbuffered_p1_EAX~0_Out1220771343) (= ~y$r_buff1_thd1~0_Out1220771343 ~y$r_buff0_thd1~0_In1220771343)) InVars {P1Thread1of1ForFork1___VERIFIER_assert_~expression=P1Thread1of1ForFork1___VERIFIER_assert_~expression_In1220771343, ~a~0=~a~0_In1220771343, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In1220771343, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In1220771343, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In1220771343} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_Out1220771343, P1Thread1of1ForFork1___VERIFIER_assert_~expression=P1Thread1of1ForFork1___VERIFIER_assert_~expression_In1220771343, ~a~0=~a~0_In1220771343, ~y$r_buff1_thd1~0=~y$r_buff1_thd1~0_Out1220771343, ~__unbuffered_p1_EBX~0=~__unbuffered_p1_EBX~0_Out1220771343, ~__unbuffered_p1_EAX~0=~__unbuffered_p1_EAX~0_Out1220771343, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In1220771343, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_Out1220771343, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In1220771343, ~z~0=~z~0_Out1220771343, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_Out1220771343} AuxVars[] AssignedVars[~y$r_buff1_thd2~0, ~y$r_buff1_thd1~0, ~__unbuffered_p1_EBX~0, ~__unbuffered_p1_EAX~0, ~y$r_buff0_thd2~0, ~z~0, ~y$r_buff1_thd0~0] because there is no mapped edge [2019-12-07 14:04:52,011 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [642] [642] L788-->L788-2: Formula: (let ((.cse0 (= (mod ~y$w_buff0_used~0_In-806069367 256) 0)) (.cse1 (= (mod ~y$r_buff0_thd2~0_In-806069367 256) 0))) (or (and (= |P1Thread1of1ForFork1_#t~ite28_Out-806069367| ~y$w_buff0_used~0_In-806069367) (or .cse0 .cse1)) (and (= |P1Thread1of1ForFork1_#t~ite28_Out-806069367| 0) (not .cse0) (not .cse1)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-806069367, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-806069367} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-806069367, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-806069367, P1Thread1of1ForFork1_#t~ite28=|P1Thread1of1ForFork1_#t~ite28_Out-806069367|} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite28] because there is no mapped edge [2019-12-07 14:04:52,011 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [646] [646] L789-->L789-2: Formula: (let ((.cse0 (= 0 (mod ~y$w_buff1_used~0_In-324652970 256))) (.cse1 (= 0 (mod ~y$r_buff1_thd2~0_In-324652970 256))) (.cse3 (= (mod ~y$w_buff0_used~0_In-324652970 256) 0)) (.cse2 (= (mod ~y$r_buff0_thd2~0_In-324652970 256) 0))) (or (and (= 0 |P1Thread1of1ForFork1_#t~ite29_Out-324652970|) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse0 .cse1) (or .cse3 .cse2) (= ~y$w_buff1_used~0_In-324652970 |P1Thread1of1ForFork1_#t~ite29_Out-324652970|)))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-324652970, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-324652970, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-324652970, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-324652970} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-324652970, P1Thread1of1ForFork1_#t~ite29=|P1Thread1of1ForFork1_#t~ite29_Out-324652970|, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-324652970, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-324652970, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-324652970} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite29] because there is no mapped edge [2019-12-07 14:04:52,014 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [594] [594] L751-->L752: Formula: (and (= v_~y$r_buff0_thd1~0_84 v_~y$r_buff0_thd1~0_83) (not (= (mod v_~weak$$choice2~0_22 256) 0))) InVars {~y$r_buff0_thd1~0=v_~y$r_buff0_thd1~0_84, ~weak$$choice2~0=v_~weak$$choice2~0_22} OutVars{P0Thread1of1ForFork0_#t~ite21=|v_P0Thread1of1ForFork0_#t~ite21_7|, P0Thread1of1ForFork0_#t~ite20=|v_P0Thread1of1ForFork0_#t~ite20_9|, ~y$r_buff0_thd1~0=v_~y$r_buff0_thd1~0_83, P0Thread1of1ForFork0_#t~ite19=|v_P0Thread1of1ForFork0_#t~ite19_6|, ~weak$$choice2~0=v_~weak$$choice2~0_22} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite21, P0Thread1of1ForFork0_#t~ite20, ~y$r_buff0_thd1~0, P0Thread1of1ForFork0_#t~ite19] because there is no mapped edge [2019-12-07 14:04:52,014 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [679] [679] L752-->L752-8: Formula: (let ((.cse1 (= (mod ~weak$$choice2~0_In-1056035197 256) 0))) (or (and (= |P0Thread1of1ForFork0_#t~ite24_Out-1056035197| |P0Thread1of1ForFork0_#t~ite23_Out-1056035197|) (= ~y$r_buff1_thd1~0_In-1056035197 |P0Thread1of1ForFork0_#t~ite23_Out-1056035197|) (let ((.cse0 (= 0 (mod ~y$r_buff0_thd1~0_In-1056035197 256)))) (or (= 0 (mod ~y$w_buff0_used~0_In-1056035197 256)) (and (= (mod ~y$w_buff1_used~0_In-1056035197 256) 0) .cse0) (and .cse0 (= (mod ~y$r_buff1_thd1~0_In-1056035197 256) 0)))) .cse1) (and (= |P0Thread1of1ForFork0_#t~ite23_In-1056035197| |P0Thread1of1ForFork0_#t~ite23_Out-1056035197|) (= ~y$r_buff1_thd1~0_In-1056035197 |P0Thread1of1ForFork0_#t~ite24_Out-1056035197|) (not .cse1)))) InVars {~y$r_buff1_thd1~0=~y$r_buff1_thd1~0_In-1056035197, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-1056035197, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In-1056035197, ~weak$$choice2~0=~weak$$choice2~0_In-1056035197, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1056035197, P0Thread1of1ForFork0_#t~ite23=|P0Thread1of1ForFork0_#t~ite23_In-1056035197|} OutVars{~y$r_buff1_thd1~0=~y$r_buff1_thd1~0_In-1056035197, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-1056035197, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In-1056035197, ~weak$$choice2~0=~weak$$choice2~0_In-1056035197, P0Thread1of1ForFork0_#t~ite24=|P0Thread1of1ForFork0_#t~ite24_Out-1056035197|, P0Thread1of1ForFork0_#t~ite23=|P0Thread1of1ForFork0_#t~ite23_Out-1056035197|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1056035197} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite24, P0Thread1of1ForFork0_#t~ite23] because there is no mapped edge [2019-12-07 14:04:52,014 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [627] [627] L754-->L762: Formula: (and (= 0 v_~y$flush_delayed~0_15) (= v_~y~0_40 v_~y$mem_tmp~0_4) (= v_~__unbuffered_cnt~0_31 (+ v_~__unbuffered_cnt~0_32 1)) (not (= 0 (mod v_~y$flush_delayed~0_16 256)))) InVars {~y$mem_tmp~0=v_~y$mem_tmp~0_4, ~y$flush_delayed~0=v_~y$flush_delayed~0_16, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_32} OutVars{P0Thread1of1ForFork0_#t~ite25=|v_P0Thread1of1ForFork0_#t~ite25_21|, ~y$mem_tmp~0=v_~y$mem_tmp~0_4, ~y$flush_delayed~0=v_~y$flush_delayed~0_15, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_31, ~y~0=v_~y~0_40} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite25, ~y$flush_delayed~0, ~__unbuffered_cnt~0, ~y~0] because there is no mapped edge [2019-12-07 14:04:52,014 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [645] [645] L790-->L791: Formula: (let ((.cse0 (= (mod ~y$w_buff0_used~0_In1591900004 256) 0)) (.cse2 (= 0 (mod ~y$r_buff0_thd2~0_In1591900004 256))) (.cse1 (= ~y$r_buff0_thd2~0_In1591900004 ~y$r_buff0_thd2~0_Out1591900004))) (or (and .cse0 .cse1) (and (not .cse0) (not .cse2) (= 0 ~y$r_buff0_thd2~0_Out1591900004)) (and .cse2 .cse1))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In1591900004, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In1591900004} OutVars{P1Thread1of1ForFork1_#t~ite30=|P1Thread1of1ForFork1_#t~ite30_Out1591900004|, ~y$w_buff0_used~0=~y$w_buff0_used~0_In1591900004, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_Out1591900004} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite30, ~y$r_buff0_thd2~0] because there is no mapped edge [2019-12-07 14:04:52,014 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [647] [647] L791-->L791-2: Formula: (let ((.cse3 (= 0 (mod ~y$w_buff1_used~0_In1331417476 256))) (.cse2 (= 0 (mod ~y$r_buff1_thd2~0_In1331417476 256))) (.cse1 (= 0 (mod ~y$w_buff0_used~0_In1331417476 256))) (.cse0 (= (mod ~y$r_buff0_thd2~0_In1331417476 256) 0))) (or (and (or .cse0 .cse1) (or .cse2 .cse3) (= ~y$r_buff1_thd2~0_In1331417476 |P1Thread1of1ForFork1_#t~ite31_Out1331417476|)) (and (= 0 |P1Thread1of1ForFork1_#t~ite31_Out1331417476|) (or (and (not .cse3) (not .cse2)) (and (not .cse1) (not .cse0)))))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In1331417476, ~y$w_buff0_used~0=~y$w_buff0_used~0_In1331417476, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In1331417476, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1331417476} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In1331417476, ~y$w_buff0_used~0=~y$w_buff0_used~0_In1331417476, P1Thread1of1ForFork1_#t~ite31=|P1Thread1of1ForFork1_#t~ite31_Out1331417476|, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In1331417476, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1331417476} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite31] because there is no mapped edge [2019-12-07 14:04:52,015 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [664] [664] L791-2-->P1EXIT: Formula: (and (= |v_P1Thread1of1ForFork1_#t~ite31_28| v_~y$r_buff1_thd2~0_59) (= (+ v_~__unbuffered_cnt~0_57 1) v_~__unbuffered_cnt~0_56) (= 0 |v_P1Thread1of1ForFork1_#res.base_3|) (= |v_P1Thread1of1ForFork1_#res.offset_3| 0)) InVars {P1Thread1of1ForFork1_#t~ite31=|v_P1Thread1of1ForFork1_#t~ite31_28|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_57} OutVars{~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_59, P1Thread1of1ForFork1_#res.offset=|v_P1Thread1of1ForFork1_#res.offset_3|, P1Thread1of1ForFork1_#t~ite31=|v_P1Thread1of1ForFork1_#t~ite31_27|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_56, P1Thread1of1ForFork1_#res.base=|v_P1Thread1of1ForFork1_#res.base_3|} AuxVars[] AssignedVars[~y$r_buff1_thd2~0, P1Thread1of1ForFork1_#res.offset, P1Thread1of1ForFork1_#t~ite31, ~__unbuffered_cnt~0, P1Thread1of1ForFork1_#res.base] because there is no mapped edge [2019-12-07 14:04:52,015 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [589] [589] L812-1-->L818: Formula: (and (not (= 0 (mod v_~main$tmp_guard0~0_6 256))) (= v_~main$tmp_guard0~0_6 (ite (= (ite (= 2 v_~__unbuffered_cnt~0_15) 1 0) 0) 0 1))) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_15} OutVars{ULTIMATE.start_main_#t~nondet33=|v_ULTIMATE.start_main_#t~nondet33_5|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_15, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_6} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet33, ~main$tmp_guard0~0] because there is no mapped edge [2019-12-07 14:04:52,015 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [644] [644] L818-2-->L818-4: Formula: (let ((.cse0 (= (mod ~y$r_buff1_thd0~0_In-487598496 256) 0)) (.cse1 (= (mod ~y$w_buff1_used~0_In-487598496 256) 0))) (or (and (not .cse0) (= ~y$w_buff1~0_In-487598496 |ULTIMATE.start_main_#t~ite34_Out-487598496|) (not .cse1)) (and (or .cse0 .cse1) (= ~y~0_In-487598496 |ULTIMATE.start_main_#t~ite34_Out-487598496|)))) InVars {~y$w_buff1~0=~y$w_buff1~0_In-487598496, ~y~0=~y~0_In-487598496, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-487598496, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-487598496} OutVars{~y$w_buff1~0=~y$w_buff1~0_In-487598496, ~y~0=~y~0_In-487598496, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-487598496, ULTIMATE.start_main_#t~ite34=|ULTIMATE.start_main_#t~ite34_Out-487598496|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-487598496} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite34] because there is no mapped edge [2019-12-07 14:04:52,015 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [612] [612] L818-4-->L819: Formula: (= v_~y~0_31 |v_ULTIMATE.start_main_#t~ite34_12|) InVars {ULTIMATE.start_main_#t~ite34=|v_ULTIMATE.start_main_#t~ite34_12|} OutVars{ULTIMATE.start_main_#t~ite35=|v_ULTIMATE.start_main_#t~ite35_13|, ~y~0=v_~y~0_31, ULTIMATE.start_main_#t~ite34=|v_ULTIMATE.start_main_#t~ite34_11|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite35, ~y~0, ULTIMATE.start_main_#t~ite34] because there is no mapped edge [2019-12-07 14:04:52,015 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [636] [636] L819-->L819-2: Formula: (let ((.cse0 (= 0 (mod ~y$w_buff0_used~0_In454246022 256))) (.cse1 (= 0 (mod ~y$r_buff0_thd0~0_In454246022 256)))) (or (and (= 0 |ULTIMATE.start_main_#t~ite36_Out454246022|) (not .cse0) (not .cse1)) (and (= ~y$w_buff0_used~0_In454246022 |ULTIMATE.start_main_#t~ite36_Out454246022|) (or .cse0 .cse1)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In454246022, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In454246022} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In454246022, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In454246022, ULTIMATE.start_main_#t~ite36=|ULTIMATE.start_main_#t~ite36_Out454246022|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite36] because there is no mapped edge [2019-12-07 14:04:52,015 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [637] [637] L820-->L820-2: Formula: (let ((.cse2 (= 0 (mod ~y$w_buff1_used~0_In225825537 256))) (.cse3 (= 0 (mod ~y$r_buff1_thd0~0_In225825537 256))) (.cse1 (= 0 (mod ~y$w_buff0_used~0_In225825537 256))) (.cse0 (= 0 (mod ~y$r_buff0_thd0~0_In225825537 256)))) (or (and (= |ULTIMATE.start_main_#t~ite37_Out225825537| 0) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse2 .cse3) (or .cse1 .cse0) (= ~y$w_buff1_used~0_In225825537 |ULTIMATE.start_main_#t~ite37_Out225825537|)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In225825537, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In225825537, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In225825537, ~y$w_buff1_used~0=~y$w_buff1_used~0_In225825537} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In225825537, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In225825537, ULTIMATE.start_main_#t~ite37=|ULTIMATE.start_main_#t~ite37_Out225825537|, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In225825537, ~y$w_buff1_used~0=~y$w_buff1_used~0_In225825537} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite37] because there is no mapped edge [2019-12-07 14:04:52,016 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [649] [649] L821-->L821-2: Formula: (let ((.cse0 (= 0 (mod ~y$w_buff0_used~0_In926429083 256))) (.cse1 (= (mod ~y$r_buff0_thd0~0_In926429083 256) 0))) (or (and (or .cse0 .cse1) (= ~y$r_buff0_thd0~0_In926429083 |ULTIMATE.start_main_#t~ite38_Out926429083|)) (and (not .cse0) (= 0 |ULTIMATE.start_main_#t~ite38_Out926429083|) (not .cse1)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In926429083, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In926429083} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In926429083, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In926429083, ULTIMATE.start_main_#t~ite38=|ULTIMATE.start_main_#t~ite38_Out926429083|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite38] because there is no mapped edge [2019-12-07 14:04:52,016 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [648] [648] L822-->L822-2: Formula: (let ((.cse1 (= (mod ~y$w_buff1_used~0_In110888111 256) 0)) (.cse0 (= (mod ~y$r_buff1_thd0~0_In110888111 256) 0)) (.cse2 (= (mod ~y$w_buff0_used~0_In110888111 256) 0)) (.cse3 (= 0 (mod ~y$r_buff0_thd0~0_In110888111 256)))) (or (and (or .cse0 .cse1) (or .cse2 .cse3) (= |ULTIMATE.start_main_#t~ite39_Out110888111| ~y$r_buff1_thd0~0_In110888111)) (and (or (and (not .cse1) (not .cse0)) (and (not .cse2) (not .cse3))) (= |ULTIMATE.start_main_#t~ite39_Out110888111| 0)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In110888111, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In110888111, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In110888111, ~y$w_buff1_used~0=~y$w_buff1_used~0_In110888111} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In110888111, ULTIMATE.start_main_#t~ite39=|ULTIMATE.start_main_#t~ite39_Out110888111|, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In110888111, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In110888111, ~y$w_buff1_used~0=~y$w_buff1_used~0_In110888111} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite39] because there is no mapped edge [2019-12-07 14:04:52,016 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [685] [685] L822-2-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= v_ULTIMATE.start___VERIFIER_assert_~expression_21 |v_ULTIMATE.start___VERIFIER_assert_#in~expression_15|) (= (mod v_~main$tmp_guard1~0_19 256) |v_ULTIMATE.start___VERIFIER_assert_#in~expression_15|) (= v_ULTIMATE.start___VERIFIER_assert_~expression_21 0) (= v_~main$tmp_guard1~0_19 (ite (= 0 (ite (not (and (= v_~__unbuffered_p1_EBX~0_67 0) (= 1 v_~__unbuffered_p1_EAX~0_67) (= v_~__unbuffered_p0_EBX~0_37 0) (= 1 v_~__unbuffered_p0_EAX~0_21))) 1 0)) 0 1)) (= v_~y$r_buff1_thd0~0_123 |v_ULTIMATE.start_main_#t~ite39_42|)) InVars {~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_21, ~__unbuffered_p0_EBX~0=v_~__unbuffered_p0_EBX~0_37, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_67, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_67, ULTIMATE.start_main_#t~ite39=|v_ULTIMATE.start_main_#t~ite39_42|} OutVars{~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_21, ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_21, ~__unbuffered_p0_EBX~0=v_~__unbuffered_p0_EBX~0_37, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_67, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_67, ULTIMATE.start_main_#t~ite39=|v_ULTIMATE.start_main_#t~ite39_41|, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_19, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_123, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_15|} AuxVars[] AssignedVars[ULTIMATE.start___VERIFIER_assert_~expression, ULTIMATE.start_main_#t~ite39, ~main$tmp_guard1~0, ~y$r_buff1_thd0~0, ULTIMATE.start___VERIFIER_assert_#in~expression] because there is no mapped edge [2019-12-07 14:04:52,069 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 07.12 02:04:52 BasicIcfg [2019-12-07 14:04:52,069 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-07 14:04:52,070 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-12-07 14:04:52,070 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-12-07 14:04:52,070 INFO L275 PluginConnector]: Witness Printer initialized [2019-12-07 14:04:52,071 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 02:04:44" (3/4) ... [2019-12-07 14:04:52,073 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2019-12-07 14:04:52,073 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [696] [696] ULTIMATE.startENTRY-->L810: Formula: (let ((.cse0 (store |v_#valid_54| 0 0))) (and (= v_~__unbuffered_p1_EBX~0_96 0) (= 0 v_~y$read_delayed_var~0.offset_7) (= v_~y$r_buff0_thd1~0_280 0) (= v_~y$mem_tmp~0_16 0) (= 0 v_~weak$$choice0~0_14) (= v_~z~0_66 0) (= v_~y$read_delayed~0_7 0) (= v_~y$w_buff0_used~0_614 0) (= |v_#NULL.offset_3| 0) (= 0 v_~y$flush_delayed~0_46) (< |v_#StackHeapBarrier_14| |v_ULTIMATE.start_main_~#t847~0.base_37|) (= v_~x~0_15 0) (= |v_#valid_52| (store .cse0 |v_ULTIMATE.start_main_~#t847~0.base_37| 1)) (= v_~y$r_buff1_thd0~0_156 0) (= v_~y$w_buff1_used~0_428 0) (= |v_#length_15| (store |v_#length_16| |v_ULTIMATE.start_main_~#t847~0.base_37| 4)) (= 0 v_~y$r_buff1_thd2~0_121) (= 0 v_~y$w_buff0~0_385) (= 0 v_~__unbuffered_p0_EAX~0_43) (= v_~main$tmp_guard1~0_39 0) (= v_~y~0_143 0) (= v_~a~0_73 0) (< 0 |v_#StackHeapBarrier_14|) (= v_~__unbuffered_p0_EBX~0_65 0) (= (select .cse0 |v_ULTIMATE.start_main_~#t847~0.base_37|) 0) (= 0 v_~y$read_delayed_var~0.base_7) (= v_~main$tmp_guard0~0_21 0) (= 0 v_~y$r_buff0_thd2~0_193) (= v_~y$w_buff1~0_254 0) (= 0 |v_#NULL.base_3|) (= 0 |v_ULTIMATE.start_main_~#t847~0.offset_26|) (= v_~weak$$choice2~0_115 0) (= v_~y$r_buff1_thd1~0_232 0) (= 0 v_~__unbuffered_p1_EAX~0_96) (= v_~y$r_buff0_thd0~0_131 0) (= 0 v_~__unbuffered_cnt~0_84) (= (store |v_#memory_int_16| |v_ULTIMATE.start_main_~#t847~0.base_37| (store (select |v_#memory_int_16| |v_ULTIMATE.start_main_~#t847~0.base_37|) |v_ULTIMATE.start_main_~#t847~0.offset_26| 0)) |v_#memory_int_15|))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_14|, #valid=|v_#valid_54|, #memory_int=|v_#memory_int_16|, #length=|v_#length_16|} OutVars{ULTIMATE.start_main_#t~nondet32=|v_ULTIMATE.start_main_#t~nondet32_9|, ~y$read_delayed_var~0.offset=v_~y$read_delayed_var~0.offset_7, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_614, ULTIMATE.start_main_#t~nondet33=|v_ULTIMATE.start_main_#t~nondet33_19|, #NULL.offset=|v_#NULL.offset_3|, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_39, ULTIMATE.start_main_~#t848~0.offset=|v_ULTIMATE.start_main_~#t848~0.offset_18|, ~y$read_delayed~0=v_~y$read_delayed~0_7, ~y$r_buff1_thd1~0=v_~y$r_buff1_thd1~0_232, ~a~0=v_~a~0_73, ~y$mem_tmp~0=v_~y$mem_tmp~0_16, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_43, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_96, ~y$w_buff0~0=v_~y$w_buff0~0_385, ~y$r_buff0_thd1~0=v_~y$r_buff0_thd1~0_280, ~y$flush_delayed~0=v_~y$flush_delayed~0_46, #length=|v_#length_15|, ~y~0=v_~y~0_143, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_96, ~__unbuffered_p0_EBX~0=v_~__unbuffered_p0_EBX~0_65, ULTIMATE.start_main_#t~ite39=|v_ULTIMATE.start_main_#t~ite39_77|, ULTIMATE.start_main_#t~ite35=|v_ULTIMATE.start_main_#t~ite35_29|, ULTIMATE.start_main_#t~ite36=|v_ULTIMATE.start_main_#t~ite36_99|, ULTIMATE.start_main_#t~ite38=|v_ULTIMATE.start_main_#t~ite38_37|, ULTIMATE.start_main_#t~ite37=|v_ULTIMATE.start_main_#t~ite37_51|, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_21, ULTIMATE.start_main_~#t848~0.base=|v_ULTIMATE.start_main_~#t848~0.base_23|, #NULL.base=|v_#NULL.base_3|, ULTIMATE.start_main_#t~ite34=|v_ULTIMATE.start_main_#t~ite34_59|, ~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_121, ~weak$$choice0~0=v_~weak$$choice0~0_14, #StackHeapBarrier=|v_#StackHeapBarrier_14|, ULTIMATE.start_main_~#t847~0.base=|v_ULTIMATE.start_main_~#t847~0.base_37|, ~y$w_buff1~0=v_~y$w_buff1~0_254, ~y$read_delayed_var~0.base=v_~y$read_delayed_var~0.base_7, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_25|, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_131, #valid=|v_#valid_52|, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_193, #memory_int=|v_#memory_int_15|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_84, ~z~0=v_~z~0_66, ~weak$$choice2~0=v_~weak$$choice2~0_115, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_156, ~x~0=v_~x~0_15, ULTIMATE.start_main_~#t847~0.offset=|v_ULTIMATE.start_main_~#t847~0.offset_26|, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_428} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet32, ~y$read_delayed_var~0.offset, ~y$w_buff0_used~0, ULTIMATE.start_main_#t~nondet33, #NULL.offset, ~main$tmp_guard1~0, ULTIMATE.start_main_~#t848~0.offset, ~y$read_delayed~0, ~y$r_buff1_thd1~0, ~a~0, ~y$mem_tmp~0, ~__unbuffered_p0_EAX~0, ~__unbuffered_p1_EAX~0, ~y$w_buff0~0, ~y$r_buff0_thd1~0, ~y$flush_delayed~0, #length, ~y~0, ~__unbuffered_p1_EBX~0, ~__unbuffered_p0_EBX~0, ULTIMATE.start_main_#t~ite39, ULTIMATE.start_main_#t~ite35, ULTIMATE.start_main_#t~ite36, ULTIMATE.start_main_#t~ite38, ULTIMATE.start_main_#t~ite37, ~main$tmp_guard0~0, ULTIMATE.start_main_~#t848~0.base, #NULL.base, ULTIMATE.start_main_#t~ite34, ~y$r_buff1_thd2~0, ~weak$$choice0~0, ULTIMATE.start_main_~#t847~0.base, ~y$w_buff1~0, ~y$read_delayed_var~0.base, ULTIMATE.start_main_#res, ~y$r_buff0_thd0~0, #valid, ~y$r_buff0_thd2~0, #memory_int, ~__unbuffered_cnt~0, ~z~0, ~weak$$choice2~0, ~y$r_buff1_thd0~0, ~x~0, ULTIMATE.start_main_~#t847~0.offset, ~y$w_buff1_used~0] because there is no mapped edge [2019-12-07 14:04:52,073 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [672] [672] L810-1-->L812: Formula: (and (= |v_#valid_27| (store |v_#valid_28| |v_ULTIMATE.start_main_~#t848~0.base_12| 1)) (= 0 |v_ULTIMATE.start_main_~#t848~0.offset_10|) (< |v_#StackHeapBarrier_8| |v_ULTIMATE.start_main_~#t848~0.base_12|) (= (store |v_#length_10| |v_ULTIMATE.start_main_~#t848~0.base_12| 4) |v_#length_9|) (not (= 0 |v_ULTIMATE.start_main_~#t848~0.base_12|)) (= (store |v_#memory_int_10| |v_ULTIMATE.start_main_~#t848~0.base_12| (store (select |v_#memory_int_10| |v_ULTIMATE.start_main_~#t848~0.base_12|) |v_ULTIMATE.start_main_~#t848~0.offset_10| 1)) |v_#memory_int_9|) (= 0 (select |v_#valid_28| |v_ULTIMATE.start_main_~#t848~0.base_12|))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_8|, #valid=|v_#valid_28|, #memory_int=|v_#memory_int_10|, #length=|v_#length_10|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_8|, ULTIMATE.start_main_#t~nondet32=|v_ULTIMATE.start_main_#t~nondet32_4|, #valid=|v_#valid_27|, #memory_int=|v_#memory_int_9|, #length=|v_#length_9|, ULTIMATE.start_main_~#t848~0.base=|v_ULTIMATE.start_main_~#t848~0.base_12|, ULTIMATE.start_main_~#t848~0.offset=|v_ULTIMATE.start_main_~#t848~0.offset_10|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet32, #valid, #memory_int, #length, ULTIMATE.start_main_~#t848~0.base, ULTIMATE.start_main_~#t848~0.offset] because there is no mapped edge [2019-12-07 14:04:52,074 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [678] [678] L5-->L787: Formula: (and (= ~a~0_In1220771343 ~__unbuffered_p1_EBX~0_Out1220771343) (= ~z~0_Out1220771343 1) (not (= P1Thread1of1ForFork1___VERIFIER_assert_~expression_In1220771343 0)) (= ~y$r_buff1_thd2~0_Out1220771343 ~y$r_buff0_thd2~0_In1220771343) (= ~y$r_buff0_thd2~0_Out1220771343 1) (= ~y$r_buff0_thd0~0_In1220771343 ~y$r_buff1_thd0~0_Out1220771343) (= ~z~0_Out1220771343 ~__unbuffered_p1_EAX~0_Out1220771343) (= ~y$r_buff1_thd1~0_Out1220771343 ~y$r_buff0_thd1~0_In1220771343)) InVars {P1Thread1of1ForFork1___VERIFIER_assert_~expression=P1Thread1of1ForFork1___VERIFIER_assert_~expression_In1220771343, ~a~0=~a~0_In1220771343, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In1220771343, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In1220771343, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In1220771343} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_Out1220771343, P1Thread1of1ForFork1___VERIFIER_assert_~expression=P1Thread1of1ForFork1___VERIFIER_assert_~expression_In1220771343, ~a~0=~a~0_In1220771343, ~y$r_buff1_thd1~0=~y$r_buff1_thd1~0_Out1220771343, ~__unbuffered_p1_EBX~0=~__unbuffered_p1_EBX~0_Out1220771343, ~__unbuffered_p1_EAX~0=~__unbuffered_p1_EAX~0_Out1220771343, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In1220771343, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_Out1220771343, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In1220771343, ~z~0=~z~0_Out1220771343, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_Out1220771343} AuxVars[] AssignedVars[~y$r_buff1_thd2~0, ~y$r_buff1_thd1~0, ~__unbuffered_p1_EBX~0, ~__unbuffered_p1_EAX~0, ~y$r_buff0_thd2~0, ~z~0, ~y$r_buff1_thd0~0] because there is no mapped edge [2019-12-07 14:04:52,075 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [642] [642] L788-->L788-2: Formula: (let ((.cse0 (= (mod ~y$w_buff0_used~0_In-806069367 256) 0)) (.cse1 (= (mod ~y$r_buff0_thd2~0_In-806069367 256) 0))) (or (and (= |P1Thread1of1ForFork1_#t~ite28_Out-806069367| ~y$w_buff0_used~0_In-806069367) (or .cse0 .cse1)) (and (= |P1Thread1of1ForFork1_#t~ite28_Out-806069367| 0) (not .cse0) (not .cse1)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-806069367, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-806069367} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-806069367, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-806069367, P1Thread1of1ForFork1_#t~ite28=|P1Thread1of1ForFork1_#t~ite28_Out-806069367|} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite28] because there is no mapped edge [2019-12-07 14:04:52,076 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [646] [646] L789-->L789-2: Formula: (let ((.cse0 (= 0 (mod ~y$w_buff1_used~0_In-324652970 256))) (.cse1 (= 0 (mod ~y$r_buff1_thd2~0_In-324652970 256))) (.cse3 (= (mod ~y$w_buff0_used~0_In-324652970 256) 0)) (.cse2 (= (mod ~y$r_buff0_thd2~0_In-324652970 256) 0))) (or (and (= 0 |P1Thread1of1ForFork1_#t~ite29_Out-324652970|) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse0 .cse1) (or .cse3 .cse2) (= ~y$w_buff1_used~0_In-324652970 |P1Thread1of1ForFork1_#t~ite29_Out-324652970|)))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-324652970, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-324652970, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-324652970, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-324652970} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-324652970, P1Thread1of1ForFork1_#t~ite29=|P1Thread1of1ForFork1_#t~ite29_Out-324652970|, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-324652970, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-324652970, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-324652970} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite29] because there is no mapped edge [2019-12-07 14:04:52,101 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [594] [594] L751-->L752: Formula: (and (= v_~y$r_buff0_thd1~0_84 v_~y$r_buff0_thd1~0_83) (not (= (mod v_~weak$$choice2~0_22 256) 0))) InVars {~y$r_buff0_thd1~0=v_~y$r_buff0_thd1~0_84, ~weak$$choice2~0=v_~weak$$choice2~0_22} OutVars{P0Thread1of1ForFork0_#t~ite21=|v_P0Thread1of1ForFork0_#t~ite21_7|, P0Thread1of1ForFork0_#t~ite20=|v_P0Thread1of1ForFork0_#t~ite20_9|, ~y$r_buff0_thd1~0=v_~y$r_buff0_thd1~0_83, P0Thread1of1ForFork0_#t~ite19=|v_P0Thread1of1ForFork0_#t~ite19_6|, ~weak$$choice2~0=v_~weak$$choice2~0_22} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite21, P0Thread1of1ForFork0_#t~ite20, ~y$r_buff0_thd1~0, P0Thread1of1ForFork0_#t~ite19] because there is no mapped edge [2019-12-07 14:04:52,102 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [679] [679] L752-->L752-8: Formula: (let ((.cse1 (= (mod ~weak$$choice2~0_In-1056035197 256) 0))) (or (and (= |P0Thread1of1ForFork0_#t~ite24_Out-1056035197| |P0Thread1of1ForFork0_#t~ite23_Out-1056035197|) (= ~y$r_buff1_thd1~0_In-1056035197 |P0Thread1of1ForFork0_#t~ite23_Out-1056035197|) (let ((.cse0 (= 0 (mod ~y$r_buff0_thd1~0_In-1056035197 256)))) (or (= 0 (mod ~y$w_buff0_used~0_In-1056035197 256)) (and (= (mod ~y$w_buff1_used~0_In-1056035197 256) 0) .cse0) (and .cse0 (= (mod ~y$r_buff1_thd1~0_In-1056035197 256) 0)))) .cse1) (and (= |P0Thread1of1ForFork0_#t~ite23_In-1056035197| |P0Thread1of1ForFork0_#t~ite23_Out-1056035197|) (= ~y$r_buff1_thd1~0_In-1056035197 |P0Thread1of1ForFork0_#t~ite24_Out-1056035197|) (not .cse1)))) InVars {~y$r_buff1_thd1~0=~y$r_buff1_thd1~0_In-1056035197, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-1056035197, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In-1056035197, ~weak$$choice2~0=~weak$$choice2~0_In-1056035197, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1056035197, P0Thread1of1ForFork0_#t~ite23=|P0Thread1of1ForFork0_#t~ite23_In-1056035197|} OutVars{~y$r_buff1_thd1~0=~y$r_buff1_thd1~0_In-1056035197, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-1056035197, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In-1056035197, ~weak$$choice2~0=~weak$$choice2~0_In-1056035197, P0Thread1of1ForFork0_#t~ite24=|P0Thread1of1ForFork0_#t~ite24_Out-1056035197|, P0Thread1of1ForFork0_#t~ite23=|P0Thread1of1ForFork0_#t~ite23_Out-1056035197|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1056035197} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite24, P0Thread1of1ForFork0_#t~ite23] because there is no mapped edge [2019-12-07 14:04:52,102 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [627] [627] L754-->L762: Formula: (and (= 0 v_~y$flush_delayed~0_15) (= v_~y~0_40 v_~y$mem_tmp~0_4) (= v_~__unbuffered_cnt~0_31 (+ v_~__unbuffered_cnt~0_32 1)) (not (= 0 (mod v_~y$flush_delayed~0_16 256)))) InVars {~y$mem_tmp~0=v_~y$mem_tmp~0_4, ~y$flush_delayed~0=v_~y$flush_delayed~0_16, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_32} OutVars{P0Thread1of1ForFork0_#t~ite25=|v_P0Thread1of1ForFork0_#t~ite25_21|, ~y$mem_tmp~0=v_~y$mem_tmp~0_4, ~y$flush_delayed~0=v_~y$flush_delayed~0_15, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_31, ~y~0=v_~y~0_40} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite25, ~y$flush_delayed~0, ~__unbuffered_cnt~0, ~y~0] because there is no mapped edge [2019-12-07 14:04:52,102 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [645] [645] L790-->L791: Formula: (let ((.cse0 (= (mod ~y$w_buff0_used~0_In1591900004 256) 0)) (.cse2 (= 0 (mod ~y$r_buff0_thd2~0_In1591900004 256))) (.cse1 (= ~y$r_buff0_thd2~0_In1591900004 ~y$r_buff0_thd2~0_Out1591900004))) (or (and .cse0 .cse1) (and (not .cse0) (not .cse2) (= 0 ~y$r_buff0_thd2~0_Out1591900004)) (and .cse2 .cse1))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In1591900004, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In1591900004} OutVars{P1Thread1of1ForFork1_#t~ite30=|P1Thread1of1ForFork1_#t~ite30_Out1591900004|, ~y$w_buff0_used~0=~y$w_buff0_used~0_In1591900004, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_Out1591900004} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite30, ~y$r_buff0_thd2~0] because there is no mapped edge [2019-12-07 14:04:52,103 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [647] [647] L791-->L791-2: Formula: (let ((.cse3 (= 0 (mod ~y$w_buff1_used~0_In1331417476 256))) (.cse2 (= 0 (mod ~y$r_buff1_thd2~0_In1331417476 256))) (.cse1 (= 0 (mod ~y$w_buff0_used~0_In1331417476 256))) (.cse0 (= (mod ~y$r_buff0_thd2~0_In1331417476 256) 0))) (or (and (or .cse0 .cse1) (or .cse2 .cse3) (= ~y$r_buff1_thd2~0_In1331417476 |P1Thread1of1ForFork1_#t~ite31_Out1331417476|)) (and (= 0 |P1Thread1of1ForFork1_#t~ite31_Out1331417476|) (or (and (not .cse3) (not .cse2)) (and (not .cse1) (not .cse0)))))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In1331417476, ~y$w_buff0_used~0=~y$w_buff0_used~0_In1331417476, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In1331417476, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1331417476} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In1331417476, ~y$w_buff0_used~0=~y$w_buff0_used~0_In1331417476, P1Thread1of1ForFork1_#t~ite31=|P1Thread1of1ForFork1_#t~ite31_Out1331417476|, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In1331417476, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1331417476} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite31] because there is no mapped edge [2019-12-07 14:04:52,103 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [664] [664] L791-2-->P1EXIT: Formula: (and (= |v_P1Thread1of1ForFork1_#t~ite31_28| v_~y$r_buff1_thd2~0_59) (= (+ v_~__unbuffered_cnt~0_57 1) v_~__unbuffered_cnt~0_56) (= 0 |v_P1Thread1of1ForFork1_#res.base_3|) (= |v_P1Thread1of1ForFork1_#res.offset_3| 0)) InVars {P1Thread1of1ForFork1_#t~ite31=|v_P1Thread1of1ForFork1_#t~ite31_28|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_57} OutVars{~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_59, P1Thread1of1ForFork1_#res.offset=|v_P1Thread1of1ForFork1_#res.offset_3|, P1Thread1of1ForFork1_#t~ite31=|v_P1Thread1of1ForFork1_#t~ite31_27|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_56, P1Thread1of1ForFork1_#res.base=|v_P1Thread1of1ForFork1_#res.base_3|} AuxVars[] AssignedVars[~y$r_buff1_thd2~0, P1Thread1of1ForFork1_#res.offset, P1Thread1of1ForFork1_#t~ite31, ~__unbuffered_cnt~0, P1Thread1of1ForFork1_#res.base] because there is no mapped edge [2019-12-07 14:04:52,103 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [589] [589] L812-1-->L818: Formula: (and (not (= 0 (mod v_~main$tmp_guard0~0_6 256))) (= v_~main$tmp_guard0~0_6 (ite (= (ite (= 2 v_~__unbuffered_cnt~0_15) 1 0) 0) 0 1))) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_15} OutVars{ULTIMATE.start_main_#t~nondet33=|v_ULTIMATE.start_main_#t~nondet33_5|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_15, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_6} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet33, ~main$tmp_guard0~0] because there is no mapped edge [2019-12-07 14:04:52,103 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [644] [644] L818-2-->L818-4: Formula: (let ((.cse0 (= (mod ~y$r_buff1_thd0~0_In-487598496 256) 0)) (.cse1 (= (mod ~y$w_buff1_used~0_In-487598496 256) 0))) (or (and (not .cse0) (= ~y$w_buff1~0_In-487598496 |ULTIMATE.start_main_#t~ite34_Out-487598496|) (not .cse1)) (and (or .cse0 .cse1) (= ~y~0_In-487598496 |ULTIMATE.start_main_#t~ite34_Out-487598496|)))) InVars {~y$w_buff1~0=~y$w_buff1~0_In-487598496, ~y~0=~y~0_In-487598496, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-487598496, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-487598496} OutVars{~y$w_buff1~0=~y$w_buff1~0_In-487598496, ~y~0=~y~0_In-487598496, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-487598496, ULTIMATE.start_main_#t~ite34=|ULTIMATE.start_main_#t~ite34_Out-487598496|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-487598496} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite34] because there is no mapped edge [2019-12-07 14:04:52,103 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [612] [612] L818-4-->L819: Formula: (= v_~y~0_31 |v_ULTIMATE.start_main_#t~ite34_12|) InVars {ULTIMATE.start_main_#t~ite34=|v_ULTIMATE.start_main_#t~ite34_12|} OutVars{ULTIMATE.start_main_#t~ite35=|v_ULTIMATE.start_main_#t~ite35_13|, ~y~0=v_~y~0_31, ULTIMATE.start_main_#t~ite34=|v_ULTIMATE.start_main_#t~ite34_11|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite35, ~y~0, ULTIMATE.start_main_#t~ite34] because there is no mapped edge [2019-12-07 14:04:52,103 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [636] [636] L819-->L819-2: Formula: (let ((.cse0 (= 0 (mod ~y$w_buff0_used~0_In454246022 256))) (.cse1 (= 0 (mod ~y$r_buff0_thd0~0_In454246022 256)))) (or (and (= 0 |ULTIMATE.start_main_#t~ite36_Out454246022|) (not .cse0) (not .cse1)) (and (= ~y$w_buff0_used~0_In454246022 |ULTIMATE.start_main_#t~ite36_Out454246022|) (or .cse0 .cse1)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In454246022, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In454246022} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In454246022, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In454246022, ULTIMATE.start_main_#t~ite36=|ULTIMATE.start_main_#t~ite36_Out454246022|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite36] because there is no mapped edge [2019-12-07 14:04:52,103 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [637] [637] L820-->L820-2: Formula: (let ((.cse2 (= 0 (mod ~y$w_buff1_used~0_In225825537 256))) (.cse3 (= 0 (mod ~y$r_buff1_thd0~0_In225825537 256))) (.cse1 (= 0 (mod ~y$w_buff0_used~0_In225825537 256))) (.cse0 (= 0 (mod ~y$r_buff0_thd0~0_In225825537 256)))) (or (and (= |ULTIMATE.start_main_#t~ite37_Out225825537| 0) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse2 .cse3) (or .cse1 .cse0) (= ~y$w_buff1_used~0_In225825537 |ULTIMATE.start_main_#t~ite37_Out225825537|)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In225825537, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In225825537, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In225825537, ~y$w_buff1_used~0=~y$w_buff1_used~0_In225825537} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In225825537, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In225825537, ULTIMATE.start_main_#t~ite37=|ULTIMATE.start_main_#t~ite37_Out225825537|, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In225825537, ~y$w_buff1_used~0=~y$w_buff1_used~0_In225825537} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite37] because there is no mapped edge [2019-12-07 14:04:52,104 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [649] [649] L821-->L821-2: Formula: (let ((.cse0 (= 0 (mod ~y$w_buff0_used~0_In926429083 256))) (.cse1 (= (mod ~y$r_buff0_thd0~0_In926429083 256) 0))) (or (and (or .cse0 .cse1) (= ~y$r_buff0_thd0~0_In926429083 |ULTIMATE.start_main_#t~ite38_Out926429083|)) (and (not .cse0) (= 0 |ULTIMATE.start_main_#t~ite38_Out926429083|) (not .cse1)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In926429083, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In926429083} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In926429083, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In926429083, ULTIMATE.start_main_#t~ite38=|ULTIMATE.start_main_#t~ite38_Out926429083|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite38] because there is no mapped edge [2019-12-07 14:04:52,104 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [648] [648] L822-->L822-2: Formula: (let ((.cse1 (= (mod ~y$w_buff1_used~0_In110888111 256) 0)) (.cse0 (= (mod ~y$r_buff1_thd0~0_In110888111 256) 0)) (.cse2 (= (mod ~y$w_buff0_used~0_In110888111 256) 0)) (.cse3 (= 0 (mod ~y$r_buff0_thd0~0_In110888111 256)))) (or (and (or .cse0 .cse1) (or .cse2 .cse3) (= |ULTIMATE.start_main_#t~ite39_Out110888111| ~y$r_buff1_thd0~0_In110888111)) (and (or (and (not .cse1) (not .cse0)) (and (not .cse2) (not .cse3))) (= |ULTIMATE.start_main_#t~ite39_Out110888111| 0)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In110888111, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In110888111, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In110888111, ~y$w_buff1_used~0=~y$w_buff1_used~0_In110888111} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In110888111, ULTIMATE.start_main_#t~ite39=|ULTIMATE.start_main_#t~ite39_Out110888111|, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In110888111, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In110888111, ~y$w_buff1_used~0=~y$w_buff1_used~0_In110888111} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite39] because there is no mapped edge [2019-12-07 14:04:52,104 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [685] [685] L822-2-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= v_ULTIMATE.start___VERIFIER_assert_~expression_21 |v_ULTIMATE.start___VERIFIER_assert_#in~expression_15|) (= (mod v_~main$tmp_guard1~0_19 256) |v_ULTIMATE.start___VERIFIER_assert_#in~expression_15|) (= v_ULTIMATE.start___VERIFIER_assert_~expression_21 0) (= v_~main$tmp_guard1~0_19 (ite (= 0 (ite (not (and (= v_~__unbuffered_p1_EBX~0_67 0) (= 1 v_~__unbuffered_p1_EAX~0_67) (= v_~__unbuffered_p0_EBX~0_37 0) (= 1 v_~__unbuffered_p0_EAX~0_21))) 1 0)) 0 1)) (= v_~y$r_buff1_thd0~0_123 |v_ULTIMATE.start_main_#t~ite39_42|)) InVars {~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_21, ~__unbuffered_p0_EBX~0=v_~__unbuffered_p0_EBX~0_37, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_67, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_67, ULTIMATE.start_main_#t~ite39=|v_ULTIMATE.start_main_#t~ite39_42|} OutVars{~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_21, ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_21, ~__unbuffered_p0_EBX~0=v_~__unbuffered_p0_EBX~0_37, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_67, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_67, ULTIMATE.start_main_#t~ite39=|v_ULTIMATE.start_main_#t~ite39_41|, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_19, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_123, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_15|} AuxVars[] AssignedVars[ULTIMATE.start___VERIFIER_assert_~expression, ULTIMATE.start_main_#t~ite39, ~main$tmp_guard1~0, ~y$r_buff1_thd0~0, ULTIMATE.start___VERIFIER_assert_#in~expression] because there is no mapped edge [2019-12-07 14:04:52,163 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/run_dir_ffa8625b-ea76-4e57-98f9-86248c4f3fd3/bin/utaipan/witness.graphml [2019-12-07 14:04:52,163 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-12-07 14:04:52,165 INFO L168 Benchmark]: Toolchain (without parser) took 8882.82 ms. Allocated memory was 1.0 GB in the beginning and 1.6 GB in the end (delta: 561.0 MB). Free memory was 937.1 MB in the beginning and 1.4 GB in the end (delta: -488.3 MB). Peak memory consumption was 607.2 MB. Max. memory is 11.5 GB. [2019-12-07 14:04:52,165 INFO L168 Benchmark]: CDTParser took 0.14 ms. Allocated memory is still 1.0 GB. Free memory is still 958.6 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-12-07 14:04:52,165 INFO L168 Benchmark]: CACSL2BoogieTranslator took 377.91 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 99.6 MB). Free memory was 937.1 MB in the beginning and 1.1 GB in the end (delta: -130.2 MB). Peak memory consumption was 18.4 MB. Max. memory is 11.5 GB. [2019-12-07 14:04:52,166 INFO L168 Benchmark]: Boogie Procedure Inliner took 36.68 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. [2019-12-07 14:04:52,166 INFO L168 Benchmark]: Boogie Preprocessor took 23.40 ms. Allocated memory is still 1.1 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-12-07 14:04:52,166 INFO L168 Benchmark]: RCFGBuilder took 360.21 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 49.8 MB). Peak memory consumption was 49.8 MB. Max. memory is 11.5 GB. [2019-12-07 14:04:52,167 INFO L168 Benchmark]: TraceAbstraction took 7987.58 ms. Allocated memory was 1.1 GB in the beginning and 1.4 GB in the end (delta: 309.9 MB). Free memory was 1.0 GB in the beginning and 751.2 MB in the end (delta: 260.9 MB). Peak memory consumption was 570.8 MB. Max. memory is 11.5 GB. [2019-12-07 14:04:52,167 INFO L168 Benchmark]: Witness Printer took 93.79 ms. Allocated memory was 1.4 GB in the beginning and 1.6 GB in the end (delta: 151.5 MB). Free memory was 751.2 MB in the beginning and 1.4 GB in the end (delta: -674.2 MB). Peak memory consumption was 11.8 MB. Max. memory is 11.5 GB. [2019-12-07 14:04:52,170 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.14 ms. Allocated memory is still 1.0 GB. Free memory is still 958.6 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 377.91 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 99.6 MB). Free memory was 937.1 MB in the beginning and 1.1 GB in the end (delta: -130.2 MB). Peak memory consumption was 18.4 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 36.68 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 23.40 ms. Allocated memory is still 1.1 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 360.21 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 49.8 MB). Peak memory consumption was 49.8 MB. Max. memory is 11.5 GB. * TraceAbstraction took 7987.58 ms. Allocated memory was 1.1 GB in the beginning and 1.4 GB in the end (delta: 309.9 MB). Free memory was 1.0 GB in the beginning and 751.2 MB in the end (delta: 260.9 MB). Peak memory consumption was 570.8 MB. Max. memory is 11.5 GB. * Witness Printer took 93.79 ms. Allocated memory was 1.4 GB in the beginning and 1.6 GB in the end (delta: 151.5 MB). Free memory was 751.2 MB in the beginning and 1.4 GB in the end (delta: -674.2 MB). Peak memory consumption was 11.8 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks LbeTime: 2.9s, 139 ProgramPointsBefore, 67 ProgramPointsAfterwards, 167 TransitionsBefore, 78 TransitionsAfterwards, 10216 CoEnabledTransitionPairs, 8 FixpointIterations, 33 TrivialSequentialCompositions, 39 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 33 ConcurrentYvCompositions, 20 ChoiceCompositions, 4461 VarBasedMoverChecksPositive, 173 VarBasedMoverChecksNegative, 36 SemBasedMoverChecksPositive, 178 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 0.8s, 0 MoverChecksTotal, 44937 CheckedPairsTotal, 105 TotalNumberOfCompositions - CounterExampleResult [Line: 5]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L810] FCALL, FORK 0 pthread_create(&t847, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, a=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] [L812] FCALL, FORK 0 pthread_create(&t848, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, a=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] [L767] 2 y$w_buff1 = y$w_buff0 [L768] 2 y$w_buff0 = 1 [L769] 2 y$w_buff1_used = y$w_buff0_used [L770] 2 y$w_buff0_used = (_Bool)1 [L787] 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_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, a=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] [L733] 1 a = 1 [L736] 1 x = 1 [L739] 1 __unbuffered_p0_EAX = x [L742] 1 weak$$choice0 = __VERIFIER_nondet_bool() [L743] 1 weak$$choice2 = __VERIFIER_nondet_bool() [L744] 1 y$flush_delayed = weak$$choice2 [L745] 1 y$mem_tmp = y VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, a=1, 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] [L746] 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=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, a=1, 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] [L787] 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) [L788] 2 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used [L746] 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) [L747] 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=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, a=1, 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] [L747] 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)) [L748] 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=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, a=1, 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] [L748] 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)) [L749] EXPR 1 weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$w_buff0_used)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, a=1, 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] [L749] 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)) [L750] EXPR 1 weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, a=1, 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] [L750] 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)) [L752] 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)) [L753] 1 __unbuffered_p0_EBX = y VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, a=1, 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] [L789] 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 [L818] 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=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, a=1, 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] [L819] 0 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L820] 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 [L821] 0 y$r_buff0_thd0 = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 133 locations, 2 error locations. Result: UNSAFE, OverallTime: 7.8s, OverallIterations: 17, TraceHistogramMax: 1, AutomataDifference: 1.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 1667 SDtfs, 1275 SDslu, 2225 SDs, 0 SdLazy, 863 SolverSat, 60 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.6s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 61 GetRequests, 16 SyntacticMatches, 1 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=16050occurred in iteration=10, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 2.0s AutomataMinimizationTime, 16 MinimizatonAttempts, 6905 StatesRemovedByMinimization, 12 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.4s InterpolantComputationTime, 371 NumberOfCodeBlocks, 371 NumberOfCodeBlocksAsserted, 17 NumberOfCheckSat, 313 ConstructedInterpolants, 0 QuantifiedInterpolants, 24339 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 16 InterpolantComputations, 16 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...