./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/pthread-wmm/rfi007_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_fc7cc043-e3f6-4344-bd30-5812924d9e14/bin/utaipan/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/run_dir_fc7cc043-e3f6-4344-bd30-5812924d9e14/bin/utaipan/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_fc7cc043-e3f6-4344-bd30-5812924d9e14/bin/utaipan/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_fc7cc043-e3f6-4344-bd30-5812924d9e14/bin/utaipan/config/TaipanReach.xml -i ../../sv-benchmarks/c/pthread-wmm/rfi007_tso.opt.i -s /tmp/vcloud-vcloud-master/worker/run_dir_fc7cc043-e3f6-4344-bd30-5812924d9e14/bin/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_fc7cc043-e3f6-4344-bd30-5812924d9e14/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 a02d6b34f153beaa9e9eac4f5ac19280cae90251 .................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................. 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 20:51:30,657 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-07 20:51:30,659 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-07 20:51:30,666 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-07 20:51:30,666 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-07 20:51:30,667 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-07 20:51:30,668 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-07 20:51:30,669 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-07 20:51:30,671 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-07 20:51:30,671 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-07 20:51:30,672 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-07 20:51:30,673 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-07 20:51:30,673 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-07 20:51:30,674 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-07 20:51:30,674 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-07 20:51:30,675 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-07 20:51:30,675 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-07 20:51:30,676 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-07 20:51:30,677 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-07 20:51:30,679 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-07 20:51:30,680 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-07 20:51:30,681 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-07 20:51:30,681 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-07 20:51:30,682 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-07 20:51:30,684 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-07 20:51:30,684 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-07 20:51:30,684 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-07 20:51:30,684 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-07 20:51:30,685 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-07 20:51:30,685 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-07 20:51:30,685 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-07 20:51:30,686 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-07 20:51:30,686 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-07 20:51:30,686 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-07 20:51:30,687 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-07 20:51:30,687 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-07 20:51:30,688 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-07 20:51:30,688 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-07 20:51:30,688 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-07 20:51:30,688 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-07 20:51:30,689 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-07 20:51:30,689 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_fc7cc043-e3f6-4344-bd30-5812924d9e14/bin/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf [2019-12-07 20:51:30,699 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-07 20:51:30,699 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-07 20:51:30,699 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2019-12-07 20:51:30,699 INFO L138 SettingsManager]: * User list type=DISABLED [2019-12-07 20:51:30,700 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2019-12-07 20:51:30,700 INFO L138 SettingsManager]: * Explicit value domain=true [2019-12-07 20:51:30,700 INFO L138 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2019-12-07 20:51:30,700 INFO L138 SettingsManager]: * Octagon Domain=false [2019-12-07 20:51:30,700 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2019-12-07 20:51:30,700 INFO L138 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2019-12-07 20:51:30,700 INFO L138 SettingsManager]: * Use the RCFG-of-the-future interface=true [2019-12-07 20:51:30,700 INFO L138 SettingsManager]: * Interval Domain=false [2019-12-07 20:51:30,700 INFO L136 SettingsManager]: Preferences of Sifa differ from their defaults: [2019-12-07 20:51:30,700 INFO L138 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2019-12-07 20:51:30,701 INFO L138 SettingsManager]: * Simplification Technique=SIMPLIFY_QUICK [2019-12-07 20:51:30,701 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-07 20:51:30,701 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-07 20:51:30,701 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-07 20:51:30,701 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-07 20:51:30,701 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-07 20:51:30,701 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-07 20:51:30,702 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-07 20:51:30,702 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-07 20:51:30,702 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2019-12-07 20:51:30,702 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-07 20:51:30,702 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-07 20:51:30,702 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-07 20:51:30,702 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-07 20:51:30,702 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-07 20:51:30,702 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-07 20:51:30,703 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-07 20:51:30,703 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-07 20:51:30,703 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-07 20:51:30,703 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-07 20:51:30,703 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-07 20:51:30,703 INFO L138 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2019-12-07 20:51:30,703 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-07 20:51:30,704 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-07 20:51:30,704 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2019-12-07 20:51:30,704 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-12-07 20:51:30,704 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_fc7cc043-e3f6-4344-bd30-5812924d9e14/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 -> a02d6b34f153beaa9e9eac4f5ac19280cae90251 [2019-12-07 20:51:30,804 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-07 20:51:30,815 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-07 20:51:30,818 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-07 20:51:30,819 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-07 20:51:30,819 INFO L275 PluginConnector]: CDTParser initialized [2019-12-07 20:51:30,820 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_fc7cc043-e3f6-4344-bd30-5812924d9e14/bin/utaipan/../../sv-benchmarks/c/pthread-wmm/rfi007_tso.opt.i [2019-12-07 20:51:30,867 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_fc7cc043-e3f6-4344-bd30-5812924d9e14/bin/utaipan/data/ca34a2477/80bf62b8dccc4b3ebb489b6a9339d1cb/FLAGaae5ae656 [2019-12-07 20:51:31,305 INFO L306 CDTParser]: Found 1 translation units. [2019-12-07 20:51:31,305 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_fc7cc043-e3f6-4344-bd30-5812924d9e14/sv-benchmarks/c/pthread-wmm/rfi007_tso.opt.i [2019-12-07 20:51:31,317 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_fc7cc043-e3f6-4344-bd30-5812924d9e14/bin/utaipan/data/ca34a2477/80bf62b8dccc4b3ebb489b6a9339d1cb/FLAGaae5ae656 [2019-12-07 20:51:31,652 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_fc7cc043-e3f6-4344-bd30-5812924d9e14/bin/utaipan/data/ca34a2477/80bf62b8dccc4b3ebb489b6a9339d1cb [2019-12-07 20:51:31,658 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-07 20:51:31,660 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-12-07 20:51:31,663 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-07 20:51:31,663 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-07 20:51:31,670 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-07 20:51:31,671 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.12 08:51:31" (1/1) ... [2019-12-07 20:51:31,674 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7030ab51 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 08:51:31, skipping insertion in model container [2019-12-07 20:51:31,674 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.12 08:51:31" (1/1) ... [2019-12-07 20:51:31,681 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-07 20:51:31,716 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-07 20:51:31,969 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-07 20:51:31,976 INFO L203 MainTranslator]: Completed pre-run [2019-12-07 20:51:32,019 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-07 20:51:32,063 INFO L208 MainTranslator]: Completed translation [2019-12-07 20:51:32,063 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 08:51:32 WrapperNode [2019-12-07 20:51:32,063 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-07 20:51:32,064 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-07 20:51:32,064 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-07 20:51:32,064 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-07 20:51:32,069 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 08:51:32" (1/1) ... [2019-12-07 20:51:32,082 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 08:51:32" (1/1) ... [2019-12-07 20:51:32,105 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-07 20:51:32,105 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-07 20:51:32,105 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-07 20:51:32,105 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-07 20:51:32,112 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 08:51:32" (1/1) ... [2019-12-07 20:51:32,112 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 08:51:32" (1/1) ... [2019-12-07 20:51:32,116 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 08:51:32" (1/1) ... [2019-12-07 20:51:32,116 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 08:51:32" (1/1) ... [2019-12-07 20:51:32,124 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 08:51:32" (1/1) ... [2019-12-07 20:51:32,127 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 08:51:32" (1/1) ... [2019-12-07 20:51:32,130 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 08:51:32" (1/1) ... [2019-12-07 20:51:32,133 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-07 20:51:32,133 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-07 20:51:32,133 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-07 20:51:32,133 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-07 20:51:32,134 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 08:51:32" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_fc7cc043-e3f6-4344-bd30-5812924d9e14/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 20:51:32,175 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-12-07 20:51:32,175 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2019-12-07 20:51:32,175 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-12-07 20:51:32,175 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-12-07 20:51:32,175 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2019-12-07 20:51:32,175 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2019-12-07 20:51:32,175 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2019-12-07 20:51:32,175 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2019-12-07 20:51:32,175 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2019-12-07 20:51:32,176 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-07 20:51:32,176 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-07 20:51:32,177 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 20:51:32,580 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-07 20:51:32,580 INFO L287 CfgBuilder]: Removed 8 assume(true) statements. [2019-12-07 20:51:32,581 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 08:51:32 BoogieIcfgContainer [2019-12-07 20:51:32,581 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-07 20:51:32,582 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-07 20:51:32,582 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-07 20:51:32,584 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-07 20:51:32,584 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.12 08:51:31" (1/3) ... [2019-12-07 20:51:32,585 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@42268b9e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.12 08:51:32, skipping insertion in model container [2019-12-07 20:51:32,585 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 08:51:32" (2/3) ... [2019-12-07 20:51:32,585 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@42268b9e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.12 08:51:32, skipping insertion in model container [2019-12-07 20:51:32,585 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 08:51:32" (3/3) ... [2019-12-07 20:51:32,586 INFO L109 eAbstractionObserver]: Analyzing ICFG rfi007_tso.opt.i [2019-12-07 20:51:32,593 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-12-07 20:51:32,593 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-07 20:51:32,598 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2019-12-07 20:51:32,599 INFO L339 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2019-12-07 20:51:32,627 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:51:32,627 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:51:32,627 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:51:32,627 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:51:32,628 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:51:32,628 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:51:32,628 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:51:32,628 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:51:32,628 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:51:32,628 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:51:32,628 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:51:32,629 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:51:32,629 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:51:32,629 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:51:32,629 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:51:32,629 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:51:32,629 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:51:32,629 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:51:32,630 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:51:32,630 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:51:32,630 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:51:32,630 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:51:32,630 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:51:32,630 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:51:32,630 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:51:32,631 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:51:32,631 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:51:32,631 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:51:32,631 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:51:32,631 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:51:32,633 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:51:32,633 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:51:32,633 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:51:32,633 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:51:32,633 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:51:32,633 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:51:32,634 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:51:32,634 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:51:32,634 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:51:32,634 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:51:32,634 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:51:32,634 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:51:32,634 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:51:32,635 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:51:32,635 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:51:32,635 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:51:32,635 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:51:32,635 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:51:32,635 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:51:32,635 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:51:32,635 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:51:32,636 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:51:32,636 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:51:32,636 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:51:32,636 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:51:32,636 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:51:32,636 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:51:32,636 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:51:32,636 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:51:32,636 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:51:32,637 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:51:32,637 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:51:32,637 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:51:32,637 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:51:32,637 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:51:32,637 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:51:32,637 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:51:32,637 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:51:32,638 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:51:32,638 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:51:32,638 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:51:32,638 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:51:32,638 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:51:32,638 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:51:32,638 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:51:32,639 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:51:32,639 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:51:32,639 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:51:32,639 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:51:32,639 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:51:32,639 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:51:32,640 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:51:32,640 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:51:32,640 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:51:32,640 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:51:32,640 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:51:32,640 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:51:32,641 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:51:32,641 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:51:32,641 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:51:32,641 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:51:32,641 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:51:32,641 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:51:32,642 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:51:32,642 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:51:32,642 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:51:32,642 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:51:32,643 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:51:32,643 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:51:32,643 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:51:32,643 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:51:32,643 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:51:32,643 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:51:32,643 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:51:32,644 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:51:32,644 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:51:32,644 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:51:32,644 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:51:32,644 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:51:32,644 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:51:32,644 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:51:32,645 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:51:32,645 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:51:32,645 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:51:32,645 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:51:32,645 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:51:32,645 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:51:32,645 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:51:32,645 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:51:32,646 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:51:32,646 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:51:32,646 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:51:32,646 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:51:32,646 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:51:32,646 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:51:32,646 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:51:32,646 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:51:32,647 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:51:32,647 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:51:32,647 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:51:32,647 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:51:32,647 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:51:32,647 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:51:32,648 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:51:32,648 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:51:32,648 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:51:32,648 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:51:32,648 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:51:32,648 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:51:32,648 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:51:32,648 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:51:32,648 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:51:32,648 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:51:32,648 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:51:32,649 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:51:32,649 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:51:32,649 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:51:32,649 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:51:32,649 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:51:32,649 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:51:32,649 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:51:32,649 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:51:32,664 INFO L249 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2019-12-07 20:51:32,681 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-07 20:51:32,681 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-07 20:51:32,681 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-07 20:51:32,681 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-12-07 20:51:32,681 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-07 20:51:32,681 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-07 20:51:32,682 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-07 20:51:32,682 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-07 20:51:32,694 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 189 places, 244 transitions [2019-12-07 20:51:32,695 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 189 places, 244 transitions [2019-12-07 20:51:32,754 INFO L134 PetriNetUnfolder]: 62/242 cut-off events. [2019-12-07 20:51:32,754 INFO L135 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-07 20:51:32,766 INFO L76 FinitePrefix]: Finished finitePrefix Result has 249 conditions, 242 events. 62/242 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 870 event pairs. 6/184 useless extension candidates. Maximal degree in co-relation 213. Up to 2 conditions per place. [2019-12-07 20:51:32,786 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 189 places, 244 transitions [2019-12-07 20:51:32,821 INFO L134 PetriNetUnfolder]: 62/242 cut-off events. [2019-12-07 20:51:32,821 INFO L135 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-07 20:51:32,828 INFO L76 FinitePrefix]: Finished finitePrefix Result has 249 conditions, 242 events. 62/242 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 870 event pairs. 6/184 useless extension candidates. Maximal degree in co-relation 213. Up to 2 conditions per place. [2019-12-07 20:51:32,850 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 25246 [2019-12-07 20:51:32,850 INFO L170 etLargeBlockEncoding]: Semantic Check. [2019-12-07 20:51:35,997 WARN L192 SmtUtils]: Spent 142.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 81 [2019-12-07 20:51:36,087 INFO L206 etLargeBlockEncoding]: Checked pairs total: 142511 [2019-12-07 20:51:36,088 INFO L214 etLargeBlockEncoding]: Total number of compositions: 117 [2019-12-07 20:51:36,090 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 112 places, 137 transitions [2019-12-07 20:51:37,393 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 27484 states. [2019-12-07 20:51:37,394 INFO L276 IsEmpty]: Start isEmpty. Operand 27484 states. [2019-12-07 20:51:37,398 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-12-07 20:51:37,398 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 20:51:37,398 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-12-07 20:51:37,399 INFO L410 AbstractCegarLoop]: === Iteration 1 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 20:51:37,402 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 20:51:37,402 INFO L82 PathProgramCache]: Analyzing trace with hash 979333444, now seen corresponding path program 1 times [2019-12-07 20:51:37,408 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 20:51:37,408 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [605083895] [2019-12-07 20:51:37,408 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 20:51:37,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 20:51:37,541 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 20:51:37,541 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [605083895] [2019-12-07 20:51:37,542 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 20:51:37,542 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-07 20:51:37,543 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1009095840] [2019-12-07 20:51:37,545 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 20:51:37,546 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 20:51:37,554 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 20:51:37,555 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 20:51:37,556 INFO L87 Difference]: Start difference. First operand 27484 states. Second operand 3 states. [2019-12-07 20:51:37,844 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 20:51:37,844 INFO L93 Difference]: Finished difference Result 27436 states and 97226 transitions. [2019-12-07 20:51:37,844 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 20:51:37,845 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 5 [2019-12-07 20:51:37,845 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 20:51:38,058 INFO L225 Difference]: With dead ends: 27436 [2019-12-07 20:51:38,058 INFO L226 Difference]: Without dead ends: 26890 [2019-12-07 20:51:38,059 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 20:51:38,487 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26890 states. [2019-12-07 20:51:38,909 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26890 to 26890. [2019-12-07 20:51:38,910 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26890 states. [2019-12-07 20:51:39,066 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26890 states to 26890 states and 95406 transitions. [2019-12-07 20:51:39,067 INFO L78 Accepts]: Start accepts. Automaton has 26890 states and 95406 transitions. Word has length 5 [2019-12-07 20:51:39,067 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 20:51:39,067 INFO L462 AbstractCegarLoop]: Abstraction has 26890 states and 95406 transitions. [2019-12-07 20:51:39,067 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 20:51:39,068 INFO L276 IsEmpty]: Start isEmpty. Operand 26890 states and 95406 transitions. [2019-12-07 20:51:39,069 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-12-07 20:51:39,069 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 20:51:39,070 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 20:51:39,070 INFO L410 AbstractCegarLoop]: === Iteration 2 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 20:51:39,070 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 20:51:39,070 INFO L82 PathProgramCache]: Analyzing trace with hash 1135413059, now seen corresponding path program 1 times [2019-12-07 20:51:39,070 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 20:51:39,070 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1037685704] [2019-12-07 20:51:39,070 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 20:51:39,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 20:51:39,128 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 20:51:39,129 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1037685704] [2019-12-07 20:51:39,129 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 20:51:39,129 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 20:51:39,129 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1735375823] [2019-12-07 20:51:39,130 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 20:51:39,130 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 20:51:39,130 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 20:51:39,130 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 20:51:39,130 INFO L87 Difference]: Start difference. First operand 26890 states and 95406 transitions. Second operand 4 states. [2019-12-07 20:51:39,500 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 20:51:39,500 INFO L93 Difference]: Finished difference Result 43282 states and 146547 transitions. [2019-12-07 20:51:39,500 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-07 20:51:39,501 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 11 [2019-12-07 20:51:39,501 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 20:51:39,607 INFO L225 Difference]: With dead ends: 43282 [2019-12-07 20:51:39,607 INFO L226 Difference]: Without dead ends: 43275 [2019-12-07 20:51:39,608 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 20:51:40,033 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43275 states. [2019-12-07 20:51:40,602 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43275 to 41962. [2019-12-07 20:51:40,602 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41962 states. [2019-12-07 20:51:40,672 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41962 states to 41962 states and 143055 transitions. [2019-12-07 20:51:40,672 INFO L78 Accepts]: Start accepts. Automaton has 41962 states and 143055 transitions. Word has length 11 [2019-12-07 20:51:40,672 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 20:51:40,672 INFO L462 AbstractCegarLoop]: Abstraction has 41962 states and 143055 transitions. [2019-12-07 20:51:40,673 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 20:51:40,673 INFO L276 IsEmpty]: Start isEmpty. Operand 41962 states and 143055 transitions. [2019-12-07 20:51:40,674 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-12-07 20:51:40,675 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 20:51:40,675 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 20:51:40,675 INFO L410 AbstractCegarLoop]: === Iteration 3 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 20:51:40,675 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 20:51:40,675 INFO L82 PathProgramCache]: Analyzing trace with hash -217981421, now seen corresponding path program 1 times [2019-12-07 20:51:40,675 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 20:51:40,675 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1476398716] [2019-12-07 20:51:40,675 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 20:51:40,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 20:51:40,718 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 20:51:40,718 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1476398716] [2019-12-07 20:51:40,718 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 20:51:40,719 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 20:51:40,719 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1523256548] [2019-12-07 20:51:40,719 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 20:51:40,719 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 20:51:40,719 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 20:51:40,719 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 20:51:40,719 INFO L87 Difference]: Start difference. First operand 41962 states and 143055 transitions. Second operand 4 states. [2019-12-07 20:51:41,044 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 20:51:41,044 INFO L93 Difference]: Finished difference Result 53078 states and 178895 transitions. [2019-12-07 20:51:41,045 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-07 20:51:41,045 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 11 [2019-12-07 20:51:41,046 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 20:51:41,147 INFO L225 Difference]: With dead ends: 53078 [2019-12-07 20:51:41,147 INFO L226 Difference]: Without dead ends: 53078 [2019-12-07 20:51:41,148 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 20:51:41,745 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53078 states. [2019-12-07 20:51:42,184 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53078 to 47600. [2019-12-07 20:51:42,184 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47600 states. [2019-12-07 20:51:42,262 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47600 states to 47600 states and 161707 transitions. [2019-12-07 20:51:42,262 INFO L78 Accepts]: Start accepts. Automaton has 47600 states and 161707 transitions. Word has length 11 [2019-12-07 20:51:42,262 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 20:51:42,262 INFO L462 AbstractCegarLoop]: Abstraction has 47600 states and 161707 transitions. [2019-12-07 20:51:42,262 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 20:51:42,262 INFO L276 IsEmpty]: Start isEmpty. Operand 47600 states and 161707 transitions. [2019-12-07 20:51:42,267 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-12-07 20:51:42,267 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 20:51:42,267 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 20:51:42,267 INFO L410 AbstractCegarLoop]: === Iteration 4 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 20:51:42,267 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 20:51:42,268 INFO L82 PathProgramCache]: Analyzing trace with hash -1239203888, now seen corresponding path program 1 times [2019-12-07 20:51:42,268 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 20:51:42,268 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1893314401] [2019-12-07 20:51:42,268 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 20:51:42,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 20:51:42,314 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 20:51:42,315 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1893314401] [2019-12-07 20:51:42,315 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 20:51:42,315 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 20:51:42,315 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1716616082] [2019-12-07 20:51:42,316 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-07 20:51:42,316 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 20:51:42,316 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-07 20:51:42,316 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-07 20:51:42,316 INFO L87 Difference]: Start difference. First operand 47600 states and 161707 transitions. Second operand 5 states. [2019-12-07 20:51:42,967 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 20:51:42,967 INFO L93 Difference]: Finished difference Result 63010 states and 210076 transitions. [2019-12-07 20:51:42,967 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-12-07 20:51:42,967 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 17 [2019-12-07 20:51:42,967 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 20:51:43,068 INFO L225 Difference]: With dead ends: 63010 [2019-12-07 20:51:43,069 INFO L226 Difference]: Without dead ends: 63003 [2019-12-07 20:51:43,069 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2019-12-07 20:51:43,583 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63003 states. [2019-12-07 20:51:44,239 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63003 to 47611. [2019-12-07 20:51:44,239 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47611 states. [2019-12-07 20:51:44,315 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47611 states to 47611 states and 161609 transitions. [2019-12-07 20:51:44,315 INFO L78 Accepts]: Start accepts. Automaton has 47611 states and 161609 transitions. Word has length 17 [2019-12-07 20:51:44,315 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 20:51:44,315 INFO L462 AbstractCegarLoop]: Abstraction has 47611 states and 161609 transitions. [2019-12-07 20:51:44,315 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-07 20:51:44,315 INFO L276 IsEmpty]: Start isEmpty. Operand 47611 states and 161609 transitions. [2019-12-07 20:51:44,330 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-12-07 20:51:44,331 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 20:51:44,331 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] [2019-12-07 20:51:44,331 INFO L410 AbstractCegarLoop]: === Iteration 5 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 20:51:44,331 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 20:51:44,331 INFO L82 PathProgramCache]: Analyzing trace with hash 1918132910, now seen corresponding path program 1 times [2019-12-07 20:51:44,331 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 20:51:44,331 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1425304146] [2019-12-07 20:51:44,331 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 20:51:44,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 20:51:44,383 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 20:51:44,383 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1425304146] [2019-12-07 20:51:44,383 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 20:51:44,384 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 20:51:44,384 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1244190266] [2019-12-07 20:51:44,384 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 20:51:44,384 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 20:51:44,384 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 20:51:44,384 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 20:51:44,384 INFO L87 Difference]: Start difference. First operand 47611 states and 161609 transitions. Second operand 4 states. [2019-12-07 20:51:44,413 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 20:51:44,413 INFO L93 Difference]: Finished difference Result 5620 states and 14074 transitions. [2019-12-07 20:51:44,413 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 20:51:44,413 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 25 [2019-12-07 20:51:44,414 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 20:51:44,417 INFO L225 Difference]: With dead ends: 5620 [2019-12-07 20:51:44,418 INFO L226 Difference]: Without dead ends: 4725 [2019-12-07 20:51:44,418 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 20:51:44,428 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4725 states. [2019-12-07 20:51:44,459 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4725 to 4725. [2019-12-07 20:51:44,459 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4725 states. [2019-12-07 20:51:44,464 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4725 states to 4725 states and 11319 transitions. [2019-12-07 20:51:44,464 INFO L78 Accepts]: Start accepts. Automaton has 4725 states and 11319 transitions. Word has length 25 [2019-12-07 20:51:44,464 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 20:51:44,464 INFO L462 AbstractCegarLoop]: Abstraction has 4725 states and 11319 transitions. [2019-12-07 20:51:44,464 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 20:51:44,464 INFO L276 IsEmpty]: Start isEmpty. Operand 4725 states and 11319 transitions. [2019-12-07 20:51:44,467 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2019-12-07 20:51:44,467 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 20:51:44,467 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] [2019-12-07 20:51:44,467 INFO L410 AbstractCegarLoop]: === Iteration 6 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 20:51:44,468 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 20:51:44,468 INFO L82 PathProgramCache]: Analyzing trace with hash 2102045766, now seen corresponding path program 1 times [2019-12-07 20:51:44,468 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 20:51:44,468 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1782849507] [2019-12-07 20:51:44,468 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 20:51:44,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 20:51:44,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 20:51:44,528 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1782849507] [2019-12-07 20:51:44,528 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 20:51:44,528 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 20:51:44,528 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [673012135] [2019-12-07 20:51:44,528 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-07 20:51:44,528 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 20:51:44,528 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-07 20:51:44,529 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-07 20:51:44,529 INFO L87 Difference]: Start difference. First operand 4725 states and 11319 transitions. Second operand 5 states. [2019-12-07 20:51:44,561 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 20:51:44,561 INFO L93 Difference]: Finished difference Result 1095 states and 2326 transitions. [2019-12-07 20:51:44,561 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-07 20:51:44,561 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 37 [2019-12-07 20:51:44,561 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 20:51:44,562 INFO L225 Difference]: With dead ends: 1095 [2019-12-07 20:51:44,562 INFO L226 Difference]: Without dead ends: 991 [2019-12-07 20:51:44,562 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-12-07 20:51:44,564 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 991 states. [2019-12-07 20:51:44,569 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 991 to 949. [2019-12-07 20:51:44,570 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 949 states. [2019-12-07 20:51:44,571 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 949 states to 949 states and 2023 transitions. [2019-12-07 20:51:44,571 INFO L78 Accepts]: Start accepts. Automaton has 949 states and 2023 transitions. Word has length 37 [2019-12-07 20:51:44,571 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 20:51:44,571 INFO L462 AbstractCegarLoop]: Abstraction has 949 states and 2023 transitions. [2019-12-07 20:51:44,571 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-07 20:51:44,571 INFO L276 IsEmpty]: Start isEmpty. Operand 949 states and 2023 transitions. [2019-12-07 20:51:44,573 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2019-12-07 20:51:44,573 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 20:51:44,573 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, 1, 1, 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 20:51:44,573 INFO L410 AbstractCegarLoop]: === Iteration 7 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 20:51:44,573 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 20:51:44,574 INFO L82 PathProgramCache]: Analyzing trace with hash 1081276424, now seen corresponding path program 1 times [2019-12-07 20:51:44,574 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 20:51:44,574 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [996639712] [2019-12-07 20:51:44,574 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 20:51:44,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 20:51:44,645 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 20:51:44,645 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [996639712] [2019-12-07 20:51:44,645 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 20:51:44,645 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-07 20:51:44,645 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [366595022] [2019-12-07 20:51:44,645 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-07 20:51:44,646 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 20:51:44,646 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-07 20:51:44,646 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-12-07 20:51:44,646 INFO L87 Difference]: Start difference. First operand 949 states and 2023 transitions. Second operand 6 states. [2019-12-07 20:51:45,003 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 20:51:45,003 INFO L93 Difference]: Finished difference Result 1405 states and 2968 transitions. [2019-12-07 20:51:45,003 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-12-07 20:51:45,003 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 68 [2019-12-07 20:51:45,003 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 20:51:45,004 INFO L225 Difference]: With dead ends: 1405 [2019-12-07 20:51:45,004 INFO L226 Difference]: Without dead ends: 1405 [2019-12-07 20:51:45,005 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 4 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2019-12-07 20:51:45,006 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1405 states. [2019-12-07 20:51:45,012 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1405 to 1132. [2019-12-07 20:51:45,012 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1132 states. [2019-12-07 20:51:45,014 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1132 states to 1132 states and 2413 transitions. [2019-12-07 20:51:45,014 INFO L78 Accepts]: Start accepts. Automaton has 1132 states and 2413 transitions. Word has length 68 [2019-12-07 20:51:45,014 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 20:51:45,014 INFO L462 AbstractCegarLoop]: Abstraction has 1132 states and 2413 transitions. [2019-12-07 20:51:45,014 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-07 20:51:45,014 INFO L276 IsEmpty]: Start isEmpty. Operand 1132 states and 2413 transitions. [2019-12-07 20:51:45,016 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2019-12-07 20:51:45,016 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 20:51:45,016 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, 1, 1, 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 20:51:45,016 INFO L410 AbstractCegarLoop]: === Iteration 8 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 20:51:45,016 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 20:51:45,016 INFO L82 PathProgramCache]: Analyzing trace with hash 188736084, now seen corresponding path program 2 times [2019-12-07 20:51:45,016 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 20:51:45,017 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019134170] [2019-12-07 20:51:45,017 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 20:51:45,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 20:51:45,112 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 20:51:45,112 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019134170] [2019-12-07 20:51:45,112 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 20:51:45,112 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-07 20:51:45,112 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1675803038] [2019-12-07 20:51:45,113 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-07 20:51:45,113 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 20:51:45,113 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-07 20:51:45,113 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2019-12-07 20:51:45,113 INFO L87 Difference]: Start difference. First operand 1132 states and 2413 transitions. Second operand 7 states. [2019-12-07 20:51:45,501 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 20:51:45,501 INFO L93 Difference]: Finished difference Result 1322 states and 2786 transitions. [2019-12-07 20:51:45,501 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-12-07 20:51:45,501 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 68 [2019-12-07 20:51:45,502 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 20:51:45,502 INFO L225 Difference]: With dead ends: 1322 [2019-12-07 20:51:45,502 INFO L226 Difference]: Without dead ends: 1322 [2019-12-07 20:51:45,503 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 4 SyntacticMatches, 1 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90 [2019-12-07 20:51:45,504 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1322 states. [2019-12-07 20:51:45,510 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1322 to 1237. [2019-12-07 20:51:45,510 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1237 states. [2019-12-07 20:51:45,512 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1237 states to 1237 states and 2629 transitions. [2019-12-07 20:51:45,512 INFO L78 Accepts]: Start accepts. Automaton has 1237 states and 2629 transitions. Word has length 68 [2019-12-07 20:51:45,512 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 20:51:45,512 INFO L462 AbstractCegarLoop]: Abstraction has 1237 states and 2629 transitions. [2019-12-07 20:51:45,512 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-07 20:51:45,512 INFO L276 IsEmpty]: Start isEmpty. Operand 1237 states and 2629 transitions. [2019-12-07 20:51:45,513 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2019-12-07 20:51:45,513 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 20:51:45,514 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, 1, 1, 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 20:51:45,514 INFO L410 AbstractCegarLoop]: === Iteration 9 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 20:51:45,514 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 20:51:45,514 INFO L82 PathProgramCache]: Analyzing trace with hash 1869906086, now seen corresponding path program 3 times [2019-12-07 20:51:45,514 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 20:51:45,514 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1271876906] [2019-12-07 20:51:45,514 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 20:51:45,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 20:51:45,578 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 20:51:45,578 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1271876906] [2019-12-07 20:51:45,578 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 20:51:45,579 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-07 20:51:45,579 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2096740335] [2019-12-07 20:51:45,579 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-07 20:51:45,579 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 20:51:45,579 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-07 20:51:45,580 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-07 20:51:45,580 INFO L87 Difference]: Start difference. First operand 1237 states and 2629 transitions. Second operand 5 states. [2019-12-07 20:51:45,740 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 20:51:45,740 INFO L93 Difference]: Finished difference Result 1390 states and 2909 transitions. [2019-12-07 20:51:45,740 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-07 20:51:45,741 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 68 [2019-12-07 20:51:45,741 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 20:51:45,742 INFO L225 Difference]: With dead ends: 1390 [2019-12-07 20:51:45,742 INFO L226 Difference]: Without dead ends: 1390 [2019-12-07 20:51:45,742 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-12-07 20:51:45,744 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1390 states. [2019-12-07 20:51:45,751 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1390 to 1279. [2019-12-07 20:51:45,751 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1279 states. [2019-12-07 20:51:45,752 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1279 states to 1279 states and 2714 transitions. [2019-12-07 20:51:45,752 INFO L78 Accepts]: Start accepts. Automaton has 1279 states and 2714 transitions. Word has length 68 [2019-12-07 20:51:45,752 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 20:51:45,752 INFO L462 AbstractCegarLoop]: Abstraction has 1279 states and 2714 transitions. [2019-12-07 20:51:45,752 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-07 20:51:45,753 INFO L276 IsEmpty]: Start isEmpty. Operand 1279 states and 2714 transitions. [2019-12-07 20:51:45,754 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2019-12-07 20:51:45,754 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 20:51:45,754 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, 1, 1, 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 20:51:45,754 INFO L410 AbstractCegarLoop]: === Iteration 10 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 20:51:45,754 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 20:51:45,754 INFO L82 PathProgramCache]: Analyzing trace with hash 395185618, now seen corresponding path program 4 times [2019-12-07 20:51:45,755 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 20:51:45,755 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1043250645] [2019-12-07 20:51:45,755 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 20:51:45,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 20:51:45,846 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 20:51:45,846 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1043250645] [2019-12-07 20:51:45,846 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 20:51:45,847 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-07 20:51:45,847 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [170690620] [2019-12-07 20:51:45,847 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-07 20:51:45,847 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 20:51:45,847 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-07 20:51:45,847 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2019-12-07 20:51:45,847 INFO L87 Difference]: Start difference. First operand 1279 states and 2714 transitions. Second operand 7 states. [2019-12-07 20:51:46,254 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 20:51:46,254 INFO L93 Difference]: Finished difference Result 2280 states and 4779 transitions. [2019-12-07 20:51:46,255 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-12-07 20:51:46,255 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 68 [2019-12-07 20:51:46,255 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 20:51:46,256 INFO L225 Difference]: With dead ends: 2280 [2019-12-07 20:51:46,256 INFO L226 Difference]: Without dead ends: 2280 [2019-12-07 20:51:46,257 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 4 SyntacticMatches, 3 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=46, Invalid=110, Unknown=0, NotChecked=0, Total=156 [2019-12-07 20:51:46,259 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2280 states. [2019-12-07 20:51:46,268 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2280 to 1321. [2019-12-07 20:51:46,268 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1321 states. [2019-12-07 20:51:46,269 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1321 states to 1321 states and 2819 transitions. [2019-12-07 20:51:46,269 INFO L78 Accepts]: Start accepts. Automaton has 1321 states and 2819 transitions. Word has length 68 [2019-12-07 20:51:46,269 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 20:51:46,269 INFO L462 AbstractCegarLoop]: Abstraction has 1321 states and 2819 transitions. [2019-12-07 20:51:46,269 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-07 20:51:46,269 INFO L276 IsEmpty]: Start isEmpty. Operand 1321 states and 2819 transitions. [2019-12-07 20:51:46,271 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2019-12-07 20:51:46,271 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 20:51:46,271 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, 1, 1, 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 20:51:46,271 INFO L410 AbstractCegarLoop]: === Iteration 11 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 20:51:46,271 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 20:51:46,271 INFO L82 PathProgramCache]: Analyzing trace with hash 155410772, now seen corresponding path program 5 times [2019-12-07 20:51:46,271 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 20:51:46,271 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [958376011] [2019-12-07 20:51:46,272 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 20:51:46,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 20:51:46,365 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 20:51:46,366 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [958376011] [2019-12-07 20:51:46,366 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 20:51:46,366 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-07 20:51:46,366 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1865975067] [2019-12-07 20:51:46,366 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-07 20:51:46,366 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 20:51:46,367 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-07 20:51:46,367 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2019-12-07 20:51:46,367 INFO L87 Difference]: Start difference. First operand 1321 states and 2819 transitions. Second operand 7 states. [2019-12-07 20:51:46,783 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 20:51:46,783 INFO L93 Difference]: Finished difference Result 2184 states and 4603 transitions. [2019-12-07 20:51:46,783 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-12-07 20:51:46,783 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 68 [2019-12-07 20:51:46,783 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 20:51:46,785 INFO L225 Difference]: With dead ends: 2184 [2019-12-07 20:51:46,785 INFO L226 Difference]: Without dead ends: 2184 [2019-12-07 20:51:46,785 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 4 SyntacticMatches, 3 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=41, Invalid=115, Unknown=0, NotChecked=0, Total=156 [2019-12-07 20:51:46,788 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2184 states. [2019-12-07 20:51:46,796 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2184 to 1312. [2019-12-07 20:51:46,796 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1312 states. [2019-12-07 20:51:46,798 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1312 states to 1312 states and 2801 transitions. [2019-12-07 20:51:46,798 INFO L78 Accepts]: Start accepts. Automaton has 1312 states and 2801 transitions. Word has length 68 [2019-12-07 20:51:46,798 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 20:51:46,798 INFO L462 AbstractCegarLoop]: Abstraction has 1312 states and 2801 transitions. [2019-12-07 20:51:46,798 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-07 20:51:46,798 INFO L276 IsEmpty]: Start isEmpty. Operand 1312 states and 2801 transitions. [2019-12-07 20:51:46,799 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2019-12-07 20:51:46,800 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 20:51:46,800 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, 1, 1, 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 20:51:46,800 INFO L410 AbstractCegarLoop]: === Iteration 12 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 20:51:46,800 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 20:51:46,800 INFO L82 PathProgramCache]: Analyzing trace with hash -940338092, now seen corresponding path program 6 times [2019-12-07 20:51:46,800 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 20:51:46,800 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1732066615] [2019-12-07 20:51:46,800 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 20:51:46,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 20:51:46,881 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 20:51:46,882 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1732066615] [2019-12-07 20:51:46,882 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 20:51:46,882 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-07 20:51:46,882 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1578836300] [2019-12-07 20:51:46,882 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-07 20:51:46,882 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 20:51:46,882 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-07 20:51:46,882 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-12-07 20:51:46,882 INFO L87 Difference]: Start difference. First operand 1312 states and 2801 transitions. Second operand 6 states. [2019-12-07 20:51:47,158 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 20:51:47,158 INFO L93 Difference]: Finished difference Result 1738 states and 3616 transitions. [2019-12-07 20:51:47,159 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-12-07 20:51:47,159 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 68 [2019-12-07 20:51:47,159 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 20:51:47,160 INFO L225 Difference]: With dead ends: 1738 [2019-12-07 20:51:47,160 INFO L226 Difference]: Without dead ends: 1738 [2019-12-07 20:51:47,160 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 4 SyntacticMatches, 3 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=32, Invalid=78, Unknown=0, NotChecked=0, Total=110 [2019-12-07 20:51:47,162 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1738 states. [2019-12-07 20:51:47,169 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1738 to 1318. [2019-12-07 20:51:47,169 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1318 states. [2019-12-07 20:51:47,170 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1318 states to 1318 states and 2812 transitions. [2019-12-07 20:51:47,171 INFO L78 Accepts]: Start accepts. Automaton has 1318 states and 2812 transitions. Word has length 68 [2019-12-07 20:51:47,171 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 20:51:47,171 INFO L462 AbstractCegarLoop]: Abstraction has 1318 states and 2812 transitions. [2019-12-07 20:51:47,171 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-07 20:51:47,171 INFO L276 IsEmpty]: Start isEmpty. Operand 1318 states and 2812 transitions. [2019-12-07 20:51:47,172 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2019-12-07 20:51:47,172 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 20:51:47,172 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, 1, 1, 1, 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 20:51:47,172 INFO L410 AbstractCegarLoop]: === Iteration 13 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 20:51:47,173 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 20:51:47,173 INFO L82 PathProgramCache]: Analyzing trace with hash 29507545, now seen corresponding path program 1 times [2019-12-07 20:51:47,173 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 20:51:47,173 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1867802227] [2019-12-07 20:51:47,173 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 20:51:47,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 20:51:47,259 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 20:51:47,259 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1867802227] [2019-12-07 20:51:47,259 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 20:51:47,259 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-07 20:51:47,259 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1647465254] [2019-12-07 20:51:47,260 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-12-07 20:51:47,260 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 20:51:47,260 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-12-07 20:51:47,260 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2019-12-07 20:51:47,260 INFO L87 Difference]: Start difference. First operand 1318 states and 2812 transitions. Second operand 8 states. [2019-12-07 20:51:47,739 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 20:51:47,739 INFO L93 Difference]: Finished difference Result 1661 states and 3478 transitions. [2019-12-07 20:51:47,739 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-12-07 20:51:47,739 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 69 [2019-12-07 20:51:47,740 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 20:51:47,740 INFO L225 Difference]: With dead ends: 1661 [2019-12-07 20:51:47,740 INFO L226 Difference]: Without dead ends: 1661 [2019-12-07 20:51:47,741 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 5 SyntacticMatches, 1 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=33, Invalid=99, Unknown=0, NotChecked=0, Total=132 [2019-12-07 20:51:47,743 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1661 states. [2019-12-07 20:51:47,749 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1661 to 1241. [2019-12-07 20:51:47,749 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1241 states. [2019-12-07 20:51:47,750 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1241 states to 1241 states and 2648 transitions. [2019-12-07 20:51:47,750 INFO L78 Accepts]: Start accepts. Automaton has 1241 states and 2648 transitions. Word has length 69 [2019-12-07 20:51:47,751 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 20:51:47,751 INFO L462 AbstractCegarLoop]: Abstraction has 1241 states and 2648 transitions. [2019-12-07 20:51:47,751 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-12-07 20:51:47,751 INFO L276 IsEmpty]: Start isEmpty. Operand 1241 states and 2648 transitions. [2019-12-07 20:51:47,752 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2019-12-07 20:51:47,752 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 20:51:47,752 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, 1, 1, 1, 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 20:51:47,752 INFO L410 AbstractCegarLoop]: === Iteration 14 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 20:51:47,752 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 20:51:47,752 INFO L82 PathProgramCache]: Analyzing trace with hash -1436867426, now seen corresponding path program 1 times [2019-12-07 20:51:47,752 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 20:51:47,753 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [926106249] [2019-12-07 20:51:47,753 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 20:51:47,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 20:51:47,823 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 20:51:47,823 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [926106249] [2019-12-07 20:51:47,824 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 20:51:47,824 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-07 20:51:47,824 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1899920230] [2019-12-07 20:51:47,824 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-07 20:51:47,824 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 20:51:47,824 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-07 20:51:47,824 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-12-07 20:51:47,824 INFO L87 Difference]: Start difference. First operand 1241 states and 2648 transitions. Second operand 6 states. [2019-12-07 20:51:47,907 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 20:51:47,907 INFO L93 Difference]: Finished difference Result 1733 states and 3668 transitions. [2019-12-07 20:51:47,907 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-07 20:51:47,907 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 69 [2019-12-07 20:51:47,907 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 20:51:47,907 INFO L225 Difference]: With dead ends: 1733 [2019-12-07 20:51:47,908 INFO L226 Difference]: Without dead ends: 433 [2019-12-07 20:51:47,908 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=44, Unknown=0, NotChecked=0, Total=72 [2019-12-07 20:51:47,908 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 433 states. [2019-12-07 20:51:47,910 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 433 to 381. [2019-12-07 20:51:47,910 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 381 states. [2019-12-07 20:51:47,911 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 381 states to 381 states and 688 transitions. [2019-12-07 20:51:47,911 INFO L78 Accepts]: Start accepts. Automaton has 381 states and 688 transitions. Word has length 69 [2019-12-07 20:51:47,911 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 20:51:47,911 INFO L462 AbstractCegarLoop]: Abstraction has 381 states and 688 transitions. [2019-12-07 20:51:47,911 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-07 20:51:47,911 INFO L276 IsEmpty]: Start isEmpty. Operand 381 states and 688 transitions. [2019-12-07 20:51:47,911 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2019-12-07 20:51:47,911 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 20:51:47,912 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, 1, 1, 1, 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 20:51:47,912 INFO L410 AbstractCegarLoop]: === Iteration 15 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 20:51:47,912 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 20:51:47,912 INFO L82 PathProgramCache]: Analyzing trace with hash 330528570, now seen corresponding path program 2 times [2019-12-07 20:51:47,912 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 20:51:47,912 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1554516512] [2019-12-07 20:51:47,912 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 20:51:47,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 20:51:47,937 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 20:51:47,937 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1554516512] [2019-12-07 20:51:47,937 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 20:51:47,938 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 20:51:47,938 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [199850646] [2019-12-07 20:51:47,938 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 20:51:47,938 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 20:51:47,938 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 20:51:47,938 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 20:51:47,938 INFO L87 Difference]: Start difference. First operand 381 states and 688 transitions. Second operand 3 states. [2019-12-07 20:51:47,945 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 20:51:47,945 INFO L93 Difference]: Finished difference Result 343 states and 597 transitions. [2019-12-07 20:51:47,946 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 20:51:47,946 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 69 [2019-12-07 20:51:47,946 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 20:51:47,946 INFO L225 Difference]: With dead ends: 343 [2019-12-07 20:51:47,946 INFO L226 Difference]: Without dead ends: 343 [2019-12-07 20:51:47,946 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 20:51:47,947 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 343 states. [2019-12-07 20:51:47,948 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 343 to 343. [2019-12-07 20:51:47,948 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 343 states. [2019-12-07 20:51:47,949 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 343 states to 343 states and 597 transitions. [2019-12-07 20:51:47,949 INFO L78 Accepts]: Start accepts. Automaton has 343 states and 597 transitions. Word has length 69 [2019-12-07 20:51:47,949 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 20:51:47,949 INFO L462 AbstractCegarLoop]: Abstraction has 343 states and 597 transitions. [2019-12-07 20:51:47,949 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 20:51:47,949 INFO L276 IsEmpty]: Start isEmpty. Operand 343 states and 597 transitions. [2019-12-07 20:51:47,950 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2019-12-07 20:51:47,950 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 20:51:47,950 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, 1, 1, 1, 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 20:51:47,950 INFO L410 AbstractCegarLoop]: === Iteration 16 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 20:51:47,950 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 20:51:47,950 INFO L82 PathProgramCache]: Analyzing trace with hash -1263040810, now seen corresponding path program 1 times [2019-12-07 20:51:47,950 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 20:51:47,950 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [275743094] [2019-12-07 20:51:47,950 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 20:51:47,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 20:51:48,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 20:51:48,130 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [275743094] [2019-12-07 20:51:48,131 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 20:51:48,131 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2019-12-07 20:51:48,131 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1538520011] [2019-12-07 20:51:48,131 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-12-07 20:51:48,131 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 20:51:48,131 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-12-07 20:51:48,131 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=104, Unknown=0, NotChecked=0, Total=132 [2019-12-07 20:51:48,131 INFO L87 Difference]: Start difference. First operand 343 states and 597 transitions. Second operand 12 states. [2019-12-07 20:51:48,642 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 20:51:48,642 INFO L93 Difference]: Finished difference Result 689 states and 1199 transitions. [2019-12-07 20:51:48,643 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-12-07 20:51:48,643 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 69 [2019-12-07 20:51:48,643 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 20:51:48,643 INFO L225 Difference]: With dead ends: 689 [2019-12-07 20:51:48,643 INFO L226 Difference]: Without dead ends: 689 [2019-12-07 20:51:48,644 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 39 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=85, Invalid=257, Unknown=0, NotChecked=0, Total=342 [2019-12-07 20:51:48,644 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 689 states. [2019-12-07 20:51:48,647 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 689 to 393. [2019-12-07 20:51:48,647 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 393 states. [2019-12-07 20:51:48,647 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 393 states to 393 states and 682 transitions. [2019-12-07 20:51:48,648 INFO L78 Accepts]: Start accepts. Automaton has 393 states and 682 transitions. Word has length 69 [2019-12-07 20:51:48,648 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 20:51:48,648 INFO L462 AbstractCegarLoop]: Abstraction has 393 states and 682 transitions. [2019-12-07 20:51:48,648 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-12-07 20:51:48,648 INFO L276 IsEmpty]: Start isEmpty. Operand 393 states and 682 transitions. [2019-12-07 20:51:48,648 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2019-12-07 20:51:48,648 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 20:51:48,649 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, 1, 1, 1, 1, 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 20:51:48,649 INFO L410 AbstractCegarLoop]: === Iteration 17 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 20:51:48,649 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 20:51:48,649 INFO L82 PathProgramCache]: Analyzing trace with hash -59017392, now seen corresponding path program 1 times [2019-12-07 20:51:48,649 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 20:51:48,649 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [197520429] [2019-12-07 20:51:48,649 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 20:51:48,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 20:51:48,682 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 20:51:48,682 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [197520429] [2019-12-07 20:51:48,682 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 20:51:48,682 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 20:51:48,683 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1938344141] [2019-12-07 20:51:48,683 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 20:51:48,683 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 20:51:48,683 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 20:51:48,683 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 20:51:48,683 INFO L87 Difference]: Start difference. First operand 393 states and 682 transitions. Second operand 3 states. [2019-12-07 20:51:48,704 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 20:51:48,704 INFO L93 Difference]: Finished difference Result 392 states and 680 transitions. [2019-12-07 20:51:48,705 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 20:51:48,705 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 70 [2019-12-07 20:51:48,705 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 20:51:48,705 INFO L225 Difference]: With dead ends: 392 [2019-12-07 20:51:48,705 INFO L226 Difference]: Without dead ends: 392 [2019-12-07 20:51:48,705 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 20:51:48,706 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 392 states. [2019-12-07 20:51:48,707 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 392 to 250. [2019-12-07 20:51:48,707 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 250 states. [2019-12-07 20:51:48,708 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 250 states to 250 states and 418 transitions. [2019-12-07 20:51:48,708 INFO L78 Accepts]: Start accepts. Automaton has 250 states and 418 transitions. Word has length 70 [2019-12-07 20:51:48,708 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 20:51:48,708 INFO L462 AbstractCegarLoop]: Abstraction has 250 states and 418 transitions. [2019-12-07 20:51:48,708 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 20:51:48,708 INFO L276 IsEmpty]: Start isEmpty. Operand 250 states and 418 transitions. [2019-12-07 20:51:48,709 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2019-12-07 20:51:48,709 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 20:51:48,709 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, 1, 1, 1, 1, 1, 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 20:51:48,709 INFO L410 AbstractCegarLoop]: === Iteration 18 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 20:51:48,709 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 20:51:48,709 INFO L82 PathProgramCache]: Analyzing trace with hash -642215500, now seen corresponding path program 1 times [2019-12-07 20:51:48,709 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 20:51:48,709 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1207777128] [2019-12-07 20:51:48,709 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 20:51:48,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-07 20:51:48,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-07 20:51:48,780 INFO L174 FreeRefinementEngine]: Strategy SIFA_TAIPAN found a feasible trace [2019-12-07 20:51:48,781 INFO L475 BasicCegarLoop]: Counterexample might be feasible [2019-12-07 20:51:48,783 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1001] [1001] ULTIMATE.startENTRY-->L797: Formula: (let ((.cse0 (store |v_#valid_51| 0 0))) (and (= 0 v_~y$read_delayed_var~0.base_6) (= 0 v_~weak$$choice0~0_155) (= v_~y~0_275 0) (= (store |v_#memory_int_18| |v_ULTIMATE.start_main_~#t1719~0.base_30| (store (select |v_#memory_int_18| |v_ULTIMATE.start_main_~#t1719~0.base_30|) |v_ULTIMATE.start_main_~#t1719~0.offset_22| 0)) |v_#memory_int_17|) (= v_~y$r_buff1_thd1~0_174 0) (= v_~y$read_delayed~0_7 0) (= v_~y$w_buff0_used~0_865 0) (= 0 v_~y$w_buff0~0_221) (= v_~y$w_buff1~0_203 0) (= v_~y$r_buff0_thd0~0_374 0) (< |v_#StackHeapBarrier_14| |v_ULTIMATE.start_main_~#t1719~0.base_30|) (= v_~y$r_buff1_thd0~0_352 0) (= v_~__unbuffered_p1_EBX~0_37 0) (= |v_#length_19| (store |v_#length_20| |v_ULTIMATE.start_main_~#t1719~0.base_30| 4)) (= v_~y$mem_tmp~0_168 0) (= v_~y$w_buff1_used~0_515 0) (= 0 v_~y$r_buff1_thd2~0_343) (= 0 v_~__unbuffered_p1_EAX~0_60) (= 0 v_~y$r_buff0_thd2~0_460) (< 0 |v_#StackHeapBarrier_14|) (= 0 |v_#NULL.base_4|) (= v_~weak$$choice2~0_236 0) (= v_~main$tmp_guard0~0_33 0) (= |v_#NULL.offset_4| 0) (= v_~x~0_25 0) (= (select .cse0 |v_ULTIMATE.start_main_~#t1719~0.base_30|) 0) (= v_~y$r_buff0_thd1~0_98 0) (= 0 v_~y$read_delayed_var~0.offset_6) (= 0 v_~__unbuffered_cnt~0_42) (= |v_ULTIMATE.start_main_~#t1719~0.offset_22| 0) (= |v_#valid_49| (store .cse0 |v_ULTIMATE.start_main_~#t1719~0.base_30| 1)) (= v_~main$tmp_guard1~0_40 0) (= v_~y$flush_delayed~0_204 0))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_14|, #valid=|v_#valid_51|, #memory_int=|v_#memory_int_18|, #length=|v_#length_20|} OutVars{#NULL.offset=|v_#NULL.offset_4|, ULTIMATE.start_main_#t~ite49=|v_ULTIMATE.start_main_#t~ite49_125|, ULTIMATE.start_main_#t~ite68=|v_ULTIMATE.start_main_#t~ite68_59|, ULTIMATE.start_main_#t~ite43=|v_ULTIMATE.start_main_#t~ite43_113|, ULTIMATE.start_main_#t~ite66=|v_ULTIMATE.start_main_#t~ite66_55|, ULTIMATE.start_main_#t~ite45=|v_ULTIMATE.start_main_#t~ite45_69|, ULTIMATE.start_main_#t~ite64=|v_ULTIMATE.start_main_#t~ite64_33|, ULTIMATE.start_main_#t~ite50=|v_ULTIMATE.start_main_#t~ite50_52|, ~y$read_delayed~0=v_~y$read_delayed~0_7, ULTIMATE.start_main_#t~ite52=|v_ULTIMATE.start_main_#t~ite52_59|, ~y$mem_tmp~0=v_~y$mem_tmp~0_168, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_60, ~y$r_buff0_thd1~0=v_~y$r_buff0_thd1~0_98, ~y$flush_delayed~0=v_~y$flush_delayed~0_204, #length=|v_#length_19|, ULTIMATE.start_main_#t~nondet47=|v_ULTIMATE.start_main_#t~nondet47_57|, ULTIMATE.start_main_#t~ite58=|v_ULTIMATE.start_main_#t~ite58_42|, ULTIMATE.start_main_#t~ite54=|v_ULTIMATE.start_main_#t~ite54_65|, ULTIMATE.start_main_#t~ite56=|v_ULTIMATE.start_main_#t~ite56_36|, ULTIMATE.start_main_#t~ite63=|v_ULTIMATE.start_main_#t~ite63_33|, ~weak$$choice0~0=v_~weak$$choice0~0_155, #StackHeapBarrier=|v_#StackHeapBarrier_14|, ULTIMATE.start_main_#t~ite40=|v_ULTIMATE.start_main_#t~ite40_49|, ULTIMATE.start_main_#t~ite61=|v_ULTIMATE.start_main_#t~ite61_83|, ~y$w_buff1~0=v_~y$w_buff1~0_203, ~y$read_delayed_var~0.base=v_~y$read_delayed_var~0.base_6, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_460, ULTIMATE.start_main_#t~nondet38=|v_ULTIMATE.start_main_#t~nondet38_10|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_42, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_352, ~x~0=v_~x~0_25, ~y$read_delayed_var~0.offset=v_~y$read_delayed_var~0.offset_6, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_865, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_40, ULTIMATE.start_main_#t~ite48=|v_ULTIMATE.start_main_#t~ite48_69|, ULTIMATE.start_main_#t~ite42=|v_ULTIMATE.start_main_#t~ite42_141|, ULTIMATE.start_main_#t~ite67=|v_ULTIMATE.start_main_#t~ite67_42|, ULTIMATE.start_main_#t~ite44=|v_ULTIMATE.start_main_#t~ite44_27|, ULTIMATE.start_main_#t~ite65=|v_ULTIMATE.start_main_#t~ite65_50|, ~y$r_buff1_thd1~0=v_~y$r_buff1_thd1~0_174, ULTIMATE.start_main_#t~ite51=|v_ULTIMATE.start_main_#t~ite51_61|, ULTIMATE.start_main_~#t1720~0.offset=|v_ULTIMATE.start_main_~#t1720~0.offset_22|, ~y$w_buff0~0=v_~y$w_buff0~0_221, ~y~0=v_~y~0_275, ULTIMATE.start_main_~#t1720~0.base=|v_ULTIMATE.start_main_~#t1720~0.base_30|, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_37, ULTIMATE.start_main_~#t1719~0.base=|v_ULTIMATE.start_main_~#t1719~0.base_30|, ULTIMATE.start_main_#t~nondet46=|v_ULTIMATE.start_main_#t~nondet46_57|, ULTIMATE.start_main_~#t1719~0.offset=|v_ULTIMATE.start_main_~#t1719~0.offset_22|, ULTIMATE.start_main_#t~ite57=|v_ULTIMATE.start_main_#t~ite57_40|, ULTIMATE.start_main_#t~ite59=|v_ULTIMATE.start_main_#t~ite59_105|, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_33, ULTIMATE.start_main_#t~ite53=|v_ULTIMATE.start_main_#t~ite53_62|, #NULL.base=|v_#NULL.base_4|, ULTIMATE.start_main_#t~ite55=|v_ULTIMATE.start_main_#t~ite55_95|, ULTIMATE.start_main_#t~ite62=|v_ULTIMATE.start_main_#t~ite62_32|, ~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_343, ULTIMATE.start_main_#t~ite41=|v_ULTIMATE.start_main_#t~ite41_32|, ULTIMATE.start_main_#t~ite60=|v_ULTIMATE.start_main_#t~ite60_162|, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_19|, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_374, #valid=|v_#valid_49|, #memory_int=|v_#memory_int_17|, ULTIMATE.start_main_#t~nondet39=|v_ULTIMATE.start_main_#t~nondet39_20|, ~weak$$choice2~0=v_~weak$$choice2~0_236, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_515} AuxVars[] AssignedVars[#NULL.offset, ULTIMATE.start_main_#t~ite49, ULTIMATE.start_main_#t~ite68, ULTIMATE.start_main_#t~ite43, ULTIMATE.start_main_#t~ite66, ULTIMATE.start_main_#t~ite45, ULTIMATE.start_main_#t~ite64, ULTIMATE.start_main_#t~ite50, ~y$read_delayed~0, ULTIMATE.start_main_#t~ite52, ~y$mem_tmp~0, ~__unbuffered_p1_EAX~0, ~y$r_buff0_thd1~0, ~y$flush_delayed~0, #length, ULTIMATE.start_main_#t~nondet47, ULTIMATE.start_main_#t~ite58, ULTIMATE.start_main_#t~ite54, ULTIMATE.start_main_#t~ite56, ULTIMATE.start_main_#t~ite63, ~weak$$choice0~0, ULTIMATE.start_main_#t~ite40, ULTIMATE.start_main_#t~ite61, ~y$w_buff1~0, ~y$read_delayed_var~0.base, ~y$r_buff0_thd2~0, ULTIMATE.start_main_#t~nondet38, ~__unbuffered_cnt~0, ~y$r_buff1_thd0~0, ~x~0, ~y$read_delayed_var~0.offset, ~y$w_buff0_used~0, ~main$tmp_guard1~0, ULTIMATE.start_main_#t~ite48, ULTIMATE.start_main_#t~ite42, ULTIMATE.start_main_#t~ite67, ULTIMATE.start_main_#t~ite44, ULTIMATE.start_main_#t~ite65, ~y$r_buff1_thd1~0, ULTIMATE.start_main_#t~ite51, ULTIMATE.start_main_~#t1720~0.offset, ~y$w_buff0~0, ~y~0, ULTIMATE.start_main_~#t1720~0.base, ~__unbuffered_p1_EBX~0, ULTIMATE.start_main_~#t1719~0.base, ULTIMATE.start_main_#t~nondet46, ULTIMATE.start_main_~#t1719~0.offset, ULTIMATE.start_main_#t~ite57, ULTIMATE.start_main_#t~ite59, ~main$tmp_guard0~0, ULTIMATE.start_main_#t~ite53, #NULL.base, ULTIMATE.start_main_#t~ite55, ULTIMATE.start_main_#t~ite62, ~y$r_buff1_thd2~0, ULTIMATE.start_main_#t~ite41, ULTIMATE.start_main_#t~ite60, ULTIMATE.start_main_#res, ~y$r_buff0_thd0~0, #valid, #memory_int, ULTIMATE.start_main_#t~nondet39, ~weak$$choice2~0, ~y$w_buff1_used~0] because there is no mapped edge [2019-12-07 20:51:48,784 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [978] [978] L797-1-->L799: Formula: (and (= |v_#memory_int_9| (store |v_#memory_int_10| |v_ULTIMATE.start_main_~#t1720~0.base_13| (store (select |v_#memory_int_10| |v_ULTIMATE.start_main_~#t1720~0.base_13|) |v_ULTIMATE.start_main_~#t1720~0.offset_11| 1))) (not (= 0 |v_ULTIMATE.start_main_~#t1720~0.base_13|)) (= |v_#length_11| (store |v_#length_12| |v_ULTIMATE.start_main_~#t1720~0.base_13| 4)) (= (select |v_#valid_27| |v_ULTIMATE.start_main_~#t1720~0.base_13|) 0) (< |v_#StackHeapBarrier_9| |v_ULTIMATE.start_main_~#t1720~0.base_13|) (= (store |v_#valid_27| |v_ULTIMATE.start_main_~#t1720~0.base_13| 1) |v_#valid_26|) (= 0 |v_ULTIMATE.start_main_~#t1720~0.offset_11|)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_9|, #valid=|v_#valid_27|, #memory_int=|v_#memory_int_10|, #length=|v_#length_12|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_9|, ULTIMATE.start_main_~#t1720~0.offset=|v_ULTIMATE.start_main_~#t1720~0.offset_11|, #valid=|v_#valid_26|, #memory_int=|v_#memory_int_9|, ULTIMATE.start_main_#t~nondet38=|v_ULTIMATE.start_main_#t~nondet38_6|, #length=|v_#length_11|, ULTIMATE.start_main_~#t1720~0.base=|v_ULTIMATE.start_main_~#t1720~0.base_13|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t1720~0.offset, #valid, #memory_int, ULTIMATE.start_main_#t~nondet38, #length, ULTIMATE.start_main_~#t1720~0.base] because there is no mapped edge [2019-12-07 20:51:48,784 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [865] [865] P1ENTRY-->L4-3: Formula: (and (= v_P1Thread1of1ForFork1_~arg.base_5 |v_P1Thread1of1ForFork1_#in~arg.base_7|) (= |v_P1Thread1of1ForFork1_#in~arg.offset_7| v_P1Thread1of1ForFork1_~arg.offset_5) (= v_~y$w_buff0_used~0_156 1) (= v_~y$w_buff0~0_36 v_~y$w_buff1~0_27) (= 2 v_~y$w_buff0~0_35) (= |v_P1Thread1of1ForFork1___VERIFIER_assert_#in~expression_5| (ite (not (and (not (= 0 (mod v_~y$w_buff0_used~0_156 256))) (not (= 0 (mod v_~y$w_buff1_used~0_77 256))))) 1 0)) (not (= v_P1Thread1of1ForFork1___VERIFIER_assert_~expression_7 0)) (= v_P1Thread1of1ForFork1___VERIFIER_assert_~expression_7 |v_P1Thread1of1ForFork1___VERIFIER_assert_#in~expression_5|) (= v_~y$w_buff1_used~0_77 v_~y$w_buff0_used~0_157)) InVars {~y$w_buff0_used~0=v_~y$w_buff0_used~0_157, ~y$w_buff0~0=v_~y$w_buff0~0_36, P1Thread1of1ForFork1_#in~arg.base=|v_P1Thread1of1ForFork1_#in~arg.base_7|, P1Thread1of1ForFork1_#in~arg.offset=|v_P1Thread1of1ForFork1_#in~arg.offset_7|} OutVars{P1Thread1of1ForFork1___VERIFIER_assert_~expression=v_P1Thread1of1ForFork1___VERIFIER_assert_~expression_7, P1Thread1of1ForFork1_~arg.offset=v_P1Thread1of1ForFork1_~arg.offset_5, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_156, ~y$w_buff1~0=v_~y$w_buff1~0_27, P1Thread1of1ForFork1___VERIFIER_assert_#in~expression=|v_P1Thread1of1ForFork1___VERIFIER_assert_#in~expression_5|, P1Thread1of1ForFork1_~arg.base=v_P1Thread1of1ForFork1_~arg.base_5, ~y$w_buff0~0=v_~y$w_buff0~0_35, P1Thread1of1ForFork1_#in~arg.base=|v_P1Thread1of1ForFork1_#in~arg.base_7|, P1Thread1of1ForFork1_#in~arg.offset=|v_P1Thread1of1ForFork1_#in~arg.offset_7|, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_77} AuxVars[] AssignedVars[P1Thread1of1ForFork1___VERIFIER_assert_~expression, P1Thread1of1ForFork1_~arg.offset, ~y$w_buff0_used~0, ~y$w_buff1~0, P1Thread1of1ForFork1___VERIFIER_assert_#in~expression, P1Thread1of1ForFork1_~arg.base, ~y$w_buff0~0, ~y$w_buff1_used~0] because there is no mapped edge [2019-12-07 20:51:48,785 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [953] [953] L759-2-->L759-5: Formula: (let ((.cse0 (= |P1Thread1of1ForFork1_#t~ite12_Out-1835825323| |P1Thread1of1ForFork1_#t~ite11_Out-1835825323|)) (.cse2 (= (mod ~y$w_buff0_used~0_In-1835825323 256) 0)) (.cse1 (= (mod ~y$r_buff0_thd2~0_In-1835825323 256) 0))) (or (and (= ~y$w_buff0~0_In-1835825323 |P1Thread1of1ForFork1_#t~ite11_Out-1835825323|) .cse0 (not .cse1) (not .cse2)) (and .cse0 (or .cse2 .cse1) (= ~y$w_buff1~0_In-1835825323 |P1Thread1of1ForFork1_#t~ite11_Out-1835825323|)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-1835825323, ~y$w_buff1~0=~y$w_buff1~0_In-1835825323, ~y$w_buff0~0=~y$w_buff0~0_In-1835825323, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-1835825323} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-1835825323, ~y$w_buff1~0=~y$w_buff1~0_In-1835825323, ~y$w_buff0~0=~y$w_buff0~0_In-1835825323, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-1835825323, P1Thread1of1ForFork1_#t~ite11=|P1Thread1of1ForFork1_#t~ite11_Out-1835825323|, P1Thread1of1ForFork1_#t~ite12=|P1Thread1of1ForFork1_#t~ite12_Out-1835825323|} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite11, P1Thread1of1ForFork1_#t~ite12] because there is no mapped edge [2019-12-07 20:51:48,787 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [899] [899] L764-->L765: Formula: (and (= v_~y$r_buff0_thd2~0_138 v_~y$r_buff0_thd2~0_137) (not (= 0 (mod v_~weak$$choice2~0_59 256)))) InVars {~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_138, ~weak$$choice2~0=v_~weak$$choice2~0_59} OutVars{~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_137, P1Thread1of1ForFork1_#t~ite27=|v_P1Thread1of1ForFork1_#t~ite27_7|, ~weak$$choice2~0=v_~weak$$choice2~0_59, P1Thread1of1ForFork1_#t~ite25=|v_P1Thread1of1ForFork1_#t~ite25_15|, P1Thread1of1ForFork1_#t~ite26=|v_P1Thread1of1ForFork1_#t~ite26_9|} AuxVars[] AssignedVars[~y$r_buff0_thd2~0, P1Thread1of1ForFork1_#t~ite27, P1Thread1of1ForFork1_#t~ite25, P1Thread1of1ForFork1_#t~ite26] because there is no mapped edge [2019-12-07 20:51:48,787 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [946] [946] L767-->L767-2: Formula: (let ((.cse0 (= (mod ~y$flush_delayed~0_In-1021033594 256) 0))) (or (and (= |P1Thread1of1ForFork1_#t~ite31_Out-1021033594| ~y$mem_tmp~0_In-1021033594) (not .cse0)) (and (= |P1Thread1of1ForFork1_#t~ite31_Out-1021033594| ~y~0_In-1021033594) .cse0))) InVars {~y$mem_tmp~0=~y$mem_tmp~0_In-1021033594, ~y$flush_delayed~0=~y$flush_delayed~0_In-1021033594, ~y~0=~y~0_In-1021033594} OutVars{~y$mem_tmp~0=~y$mem_tmp~0_In-1021033594, P1Thread1of1ForFork1_#t~ite31=|P1Thread1of1ForFork1_#t~ite31_Out-1021033594|, ~y$flush_delayed~0=~y$flush_delayed~0_In-1021033594, ~y~0=~y~0_In-1021033594} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite31] because there is no mapped edge [2019-12-07 20:51:48,788 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [947] [947] L730-2-->L730-5: Formula: (let ((.cse1 (= (mod ~y$r_buff1_thd1~0_In-519854573 256) 0)) (.cse0 (= 0 (mod ~y$w_buff1_used~0_In-519854573 256))) (.cse2 (= |P0Thread1of1ForFork0_#t~ite3_Out-519854573| |P0Thread1of1ForFork0_#t~ite4_Out-519854573|))) (or (and (= |P0Thread1of1ForFork0_#t~ite3_Out-519854573| ~y$w_buff1~0_In-519854573) (not .cse0) (not .cse1) .cse2) (and (or .cse1 .cse0) .cse2 (= |P0Thread1of1ForFork0_#t~ite3_Out-519854573| ~y~0_In-519854573)))) InVars {~y$r_buff1_thd1~0=~y$r_buff1_thd1~0_In-519854573, ~y$w_buff1~0=~y$w_buff1~0_In-519854573, ~y~0=~y~0_In-519854573, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-519854573} OutVars{~y$r_buff1_thd1~0=~y$r_buff1_thd1~0_In-519854573, P0Thread1of1ForFork0_#t~ite3=|P0Thread1of1ForFork0_#t~ite3_Out-519854573|, P0Thread1of1ForFork0_#t~ite4=|P0Thread1of1ForFork0_#t~ite4_Out-519854573|, ~y$w_buff1~0=~y$w_buff1~0_In-519854573, ~y~0=~y~0_In-519854573, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-519854573} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite3, P0Thread1of1ForFork0_#t~ite4] because there is no mapped edge [2019-12-07 20:51:48,789 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [924] [924] L731-->L731-2: Formula: (let ((.cse0 (= 0 (mod ~y$w_buff0_used~0_In-413408700 256))) (.cse1 (= 0 (mod ~y$r_buff0_thd1~0_In-413408700 256)))) (or (and (not .cse0) (not .cse1) (= |P0Thread1of1ForFork0_#t~ite5_Out-413408700| 0)) (and (= |P0Thread1of1ForFork0_#t~ite5_Out-413408700| ~y$w_buff0_used~0_In-413408700) (or .cse0 .cse1)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-413408700, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In-413408700} OutVars{P0Thread1of1ForFork0_#t~ite5=|P0Thread1of1ForFork0_#t~ite5_Out-413408700|, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-413408700, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In-413408700} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite5] because there is no mapped edge [2019-12-07 20:51:48,789 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [944] [944] L732-->L732-2: Formula: (let ((.cse2 (= 0 (mod ~y$r_buff1_thd1~0_In-1228590452 256))) (.cse3 (= (mod ~y$w_buff1_used~0_In-1228590452 256) 0)) (.cse0 (= (mod ~y$r_buff0_thd1~0_In-1228590452 256) 0)) (.cse1 (= (mod ~y$w_buff0_used~0_In-1228590452 256) 0))) (or (and (or .cse0 .cse1) (= ~y$w_buff1_used~0_In-1228590452 |P0Thread1of1ForFork0_#t~ite6_Out-1228590452|) (or .cse2 .cse3)) (and (= 0 |P0Thread1of1ForFork0_#t~ite6_Out-1228590452|) (or (and (not .cse2) (not .cse3)) (and (not .cse0) (not .cse1)))))) InVars {~y$r_buff1_thd1~0=~y$r_buff1_thd1~0_In-1228590452, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-1228590452, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In-1228590452, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1228590452} OutVars{P0Thread1of1ForFork0_#t~ite6=|P0Thread1of1ForFork0_#t~ite6_Out-1228590452|, ~y$r_buff1_thd1~0=~y$r_buff1_thd1~0_In-1228590452, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-1228590452, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In-1228590452, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1228590452} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite6] because there is no mapped edge [2019-12-07 20:51:48,789 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [948] [948] L733-->L733-2: Formula: (let ((.cse1 (= (mod ~y$r_buff0_thd1~0_In-2061871683 256) 0)) (.cse0 (= (mod ~y$w_buff0_used~0_In-2061871683 256) 0))) (or (and (= 0 |P0Thread1of1ForFork0_#t~ite7_Out-2061871683|) (not .cse0) (not .cse1)) (and (or .cse1 .cse0) (= ~y$r_buff0_thd1~0_In-2061871683 |P0Thread1of1ForFork0_#t~ite7_Out-2061871683|)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-2061871683, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In-2061871683} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-2061871683, P0Thread1of1ForFork0_#t~ite7=|P0Thread1of1ForFork0_#t~ite7_Out-2061871683|, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In-2061871683} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite7] because there is no mapped edge [2019-12-07 20:51:48,790 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [933] [933] L734-->L734-2: Formula: (let ((.cse0 (= (mod ~y$w_buff0_used~0_In481089523 256) 0)) (.cse1 (= (mod ~y$r_buff0_thd1~0_In481089523 256) 0)) (.cse3 (= (mod ~y$w_buff1_used~0_In481089523 256) 0)) (.cse2 (= (mod ~y$r_buff1_thd1~0_In481089523 256) 0))) (or (and (= |P0Thread1of1ForFork0_#t~ite8_Out481089523| 0) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse0 .cse1) (or .cse3 .cse2) (= |P0Thread1of1ForFork0_#t~ite8_Out481089523| ~y$r_buff1_thd1~0_In481089523)))) InVars {~y$r_buff1_thd1~0=~y$r_buff1_thd1~0_In481089523, ~y$w_buff0_used~0=~y$w_buff0_used~0_In481089523, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In481089523, ~y$w_buff1_used~0=~y$w_buff1_used~0_In481089523} OutVars{~y$r_buff1_thd1~0=~y$r_buff1_thd1~0_In481089523, ~y$w_buff0_used~0=~y$w_buff0_used~0_In481089523, P0Thread1of1ForFork0_#t~ite8=|P0Thread1of1ForFork0_#t~ite8_Out481089523|, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In481089523, ~y$w_buff1_used~0=~y$w_buff1_used~0_In481089523} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite8] because there is no mapped edge [2019-12-07 20:51:48,790 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [977] [977] L734-2-->P0EXIT: Formula: (and (= |v_P0Thread1of1ForFork0_#res.offset_3| 0) (= v_~y$r_buff1_thd1~0_141 |v_P0Thread1of1ForFork0_#t~ite8_24|) (= 0 |v_P0Thread1of1ForFork0_#res.base_3|) (= v_~__unbuffered_cnt~0_31 (+ v_~__unbuffered_cnt~0_32 1))) InVars {P0Thread1of1ForFork0_#t~ite8=|v_P0Thread1of1ForFork0_#t~ite8_24|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_32} OutVars{~y$r_buff1_thd1~0=v_~y$r_buff1_thd1~0_141, P0Thread1of1ForFork0_#res.offset=|v_P0Thread1of1ForFork0_#res.offset_3|, P0Thread1of1ForFork0_#t~ite8=|v_P0Thread1of1ForFork0_#t~ite8_23|, P0Thread1of1ForFork0_#res.base=|v_P0Thread1of1ForFork0_#res.base_3|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_31} AuxVars[] AssignedVars[~y$r_buff1_thd1~0, P0Thread1of1ForFork0_#res.offset, P0Thread1of1ForFork0_#t~ite8, P0Thread1of1ForFork0_#res.base, ~__unbuffered_cnt~0] because there is no mapped edge [2019-12-07 20:51:48,790 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [930] [930] L775-->L775-2: Formula: (let ((.cse0 (= 0 (mod ~y$r_buff0_thd2~0_In418320366 256))) (.cse1 (= 0 (mod ~y$w_buff0_used~0_In418320366 256)))) (or (and (= |P1Thread1of1ForFork1_#t~ite34_Out418320366| ~y$w_buff0_used~0_In418320366) (or .cse0 .cse1)) (and (= |P1Thread1of1ForFork1_#t~ite34_Out418320366| 0) (not .cse0) (not .cse1)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In418320366, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In418320366} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In418320366, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In418320366, P1Thread1of1ForFork1_#t~ite34=|P1Thread1of1ForFork1_#t~ite34_Out418320366|} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite34] because there is no mapped edge [2019-12-07 20:51:48,790 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [939] [939] L776-->L776-2: Formula: (let ((.cse2 (= 0 (mod ~y$w_buff1_used~0_In-1137223981 256))) (.cse3 (= (mod ~y$r_buff1_thd2~0_In-1137223981 256) 0)) (.cse0 (= 0 (mod ~y$w_buff0_used~0_In-1137223981 256))) (.cse1 (= 0 (mod ~y$r_buff0_thd2~0_In-1137223981 256)))) (or (and (= |P1Thread1of1ForFork1_#t~ite35_Out-1137223981| ~y$w_buff1_used~0_In-1137223981) (or .cse0 .cse1) (or .cse2 .cse3)) (and (= |P1Thread1of1ForFork1_#t~ite35_Out-1137223981| 0) (or (and (not .cse2) (not .cse3)) (and (not .cse0) (not .cse1)))))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-1137223981, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-1137223981, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-1137223981, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1137223981} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-1137223981, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-1137223981, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-1137223981, P1Thread1of1ForFork1_#t~ite35=|P1Thread1of1ForFork1_#t~ite35_Out-1137223981|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1137223981} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite35] because there is no mapped edge [2019-12-07 20:51:48,791 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [952] [952] L777-->L778: Formula: (let ((.cse1 (= (mod ~y$w_buff0_used~0_In1773894158 256) 0)) (.cse2 (= (mod ~y$r_buff0_thd2~0_In1773894158 256) 0)) (.cse0 (= ~y$r_buff0_thd2~0_In1773894158 ~y$r_buff0_thd2~0_Out1773894158))) (or (and .cse0 .cse1) (and (not .cse2) (not .cse1) (= 0 ~y$r_buff0_thd2~0_Out1773894158)) (and .cse2 .cse0))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In1773894158, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In1773894158} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In1773894158, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_Out1773894158, P1Thread1of1ForFork1_#t~ite36=|P1Thread1of1ForFork1_#t~ite36_Out1773894158|} AuxVars[] AssignedVars[~y$r_buff0_thd2~0, P1Thread1of1ForFork1_#t~ite36] because there is no mapped edge [2019-12-07 20:51:48,791 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [936] [936] L778-->L778-2: Formula: (let ((.cse0 (= (mod ~y$r_buff0_thd2~0_In-2006956485 256) 0)) (.cse1 (= (mod ~y$w_buff0_used~0_In-2006956485 256) 0)) (.cse3 (= (mod ~y$w_buff1_used~0_In-2006956485 256) 0)) (.cse2 (= 0 (mod ~y$r_buff1_thd2~0_In-2006956485 256)))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= |P1Thread1of1ForFork1_#t~ite37_Out-2006956485| 0)) (and (= |P1Thread1of1ForFork1_#t~ite37_Out-2006956485| ~y$r_buff1_thd2~0_In-2006956485) (or .cse0 .cse1) (or .cse3 .cse2)))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-2006956485, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-2006956485, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-2006956485, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-2006956485} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-2006956485, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-2006956485, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-2006956485, P1Thread1of1ForFork1_#t~ite37=|P1Thread1of1ForFork1_#t~ite37_Out-2006956485|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-2006956485} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite37] because there is no mapped edge [2019-12-07 20:51:48,791 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [965] [965] L778-2-->P1EXIT: Formula: (and (= (+ v_~__unbuffered_cnt~0_22 1) v_~__unbuffered_cnt~0_21) (= v_~y$r_buff1_thd2~0_155 |v_P1Thread1of1ForFork1_#t~ite37_20|) (= 0 |v_P1Thread1of1ForFork1_#res.base_3|) (= |v_P1Thread1of1ForFork1_#res.offset_3| 0)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_22, P1Thread1of1ForFork1_#t~ite37=|v_P1Thread1of1ForFork1_#t~ite37_20|} OutVars{~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_155, P1Thread1of1ForFork1_#res.offset=|v_P1Thread1of1ForFork1_#res.offset_3|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_21, P1Thread1of1ForFork1_#res.base=|v_P1Thread1of1ForFork1_#res.base_3|, P1Thread1of1ForFork1_#t~ite37=|v_P1Thread1of1ForFork1_#t~ite37_19|} AuxVars[] AssignedVars[~y$r_buff1_thd2~0, P1Thread1of1ForFork1_#res.offset, ~__unbuffered_cnt~0, P1Thread1of1ForFork1_#res.base, P1Thread1of1ForFork1_#t~ite37] because there is no mapped edge [2019-12-07 20:51:48,791 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [860] [860] L803-->L805-2: Formula: (and (or (= 0 (mod v_~y$r_buff0_thd0~0_55 256)) (= (mod v_~y$w_buff0_used~0_124 256) 0)) (not (= 0 (mod v_~main$tmp_guard0~0_5 256)))) InVars {~y$w_buff0_used~0=v_~y$w_buff0_used~0_124, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_55, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_5} OutVars{~y$w_buff0_used~0=v_~y$w_buff0_used~0_124, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_55, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_5} AuxVars[] AssignedVars[] because there is no mapped edge [2019-12-07 20:51:48,791 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [931] [931] L805-2-->L805-4: Formula: (let ((.cse1 (= 0 (mod ~y$w_buff1_used~0_In1851184601 256))) (.cse0 (= (mod ~y$r_buff1_thd0~0_In1851184601 256) 0))) (or (and (not .cse0) (not .cse1) (= ~y$w_buff1~0_In1851184601 |ULTIMATE.start_main_#t~ite40_Out1851184601|)) (and (= ~y~0_In1851184601 |ULTIMATE.start_main_#t~ite40_Out1851184601|) (or .cse1 .cse0)))) InVars {~y$w_buff1~0=~y$w_buff1~0_In1851184601, ~y~0=~y~0_In1851184601, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In1851184601, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1851184601} OutVars{ULTIMATE.start_main_#t~ite40=|ULTIMATE.start_main_#t~ite40_Out1851184601|, ~y$w_buff1~0=~y$w_buff1~0_In1851184601, ~y~0=~y~0_In1851184601, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In1851184601, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1851184601} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite40] because there is no mapped edge [2019-12-07 20:51:48,791 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [894] [894] L805-4-->L806: Formula: (= v_~y~0_55 |v_ULTIMATE.start_main_#t~ite40_13|) InVars {ULTIMATE.start_main_#t~ite40=|v_ULTIMATE.start_main_#t~ite40_13|} OutVars{ULTIMATE.start_main_#t~ite41=|v_ULTIMATE.start_main_#t~ite41_7|, ULTIMATE.start_main_#t~ite40=|v_ULTIMATE.start_main_#t~ite40_12|, ~y~0=v_~y~0_55} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite41, ULTIMATE.start_main_#t~ite40, ~y~0] because there is no mapped edge [2019-12-07 20:51:48,792 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [925] [925] L806-->L806-2: Formula: (let ((.cse1 (= 0 (mod ~y$r_buff0_thd0~0_In-1969275688 256))) (.cse0 (= 0 (mod ~y$w_buff0_used~0_In-1969275688 256)))) (or (and (not .cse0) (= 0 |ULTIMATE.start_main_#t~ite42_Out-1969275688|) (not .cse1)) (and (or .cse1 .cse0) (= ~y$w_buff0_used~0_In-1969275688 |ULTIMATE.start_main_#t~ite42_Out-1969275688|)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-1969275688, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-1969275688} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-1969275688, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-1969275688, ULTIMATE.start_main_#t~ite42=|ULTIMATE.start_main_#t~ite42_Out-1969275688|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite42] because there is no mapped edge [2019-12-07 20:51:48,792 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [926] [926] L807-->L807-2: Formula: (let ((.cse1 (= (mod ~y$r_buff1_thd0~0_In-1720999036 256) 0)) (.cse0 (= 0 (mod ~y$w_buff1_used~0_In-1720999036 256))) (.cse3 (= (mod ~y$w_buff0_used~0_In-1720999036 256) 0)) (.cse2 (= (mod ~y$r_buff0_thd0~0_In-1720999036 256) 0))) (or (and (= ~y$w_buff1_used~0_In-1720999036 |ULTIMATE.start_main_#t~ite43_Out-1720999036|) (or .cse0 .cse1) (or .cse2 .cse3)) (and (= 0 |ULTIMATE.start_main_#t~ite43_Out-1720999036|) (or (and (not .cse1) (not .cse0)) (and (not .cse3) (not .cse2)))))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-1720999036, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-1720999036, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-1720999036, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1720999036} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-1720999036, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-1720999036, ULTIMATE.start_main_#t~ite43=|ULTIMATE.start_main_#t~ite43_Out-1720999036|, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-1720999036, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1720999036} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite43] because there is no mapped edge [2019-12-07 20:51:48,792 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [940] [940] L808-->L808-2: Formula: (let ((.cse1 (= 0 (mod ~y$w_buff0_used~0_In-1595383810 256))) (.cse0 (= (mod ~y$r_buff0_thd0~0_In-1595383810 256) 0))) (or (and (= |ULTIMATE.start_main_#t~ite44_Out-1595383810| 0) (not .cse0) (not .cse1)) (and (= |ULTIMATE.start_main_#t~ite44_Out-1595383810| ~y$r_buff0_thd0~0_In-1595383810) (or .cse1 .cse0)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-1595383810, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-1595383810} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-1595383810, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-1595383810, ULTIMATE.start_main_#t~ite44=|ULTIMATE.start_main_#t~ite44_Out-1595383810|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite44] because there is no mapped edge [2019-12-07 20:51:48,793 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [950] [950] L809-->L809-2: Formula: (let ((.cse0 (= (mod ~y$w_buff0_used~0_In1057340463 256) 0)) (.cse1 (= 0 (mod ~y$r_buff0_thd0~0_In1057340463 256))) (.cse2 (= (mod ~y$w_buff1_used~0_In1057340463 256) 0)) (.cse3 (= (mod ~y$r_buff1_thd0~0_In1057340463 256) 0))) (or (and (or .cse0 .cse1) (or .cse2 .cse3) (= |ULTIMATE.start_main_#t~ite45_Out1057340463| ~y$r_buff1_thd0~0_In1057340463)) (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= |ULTIMATE.start_main_#t~ite45_Out1057340463| 0)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In1057340463, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In1057340463, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In1057340463, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1057340463} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In1057340463, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In1057340463, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In1057340463, ULTIMATE.start_main_#t~ite45=|ULTIMATE.start_main_#t~ite45_Out1057340463|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1057340463} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite45] because there is no mapped edge [2019-12-07 20:51:48,796 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [941] [941] L824-->L824-2: Formula: (let ((.cse0 (= (mod ~y$flush_delayed~0_In1505559765 256) 0))) (or (and (= ~y~0_In1505559765 |ULTIMATE.start_main_#t~ite68_Out1505559765|) .cse0) (and (not .cse0) (= |ULTIMATE.start_main_#t~ite68_Out1505559765| ~y$mem_tmp~0_In1505559765)))) InVars {~y$mem_tmp~0=~y$mem_tmp~0_In1505559765, ~y$flush_delayed~0=~y$flush_delayed~0_In1505559765, ~y~0=~y~0_In1505559765} OutVars{~y$mem_tmp~0=~y$mem_tmp~0_In1505559765, ~y$flush_delayed~0=~y$flush_delayed~0_In1505559765, ULTIMATE.start_main_#t~ite68=|ULTIMATE.start_main_#t~ite68_Out1505559765|, ~y~0=~y~0_In1505559765} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite68] because there is no mapped edge [2019-12-07 20:51:48,796 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [992] [992] L824-2-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= v_~y~0_262 |v_ULTIMATE.start_main_#t~ite68_40|) (= v_ULTIMATE.start___VERIFIER_assert_~expression_15 |v_ULTIMATE.start___VERIFIER_assert_#in~expression_11|) (= v_ULTIMATE.start___VERIFIER_assert_~expression_15 0) (= (mod v_~main$tmp_guard1~0_29 256) |v_ULTIMATE.start___VERIFIER_assert_#in~expression_11|) (= v_~y$flush_delayed~0_189 0)) InVars {~main$tmp_guard1~0=v_~main$tmp_guard1~0_29, ULTIMATE.start_main_#t~ite68=|v_ULTIMATE.start_main_#t~ite68_40|} OutVars{ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_15, ~y$flush_delayed~0=v_~y$flush_delayed~0_189, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_29, ULTIMATE.start_main_#t~ite68=|v_ULTIMATE.start_main_#t~ite68_39|, ~y~0=v_~y~0_262, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_11|} AuxVars[] AssignedVars[ULTIMATE.start___VERIFIER_assert_~expression, ~y$flush_delayed~0, ULTIMATE.start_main_#t~ite68, ~y~0, ULTIMATE.start___VERIFIER_assert_#in~expression] because there is no mapped edge [2019-12-07 20:51:48,855 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 07.12 08:51:48 BasicIcfg [2019-12-07 20:51:48,855 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-07 20:51:48,855 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-12-07 20:51:48,855 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-12-07 20:51:48,855 INFO L275 PluginConnector]: Witness Printer initialized [2019-12-07 20:51:48,855 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 08:51:32" (3/4) ... [2019-12-07 20:51:48,857 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2019-12-07 20:51:48,857 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1001] [1001] ULTIMATE.startENTRY-->L797: Formula: (let ((.cse0 (store |v_#valid_51| 0 0))) (and (= 0 v_~y$read_delayed_var~0.base_6) (= 0 v_~weak$$choice0~0_155) (= v_~y~0_275 0) (= (store |v_#memory_int_18| |v_ULTIMATE.start_main_~#t1719~0.base_30| (store (select |v_#memory_int_18| |v_ULTIMATE.start_main_~#t1719~0.base_30|) |v_ULTIMATE.start_main_~#t1719~0.offset_22| 0)) |v_#memory_int_17|) (= v_~y$r_buff1_thd1~0_174 0) (= v_~y$read_delayed~0_7 0) (= v_~y$w_buff0_used~0_865 0) (= 0 v_~y$w_buff0~0_221) (= v_~y$w_buff1~0_203 0) (= v_~y$r_buff0_thd0~0_374 0) (< |v_#StackHeapBarrier_14| |v_ULTIMATE.start_main_~#t1719~0.base_30|) (= v_~y$r_buff1_thd0~0_352 0) (= v_~__unbuffered_p1_EBX~0_37 0) (= |v_#length_19| (store |v_#length_20| |v_ULTIMATE.start_main_~#t1719~0.base_30| 4)) (= v_~y$mem_tmp~0_168 0) (= v_~y$w_buff1_used~0_515 0) (= 0 v_~y$r_buff1_thd2~0_343) (= 0 v_~__unbuffered_p1_EAX~0_60) (= 0 v_~y$r_buff0_thd2~0_460) (< 0 |v_#StackHeapBarrier_14|) (= 0 |v_#NULL.base_4|) (= v_~weak$$choice2~0_236 0) (= v_~main$tmp_guard0~0_33 0) (= |v_#NULL.offset_4| 0) (= v_~x~0_25 0) (= (select .cse0 |v_ULTIMATE.start_main_~#t1719~0.base_30|) 0) (= v_~y$r_buff0_thd1~0_98 0) (= 0 v_~y$read_delayed_var~0.offset_6) (= 0 v_~__unbuffered_cnt~0_42) (= |v_ULTIMATE.start_main_~#t1719~0.offset_22| 0) (= |v_#valid_49| (store .cse0 |v_ULTIMATE.start_main_~#t1719~0.base_30| 1)) (= v_~main$tmp_guard1~0_40 0) (= v_~y$flush_delayed~0_204 0))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_14|, #valid=|v_#valid_51|, #memory_int=|v_#memory_int_18|, #length=|v_#length_20|} OutVars{#NULL.offset=|v_#NULL.offset_4|, ULTIMATE.start_main_#t~ite49=|v_ULTIMATE.start_main_#t~ite49_125|, ULTIMATE.start_main_#t~ite68=|v_ULTIMATE.start_main_#t~ite68_59|, ULTIMATE.start_main_#t~ite43=|v_ULTIMATE.start_main_#t~ite43_113|, ULTIMATE.start_main_#t~ite66=|v_ULTIMATE.start_main_#t~ite66_55|, ULTIMATE.start_main_#t~ite45=|v_ULTIMATE.start_main_#t~ite45_69|, ULTIMATE.start_main_#t~ite64=|v_ULTIMATE.start_main_#t~ite64_33|, ULTIMATE.start_main_#t~ite50=|v_ULTIMATE.start_main_#t~ite50_52|, ~y$read_delayed~0=v_~y$read_delayed~0_7, ULTIMATE.start_main_#t~ite52=|v_ULTIMATE.start_main_#t~ite52_59|, ~y$mem_tmp~0=v_~y$mem_tmp~0_168, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_60, ~y$r_buff0_thd1~0=v_~y$r_buff0_thd1~0_98, ~y$flush_delayed~0=v_~y$flush_delayed~0_204, #length=|v_#length_19|, ULTIMATE.start_main_#t~nondet47=|v_ULTIMATE.start_main_#t~nondet47_57|, ULTIMATE.start_main_#t~ite58=|v_ULTIMATE.start_main_#t~ite58_42|, ULTIMATE.start_main_#t~ite54=|v_ULTIMATE.start_main_#t~ite54_65|, ULTIMATE.start_main_#t~ite56=|v_ULTIMATE.start_main_#t~ite56_36|, ULTIMATE.start_main_#t~ite63=|v_ULTIMATE.start_main_#t~ite63_33|, ~weak$$choice0~0=v_~weak$$choice0~0_155, #StackHeapBarrier=|v_#StackHeapBarrier_14|, ULTIMATE.start_main_#t~ite40=|v_ULTIMATE.start_main_#t~ite40_49|, ULTIMATE.start_main_#t~ite61=|v_ULTIMATE.start_main_#t~ite61_83|, ~y$w_buff1~0=v_~y$w_buff1~0_203, ~y$read_delayed_var~0.base=v_~y$read_delayed_var~0.base_6, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_460, ULTIMATE.start_main_#t~nondet38=|v_ULTIMATE.start_main_#t~nondet38_10|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_42, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_352, ~x~0=v_~x~0_25, ~y$read_delayed_var~0.offset=v_~y$read_delayed_var~0.offset_6, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_865, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_40, ULTIMATE.start_main_#t~ite48=|v_ULTIMATE.start_main_#t~ite48_69|, ULTIMATE.start_main_#t~ite42=|v_ULTIMATE.start_main_#t~ite42_141|, ULTIMATE.start_main_#t~ite67=|v_ULTIMATE.start_main_#t~ite67_42|, ULTIMATE.start_main_#t~ite44=|v_ULTIMATE.start_main_#t~ite44_27|, ULTIMATE.start_main_#t~ite65=|v_ULTIMATE.start_main_#t~ite65_50|, ~y$r_buff1_thd1~0=v_~y$r_buff1_thd1~0_174, ULTIMATE.start_main_#t~ite51=|v_ULTIMATE.start_main_#t~ite51_61|, ULTIMATE.start_main_~#t1720~0.offset=|v_ULTIMATE.start_main_~#t1720~0.offset_22|, ~y$w_buff0~0=v_~y$w_buff0~0_221, ~y~0=v_~y~0_275, ULTIMATE.start_main_~#t1720~0.base=|v_ULTIMATE.start_main_~#t1720~0.base_30|, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_37, ULTIMATE.start_main_~#t1719~0.base=|v_ULTIMATE.start_main_~#t1719~0.base_30|, ULTIMATE.start_main_#t~nondet46=|v_ULTIMATE.start_main_#t~nondet46_57|, ULTIMATE.start_main_~#t1719~0.offset=|v_ULTIMATE.start_main_~#t1719~0.offset_22|, ULTIMATE.start_main_#t~ite57=|v_ULTIMATE.start_main_#t~ite57_40|, ULTIMATE.start_main_#t~ite59=|v_ULTIMATE.start_main_#t~ite59_105|, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_33, ULTIMATE.start_main_#t~ite53=|v_ULTIMATE.start_main_#t~ite53_62|, #NULL.base=|v_#NULL.base_4|, ULTIMATE.start_main_#t~ite55=|v_ULTIMATE.start_main_#t~ite55_95|, ULTIMATE.start_main_#t~ite62=|v_ULTIMATE.start_main_#t~ite62_32|, ~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_343, ULTIMATE.start_main_#t~ite41=|v_ULTIMATE.start_main_#t~ite41_32|, ULTIMATE.start_main_#t~ite60=|v_ULTIMATE.start_main_#t~ite60_162|, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_19|, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_374, #valid=|v_#valid_49|, #memory_int=|v_#memory_int_17|, ULTIMATE.start_main_#t~nondet39=|v_ULTIMATE.start_main_#t~nondet39_20|, ~weak$$choice2~0=v_~weak$$choice2~0_236, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_515} AuxVars[] AssignedVars[#NULL.offset, ULTIMATE.start_main_#t~ite49, ULTIMATE.start_main_#t~ite68, ULTIMATE.start_main_#t~ite43, ULTIMATE.start_main_#t~ite66, ULTIMATE.start_main_#t~ite45, ULTIMATE.start_main_#t~ite64, ULTIMATE.start_main_#t~ite50, ~y$read_delayed~0, ULTIMATE.start_main_#t~ite52, ~y$mem_tmp~0, ~__unbuffered_p1_EAX~0, ~y$r_buff0_thd1~0, ~y$flush_delayed~0, #length, ULTIMATE.start_main_#t~nondet47, ULTIMATE.start_main_#t~ite58, ULTIMATE.start_main_#t~ite54, ULTIMATE.start_main_#t~ite56, ULTIMATE.start_main_#t~ite63, ~weak$$choice0~0, ULTIMATE.start_main_#t~ite40, ULTIMATE.start_main_#t~ite61, ~y$w_buff1~0, ~y$read_delayed_var~0.base, ~y$r_buff0_thd2~0, ULTIMATE.start_main_#t~nondet38, ~__unbuffered_cnt~0, ~y$r_buff1_thd0~0, ~x~0, ~y$read_delayed_var~0.offset, ~y$w_buff0_used~0, ~main$tmp_guard1~0, ULTIMATE.start_main_#t~ite48, ULTIMATE.start_main_#t~ite42, ULTIMATE.start_main_#t~ite67, ULTIMATE.start_main_#t~ite44, ULTIMATE.start_main_#t~ite65, ~y$r_buff1_thd1~0, ULTIMATE.start_main_#t~ite51, ULTIMATE.start_main_~#t1720~0.offset, ~y$w_buff0~0, ~y~0, ULTIMATE.start_main_~#t1720~0.base, ~__unbuffered_p1_EBX~0, ULTIMATE.start_main_~#t1719~0.base, ULTIMATE.start_main_#t~nondet46, ULTIMATE.start_main_~#t1719~0.offset, ULTIMATE.start_main_#t~ite57, ULTIMATE.start_main_#t~ite59, ~main$tmp_guard0~0, ULTIMATE.start_main_#t~ite53, #NULL.base, ULTIMATE.start_main_#t~ite55, ULTIMATE.start_main_#t~ite62, ~y$r_buff1_thd2~0, ULTIMATE.start_main_#t~ite41, ULTIMATE.start_main_#t~ite60, ULTIMATE.start_main_#res, ~y$r_buff0_thd0~0, #valid, #memory_int, ULTIMATE.start_main_#t~nondet39, ~weak$$choice2~0, ~y$w_buff1_used~0] because there is no mapped edge [2019-12-07 20:51:48,858 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [978] [978] L797-1-->L799: Formula: (and (= |v_#memory_int_9| (store |v_#memory_int_10| |v_ULTIMATE.start_main_~#t1720~0.base_13| (store (select |v_#memory_int_10| |v_ULTIMATE.start_main_~#t1720~0.base_13|) |v_ULTIMATE.start_main_~#t1720~0.offset_11| 1))) (not (= 0 |v_ULTIMATE.start_main_~#t1720~0.base_13|)) (= |v_#length_11| (store |v_#length_12| |v_ULTIMATE.start_main_~#t1720~0.base_13| 4)) (= (select |v_#valid_27| |v_ULTIMATE.start_main_~#t1720~0.base_13|) 0) (< |v_#StackHeapBarrier_9| |v_ULTIMATE.start_main_~#t1720~0.base_13|) (= (store |v_#valid_27| |v_ULTIMATE.start_main_~#t1720~0.base_13| 1) |v_#valid_26|) (= 0 |v_ULTIMATE.start_main_~#t1720~0.offset_11|)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_9|, #valid=|v_#valid_27|, #memory_int=|v_#memory_int_10|, #length=|v_#length_12|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_9|, ULTIMATE.start_main_~#t1720~0.offset=|v_ULTIMATE.start_main_~#t1720~0.offset_11|, #valid=|v_#valid_26|, #memory_int=|v_#memory_int_9|, ULTIMATE.start_main_#t~nondet38=|v_ULTIMATE.start_main_#t~nondet38_6|, #length=|v_#length_11|, ULTIMATE.start_main_~#t1720~0.base=|v_ULTIMATE.start_main_~#t1720~0.base_13|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t1720~0.offset, #valid, #memory_int, ULTIMATE.start_main_#t~nondet38, #length, ULTIMATE.start_main_~#t1720~0.base] because there is no mapped edge [2019-12-07 20:51:48,858 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [865] [865] P1ENTRY-->L4-3: Formula: (and (= v_P1Thread1of1ForFork1_~arg.base_5 |v_P1Thread1of1ForFork1_#in~arg.base_7|) (= |v_P1Thread1of1ForFork1_#in~arg.offset_7| v_P1Thread1of1ForFork1_~arg.offset_5) (= v_~y$w_buff0_used~0_156 1) (= v_~y$w_buff0~0_36 v_~y$w_buff1~0_27) (= 2 v_~y$w_buff0~0_35) (= |v_P1Thread1of1ForFork1___VERIFIER_assert_#in~expression_5| (ite (not (and (not (= 0 (mod v_~y$w_buff0_used~0_156 256))) (not (= 0 (mod v_~y$w_buff1_used~0_77 256))))) 1 0)) (not (= v_P1Thread1of1ForFork1___VERIFIER_assert_~expression_7 0)) (= v_P1Thread1of1ForFork1___VERIFIER_assert_~expression_7 |v_P1Thread1of1ForFork1___VERIFIER_assert_#in~expression_5|) (= v_~y$w_buff1_used~0_77 v_~y$w_buff0_used~0_157)) InVars {~y$w_buff0_used~0=v_~y$w_buff0_used~0_157, ~y$w_buff0~0=v_~y$w_buff0~0_36, P1Thread1of1ForFork1_#in~arg.base=|v_P1Thread1of1ForFork1_#in~arg.base_7|, P1Thread1of1ForFork1_#in~arg.offset=|v_P1Thread1of1ForFork1_#in~arg.offset_7|} OutVars{P1Thread1of1ForFork1___VERIFIER_assert_~expression=v_P1Thread1of1ForFork1___VERIFIER_assert_~expression_7, P1Thread1of1ForFork1_~arg.offset=v_P1Thread1of1ForFork1_~arg.offset_5, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_156, ~y$w_buff1~0=v_~y$w_buff1~0_27, P1Thread1of1ForFork1___VERIFIER_assert_#in~expression=|v_P1Thread1of1ForFork1___VERIFIER_assert_#in~expression_5|, P1Thread1of1ForFork1_~arg.base=v_P1Thread1of1ForFork1_~arg.base_5, ~y$w_buff0~0=v_~y$w_buff0~0_35, P1Thread1of1ForFork1_#in~arg.base=|v_P1Thread1of1ForFork1_#in~arg.base_7|, P1Thread1of1ForFork1_#in~arg.offset=|v_P1Thread1of1ForFork1_#in~arg.offset_7|, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_77} AuxVars[] AssignedVars[P1Thread1of1ForFork1___VERIFIER_assert_~expression, P1Thread1of1ForFork1_~arg.offset, ~y$w_buff0_used~0, ~y$w_buff1~0, P1Thread1of1ForFork1___VERIFIER_assert_#in~expression, P1Thread1of1ForFork1_~arg.base, ~y$w_buff0~0, ~y$w_buff1_used~0] because there is no mapped edge [2019-12-07 20:51:48,859 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [953] [953] L759-2-->L759-5: Formula: (let ((.cse0 (= |P1Thread1of1ForFork1_#t~ite12_Out-1835825323| |P1Thread1of1ForFork1_#t~ite11_Out-1835825323|)) (.cse2 (= (mod ~y$w_buff0_used~0_In-1835825323 256) 0)) (.cse1 (= (mod ~y$r_buff0_thd2~0_In-1835825323 256) 0))) (or (and (= ~y$w_buff0~0_In-1835825323 |P1Thread1of1ForFork1_#t~ite11_Out-1835825323|) .cse0 (not .cse1) (not .cse2)) (and .cse0 (or .cse2 .cse1) (= ~y$w_buff1~0_In-1835825323 |P1Thread1of1ForFork1_#t~ite11_Out-1835825323|)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-1835825323, ~y$w_buff1~0=~y$w_buff1~0_In-1835825323, ~y$w_buff0~0=~y$w_buff0~0_In-1835825323, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-1835825323} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-1835825323, ~y$w_buff1~0=~y$w_buff1~0_In-1835825323, ~y$w_buff0~0=~y$w_buff0~0_In-1835825323, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-1835825323, P1Thread1of1ForFork1_#t~ite11=|P1Thread1of1ForFork1_#t~ite11_Out-1835825323|, P1Thread1of1ForFork1_#t~ite12=|P1Thread1of1ForFork1_#t~ite12_Out-1835825323|} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite11, P1Thread1of1ForFork1_#t~ite12] because there is no mapped edge [2019-12-07 20:51:48,861 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [899] [899] L764-->L765: Formula: (and (= v_~y$r_buff0_thd2~0_138 v_~y$r_buff0_thd2~0_137) (not (= 0 (mod v_~weak$$choice2~0_59 256)))) InVars {~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_138, ~weak$$choice2~0=v_~weak$$choice2~0_59} OutVars{~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_137, P1Thread1of1ForFork1_#t~ite27=|v_P1Thread1of1ForFork1_#t~ite27_7|, ~weak$$choice2~0=v_~weak$$choice2~0_59, P1Thread1of1ForFork1_#t~ite25=|v_P1Thread1of1ForFork1_#t~ite25_15|, P1Thread1of1ForFork1_#t~ite26=|v_P1Thread1of1ForFork1_#t~ite26_9|} AuxVars[] AssignedVars[~y$r_buff0_thd2~0, P1Thread1of1ForFork1_#t~ite27, P1Thread1of1ForFork1_#t~ite25, P1Thread1of1ForFork1_#t~ite26] because there is no mapped edge [2019-12-07 20:51:48,861 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [946] [946] L767-->L767-2: Formula: (let ((.cse0 (= (mod ~y$flush_delayed~0_In-1021033594 256) 0))) (or (and (= |P1Thread1of1ForFork1_#t~ite31_Out-1021033594| ~y$mem_tmp~0_In-1021033594) (not .cse0)) (and (= |P1Thread1of1ForFork1_#t~ite31_Out-1021033594| ~y~0_In-1021033594) .cse0))) InVars {~y$mem_tmp~0=~y$mem_tmp~0_In-1021033594, ~y$flush_delayed~0=~y$flush_delayed~0_In-1021033594, ~y~0=~y~0_In-1021033594} OutVars{~y$mem_tmp~0=~y$mem_tmp~0_In-1021033594, P1Thread1of1ForFork1_#t~ite31=|P1Thread1of1ForFork1_#t~ite31_Out-1021033594|, ~y$flush_delayed~0=~y$flush_delayed~0_In-1021033594, ~y~0=~y~0_In-1021033594} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite31] because there is no mapped edge [2019-12-07 20:51:48,862 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [947] [947] L730-2-->L730-5: Formula: (let ((.cse1 (= (mod ~y$r_buff1_thd1~0_In-519854573 256) 0)) (.cse0 (= 0 (mod ~y$w_buff1_used~0_In-519854573 256))) (.cse2 (= |P0Thread1of1ForFork0_#t~ite3_Out-519854573| |P0Thread1of1ForFork0_#t~ite4_Out-519854573|))) (or (and (= |P0Thread1of1ForFork0_#t~ite3_Out-519854573| ~y$w_buff1~0_In-519854573) (not .cse0) (not .cse1) .cse2) (and (or .cse1 .cse0) .cse2 (= |P0Thread1of1ForFork0_#t~ite3_Out-519854573| ~y~0_In-519854573)))) InVars {~y$r_buff1_thd1~0=~y$r_buff1_thd1~0_In-519854573, ~y$w_buff1~0=~y$w_buff1~0_In-519854573, ~y~0=~y~0_In-519854573, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-519854573} OutVars{~y$r_buff1_thd1~0=~y$r_buff1_thd1~0_In-519854573, P0Thread1of1ForFork0_#t~ite3=|P0Thread1of1ForFork0_#t~ite3_Out-519854573|, P0Thread1of1ForFork0_#t~ite4=|P0Thread1of1ForFork0_#t~ite4_Out-519854573|, ~y$w_buff1~0=~y$w_buff1~0_In-519854573, ~y~0=~y~0_In-519854573, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-519854573} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite3, P0Thread1of1ForFork0_#t~ite4] because there is no mapped edge [2019-12-07 20:51:48,862 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [924] [924] L731-->L731-2: Formula: (let ((.cse0 (= 0 (mod ~y$w_buff0_used~0_In-413408700 256))) (.cse1 (= 0 (mod ~y$r_buff0_thd1~0_In-413408700 256)))) (or (and (not .cse0) (not .cse1) (= |P0Thread1of1ForFork0_#t~ite5_Out-413408700| 0)) (and (= |P0Thread1of1ForFork0_#t~ite5_Out-413408700| ~y$w_buff0_used~0_In-413408700) (or .cse0 .cse1)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-413408700, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In-413408700} OutVars{P0Thread1of1ForFork0_#t~ite5=|P0Thread1of1ForFork0_#t~ite5_Out-413408700|, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-413408700, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In-413408700} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite5] because there is no mapped edge [2019-12-07 20:51:48,863 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [944] [944] L732-->L732-2: Formula: (let ((.cse2 (= 0 (mod ~y$r_buff1_thd1~0_In-1228590452 256))) (.cse3 (= (mod ~y$w_buff1_used~0_In-1228590452 256) 0)) (.cse0 (= (mod ~y$r_buff0_thd1~0_In-1228590452 256) 0)) (.cse1 (= (mod ~y$w_buff0_used~0_In-1228590452 256) 0))) (or (and (or .cse0 .cse1) (= ~y$w_buff1_used~0_In-1228590452 |P0Thread1of1ForFork0_#t~ite6_Out-1228590452|) (or .cse2 .cse3)) (and (= 0 |P0Thread1of1ForFork0_#t~ite6_Out-1228590452|) (or (and (not .cse2) (not .cse3)) (and (not .cse0) (not .cse1)))))) InVars {~y$r_buff1_thd1~0=~y$r_buff1_thd1~0_In-1228590452, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-1228590452, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In-1228590452, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1228590452} OutVars{P0Thread1of1ForFork0_#t~ite6=|P0Thread1of1ForFork0_#t~ite6_Out-1228590452|, ~y$r_buff1_thd1~0=~y$r_buff1_thd1~0_In-1228590452, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-1228590452, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In-1228590452, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1228590452} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite6] because there is no mapped edge [2019-12-07 20:51:48,863 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [948] [948] L733-->L733-2: Formula: (let ((.cse1 (= (mod ~y$r_buff0_thd1~0_In-2061871683 256) 0)) (.cse0 (= (mod ~y$w_buff0_used~0_In-2061871683 256) 0))) (or (and (= 0 |P0Thread1of1ForFork0_#t~ite7_Out-2061871683|) (not .cse0) (not .cse1)) (and (or .cse1 .cse0) (= ~y$r_buff0_thd1~0_In-2061871683 |P0Thread1of1ForFork0_#t~ite7_Out-2061871683|)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-2061871683, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In-2061871683} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-2061871683, P0Thread1of1ForFork0_#t~ite7=|P0Thread1of1ForFork0_#t~ite7_Out-2061871683|, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In-2061871683} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite7] because there is no mapped edge [2019-12-07 20:51:48,863 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [933] [933] L734-->L734-2: Formula: (let ((.cse0 (= (mod ~y$w_buff0_used~0_In481089523 256) 0)) (.cse1 (= (mod ~y$r_buff0_thd1~0_In481089523 256) 0)) (.cse3 (= (mod ~y$w_buff1_used~0_In481089523 256) 0)) (.cse2 (= (mod ~y$r_buff1_thd1~0_In481089523 256) 0))) (or (and (= |P0Thread1of1ForFork0_#t~ite8_Out481089523| 0) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse0 .cse1) (or .cse3 .cse2) (= |P0Thread1of1ForFork0_#t~ite8_Out481089523| ~y$r_buff1_thd1~0_In481089523)))) InVars {~y$r_buff1_thd1~0=~y$r_buff1_thd1~0_In481089523, ~y$w_buff0_used~0=~y$w_buff0_used~0_In481089523, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In481089523, ~y$w_buff1_used~0=~y$w_buff1_used~0_In481089523} OutVars{~y$r_buff1_thd1~0=~y$r_buff1_thd1~0_In481089523, ~y$w_buff0_used~0=~y$w_buff0_used~0_In481089523, P0Thread1of1ForFork0_#t~ite8=|P0Thread1of1ForFork0_#t~ite8_Out481089523|, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In481089523, ~y$w_buff1_used~0=~y$w_buff1_used~0_In481089523} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite8] because there is no mapped edge [2019-12-07 20:51:48,863 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [977] [977] L734-2-->P0EXIT: Formula: (and (= |v_P0Thread1of1ForFork0_#res.offset_3| 0) (= v_~y$r_buff1_thd1~0_141 |v_P0Thread1of1ForFork0_#t~ite8_24|) (= 0 |v_P0Thread1of1ForFork0_#res.base_3|) (= v_~__unbuffered_cnt~0_31 (+ v_~__unbuffered_cnt~0_32 1))) InVars {P0Thread1of1ForFork0_#t~ite8=|v_P0Thread1of1ForFork0_#t~ite8_24|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_32} OutVars{~y$r_buff1_thd1~0=v_~y$r_buff1_thd1~0_141, P0Thread1of1ForFork0_#res.offset=|v_P0Thread1of1ForFork0_#res.offset_3|, P0Thread1of1ForFork0_#t~ite8=|v_P0Thread1of1ForFork0_#t~ite8_23|, P0Thread1of1ForFork0_#res.base=|v_P0Thread1of1ForFork0_#res.base_3|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_31} AuxVars[] AssignedVars[~y$r_buff1_thd1~0, P0Thread1of1ForFork0_#res.offset, P0Thread1of1ForFork0_#t~ite8, P0Thread1of1ForFork0_#res.base, ~__unbuffered_cnt~0] because there is no mapped edge [2019-12-07 20:51:48,864 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [930] [930] L775-->L775-2: Formula: (let ((.cse0 (= 0 (mod ~y$r_buff0_thd2~0_In418320366 256))) (.cse1 (= 0 (mod ~y$w_buff0_used~0_In418320366 256)))) (or (and (= |P1Thread1of1ForFork1_#t~ite34_Out418320366| ~y$w_buff0_used~0_In418320366) (or .cse0 .cse1)) (and (= |P1Thread1of1ForFork1_#t~ite34_Out418320366| 0) (not .cse0) (not .cse1)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In418320366, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In418320366} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In418320366, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In418320366, P1Thread1of1ForFork1_#t~ite34=|P1Thread1of1ForFork1_#t~ite34_Out418320366|} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite34] because there is no mapped edge [2019-12-07 20:51:48,864 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [939] [939] L776-->L776-2: Formula: (let ((.cse2 (= 0 (mod ~y$w_buff1_used~0_In-1137223981 256))) (.cse3 (= (mod ~y$r_buff1_thd2~0_In-1137223981 256) 0)) (.cse0 (= 0 (mod ~y$w_buff0_used~0_In-1137223981 256))) (.cse1 (= 0 (mod ~y$r_buff0_thd2~0_In-1137223981 256)))) (or (and (= |P1Thread1of1ForFork1_#t~ite35_Out-1137223981| ~y$w_buff1_used~0_In-1137223981) (or .cse0 .cse1) (or .cse2 .cse3)) (and (= |P1Thread1of1ForFork1_#t~ite35_Out-1137223981| 0) (or (and (not .cse2) (not .cse3)) (and (not .cse0) (not .cse1)))))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-1137223981, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-1137223981, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-1137223981, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1137223981} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-1137223981, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-1137223981, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-1137223981, P1Thread1of1ForFork1_#t~ite35=|P1Thread1of1ForFork1_#t~ite35_Out-1137223981|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1137223981} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite35] because there is no mapped edge [2019-12-07 20:51:48,864 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [952] [952] L777-->L778: Formula: (let ((.cse1 (= (mod ~y$w_buff0_used~0_In1773894158 256) 0)) (.cse2 (= (mod ~y$r_buff0_thd2~0_In1773894158 256) 0)) (.cse0 (= ~y$r_buff0_thd2~0_In1773894158 ~y$r_buff0_thd2~0_Out1773894158))) (or (and .cse0 .cse1) (and (not .cse2) (not .cse1) (= 0 ~y$r_buff0_thd2~0_Out1773894158)) (and .cse2 .cse0))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In1773894158, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In1773894158} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In1773894158, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_Out1773894158, P1Thread1of1ForFork1_#t~ite36=|P1Thread1of1ForFork1_#t~ite36_Out1773894158|} AuxVars[] AssignedVars[~y$r_buff0_thd2~0, P1Thread1of1ForFork1_#t~ite36] because there is no mapped edge [2019-12-07 20:51:48,864 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [936] [936] L778-->L778-2: Formula: (let ((.cse0 (= (mod ~y$r_buff0_thd2~0_In-2006956485 256) 0)) (.cse1 (= (mod ~y$w_buff0_used~0_In-2006956485 256) 0)) (.cse3 (= (mod ~y$w_buff1_used~0_In-2006956485 256) 0)) (.cse2 (= 0 (mod ~y$r_buff1_thd2~0_In-2006956485 256)))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= |P1Thread1of1ForFork1_#t~ite37_Out-2006956485| 0)) (and (= |P1Thread1of1ForFork1_#t~ite37_Out-2006956485| ~y$r_buff1_thd2~0_In-2006956485) (or .cse0 .cse1) (or .cse3 .cse2)))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-2006956485, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-2006956485, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-2006956485, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-2006956485} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-2006956485, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-2006956485, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-2006956485, P1Thread1of1ForFork1_#t~ite37=|P1Thread1of1ForFork1_#t~ite37_Out-2006956485|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-2006956485} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite37] because there is no mapped edge [2019-12-07 20:51:48,864 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [965] [965] L778-2-->P1EXIT: Formula: (and (= (+ v_~__unbuffered_cnt~0_22 1) v_~__unbuffered_cnt~0_21) (= v_~y$r_buff1_thd2~0_155 |v_P1Thread1of1ForFork1_#t~ite37_20|) (= 0 |v_P1Thread1of1ForFork1_#res.base_3|) (= |v_P1Thread1of1ForFork1_#res.offset_3| 0)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_22, P1Thread1of1ForFork1_#t~ite37=|v_P1Thread1of1ForFork1_#t~ite37_20|} OutVars{~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_155, P1Thread1of1ForFork1_#res.offset=|v_P1Thread1of1ForFork1_#res.offset_3|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_21, P1Thread1of1ForFork1_#res.base=|v_P1Thread1of1ForFork1_#res.base_3|, P1Thread1of1ForFork1_#t~ite37=|v_P1Thread1of1ForFork1_#t~ite37_19|} AuxVars[] AssignedVars[~y$r_buff1_thd2~0, P1Thread1of1ForFork1_#res.offset, ~__unbuffered_cnt~0, P1Thread1of1ForFork1_#res.base, P1Thread1of1ForFork1_#t~ite37] because there is no mapped edge [2019-12-07 20:51:48,865 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [860] [860] L803-->L805-2: Formula: (and (or (= 0 (mod v_~y$r_buff0_thd0~0_55 256)) (= (mod v_~y$w_buff0_used~0_124 256) 0)) (not (= 0 (mod v_~main$tmp_guard0~0_5 256)))) InVars {~y$w_buff0_used~0=v_~y$w_buff0_used~0_124, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_55, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_5} OutVars{~y$w_buff0_used~0=v_~y$w_buff0_used~0_124, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_55, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_5} AuxVars[] AssignedVars[] because there is no mapped edge [2019-12-07 20:51:48,865 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [931] [931] L805-2-->L805-4: Formula: (let ((.cse1 (= 0 (mod ~y$w_buff1_used~0_In1851184601 256))) (.cse0 (= (mod ~y$r_buff1_thd0~0_In1851184601 256) 0))) (or (and (not .cse0) (not .cse1) (= ~y$w_buff1~0_In1851184601 |ULTIMATE.start_main_#t~ite40_Out1851184601|)) (and (= ~y~0_In1851184601 |ULTIMATE.start_main_#t~ite40_Out1851184601|) (or .cse1 .cse0)))) InVars {~y$w_buff1~0=~y$w_buff1~0_In1851184601, ~y~0=~y~0_In1851184601, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In1851184601, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1851184601} OutVars{ULTIMATE.start_main_#t~ite40=|ULTIMATE.start_main_#t~ite40_Out1851184601|, ~y$w_buff1~0=~y$w_buff1~0_In1851184601, ~y~0=~y~0_In1851184601, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In1851184601, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1851184601} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite40] because there is no mapped edge [2019-12-07 20:51:48,865 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [894] [894] L805-4-->L806: Formula: (= v_~y~0_55 |v_ULTIMATE.start_main_#t~ite40_13|) InVars {ULTIMATE.start_main_#t~ite40=|v_ULTIMATE.start_main_#t~ite40_13|} OutVars{ULTIMATE.start_main_#t~ite41=|v_ULTIMATE.start_main_#t~ite41_7|, ULTIMATE.start_main_#t~ite40=|v_ULTIMATE.start_main_#t~ite40_12|, ~y~0=v_~y~0_55} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite41, ULTIMATE.start_main_#t~ite40, ~y~0] because there is no mapped edge [2019-12-07 20:51:48,865 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [925] [925] L806-->L806-2: Formula: (let ((.cse1 (= 0 (mod ~y$r_buff0_thd0~0_In-1969275688 256))) (.cse0 (= 0 (mod ~y$w_buff0_used~0_In-1969275688 256)))) (or (and (not .cse0) (= 0 |ULTIMATE.start_main_#t~ite42_Out-1969275688|) (not .cse1)) (and (or .cse1 .cse0) (= ~y$w_buff0_used~0_In-1969275688 |ULTIMATE.start_main_#t~ite42_Out-1969275688|)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-1969275688, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-1969275688} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-1969275688, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-1969275688, ULTIMATE.start_main_#t~ite42=|ULTIMATE.start_main_#t~ite42_Out-1969275688|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite42] because there is no mapped edge [2019-12-07 20:51:48,865 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [926] [926] L807-->L807-2: Formula: (let ((.cse1 (= (mod ~y$r_buff1_thd0~0_In-1720999036 256) 0)) (.cse0 (= 0 (mod ~y$w_buff1_used~0_In-1720999036 256))) (.cse3 (= (mod ~y$w_buff0_used~0_In-1720999036 256) 0)) (.cse2 (= (mod ~y$r_buff0_thd0~0_In-1720999036 256) 0))) (or (and (= ~y$w_buff1_used~0_In-1720999036 |ULTIMATE.start_main_#t~ite43_Out-1720999036|) (or .cse0 .cse1) (or .cse2 .cse3)) (and (= 0 |ULTIMATE.start_main_#t~ite43_Out-1720999036|) (or (and (not .cse1) (not .cse0)) (and (not .cse3) (not .cse2)))))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-1720999036, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-1720999036, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-1720999036, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1720999036} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-1720999036, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-1720999036, ULTIMATE.start_main_#t~ite43=|ULTIMATE.start_main_#t~ite43_Out-1720999036|, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-1720999036, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1720999036} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite43] because there is no mapped edge [2019-12-07 20:51:48,866 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [940] [940] L808-->L808-2: Formula: (let ((.cse1 (= 0 (mod ~y$w_buff0_used~0_In-1595383810 256))) (.cse0 (= (mod ~y$r_buff0_thd0~0_In-1595383810 256) 0))) (or (and (= |ULTIMATE.start_main_#t~ite44_Out-1595383810| 0) (not .cse0) (not .cse1)) (and (= |ULTIMATE.start_main_#t~ite44_Out-1595383810| ~y$r_buff0_thd0~0_In-1595383810) (or .cse1 .cse0)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-1595383810, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-1595383810} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-1595383810, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-1595383810, ULTIMATE.start_main_#t~ite44=|ULTIMATE.start_main_#t~ite44_Out-1595383810|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite44] because there is no mapped edge [2019-12-07 20:51:48,866 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [950] [950] L809-->L809-2: Formula: (let ((.cse0 (= (mod ~y$w_buff0_used~0_In1057340463 256) 0)) (.cse1 (= 0 (mod ~y$r_buff0_thd0~0_In1057340463 256))) (.cse2 (= (mod ~y$w_buff1_used~0_In1057340463 256) 0)) (.cse3 (= (mod ~y$r_buff1_thd0~0_In1057340463 256) 0))) (or (and (or .cse0 .cse1) (or .cse2 .cse3) (= |ULTIMATE.start_main_#t~ite45_Out1057340463| ~y$r_buff1_thd0~0_In1057340463)) (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= |ULTIMATE.start_main_#t~ite45_Out1057340463| 0)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In1057340463, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In1057340463, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In1057340463, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1057340463} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In1057340463, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In1057340463, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In1057340463, ULTIMATE.start_main_#t~ite45=|ULTIMATE.start_main_#t~ite45_Out1057340463|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1057340463} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite45] because there is no mapped edge [2019-12-07 20:51:48,869 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [941] [941] L824-->L824-2: Formula: (let ((.cse0 (= (mod ~y$flush_delayed~0_In1505559765 256) 0))) (or (and (= ~y~0_In1505559765 |ULTIMATE.start_main_#t~ite68_Out1505559765|) .cse0) (and (not .cse0) (= |ULTIMATE.start_main_#t~ite68_Out1505559765| ~y$mem_tmp~0_In1505559765)))) InVars {~y$mem_tmp~0=~y$mem_tmp~0_In1505559765, ~y$flush_delayed~0=~y$flush_delayed~0_In1505559765, ~y~0=~y~0_In1505559765} OutVars{~y$mem_tmp~0=~y$mem_tmp~0_In1505559765, ~y$flush_delayed~0=~y$flush_delayed~0_In1505559765, ULTIMATE.start_main_#t~ite68=|ULTIMATE.start_main_#t~ite68_Out1505559765|, ~y~0=~y~0_In1505559765} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite68] because there is no mapped edge [2019-12-07 20:51:48,869 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [992] [992] L824-2-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= v_~y~0_262 |v_ULTIMATE.start_main_#t~ite68_40|) (= v_ULTIMATE.start___VERIFIER_assert_~expression_15 |v_ULTIMATE.start___VERIFIER_assert_#in~expression_11|) (= v_ULTIMATE.start___VERIFIER_assert_~expression_15 0) (= (mod v_~main$tmp_guard1~0_29 256) |v_ULTIMATE.start___VERIFIER_assert_#in~expression_11|) (= v_~y$flush_delayed~0_189 0)) InVars {~main$tmp_guard1~0=v_~main$tmp_guard1~0_29, ULTIMATE.start_main_#t~ite68=|v_ULTIMATE.start_main_#t~ite68_40|} OutVars{ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_15, ~y$flush_delayed~0=v_~y$flush_delayed~0_189, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_29, ULTIMATE.start_main_#t~ite68=|v_ULTIMATE.start_main_#t~ite68_39|, ~y~0=v_~y~0_262, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_11|} AuxVars[] AssignedVars[ULTIMATE.start___VERIFIER_assert_~expression, ~y$flush_delayed~0, ULTIMATE.start_main_#t~ite68, ~y~0, ULTIMATE.start___VERIFIER_assert_#in~expression] because there is no mapped edge [2019-12-07 20:51:48,928 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/run_dir_fc7cc043-e3f6-4344-bd30-5812924d9e14/bin/utaipan/witness.graphml [2019-12-07 20:51:48,928 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-12-07 20:51:48,929 INFO L168 Benchmark]: Toolchain (without parser) took 17270.77 ms. Allocated memory was 1.0 GB in the beginning and 2.2 GB in the end (delta: 1.1 GB). Free memory was 938.2 MB in the beginning and 1.3 GB in the end (delta: -343.8 MB). Peak memory consumption was 780.8 MB. Max. memory is 11.5 GB. [2019-12-07 20:51:48,930 INFO L168 Benchmark]: CDTParser took 0.16 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 20:51:48,930 INFO L168 Benchmark]: CACSL2BoogieTranslator took 400.81 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 101.7 MB). Free memory was 938.2 MB in the beginning and 1.1 GB in the end (delta: -135.5 MB). Peak memory consumption was 29.1 MB. Max. memory is 11.5 GB. [2019-12-07 20:51:48,930 INFO L168 Benchmark]: Boogie Procedure Inliner took 41.12 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 20:51:48,930 INFO L168 Benchmark]: Boogie Preprocessor took 28.15 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 20:51:48,931 INFO L168 Benchmark]: RCFGBuilder took 448.25 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: 60.5 MB). Peak memory consumption was 60.5 MB. Max. memory is 11.5 GB. [2019-12-07 20:51:48,931 INFO L168 Benchmark]: TraceAbstraction took 16272.49 ms. Allocated memory was 1.1 GB in the beginning and 2.2 GB in the end (delta: 1.0 GB). Free memory was 1.0 GB in the beginning and 1.3 GB in the end (delta: -305.9 MB). Peak memory consumption was 717.0 MB. Max. memory is 11.5 GB. [2019-12-07 20:51:48,931 INFO L168 Benchmark]: Witness Printer took 73.47 ms. Allocated memory is still 2.2 GB. Free memory was 1.3 GB in the beginning and 1.3 GB in the end (delta: 26.3 MB). Peak memory consumption was 26.3 MB. Max. memory is 11.5 GB. [2019-12-07 20:51:48,932 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.16 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 400.81 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 101.7 MB). Free memory was 938.2 MB in the beginning and 1.1 GB in the end (delta: -135.5 MB). Peak memory consumption was 29.1 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 41.12 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 28.15 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. * RCFGBuilder took 448.25 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: 60.5 MB). Peak memory consumption was 60.5 MB. Max. memory is 11.5 GB. * TraceAbstraction took 16272.49 ms. Allocated memory was 1.1 GB in the beginning and 2.2 GB in the end (delta: 1.0 GB). Free memory was 1.0 GB in the beginning and 1.3 GB in the end (delta: -305.9 MB). Peak memory consumption was 717.0 MB. Max. memory is 11.5 GB. * Witness Printer took 73.47 ms. Allocated memory is still 2.2 GB. Free memory was 1.3 GB in the beginning and 1.3 GB in the end (delta: 26.3 MB). Peak memory consumption was 26.3 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks LbeTime: 3.3s, 189 ProgramPointsBefore, 112 ProgramPointsAfterwards, 244 TransitionsBefore, 137 TransitionsAfterwards, 25246 CoEnabledTransitionPairs, 7 FixpointIterations, 29 TrivialSequentialCompositions, 33 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 55 ConcurrentYvCompositions, 33 ChoiceCompositions, 10314 VarBasedMoverChecksPositive, 294 VarBasedMoverChecksNegative, 64 SemBasedMoverChecksPositive, 333 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 0.9s, 0 MoverChecksTotal, 142511 CheckedPairsTotal, 117 TotalNumberOfCompositions - CounterExampleResult [Line: 4]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L797] FCALL, FORK 0 pthread_create(&t1719, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L799] FCALL, FORK 0 pthread_create(&t1720, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L749] 2 y$r_buff1_thd0 = y$r_buff0_thd0 [L750] 2 y$r_buff1_thd1 = y$r_buff0_thd1 [L751] 2 y$r_buff1_thd2 = y$r_buff0_thd2 [L752] 2 y$r_buff0_thd2 = (_Bool)1 [L755] 2 weak$$choice0 = __VERIFIER_nondet_bool() [L756] 2 weak$$choice2 = __VERIFIER_nondet_bool() [L757] 2 y$flush_delayed = weak$$choice2 [L758] 2 y$mem_tmp = y VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=3, weak$$choice2=1, x=0, 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=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L759] EXPR 2 !y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff1) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=3, weak$$choice2=1, x=0, 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=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L759] 2 y = !y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff1) [L760] EXPR 2 weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=3, weak$$choice2=1, x=0, y=2, 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=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L760] 2 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff0)) [L761] EXPR 2 weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff1 : y$w_buff1)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=3, weak$$choice2=1, x=0, y=2, 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=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L761] 2 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff1 : y$w_buff1)) [L762] EXPR 2 weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=3, weak$$choice2=1, x=0, y=2, 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=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L762] 2 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used)) [L763] EXPR 2 weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=3, weak$$choice2=1, x=0, y=2, 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=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L763] 2 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L765] EXPR 2 weak$$choice2 ? y$r_buff1_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff1_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=3, weak$$choice2=1, x=0, y=2, 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=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L765] 2 y$r_buff1_thd2 = weak$$choice2 ? y$r_buff1_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff1_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L766] 2 __unbuffered_p1_EAX = y VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=3, weak$$choice2=1, x=0, y=2, 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=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L767] 2 y = y$flush_delayed ? y$mem_tmp : y [L768] 2 y$flush_delayed = (_Bool)0 [L771] 2 __unbuffered_p1_EBX = x VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=3, weak$$choice2=1, 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=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L724] 1 x = 1 [L727] 1 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=3, weak$$choice2=1, x=1, y=1, 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=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L730] EXPR 1 y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd1 ? y$w_buff1 : y) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=3, weak$$choice2=1, x=1, y=1, 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=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L730] 1 y = y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd1 ? y$w_buff1 : y) [L774] 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_p1_EAX=2, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=3, weak$$choice2=1, x=1, y=1, 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=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L731] 1 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$w_buff0_used [L732] 1 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd1 || y$w_buff1_used && y$r_buff1_thd1 ? (_Bool)0 : y$w_buff1_used [L733] 1 y$r_buff0_thd1 = y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$r_buff0_thd1 [L774] 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) [L775] 2 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used [L776] 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 [L801] 0 main$tmp_guard0 = __unbuffered_cnt == 2 VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=3, weak$$choice2=1, x=1, y=2, 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=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L806] 0 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L807] 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 [L808] 0 y$r_buff0_thd0 = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 [L809] 0 y$r_buff1_thd0 = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$r_buff1_thd0 [L812] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L813] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L814] 0 y$flush_delayed = weak$$choice2 [L815] 0 y$mem_tmp = y VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=2, weak$$choice2=1, x=1, y=2, y$flush_delayed=1, y$mem_tmp=2, 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=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L816] EXPR 0 !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff1) VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=2, weak$$choice2=1, x=1, y=2, y$flush_delayed=1, y$mem_tmp=2, 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=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L816] 0 y = !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff1) [L817] EXPR 0 weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff0)) VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=2, weak$$choice2=1, x=1, y=2, y$flush_delayed=1, y$mem_tmp=2, 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=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L817] 0 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff0)) [L818] EXPR 0 weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff1 : y$w_buff1)) VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=2, weak$$choice2=1, x=1, y=2, y$flush_delayed=1, y$mem_tmp=2, 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=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L818] 0 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff1 : y$w_buff1)) [L819] EXPR 0 weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used)) VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=2, weak$$choice2=1, x=1, y=2, y$flush_delayed=1, y$mem_tmp=2, 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=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L819] 0 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used)) [L820] EXPR 0 weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=2, weak$$choice2=1, x=1, y=2, y$flush_delayed=1, y$mem_tmp=2, 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=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L820] 0 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L821] EXPR 0 weak$$choice2 ? y$r_buff0_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff0_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0)) VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=2, weak$$choice2=1, x=1, y=2, y$flush_delayed=1, y$mem_tmp=2, 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=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L821] 0 y$r_buff0_thd0 = weak$$choice2 ? y$r_buff0_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff0_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0)) [L822] EXPR 0 weak$$choice2 ? y$r_buff1_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff1_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=2, weak$$choice2=1, x=1, y=2, y$flush_delayed=1, y$mem_tmp=2, 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=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L822] 0 y$r_buff1_thd0 = weak$$choice2 ? y$r_buff1_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff1_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L823] 0 main$tmp_guard1 = !(y == 2 && __unbuffered_p1_EAX == 2 && __unbuffered_p1_EBX == 0) VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=2, weak$$choice2=1, x=1, y=2, y$flush_delayed=1, y$mem_tmp=2, 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=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 183 locations, 2 error locations. Result: UNSAFE, OverallTime: 16.1s, OverallIterations: 18, TraceHistogramMax: 1, AutomataDifference: 5.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 3701 SDtfs, 3216 SDslu, 8736 SDs, 0 SdLazy, 5274 SolverSat, 168 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 2.9s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 167 GetRequests, 41 SyntacticMatches, 18 SemanticMatches, 108 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 103 ImplicationChecksByTransitivity, 0.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=47611occurred in iteration=4, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 4.5s AutomataMinimizationTime, 17 MinimizatonAttempts, 25855 StatesRemovedByMinimization, 14 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 0.9s InterpolantComputationTime, 931 NumberOfCodeBlocks, 931 NumberOfCodeBlocksAsserted, 18 NumberOfCheckSat, 843 ConstructedInterpolants, 0 QuantifiedInterpolants, 175434 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 17 InterpolantComputations, 17 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...