./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/pthread-wmm/mix022_rmo.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_6c72aadc-be40-4b90-91d2-f68baf583ea2/bin/utaipan/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/run_dir_6c72aadc-be40-4b90-91d2-f68baf583ea2/bin/utaipan/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_6c72aadc-be40-4b90-91d2-f68baf583ea2/bin/utaipan/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_6c72aadc-be40-4b90-91d2-f68baf583ea2/bin/utaipan/config/TaipanReach.xml -i ../../sv-benchmarks/c/pthread-wmm/mix022_rmo.opt.i -s /tmp/vcloud-vcloud-master/worker/run_dir_6c72aadc-be40-4b90-91d2-f68baf583ea2/bin/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_6c72aadc-be40-4b90-91d2-f68baf583ea2/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 4d0b0eaddd6a0bfe3ffef00bcb44c52222c79f40 ............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... 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 11:16:55,465 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-07 11:16:55,467 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-07 11:16:55,475 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-07 11:16:55,475 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-07 11:16:55,476 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-07 11:16:55,477 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-07 11:16:55,479 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-07 11:16:55,480 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-07 11:16:55,481 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-07 11:16:55,482 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-07 11:16:55,483 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-07 11:16:55,484 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-07 11:16:55,484 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-07 11:16:55,485 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-07 11:16:55,486 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-07 11:16:55,487 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-07 11:16:55,488 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-07 11:16:55,490 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-07 11:16:55,492 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-07 11:16:55,493 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-07 11:16:55,494 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-07 11:16:55,495 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-07 11:16:55,495 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-07 11:16:55,498 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-07 11:16:55,498 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-07 11:16:55,498 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-07 11:16:55,499 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-07 11:16:55,499 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-07 11:16:55,500 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-07 11:16:55,500 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-07 11:16:55,500 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-07 11:16:55,501 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-07 11:16:55,501 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-07 11:16:55,502 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-07 11:16:55,502 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-07 11:16:55,503 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-07 11:16:55,503 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-07 11:16:55,503 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-07 11:16:55,504 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-07 11:16:55,505 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-07 11:16:55,505 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_6c72aadc-be40-4b90-91d2-f68baf583ea2/bin/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf [2019-12-07 11:16:55,518 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-07 11:16:55,518 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-07 11:16:55,519 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2019-12-07 11:16:55,519 INFO L138 SettingsManager]: * User list type=DISABLED [2019-12-07 11:16:55,519 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2019-12-07 11:16:55,520 INFO L138 SettingsManager]: * Explicit value domain=true [2019-12-07 11:16:55,520 INFO L138 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2019-12-07 11:16:55,520 INFO L138 SettingsManager]: * Octagon Domain=false [2019-12-07 11:16:55,520 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2019-12-07 11:16:55,520 INFO L138 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2019-12-07 11:16:55,520 INFO L138 SettingsManager]: * Use the RCFG-of-the-future interface=true [2019-12-07 11:16:55,521 INFO L138 SettingsManager]: * Interval Domain=false [2019-12-07 11:16:55,521 INFO L136 SettingsManager]: Preferences of Sifa differ from their defaults: [2019-12-07 11:16:55,521 INFO L138 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2019-12-07 11:16:55,521 INFO L138 SettingsManager]: * Simplification Technique=SIMPLIFY_QUICK [2019-12-07 11:16:55,522 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-07 11:16:55,522 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-07 11:16:55,522 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-07 11:16:55,522 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-07 11:16:55,523 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-07 11:16:55,523 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-07 11:16:55,523 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-07 11:16:55,523 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-07 11:16:55,523 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2019-12-07 11:16:55,523 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-07 11:16:55,523 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-07 11:16:55,523 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-07 11:16:55,524 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-07 11:16:55,524 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-07 11:16:55,524 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-07 11:16:55,524 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-07 11:16:55,524 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-07 11:16:55,524 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-07 11:16:55,525 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-07 11:16:55,525 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-07 11:16:55,525 INFO L138 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2019-12-07 11:16:55,525 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-07 11:16:55,525 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-07 11:16:55,525 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2019-12-07 11:16:55,526 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-12-07 11:16:55,526 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_6c72aadc-be40-4b90-91d2-f68baf583ea2/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 -> 4d0b0eaddd6a0bfe3ffef00bcb44c52222c79f40 [2019-12-07 11:16:55,641 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-07 11:16:55,650 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-07 11:16:55,653 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-07 11:16:55,654 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-07 11:16:55,654 INFO L275 PluginConnector]: CDTParser initialized [2019-12-07 11:16:55,654 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_6c72aadc-be40-4b90-91d2-f68baf583ea2/bin/utaipan/../../sv-benchmarks/c/pthread-wmm/mix022_rmo.opt.i [2019-12-07 11:16:55,692 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_6c72aadc-be40-4b90-91d2-f68baf583ea2/bin/utaipan/data/0f398a916/54883c6836d0410f8a1d95d88554bbf3/FLAGe4de11944 [2019-12-07 11:16:56,065 INFO L306 CDTParser]: Found 1 translation units. [2019-12-07 11:16:56,065 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_6c72aadc-be40-4b90-91d2-f68baf583ea2/sv-benchmarks/c/pthread-wmm/mix022_rmo.opt.i [2019-12-07 11:16:56,075 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_6c72aadc-be40-4b90-91d2-f68baf583ea2/bin/utaipan/data/0f398a916/54883c6836d0410f8a1d95d88554bbf3/FLAGe4de11944 [2019-12-07 11:16:56,458 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_6c72aadc-be40-4b90-91d2-f68baf583ea2/bin/utaipan/data/0f398a916/54883c6836d0410f8a1d95d88554bbf3 [2019-12-07 11:16:56,461 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-07 11:16:56,462 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-12-07 11:16:56,463 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-07 11:16:56,463 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-07 11:16:56,466 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-07 11:16:56,467 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.12 11:16:56" (1/1) ... [2019-12-07 11:16:56,470 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 11:16:56, skipping insertion in model container [2019-12-07 11:16:56,470 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.12 11:16:56" (1/1) ... [2019-12-07 11:16:56,476 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-07 11:16:56,506 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-07 11:16:56,770 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-07 11:16:56,777 INFO L203 MainTranslator]: Completed pre-run [2019-12-07 11:16:56,821 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-07 11:16:56,868 INFO L208 MainTranslator]: Completed translation [2019-12-07 11:16:56,868 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 11:16:56 WrapperNode [2019-12-07 11:16:56,869 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-07 11:16:56,869 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-07 11:16:56,869 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-07 11:16:56,869 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-07 11:16:56,876 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 11:16:56" (1/1) ... [2019-12-07 11:16:56,889 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 11:16:56" (1/1) ... [2019-12-07 11:16:56,907 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-07 11:16:56,908 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-07 11:16:56,908 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-07 11:16:56,908 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-07 11:16:56,914 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 11:16:56" (1/1) ... [2019-12-07 11:16:56,915 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 11:16:56" (1/1) ... [2019-12-07 11:16:56,918 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 11:16:56" (1/1) ... [2019-12-07 11:16:56,918 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 11:16:56" (1/1) ... [2019-12-07 11:16:56,925 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 11:16:56" (1/1) ... [2019-12-07 11:16:56,927 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 11:16:56" (1/1) ... [2019-12-07 11:16:56,930 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 11:16:56" (1/1) ... [2019-12-07 11:16:56,932 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-07 11:16:56,933 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-07 11:16:56,933 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-07 11:16:56,933 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-07 11:16:56,934 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 11:16:56" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_6c72aadc-be40-4b90-91d2-f68baf583ea2/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 11:16:56,973 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-12-07 11:16:56,973 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2019-12-07 11:16:56,973 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-12-07 11:16:56,973 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-12-07 11:16:56,973 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2019-12-07 11:16:56,973 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2019-12-07 11:16:56,973 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2019-12-07 11:16:56,973 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2019-12-07 11:16:56,973 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2019-12-07 11:16:56,974 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-07 11:16:56,974 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-07 11:16:56,975 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 11:16:57,313 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-07 11:16:57,313 INFO L287 CfgBuilder]: Removed 8 assume(true) statements. [2019-12-07 11:16:57,314 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 11:16:57 BoogieIcfgContainer [2019-12-07 11:16:57,314 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-07 11:16:57,315 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-07 11:16:57,315 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-07 11:16:57,317 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-07 11:16:57,317 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.12 11:16:56" (1/3) ... [2019-12-07 11:16:57,317 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@480cb8ba and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.12 11:16:57, skipping insertion in model container [2019-12-07 11:16:57,317 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 11:16:56" (2/3) ... [2019-12-07 11:16:57,318 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@480cb8ba and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.12 11:16:57, skipping insertion in model container [2019-12-07 11:16:57,318 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 11:16:57" (3/3) ... [2019-12-07 11:16:57,319 INFO L109 eAbstractionObserver]: Analyzing ICFG mix022_rmo.opt.i [2019-12-07 11:16:57,325 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-12-07 11:16:57,325 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-07 11:16:57,329 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2019-12-07 11:16:57,330 INFO L339 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2019-12-07 11:16:57,353 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:16:57,353 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:16:57,354 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:16:57,354 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:16:57,354 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:16:57,354 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:16:57,355 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:16:57,355 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:16:57,355 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:16:57,355 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:16:57,356 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:16:57,356 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:16:57,356 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:16:57,356 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:16:57,356 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:16:57,357 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:16:57,357 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:16:57,357 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:16:57,357 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:16:57,357 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:16:57,358 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:16:57,358 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:16:57,358 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:16:57,358 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:16:57,358 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:16:57,358 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:16:57,359 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:16:57,359 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:16:57,359 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:16:57,359 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:16:57,359 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:16:57,360 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:16:57,360 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:16:57,360 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:16:57,361 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:16:57,361 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:16:57,361 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:16:57,361 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:16:57,362 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:16:57,362 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:16:57,362 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:16:57,362 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:16:57,362 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:16:57,362 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:16:57,363 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:16:57,363 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:16:57,363 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:16:57,363 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:16:57,363 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:16:57,364 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:16:57,364 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:16:57,364 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:16:57,364 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:16:57,364 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:16:57,364 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:16:57,364 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:16:57,365 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:16:57,365 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:16:57,365 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:16:57,365 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:16:57,365 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:16:57,366 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:16:57,366 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:16:57,366 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:16:57,366 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:16:57,366 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:16:57,366 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:16:57,367 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:16:57,367 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:16:57,367 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:16:57,367 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:16:57,367 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:16:57,367 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:16:57,368 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:16:57,368 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:16:57,368 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:16:57,368 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:16:57,368 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:16:57,368 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:16:57,369 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:16:57,369 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:16:57,369 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:16:57,369 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:16:57,369 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:16:57,369 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:16:57,370 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:16:57,370 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:16:57,370 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:16:57,370 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:16:57,370 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:16:57,370 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:16:57,371 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:16:57,371 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:16:57,371 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:16:57,371 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:16:57,371 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:16:57,371 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:16:57,372 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:16:57,372 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:16:57,372 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:16:57,372 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:16:57,372 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:16:57,372 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:16:57,373 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:16:57,373 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:16:57,373 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:16:57,373 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:16:57,373 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:16:57,373 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:16:57,374 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:16:57,374 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:16:57,374 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:16:57,374 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:16:57,374 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:16:57,374 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:16:57,375 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:16:57,375 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:16:57,375 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:16:57,375 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:16:57,375 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:16:57,375 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:16:57,375 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:16:57,376 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:16:57,376 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:16:57,376 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:16:57,376 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:16:57,376 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:16:57,376 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:16:57,377 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:16:57,377 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:16:57,377 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:16:57,377 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:16:57,377 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:16:57,377 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:16:57,378 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:16:57,378 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:16:57,378 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:16:57,378 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:16:57,378 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:16:57,378 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:16:57,378 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:16:57,379 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:16:57,379 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:16:57,379 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:16:57,379 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:16:57,379 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:16:57,379 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:16:57,380 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:16:57,380 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:16:57,380 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:16:57,380 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:16:57,380 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:16:57,393 INFO L249 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2019-12-07 11:16:57,405 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-07 11:16:57,406 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-07 11:16:57,406 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-07 11:16:57,406 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-12-07 11:16:57,406 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-07 11:16:57,406 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-07 11:16:57,406 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-07 11:16:57,406 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-07 11:16:57,416 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 147 places, 181 transitions [2019-12-07 11:16:57,417 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 147 places, 181 transitions [2019-12-07 11:16:57,464 INFO L134 PetriNetUnfolder]: 41/179 cut-off events. [2019-12-07 11:16:57,464 INFO L135 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-07 11:16:57,472 INFO L76 FinitePrefix]: Finished finitePrefix Result has 186 conditions, 179 events. 41/179 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 562 event pairs. 6/142 useless extension candidates. Maximal degree in co-relation 150. Up to 2 conditions per place. [2019-12-07 11:16:57,483 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 147 places, 181 transitions [2019-12-07 11:16:57,508 INFO L134 PetriNetUnfolder]: 41/179 cut-off events. [2019-12-07 11:16:57,508 INFO L135 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-07 11:16:57,512 INFO L76 FinitePrefix]: Finished finitePrefix Result has 186 conditions, 179 events. 41/179 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 562 event pairs. 6/142 useless extension candidates. Maximal degree in co-relation 150. Up to 2 conditions per place. [2019-12-07 11:16:57,523 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 12056 [2019-12-07 11:16:57,523 INFO L170 etLargeBlockEncoding]: Semantic Check. [2019-12-07 11:17:00,346 WARN L192 SmtUtils]: Spent 125.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 81 [2019-12-07 11:17:00,431 INFO L206 etLargeBlockEncoding]: Checked pairs total: 47763 [2019-12-07 11:17:00,431 INFO L214 etLargeBlockEncoding]: Total number of compositions: 101 [2019-12-07 11:17:00,433 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 77 places, 87 transitions [2019-12-07 11:17:00,753 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 8640 states. [2019-12-07 11:17:00,754 INFO L276 IsEmpty]: Start isEmpty. Operand 8640 states. [2019-12-07 11:17:00,758 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2019-12-07 11:17:00,758 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 11:17:00,759 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1] [2019-12-07 11:17:00,759 INFO L410 AbstractCegarLoop]: === Iteration 1 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 11:17:00,762 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 11:17:00,763 INFO L82 PathProgramCache]: Analyzing trace with hash 789332, now seen corresponding path program 1 times [2019-12-07 11:17:00,769 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 11:17:00,769 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2043339502] [2019-12-07 11:17:00,769 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 11:17:00,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:17:00,902 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 11:17:00,902 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2043339502] [2019-12-07 11:17:00,903 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 11:17:00,903 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-07 11:17:00,904 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1135007549] [2019-12-07 11:17:00,907 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 11:17:00,907 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 11:17:00,916 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 11:17:00,916 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 11:17:00,918 INFO L87 Difference]: Start difference. First operand 8640 states. Second operand 3 states. [2019-12-07 11:17:01,103 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 11:17:01,103 INFO L93 Difference]: Finished difference Result 8468 states and 27386 transitions. [2019-12-07 11:17:01,104 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 11:17:01,105 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 [2019-12-07 11:17:01,105 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 11:17:01,164 INFO L225 Difference]: With dead ends: 8468 [2019-12-07 11:17:01,164 INFO L226 Difference]: Without dead ends: 7976 [2019-12-07 11:17:01,165 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 11:17:01,265 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7976 states. [2019-12-07 11:17:01,426 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7976 to 7976. [2019-12-07 11:17:01,427 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7976 states. [2019-12-07 11:17:01,456 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7976 states to 7976 states and 25749 transitions. [2019-12-07 11:17:01,457 INFO L78 Accepts]: Start accepts. Automaton has 7976 states and 25749 transitions. Word has length 3 [2019-12-07 11:17:01,457 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 11:17:01,457 INFO L462 AbstractCegarLoop]: Abstraction has 7976 states and 25749 transitions. [2019-12-07 11:17:01,457 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 11:17:01,457 INFO L276 IsEmpty]: Start isEmpty. Operand 7976 states and 25749 transitions. [2019-12-07 11:17:01,459 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-12-07 11:17:01,460 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 11:17:01,460 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 11:17:01,460 INFO L410 AbstractCegarLoop]: === Iteration 2 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 11:17:01,460 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 11:17:01,460 INFO L82 PathProgramCache]: Analyzing trace with hash -374477309, now seen corresponding path program 1 times [2019-12-07 11:17:01,460 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 11:17:01,460 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1774691611] [2019-12-07 11:17:01,461 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 11:17:01,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:17:01,533 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 11:17:01,533 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1774691611] [2019-12-07 11:17:01,533 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 11:17:01,533 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 11:17:01,534 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1874248544] [2019-12-07 11:17:01,535 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 11:17:01,535 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 11:17:01,535 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 11:17:01,535 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 11:17:01,535 INFO L87 Difference]: Start difference. First operand 7976 states and 25749 transitions. Second operand 4 states. [2019-12-07 11:17:01,780 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 11:17:01,780 INFO L93 Difference]: Finished difference Result 12178 states and 37599 transitions. [2019-12-07 11:17:01,781 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-07 11:17:01,781 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 11 [2019-12-07 11:17:01,781 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 11:17:01,839 INFO L225 Difference]: With dead ends: 12178 [2019-12-07 11:17:01,839 INFO L226 Difference]: Without dead ends: 12171 [2019-12-07 11:17:01,840 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-07 11:17:01,953 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12171 states. [2019-12-07 11:17:02,129 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12171 to 10893. [2019-12-07 11:17:02,129 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10893 states. [2019-12-07 11:17:02,151 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10893 states to 10893 states and 34228 transitions. [2019-12-07 11:17:02,152 INFO L78 Accepts]: Start accepts. Automaton has 10893 states and 34228 transitions. Word has length 11 [2019-12-07 11:17:02,152 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 11:17:02,152 INFO L462 AbstractCegarLoop]: Abstraction has 10893 states and 34228 transitions. [2019-12-07 11:17:02,152 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 11:17:02,152 INFO L276 IsEmpty]: Start isEmpty. Operand 10893 states and 34228 transitions. [2019-12-07 11:17:02,156 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-12-07 11:17:02,157 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 11:17:02,157 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 11:17:02,157 INFO L410 AbstractCegarLoop]: === Iteration 3 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 11:17:02,157 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 11:17:02,157 INFO L82 PathProgramCache]: Analyzing trace with hash 56348668, now seen corresponding path program 1 times [2019-12-07 11:17:02,157 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 11:17:02,157 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [993676633] [2019-12-07 11:17:02,158 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 11:17:02,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:17:02,219 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 11:17:02,219 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [993676633] [2019-12-07 11:17:02,219 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 11:17:02,219 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 11:17:02,220 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [953475413] [2019-12-07 11:17:02,220 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 11:17:02,220 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 11:17:02,220 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 11:17:02,220 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 11:17:02,221 INFO L87 Difference]: Start difference. First operand 10893 states and 34228 transitions. Second operand 4 states. [2019-12-07 11:17:02,380 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 11:17:02,380 INFO L93 Difference]: Finished difference Result 13366 states and 41774 transitions. [2019-12-07 11:17:02,380 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-07 11:17:02,380 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 14 [2019-12-07 11:17:02,381 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 11:17:02,406 INFO L225 Difference]: With dead ends: 13366 [2019-12-07 11:17:02,406 INFO L226 Difference]: Without dead ends: 13366 [2019-12-07 11:17:02,406 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 11:17:02,477 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13366 states. [2019-12-07 11:17:02,631 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13366 to 11878. [2019-12-07 11:17:02,631 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11878 states. [2019-12-07 11:17:02,658 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11878 states to 11878 states and 37348 transitions. [2019-12-07 11:17:02,658 INFO L78 Accepts]: Start accepts. Automaton has 11878 states and 37348 transitions. Word has length 14 [2019-12-07 11:17:02,659 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 11:17:02,659 INFO L462 AbstractCegarLoop]: Abstraction has 11878 states and 37348 transitions. [2019-12-07 11:17:02,659 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 11:17:02,659 INFO L276 IsEmpty]: Start isEmpty. Operand 11878 states and 37348 transitions. [2019-12-07 11:17:02,661 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-12-07 11:17:02,662 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 11:17:02,662 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 11:17:02,662 INFO L410 AbstractCegarLoop]: === Iteration 4 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 11:17:02,662 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 11:17:02,662 INFO L82 PathProgramCache]: Analyzing trace with hash 525416671, now seen corresponding path program 1 times [2019-12-07 11:17:02,662 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 11:17:02,663 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [414190894] [2019-12-07 11:17:02,663 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 11:17:02,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:17:02,723 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 11:17:02,723 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [414190894] [2019-12-07 11:17:02,723 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 11:17:02,724 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 11:17:02,724 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [466641448] [2019-12-07 11:17:02,724 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 11:17:02,724 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 11:17:02,724 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 11:17:02,724 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 11:17:02,725 INFO L87 Difference]: Start difference. First operand 11878 states and 37348 transitions. Second operand 3 states. [2019-12-07 11:17:02,784 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 11:17:02,784 INFO L93 Difference]: Finished difference Result 11232 states and 34748 transitions. [2019-12-07 11:17:02,784 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 11:17:02,784 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 16 [2019-12-07 11:17:02,784 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 11:17:02,797 INFO L225 Difference]: With dead ends: 11232 [2019-12-07 11:17:02,797 INFO L226 Difference]: Without dead ends: 11232 [2019-12-07 11:17:02,798 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 11:17:02,856 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11232 states. [2019-12-07 11:17:02,961 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11232 to 11152. [2019-12-07 11:17:02,961 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11152 states. [2019-12-07 11:17:02,976 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11152 states to 11152 states and 34516 transitions. [2019-12-07 11:17:02,976 INFO L78 Accepts]: Start accepts. Automaton has 11152 states and 34516 transitions. Word has length 16 [2019-12-07 11:17:02,976 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 11:17:02,976 INFO L462 AbstractCegarLoop]: Abstraction has 11152 states and 34516 transitions. [2019-12-07 11:17:02,976 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 11:17:02,976 INFO L276 IsEmpty]: Start isEmpty. Operand 11152 states and 34516 transitions. [2019-12-07 11:17:02,978 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-12-07 11:17:02,978 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 11:17:02,978 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 11:17:02,978 INFO L410 AbstractCegarLoop]: === Iteration 5 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 11:17:02,978 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 11:17:02,978 INFO L82 PathProgramCache]: Analyzing trace with hash 1080749242, now seen corresponding path program 1 times [2019-12-07 11:17:02,978 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 11:17:02,979 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1258868452] [2019-12-07 11:17:02,979 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 11:17:02,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:17:03,023 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 11:17:03,023 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1258868452] [2019-12-07 11:17:03,024 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 11:17:03,024 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 11:17:03,024 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [306837188] [2019-12-07 11:17:03,024 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 11:17:03,024 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 11:17:03,024 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 11:17:03,024 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 11:17:03,025 INFO L87 Difference]: Start difference. First operand 11152 states and 34516 transitions. Second operand 4 states. [2019-12-07 11:17:03,043 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 11:17:03,043 INFO L93 Difference]: Finished difference Result 2148 states and 5359 transitions. [2019-12-07 11:17:03,043 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 11:17:03,043 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 16 [2019-12-07 11:17:03,044 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 11:17:03,045 INFO L225 Difference]: With dead ends: 2148 [2019-12-07 11:17:03,045 INFO L226 Difference]: Without dead ends: 1516 [2019-12-07 11:17:03,045 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 11:17:03,048 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1516 states. [2019-12-07 11:17:03,057 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1516 to 1516. [2019-12-07 11:17:03,058 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1516 states. [2019-12-07 11:17:03,059 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1516 states to 1516 states and 3350 transitions. [2019-12-07 11:17:03,059 INFO L78 Accepts]: Start accepts. Automaton has 1516 states and 3350 transitions. Word has length 16 [2019-12-07 11:17:03,059 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 11:17:03,059 INFO L462 AbstractCegarLoop]: Abstraction has 1516 states and 3350 transitions. [2019-12-07 11:17:03,059 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 11:17:03,059 INFO L276 IsEmpty]: Start isEmpty. Operand 1516 states and 3350 transitions. [2019-12-07 11:17:03,061 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-12-07 11:17:03,061 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 11:17:03,061 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 11:17:03,061 INFO L410 AbstractCegarLoop]: === Iteration 6 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 11:17:03,061 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 11:17:03,061 INFO L82 PathProgramCache]: Analyzing trace with hash -139254967, now seen corresponding path program 1 times [2019-12-07 11:17:03,061 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 11:17:03,061 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1931338676] [2019-12-07 11:17:03,061 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 11:17:03,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:17:03,137 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 11:17:03,137 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1931338676] [2019-12-07 11:17:03,137 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 11:17:03,138 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 11:17:03,138 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [609820384] [2019-12-07 11:17:03,138 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-07 11:17:03,138 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 11:17:03,138 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-07 11:17:03,138 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-12-07 11:17:03,139 INFO L87 Difference]: Start difference. First operand 1516 states and 3350 transitions. Second operand 6 states. [2019-12-07 11:17:03,481 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 11:17:03,482 INFO L93 Difference]: Finished difference Result 4211 states and 9200 transitions. [2019-12-07 11:17:03,482 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-12-07 11:17:03,482 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 25 [2019-12-07 11:17:03,482 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 11:17:03,485 INFO L225 Difference]: With dead ends: 4211 [2019-12-07 11:17:03,485 INFO L226 Difference]: Without dead ends: 4176 [2019-12-07 11:17:03,485 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=39, Invalid=71, Unknown=0, NotChecked=0, Total=110 [2019-12-07 11:17:03,490 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4176 states. [2019-12-07 11:17:03,508 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4176 to 1850. [2019-12-07 11:17:03,509 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1850 states. [2019-12-07 11:17:03,510 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1850 states to 1850 states and 4163 transitions. [2019-12-07 11:17:03,511 INFO L78 Accepts]: Start accepts. Automaton has 1850 states and 4163 transitions. Word has length 25 [2019-12-07 11:17:03,511 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 11:17:03,511 INFO L462 AbstractCegarLoop]: Abstraction has 1850 states and 4163 transitions. [2019-12-07 11:17:03,511 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-07 11:17:03,511 INFO L276 IsEmpty]: Start isEmpty. Operand 1850 states and 4163 transitions. [2019-12-07 11:17:03,512 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-12-07 11:17:03,513 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 11:17:03,513 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 11:17:03,513 INFO L410 AbstractCegarLoop]: === Iteration 7 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 11:17:03,513 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 11:17:03,513 INFO L82 PathProgramCache]: Analyzing trace with hash 2133801578, now seen corresponding path program 1 times [2019-12-07 11:17:03,513 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 11:17:03,513 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1130416613] [2019-12-07 11:17:03,513 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 11:17:03,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:17:03,598 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 11:17:03,598 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1130416613] [2019-12-07 11:17:03,598 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 11:17:03,598 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 11:17:03,598 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1420432344] [2019-12-07 11:17:03,599 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-07 11:17:03,599 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 11:17:03,599 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-07 11:17:03,599 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-12-07 11:17:03,599 INFO L87 Difference]: Start difference. First operand 1850 states and 4163 transitions. Second operand 6 states. [2019-12-07 11:17:03,937 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 11:17:03,937 INFO L93 Difference]: Finished difference Result 3920 states and 8502 transitions. [2019-12-07 11:17:03,938 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-12-07 11:17:03,938 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 26 [2019-12-07 11:17:03,938 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 11:17:03,940 INFO L225 Difference]: With dead ends: 3920 [2019-12-07 11:17:03,940 INFO L226 Difference]: Without dead ends: 3891 [2019-12-07 11:17:03,941 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 2 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=39, Invalid=71, Unknown=0, NotChecked=0, Total=110 [2019-12-07 11:17:03,946 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3891 states. [2019-12-07 11:17:03,961 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3891 to 1829. [2019-12-07 11:17:03,961 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1829 states. [2019-12-07 11:17:03,963 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1829 states to 1829 states and 4135 transitions. [2019-12-07 11:17:03,963 INFO L78 Accepts]: Start accepts. Automaton has 1829 states and 4135 transitions. Word has length 26 [2019-12-07 11:17:03,963 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 11:17:03,963 INFO L462 AbstractCegarLoop]: Abstraction has 1829 states and 4135 transitions. [2019-12-07 11:17:03,963 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-07 11:17:03,963 INFO L276 IsEmpty]: Start isEmpty. Operand 1829 states and 4135 transitions. [2019-12-07 11:17:03,965 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-12-07 11:17:03,965 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 11:17:03,965 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 11:17:03,965 INFO L410 AbstractCegarLoop]: === Iteration 8 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 11:17:03,965 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 11:17:03,965 INFO L82 PathProgramCache]: Analyzing trace with hash -312964189, now seen corresponding path program 1 times [2019-12-07 11:17:03,965 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 11:17:03,965 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2095705649] [2019-12-07 11:17:03,966 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 11:17:03,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:17:04,030 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 11:17:04,031 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2095705649] [2019-12-07 11:17:04,031 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 11:17:04,031 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 11:17:04,031 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [155012876] [2019-12-07 11:17:04,031 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 11:17:04,031 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 11:17:04,031 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 11:17:04,032 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-07 11:17:04,032 INFO L87 Difference]: Start difference. First operand 1829 states and 4135 transitions. Second operand 4 states. [2019-12-07 11:17:04,045 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 11:17:04,045 INFO L93 Difference]: Finished difference Result 3262 states and 7379 transitions. [2019-12-07 11:17:04,046 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 11:17:04,046 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 27 [2019-12-07 11:17:04,046 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 11:17:04,048 INFO L225 Difference]: With dead ends: 3262 [2019-12-07 11:17:04,048 INFO L226 Difference]: Without dead ends: 2790 [2019-12-07 11:17:04,048 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-07 11:17:04,052 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2790 states. [2019-12-07 11:17:04,068 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2790 to 2762. [2019-12-07 11:17:04,068 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2762 states. [2019-12-07 11:17:04,070 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2762 states to 2762 states and 6322 transitions. [2019-12-07 11:17:04,071 INFO L78 Accepts]: Start accepts. Automaton has 2762 states and 6322 transitions. Word has length 27 [2019-12-07 11:17:04,071 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 11:17:04,071 INFO L462 AbstractCegarLoop]: Abstraction has 2762 states and 6322 transitions. [2019-12-07 11:17:04,071 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 11:17:04,071 INFO L276 IsEmpty]: Start isEmpty. Operand 2762 states and 6322 transitions. [2019-12-07 11:17:04,073 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2019-12-07 11:17:04,074 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 11:17:04,074 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 11:17:04,074 INFO L410 AbstractCegarLoop]: === Iteration 9 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 11:17:04,074 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 11:17:04,074 INFO L82 PathProgramCache]: Analyzing trace with hash -5510903, now seen corresponding path program 1 times [2019-12-07 11:17:04,074 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 11:17:04,074 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [908304732] [2019-12-07 11:17:04,074 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 11:17:04,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:17:04,126 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 11:17:04,127 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [908304732] [2019-12-07 11:17:04,127 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 11:17:04,127 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 11:17:04,127 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [924943003] [2019-12-07 11:17:04,127 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-07 11:17:04,127 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 11:17:04,127 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-07 11:17:04,128 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-07 11:17:04,128 INFO L87 Difference]: Start difference. First operand 2762 states and 6322 transitions. Second operand 5 states. [2019-12-07 11:17:04,157 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 11:17:04,157 INFO L93 Difference]: Finished difference Result 1446 states and 3288 transitions. [2019-12-07 11:17:04,158 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-07 11:17:04,158 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 28 [2019-12-07 11:17:04,158 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 11:17:04,159 INFO L225 Difference]: With dead ends: 1446 [2019-12-07 11:17:04,160 INFO L226 Difference]: Without dead ends: 1289 [2019-12-07 11:17:04,160 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 11:17:04,163 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1289 states. [2019-12-07 11:17:04,171 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1289 to 829. [2019-12-07 11:17:04,171 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 829 states. [2019-12-07 11:17:04,172 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 829 states to 829 states and 1865 transitions. [2019-12-07 11:17:04,172 INFO L78 Accepts]: Start accepts. Automaton has 829 states and 1865 transitions. Word has length 28 [2019-12-07 11:17:04,172 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 11:17:04,172 INFO L462 AbstractCegarLoop]: Abstraction has 829 states and 1865 transitions. [2019-12-07 11:17:04,172 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-07 11:17:04,172 INFO L276 IsEmpty]: Start isEmpty. Operand 829 states and 1865 transitions. [2019-12-07 11:17:04,174 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2019-12-07 11:17:04,174 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 11:17:04,174 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] [2019-12-07 11:17:04,174 INFO L410 AbstractCegarLoop]: === Iteration 10 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 11:17:04,174 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 11:17:04,174 INFO L82 PathProgramCache]: Analyzing trace with hash 680455281, now seen corresponding path program 1 times [2019-12-07 11:17:04,175 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 11:17:04,175 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [588712307] [2019-12-07 11:17:04,175 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 11:17:04,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:17:04,257 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 11:17:04,257 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [588712307] [2019-12-07 11:17:04,257 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 11:17:04,258 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-07 11:17:04,258 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [952594666] [2019-12-07 11:17:04,258 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-07 11:17:04,258 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 11:17:04,258 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-07 11:17:04,259 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2019-12-07 11:17:04,259 INFO L87 Difference]: Start difference. First operand 829 states and 1865 transitions. Second operand 7 states. [2019-12-07 11:17:04,995 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 11:17:04,995 INFO L93 Difference]: Finished difference Result 2349 states and 5081 transitions. [2019-12-07 11:17:04,996 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-12-07 11:17:04,996 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 52 [2019-12-07 11:17:04,996 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 11:17:04,998 INFO L225 Difference]: With dead ends: 2349 [2019-12-07 11:17:04,998 INFO L226 Difference]: Without dead ends: 2349 [2019-12-07 11:17:04,999 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 10 SyntacticMatches, 2 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 55 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=93, Invalid=249, Unknown=0, NotChecked=0, Total=342 [2019-12-07 11:17:05,003 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2349 states. [2019-12-07 11:17:05,017 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2349 to 1113. [2019-12-07 11:17:05,017 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1113 states. [2019-12-07 11:17:05,018 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1113 states to 1113 states and 2480 transitions. [2019-12-07 11:17:05,018 INFO L78 Accepts]: Start accepts. Automaton has 1113 states and 2480 transitions. Word has length 52 [2019-12-07 11:17:05,019 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 11:17:05,019 INFO L462 AbstractCegarLoop]: Abstraction has 1113 states and 2480 transitions. [2019-12-07 11:17:05,019 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-07 11:17:05,019 INFO L276 IsEmpty]: Start isEmpty. Operand 1113 states and 2480 transitions. [2019-12-07 11:17:05,020 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2019-12-07 11:17:05,020 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 11:17:05,021 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] [2019-12-07 11:17:05,021 INFO L410 AbstractCegarLoop]: === Iteration 11 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 11:17:05,021 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 11:17:05,021 INFO L82 PathProgramCache]: Analyzing trace with hash -126849823, now seen corresponding path program 2 times [2019-12-07 11:17:05,021 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 11:17:05,021 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1155181434] [2019-12-07 11:17:05,021 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 11:17:05,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:17:05,322 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 11:17:05,323 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1155181434] [2019-12-07 11:17:05,323 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 11:17:05,323 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2019-12-07 11:17:05,323 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1831717854] [2019-12-07 11:17:05,323 INFO L442 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-12-07 11:17:05,323 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 11:17:05,323 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-12-07 11:17:05,323 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=150, Unknown=0, NotChecked=0, Total=182 [2019-12-07 11:17:05,324 INFO L87 Difference]: Start difference. First operand 1113 states and 2480 transitions. Second operand 14 states. [2019-12-07 11:17:06,928 WARN L192 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 48 DAG size of output: 44 [2019-12-07 11:17:07,119 WARN L192 SmtUtils]: Spent 138.00 ms on a formula simplification. DAG size of input: 42 DAG size of output: 40 [2019-12-07 11:17:07,258 WARN L192 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 35 DAG size of output: 33 [2019-12-07 11:17:07,454 WARN L192 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 29 DAG size of output: 28 [2019-12-07 11:17:07,592 WARN L192 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 26 DAG size of output: 25 [2019-12-07 11:17:12,277 WARN L192 SmtUtils]: Spent 144.00 ms on a formula simplification. DAG size of input: 37 DAG size of output: 27 [2019-12-07 11:17:12,586 WARN L192 SmtUtils]: Spent 213.00 ms on a formula simplification. DAG size of input: 37 DAG size of output: 33 [2019-12-07 11:17:13,517 WARN L192 SmtUtils]: Spent 198.00 ms on a formula simplification. DAG size of input: 44 DAG size of output: 41 [2019-12-07 11:17:13,852 WARN L192 SmtUtils]: Spent 149.00 ms on a formula simplification. DAG size of input: 28 DAG size of output: 25 [2019-12-07 11:17:14,992 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 11:17:14,992 INFO L93 Difference]: Finished difference Result 6114 states and 13231 transitions. [2019-12-07 11:17:14,992 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 88 states. [2019-12-07 11:17:14,993 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 52 [2019-12-07 11:17:14,993 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 11:17:14,997 INFO L225 Difference]: With dead ends: 6114 [2019-12-07 11:17:14,997 INFO L226 Difference]: Without dead ends: 5358 [2019-12-07 11:17:14,999 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 96 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 92 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3294 ImplicationChecksByTransitivity, 5.0s TimeCoverageRelationStatistics Valid=1548, Invalid=7194, Unknown=0, NotChecked=0, Total=8742 [2019-12-07 11:17:15,007 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5358 states. [2019-12-07 11:17:15,031 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5358 to 1218. [2019-12-07 11:17:15,031 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1218 states. [2019-12-07 11:17:15,033 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1218 states to 1218 states and 2750 transitions. [2019-12-07 11:17:15,033 INFO L78 Accepts]: Start accepts. Automaton has 1218 states and 2750 transitions. Word has length 52 [2019-12-07 11:17:15,033 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 11:17:15,033 INFO L462 AbstractCegarLoop]: Abstraction has 1218 states and 2750 transitions. [2019-12-07 11:17:15,033 INFO L463 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-12-07 11:17:15,033 INFO L276 IsEmpty]: Start isEmpty. Operand 1218 states and 2750 transitions. [2019-12-07 11:17:15,035 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2019-12-07 11:17:15,035 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 11:17:15,035 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] [2019-12-07 11:17:15,035 INFO L410 AbstractCegarLoop]: === Iteration 12 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 11:17:15,035 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 11:17:15,035 INFO L82 PathProgramCache]: Analyzing trace with hash -673157137, now seen corresponding path program 3 times [2019-12-07 11:17:15,035 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 11:17:15,035 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1317771028] [2019-12-07 11:17:15,035 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 11:17:15,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:17:15,172 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 11:17:15,172 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1317771028] [2019-12-07 11:17:15,173 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 11:17:15,173 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-07 11:17:15,173 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [330972325] [2019-12-07 11:17:15,173 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-07 11:17:15,173 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 11:17:15,173 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-07 11:17:15,173 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-12-07 11:17:15,174 INFO L87 Difference]: Start difference. First operand 1218 states and 2750 transitions. Second operand 9 states. [2019-12-07 11:17:16,329 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 11:17:16,329 INFO L93 Difference]: Finished difference Result 9448 states and 20825 transitions. [2019-12-07 11:17:16,329 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2019-12-07 11:17:16,329 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 52 [2019-12-07 11:17:16,330 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 11:17:16,335 INFO L225 Difference]: With dead ends: 9448 [2019-12-07 11:17:16,335 INFO L226 Difference]: Without dead ends: 7103 [2019-12-07 11:17:16,336 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 786 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=547, Invalid=1805, Unknown=0, NotChecked=0, Total=2352 [2019-12-07 11:17:16,344 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7103 states. [2019-12-07 11:17:16,368 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7103 to 1361. [2019-12-07 11:17:16,368 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1361 states. [2019-12-07 11:17:16,370 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1361 states to 1361 states and 3026 transitions. [2019-12-07 11:17:16,370 INFO L78 Accepts]: Start accepts. Automaton has 1361 states and 3026 transitions. Word has length 52 [2019-12-07 11:17:16,370 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 11:17:16,370 INFO L462 AbstractCegarLoop]: Abstraction has 1361 states and 3026 transitions. [2019-12-07 11:17:16,370 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-07 11:17:16,370 INFO L276 IsEmpty]: Start isEmpty. Operand 1361 states and 3026 transitions. [2019-12-07 11:17:16,371 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2019-12-07 11:17:16,372 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 11:17:16,372 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] [2019-12-07 11:17:16,372 INFO L410 AbstractCegarLoop]: === Iteration 13 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 11:17:16,372 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 11:17:16,372 INFO L82 PathProgramCache]: Analyzing trace with hash -1769358026, now seen corresponding path program 1 times [2019-12-07 11:17:16,372 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 11:17:16,372 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [358799706] [2019-12-07 11:17:16,372 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 11:17:16,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:17:16,393 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 11:17:16,394 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [358799706] [2019-12-07 11:17:16,394 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 11:17:16,394 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 11:17:16,394 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1157303721] [2019-12-07 11:17:16,394 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 11:17:16,394 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 11:17:16,394 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 11:17:16,394 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 11:17:16,394 INFO L87 Difference]: Start difference. First operand 1361 states and 3026 transitions. Second operand 3 states. [2019-12-07 11:17:16,416 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 11:17:16,416 INFO L93 Difference]: Finished difference Result 1630 states and 3497 transitions. [2019-12-07 11:17:16,417 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 11:17:16,417 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 52 [2019-12-07 11:17:16,417 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 11:17:16,418 INFO L225 Difference]: With dead ends: 1630 [2019-12-07 11:17:16,418 INFO L226 Difference]: Without dead ends: 1594 [2019-12-07 11:17:16,418 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 11:17:16,420 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1594 states. [2019-12-07 11:17:16,428 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1594 to 1296. [2019-12-07 11:17:16,429 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1296 states. [2019-12-07 11:17:16,430 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1296 states to 1296 states and 2833 transitions. [2019-12-07 11:17:16,430 INFO L78 Accepts]: Start accepts. Automaton has 1296 states and 2833 transitions. Word has length 52 [2019-12-07 11:17:16,430 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 11:17:16,430 INFO L462 AbstractCegarLoop]: Abstraction has 1296 states and 2833 transitions. [2019-12-07 11:17:16,430 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 11:17:16,430 INFO L276 IsEmpty]: Start isEmpty. Operand 1296 states and 2833 transitions. [2019-12-07 11:17:16,431 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2019-12-07 11:17:16,431 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 11:17:16,432 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] [2019-12-07 11:17:16,432 INFO L410 AbstractCegarLoop]: === Iteration 14 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 11:17:16,432 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 11:17:16,432 INFO L82 PathProgramCache]: Analyzing trace with hash -610861021, now seen corresponding path program 4 times [2019-12-07 11:17:16,432 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 11:17:16,432 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [350246614] [2019-12-07 11:17:16,432 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 11:17:16,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:17:16,542 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 11:17:16,543 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [350246614] [2019-12-07 11:17:16,543 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 11:17:16,543 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-12-07 11:17:16,543 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1749871290] [2019-12-07 11:17:16,543 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-07 11:17:16,543 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 11:17:16,543 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-07 11:17:16,543 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2019-12-07 11:17:16,544 INFO L87 Difference]: Start difference. First operand 1296 states and 2833 transitions. Second operand 9 states. [2019-12-07 11:17:17,265 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 11:17:17,265 INFO L93 Difference]: Finished difference Result 2351 states and 4927 transitions. [2019-12-07 11:17:17,266 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-12-07 11:17:17,266 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 52 [2019-12-07 11:17:17,266 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 11:17:17,267 INFO L225 Difference]: With dead ends: 2351 [2019-12-07 11:17:17,267 INFO L226 Difference]: Without dead ends: 2343 [2019-12-07 11:17:17,268 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 3 SyntacticMatches, 3 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 60 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=83, Invalid=259, Unknown=0, NotChecked=0, Total=342 [2019-12-07 11:17:17,270 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2343 states. [2019-12-07 11:17:17,280 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2343 to 1070. [2019-12-07 11:17:17,280 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1070 states. [2019-12-07 11:17:17,281 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1070 states to 1070 states and 2329 transitions. [2019-12-07 11:17:17,281 INFO L78 Accepts]: Start accepts. Automaton has 1070 states and 2329 transitions. Word has length 52 [2019-12-07 11:17:17,281 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 11:17:17,281 INFO L462 AbstractCegarLoop]: Abstraction has 1070 states and 2329 transitions. [2019-12-07 11:17:17,281 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-07 11:17:17,281 INFO L276 IsEmpty]: Start isEmpty. Operand 1070 states and 2329 transitions. [2019-12-07 11:17:17,283 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2019-12-07 11:17:17,283 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 11:17:17,283 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] [2019-12-07 11:17:17,283 INFO L410 AbstractCegarLoop]: === Iteration 15 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 11:17:17,283 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 11:17:17,283 INFO L82 PathProgramCache]: Analyzing trace with hash -2030587939, now seen corresponding path program 5 times [2019-12-07 11:17:17,283 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 11:17:17,283 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [728495078] [2019-12-07 11:17:17,284 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 11:17:17,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:17:17,584 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 11:17:17,585 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [728495078] [2019-12-07 11:17:17,585 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 11:17:17,585 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2019-12-07 11:17:17,585 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [867463567] [2019-12-07 11:17:17,585 INFO L442 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-12-07 11:17:17,585 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 11:17:17,585 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-12-07 11:17:17,585 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=172, Unknown=0, NotChecked=0, Total=210 [2019-12-07 11:17:17,586 INFO L87 Difference]: Start difference. First operand 1070 states and 2329 transitions. Second operand 15 states. [2019-12-07 11:17:19,541 WARN L192 SmtUtils]: Spent 116.00 ms on a formula simplification. DAG size of input: 42 DAG size of output: 35 [2019-12-07 11:17:20,479 WARN L192 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 32 DAG size of output: 30 [2019-12-07 11:17:20,975 WARN L192 SmtUtils]: Spent 134.00 ms on a formula simplification. DAG size of input: 35 DAG size of output: 33 [2019-12-07 11:17:21,154 WARN L192 SmtUtils]: Spent 117.00 ms on a formula simplification. DAG size of input: 32 DAG size of output: 30 [2019-12-07 11:17:21,696 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 11:17:21,696 INFO L93 Difference]: Finished difference Result 4803 states and 10019 transitions. [2019-12-07 11:17:21,696 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 56 states. [2019-12-07 11:17:21,696 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 52 [2019-12-07 11:17:21,697 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 11:17:21,699 INFO L225 Difference]: With dead ends: 4803 [2019-12-07 11:17:21,699 INFO L226 Difference]: Without dead ends: 4067 [2019-12-07 11:17:21,700 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 57 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1114 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=622, Invalid=2800, Unknown=0, NotChecked=0, Total=3422 [2019-12-07 11:17:21,704 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4067 states. [2019-12-07 11:17:21,718 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4067 to 1141. [2019-12-07 11:17:21,718 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1141 states. [2019-12-07 11:17:21,719 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1141 states to 1141 states and 2480 transitions. [2019-12-07 11:17:21,719 INFO L78 Accepts]: Start accepts. Automaton has 1141 states and 2480 transitions. Word has length 52 [2019-12-07 11:17:21,719 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 11:17:21,719 INFO L462 AbstractCegarLoop]: Abstraction has 1141 states and 2480 transitions. [2019-12-07 11:17:21,719 INFO L463 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-12-07 11:17:21,719 INFO L276 IsEmpty]: Start isEmpty. Operand 1141 states and 2480 transitions. [2019-12-07 11:17:21,720 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2019-12-07 11:17:21,720 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 11:17:21,721 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] [2019-12-07 11:17:21,721 INFO L410 AbstractCegarLoop]: === Iteration 16 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 11:17:21,721 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 11:17:21,721 INFO L82 PathProgramCache]: Analyzing trace with hash 1769155969, now seen corresponding path program 6 times [2019-12-07 11:17:21,721 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 11:17:21,721 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1244284593] [2019-12-07 11:17:21,721 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 11:17:21,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:17:21,751 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 11:17:21,752 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1244284593] [2019-12-07 11:17:21,752 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 11:17:21,752 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 11:17:21,752 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [766757793] [2019-12-07 11:17:21,752 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 11:17:21,752 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 11:17:21,752 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 11:17:21,752 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 11:17:21,752 INFO L87 Difference]: Start difference. First operand 1141 states and 2480 transitions. Second operand 3 states. [2019-12-07 11:17:21,761 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 11:17:21,761 INFO L93 Difference]: Finished difference Result 1916 states and 4142 transitions. [2019-12-07 11:17:21,761 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 11:17:21,761 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 52 [2019-12-07 11:17:21,761 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 11:17:21,762 INFO L225 Difference]: With dead ends: 1916 [2019-12-07 11:17:21,762 INFO L226 Difference]: Without dead ends: 851 [2019-12-07 11:17:21,763 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 11:17:21,765 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 851 states. [2019-12-07 11:17:21,772 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 851 to 851. [2019-12-07 11:17:21,773 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 851 states. [2019-12-07 11:17:21,774 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 851 states to 851 states and 1822 transitions. [2019-12-07 11:17:21,774 INFO L78 Accepts]: Start accepts. Automaton has 851 states and 1822 transitions. Word has length 52 [2019-12-07 11:17:21,775 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 11:17:21,775 INFO L462 AbstractCegarLoop]: Abstraction has 851 states and 1822 transitions. [2019-12-07 11:17:21,775 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 11:17:21,775 INFO L276 IsEmpty]: Start isEmpty. Operand 851 states and 1822 transitions. [2019-12-07 11:17:21,777 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2019-12-07 11:17:21,777 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 11:17:21,777 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] [2019-12-07 11:17:21,777 INFO L410 AbstractCegarLoop]: === Iteration 17 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 11:17:21,777 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 11:17:21,777 INFO L82 PathProgramCache]: Analyzing trace with hash 2075063759, now seen corresponding path program 7 times [2019-12-07 11:17:21,778 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 11:17:21,778 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [420202963] [2019-12-07 11:17:21,778 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 11:17:21,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:17:21,866 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 11:17:21,866 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [420202963] [2019-12-07 11:17:21,867 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 11:17:21,867 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-07 11:17:21,867 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1247755999] [2019-12-07 11:17:21,867 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-07 11:17:21,868 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 11:17:21,868 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-07 11:17:21,868 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-12-07 11:17:21,868 INFO L87 Difference]: Start difference. First operand 851 states and 1822 transitions. Second operand 7 states. [2019-12-07 11:17:22,006 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 11:17:22,006 INFO L93 Difference]: Finished difference Result 1576 states and 3298 transitions. [2019-12-07 11:17:22,007 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-12-07 11:17:22,007 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 52 [2019-12-07 11:17:22,007 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 11:17:22,007 INFO L225 Difference]: With dead ends: 1576 [2019-12-07 11:17:22,008 INFO L226 Difference]: Without dead ends: 1023 [2019-12-07 11:17:22,008 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=48, Invalid=134, Unknown=0, NotChecked=0, Total=182 [2019-12-07 11:17:22,009 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1023 states. [2019-12-07 11:17:22,017 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1023 to 831. [2019-12-07 11:17:22,017 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 831 states. [2019-12-07 11:17:22,018 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 831 states to 831 states and 1753 transitions. [2019-12-07 11:17:22,018 INFO L78 Accepts]: Start accepts. Automaton has 831 states and 1753 transitions. Word has length 52 [2019-12-07 11:17:22,018 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 11:17:22,018 INFO L462 AbstractCegarLoop]: Abstraction has 831 states and 1753 transitions. [2019-12-07 11:17:22,018 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-07 11:17:22,018 INFO L276 IsEmpty]: Start isEmpty. Operand 831 states and 1753 transitions. [2019-12-07 11:17:22,020 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2019-12-07 11:17:22,020 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 11:17:22,020 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] [2019-12-07 11:17:22,020 INFO L410 AbstractCegarLoop]: === Iteration 18 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 11:17:22,020 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 11:17:22,020 INFO L82 PathProgramCache]: Analyzing trace with hash 2078058895, now seen corresponding path program 8 times [2019-12-07 11:17:22,020 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 11:17:22,020 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2039097322] [2019-12-07 11:17:22,020 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 11:17:22,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:17:22,110 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 11:17:22,111 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2039097322] [2019-12-07 11:17:22,111 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 11:17:22,111 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 11:17:22,111 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [385315995] [2019-12-07 11:17:22,111 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-07 11:17:22,111 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 11:17:22,111 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-07 11:17:22,111 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-12-07 11:17:22,112 INFO L87 Difference]: Start difference. First operand 831 states and 1753 transitions. Second operand 5 states. [2019-12-07 11:17:22,152 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 11:17:22,152 INFO L93 Difference]: Finished difference Result 988 states and 2069 transitions. [2019-12-07 11:17:22,153 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 11:17:22,153 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 52 [2019-12-07 11:17:22,153 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 11:17:22,154 INFO L225 Difference]: With dead ends: 988 [2019-12-07 11:17:22,154 INFO L226 Difference]: Without dead ends: 988 [2019-12-07 11:17:22,154 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-12-07 11:17:22,155 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 988 states. [2019-12-07 11:17:22,160 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 988 to 770. [2019-12-07 11:17:22,161 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 770 states. [2019-12-07 11:17:22,161 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 770 states to 770 states and 1615 transitions. [2019-12-07 11:17:22,161 INFO L78 Accepts]: Start accepts. Automaton has 770 states and 1615 transitions. Word has length 52 [2019-12-07 11:17:22,162 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 11:17:22,162 INFO L462 AbstractCegarLoop]: Abstraction has 770 states and 1615 transitions. [2019-12-07 11:17:22,162 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-07 11:17:22,162 INFO L276 IsEmpty]: Start isEmpty. Operand 770 states and 1615 transitions. [2019-12-07 11:17:22,163 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2019-12-07 11:17:22,163 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 11:17:22,163 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] [2019-12-07 11:17:22,163 INFO L410 AbstractCegarLoop]: === Iteration 19 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 11:17:22,163 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 11:17:22,163 INFO L82 PathProgramCache]: Analyzing trace with hash -1710729972, now seen corresponding path program 1 times [2019-12-07 11:17:22,163 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 11:17:22,163 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1843476921] [2019-12-07 11:17:22,163 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 11:17:22,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-07 11:17:22,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-07 11:17:22,250 INFO L174 FreeRefinementEngine]: Strategy SIFA_TAIPAN found a feasible trace [2019-12-07 11:17:22,250 INFO L475 BasicCegarLoop]: Counterexample might be feasible [2019-12-07 11:17:22,252 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [769] [769] ULTIMATE.startENTRY-->L797: Formula: (let ((.cse0 (store |v_#valid_54| 0 0))) (and (= 0 v_~x~0_148) (= 0 (select .cse0 |v_ULTIMATE.start_main_~#t595~0.base_29|)) (= 0 v_~y$flush_delayed~0_33) (= 0 v_~y$read_delayed_var~0.offset_7) (= v_~y$w_buff1~0_317 0) (= v_~y$r_buff1_thd0~0_179 0) (= 0 v_~__unbuffered_cnt~0_62) (= |v_#length_15| (store |v_#length_16| |v_ULTIMATE.start_main_~#t595~0.base_29| 4)) (= |v_ULTIMATE.start_main_~#t595~0.offset_20| 0) (= v_~y$mem_tmp~0_26 0) (= v_~y~0_149 0) (= 0 v_~y$r_buff1_thd2~0_326) (= v_~y$read_delayed~0_6 0) (< |v_#StackHeapBarrier_13| |v_ULTIMATE.start_main_~#t595~0.base_29|) (= v_~y$w_buff1_used~0_504 0) (= (store .cse0 |v_ULTIMATE.start_main_~#t595~0.base_29| 1) |v_#valid_52|) (= v_~y$r_buff0_thd1~0_219 0) (= (store |v_#memory_int_16| |v_ULTIMATE.start_main_~#t595~0.base_29| (store (select |v_#memory_int_16| |v_ULTIMATE.start_main_~#t595~0.base_29|) |v_ULTIMATE.start_main_~#t595~0.offset_20| 0)) |v_#memory_int_15|) (= v_~y$r_buff1_thd1~0_159 0) (= 0 v_~weak$$choice0~0_21) (= 0 v_~y$read_delayed_var~0.base_7) (= |v_#NULL.offset_5| 0) (= v_~main$tmp_guard1~0_36 0) (= 0 v_~__unbuffered_p1_EAX~0_47) (= 0 v_~y$r_buff0_thd2~0_362) (= v_~__unbuffered_p1_EBX~0_46 0) (= v_~y$w_buff0_used~0_796 0) (= v_~main$tmp_guard0~0_32 0) (= v_~y$r_buff0_thd0~0_136 0) (= v_~weak$$choice2~0_121 0) (= 0 v_~y$w_buff0~0_547) (= 0 |v_#NULL.base_5|) (< 0 |v_#StackHeapBarrier_13|))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_13|, #valid=|v_#valid_54|, #memory_int=|v_#memory_int_16|, #length=|v_#length_16|} OutVars{~y$read_delayed_var~0.offset=v_~y$read_delayed_var~0.offset_7, ULTIMATE.start_main_~#t596~0.base=|v_ULTIMATE.start_main_~#t596~0.base_17|, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_796, #NULL.offset=|v_#NULL.offset_5|, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_36, ULTIMATE.start_main_#t~ite43=|v_ULTIMATE.start_main_#t~ite43_29|, ULTIMATE.start_main_#t~ite42=|v_ULTIMATE.start_main_#t~ite42_35|, ULTIMATE.start_main_#t~ite45=|v_ULTIMATE.start_main_#t~ite45_73|, ULTIMATE.start_main_#t~ite44=|v_ULTIMATE.start_main_#t~ite44_31|, ~y$read_delayed~0=v_~y$read_delayed~0_6, ~y$r_buff1_thd1~0=v_~y$r_buff1_thd1~0_159, ~y$mem_tmp~0=v_~y$mem_tmp~0_26, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_47, ~y$w_buff0~0=v_~y$w_buff0~0_547, ~y$r_buff0_thd1~0=v_~y$r_buff0_thd1~0_219, ~y$flush_delayed~0=v_~y$flush_delayed~0_33, #length=|v_#length_15|, ~y~0=v_~y~0_149, ULTIMATE.start_main_~#t596~0.offset=|v_ULTIMATE.start_main_~#t596~0.offset_14|, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_46, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_32, #NULL.base=|v_#NULL.base_5|, ~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_326, ~weak$$choice0~0=v_~weak$$choice0~0_21, #StackHeapBarrier=|v_#StackHeapBarrier_13|, ULTIMATE.start_main_#t~ite41=|v_ULTIMATE.start_main_#t~ite41_36|, ULTIMATE.start_main_~#t595~0.offset=|v_ULTIMATE.start_main_~#t595~0.offset_20|, ULTIMATE.start_main_#t~ite40=|v_ULTIMATE.start_main_#t~ite40_35|, ~y$w_buff1~0=v_~y$w_buff1~0_317, ~y$read_delayed_var~0.base=v_~y$read_delayed_var~0.base_7, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_21|, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_136, #valid=|v_#valid_52|, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_362, #memory_int=|v_#memory_int_15|, ULTIMATE.start_main_#t~nondet38=|v_ULTIMATE.start_main_#t~nondet38_7|, ULTIMATE.start_main_~#t595~0.base=|v_ULTIMATE.start_main_~#t595~0.base_29|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_62, ULTIMATE.start_main_#t~nondet39=|v_ULTIMATE.start_main_#t~nondet39_18|, ~weak$$choice2~0=v_~weak$$choice2~0_121, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_179, ~x~0=v_~x~0_148, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_504} AuxVars[] AssignedVars[~y$read_delayed_var~0.offset, ULTIMATE.start_main_~#t596~0.base, ~y$w_buff0_used~0, #NULL.offset, ~main$tmp_guard1~0, ULTIMATE.start_main_#t~ite43, ULTIMATE.start_main_#t~ite42, ULTIMATE.start_main_#t~ite45, ULTIMATE.start_main_#t~ite44, ~y$read_delayed~0, ~y$r_buff1_thd1~0, ~y$mem_tmp~0, ~__unbuffered_p1_EAX~0, ~y$w_buff0~0, ~y$r_buff0_thd1~0, ~y$flush_delayed~0, #length, ~y~0, ULTIMATE.start_main_~#t596~0.offset, ~__unbuffered_p1_EBX~0, ~main$tmp_guard0~0, #NULL.base, ~y$r_buff1_thd2~0, ~weak$$choice0~0, ULTIMATE.start_main_#t~ite41, ULTIMATE.start_main_~#t595~0.offset, ULTIMATE.start_main_#t~ite40, ~y$w_buff1~0, ~y$read_delayed_var~0.base, ULTIMATE.start_main_#res, ~y$r_buff0_thd0~0, #valid, ~y$r_buff0_thd2~0, #memory_int, ULTIMATE.start_main_#t~nondet38, ULTIMATE.start_main_~#t595~0.base, ~__unbuffered_cnt~0, ULTIMATE.start_main_#t~nondet39, ~weak$$choice2~0, ~y$r_buff1_thd0~0, ~x~0, ~y$w_buff1_used~0] because there is no mapped edge [2019-12-07 11:17:22,253 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [745] [745] L797-1-->L799: Formula: (and (= |v_#length_9| (store |v_#length_10| |v_ULTIMATE.start_main_~#t596~0.base_12| 4)) (= |v_#valid_27| (store |v_#valid_28| |v_ULTIMATE.start_main_~#t596~0.base_12| 1)) (= |v_#memory_int_9| (store |v_#memory_int_10| |v_ULTIMATE.start_main_~#t596~0.base_12| (store (select |v_#memory_int_10| |v_ULTIMATE.start_main_~#t596~0.base_12|) |v_ULTIMATE.start_main_~#t596~0.offset_10| 1))) (= |v_ULTIMATE.start_main_~#t596~0.offset_10| 0) (not (= 0 |v_ULTIMATE.start_main_~#t596~0.base_12|)) (= (select |v_#valid_28| |v_ULTIMATE.start_main_~#t596~0.base_12|) 0) (< |v_#StackHeapBarrier_8| |v_ULTIMATE.start_main_~#t596~0.base_12|)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_8|, #valid=|v_#valid_28|, #memory_int=|v_#memory_int_10|, #length=|v_#length_10|} OutVars{ULTIMATE.start_main_~#t596~0.offset=|v_ULTIMATE.start_main_~#t596~0.offset_10|, #StackHeapBarrier=|v_#StackHeapBarrier_8|, ULTIMATE.start_main_~#t596~0.base=|v_ULTIMATE.start_main_~#t596~0.base_12|, #valid=|v_#valid_27|, #memory_int=|v_#memory_int_9|, ULTIMATE.start_main_#t~nondet38=|v_ULTIMATE.start_main_#t~nondet38_4|, #length=|v_#length_9|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t596~0.offset, ULTIMATE.start_main_~#t596~0.base, #valid, #memory_int, ULTIMATE.start_main_#t~nondet38, #length] because there is no mapped edge [2019-12-07 11:17:22,253 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [671] [671] L4-->L738: Formula: (and (= v_~y$r_buff0_thd1~0_41 v_~y$r_buff1_thd1~0_23) (= v_~y$r_buff0_thd2~0_107 v_~y$r_buff1_thd2~0_62) (= v_~y$r_buff0_thd0~0_52 v_~y$r_buff1_thd0~0_32) (= v_~x~0_18 1) (not (= v_P0Thread1of1ForFork0___VERIFIER_assert_~expression_64 0)) (= v_~y$r_buff0_thd1~0_40 1)) InVars {~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_52, ~y$r_buff0_thd1~0=v_~y$r_buff0_thd1~0_41, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_107, P0Thread1of1ForFork0___VERIFIER_assert_~expression=v_P0Thread1of1ForFork0___VERIFIER_assert_~expression_64} OutVars{~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_62, ~y$r_buff1_thd1~0=v_~y$r_buff1_thd1~0_23, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_52, ~y$r_buff0_thd1~0=v_~y$r_buff0_thd1~0_40, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_107, P0Thread1of1ForFork0___VERIFIER_assert_~expression=v_P0Thread1of1ForFork0___VERIFIER_assert_~expression_64, ~x~0=v_~x~0_18, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_32} AuxVars[] AssignedVars[~y$r_buff1_thd2~0, ~y$r_buff1_thd1~0, ~y$r_buff0_thd1~0, ~x~0, ~y$r_buff1_thd0~0] because there is no mapped edge [2019-12-07 11:17:22,255 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [698] [698] L739-->L739-2: Formula: (let ((.cse1 (= (mod ~y$w_buff0_used~0_In-2067342227 256) 0)) (.cse0 (= (mod ~y$r_buff0_thd1~0_In-2067342227 256) 0))) (or (and (= |P0Thread1of1ForFork0_#t~ite5_Out-2067342227| ~y$w_buff0_used~0_In-2067342227) (or .cse0 .cse1)) (and (= |P0Thread1of1ForFork0_#t~ite5_Out-2067342227| 0) (not .cse1) (not .cse0)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-2067342227, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In-2067342227} OutVars{P0Thread1of1ForFork0_#t~ite5=|P0Thread1of1ForFork0_#t~ite5_Out-2067342227|, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-2067342227, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In-2067342227} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite5] because there is no mapped edge [2019-12-07 11:17:22,255 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [753] [753] L763-->L763-8: Formula: (let ((.cse0 (= 0 (mod ~weak$$choice2~0_In-1997920202 256)))) (or (and (= ~y$w_buff0~0_In-1997920202 |P1Thread1of1ForFork1_#t~ite15_Out-1997920202|) (= |P1Thread1of1ForFork1_#t~ite14_In-1997920202| |P1Thread1of1ForFork1_#t~ite14_Out-1997920202|) (not .cse0)) (and (let ((.cse1 (= (mod ~y$r_buff0_thd2~0_In-1997920202 256) 0))) (or (and (= (mod ~y$r_buff1_thd2~0_In-1997920202 256) 0) .cse1) (= 0 (mod ~y$w_buff0_used~0_In-1997920202 256)) (and .cse1 (= (mod ~y$w_buff1_used~0_In-1997920202 256) 0)))) (= ~y$w_buff0~0_In-1997920202 |P1Thread1of1ForFork1_#t~ite14_Out-1997920202|) .cse0 (= |P1Thread1of1ForFork1_#t~ite15_Out-1997920202| |P1Thread1of1ForFork1_#t~ite14_Out-1997920202|)))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-1997920202, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-1997920202, ~y$w_buff0~0=~y$w_buff0~0_In-1997920202, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-1997920202, ~weak$$choice2~0=~weak$$choice2~0_In-1997920202, P1Thread1of1ForFork1_#t~ite14=|P1Thread1of1ForFork1_#t~ite14_In-1997920202|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1997920202} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-1997920202, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-1997920202, ~y$w_buff0~0=~y$w_buff0~0_In-1997920202, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-1997920202, P1Thread1of1ForFork1_#t~ite15=|P1Thread1of1ForFork1_#t~ite15_Out-1997920202|, ~weak$$choice2~0=~weak$$choice2~0_In-1997920202, P1Thread1of1ForFork1_#t~ite14=|P1Thread1of1ForFork1_#t~ite14_Out-1997920202|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1997920202} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite15, P1Thread1of1ForFork1_#t~ite14] because there is no mapped edge [2019-12-07 11:17:22,255 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [752] [752] L764-->L764-8: Formula: (let ((.cse0 (= (mod ~weak$$choice2~0_In-82300300 256) 0))) (or (and (= |P1Thread1of1ForFork1_#t~ite17_In-82300300| |P1Thread1of1ForFork1_#t~ite17_Out-82300300|) (not .cse0) (= |P1Thread1of1ForFork1_#t~ite18_Out-82300300| ~y$w_buff1~0_In-82300300)) (and (= |P1Thread1of1ForFork1_#t~ite18_Out-82300300| |P1Thread1of1ForFork1_#t~ite17_Out-82300300|) (= ~y$w_buff1~0_In-82300300 |P1Thread1of1ForFork1_#t~ite17_Out-82300300|) (let ((.cse1 (= 0 (mod ~y$r_buff0_thd2~0_In-82300300 256)))) (or (= (mod ~y$w_buff0_used~0_In-82300300 256) 0) (and (= 0 (mod ~y$w_buff1_used~0_In-82300300 256)) .cse1) (and (= (mod ~y$r_buff1_thd2~0_In-82300300 256) 0) .cse1))) .cse0))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-82300300, ~y$w_buff1~0=~y$w_buff1~0_In-82300300, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-82300300, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-82300300, ~weak$$choice2~0=~weak$$choice2~0_In-82300300, P1Thread1of1ForFork1_#t~ite17=|P1Thread1of1ForFork1_#t~ite17_In-82300300|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-82300300} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-82300300, P1Thread1of1ForFork1_#t~ite18=|P1Thread1of1ForFork1_#t~ite18_Out-82300300|, ~y$w_buff1~0=~y$w_buff1~0_In-82300300, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-82300300, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-82300300, ~weak$$choice2~0=~weak$$choice2~0_In-82300300, P1Thread1of1ForFork1_#t~ite17=|P1Thread1of1ForFork1_#t~ite17_Out-82300300|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-82300300} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite18, P1Thread1of1ForFork1_#t~ite17] because there is no mapped edge [2019-12-07 11:17:22,256 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [699] [699] L740-->L740-2: Formula: (let ((.cse0 (= 0 (mod ~y$r_buff1_thd1~0_In1915393126 256))) (.cse1 (= (mod ~y$w_buff1_used~0_In1915393126 256) 0)) (.cse2 (= (mod ~y$r_buff0_thd1~0_In1915393126 256) 0)) (.cse3 (= 0 (mod ~y$w_buff0_used~0_In1915393126 256)))) (or (and (= |P0Thread1of1ForFork0_#t~ite6_Out1915393126| 0) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse0 .cse1) (= ~y$w_buff1_used~0_In1915393126 |P0Thread1of1ForFork0_#t~ite6_Out1915393126|) (or .cse2 .cse3)))) InVars {~y$r_buff1_thd1~0=~y$r_buff1_thd1~0_In1915393126, ~y$w_buff0_used~0=~y$w_buff0_used~0_In1915393126, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In1915393126, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1915393126} OutVars{P0Thread1of1ForFork0_#t~ite6=|P0Thread1of1ForFork0_#t~ite6_Out1915393126|, ~y$r_buff1_thd1~0=~y$r_buff1_thd1~0_In1915393126, ~y$w_buff0_used~0=~y$w_buff0_used~0_In1915393126, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In1915393126, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1915393126} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite6] because there is no mapped edge [2019-12-07 11:17:22,256 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [705] [705] L741-->L742: Formula: (let ((.cse0 (= ~y$r_buff0_thd1~0_Out1635833187 ~y$r_buff0_thd1~0_In1635833187)) (.cse1 (= 0 (mod ~y$w_buff0_used~0_In1635833187 256))) (.cse2 (= 0 (mod ~y$r_buff0_thd1~0_In1635833187 256)))) (or (and .cse0 .cse1) (and .cse2 .cse0) (and (not .cse1) (= ~y$r_buff0_thd1~0_Out1635833187 0) (not .cse2)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In1635833187, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In1635833187} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In1635833187, P0Thread1of1ForFork0_#t~ite7=|P0Thread1of1ForFork0_#t~ite7_Out1635833187|, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_Out1635833187} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite7, ~y$r_buff0_thd1~0] because there is no mapped edge [2019-12-07 11:17:22,256 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [702] [702] L742-->L742-2: Formula: (let ((.cse0 (= 0 (mod ~y$r_buff1_thd1~0_In988761426 256))) (.cse1 (= 0 (mod ~y$w_buff1_used~0_In988761426 256))) (.cse2 (= 0 (mod ~y$w_buff0_used~0_In988761426 256))) (.cse3 (= (mod ~y$r_buff0_thd1~0_In988761426 256) 0))) (or (and (or .cse0 .cse1) (or .cse2 .cse3) (= ~y$r_buff1_thd1~0_In988761426 |P0Thread1of1ForFork0_#t~ite8_Out988761426|)) (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= 0 |P0Thread1of1ForFork0_#t~ite8_Out988761426|)))) InVars {~y$r_buff1_thd1~0=~y$r_buff1_thd1~0_In988761426, ~y$w_buff0_used~0=~y$w_buff0_used~0_In988761426, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In988761426, ~y$w_buff1_used~0=~y$w_buff1_used~0_In988761426} OutVars{~y$r_buff1_thd1~0=~y$r_buff1_thd1~0_In988761426, ~y$w_buff0_used~0=~y$w_buff0_used~0_In988761426, P0Thread1of1ForFork0_#t~ite8=|P0Thread1of1ForFork0_#t~ite8_Out988761426|, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In988761426, ~y$w_buff1_used~0=~y$w_buff1_used~0_In988761426} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite8] because there is no mapped edge [2019-12-07 11:17:22,256 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [751] [751] L765-->L765-8: Formula: (let ((.cse0 (= 0 (mod ~weak$$choice2~0_In-1320113541 256)))) (or (and (not .cse0) (= |P1Thread1of1ForFork1_#t~ite20_In-1320113541| |P1Thread1of1ForFork1_#t~ite20_Out-1320113541|) (= ~y$w_buff0_used~0_In-1320113541 |P1Thread1of1ForFork1_#t~ite21_Out-1320113541|)) (and (= ~y$w_buff0_used~0_In-1320113541 |P1Thread1of1ForFork1_#t~ite20_Out-1320113541|) .cse0 (= |P1Thread1of1ForFork1_#t~ite21_Out-1320113541| |P1Thread1of1ForFork1_#t~ite20_Out-1320113541|) (let ((.cse1 (= 0 (mod ~y$r_buff0_thd2~0_In-1320113541 256)))) (or (and (= (mod ~y$w_buff1_used~0_In-1320113541 256) 0) .cse1) (= 0 (mod ~y$w_buff0_used~0_In-1320113541 256)) (and .cse1 (= (mod ~y$r_buff1_thd2~0_In-1320113541 256) 0))))))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-1320113541, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-1320113541, P1Thread1of1ForFork1_#t~ite20=|P1Thread1of1ForFork1_#t~ite20_In-1320113541|, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-1320113541, ~weak$$choice2~0=~weak$$choice2~0_In-1320113541, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1320113541} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-1320113541, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-1320113541, P1Thread1of1ForFork1_#t~ite20=|P1Thread1of1ForFork1_#t~ite20_Out-1320113541|, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-1320113541, P1Thread1of1ForFork1_#t~ite21=|P1Thread1of1ForFork1_#t~ite21_Out-1320113541|, ~weak$$choice2~0=~weak$$choice2~0_In-1320113541, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1320113541} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite20, P1Thread1of1ForFork1_#t~ite21] because there is no mapped edge [2019-12-07 11:17:22,257 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [688] [688] L767-->L768: Formula: (and (not (= (mod v_~weak$$choice2~0_28 256) 0)) (= v_~y$r_buff0_thd2~0_136 v_~y$r_buff0_thd2~0_135)) InVars {~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_136, ~weak$$choice2~0=v_~weak$$choice2~0_28} OutVars{~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_135, P1Thread1of1ForFork1_#t~ite27=|v_P1Thread1of1ForFork1_#t~ite27_7|, ~weak$$choice2~0=v_~weak$$choice2~0_28, P1Thread1of1ForFork1_#t~ite25=|v_P1Thread1of1ForFork1_#t~ite25_12|, 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 11:17:22,257 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [750] [750] L768-->L768-8: Formula: (let ((.cse0 (= (mod ~weak$$choice2~0_In-1699082295 256) 0))) (or (and (= |P1Thread1of1ForFork1_#t~ite29_Out-1699082295| |P1Thread1of1ForFork1_#t~ite30_Out-1699082295|) (= |P1Thread1of1ForFork1_#t~ite29_Out-1699082295| ~y$r_buff1_thd2~0_In-1699082295) .cse0 (let ((.cse1 (= (mod ~y$r_buff0_thd2~0_In-1699082295 256) 0))) (or (= (mod ~y$w_buff0_used~0_In-1699082295 256) 0) (and .cse1 (= (mod ~y$r_buff1_thd2~0_In-1699082295 256) 0)) (and .cse1 (= 0 (mod ~y$w_buff1_used~0_In-1699082295 256)))))) (and (not .cse0) (= |P1Thread1of1ForFork1_#t~ite29_In-1699082295| |P1Thread1of1ForFork1_#t~ite29_Out-1699082295|) (= ~y$r_buff1_thd2~0_In-1699082295 |P1Thread1of1ForFork1_#t~ite30_Out-1699082295|)))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-1699082295, P1Thread1of1ForFork1_#t~ite29=|P1Thread1of1ForFork1_#t~ite29_In-1699082295|, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-1699082295, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-1699082295, ~weak$$choice2~0=~weak$$choice2~0_In-1699082295, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1699082295} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-1699082295, P1Thread1of1ForFork1_#t~ite29=|P1Thread1of1ForFork1_#t~ite29_Out-1699082295|, P1Thread1of1ForFork1_#t~ite30=|P1Thread1of1ForFork1_#t~ite30_Out-1699082295|, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-1699082295, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-1699082295, ~weak$$choice2~0=~weak$$choice2~0_In-1699082295, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1699082295} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite29, P1Thread1of1ForFork1_#t~ite30] because there is no mapped edge [2019-12-07 11:17:22,257 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [735] [735] L742-2-->P0EXIT: Formula: (and (= |v_P0Thread1of1ForFork0_#res.offset_3| 0) (= v_~y$r_buff1_thd1~0_129 |v_P0Thread1of1ForFork0_#t~ite8_30|) (= 0 |v_P0Thread1of1ForFork0_#res.base_3|) (= (+ v_~__unbuffered_cnt~0_40 1) v_~__unbuffered_cnt~0_39)) InVars {P0Thread1of1ForFork0_#t~ite8=|v_P0Thread1of1ForFork0_#t~ite8_30|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_40} OutVars{~y$r_buff1_thd1~0=v_~y$r_buff1_thd1~0_129, P0Thread1of1ForFork0_#res.offset=|v_P0Thread1of1ForFork0_#res.offset_3|, P0Thread1of1ForFork0_#t~ite8=|v_P0Thread1of1ForFork0_#t~ite8_29|, P0Thread1of1ForFork0_#res.base=|v_P0Thread1of1ForFork0_#res.base_3|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_39} 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 11:17:22,258 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [658] [658] L770-->L774: Formula: (and (not (= 0 (mod v_~y$flush_delayed~0_7 256))) (= 0 v_~y$flush_delayed~0_6) (= v_~y~0_21 v_~y$mem_tmp~0_5)) InVars {~y$mem_tmp~0=v_~y$mem_tmp~0_5, ~y$flush_delayed~0=v_~y$flush_delayed~0_7} OutVars{~y$mem_tmp~0=v_~y$mem_tmp~0_5, P1Thread1of1ForFork1_#t~ite31=|v_P1Thread1of1ForFork1_#t~ite31_5|, ~y$flush_delayed~0=v_~y$flush_delayed~0_6, ~y~0=v_~y~0_21} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite31, ~y$flush_delayed~0, ~y~0] because there is no mapped edge [2019-12-07 11:17:22,258 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [719] [719] L774-2-->L774-4: Formula: (let ((.cse1 (= 0 (mod ~y$w_buff1_used~0_In1138932279 256))) (.cse0 (= 0 (mod ~y$r_buff1_thd2~0_In1138932279 256)))) (or (and (or .cse0 .cse1) (= |P1Thread1of1ForFork1_#t~ite32_Out1138932279| ~y~0_In1138932279)) (and (= |P1Thread1of1ForFork1_#t~ite32_Out1138932279| ~y$w_buff1~0_In1138932279) (not .cse1) (not .cse0)))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In1138932279, ~y$w_buff1~0=~y$w_buff1~0_In1138932279, ~y~0=~y~0_In1138932279, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1138932279} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In1138932279, ~y$w_buff1~0=~y$w_buff1~0_In1138932279, P1Thread1of1ForFork1_#t~ite32=|P1Thread1of1ForFork1_#t~ite32_Out1138932279|, ~y~0=~y~0_In1138932279, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1138932279} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite32] because there is no mapped edge [2019-12-07 11:17:22,258 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [659] [659] L774-4-->L775: Formula: (= v_~y~0_29 |v_P1Thread1of1ForFork1_#t~ite32_6|) InVars {P1Thread1of1ForFork1_#t~ite32=|v_P1Thread1of1ForFork1_#t~ite32_6|} OutVars{P1Thread1of1ForFork1_#t~ite32=|v_P1Thread1of1ForFork1_#t~ite32_5|, P1Thread1of1ForFork1_#t~ite33=|v_P1Thread1of1ForFork1_#t~ite33_5|, ~y~0=v_~y~0_29} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite32, P1Thread1of1ForFork1_#t~ite33, ~y~0] because there is no mapped edge [2019-12-07 11:17:22,258 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [714] [714] L775-->L775-2: Formula: (let ((.cse1 (= (mod ~y$w_buff0_used~0_In-1597109702 256) 0)) (.cse0 (= 0 (mod ~y$r_buff0_thd2~0_In-1597109702 256)))) (or (and (= |P1Thread1of1ForFork1_#t~ite34_Out-1597109702| 0) (not .cse0) (not .cse1)) (and (or .cse1 .cse0) (= |P1Thread1of1ForFork1_#t~ite34_Out-1597109702| ~y$w_buff0_used~0_In-1597109702)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-1597109702, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-1597109702} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-1597109702, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-1597109702, P1Thread1of1ForFork1_#t~ite34=|P1Thread1of1ForFork1_#t~ite34_Out-1597109702|} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite34] because there is no mapped edge [2019-12-07 11:17:22,258 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [703] [703] L776-->L776-2: Formula: (let ((.cse1 (= 0 (mod ~y$w_buff1_used~0_In1070489243 256))) (.cse0 (= (mod ~y$r_buff1_thd2~0_In1070489243 256) 0)) (.cse2 (= (mod ~y$r_buff0_thd2~0_In1070489243 256) 0)) (.cse3 (= (mod ~y$w_buff0_used~0_In1070489243 256) 0))) (or (and (= 0 |P1Thread1of1ForFork1_#t~ite35_Out1070489243|) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (= ~y$w_buff1_used~0_In1070489243 |P1Thread1of1ForFork1_#t~ite35_Out1070489243|) (or .cse1 .cse0) (or .cse2 .cse3)))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In1070489243, ~y$w_buff0_used~0=~y$w_buff0_used~0_In1070489243, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In1070489243, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1070489243} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In1070489243, ~y$w_buff0_used~0=~y$w_buff0_used~0_In1070489243, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In1070489243, P1Thread1of1ForFork1_#t~ite35=|P1Thread1of1ForFork1_#t~ite35_Out1070489243|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1070489243} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite35] because there is no mapped edge [2019-12-07 11:17:22,259 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [715] [715] L777-->L777-2: Formula: (let ((.cse0 (= 0 (mod ~y$r_buff0_thd2~0_In1930522102 256))) (.cse1 (= (mod ~y$w_buff0_used~0_In1930522102 256) 0))) (or (and (or .cse0 .cse1) (= ~y$r_buff0_thd2~0_In1930522102 |P1Thread1of1ForFork1_#t~ite36_Out1930522102|)) (and (= 0 |P1Thread1of1ForFork1_#t~ite36_Out1930522102|) (not .cse0) (not .cse1)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In1930522102, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In1930522102} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In1930522102, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In1930522102, P1Thread1of1ForFork1_#t~ite36=|P1Thread1of1ForFork1_#t~ite36_Out1930522102|} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite36] because there is no mapped edge [2019-12-07 11:17:22,259 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [710] [710] L778-->L778-2: Formula: (let ((.cse3 (= 0 (mod ~y$w_buff0_used~0_In1011290037 256))) (.cse2 (= 0 (mod ~y$r_buff0_thd2~0_In1011290037 256))) (.cse0 (= 0 (mod ~y$r_buff1_thd2~0_In1011290037 256))) (.cse1 (= (mod ~y$w_buff1_used~0_In1011290037 256) 0))) (or (and (or .cse0 .cse1) (= |P1Thread1of1ForFork1_#t~ite37_Out1011290037| ~y$r_buff1_thd2~0_In1011290037) (or .cse2 .cse3)) (and (= |P1Thread1of1ForFork1_#t~ite37_Out1011290037| 0) (or (and (not .cse3) (not .cse2)) (and (not .cse0) (not .cse1)))))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In1011290037, ~y$w_buff0_used~0=~y$w_buff0_used~0_In1011290037, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In1011290037, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1011290037} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In1011290037, ~y$w_buff0_used~0=~y$w_buff0_used~0_In1011290037, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In1011290037, P1Thread1of1ForFork1_#t~ite37=|P1Thread1of1ForFork1_#t~ite37_Out1011290037|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1011290037} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite37] because there is no mapped edge [2019-12-07 11:17:22,259 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [741] [741] L778-2-->P1EXIT: Formula: (and (= v_~y$r_buff1_thd2~0_270 |v_P1Thread1of1ForFork1_#t~ite37_40|) (= (+ v_~__unbuffered_cnt~0_47 1) v_~__unbuffered_cnt~0_46) (= 0 |v_P1Thread1of1ForFork1_#res.base_3|) (= |v_P1Thread1of1ForFork1_#res.offset_3| 0)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_47, P1Thread1of1ForFork1_#t~ite37=|v_P1Thread1of1ForFork1_#t~ite37_40|} OutVars{~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_270, P1Thread1of1ForFork1_#res.offset=|v_P1Thread1of1ForFork1_#res.offset_3|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_46, P1Thread1of1ForFork1_#res.base=|v_P1Thread1of1ForFork1_#res.base_3|, P1Thread1of1ForFork1_#t~ite37=|v_P1Thread1of1ForFork1_#t~ite37_39|} 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 11:17:22,259 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [690] [690] L803-->L805-2: Formula: (and (or (= (mod v_~y$w_buff0_used~0_300 256) 0) (= (mod v_~y$r_buff0_thd0~0_64 256) 0)) (not (= (mod v_~main$tmp_guard0~0_7 256) 0))) InVars {~y$w_buff0_used~0=v_~y$w_buff0_used~0_300, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_64, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_7} OutVars{~y$w_buff0_used~0=v_~y$w_buff0_used~0_300, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_64, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_7} AuxVars[] AssignedVars[] because there is no mapped edge [2019-12-07 11:17:22,259 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [712] [712] L805-2-->L805-4: Formula: (let ((.cse1 (= 0 (mod ~y$r_buff1_thd0~0_In1171918978 256))) (.cse0 (= 0 (mod ~y$w_buff1_used~0_In1171918978 256)))) (or (and (not .cse0) (not .cse1) (= |ULTIMATE.start_main_#t~ite40_Out1171918978| ~y$w_buff1~0_In1171918978)) (and (or .cse1 .cse0) (= ~y~0_In1171918978 |ULTIMATE.start_main_#t~ite40_Out1171918978|)))) InVars {~y$w_buff1~0=~y$w_buff1~0_In1171918978, ~y~0=~y~0_In1171918978, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In1171918978, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1171918978} OutVars{ULTIMATE.start_main_#t~ite40=|ULTIMATE.start_main_#t~ite40_Out1171918978|, ~y$w_buff1~0=~y$w_buff1~0_In1171918978, ~y~0=~y~0_In1171918978, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In1171918978, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1171918978} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite40] because there is no mapped edge [2019-12-07 11:17:22,260 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [680] [680] L805-4-->L806: Formula: (= v_~y~0_43 |v_ULTIMATE.start_main_#t~ite40_11|) InVars {ULTIMATE.start_main_#t~ite40=|v_ULTIMATE.start_main_#t~ite40_11|} OutVars{ULTIMATE.start_main_#t~ite41=|v_ULTIMATE.start_main_#t~ite41_10|, ULTIMATE.start_main_#t~ite40=|v_ULTIMATE.start_main_#t~ite40_10|, ~y~0=v_~y~0_43} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite41, ULTIMATE.start_main_#t~ite40, ~y~0] because there is no mapped edge [2019-12-07 11:17:22,260 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [704] [704] L806-->L806-2: Formula: (let ((.cse1 (= (mod ~y$w_buff0_used~0_In1596912373 256) 0)) (.cse0 (= (mod ~y$r_buff0_thd0~0_In1596912373 256) 0))) (or (and (not .cse0) (= 0 |ULTIMATE.start_main_#t~ite42_Out1596912373|) (not .cse1)) (and (or .cse1 .cse0) (= ~y$w_buff0_used~0_In1596912373 |ULTIMATE.start_main_#t~ite42_Out1596912373|)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In1596912373, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In1596912373} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In1596912373, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In1596912373, ULTIMATE.start_main_#t~ite42=|ULTIMATE.start_main_#t~ite42_Out1596912373|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite42] because there is no mapped edge [2019-12-07 11:17:22,260 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [708] [708] L807-->L807-2: Formula: (let ((.cse0 (= 0 (mod ~y$r_buff0_thd0~0_In-46855129 256))) (.cse1 (= (mod ~y$w_buff0_used~0_In-46855129 256) 0)) (.cse2 (= 0 (mod ~y$w_buff1_used~0_In-46855129 256))) (.cse3 (= 0 (mod ~y$r_buff1_thd0~0_In-46855129 256)))) (or (and (or .cse0 .cse1) (= ~y$w_buff1_used~0_In-46855129 |ULTIMATE.start_main_#t~ite43_Out-46855129|) (or .cse2 .cse3)) (and (= |ULTIMATE.start_main_#t~ite43_Out-46855129| 0) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-46855129, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-46855129, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-46855129, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-46855129} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-46855129, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-46855129, ULTIMATE.start_main_#t~ite43=|ULTIMATE.start_main_#t~ite43_Out-46855129|, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-46855129, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-46855129} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite43] because there is no mapped edge [2019-12-07 11:17:22,260 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [706] [706] L808-->L808-2: Formula: (let ((.cse0 (= 0 (mod ~y$w_buff0_used~0_In715252628 256))) (.cse1 (= (mod ~y$r_buff0_thd0~0_In715252628 256) 0))) (or (and (= 0 |ULTIMATE.start_main_#t~ite44_Out715252628|) (not .cse0) (not .cse1)) (and (= ~y$r_buff0_thd0~0_In715252628 |ULTIMATE.start_main_#t~ite44_Out715252628|) (or .cse0 .cse1)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In715252628, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In715252628} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In715252628, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In715252628, ULTIMATE.start_main_#t~ite44=|ULTIMATE.start_main_#t~ite44_Out715252628|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite44] because there is no mapped edge [2019-12-07 11:17:22,261 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [701] [701] L809-->L809-2: Formula: (let ((.cse2 (= (mod ~y$r_buff1_thd0~0_In-30281257 256) 0)) (.cse3 (= (mod ~y$w_buff1_used~0_In-30281257 256) 0)) (.cse1 (= (mod ~y$w_buff0_used~0_In-30281257 256) 0)) (.cse0 (= (mod ~y$r_buff0_thd0~0_In-30281257 256) 0))) (or (and (= |ULTIMATE.start_main_#t~ite45_Out-30281257| 0) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (= ~y$r_buff1_thd0~0_In-30281257 |ULTIMATE.start_main_#t~ite45_Out-30281257|) (or .cse2 .cse3) (or .cse1 .cse0)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-30281257, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-30281257, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-30281257, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-30281257} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-30281257, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-30281257, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-30281257, ULTIMATE.start_main_#t~ite45=|ULTIMATE.start_main_#t~ite45_Out-30281257|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-30281257} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite45] because there is no mapped edge [2019-12-07 11:17:22,261 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [754] [754] L809-2-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= v_ULTIMATE.start___VERIFIER_assert_~expression_14 0) (= v_~y$r_buff1_thd0~0_140 |v_ULTIMATE.start_main_#t~ite45_40|) (= (mod v_~main$tmp_guard1~0_17 256) |v_ULTIMATE.start___VERIFIER_assert_#in~expression_8|) (= v_ULTIMATE.start___VERIFIER_assert_~expression_14 |v_ULTIMATE.start___VERIFIER_assert_#in~expression_8|) (= (ite (= (ite (not (and (= 2 v_~x~0_117) (= 2 v_~__unbuffered_p1_EAX~0_28) (= v_~__unbuffered_p1_EBX~0_24 0))) 1 0) 0) 0 1) v_~main$tmp_guard1~0_17)) InVars {~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_24, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_28, ~x~0=v_~x~0_117, ULTIMATE.start_main_#t~ite45=|v_ULTIMATE.start_main_#t~ite45_40|} OutVars{ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_14, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_24, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_28, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_17, ~x~0=v_~x~0_117, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_140, ULTIMATE.start_main_#t~ite45=|v_ULTIMATE.start_main_#t~ite45_39|, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_8|} AuxVars[] AssignedVars[ULTIMATE.start___VERIFIER_assert_~expression, ~main$tmp_guard1~0, ~y$r_buff1_thd0~0, ULTIMATE.start_main_#t~ite45, ULTIMATE.start___VERIFIER_assert_#in~expression] because there is no mapped edge [2019-12-07 11:17:22,305 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 07.12 11:17:22 BasicIcfg [2019-12-07 11:17:22,305 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-07 11:17:22,305 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-12-07 11:17:22,305 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-12-07 11:17:22,305 INFO L275 PluginConnector]: Witness Printer initialized [2019-12-07 11:17:22,306 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 11:16:57" (3/4) ... [2019-12-07 11:17:22,308 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2019-12-07 11:17:22,308 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [769] [769] ULTIMATE.startENTRY-->L797: Formula: (let ((.cse0 (store |v_#valid_54| 0 0))) (and (= 0 v_~x~0_148) (= 0 (select .cse0 |v_ULTIMATE.start_main_~#t595~0.base_29|)) (= 0 v_~y$flush_delayed~0_33) (= 0 v_~y$read_delayed_var~0.offset_7) (= v_~y$w_buff1~0_317 0) (= v_~y$r_buff1_thd0~0_179 0) (= 0 v_~__unbuffered_cnt~0_62) (= |v_#length_15| (store |v_#length_16| |v_ULTIMATE.start_main_~#t595~0.base_29| 4)) (= |v_ULTIMATE.start_main_~#t595~0.offset_20| 0) (= v_~y$mem_tmp~0_26 0) (= v_~y~0_149 0) (= 0 v_~y$r_buff1_thd2~0_326) (= v_~y$read_delayed~0_6 0) (< |v_#StackHeapBarrier_13| |v_ULTIMATE.start_main_~#t595~0.base_29|) (= v_~y$w_buff1_used~0_504 0) (= (store .cse0 |v_ULTIMATE.start_main_~#t595~0.base_29| 1) |v_#valid_52|) (= v_~y$r_buff0_thd1~0_219 0) (= (store |v_#memory_int_16| |v_ULTIMATE.start_main_~#t595~0.base_29| (store (select |v_#memory_int_16| |v_ULTIMATE.start_main_~#t595~0.base_29|) |v_ULTIMATE.start_main_~#t595~0.offset_20| 0)) |v_#memory_int_15|) (= v_~y$r_buff1_thd1~0_159 0) (= 0 v_~weak$$choice0~0_21) (= 0 v_~y$read_delayed_var~0.base_7) (= |v_#NULL.offset_5| 0) (= v_~main$tmp_guard1~0_36 0) (= 0 v_~__unbuffered_p1_EAX~0_47) (= 0 v_~y$r_buff0_thd2~0_362) (= v_~__unbuffered_p1_EBX~0_46 0) (= v_~y$w_buff0_used~0_796 0) (= v_~main$tmp_guard0~0_32 0) (= v_~y$r_buff0_thd0~0_136 0) (= v_~weak$$choice2~0_121 0) (= 0 v_~y$w_buff0~0_547) (= 0 |v_#NULL.base_5|) (< 0 |v_#StackHeapBarrier_13|))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_13|, #valid=|v_#valid_54|, #memory_int=|v_#memory_int_16|, #length=|v_#length_16|} OutVars{~y$read_delayed_var~0.offset=v_~y$read_delayed_var~0.offset_7, ULTIMATE.start_main_~#t596~0.base=|v_ULTIMATE.start_main_~#t596~0.base_17|, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_796, #NULL.offset=|v_#NULL.offset_5|, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_36, ULTIMATE.start_main_#t~ite43=|v_ULTIMATE.start_main_#t~ite43_29|, ULTIMATE.start_main_#t~ite42=|v_ULTIMATE.start_main_#t~ite42_35|, ULTIMATE.start_main_#t~ite45=|v_ULTIMATE.start_main_#t~ite45_73|, ULTIMATE.start_main_#t~ite44=|v_ULTIMATE.start_main_#t~ite44_31|, ~y$read_delayed~0=v_~y$read_delayed~0_6, ~y$r_buff1_thd1~0=v_~y$r_buff1_thd1~0_159, ~y$mem_tmp~0=v_~y$mem_tmp~0_26, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_47, ~y$w_buff0~0=v_~y$w_buff0~0_547, ~y$r_buff0_thd1~0=v_~y$r_buff0_thd1~0_219, ~y$flush_delayed~0=v_~y$flush_delayed~0_33, #length=|v_#length_15|, ~y~0=v_~y~0_149, ULTIMATE.start_main_~#t596~0.offset=|v_ULTIMATE.start_main_~#t596~0.offset_14|, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_46, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_32, #NULL.base=|v_#NULL.base_5|, ~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_326, ~weak$$choice0~0=v_~weak$$choice0~0_21, #StackHeapBarrier=|v_#StackHeapBarrier_13|, ULTIMATE.start_main_#t~ite41=|v_ULTIMATE.start_main_#t~ite41_36|, ULTIMATE.start_main_~#t595~0.offset=|v_ULTIMATE.start_main_~#t595~0.offset_20|, ULTIMATE.start_main_#t~ite40=|v_ULTIMATE.start_main_#t~ite40_35|, ~y$w_buff1~0=v_~y$w_buff1~0_317, ~y$read_delayed_var~0.base=v_~y$read_delayed_var~0.base_7, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_21|, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_136, #valid=|v_#valid_52|, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_362, #memory_int=|v_#memory_int_15|, ULTIMATE.start_main_#t~nondet38=|v_ULTIMATE.start_main_#t~nondet38_7|, ULTIMATE.start_main_~#t595~0.base=|v_ULTIMATE.start_main_~#t595~0.base_29|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_62, ULTIMATE.start_main_#t~nondet39=|v_ULTIMATE.start_main_#t~nondet39_18|, ~weak$$choice2~0=v_~weak$$choice2~0_121, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_179, ~x~0=v_~x~0_148, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_504} AuxVars[] AssignedVars[~y$read_delayed_var~0.offset, ULTIMATE.start_main_~#t596~0.base, ~y$w_buff0_used~0, #NULL.offset, ~main$tmp_guard1~0, ULTIMATE.start_main_#t~ite43, ULTIMATE.start_main_#t~ite42, ULTIMATE.start_main_#t~ite45, ULTIMATE.start_main_#t~ite44, ~y$read_delayed~0, ~y$r_buff1_thd1~0, ~y$mem_tmp~0, ~__unbuffered_p1_EAX~0, ~y$w_buff0~0, ~y$r_buff0_thd1~0, ~y$flush_delayed~0, #length, ~y~0, ULTIMATE.start_main_~#t596~0.offset, ~__unbuffered_p1_EBX~0, ~main$tmp_guard0~0, #NULL.base, ~y$r_buff1_thd2~0, ~weak$$choice0~0, ULTIMATE.start_main_#t~ite41, ULTIMATE.start_main_~#t595~0.offset, ULTIMATE.start_main_#t~ite40, ~y$w_buff1~0, ~y$read_delayed_var~0.base, ULTIMATE.start_main_#res, ~y$r_buff0_thd0~0, #valid, ~y$r_buff0_thd2~0, #memory_int, ULTIMATE.start_main_#t~nondet38, ULTIMATE.start_main_~#t595~0.base, ~__unbuffered_cnt~0, ULTIMATE.start_main_#t~nondet39, ~weak$$choice2~0, ~y$r_buff1_thd0~0, ~x~0, ~y$w_buff1_used~0] because there is no mapped edge [2019-12-07 11:17:22,309 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [745] [745] L797-1-->L799: Formula: (and (= |v_#length_9| (store |v_#length_10| |v_ULTIMATE.start_main_~#t596~0.base_12| 4)) (= |v_#valid_27| (store |v_#valid_28| |v_ULTIMATE.start_main_~#t596~0.base_12| 1)) (= |v_#memory_int_9| (store |v_#memory_int_10| |v_ULTIMATE.start_main_~#t596~0.base_12| (store (select |v_#memory_int_10| |v_ULTIMATE.start_main_~#t596~0.base_12|) |v_ULTIMATE.start_main_~#t596~0.offset_10| 1))) (= |v_ULTIMATE.start_main_~#t596~0.offset_10| 0) (not (= 0 |v_ULTIMATE.start_main_~#t596~0.base_12|)) (= (select |v_#valid_28| |v_ULTIMATE.start_main_~#t596~0.base_12|) 0) (< |v_#StackHeapBarrier_8| |v_ULTIMATE.start_main_~#t596~0.base_12|)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_8|, #valid=|v_#valid_28|, #memory_int=|v_#memory_int_10|, #length=|v_#length_10|} OutVars{ULTIMATE.start_main_~#t596~0.offset=|v_ULTIMATE.start_main_~#t596~0.offset_10|, #StackHeapBarrier=|v_#StackHeapBarrier_8|, ULTIMATE.start_main_~#t596~0.base=|v_ULTIMATE.start_main_~#t596~0.base_12|, #valid=|v_#valid_27|, #memory_int=|v_#memory_int_9|, ULTIMATE.start_main_#t~nondet38=|v_ULTIMATE.start_main_#t~nondet38_4|, #length=|v_#length_9|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t596~0.offset, ULTIMATE.start_main_~#t596~0.base, #valid, #memory_int, ULTIMATE.start_main_#t~nondet38, #length] because there is no mapped edge [2019-12-07 11:17:22,309 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [671] [671] L4-->L738: Formula: (and (= v_~y$r_buff0_thd1~0_41 v_~y$r_buff1_thd1~0_23) (= v_~y$r_buff0_thd2~0_107 v_~y$r_buff1_thd2~0_62) (= v_~y$r_buff0_thd0~0_52 v_~y$r_buff1_thd0~0_32) (= v_~x~0_18 1) (not (= v_P0Thread1of1ForFork0___VERIFIER_assert_~expression_64 0)) (= v_~y$r_buff0_thd1~0_40 1)) InVars {~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_52, ~y$r_buff0_thd1~0=v_~y$r_buff0_thd1~0_41, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_107, P0Thread1of1ForFork0___VERIFIER_assert_~expression=v_P0Thread1of1ForFork0___VERIFIER_assert_~expression_64} OutVars{~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_62, ~y$r_buff1_thd1~0=v_~y$r_buff1_thd1~0_23, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_52, ~y$r_buff0_thd1~0=v_~y$r_buff0_thd1~0_40, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_107, P0Thread1of1ForFork0___VERIFIER_assert_~expression=v_P0Thread1of1ForFork0___VERIFIER_assert_~expression_64, ~x~0=v_~x~0_18, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_32} AuxVars[] AssignedVars[~y$r_buff1_thd2~0, ~y$r_buff1_thd1~0, ~y$r_buff0_thd1~0, ~x~0, ~y$r_buff1_thd0~0] because there is no mapped edge [2019-12-07 11:17:22,310 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [698] [698] L739-->L739-2: Formula: (let ((.cse1 (= (mod ~y$w_buff0_used~0_In-2067342227 256) 0)) (.cse0 (= (mod ~y$r_buff0_thd1~0_In-2067342227 256) 0))) (or (and (= |P0Thread1of1ForFork0_#t~ite5_Out-2067342227| ~y$w_buff0_used~0_In-2067342227) (or .cse0 .cse1)) (and (= |P0Thread1of1ForFork0_#t~ite5_Out-2067342227| 0) (not .cse1) (not .cse0)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-2067342227, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In-2067342227} OutVars{P0Thread1of1ForFork0_#t~ite5=|P0Thread1of1ForFork0_#t~ite5_Out-2067342227|, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-2067342227, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In-2067342227} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite5] because there is no mapped edge [2019-12-07 11:17:22,311 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [753] [753] L763-->L763-8: Formula: (let ((.cse0 (= 0 (mod ~weak$$choice2~0_In-1997920202 256)))) (or (and (= ~y$w_buff0~0_In-1997920202 |P1Thread1of1ForFork1_#t~ite15_Out-1997920202|) (= |P1Thread1of1ForFork1_#t~ite14_In-1997920202| |P1Thread1of1ForFork1_#t~ite14_Out-1997920202|) (not .cse0)) (and (let ((.cse1 (= (mod ~y$r_buff0_thd2~0_In-1997920202 256) 0))) (or (and (= (mod ~y$r_buff1_thd2~0_In-1997920202 256) 0) .cse1) (= 0 (mod ~y$w_buff0_used~0_In-1997920202 256)) (and .cse1 (= (mod ~y$w_buff1_used~0_In-1997920202 256) 0)))) (= ~y$w_buff0~0_In-1997920202 |P1Thread1of1ForFork1_#t~ite14_Out-1997920202|) .cse0 (= |P1Thread1of1ForFork1_#t~ite15_Out-1997920202| |P1Thread1of1ForFork1_#t~ite14_Out-1997920202|)))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-1997920202, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-1997920202, ~y$w_buff0~0=~y$w_buff0~0_In-1997920202, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-1997920202, ~weak$$choice2~0=~weak$$choice2~0_In-1997920202, P1Thread1of1ForFork1_#t~ite14=|P1Thread1of1ForFork1_#t~ite14_In-1997920202|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1997920202} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-1997920202, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-1997920202, ~y$w_buff0~0=~y$w_buff0~0_In-1997920202, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-1997920202, P1Thread1of1ForFork1_#t~ite15=|P1Thread1of1ForFork1_#t~ite15_Out-1997920202|, ~weak$$choice2~0=~weak$$choice2~0_In-1997920202, P1Thread1of1ForFork1_#t~ite14=|P1Thread1of1ForFork1_#t~ite14_Out-1997920202|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1997920202} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite15, P1Thread1of1ForFork1_#t~ite14] because there is no mapped edge [2019-12-07 11:17:22,311 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [752] [752] L764-->L764-8: Formula: (let ((.cse0 (= (mod ~weak$$choice2~0_In-82300300 256) 0))) (or (and (= |P1Thread1of1ForFork1_#t~ite17_In-82300300| |P1Thread1of1ForFork1_#t~ite17_Out-82300300|) (not .cse0) (= |P1Thread1of1ForFork1_#t~ite18_Out-82300300| ~y$w_buff1~0_In-82300300)) (and (= |P1Thread1of1ForFork1_#t~ite18_Out-82300300| |P1Thread1of1ForFork1_#t~ite17_Out-82300300|) (= ~y$w_buff1~0_In-82300300 |P1Thread1of1ForFork1_#t~ite17_Out-82300300|) (let ((.cse1 (= 0 (mod ~y$r_buff0_thd2~0_In-82300300 256)))) (or (= (mod ~y$w_buff0_used~0_In-82300300 256) 0) (and (= 0 (mod ~y$w_buff1_used~0_In-82300300 256)) .cse1) (and (= (mod ~y$r_buff1_thd2~0_In-82300300 256) 0) .cse1))) .cse0))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-82300300, ~y$w_buff1~0=~y$w_buff1~0_In-82300300, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-82300300, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-82300300, ~weak$$choice2~0=~weak$$choice2~0_In-82300300, P1Thread1of1ForFork1_#t~ite17=|P1Thread1of1ForFork1_#t~ite17_In-82300300|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-82300300} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-82300300, P1Thread1of1ForFork1_#t~ite18=|P1Thread1of1ForFork1_#t~ite18_Out-82300300|, ~y$w_buff1~0=~y$w_buff1~0_In-82300300, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-82300300, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-82300300, ~weak$$choice2~0=~weak$$choice2~0_In-82300300, P1Thread1of1ForFork1_#t~ite17=|P1Thread1of1ForFork1_#t~ite17_Out-82300300|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-82300300} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite18, P1Thread1of1ForFork1_#t~ite17] because there is no mapped edge [2019-12-07 11:17:22,312 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [699] [699] L740-->L740-2: Formula: (let ((.cse0 (= 0 (mod ~y$r_buff1_thd1~0_In1915393126 256))) (.cse1 (= (mod ~y$w_buff1_used~0_In1915393126 256) 0)) (.cse2 (= (mod ~y$r_buff0_thd1~0_In1915393126 256) 0)) (.cse3 (= 0 (mod ~y$w_buff0_used~0_In1915393126 256)))) (or (and (= |P0Thread1of1ForFork0_#t~ite6_Out1915393126| 0) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse0 .cse1) (= ~y$w_buff1_used~0_In1915393126 |P0Thread1of1ForFork0_#t~ite6_Out1915393126|) (or .cse2 .cse3)))) InVars {~y$r_buff1_thd1~0=~y$r_buff1_thd1~0_In1915393126, ~y$w_buff0_used~0=~y$w_buff0_used~0_In1915393126, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In1915393126, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1915393126} OutVars{P0Thread1of1ForFork0_#t~ite6=|P0Thread1of1ForFork0_#t~ite6_Out1915393126|, ~y$r_buff1_thd1~0=~y$r_buff1_thd1~0_In1915393126, ~y$w_buff0_used~0=~y$w_buff0_used~0_In1915393126, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In1915393126, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1915393126} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite6] because there is no mapped edge [2019-12-07 11:17:22,312 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [705] [705] L741-->L742: Formula: (let ((.cse0 (= ~y$r_buff0_thd1~0_Out1635833187 ~y$r_buff0_thd1~0_In1635833187)) (.cse1 (= 0 (mod ~y$w_buff0_used~0_In1635833187 256))) (.cse2 (= 0 (mod ~y$r_buff0_thd1~0_In1635833187 256)))) (or (and .cse0 .cse1) (and .cse2 .cse0) (and (not .cse1) (= ~y$r_buff0_thd1~0_Out1635833187 0) (not .cse2)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In1635833187, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In1635833187} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In1635833187, P0Thread1of1ForFork0_#t~ite7=|P0Thread1of1ForFork0_#t~ite7_Out1635833187|, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_Out1635833187} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite7, ~y$r_buff0_thd1~0] because there is no mapped edge [2019-12-07 11:17:22,312 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [702] [702] L742-->L742-2: Formula: (let ((.cse0 (= 0 (mod ~y$r_buff1_thd1~0_In988761426 256))) (.cse1 (= 0 (mod ~y$w_buff1_used~0_In988761426 256))) (.cse2 (= 0 (mod ~y$w_buff0_used~0_In988761426 256))) (.cse3 (= (mod ~y$r_buff0_thd1~0_In988761426 256) 0))) (or (and (or .cse0 .cse1) (or .cse2 .cse3) (= ~y$r_buff1_thd1~0_In988761426 |P0Thread1of1ForFork0_#t~ite8_Out988761426|)) (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= 0 |P0Thread1of1ForFork0_#t~ite8_Out988761426|)))) InVars {~y$r_buff1_thd1~0=~y$r_buff1_thd1~0_In988761426, ~y$w_buff0_used~0=~y$w_buff0_used~0_In988761426, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In988761426, ~y$w_buff1_used~0=~y$w_buff1_used~0_In988761426} OutVars{~y$r_buff1_thd1~0=~y$r_buff1_thd1~0_In988761426, ~y$w_buff0_used~0=~y$w_buff0_used~0_In988761426, P0Thread1of1ForFork0_#t~ite8=|P0Thread1of1ForFork0_#t~ite8_Out988761426|, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In988761426, ~y$w_buff1_used~0=~y$w_buff1_used~0_In988761426} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite8] because there is no mapped edge [2019-12-07 11:17:22,312 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [751] [751] L765-->L765-8: Formula: (let ((.cse0 (= 0 (mod ~weak$$choice2~0_In-1320113541 256)))) (or (and (not .cse0) (= |P1Thread1of1ForFork1_#t~ite20_In-1320113541| |P1Thread1of1ForFork1_#t~ite20_Out-1320113541|) (= ~y$w_buff0_used~0_In-1320113541 |P1Thread1of1ForFork1_#t~ite21_Out-1320113541|)) (and (= ~y$w_buff0_used~0_In-1320113541 |P1Thread1of1ForFork1_#t~ite20_Out-1320113541|) .cse0 (= |P1Thread1of1ForFork1_#t~ite21_Out-1320113541| |P1Thread1of1ForFork1_#t~ite20_Out-1320113541|) (let ((.cse1 (= 0 (mod ~y$r_buff0_thd2~0_In-1320113541 256)))) (or (and (= (mod ~y$w_buff1_used~0_In-1320113541 256) 0) .cse1) (= 0 (mod ~y$w_buff0_used~0_In-1320113541 256)) (and .cse1 (= (mod ~y$r_buff1_thd2~0_In-1320113541 256) 0))))))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-1320113541, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-1320113541, P1Thread1of1ForFork1_#t~ite20=|P1Thread1of1ForFork1_#t~ite20_In-1320113541|, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-1320113541, ~weak$$choice2~0=~weak$$choice2~0_In-1320113541, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1320113541} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-1320113541, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-1320113541, P1Thread1of1ForFork1_#t~ite20=|P1Thread1of1ForFork1_#t~ite20_Out-1320113541|, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-1320113541, P1Thread1of1ForFork1_#t~ite21=|P1Thread1of1ForFork1_#t~ite21_Out-1320113541|, ~weak$$choice2~0=~weak$$choice2~0_In-1320113541, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1320113541} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite20, P1Thread1of1ForFork1_#t~ite21] because there is no mapped edge [2019-12-07 11:17:22,313 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [688] [688] L767-->L768: Formula: (and (not (= (mod v_~weak$$choice2~0_28 256) 0)) (= v_~y$r_buff0_thd2~0_136 v_~y$r_buff0_thd2~0_135)) InVars {~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_136, ~weak$$choice2~0=v_~weak$$choice2~0_28} OutVars{~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_135, P1Thread1of1ForFork1_#t~ite27=|v_P1Thread1of1ForFork1_#t~ite27_7|, ~weak$$choice2~0=v_~weak$$choice2~0_28, P1Thread1of1ForFork1_#t~ite25=|v_P1Thread1of1ForFork1_#t~ite25_12|, 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 11:17:22,313 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [750] [750] L768-->L768-8: Formula: (let ((.cse0 (= (mod ~weak$$choice2~0_In-1699082295 256) 0))) (or (and (= |P1Thread1of1ForFork1_#t~ite29_Out-1699082295| |P1Thread1of1ForFork1_#t~ite30_Out-1699082295|) (= |P1Thread1of1ForFork1_#t~ite29_Out-1699082295| ~y$r_buff1_thd2~0_In-1699082295) .cse0 (let ((.cse1 (= (mod ~y$r_buff0_thd2~0_In-1699082295 256) 0))) (or (= (mod ~y$w_buff0_used~0_In-1699082295 256) 0) (and .cse1 (= (mod ~y$r_buff1_thd2~0_In-1699082295 256) 0)) (and .cse1 (= 0 (mod ~y$w_buff1_used~0_In-1699082295 256)))))) (and (not .cse0) (= |P1Thread1of1ForFork1_#t~ite29_In-1699082295| |P1Thread1of1ForFork1_#t~ite29_Out-1699082295|) (= ~y$r_buff1_thd2~0_In-1699082295 |P1Thread1of1ForFork1_#t~ite30_Out-1699082295|)))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-1699082295, P1Thread1of1ForFork1_#t~ite29=|P1Thread1of1ForFork1_#t~ite29_In-1699082295|, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-1699082295, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-1699082295, ~weak$$choice2~0=~weak$$choice2~0_In-1699082295, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1699082295} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-1699082295, P1Thread1of1ForFork1_#t~ite29=|P1Thread1of1ForFork1_#t~ite29_Out-1699082295|, P1Thread1of1ForFork1_#t~ite30=|P1Thread1of1ForFork1_#t~ite30_Out-1699082295|, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-1699082295, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-1699082295, ~weak$$choice2~0=~weak$$choice2~0_In-1699082295, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1699082295} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite29, P1Thread1of1ForFork1_#t~ite30] because there is no mapped edge [2019-12-07 11:17:22,313 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [735] [735] L742-2-->P0EXIT: Formula: (and (= |v_P0Thread1of1ForFork0_#res.offset_3| 0) (= v_~y$r_buff1_thd1~0_129 |v_P0Thread1of1ForFork0_#t~ite8_30|) (= 0 |v_P0Thread1of1ForFork0_#res.base_3|) (= (+ v_~__unbuffered_cnt~0_40 1) v_~__unbuffered_cnt~0_39)) InVars {P0Thread1of1ForFork0_#t~ite8=|v_P0Thread1of1ForFork0_#t~ite8_30|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_40} OutVars{~y$r_buff1_thd1~0=v_~y$r_buff1_thd1~0_129, P0Thread1of1ForFork0_#res.offset=|v_P0Thread1of1ForFork0_#res.offset_3|, P0Thread1of1ForFork0_#t~ite8=|v_P0Thread1of1ForFork0_#t~ite8_29|, P0Thread1of1ForFork0_#res.base=|v_P0Thread1of1ForFork0_#res.base_3|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_39} 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 11:17:22,313 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [658] [658] L770-->L774: Formula: (and (not (= 0 (mod v_~y$flush_delayed~0_7 256))) (= 0 v_~y$flush_delayed~0_6) (= v_~y~0_21 v_~y$mem_tmp~0_5)) InVars {~y$mem_tmp~0=v_~y$mem_tmp~0_5, ~y$flush_delayed~0=v_~y$flush_delayed~0_7} OutVars{~y$mem_tmp~0=v_~y$mem_tmp~0_5, P1Thread1of1ForFork1_#t~ite31=|v_P1Thread1of1ForFork1_#t~ite31_5|, ~y$flush_delayed~0=v_~y$flush_delayed~0_6, ~y~0=v_~y~0_21} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite31, ~y$flush_delayed~0, ~y~0] because there is no mapped edge [2019-12-07 11:17:22,313 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [719] [719] L774-2-->L774-4: Formula: (let ((.cse1 (= 0 (mod ~y$w_buff1_used~0_In1138932279 256))) (.cse0 (= 0 (mod ~y$r_buff1_thd2~0_In1138932279 256)))) (or (and (or .cse0 .cse1) (= |P1Thread1of1ForFork1_#t~ite32_Out1138932279| ~y~0_In1138932279)) (and (= |P1Thread1of1ForFork1_#t~ite32_Out1138932279| ~y$w_buff1~0_In1138932279) (not .cse1) (not .cse0)))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In1138932279, ~y$w_buff1~0=~y$w_buff1~0_In1138932279, ~y~0=~y~0_In1138932279, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1138932279} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In1138932279, ~y$w_buff1~0=~y$w_buff1~0_In1138932279, P1Thread1of1ForFork1_#t~ite32=|P1Thread1of1ForFork1_#t~ite32_Out1138932279|, ~y~0=~y~0_In1138932279, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1138932279} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite32] because there is no mapped edge [2019-12-07 11:17:22,314 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [659] [659] L774-4-->L775: Formula: (= v_~y~0_29 |v_P1Thread1of1ForFork1_#t~ite32_6|) InVars {P1Thread1of1ForFork1_#t~ite32=|v_P1Thread1of1ForFork1_#t~ite32_6|} OutVars{P1Thread1of1ForFork1_#t~ite32=|v_P1Thread1of1ForFork1_#t~ite32_5|, P1Thread1of1ForFork1_#t~ite33=|v_P1Thread1of1ForFork1_#t~ite33_5|, ~y~0=v_~y~0_29} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite32, P1Thread1of1ForFork1_#t~ite33, ~y~0] because there is no mapped edge [2019-12-07 11:17:22,314 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [714] [714] L775-->L775-2: Formula: (let ((.cse1 (= (mod ~y$w_buff0_used~0_In-1597109702 256) 0)) (.cse0 (= 0 (mod ~y$r_buff0_thd2~0_In-1597109702 256)))) (or (and (= |P1Thread1of1ForFork1_#t~ite34_Out-1597109702| 0) (not .cse0) (not .cse1)) (and (or .cse1 .cse0) (= |P1Thread1of1ForFork1_#t~ite34_Out-1597109702| ~y$w_buff0_used~0_In-1597109702)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-1597109702, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-1597109702} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-1597109702, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-1597109702, P1Thread1of1ForFork1_#t~ite34=|P1Thread1of1ForFork1_#t~ite34_Out-1597109702|} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite34] because there is no mapped edge [2019-12-07 11:17:22,314 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [703] [703] L776-->L776-2: Formula: (let ((.cse1 (= 0 (mod ~y$w_buff1_used~0_In1070489243 256))) (.cse0 (= (mod ~y$r_buff1_thd2~0_In1070489243 256) 0)) (.cse2 (= (mod ~y$r_buff0_thd2~0_In1070489243 256) 0)) (.cse3 (= (mod ~y$w_buff0_used~0_In1070489243 256) 0))) (or (and (= 0 |P1Thread1of1ForFork1_#t~ite35_Out1070489243|) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (= ~y$w_buff1_used~0_In1070489243 |P1Thread1of1ForFork1_#t~ite35_Out1070489243|) (or .cse1 .cse0) (or .cse2 .cse3)))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In1070489243, ~y$w_buff0_used~0=~y$w_buff0_used~0_In1070489243, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In1070489243, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1070489243} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In1070489243, ~y$w_buff0_used~0=~y$w_buff0_used~0_In1070489243, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In1070489243, P1Thread1of1ForFork1_#t~ite35=|P1Thread1of1ForFork1_#t~ite35_Out1070489243|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1070489243} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite35] because there is no mapped edge [2019-12-07 11:17:22,314 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [715] [715] L777-->L777-2: Formula: (let ((.cse0 (= 0 (mod ~y$r_buff0_thd2~0_In1930522102 256))) (.cse1 (= (mod ~y$w_buff0_used~0_In1930522102 256) 0))) (or (and (or .cse0 .cse1) (= ~y$r_buff0_thd2~0_In1930522102 |P1Thread1of1ForFork1_#t~ite36_Out1930522102|)) (and (= 0 |P1Thread1of1ForFork1_#t~ite36_Out1930522102|) (not .cse0) (not .cse1)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In1930522102, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In1930522102} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In1930522102, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In1930522102, P1Thread1of1ForFork1_#t~ite36=|P1Thread1of1ForFork1_#t~ite36_Out1930522102|} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite36] because there is no mapped edge [2019-12-07 11:17:22,314 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [710] [710] L778-->L778-2: Formula: (let ((.cse3 (= 0 (mod ~y$w_buff0_used~0_In1011290037 256))) (.cse2 (= 0 (mod ~y$r_buff0_thd2~0_In1011290037 256))) (.cse0 (= 0 (mod ~y$r_buff1_thd2~0_In1011290037 256))) (.cse1 (= (mod ~y$w_buff1_used~0_In1011290037 256) 0))) (or (and (or .cse0 .cse1) (= |P1Thread1of1ForFork1_#t~ite37_Out1011290037| ~y$r_buff1_thd2~0_In1011290037) (or .cse2 .cse3)) (and (= |P1Thread1of1ForFork1_#t~ite37_Out1011290037| 0) (or (and (not .cse3) (not .cse2)) (and (not .cse0) (not .cse1)))))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In1011290037, ~y$w_buff0_used~0=~y$w_buff0_used~0_In1011290037, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In1011290037, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1011290037} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In1011290037, ~y$w_buff0_used~0=~y$w_buff0_used~0_In1011290037, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In1011290037, P1Thread1of1ForFork1_#t~ite37=|P1Thread1of1ForFork1_#t~ite37_Out1011290037|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1011290037} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite37] because there is no mapped edge [2019-12-07 11:17:22,315 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [741] [741] L778-2-->P1EXIT: Formula: (and (= v_~y$r_buff1_thd2~0_270 |v_P1Thread1of1ForFork1_#t~ite37_40|) (= (+ v_~__unbuffered_cnt~0_47 1) v_~__unbuffered_cnt~0_46) (= 0 |v_P1Thread1of1ForFork1_#res.base_3|) (= |v_P1Thread1of1ForFork1_#res.offset_3| 0)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_47, P1Thread1of1ForFork1_#t~ite37=|v_P1Thread1of1ForFork1_#t~ite37_40|} OutVars{~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_270, P1Thread1of1ForFork1_#res.offset=|v_P1Thread1of1ForFork1_#res.offset_3|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_46, P1Thread1of1ForFork1_#res.base=|v_P1Thread1of1ForFork1_#res.base_3|, P1Thread1of1ForFork1_#t~ite37=|v_P1Thread1of1ForFork1_#t~ite37_39|} 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 11:17:22,315 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [690] [690] L803-->L805-2: Formula: (and (or (= (mod v_~y$w_buff0_used~0_300 256) 0) (= (mod v_~y$r_buff0_thd0~0_64 256) 0)) (not (= (mod v_~main$tmp_guard0~0_7 256) 0))) InVars {~y$w_buff0_used~0=v_~y$w_buff0_used~0_300, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_64, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_7} OutVars{~y$w_buff0_used~0=v_~y$w_buff0_used~0_300, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_64, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_7} AuxVars[] AssignedVars[] because there is no mapped edge [2019-12-07 11:17:22,315 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [712] [712] L805-2-->L805-4: Formula: (let ((.cse1 (= 0 (mod ~y$r_buff1_thd0~0_In1171918978 256))) (.cse0 (= 0 (mod ~y$w_buff1_used~0_In1171918978 256)))) (or (and (not .cse0) (not .cse1) (= |ULTIMATE.start_main_#t~ite40_Out1171918978| ~y$w_buff1~0_In1171918978)) (and (or .cse1 .cse0) (= ~y~0_In1171918978 |ULTIMATE.start_main_#t~ite40_Out1171918978|)))) InVars {~y$w_buff1~0=~y$w_buff1~0_In1171918978, ~y~0=~y~0_In1171918978, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In1171918978, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1171918978} OutVars{ULTIMATE.start_main_#t~ite40=|ULTIMATE.start_main_#t~ite40_Out1171918978|, ~y$w_buff1~0=~y$w_buff1~0_In1171918978, ~y~0=~y~0_In1171918978, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In1171918978, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1171918978} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite40] because there is no mapped edge [2019-12-07 11:17:22,315 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [680] [680] L805-4-->L806: Formula: (= v_~y~0_43 |v_ULTIMATE.start_main_#t~ite40_11|) InVars {ULTIMATE.start_main_#t~ite40=|v_ULTIMATE.start_main_#t~ite40_11|} OutVars{ULTIMATE.start_main_#t~ite41=|v_ULTIMATE.start_main_#t~ite41_10|, ULTIMATE.start_main_#t~ite40=|v_ULTIMATE.start_main_#t~ite40_10|, ~y~0=v_~y~0_43} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite41, ULTIMATE.start_main_#t~ite40, ~y~0] because there is no mapped edge [2019-12-07 11:17:22,315 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [704] [704] L806-->L806-2: Formula: (let ((.cse1 (= (mod ~y$w_buff0_used~0_In1596912373 256) 0)) (.cse0 (= (mod ~y$r_buff0_thd0~0_In1596912373 256) 0))) (or (and (not .cse0) (= 0 |ULTIMATE.start_main_#t~ite42_Out1596912373|) (not .cse1)) (and (or .cse1 .cse0) (= ~y$w_buff0_used~0_In1596912373 |ULTIMATE.start_main_#t~ite42_Out1596912373|)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In1596912373, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In1596912373} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In1596912373, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In1596912373, ULTIMATE.start_main_#t~ite42=|ULTIMATE.start_main_#t~ite42_Out1596912373|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite42] because there is no mapped edge [2019-12-07 11:17:22,315 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [708] [708] L807-->L807-2: Formula: (let ((.cse0 (= 0 (mod ~y$r_buff0_thd0~0_In-46855129 256))) (.cse1 (= (mod ~y$w_buff0_used~0_In-46855129 256) 0)) (.cse2 (= 0 (mod ~y$w_buff1_used~0_In-46855129 256))) (.cse3 (= 0 (mod ~y$r_buff1_thd0~0_In-46855129 256)))) (or (and (or .cse0 .cse1) (= ~y$w_buff1_used~0_In-46855129 |ULTIMATE.start_main_#t~ite43_Out-46855129|) (or .cse2 .cse3)) (and (= |ULTIMATE.start_main_#t~ite43_Out-46855129| 0) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-46855129, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-46855129, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-46855129, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-46855129} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-46855129, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-46855129, ULTIMATE.start_main_#t~ite43=|ULTIMATE.start_main_#t~ite43_Out-46855129|, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-46855129, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-46855129} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite43] because there is no mapped edge [2019-12-07 11:17:22,316 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [706] [706] L808-->L808-2: Formula: (let ((.cse0 (= 0 (mod ~y$w_buff0_used~0_In715252628 256))) (.cse1 (= (mod ~y$r_buff0_thd0~0_In715252628 256) 0))) (or (and (= 0 |ULTIMATE.start_main_#t~ite44_Out715252628|) (not .cse0) (not .cse1)) (and (= ~y$r_buff0_thd0~0_In715252628 |ULTIMATE.start_main_#t~ite44_Out715252628|) (or .cse0 .cse1)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In715252628, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In715252628} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In715252628, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In715252628, ULTIMATE.start_main_#t~ite44=|ULTIMATE.start_main_#t~ite44_Out715252628|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite44] because there is no mapped edge [2019-12-07 11:17:22,316 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [701] [701] L809-->L809-2: Formula: (let ((.cse2 (= (mod ~y$r_buff1_thd0~0_In-30281257 256) 0)) (.cse3 (= (mod ~y$w_buff1_used~0_In-30281257 256) 0)) (.cse1 (= (mod ~y$w_buff0_used~0_In-30281257 256) 0)) (.cse0 (= (mod ~y$r_buff0_thd0~0_In-30281257 256) 0))) (or (and (= |ULTIMATE.start_main_#t~ite45_Out-30281257| 0) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (= ~y$r_buff1_thd0~0_In-30281257 |ULTIMATE.start_main_#t~ite45_Out-30281257|) (or .cse2 .cse3) (or .cse1 .cse0)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-30281257, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-30281257, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-30281257, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-30281257} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-30281257, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-30281257, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-30281257, ULTIMATE.start_main_#t~ite45=|ULTIMATE.start_main_#t~ite45_Out-30281257|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-30281257} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite45] because there is no mapped edge [2019-12-07 11:17:22,316 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [754] [754] L809-2-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= v_ULTIMATE.start___VERIFIER_assert_~expression_14 0) (= v_~y$r_buff1_thd0~0_140 |v_ULTIMATE.start_main_#t~ite45_40|) (= (mod v_~main$tmp_guard1~0_17 256) |v_ULTIMATE.start___VERIFIER_assert_#in~expression_8|) (= v_ULTIMATE.start___VERIFIER_assert_~expression_14 |v_ULTIMATE.start___VERIFIER_assert_#in~expression_8|) (= (ite (= (ite (not (and (= 2 v_~x~0_117) (= 2 v_~__unbuffered_p1_EAX~0_28) (= v_~__unbuffered_p1_EBX~0_24 0))) 1 0) 0) 0 1) v_~main$tmp_guard1~0_17)) InVars {~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_24, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_28, ~x~0=v_~x~0_117, ULTIMATE.start_main_#t~ite45=|v_ULTIMATE.start_main_#t~ite45_40|} OutVars{ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_14, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_24, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_28, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_17, ~x~0=v_~x~0_117, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_140, ULTIMATE.start_main_#t~ite45=|v_ULTIMATE.start_main_#t~ite45_39|, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_8|} AuxVars[] AssignedVars[ULTIMATE.start___VERIFIER_assert_~expression, ~main$tmp_guard1~0, ~y$r_buff1_thd0~0, ULTIMATE.start_main_#t~ite45, ULTIMATE.start___VERIFIER_assert_#in~expression] because there is no mapped edge [2019-12-07 11:17:22,363 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/run_dir_6c72aadc-be40-4b90-91d2-f68baf583ea2/bin/utaipan/witness.graphml [2019-12-07 11:17:22,364 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-12-07 11:17:22,365 INFO L168 Benchmark]: Toolchain (without parser) took 25903.02 ms. Allocated memory was 1.0 GB in the beginning and 1.6 GB in the end (delta: 591.4 MB). Free memory was 939.3 MB in the beginning and 1.4 GB in the end (delta: -495.0 MB). Peak memory consumption was 96.4 MB. Max. memory is 11.5 GB. [2019-12-07 11:17:22,365 INFO L168 Benchmark]: CDTParser took 0.14 ms. Allocated memory is still 1.0 GB. Free memory is still 960.8 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-12-07 11:17:22,366 INFO L168 Benchmark]: CACSL2BoogieTranslator took 405.60 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 155.2 MB). Free memory was 939.3 MB in the beginning and 1.1 GB in the end (delta: -187.6 MB). Peak memory consumption was 23.6 MB. Max. memory is 11.5 GB. [2019-12-07 11:17:22,366 INFO L168 Benchmark]: Boogie Procedure Inliner took 38.45 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. [2019-12-07 11:17:22,366 INFO L168 Benchmark]: Boogie Preprocessor took 24.99 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-12-07 11:17:22,366 INFO L168 Benchmark]: RCFGBuilder took 381.53 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 48.8 MB). Peak memory consumption was 48.8 MB. Max. memory is 11.5 GB. [2019-12-07 11:17:22,367 INFO L168 Benchmark]: TraceAbstraction took 24990.04 ms. Allocated memory was 1.2 GB in the beginning and 1.6 GB in the end (delta: 436.2 MB). Free memory was 1.1 GB in the beginning and 1.5 GB in the end (delta: -379.8 MB). Peak memory consumption was 56.4 MB. Max. memory is 11.5 GB. [2019-12-07 11:17:22,367 INFO L168 Benchmark]: Witness Printer took 58.58 ms. Allocated memory is still 1.6 GB. Free memory was 1.5 GB in the beginning and 1.4 GB in the end (delta: 18.3 MB). Peak memory consumption was 18.3 MB. Max. memory is 11.5 GB. [2019-12-07 11:17:22,369 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.14 ms. Allocated memory is still 1.0 GB. Free memory is still 960.8 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 405.60 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 155.2 MB). Free memory was 939.3 MB in the beginning and 1.1 GB in the end (delta: -187.6 MB). Peak memory consumption was 23.6 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 38.45 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 24.99 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 381.53 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 48.8 MB). Peak memory consumption was 48.8 MB. Max. memory is 11.5 GB. * TraceAbstraction took 24990.04 ms. Allocated memory was 1.2 GB in the beginning and 1.6 GB in the end (delta: 436.2 MB). Free memory was 1.1 GB in the beginning and 1.5 GB in the end (delta: -379.8 MB). Peak memory consumption was 56.4 MB. Max. memory is 11.5 GB. * Witness Printer took 58.58 ms. Allocated memory is still 1.6 GB. Free memory was 1.5 GB in the beginning and 1.4 GB in the end (delta: 18.3 MB). Peak memory consumption was 18.3 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks LbeTime: 3.0s, 147 ProgramPointsBefore, 77 ProgramPointsAfterwards, 181 TransitionsBefore, 87 TransitionsAfterwards, 12056 CoEnabledTransitionPairs, 7 FixpointIterations, 29 TrivialSequentialCompositions, 40 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 32 ConcurrentYvCompositions, 27 ChoiceCompositions, 4555 VarBasedMoverChecksPositive, 216 VarBasedMoverChecksNegative, 60 SemBasedMoverChecksPositive, 196 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 0.9s, 0 MoverChecksTotal, 47763 CheckedPairsTotal, 101 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(&t595, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L724] 1 y$w_buff1 = y$w_buff0 [L725] 1 y$w_buff0 = 1 [L726] 1 y$w_buff1_used = y$w_buff0_used [L727] 1 y$w_buff0_used = (_Bool)1 [L799] FCALL, FORK 0 pthread_create(&t596, ((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=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L738] EXPR 1 y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd1 ? y$w_buff1 : y) VAL [__unbuffered_cnt=0, __unbuffered_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=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L752] 2 x = 2 [L755] 2 __unbuffered_p1_EAX = x [L758] 2 weak$$choice0 = __VERIFIER_nondet_bool() [L759] 2 weak$$choice2 = __VERIFIER_nondet_bool() [L760] 2 y$flush_delayed = weak$$choice2 [L761] 2 y$mem_tmp = 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=5, weak$$choice2=1, x=2, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L762] EXPR 2 !y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff1) VAL [!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff1)=0, __unbuffered_cnt=0, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=2, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L738] 1 y = y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd1 ? y$w_buff1 : y) [L762] 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) [L763] 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)) [L764] 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)) [L739] 1 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$w_buff0_used [L740] 1 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd1 || y$w_buff1_used && y$r_buff1_thd1 ? (_Bool)0 : y$w_buff1_used [L765] 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)) [L766] 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=2, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0))=0, x=2, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L766] 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)) [L768] 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)) [L769] 2 __unbuffered_p1_EBX = y VAL [__unbuffered_cnt=1, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=2, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L774] 2 y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) VAL [__unbuffered_cnt=1, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=2, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [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 [L777] 2 y$r_buff0_thd2 = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2 [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=5, weak$$choice2=1, x=2, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L806] 0 y$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 - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 141 locations, 2 error locations. Result: UNSAFE, OverallTime: 24.8s, OverallIterations: 19, TraceHistogramMax: 1, AutomataDifference: 18.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 2996 SDtfs, 6442 SDslu, 9586 SDs, 0 SdLazy, 9520 SolverSat, 744 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 8.1s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 330 GetRequests, 32 SyntacticMatches, 15 SemanticMatches, 283 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5351 ImplicationChecksByTransitivity, 8.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=11878occurred in iteration=3, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 1.2s AutomataMinimizationTime, 18 MinimizatonAttempts, 23747 StatesRemovedByMinimization, 15 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 1.3s InterpolantComputationTime, 687 NumberOfCodeBlocks, 687 NumberOfCodeBlocksAsserted, 19 NumberOfCheckSat, 616 ConstructedInterpolants, 0 QuantifiedInterpolants, 188343 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 18 InterpolantComputations, 18 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...