./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/pthread-wmm/mix012_tso.oepc.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_0df3a77f-33f6-407c-b0ee-db2aaf6b1a92/bin/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/run_dir_0df3a77f-33f6-407c-b0ee-db2aaf6b1a92/bin/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_0df3a77f-33f6-407c-b0ee-db2aaf6b1a92/bin/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_0df3a77f-33f6-407c-b0ee-db2aaf6b1a92/bin/uautomizer/config/AutomizerReach.xml -i ../../sv-benchmarks/c/pthread-wmm/mix012_tso.oepc.i -s /tmp/vcloud-vcloud-master/worker/run_dir_0df3a77f-33f6-407c-b0ee-db2aaf6b1a92/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_0df3a77f-33f6-407c-b0ee-db2aaf6b1a92/bin/uautomizer --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(__VERIFIER_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 872e46ac4033467f3a249153f373c05d47fb8df6 ............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................ 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:09:55,905 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-07 11:09:55,906 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-07 11:09:55,916 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-07 11:09:55,916 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-07 11:09:55,916 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-07 11:09:55,917 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-07 11:09:55,919 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-07 11:09:55,920 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-07 11:09:55,920 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-07 11:09:55,921 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-07 11:09:55,922 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-07 11:09:55,922 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-07 11:09:55,923 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-07 11:09:55,923 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-07 11:09:55,924 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-07 11:09:55,925 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-07 11:09:55,926 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-07 11:09:55,927 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-07 11:09:55,928 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-07 11:09:55,930 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-07 11:09:55,930 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-07 11:09:55,931 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-07 11:09:55,931 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-07 11:09:55,933 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-07 11:09:55,933 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-07 11:09:55,933 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-07 11:09:55,934 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-07 11:09:55,934 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-07 11:09:55,935 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-07 11:09:55,935 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-07 11:09:55,935 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-07 11:09:55,936 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-07 11:09:55,936 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-07 11:09:55,937 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-07 11:09:55,937 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-07 11:09:55,938 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-07 11:09:55,938 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-07 11:09:55,938 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-07 11:09:55,939 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-07 11:09:55,939 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-07 11:09:55,940 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_0df3a77f-33f6-407c-b0ee-db2aaf6b1a92/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf [2019-12-07 11:09:55,953 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-07 11:09:55,953 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-07 11:09:55,954 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-07 11:09:55,954 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-07 11:09:55,954 INFO L138 SettingsManager]: * Use SBE=true [2019-12-07 11:09:55,954 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-07 11:09:55,955 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-07 11:09:55,955 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-07 11:09:55,955 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-07 11:09:55,955 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-07 11:09:55,955 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-07 11:09:55,956 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-07 11:09:55,956 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-07 11:09:55,956 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-07 11:09:55,956 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-07 11:09:55,956 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-07 11:09:55,957 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-07 11:09:55,957 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-07 11:09:55,957 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-12-07 11:09:55,957 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-07 11:09:55,957 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-07 11:09:55,957 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-07 11:09:55,958 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-07 11:09:55,958 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-07 11:09:55,958 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-07 11:09:55,958 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-12-07 11:09:55,958 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-07 11:09:55,959 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-07 11:09:55,959 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2019-12-07 11:09:55,959 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /tmp/vcloud-vcloud-master/worker/run_dir_0df3a77f-33f6-407c-b0ee-db2aaf6b1a92/bin/uautomizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(__VERIFIER_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 872e46ac4033467f3a249153f373c05d47fb8df6 [2019-12-07 11:09:56,060 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-07 11:09:56,068 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-07 11:09:56,071 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-07 11:09:56,072 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-07 11:09:56,072 INFO L275 PluginConnector]: CDTParser initialized [2019-12-07 11:09:56,073 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_0df3a77f-33f6-407c-b0ee-db2aaf6b1a92/bin/uautomizer/../../sv-benchmarks/c/pthread-wmm/mix012_tso.oepc.i [2019-12-07 11:09:56,114 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_0df3a77f-33f6-407c-b0ee-db2aaf6b1a92/bin/uautomizer/data/5a298cd2a/df9354a440044e78900f59142fc1c5e3/FLAGad4ba1e75 [2019-12-07 11:09:56,571 INFO L306 CDTParser]: Found 1 translation units. [2019-12-07 11:09:56,572 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_0df3a77f-33f6-407c-b0ee-db2aaf6b1a92/sv-benchmarks/c/pthread-wmm/mix012_tso.oepc.i [2019-12-07 11:09:56,584 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_0df3a77f-33f6-407c-b0ee-db2aaf6b1a92/bin/uautomizer/data/5a298cd2a/df9354a440044e78900f59142fc1c5e3/FLAGad4ba1e75 [2019-12-07 11:09:57,096 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_0df3a77f-33f6-407c-b0ee-db2aaf6b1a92/bin/uautomizer/data/5a298cd2a/df9354a440044e78900f59142fc1c5e3 [2019-12-07 11:09:57,098 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-07 11:09:57,099 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-12-07 11:09:57,100 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-07 11:09:57,100 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-07 11:09:57,103 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-07 11:09:57,103 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.12 11:09:57" (1/1) ... [2019-12-07 11:09:57,105 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@27a7eda1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 11:09:57, skipping insertion in model container [2019-12-07 11:09:57,106 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.12 11:09:57" (1/1) ... [2019-12-07 11:09:57,112 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-07 11:09:57,153 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-07 11:09:57,409 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-07 11:09:57,416 INFO L203 MainTranslator]: Completed pre-run [2019-12-07 11:09:57,457 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-07 11:09:57,501 INFO L208 MainTranslator]: Completed translation [2019-12-07 11:09:57,501 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 11:09:57 WrapperNode [2019-12-07 11:09:57,501 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-07 11:09:57,502 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-07 11:09:57,502 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-07 11:09:57,502 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-07 11:09:57,507 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:09:57" (1/1) ... [2019-12-07 11:09:57,519 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:09:57" (1/1) ... [2019-12-07 11:09:57,537 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-07 11:09:57,537 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-07 11:09:57,537 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-07 11:09:57,537 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-07 11:09:57,543 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 11:09:57" (1/1) ... [2019-12-07 11:09:57,543 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 11:09:57" (1/1) ... [2019-12-07 11:09:57,546 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 11:09:57" (1/1) ... [2019-12-07 11:09:57,546 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 11:09:57" (1/1) ... [2019-12-07 11:09:57,553 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 11:09:57" (1/1) ... [2019-12-07 11:09:57,556 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 11:09:57" (1/1) ... [2019-12-07 11:09:57,558 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 11:09:57" (1/1) ... [2019-12-07 11:09:57,561 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-07 11:09:57,561 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-07 11:09:57,561 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-07 11:09:57,561 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-07 11:09:57,562 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 11:09:57" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_0df3a77f-33f6-407c-b0ee-db2aaf6b1a92/bin/uautomizer/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-07 11:09:57,605 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-12-07 11:09:57,605 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2019-12-07 11:09:57,606 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-12-07 11:09:57,606 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-12-07 11:09:57,606 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2019-12-07 11:09:57,606 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2019-12-07 11:09:57,606 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2019-12-07 11:09:57,606 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2019-12-07 11:09:57,606 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2019-12-07 11:09:57,606 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-07 11:09:57,606 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-07 11:09:57,607 WARN L205 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2019-12-07 11:09:57,946 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-07 11:09:57,946 INFO L287 CfgBuilder]: Removed 8 assume(true) statements. [2019-12-07 11:09:57,947 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 11:09:57 BoogieIcfgContainer [2019-12-07 11:09:57,947 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-07 11:09:57,948 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-07 11:09:57,948 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-07 11:09:57,949 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-07 11:09:57,950 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.12 11:09:57" (1/3) ... [2019-12-07 11:09:57,950 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@48a8ac3e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.12 11:09:57, skipping insertion in model container [2019-12-07 11:09:57,950 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 11:09:57" (2/3) ... [2019-12-07 11:09:57,950 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@48a8ac3e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.12 11:09:57, skipping insertion in model container [2019-12-07 11:09:57,950 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 11:09:57" (3/3) ... [2019-12-07 11:09:57,951 INFO L109 eAbstractionObserver]: Analyzing ICFG mix012_tso.oepc.i [2019-12-07 11:09:57,957 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-12-07 11:09:57,958 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-07 11:09:57,962 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2019-12-07 11:09:57,963 INFO L339 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2019-12-07 11:09:57,985 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:09:57,985 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:09:57,985 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:09:57,985 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:09:57,986 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:09:57,986 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:09:57,986 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:09:57,986 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:09:57,986 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:09:57,986 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:09:57,987 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:09:57,987 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:09:57,987 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:09:57,987 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:09:57,987 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:09:57,988 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:09:57,988 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:09:57,988 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:09:57,988 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:09:57,988 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:09:57,988 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:09:57,989 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:09:57,989 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:09:57,989 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:09:57,989 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:09:57,989 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:09:57,990 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:09:57,990 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:09:57,990 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:09:57,990 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:09:57,990 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:09:57,990 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:09:57,991 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:09:57,991 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:09:57,992 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:09:57,992 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:09:57,992 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:09:57,992 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:09:57,993 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:09:57,993 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:09:57,993 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:09:57,993 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:09:57,993 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:09:57,994 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:09:57,994 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:09:57,994 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:09:57,994 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:09:57,994 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:09:57,994 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:09:57,995 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:09:57,995 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:09:57,995 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:09:57,995 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:09:57,995 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:09:57,995 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:09:57,996 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:09:57,996 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:09:57,996 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:09:57,996 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:09:57,996 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:09:57,997 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:09:57,997 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:09:57,997 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:09:57,997 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:09:57,997 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:09:57,997 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:09:57,998 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:09:57,998 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:09:57,998 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:09:57,998 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:09:57,998 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:09:57,999 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:09:57,999 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:09:57,999 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:09:57,999 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:09:57,999 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:09:57,999 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:09:58,000 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:09:58,000 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:09:58,000 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:09:58,000 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:09:58,000 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:09:58,000 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:09:58,001 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:09:58,001 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:09:58,001 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:09:58,001 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:09:58,001 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:09:58,001 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:09:58,002 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:09:58,002 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:09:58,002 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:09:58,002 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:09:58,002 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:09:58,003 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:09:58,003 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:09:58,003 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:09:58,003 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:09:58,003 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:09:58,003 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:09:58,004 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:09:58,004 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:09:58,004 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:09:58,004 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:09:58,004 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:09:58,004 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:09:58,005 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:09:58,005 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:09:58,005 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:09:58,005 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:09:58,005 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:09:58,005 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:09:58,006 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:09:58,006 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:09:58,006 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:09:58,006 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:09:58,006 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:09:58,006 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:09:58,007 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:09:58,007 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:09:58,007 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:09:58,007 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:09:58,007 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:09:58,007 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:09:58,008 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:09:58,008 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:09:58,008 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:09:58,008 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:09:58,008 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:09:58,008 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:09:58,008 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:09:58,009 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:09:58,009 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:09:58,009 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:09:58,009 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:09:58,009 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:09:58,009 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:09:58,010 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:09:58,010 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:09:58,010 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:09:58,010 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:09:58,010 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:09:58,010 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:09:58,011 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:09:58,011 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:09:58,011 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:09:58,011 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:09:58,011 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:09:58,011 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:09:58,012 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:09:58,012 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:09:58,012 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:09:58,025 INFO L249 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2019-12-07 11:09:58,041 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-07 11:09:58,041 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-07 11:09:58,041 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-07 11:09:58,041 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-12-07 11:09:58,041 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-07 11:09:58,041 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-07 11:09:58,041 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-07 11:09:58,041 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-07 11:09:58,052 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 148 places, 182 transitions [2019-12-07 11:09:58,053 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 148 places, 182 transitions [2019-12-07 11:09:58,111 INFO L134 PetriNetUnfolder]: 41/180 cut-off events. [2019-12-07 11:09:58,111 INFO L135 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-07 11:09:58,122 INFO L76 FinitePrefix]: Finished finitePrefix Result has 187 conditions, 180 events. 41/180 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 566 event pairs. 6/143 useless extension candidates. Maximal degree in co-relation 150. Up to 2 conditions per place. [2019-12-07 11:09:58,136 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 148 places, 182 transitions [2019-12-07 11:09:58,160 INFO L134 PetriNetUnfolder]: 41/180 cut-off events. [2019-12-07 11:09:58,160 INFO L135 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-07 11:09:58,164 INFO L76 FinitePrefix]: Finished finitePrefix Result has 187 conditions, 180 events. 41/180 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 566 event pairs. 6/143 useless extension candidates. Maximal degree in co-relation 150. Up to 2 conditions per place. [2019-12-07 11:09:58,174 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 12056 [2019-12-07 11:09:58,175 INFO L170 etLargeBlockEncoding]: Semantic Check. [2019-12-07 11:10:00,894 WARN L192 SmtUtils]: Spent 126.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 83 [2019-12-07 11:10:01,158 INFO L206 etLargeBlockEncoding]: Checked pairs total: 77720 [2019-12-07 11:10:01,158 INFO L214 etLargeBlockEncoding]: Total number of compositions: 109 [2019-12-07 11:10:01,161 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 75 places, 84 transitions [2019-12-07 11:10:01,516 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 8912 states. [2019-12-07 11:10:01,518 INFO L276 IsEmpty]: Start isEmpty. Operand 8912 states. [2019-12-07 11:10:01,521 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2019-12-07 11:10:01,522 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 11:10:01,522 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1] [2019-12-07 11:10:01,522 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:10:01,526 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 11:10:01,526 INFO L82 PathProgramCache]: Analyzing trace with hash 795178, now seen corresponding path program 1 times [2019-12-07 11:10:01,532 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 11:10:01,532 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [367469721] [2019-12-07 11:10:01,532 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 11:10:01,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:10:01,664 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:10:01,664 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [367469721] [2019-12-07 11:10:01,665 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 11:10:01,665 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-07 11:10:01,666 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2145770628] [2019-12-07 11:10:01,669 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 11:10:01,669 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 11:10:01,678 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 11:10:01,679 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 11:10:01,680 INFO L87 Difference]: Start difference. First operand 8912 states. Second operand 3 states. [2019-12-07 11:10:01,870 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 11:10:01,870 INFO L93 Difference]: Finished difference Result 8760 states and 28314 transitions. [2019-12-07 11:10:01,871 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 11:10:01,872 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 [2019-12-07 11:10:01,872 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 11:10:01,931 INFO L225 Difference]: With dead ends: 8760 [2019-12-07 11:10:01,931 INFO L226 Difference]: Without dead ends: 7798 [2019-12-07 11:10:01,932 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:10:02,013 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7798 states. [2019-12-07 11:10:02,164 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7798 to 7798. [2019-12-07 11:10:02,165 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7798 states. [2019-12-07 11:10:02,191 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7798 states to 7798 states and 25120 transitions. [2019-12-07 11:10:02,192 INFO L78 Accepts]: Start accepts. Automaton has 7798 states and 25120 transitions. Word has length 3 [2019-12-07 11:10:02,192 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 11:10:02,192 INFO L462 AbstractCegarLoop]: Abstraction has 7798 states and 25120 transitions. [2019-12-07 11:10:02,193 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 11:10:02,193 INFO L276 IsEmpty]: Start isEmpty. Operand 7798 states and 25120 transitions. [2019-12-07 11:10:02,195 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-12-07 11:10:02,195 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 11:10:02,195 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 11:10:02,195 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:10:02,195 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 11:10:02,196 INFO L82 PathProgramCache]: Analyzing trace with hash 1406163788, now seen corresponding path program 1 times [2019-12-07 11:10:02,196 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 11:10:02,196 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [180429363] [2019-12-07 11:10:02,196 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 11:10:02,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:10:02,273 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:10:02,274 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [180429363] [2019-12-07 11:10:02,274 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 11:10:02,274 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 11:10:02,274 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1980187584] [2019-12-07 11:10:02,275 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 11:10:02,275 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 11:10:02,275 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 11:10:02,275 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 11:10:02,276 INFO L87 Difference]: Start difference. First operand 7798 states and 25120 transitions. Second operand 4 states. [2019-12-07 11:10:02,550 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 11:10:02,550 INFO L93 Difference]: Finished difference Result 11906 states and 36801 transitions. [2019-12-07 11:10:02,551 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-07 11:10:02,551 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 11 [2019-12-07 11:10:02,551 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 11:10:02,610 INFO L225 Difference]: With dead ends: 11906 [2019-12-07 11:10:02,610 INFO L226 Difference]: Without dead ends: 11892 [2019-12-07 11:10:02,611 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 0 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:10:02,680 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11892 states. [2019-12-07 11:10:02,836 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11892 to 10583. [2019-12-07 11:10:02,836 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10583 states. [2019-12-07 11:10:02,857 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10583 states to 10583 states and 33330 transitions. [2019-12-07 11:10:02,857 INFO L78 Accepts]: Start accepts. Automaton has 10583 states and 33330 transitions. Word has length 11 [2019-12-07 11:10:02,857 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 11:10:02,857 INFO L462 AbstractCegarLoop]: Abstraction has 10583 states and 33330 transitions. [2019-12-07 11:10:02,857 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 11:10:02,857 INFO L276 IsEmpty]: Start isEmpty. Operand 10583 states and 33330 transitions. [2019-12-07 11:10:02,861 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-12-07 11:10:02,861 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 11:10:02,861 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 11:10:02,861 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:10:02,862 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 11:10:02,862 INFO L82 PathProgramCache]: Analyzing trace with hash 540130104, now seen corresponding path program 1 times [2019-12-07 11:10:02,862 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 11:10:02,862 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [127603758] [2019-12-07 11:10:02,862 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 11:10:02,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:10:02,924 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 11:10:02,925 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [127603758] [2019-12-07 11:10:02,925 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 11:10:02,925 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 11:10:02,925 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [881069238] [2019-12-07 11:10:02,925 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-07 11:10:02,925 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 11:10:02,925 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-07 11:10:02,926 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-07 11:10:02,926 INFO L87 Difference]: Start difference. First operand 10583 states and 33330 transitions. Second operand 5 states. [2019-12-07 11:10:03,179 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 11:10:03,179 INFO L93 Difference]: Finished difference Result 15056 states and 46886 transitions. [2019-12-07 11:10:03,180 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-07 11:10:03,180 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 14 [2019-12-07 11:10:03,180 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 11:10:03,208 INFO L225 Difference]: With dead ends: 15056 [2019-12-07 11:10:03,208 INFO L226 Difference]: Without dead ends: 15056 [2019-12-07 11:10:03,209 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:10:03,282 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15056 states. [2019-12-07 11:10:03,490 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15056 to 12203. [2019-12-07 11:10:03,490 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12203 states. [2019-12-07 11:10:03,514 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12203 states to 12203 states and 38425 transitions. [2019-12-07 11:10:03,514 INFO L78 Accepts]: Start accepts. Automaton has 12203 states and 38425 transitions. Word has length 14 [2019-12-07 11:10:03,515 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 11:10:03,515 INFO L462 AbstractCegarLoop]: Abstraction has 12203 states and 38425 transitions. [2019-12-07 11:10:03,515 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-07 11:10:03,515 INFO L276 IsEmpty]: Start isEmpty. Operand 12203 states and 38425 transitions. [2019-12-07 11:10:03,517 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-12-07 11:10:03,518 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 11:10:03,518 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:10:03,518 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:10:03,518 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 11:10:03,518 INFO L82 PathProgramCache]: Analyzing trace with hash -191481557, now seen corresponding path program 1 times [2019-12-07 11:10:03,518 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 11:10:03,518 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1798222861] [2019-12-07 11:10:03,518 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 11:10:03,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:10:03,548 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:10:03,549 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1798222861] [2019-12-07 11:10:03,549 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 11:10:03,549 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 11:10:03,549 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1147850717] [2019-12-07 11:10:03,549 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 11:10:03,550 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 11:10:03,550 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 11:10:03,550 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 11:10:03,550 INFO L87 Difference]: Start difference. First operand 12203 states and 38425 transitions. Second operand 3 states. [2019-12-07 11:10:03,560 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 11:10:03,560 INFO L93 Difference]: Finished difference Result 1592 states and 3548 transitions. [2019-12-07 11:10:03,560 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 11:10:03,560 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 16 [2019-12-07 11:10:03,561 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 11:10:03,563 INFO L225 Difference]: With dead ends: 1592 [2019-12-07 11:10:03,563 INFO L226 Difference]: Without dead ends: 1592 [2019-12-07 11:10:03,563 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:10:03,569 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1592 states. [2019-12-07 11:10:03,585 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1592 to 1572. [2019-12-07 11:10:03,586 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1572 states. [2019-12-07 11:10:03,588 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1572 states to 1572 states and 3508 transitions. [2019-12-07 11:10:03,588 INFO L78 Accepts]: Start accepts. Automaton has 1572 states and 3508 transitions. Word has length 16 [2019-12-07 11:10:03,588 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 11:10:03,588 INFO L462 AbstractCegarLoop]: Abstraction has 1572 states and 3508 transitions. [2019-12-07 11:10:03,588 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 11:10:03,588 INFO L276 IsEmpty]: Start isEmpty. Operand 1572 states and 3508 transitions. [2019-12-07 11:10:03,589 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2019-12-07 11:10:03,589 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 11:10:03,589 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] [2019-12-07 11:10:03,589 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:10:03,590 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 11:10:03,590 INFO L82 PathProgramCache]: Analyzing trace with hash 603755618, now seen corresponding path program 1 times [2019-12-07 11:10:03,590 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 11:10:03,590 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [730843251] [2019-12-07 11:10:03,590 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 11:10:03,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:10:03,666 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:10:03,667 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [730843251] [2019-12-07 11:10:03,667 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 11:10:03,667 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 11:10:03,667 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1159291732] [2019-12-07 11:10:03,667 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-07 11:10:03,667 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 11:10:03,667 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-07 11:10:03,668 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-12-07 11:10:03,668 INFO L87 Difference]: Start difference. First operand 1572 states and 3508 transitions. Second operand 6 states. [2019-12-07 11:10:03,943 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 11:10:03,943 INFO L93 Difference]: Finished difference Result 2337 states and 5011 transitions. [2019-12-07 11:10:03,944 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-12-07 11:10:03,944 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 24 [2019-12-07 11:10:03,944 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 11:10:03,946 INFO L225 Difference]: With dead ends: 2337 [2019-12-07 11:10:03,946 INFO L226 Difference]: Without dead ends: 2337 [2019-12-07 11:10:03,947 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2019-12-07 11:10:03,951 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2337 states. [2019-12-07 11:10:03,963 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2337 to 1705. [2019-12-07 11:10:03,963 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1705 states. [2019-12-07 11:10:03,965 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1705 states to 1705 states and 3772 transitions. [2019-12-07 11:10:03,965 INFO L78 Accepts]: Start accepts. Automaton has 1705 states and 3772 transitions. Word has length 24 [2019-12-07 11:10:03,965 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 11:10:03,965 INFO L462 AbstractCegarLoop]: Abstraction has 1705 states and 3772 transitions. [2019-12-07 11:10:03,965 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-07 11:10:03,966 INFO L276 IsEmpty]: Start isEmpty. Operand 1705 states and 3772 transitions. [2019-12-07 11:10:03,967 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-12-07 11:10:03,967 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 11:10:03,967 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:10:03,967 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:10:03,967 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 11:10:03,967 INFO L82 PathProgramCache]: Analyzing trace with hash 461887986, now seen corresponding path program 1 times [2019-12-07 11:10:03,968 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 11:10:03,968 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [661935291] [2019-12-07 11:10:03,968 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 11:10:03,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:10:04,018 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:10:04,018 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [661935291] [2019-12-07 11:10:04,019 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 11:10:04,019 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-07 11:10:04,019 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [212840128] [2019-12-07 11:10:04,019 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-07 11:10:04,019 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 11:10:04,019 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-07 11:10:04,019 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-07 11:10:04,019 INFO L87 Difference]: Start difference. First operand 1705 states and 3772 transitions. Second operand 5 states. [2019-12-07 11:10:04,293 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 11:10:04,293 INFO L93 Difference]: Finished difference Result 2417 states and 5251 transitions. [2019-12-07 11:10:04,293 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-07 11:10:04,293 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 26 [2019-12-07 11:10:04,293 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 11:10:04,295 INFO L225 Difference]: With dead ends: 2417 [2019-12-07 11:10:04,295 INFO L226 Difference]: Without dead ends: 2417 [2019-12-07 11:10:04,295 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-12-07 11:10:04,299 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2417 states. [2019-12-07 11:10:04,312 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2417 to 2124. [2019-12-07 11:10:04,313 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2124 states. [2019-12-07 11:10:04,315 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2124 states to 2124 states and 4675 transitions. [2019-12-07 11:10:04,315 INFO L78 Accepts]: Start accepts. Automaton has 2124 states and 4675 transitions. Word has length 26 [2019-12-07 11:10:04,315 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 11:10:04,315 INFO L462 AbstractCegarLoop]: Abstraction has 2124 states and 4675 transitions. [2019-12-07 11:10:04,315 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-07 11:10:04,315 INFO L276 IsEmpty]: Start isEmpty. Operand 2124 states and 4675 transitions. [2019-12-07 11:10:04,317 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-12-07 11:10:04,317 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 11:10:04,317 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:10:04,317 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:10:04,317 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 11:10:04,317 INFO L82 PathProgramCache]: Analyzing trace with hash -1792140012, now seen corresponding path program 1 times [2019-12-07 11:10:04,317 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 11:10:04,317 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1993428286] [2019-12-07 11:10:04,317 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 11:10:04,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:10:04,350 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:10:04,350 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1993428286] [2019-12-07 11:10:04,350 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 11:10:04,350 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 11:10:04,350 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [554081283] [2019-12-07 11:10:04,350 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 11:10:04,350 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 11:10:04,351 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 11:10:04,351 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-07 11:10:04,351 INFO L87 Difference]: Start difference. First operand 2124 states and 4675 transitions. Second operand 4 states. [2019-12-07 11:10:04,360 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 11:10:04,360 INFO L93 Difference]: Finished difference Result 1195 states and 2515 transitions. [2019-12-07 11:10:04,360 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 11:10:04,360 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 27 [2019-12-07 11:10:04,360 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 11:10:04,361 INFO L225 Difference]: With dead ends: 1195 [2019-12-07 11:10:04,361 INFO L226 Difference]: Without dead ends: 1195 [2019-12-07 11:10:04,361 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-07 11:10:04,363 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1195 states. [2019-12-07 11:10:04,370 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1195 to 1099. [2019-12-07 11:10:04,371 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1099 states. [2019-12-07 11:10:04,372 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1099 states to 1099 states and 2338 transitions. [2019-12-07 11:10:04,372 INFO L78 Accepts]: Start accepts. Automaton has 1099 states and 2338 transitions. Word has length 27 [2019-12-07 11:10:04,372 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 11:10:04,372 INFO L462 AbstractCegarLoop]: Abstraction has 1099 states and 2338 transitions. [2019-12-07 11:10:04,372 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 11:10:04,372 INFO L276 IsEmpty]: Start isEmpty. Operand 1099 states and 2338 transitions. [2019-12-07 11:10:04,374 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2019-12-07 11:10:04,374 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 11:10:04,374 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] [2019-12-07 11:10:04,374 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:10:04,374 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 11:10:04,375 INFO L82 PathProgramCache]: Analyzing trace with hash -306941312, now seen corresponding path program 1 times [2019-12-07 11:10:04,375 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 11:10:04,375 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [419047818] [2019-12-07 11:10:04,375 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 11:10:04,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:10:04,447 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:10:04,448 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [419047818] [2019-12-07 11:10:04,448 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 11:10:04,448 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-07 11:10:04,448 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2005616081] [2019-12-07 11:10:04,448 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-07 11:10:04,448 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 11:10:04,449 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-07 11:10:04,449 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2019-12-07 11:10:04,449 INFO L87 Difference]: Start difference. First operand 1099 states and 2338 transitions. Second operand 7 states. [2019-12-07 11:10:04,995 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 11:10:04,995 INFO L93 Difference]: Finished difference Result 1596 states and 3306 transitions. [2019-12-07 11:10:04,996 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-12-07 11:10:04,996 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 50 [2019-12-07 11:10:04,996 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 11:10:04,997 INFO L225 Difference]: With dead ends: 1596 [2019-12-07 11:10:04,997 INFO L226 Difference]: Without dead ends: 1590 [2019-12-07 11:10:04,997 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 4 SyntacticMatches, 2 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=47, Invalid=135, Unknown=0, NotChecked=0, Total=182 [2019-12-07 11:10:04,999 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1590 states. [2019-12-07 11:10:05,008 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1590 to 1154. [2019-12-07 11:10:05,008 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1154 states. [2019-12-07 11:10:05,009 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1154 states to 1154 states and 2439 transitions. [2019-12-07 11:10:05,009 INFO L78 Accepts]: Start accepts. Automaton has 1154 states and 2439 transitions. Word has length 50 [2019-12-07 11:10:05,009 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 11:10:05,009 INFO L462 AbstractCegarLoop]: Abstraction has 1154 states and 2439 transitions. [2019-12-07 11:10:05,009 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-07 11:10:05,009 INFO L276 IsEmpty]: Start isEmpty. Operand 1154 states and 2439 transitions. [2019-12-07 11:10:05,011 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2019-12-07 11:10:05,011 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 11:10:05,011 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] [2019-12-07 11:10:05,012 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:10:05,012 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 11:10:05,012 INFO L82 PathProgramCache]: Analyzing trace with hash 945539546, now seen corresponding path program 2 times [2019-12-07 11:10:05,012 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 11:10:05,012 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1956825062] [2019-12-07 11:10:05,012 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 11:10:05,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:10:05,058 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:10:05,058 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1956825062] [2019-12-07 11:10:05,058 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 11:10:05,058 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 11:10:05,059 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2008948578] [2019-12-07 11:10:05,059 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 11:10:05,059 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 11:10:05,059 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 11:10:05,060 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 11:10:05,060 INFO L87 Difference]: Start difference. First operand 1154 states and 2439 transitions. Second operand 3 states. [2019-12-07 11:10:05,095 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 11:10:05,095 INFO L93 Difference]: Finished difference Result 1575 states and 3323 transitions. [2019-12-07 11:10:05,095 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 11:10:05,095 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 50 [2019-12-07 11:10:05,096 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 11:10:05,097 INFO L225 Difference]: With dead ends: 1575 [2019-12-07 11:10:05,097 INFO L226 Difference]: Without dead ends: 1575 [2019-12-07 11:10:05,097 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 2 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:10:05,099 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1575 states. [2019-12-07 11:10:05,108 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1575 to 1222. [2019-12-07 11:10:05,109 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1222 states. [2019-12-07 11:10:05,110 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1222 states to 1222 states and 2603 transitions. [2019-12-07 11:10:05,110 INFO L78 Accepts]: Start accepts. Automaton has 1222 states and 2603 transitions. Word has length 50 [2019-12-07 11:10:05,110 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 11:10:05,110 INFO L462 AbstractCegarLoop]: Abstraction has 1222 states and 2603 transitions. [2019-12-07 11:10:05,110 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 11:10:05,110 INFO L276 IsEmpty]: Start isEmpty. Operand 1222 states and 2603 transitions. [2019-12-07 11:10:05,112 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2019-12-07 11:10:05,112 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 11:10:05,112 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] [2019-12-07 11:10:05,112 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:10:05,113 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 11:10:05,113 INFO L82 PathProgramCache]: Analyzing trace with hash -1376295086, now seen corresponding path program 1 times [2019-12-07 11:10:05,113 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 11:10:05,113 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [168694547] [2019-12-07 11:10:05,113 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 11:10:05,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:10:05,212 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:10:05,212 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [168694547] [2019-12-07 11:10:05,212 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 11:10:05,212 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-07 11:10:05,212 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [775087491] [2019-12-07 11:10:05,212 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-12-07 11:10:05,213 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 11:10:05,213 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-12-07 11:10:05,213 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2019-12-07 11:10:05,213 INFO L87 Difference]: Start difference. First operand 1222 states and 2603 transitions. Second operand 8 states. [2019-12-07 11:10:05,885 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 11:10:05,885 INFO L93 Difference]: Finished difference Result 1759 states and 3621 transitions. [2019-12-07 11:10:05,885 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-12-07 11:10:05,886 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 51 [2019-12-07 11:10:05,886 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 11:10:05,887 INFO L225 Difference]: With dead ends: 1759 [2019-12-07 11:10:05,887 INFO L226 Difference]: Without dead ends: 1759 [2019-12-07 11:10:05,887 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 7 SyntacticMatches, 2 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 76 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=88, Invalid=332, Unknown=0, NotChecked=0, Total=420 [2019-12-07 11:10:05,889 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1759 states. [2019-12-07 11:10:05,901 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1759 to 1200. [2019-12-07 11:10:05,901 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1200 states. [2019-12-07 11:10:05,903 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1200 states to 1200 states and 2557 transitions. [2019-12-07 11:10:05,903 INFO L78 Accepts]: Start accepts. Automaton has 1200 states and 2557 transitions. Word has length 51 [2019-12-07 11:10:05,903 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 11:10:05,903 INFO L462 AbstractCegarLoop]: Abstraction has 1200 states and 2557 transitions. [2019-12-07 11:10:05,904 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-12-07 11:10:05,904 INFO L276 IsEmpty]: Start isEmpty. Operand 1200 states and 2557 transitions. [2019-12-07 11:10:05,906 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2019-12-07 11:10:05,906 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 11:10:05,906 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] [2019-12-07 11:10:05,906 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:10:05,906 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 11:10:05,906 INFO L82 PathProgramCache]: Analyzing trace with hash 576609332, now seen corresponding path program 2 times [2019-12-07 11:10:05,907 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 11:10:05,907 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [578357485] [2019-12-07 11:10:05,907 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 11:10:05,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:10:05,964 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:10:05,964 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [578357485] [2019-12-07 11:10:05,964 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 11:10:05,964 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 11:10:05,964 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1928909025] [2019-12-07 11:10:05,965 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 11:10:05,965 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 11:10:05,965 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 11:10:05,965 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 11:10:05,965 INFO L87 Difference]: Start difference. First operand 1200 states and 2557 transitions. Second operand 3 states. [2019-12-07 11:10:05,973 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 11:10:05,974 INFO L93 Difference]: Finished difference Result 1199 states and 2555 transitions. [2019-12-07 11:10:05,974 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 11:10:05,974 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 51 [2019-12-07 11:10:05,974 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 11:10:05,975 INFO L225 Difference]: With dead ends: 1199 [2019-12-07 11:10:05,976 INFO L226 Difference]: Without dead ends: 1199 [2019-12-07 11:10:05,976 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:10:05,978 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1199 states. [2019-12-07 11:10:05,988 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1199 to 970. [2019-12-07 11:10:05,988 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 970 states. [2019-12-07 11:10:05,989 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 970 states to 970 states and 2096 transitions. [2019-12-07 11:10:05,989 INFO L78 Accepts]: Start accepts. Automaton has 970 states and 2096 transitions. Word has length 51 [2019-12-07 11:10:05,990 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 11:10:05,990 INFO L462 AbstractCegarLoop]: Abstraction has 970 states and 2096 transitions. [2019-12-07 11:10:05,990 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 11:10:05,990 INFO L276 IsEmpty]: Start isEmpty. Operand 970 states and 2096 transitions. [2019-12-07 11:10:05,991 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2019-12-07 11:10:05,991 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 11:10:05,992 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:10:05,992 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:10:05,992 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 11:10:05,992 INFO L82 PathProgramCache]: Analyzing trace with hash 1353726900, now seen corresponding path program 1 times [2019-12-07 11:10:05,992 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 11:10:05,992 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1194607769] [2019-12-07 11:10:05,992 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 11:10:06,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:10:06,038 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:10:06,038 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1194607769] [2019-12-07 11:10:06,038 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 11:10:06,038 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 11:10:06,038 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [65448181] [2019-12-07 11:10:06,038 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 11:10:06,039 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 11:10:06,039 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 11:10:06,039 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 11:10:06,039 INFO L87 Difference]: Start difference. First operand 970 states and 2096 transitions. Second operand 4 states. [2019-12-07 11:10:06,051 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 11:10:06,051 INFO L93 Difference]: Finished difference Result 1696 states and 3681 transitions. [2019-12-07 11:10:06,051 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 11:10:06,051 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 52 [2019-12-07 11:10:06,052 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 11:10:06,052 INFO L225 Difference]: With dead ends: 1696 [2019-12-07 11:10:06,052 INFO L226 Difference]: Without dead ends: 795 [2019-12-07 11:10:06,053 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:10:06,054 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 795 states. [2019-12-07 11:10:06,059 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 795 to 795. [2019-12-07 11:10:06,059 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 795 states. [2019-12-07 11:10:06,060 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 795 states to 795 states and 1715 transitions. [2019-12-07 11:10:06,060 INFO L78 Accepts]: Start accepts. Automaton has 795 states and 1715 transitions. Word has length 52 [2019-12-07 11:10:06,060 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 11:10:06,060 INFO L462 AbstractCegarLoop]: Abstraction has 795 states and 1715 transitions. [2019-12-07 11:10:06,060 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 11:10:06,060 INFO L276 IsEmpty]: Start isEmpty. Operand 795 states and 1715 transitions. [2019-12-07 11:10:06,061 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2019-12-07 11:10:06,061 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 11:10:06,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, 1, 1, 1, 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:10:06,061 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:10:06,061 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 11:10:06,061 INFO L82 PathProgramCache]: Analyzing trace with hash -673987370, now seen corresponding path program 2 times [2019-12-07 11:10:06,062 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 11:10:06,062 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1856708539] [2019-12-07 11:10:06,062 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 11:10:06,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:10:06,133 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 11:10:06,133 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1856708539] [2019-12-07 11:10:06,134 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 11:10:06,134 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-07 11:10:06,134 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [750014495] [2019-12-07 11:10:06,134 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-07 11:10:06,134 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 11:10:06,134 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-07 11:10:06,134 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-12-07 11:10:06,134 INFO L87 Difference]: Start difference. First operand 795 states and 1715 transitions. Second operand 7 states. [2019-12-07 11:10:06,268 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 11:10:06,268 INFO L93 Difference]: Finished difference Result 1395 states and 2928 transitions. [2019-12-07 11:10:06,268 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-12-07 11:10:06,268 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 52 [2019-12-07 11:10:06,269 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 11:10:06,269 INFO L225 Difference]: With dead ends: 1395 [2019-12-07 11:10:06,269 INFO L226 Difference]: Without dead ends: 945 [2019-12-07 11:10:06,269 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=33, Invalid=99, Unknown=0, NotChecked=0, Total=132 [2019-12-07 11:10:06,271 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 945 states. [2019-12-07 11:10:06,276 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 945 to 789. [2019-12-07 11:10:06,276 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 789 states. [2019-12-07 11:10:06,277 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 789 states to 789 states and 1685 transitions. [2019-12-07 11:10:06,277 INFO L78 Accepts]: Start accepts. Automaton has 789 states and 1685 transitions. Word has length 52 [2019-12-07 11:10:06,277 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 11:10:06,277 INFO L462 AbstractCegarLoop]: Abstraction has 789 states and 1685 transitions. [2019-12-07 11:10:06,278 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-07 11:10:06,278 INFO L276 IsEmpty]: Start isEmpty. Operand 789 states and 1685 transitions. [2019-12-07 11:10:06,278 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2019-12-07 11:10:06,278 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 11:10:06,279 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:10:06,279 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:10:06,279 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 11:10:06,279 INFO L82 PathProgramCache]: Analyzing trace with hash 355104308, now seen corresponding path program 3 times [2019-12-07 11:10:06,279 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 11:10:06,279 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1769697065] [2019-12-07 11:10:06,279 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 11:10:06,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-07 11:10:06,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-07 11:10:06,344 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-07 11:10:06,344 INFO L475 BasicCegarLoop]: Counterexample might be feasible [2019-12-07 11:10:06,347 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [775] [775] ULTIMATE.startENTRY-->L799: Formula: (let ((.cse0 (store |v_#valid_63| 0 0))) (and (< |v_#StackHeapBarrier_15| |v_ULTIMATE.start_main_~#t317~0.base_27|) (= 0 v_~y$r_buff0_thd2~0_418) (= (select .cse0 |v_ULTIMATE.start_main_~#t317~0.base_27|) 0) (= v_~main$tmp_guard0~0_19 0) (= 0 v_~__unbuffered_cnt~0_61) (= v_~y$r_buff0_thd0~0_150 0) (= v_~y$r_buff1_thd1~0_136 0) (= |v_#valid_61| (store .cse0 |v_ULTIMATE.start_main_~#t317~0.base_27| 1)) (= 0 v_~y$w_buff0~0_517) (= |v_#NULL.offset_6| 0) (= v_~y$read_delayed~0_7 0) (= 0 v_~y$r_buff1_thd2~0_265) (= v_~weak$$choice2~0_161 0) (= 0 v_~y$read_delayed_var~0.base_5) (= 0 v_~y$flush_delayed~0_39) (= v_~__unbuffered_p1_EBX~0_45 0) (= |v_ULTIMATE.start_main_~#t317~0.offset_19| 0) (< 0 |v_#StackHeapBarrier_15|) (= v_~y$r_buff0_thd1~0_219 0) (= 0 v_~y$read_delayed_var~0.offset_5) (= v_~y$w_buff1~0_303 0) (= |v_#length_17| (store |v_#length_18| |v_ULTIMATE.start_main_~#t317~0.base_27| 4)) (= 0 |v_#NULL.base_6|) (= v_~y$r_buff1_thd0~0_161 0) (= 0 v_~weak$$choice0~0_24) (= 0 v_~__unbuffered_p0_EAX~0_105) (= v_~main$tmp_guard1~0_47 0) (= v_~x~0_99 0) (= (store |v_#memory_int_12| |v_ULTIMATE.start_main_~#t317~0.base_27| (store (select |v_#memory_int_12| |v_ULTIMATE.start_main_~#t317~0.base_27|) |v_ULTIMATE.start_main_~#t317~0.offset_19| 0)) |v_#memory_int_11|) (= v_~y~0_150 0) (= v_~y$w_buff1_used~0_497 0) (= v_~y$w_buff0_used~0_750 0) (= v_~y$mem_tmp~0_25 0) (= 0 v_~__unbuffered_p1_EAX~0_50))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_15|, #valid=|v_#valid_63|, #memory_int=|v_#memory_int_12|, #length=|v_#length_18|} OutVars{~y$read_delayed_var~0.offset=v_~y$read_delayed_var~0.offset_5, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_750, #NULL.offset=|v_#NULL.offset_6|, ULTIMATE.start_main_~#t318~0.offset=|v_ULTIMATE.start_main_~#t318~0.offset_20|, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_47, ULTIMATE.start_main_#t~ite43=|v_ULTIMATE.start_main_#t~ite43_38|, ULTIMATE.start_main_#t~ite42=|v_ULTIMATE.start_main_#t~ite42_34|, ULTIMATE.start_main_#t~ite45=|v_ULTIMATE.start_main_#t~ite45_87|, ULTIMATE.start_main_#t~ite44=|v_ULTIMATE.start_main_#t~ite44_42|, ~y$read_delayed~0=v_~y$read_delayed~0_7, ~y$r_buff1_thd1~0=v_~y$r_buff1_thd1~0_136, ~y$mem_tmp~0=v_~y$mem_tmp~0_25, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_105, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_50, ~y$w_buff0~0=v_~y$w_buff0~0_517, ~y$r_buff0_thd1~0=v_~y$r_buff0_thd1~0_219, ~y$flush_delayed~0=v_~y$flush_delayed~0_39, #length=|v_#length_17|, ~y~0=v_~y~0_150, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_45, ULTIMATE.start_main_~#t318~0.base=|v_ULTIMATE.start_main_~#t318~0.base_28|, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_19, #NULL.base=|v_#NULL.base_6|, ~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_265, ~weak$$choice0~0=v_~weak$$choice0~0_24, #StackHeapBarrier=|v_#StackHeapBarrier_15|, ULTIMATE.start_main_#t~ite41=|v_ULTIMATE.start_main_#t~ite41_28|, ULTIMATE.start_main_#t~ite40=|v_ULTIMATE.start_main_#t~ite40_36|, ULTIMATE.start_main_~#t317~0.base=|v_ULTIMATE.start_main_~#t317~0.base_27|, ~y$w_buff1~0=v_~y$w_buff1~0_303, ~y$read_delayed_var~0.base=v_~y$read_delayed_var~0.base_5, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_30|, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_150, #valid=|v_#valid_61|, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_418, #memory_int=|v_#memory_int_11|, ULTIMATE.start_main_#t~nondet38=|v_ULTIMATE.start_main_#t~nondet38_9|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_61, ULTIMATE.start_main_~#t317~0.offset=|v_ULTIMATE.start_main_~#t317~0.offset_19|, ULTIMATE.start_main_#t~nondet39=|v_ULTIMATE.start_main_#t~nondet39_18|, ~weak$$choice2~0=v_~weak$$choice2~0_161, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_161, ~x~0=v_~x~0_99, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_497} AuxVars[] AssignedVars[~y$read_delayed_var~0.offset, ~y$w_buff0_used~0, #NULL.offset, ULTIMATE.start_main_~#t318~0.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_p0_EAX~0, ~__unbuffered_p1_EAX~0, ~y$w_buff0~0, ~y$r_buff0_thd1~0, ~y$flush_delayed~0, #length, ~y~0, ~__unbuffered_p1_EBX~0, ULTIMATE.start_main_~#t318~0.base, ~main$tmp_guard0~0, #NULL.base, ~y$r_buff1_thd2~0, ~weak$$choice0~0, ULTIMATE.start_main_#t~ite41, ULTIMATE.start_main_#t~ite40, ULTIMATE.start_main_~#t317~0.base, ~y$w_buff1~0, ~y$read_delayed_var~0.base, ULTIMATE.start_main_#res, ~y$r_buff0_thd0~0, #valid, ~y$r_buff0_thd2~0, #memory_int, ULTIMATE.start_main_#t~nondet38, ~__unbuffered_cnt~0, ULTIMATE.start_main_~#t317~0.offset, 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:10:06,347 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [724] [724] L799-1-->L801: Formula: (and (= (store |v_#memory_int_6| |v_ULTIMATE.start_main_~#t318~0.base_10| (store (select |v_#memory_int_6| |v_ULTIMATE.start_main_~#t318~0.base_10|) |v_ULTIMATE.start_main_~#t318~0.offset_9| 1)) |v_#memory_int_5|) (not (= 0 |v_ULTIMATE.start_main_~#t318~0.base_10|)) (= 0 (select |v_#valid_20| |v_ULTIMATE.start_main_~#t318~0.base_10|)) (= |v_ULTIMATE.start_main_~#t318~0.offset_9| 0) (= (store |v_#length_10| |v_ULTIMATE.start_main_~#t318~0.base_10| 4) |v_#length_9|) (= |v_#valid_19| (store |v_#valid_20| |v_ULTIMATE.start_main_~#t318~0.base_10| 1)) (< |v_#StackHeapBarrier_7| |v_ULTIMATE.start_main_~#t318~0.base_10|)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_7|, #valid=|v_#valid_20|, #memory_int=|v_#memory_int_6|, #length=|v_#length_10|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_7|, #valid=|v_#valid_19|, #memory_int=|v_#memory_int_5|, ULTIMATE.start_main_#t~nondet38=|v_ULTIMATE.start_main_#t~nondet38_5|, ULTIMATE.start_main_~#t318~0.base=|v_ULTIMATE.start_main_~#t318~0.base_10|, ULTIMATE.start_main_~#t318~0.offset=|v_ULTIMATE.start_main_~#t318~0.offset_9|, #length=|v_#length_9|} AuxVars[] AssignedVars[#valid, #memory_int, ULTIMATE.start_main_#t~nondet38, ULTIMATE.start_main_~#t318~0.base, ULTIMATE.start_main_~#t318~0.offset, #length] because there is no mapped edge [2019-12-07 11:10:06,348 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [749] [749] L4-->L740: Formula: (and (not (= 0 P0Thread1of1ForFork0___VERIFIER_assert_~expression_In-697821869)) (= 1 ~y$r_buff0_thd1~0_Out-697821869) (= ~y$r_buff1_thd1~0_Out-697821869 ~y$r_buff0_thd1~0_In-697821869) (= ~y$r_buff1_thd0~0_Out-697821869 ~y$r_buff0_thd0~0_In-697821869) (= ~y$r_buff1_thd2~0_Out-697821869 ~y$r_buff0_thd2~0_In-697821869) (= ~x~0_In-697821869 ~__unbuffered_p0_EAX~0_Out-697821869)) InVars {~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-697821869, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In-697821869, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-697821869, P0Thread1of1ForFork0___VERIFIER_assert_~expression=P0Thread1of1ForFork0___VERIFIER_assert_~expression_In-697821869, ~x~0=~x~0_In-697821869} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_Out-697821869, ~y$r_buff1_thd1~0=~y$r_buff1_thd1~0_Out-697821869, ~__unbuffered_p0_EAX~0=~__unbuffered_p0_EAX~0_Out-697821869, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-697821869, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_Out-697821869, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-697821869, P0Thread1of1ForFork0___VERIFIER_assert_~expression=P0Thread1of1ForFork0___VERIFIER_assert_~expression_In-697821869, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_Out-697821869, ~x~0=~x~0_In-697821869} AuxVars[] AssignedVars[~y$r_buff1_thd2~0, ~y$r_buff1_thd1~0, ~__unbuffered_p0_EAX~0, ~y$r_buff0_thd1~0, ~y$r_buff1_thd0~0] because there is no mapped edge [2019-12-07 11:10:06,349 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [706] [706] L741-->L741-2: Formula: (let ((.cse0 (= (mod ~y$r_buff0_thd1~0_In-1666599828 256) 0)) (.cse1 (= (mod ~y$w_buff0_used~0_In-1666599828 256) 0))) (or (and (= ~y$w_buff0_used~0_In-1666599828 |P0Thread1of1ForFork0_#t~ite5_Out-1666599828|) (or .cse0 .cse1)) (and (not .cse0) (= |P0Thread1of1ForFork0_#t~ite5_Out-1666599828| 0) (not .cse1)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-1666599828, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In-1666599828} OutVars{P0Thread1of1ForFork0_#t~ite5=|P0Thread1of1ForFork0_#t~ite5_Out-1666599828|, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-1666599828, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In-1666599828} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite5] because there is no mapped edge [2019-12-07 11:10:06,349 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [701] [701] L742-->L742-2: Formula: (let ((.cse1 (= (mod ~y$w_buff0_used~0_In845054676 256) 0)) (.cse0 (= (mod ~y$r_buff0_thd1~0_In845054676 256) 0)) (.cse2 (= (mod ~y$r_buff1_thd1~0_In845054676 256) 0)) (.cse3 (= 0 (mod ~y$w_buff1_used~0_In845054676 256)))) (or (and (or .cse0 .cse1) (or .cse2 .cse3) (= ~y$w_buff1_used~0_In845054676 |P0Thread1of1ForFork0_#t~ite6_Out845054676|)) (and (or (and (not .cse1) (not .cse0)) (and (not .cse2) (not .cse3))) (= 0 |P0Thread1of1ForFork0_#t~ite6_Out845054676|)))) InVars {~y$r_buff1_thd1~0=~y$r_buff1_thd1~0_In845054676, ~y$w_buff0_used~0=~y$w_buff0_used~0_In845054676, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In845054676, ~y$w_buff1_used~0=~y$w_buff1_used~0_In845054676} OutVars{P0Thread1of1ForFork0_#t~ite6=|P0Thread1of1ForFork0_#t~ite6_Out845054676|, ~y$r_buff1_thd1~0=~y$r_buff1_thd1~0_In845054676, ~y$w_buff0_used~0=~y$w_buff0_used~0_In845054676, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In845054676, ~y$w_buff1_used~0=~y$w_buff1_used~0_In845054676} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite6] because there is no mapped edge [2019-12-07 11:10:06,350 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [703] [703] L743-->L744: Formula: (let ((.cse0 (= 0 (mod ~y$r_buff0_thd1~0_In-2120394537 256))) (.cse1 (= ~y$r_buff0_thd1~0_Out-2120394537 ~y$r_buff0_thd1~0_In-2120394537)) (.cse2 (= (mod ~y$w_buff0_used~0_In-2120394537 256) 0))) (or (and .cse0 .cse1) (and (not .cse2) (not .cse0) (= ~y$r_buff0_thd1~0_Out-2120394537 0)) (and .cse1 .cse2))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-2120394537, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In-2120394537} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-2120394537, P0Thread1of1ForFork0_#t~ite7=|P0Thread1of1ForFork0_#t~ite7_Out-2120394537|, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_Out-2120394537} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite7, ~y$r_buff0_thd1~0] because there is no mapped edge [2019-12-07 11:10:06,350 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [714] [714] L744-->L744-2: Formula: (let ((.cse3 (= 0 (mod ~y$r_buff0_thd1~0_In-746861885 256))) (.cse2 (= (mod ~y$w_buff0_used~0_In-746861885 256) 0)) (.cse0 (= 0 (mod ~y$r_buff1_thd1~0_In-746861885 256))) (.cse1 (= 0 (mod ~y$w_buff1_used~0_In-746861885 256)))) (or (and (= 0 |P0Thread1of1ForFork0_#t~ite8_Out-746861885|) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (= ~y$r_buff1_thd1~0_In-746861885 |P0Thread1of1ForFork0_#t~ite8_Out-746861885|) (or .cse3 .cse2) (or .cse0 .cse1)))) InVars {~y$r_buff1_thd1~0=~y$r_buff1_thd1~0_In-746861885, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-746861885, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In-746861885, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-746861885} OutVars{~y$r_buff1_thd1~0=~y$r_buff1_thd1~0_In-746861885, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-746861885, P0Thread1of1ForFork0_#t~ite8=|P0Thread1of1ForFork0_#t~ite8_Out-746861885|, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In-746861885, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-746861885} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite8] because there is no mapped edge [2019-12-07 11:10:06,350 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [727] [727] L744-2-->P0EXIT: Formula: (and (= v_~y$r_buff1_thd1~0_51 |v_P0Thread1of1ForFork0_#t~ite8_26|) (= |v_P0Thread1of1ForFork0_#res.offset_3| 0) (= 0 |v_P0Thread1of1ForFork0_#res.base_3|) (= v_~__unbuffered_cnt~0_33 (+ v_~__unbuffered_cnt~0_34 1))) InVars {P0Thread1of1ForFork0_#t~ite8=|v_P0Thread1of1ForFork0_#t~ite8_26|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_34} OutVars{~y$r_buff1_thd1~0=v_~y$r_buff1_thd1~0_51, P0Thread1of1ForFork0_#res.offset=|v_P0Thread1of1ForFork0_#res.offset_3|, P0Thread1of1ForFork0_#t~ite8=|v_P0Thread1of1ForFork0_#t~ite8_25|, P0Thread1of1ForFork0_#res.base=|v_P0Thread1of1ForFork0_#res.base_3|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_33} 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:10:06,351 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [750] [750] L766-->L766-8: Formula: (let ((.cse0 (= 0 (mod ~weak$$choice2~0_In654265737 256)))) (or (and (= |P1Thread1of1ForFork1_#t~ite17_In654265737| |P1Thread1of1ForFork1_#t~ite17_Out654265737|) (not .cse0) (= |P1Thread1of1ForFork1_#t~ite18_Out654265737| ~y$w_buff1~0_In654265737)) (and (= ~y$w_buff1~0_In654265737 |P1Thread1of1ForFork1_#t~ite17_Out654265737|) (= |P1Thread1of1ForFork1_#t~ite18_Out654265737| |P1Thread1of1ForFork1_#t~ite17_Out654265737|) .cse0 (let ((.cse1 (= (mod ~y$r_buff0_thd2~0_In654265737 256) 0))) (or (= 0 (mod ~y$w_buff0_used~0_In654265737 256)) (and .cse1 (= (mod ~y$w_buff1_used~0_In654265737 256) 0)) (and .cse1 (= (mod ~y$r_buff1_thd2~0_In654265737 256) 0))))))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In654265737, ~y$w_buff1~0=~y$w_buff1~0_In654265737, ~y$w_buff0_used~0=~y$w_buff0_used~0_In654265737, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In654265737, ~weak$$choice2~0=~weak$$choice2~0_In654265737, P1Thread1of1ForFork1_#t~ite17=|P1Thread1of1ForFork1_#t~ite17_In654265737|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In654265737} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In654265737, P1Thread1of1ForFork1_#t~ite18=|P1Thread1of1ForFork1_#t~ite18_Out654265737|, ~y$w_buff1~0=~y$w_buff1~0_In654265737, ~y$w_buff0_used~0=~y$w_buff0_used~0_In654265737, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In654265737, ~weak$$choice2~0=~weak$$choice2~0_In654265737, P1Thread1of1ForFork1_#t~ite17=|P1Thread1of1ForFork1_#t~ite17_Out654265737|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In654265737} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite18, P1Thread1of1ForFork1_#t~ite17] because there is no mapped edge [2019-12-07 11:10:06,351 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [751] [751] L767-->L767-8: Formula: (let ((.cse0 (= (mod ~weak$$choice2~0_In-20780897 256) 0))) (or (and (not .cse0) (= |P1Thread1of1ForFork1_#t~ite21_Out-20780897| ~y$w_buff0_used~0_In-20780897) (= |P1Thread1of1ForFork1_#t~ite20_In-20780897| |P1Thread1of1ForFork1_#t~ite20_Out-20780897|)) (and (= |P1Thread1of1ForFork1_#t~ite21_Out-20780897| |P1Thread1of1ForFork1_#t~ite20_Out-20780897|) (let ((.cse1 (= (mod ~y$r_buff0_thd2~0_In-20780897 256) 0))) (or (and .cse1 (= 0 (mod ~y$w_buff1_used~0_In-20780897 256))) (= 0 (mod ~y$w_buff0_used~0_In-20780897 256)) (and .cse1 (= (mod ~y$r_buff1_thd2~0_In-20780897 256) 0)))) (= |P1Thread1of1ForFork1_#t~ite20_Out-20780897| ~y$w_buff0_used~0_In-20780897) .cse0))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-20780897, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-20780897, P1Thread1of1ForFork1_#t~ite20=|P1Thread1of1ForFork1_#t~ite20_In-20780897|, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-20780897, ~weak$$choice2~0=~weak$$choice2~0_In-20780897, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-20780897} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-20780897, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-20780897, P1Thread1of1ForFork1_#t~ite20=|P1Thread1of1ForFork1_#t~ite20_Out-20780897|, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-20780897, P1Thread1of1ForFork1_#t~ite21=|P1Thread1of1ForFork1_#t~ite21_Out-20780897|, ~weak$$choice2~0=~weak$$choice2~0_In-20780897, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-20780897} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite20, P1Thread1of1ForFork1_#t~ite21] because there is no mapped edge [2019-12-07 11:10:06,351 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [763] [763] L768-->L768-8: Formula: (let ((.cse5 (= 0 (mod ~y$w_buff0_used~0_In-1811484376 256))) (.cse4 (= (mod ~y$r_buff1_thd2~0_In-1811484376 256) 0)) (.cse3 (= (mod ~y$w_buff1_used~0_In-1811484376 256) 0)) (.cse0 (= 0 (mod ~weak$$choice2~0_In-1811484376 256))) (.cse1 (= |P1Thread1of1ForFork1_#t~ite24_Out-1811484376| |P1Thread1of1ForFork1_#t~ite23_Out-1811484376|)) (.cse2 (= (mod ~y$r_buff0_thd2~0_In-1811484376 256) 0))) (or (and (or (and (= |P1Thread1of1ForFork1_#t~ite24_Out-1811484376| ~y$w_buff1_used~0_In-1811484376) (not .cse0) (= |P1Thread1of1ForFork1_#t~ite23_Out-1811484376| |P1Thread1of1ForFork1_#t~ite23_In-1811484376|)) (and (= |P1Thread1of1ForFork1_#t~ite23_Out-1811484376| ~y$w_buff1_used~0_In-1811484376) .cse1 .cse0 (or (and .cse2 .cse3) (and .cse4 .cse2) .cse5))) (= |P1Thread1of1ForFork1_#t~ite22_In-1811484376| |P1Thread1of1ForFork1_#t~ite22_Out-1811484376|)) (let ((.cse6 (not .cse2))) (and (not .cse5) (or .cse6 (not .cse4)) (= |P1Thread1of1ForFork1_#t~ite23_Out-1811484376| |P1Thread1of1ForFork1_#t~ite22_Out-1811484376|) (or .cse6 (not .cse3)) (= |P1Thread1of1ForFork1_#t~ite22_Out-1811484376| 0) .cse0 .cse1)))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-1811484376, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-1811484376, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-1811484376, P1Thread1of1ForFork1_#t~ite23=|P1Thread1of1ForFork1_#t~ite23_In-1811484376|, P1Thread1of1ForFork1_#t~ite22=|P1Thread1of1ForFork1_#t~ite22_In-1811484376|, ~weak$$choice2~0=~weak$$choice2~0_In-1811484376, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1811484376} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-1811484376, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-1811484376, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-1811484376, P1Thread1of1ForFork1_#t~ite23=|P1Thread1of1ForFork1_#t~ite23_Out-1811484376|, P1Thread1of1ForFork1_#t~ite24=|P1Thread1of1ForFork1_#t~ite24_Out-1811484376|, P1Thread1of1ForFork1_#t~ite22=|P1Thread1of1ForFork1_#t~ite22_Out-1811484376|, ~weak$$choice2~0=~weak$$choice2~0_In-1811484376, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1811484376} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite23, P1Thread1of1ForFork1_#t~ite24, P1Thread1of1ForFork1_#t~ite22] because there is no mapped edge [2019-12-07 11:10:06,351 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [769] [769] L768-8-->L770: Formula: (and (not (= 0 (mod v_~weak$$choice2~0_105 256))) (= v_~y$w_buff1_used~0_417 |v_P1Thread1of1ForFork1_#t~ite24_23|) (= v_~y$r_buff0_thd2~0_320 v_~y$r_buff0_thd2~0_319)) InVars {~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_320, P1Thread1of1ForFork1_#t~ite24=|v_P1Thread1of1ForFork1_#t~ite24_23|, ~weak$$choice2~0=v_~weak$$choice2~0_105} OutVars{~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_319, P1Thread1of1ForFork1_#t~ite23=|v_P1Thread1of1ForFork1_#t~ite23_20|, P1Thread1of1ForFork1_#t~ite24=|v_P1Thread1of1ForFork1_#t~ite24_22|, P1Thread1of1ForFork1_#t~ite22=|v_P1Thread1of1ForFork1_#t~ite22_18|, P1Thread1of1ForFork1_#t~ite27=|v_P1Thread1of1ForFork1_#t~ite27_33|, ~weak$$choice2~0=v_~weak$$choice2~0_105, P1Thread1of1ForFork1_#t~ite25=|v_P1Thread1of1ForFork1_#t~ite25_26|, P1Thread1of1ForFork1_#t~ite26=|v_P1Thread1of1ForFork1_#t~ite26_30|, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_417} AuxVars[] AssignedVars[~y$r_buff0_thd2~0, P1Thread1of1ForFork1_#t~ite23, P1Thread1of1ForFork1_#t~ite24, P1Thread1of1ForFork1_#t~ite22, P1Thread1of1ForFork1_#t~ite27, P1Thread1of1ForFork1_#t~ite25, P1Thread1of1ForFork1_#t~ite26, ~y$w_buff1_used~0] because there is no mapped edge [2019-12-07 11:10:06,352 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [762] [762] L770-->L770-8: Formula: (let ((.cse0 (= 0 (mod ~weak$$choice2~0_In1816745652 256)))) (or (and (= |P1Thread1of1ForFork1_#t~ite28_In1816745652| |P1Thread1of1ForFork1_#t~ite28_Out1816745652|) (= |P1Thread1of1ForFork1_#t~ite29_In1816745652| |P1Thread1of1ForFork1_#t~ite29_Out1816745652|) (not .cse0) (= ~y$r_buff1_thd2~0_In1816745652 |P1Thread1of1ForFork1_#t~ite30_Out1816745652|)) (let ((.cse1 (not (= 0 (mod ~y$r_buff0_thd2~0_In1816745652 256))))) (and .cse0 (or .cse1 (not (= 0 (mod ~y$w_buff1_used~0_In1816745652 256)))) (= |P1Thread1of1ForFork1_#t~ite30_Out1816745652| |P1Thread1of1ForFork1_#t~ite29_Out1816745652|) (not (= (mod ~y$w_buff0_used~0_In1816745652 256) 0)) (= |P1Thread1of1ForFork1_#t~ite28_Out1816745652| |P1Thread1of1ForFork1_#t~ite29_Out1816745652|) (= |P1Thread1of1ForFork1_#t~ite28_Out1816745652| 0) (or .cse1 (not (= (mod ~y$r_buff1_thd2~0_In1816745652 256) 0))))))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In1816745652, P1Thread1of1ForFork1_#t~ite29=|P1Thread1of1ForFork1_#t~ite29_In1816745652|, ~y$w_buff0_used~0=~y$w_buff0_used~0_In1816745652, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In1816745652, ~weak$$choice2~0=~weak$$choice2~0_In1816745652, P1Thread1of1ForFork1_#t~ite28=|P1Thread1of1ForFork1_#t~ite28_In1816745652|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1816745652} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In1816745652, P1Thread1of1ForFork1_#t~ite29=|P1Thread1of1ForFork1_#t~ite29_Out1816745652|, P1Thread1of1ForFork1_#t~ite30=|P1Thread1of1ForFork1_#t~ite30_Out1816745652|, ~y$w_buff0_used~0=~y$w_buff0_used~0_In1816745652, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In1816745652, ~weak$$choice2~0=~weak$$choice2~0_In1816745652, P1Thread1of1ForFork1_#t~ite28=|P1Thread1of1ForFork1_#t~ite28_Out1816745652|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1816745652} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite29, P1Thread1of1ForFork1_#t~ite30, P1Thread1of1ForFork1_#t~ite28] because there is no mapped edge [2019-12-07 11:10:06,352 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [696] [696] L772-->L776: Formula: (and (= v_~y~0_43 v_~y$mem_tmp~0_8) (not (= 0 (mod v_~y$flush_delayed~0_12 256))) (= 0 v_~y$flush_delayed~0_11)) InVars {~y$mem_tmp~0=v_~y$mem_tmp~0_8, ~y$flush_delayed~0=v_~y$flush_delayed~0_12} OutVars{~y$mem_tmp~0=v_~y$mem_tmp~0_8, P1Thread1of1ForFork1_#t~ite31=|v_P1Thread1of1ForFork1_#t~ite31_5|, ~y$flush_delayed~0=v_~y$flush_delayed~0_11, ~y~0=v_~y~0_43} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite31, ~y$flush_delayed~0, ~y~0] because there is no mapped edge [2019-12-07 11:10:06,352 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [709] [709] L776-2-->L776-5: Formula: (let ((.cse0 (= |P1Thread1of1ForFork1_#t~ite33_Out161885343| |P1Thread1of1ForFork1_#t~ite32_Out161885343|)) (.cse1 (= 0 (mod ~y$r_buff1_thd2~0_In161885343 256))) (.cse2 (= 0 (mod ~y$w_buff1_used~0_In161885343 256)))) (or (and .cse0 (or .cse1 .cse2) (= |P1Thread1of1ForFork1_#t~ite32_Out161885343| ~y~0_In161885343)) (and (= ~y$w_buff1~0_In161885343 |P1Thread1of1ForFork1_#t~ite32_Out161885343|) .cse0 (not .cse1) (not .cse2)))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In161885343, ~y$w_buff1~0=~y$w_buff1~0_In161885343, ~y~0=~y~0_In161885343, ~y$w_buff1_used~0=~y$w_buff1_used~0_In161885343} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In161885343, ~y$w_buff1~0=~y$w_buff1~0_In161885343, P1Thread1of1ForFork1_#t~ite32=|P1Thread1of1ForFork1_#t~ite32_Out161885343|, P1Thread1of1ForFork1_#t~ite33=|P1Thread1of1ForFork1_#t~ite33_Out161885343|, ~y~0=~y~0_In161885343, ~y$w_buff1_used~0=~y$w_buff1_used~0_In161885343} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite32, P1Thread1of1ForFork1_#t~ite33] because there is no mapped edge [2019-12-07 11:10:06,353 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [713] [713] L777-->L777-2: Formula: (let ((.cse0 (= (mod ~y$w_buff0_used~0_In-1551415730 256) 0)) (.cse1 (= 0 (mod ~y$r_buff0_thd2~0_In-1551415730 256)))) (or (and (= ~y$w_buff0_used~0_In-1551415730 |P1Thread1of1ForFork1_#t~ite34_Out-1551415730|) (or .cse0 .cse1)) (and (not .cse0) (not .cse1) (= |P1Thread1of1ForFork1_#t~ite34_Out-1551415730| 0)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-1551415730, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-1551415730} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-1551415730, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-1551415730, P1Thread1of1ForFork1_#t~ite34=|P1Thread1of1ForFork1_#t~ite34_Out-1551415730|} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite34] because there is no mapped edge [2019-12-07 11:10:06,353 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [715] [715] L778-->L778-2: Formula: (let ((.cse1 (= 0 (mod ~y$r_buff1_thd2~0_In-921525876 256))) (.cse0 (= 0 (mod ~y$w_buff1_used~0_In-921525876 256))) (.cse2 (= (mod ~y$w_buff0_used~0_In-921525876 256) 0)) (.cse3 (= 0 (mod ~y$r_buff0_thd2~0_In-921525876 256)))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= |P1Thread1of1ForFork1_#t~ite35_Out-921525876| 0)) (and (or .cse1 .cse0) (= ~y$w_buff1_used~0_In-921525876 |P1Thread1of1ForFork1_#t~ite35_Out-921525876|) (or .cse2 .cse3)))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-921525876, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-921525876, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-921525876, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-921525876} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-921525876, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-921525876, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-921525876, P1Thread1of1ForFork1_#t~ite35=|P1Thread1of1ForFork1_#t~ite35_Out-921525876|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-921525876} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite35] because there is no mapped edge [2019-12-07 11:10:06,353 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [705] [705] L779-->L779-2: Formula: (let ((.cse1 (= 0 (mod ~y$r_buff0_thd2~0_In-258498919 256))) (.cse0 (= 0 (mod ~y$w_buff0_used~0_In-258498919 256)))) (or (and (not .cse0) (not .cse1) (= |P1Thread1of1ForFork1_#t~ite36_Out-258498919| 0)) (and (= |P1Thread1of1ForFork1_#t~ite36_Out-258498919| ~y$r_buff0_thd2~0_In-258498919) (or .cse1 .cse0)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-258498919, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-258498919} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-258498919, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-258498919, P1Thread1of1ForFork1_#t~ite36=|P1Thread1of1ForFork1_#t~ite36_Out-258498919|} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite36] because there is no mapped edge [2019-12-07 11:10:06,354 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [702] [702] L780-->L780-2: Formula: (let ((.cse2 (= 0 (mod ~y$r_buff0_thd2~0_In-1055981914 256))) (.cse3 (= (mod ~y$w_buff0_used~0_In-1055981914 256) 0)) (.cse1 (= (mod ~y$w_buff1_used~0_In-1055981914 256) 0)) (.cse0 (= 0 (mod ~y$r_buff1_thd2~0_In-1055981914 256)))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= 0 |P1Thread1of1ForFork1_#t~ite37_Out-1055981914|)) (and (or .cse2 .cse3) (= ~y$r_buff1_thd2~0_In-1055981914 |P1Thread1of1ForFork1_#t~ite37_Out-1055981914|) (or .cse1 .cse0)))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-1055981914, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-1055981914, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-1055981914, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1055981914} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-1055981914, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-1055981914, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-1055981914, P1Thread1of1ForFork1_#t~ite37=|P1Thread1of1ForFork1_#t~ite37_Out-1055981914|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1055981914} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite37] because there is no mapped edge [2019-12-07 11:10:06,354 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [746] [746] L780-2-->P1EXIT: Formula: (and (= 0 |v_P1Thread1of1ForFork1_#res.base_3|) (= (+ v_~__unbuffered_cnt~0_49 1) v_~__unbuffered_cnt~0_48) (= |v_P1Thread1of1ForFork1_#res.offset_3| 0) (= v_~y$r_buff1_thd2~0_174 |v_P1Thread1of1ForFork1_#t~ite37_32|)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_49, P1Thread1of1ForFork1_#t~ite37=|v_P1Thread1of1ForFork1_#t~ite37_32|} OutVars{~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_174, P1Thread1of1ForFork1_#res.offset=|v_P1Thread1of1ForFork1_#res.offset_3|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_48, P1Thread1of1ForFork1_#res.base=|v_P1Thread1of1ForFork1_#res.base_3|, P1Thread1of1ForFork1_#t~ite37=|v_P1Thread1of1ForFork1_#t~ite37_31|} 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:10:06,354 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [685] [685] L801-1-->L807: Formula: (and (not (= 0 (mod v_~main$tmp_guard0~0_6 256))) (= v_~main$tmp_guard0~0_6 (ite (= (ite (= 2 v_~__unbuffered_cnt~0_18) 1 0) 0) 0 1))) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_18} OutVars{~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_18, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_6, ULTIMATE.start_main_#t~nondet39=|v_ULTIMATE.start_main_#t~nondet39_6|} AuxVars[] AssignedVars[~main$tmp_guard0~0, ULTIMATE.start_main_#t~nondet39] because there is no mapped edge [2019-12-07 11:10:06,354 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [720] [720] L807-2-->L807-4: Formula: (let ((.cse0 (= 0 (mod ~y$w_buff1_used~0_In2105048073 256))) (.cse1 (= (mod ~y$r_buff1_thd0~0_In2105048073 256) 0))) (or (and (= |ULTIMATE.start_main_#t~ite40_Out2105048073| ~y~0_In2105048073) (or .cse0 .cse1)) (and (= |ULTIMATE.start_main_#t~ite40_Out2105048073| ~y$w_buff1~0_In2105048073) (not .cse0) (not .cse1)))) InVars {~y$w_buff1~0=~y$w_buff1~0_In2105048073, ~y~0=~y~0_In2105048073, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In2105048073, ~y$w_buff1_used~0=~y$w_buff1_used~0_In2105048073} OutVars{ULTIMATE.start_main_#t~ite40=|ULTIMATE.start_main_#t~ite40_Out2105048073|, ~y$w_buff1~0=~y$w_buff1~0_In2105048073, ~y~0=~y~0_In2105048073, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In2105048073, ~y$w_buff1_used~0=~y$w_buff1_used~0_In2105048073} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite40] because there is no mapped edge [2019-12-07 11:10:06,354 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [682] [682] L807-4-->L808: Formula: (= v_~y~0_34 |v_ULTIMATE.start_main_#t~ite40_14|) InVars {ULTIMATE.start_main_#t~ite40=|v_ULTIMATE.start_main_#t~ite40_14|} OutVars{ULTIMATE.start_main_#t~ite41=|v_ULTIMATE.start_main_#t~ite41_13|, ULTIMATE.start_main_#t~ite40=|v_ULTIMATE.start_main_#t~ite40_13|, ~y~0=v_~y~0_34} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite41, ULTIMATE.start_main_#t~ite40, ~y~0] because there is no mapped edge [2019-12-07 11:10:06,354 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [716] [716] L808-->L808-2: Formula: (let ((.cse1 (= 0 (mod ~y$w_buff0_used~0_In-715104310 256))) (.cse0 (= 0 (mod ~y$r_buff0_thd0~0_In-715104310 256)))) (or (and (not .cse0) (= 0 |ULTIMATE.start_main_#t~ite42_Out-715104310|) (not .cse1)) (and (= ~y$w_buff0_used~0_In-715104310 |ULTIMATE.start_main_#t~ite42_Out-715104310|) (or .cse1 .cse0)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-715104310, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-715104310} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-715104310, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-715104310, ULTIMATE.start_main_#t~ite42=|ULTIMATE.start_main_#t~ite42_Out-715104310|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite42] because there is no mapped edge [2019-12-07 11:10:06,354 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [710] [710] L809-->L809-2: Formula: (let ((.cse2 (= (mod ~y$w_buff0_used~0_In1649864397 256) 0)) (.cse3 (= 0 (mod ~y$r_buff0_thd0~0_In1649864397 256))) (.cse1 (= (mod ~y$r_buff1_thd0~0_In1649864397 256) 0)) (.cse0 (= (mod ~y$w_buff1_used~0_In1649864397 256) 0))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= |ULTIMATE.start_main_#t~ite43_Out1649864397| 0)) (and (or .cse2 .cse3) (or .cse1 .cse0) (= |ULTIMATE.start_main_#t~ite43_Out1649864397| ~y$w_buff1_used~0_In1649864397)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In1649864397, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In1649864397, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In1649864397, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1649864397} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In1649864397, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In1649864397, ULTIMATE.start_main_#t~ite43=|ULTIMATE.start_main_#t~ite43_Out1649864397|, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In1649864397, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1649864397} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite43] because there is no mapped edge [2019-12-07 11:10:06,355 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [721] [721] L810-->L810-2: Formula: (let ((.cse1 (= 0 (mod ~y$r_buff0_thd0~0_In-629745605 256))) (.cse0 (= (mod ~y$w_buff0_used~0_In-629745605 256) 0))) (or (and (not .cse0) (= 0 |ULTIMATE.start_main_#t~ite44_Out-629745605|) (not .cse1)) (and (= ~y$r_buff0_thd0~0_In-629745605 |ULTIMATE.start_main_#t~ite44_Out-629745605|) (or .cse1 .cse0)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-629745605, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-629745605} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-629745605, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-629745605, ULTIMATE.start_main_#t~ite44=|ULTIMATE.start_main_#t~ite44_Out-629745605|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite44] because there is no mapped edge [2019-12-07 11:10:06,355 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [712] [712] L811-->L811-2: Formula: (let ((.cse1 (= 0 (mod ~y$w_buff0_used~0_In807054505 256))) (.cse0 (= 0 (mod ~y$r_buff0_thd0~0_In807054505 256))) (.cse3 (= (mod ~y$w_buff1_used~0_In807054505 256) 0)) (.cse2 (= (mod ~y$r_buff1_thd0~0_In807054505 256) 0))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= |ULTIMATE.start_main_#t~ite45_Out807054505| 0)) (and (or .cse1 .cse0) (or .cse3 .cse2) (= |ULTIMATE.start_main_#t~ite45_Out807054505| ~y$r_buff1_thd0~0_In807054505)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In807054505, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In807054505, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In807054505, ~y$w_buff1_used~0=~y$w_buff1_used~0_In807054505} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In807054505, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In807054505, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In807054505, ULTIMATE.start_main_#t~ite45=|ULTIMATE.start_main_#t~ite45_Out807054505|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In807054505} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite45] because there is no mapped edge [2019-12-07 11:10:06,355 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [765] [765] L811-2-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= |v_ULTIMATE.start___VERIFIER_assert_#in~expression_8| (mod v_~main$tmp_guard1~0_28 256)) (= v_ULTIMATE.start___VERIFIER_assert_~expression_16 |v_ULTIMATE.start___VERIFIER_assert_#in~expression_8|) (= v_ULTIMATE.start___VERIFIER_assert_~expression_16 0) (= v_~y$r_buff1_thd0~0_112 |v_ULTIMATE.start_main_#t~ite45_56|) (= (ite (= 0 (ite (not (and (= 1 v_~__unbuffered_p1_EAX~0_37) (= v_~__unbuffered_p1_EBX~0_29 0) (= 0 v_~__unbuffered_p0_EAX~0_76))) 1 0)) 0 1) v_~main$tmp_guard1~0_28)) InVars {~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_76, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_29, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_37, ULTIMATE.start_main_#t~ite45=|v_ULTIMATE.start_main_#t~ite45_56|} OutVars{~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_76, ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_16, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_29, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_37, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_28, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_112, ULTIMATE.start_main_#t~ite45=|v_ULTIMATE.start_main_#t~ite45_55|, 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:10:06,393 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 07.12 11:10:06 BasicIcfg [2019-12-07 11:10:06,394 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-07 11:10:06,394 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-12-07 11:10:06,394 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-12-07 11:10:06,394 INFO L275 PluginConnector]: Witness Printer initialized [2019-12-07 11:10:06,394 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 11:09:57" (3/4) ... [2019-12-07 11:10:06,396 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2019-12-07 11:10:06,397 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [775] [775] ULTIMATE.startENTRY-->L799: Formula: (let ((.cse0 (store |v_#valid_63| 0 0))) (and (< |v_#StackHeapBarrier_15| |v_ULTIMATE.start_main_~#t317~0.base_27|) (= 0 v_~y$r_buff0_thd2~0_418) (= (select .cse0 |v_ULTIMATE.start_main_~#t317~0.base_27|) 0) (= v_~main$tmp_guard0~0_19 0) (= 0 v_~__unbuffered_cnt~0_61) (= v_~y$r_buff0_thd0~0_150 0) (= v_~y$r_buff1_thd1~0_136 0) (= |v_#valid_61| (store .cse0 |v_ULTIMATE.start_main_~#t317~0.base_27| 1)) (= 0 v_~y$w_buff0~0_517) (= |v_#NULL.offset_6| 0) (= v_~y$read_delayed~0_7 0) (= 0 v_~y$r_buff1_thd2~0_265) (= v_~weak$$choice2~0_161 0) (= 0 v_~y$read_delayed_var~0.base_5) (= 0 v_~y$flush_delayed~0_39) (= v_~__unbuffered_p1_EBX~0_45 0) (= |v_ULTIMATE.start_main_~#t317~0.offset_19| 0) (< 0 |v_#StackHeapBarrier_15|) (= v_~y$r_buff0_thd1~0_219 0) (= 0 v_~y$read_delayed_var~0.offset_5) (= v_~y$w_buff1~0_303 0) (= |v_#length_17| (store |v_#length_18| |v_ULTIMATE.start_main_~#t317~0.base_27| 4)) (= 0 |v_#NULL.base_6|) (= v_~y$r_buff1_thd0~0_161 0) (= 0 v_~weak$$choice0~0_24) (= 0 v_~__unbuffered_p0_EAX~0_105) (= v_~main$tmp_guard1~0_47 0) (= v_~x~0_99 0) (= (store |v_#memory_int_12| |v_ULTIMATE.start_main_~#t317~0.base_27| (store (select |v_#memory_int_12| |v_ULTIMATE.start_main_~#t317~0.base_27|) |v_ULTIMATE.start_main_~#t317~0.offset_19| 0)) |v_#memory_int_11|) (= v_~y~0_150 0) (= v_~y$w_buff1_used~0_497 0) (= v_~y$w_buff0_used~0_750 0) (= v_~y$mem_tmp~0_25 0) (= 0 v_~__unbuffered_p1_EAX~0_50))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_15|, #valid=|v_#valid_63|, #memory_int=|v_#memory_int_12|, #length=|v_#length_18|} OutVars{~y$read_delayed_var~0.offset=v_~y$read_delayed_var~0.offset_5, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_750, #NULL.offset=|v_#NULL.offset_6|, ULTIMATE.start_main_~#t318~0.offset=|v_ULTIMATE.start_main_~#t318~0.offset_20|, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_47, ULTIMATE.start_main_#t~ite43=|v_ULTIMATE.start_main_#t~ite43_38|, ULTIMATE.start_main_#t~ite42=|v_ULTIMATE.start_main_#t~ite42_34|, ULTIMATE.start_main_#t~ite45=|v_ULTIMATE.start_main_#t~ite45_87|, ULTIMATE.start_main_#t~ite44=|v_ULTIMATE.start_main_#t~ite44_42|, ~y$read_delayed~0=v_~y$read_delayed~0_7, ~y$r_buff1_thd1~0=v_~y$r_buff1_thd1~0_136, ~y$mem_tmp~0=v_~y$mem_tmp~0_25, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_105, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_50, ~y$w_buff0~0=v_~y$w_buff0~0_517, ~y$r_buff0_thd1~0=v_~y$r_buff0_thd1~0_219, ~y$flush_delayed~0=v_~y$flush_delayed~0_39, #length=|v_#length_17|, ~y~0=v_~y~0_150, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_45, ULTIMATE.start_main_~#t318~0.base=|v_ULTIMATE.start_main_~#t318~0.base_28|, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_19, #NULL.base=|v_#NULL.base_6|, ~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_265, ~weak$$choice0~0=v_~weak$$choice0~0_24, #StackHeapBarrier=|v_#StackHeapBarrier_15|, ULTIMATE.start_main_#t~ite41=|v_ULTIMATE.start_main_#t~ite41_28|, ULTIMATE.start_main_#t~ite40=|v_ULTIMATE.start_main_#t~ite40_36|, ULTIMATE.start_main_~#t317~0.base=|v_ULTIMATE.start_main_~#t317~0.base_27|, ~y$w_buff1~0=v_~y$w_buff1~0_303, ~y$read_delayed_var~0.base=v_~y$read_delayed_var~0.base_5, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_30|, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_150, #valid=|v_#valid_61|, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_418, #memory_int=|v_#memory_int_11|, ULTIMATE.start_main_#t~nondet38=|v_ULTIMATE.start_main_#t~nondet38_9|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_61, ULTIMATE.start_main_~#t317~0.offset=|v_ULTIMATE.start_main_~#t317~0.offset_19|, ULTIMATE.start_main_#t~nondet39=|v_ULTIMATE.start_main_#t~nondet39_18|, ~weak$$choice2~0=v_~weak$$choice2~0_161, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_161, ~x~0=v_~x~0_99, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_497} AuxVars[] AssignedVars[~y$read_delayed_var~0.offset, ~y$w_buff0_used~0, #NULL.offset, ULTIMATE.start_main_~#t318~0.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_p0_EAX~0, ~__unbuffered_p1_EAX~0, ~y$w_buff0~0, ~y$r_buff0_thd1~0, ~y$flush_delayed~0, #length, ~y~0, ~__unbuffered_p1_EBX~0, ULTIMATE.start_main_~#t318~0.base, ~main$tmp_guard0~0, #NULL.base, ~y$r_buff1_thd2~0, ~weak$$choice0~0, ULTIMATE.start_main_#t~ite41, ULTIMATE.start_main_#t~ite40, ULTIMATE.start_main_~#t317~0.base, ~y$w_buff1~0, ~y$read_delayed_var~0.base, ULTIMATE.start_main_#res, ~y$r_buff0_thd0~0, #valid, ~y$r_buff0_thd2~0, #memory_int, ULTIMATE.start_main_#t~nondet38, ~__unbuffered_cnt~0, ULTIMATE.start_main_~#t317~0.offset, 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:10:06,397 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [724] [724] L799-1-->L801: Formula: (and (= (store |v_#memory_int_6| |v_ULTIMATE.start_main_~#t318~0.base_10| (store (select |v_#memory_int_6| |v_ULTIMATE.start_main_~#t318~0.base_10|) |v_ULTIMATE.start_main_~#t318~0.offset_9| 1)) |v_#memory_int_5|) (not (= 0 |v_ULTIMATE.start_main_~#t318~0.base_10|)) (= 0 (select |v_#valid_20| |v_ULTIMATE.start_main_~#t318~0.base_10|)) (= |v_ULTIMATE.start_main_~#t318~0.offset_9| 0) (= (store |v_#length_10| |v_ULTIMATE.start_main_~#t318~0.base_10| 4) |v_#length_9|) (= |v_#valid_19| (store |v_#valid_20| |v_ULTIMATE.start_main_~#t318~0.base_10| 1)) (< |v_#StackHeapBarrier_7| |v_ULTIMATE.start_main_~#t318~0.base_10|)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_7|, #valid=|v_#valid_20|, #memory_int=|v_#memory_int_6|, #length=|v_#length_10|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_7|, #valid=|v_#valid_19|, #memory_int=|v_#memory_int_5|, ULTIMATE.start_main_#t~nondet38=|v_ULTIMATE.start_main_#t~nondet38_5|, ULTIMATE.start_main_~#t318~0.base=|v_ULTIMATE.start_main_~#t318~0.base_10|, ULTIMATE.start_main_~#t318~0.offset=|v_ULTIMATE.start_main_~#t318~0.offset_9|, #length=|v_#length_9|} AuxVars[] AssignedVars[#valid, #memory_int, ULTIMATE.start_main_#t~nondet38, ULTIMATE.start_main_~#t318~0.base, ULTIMATE.start_main_~#t318~0.offset, #length] because there is no mapped edge [2019-12-07 11:10:06,397 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [749] [749] L4-->L740: Formula: (and (not (= 0 P0Thread1of1ForFork0___VERIFIER_assert_~expression_In-697821869)) (= 1 ~y$r_buff0_thd1~0_Out-697821869) (= ~y$r_buff1_thd1~0_Out-697821869 ~y$r_buff0_thd1~0_In-697821869) (= ~y$r_buff1_thd0~0_Out-697821869 ~y$r_buff0_thd0~0_In-697821869) (= ~y$r_buff1_thd2~0_Out-697821869 ~y$r_buff0_thd2~0_In-697821869) (= ~x~0_In-697821869 ~__unbuffered_p0_EAX~0_Out-697821869)) InVars {~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-697821869, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In-697821869, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-697821869, P0Thread1of1ForFork0___VERIFIER_assert_~expression=P0Thread1of1ForFork0___VERIFIER_assert_~expression_In-697821869, ~x~0=~x~0_In-697821869} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_Out-697821869, ~y$r_buff1_thd1~0=~y$r_buff1_thd1~0_Out-697821869, ~__unbuffered_p0_EAX~0=~__unbuffered_p0_EAX~0_Out-697821869, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-697821869, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_Out-697821869, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-697821869, P0Thread1of1ForFork0___VERIFIER_assert_~expression=P0Thread1of1ForFork0___VERIFIER_assert_~expression_In-697821869, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_Out-697821869, ~x~0=~x~0_In-697821869} AuxVars[] AssignedVars[~y$r_buff1_thd2~0, ~y$r_buff1_thd1~0, ~__unbuffered_p0_EAX~0, ~y$r_buff0_thd1~0, ~y$r_buff1_thd0~0] because there is no mapped edge [2019-12-07 11:10:06,398 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [706] [706] L741-->L741-2: Formula: (let ((.cse0 (= (mod ~y$r_buff0_thd1~0_In-1666599828 256) 0)) (.cse1 (= (mod ~y$w_buff0_used~0_In-1666599828 256) 0))) (or (and (= ~y$w_buff0_used~0_In-1666599828 |P0Thread1of1ForFork0_#t~ite5_Out-1666599828|) (or .cse0 .cse1)) (and (not .cse0) (= |P0Thread1of1ForFork0_#t~ite5_Out-1666599828| 0) (not .cse1)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-1666599828, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In-1666599828} OutVars{P0Thread1of1ForFork0_#t~ite5=|P0Thread1of1ForFork0_#t~ite5_Out-1666599828|, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-1666599828, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In-1666599828} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite5] because there is no mapped edge [2019-12-07 11:10:06,399 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [701] [701] L742-->L742-2: Formula: (let ((.cse1 (= (mod ~y$w_buff0_used~0_In845054676 256) 0)) (.cse0 (= (mod ~y$r_buff0_thd1~0_In845054676 256) 0)) (.cse2 (= (mod ~y$r_buff1_thd1~0_In845054676 256) 0)) (.cse3 (= 0 (mod ~y$w_buff1_used~0_In845054676 256)))) (or (and (or .cse0 .cse1) (or .cse2 .cse3) (= ~y$w_buff1_used~0_In845054676 |P0Thread1of1ForFork0_#t~ite6_Out845054676|)) (and (or (and (not .cse1) (not .cse0)) (and (not .cse2) (not .cse3))) (= 0 |P0Thread1of1ForFork0_#t~ite6_Out845054676|)))) InVars {~y$r_buff1_thd1~0=~y$r_buff1_thd1~0_In845054676, ~y$w_buff0_used~0=~y$w_buff0_used~0_In845054676, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In845054676, ~y$w_buff1_used~0=~y$w_buff1_used~0_In845054676} OutVars{P0Thread1of1ForFork0_#t~ite6=|P0Thread1of1ForFork0_#t~ite6_Out845054676|, ~y$r_buff1_thd1~0=~y$r_buff1_thd1~0_In845054676, ~y$w_buff0_used~0=~y$w_buff0_used~0_In845054676, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In845054676, ~y$w_buff1_used~0=~y$w_buff1_used~0_In845054676} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite6] because there is no mapped edge [2019-12-07 11:10:06,399 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [703] [703] L743-->L744: Formula: (let ((.cse0 (= 0 (mod ~y$r_buff0_thd1~0_In-2120394537 256))) (.cse1 (= ~y$r_buff0_thd1~0_Out-2120394537 ~y$r_buff0_thd1~0_In-2120394537)) (.cse2 (= (mod ~y$w_buff0_used~0_In-2120394537 256) 0))) (or (and .cse0 .cse1) (and (not .cse2) (not .cse0) (= ~y$r_buff0_thd1~0_Out-2120394537 0)) (and .cse1 .cse2))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-2120394537, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In-2120394537} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-2120394537, P0Thread1of1ForFork0_#t~ite7=|P0Thread1of1ForFork0_#t~ite7_Out-2120394537|, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_Out-2120394537} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite7, ~y$r_buff0_thd1~0] because there is no mapped edge [2019-12-07 11:10:06,399 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [714] [714] L744-->L744-2: Formula: (let ((.cse3 (= 0 (mod ~y$r_buff0_thd1~0_In-746861885 256))) (.cse2 (= (mod ~y$w_buff0_used~0_In-746861885 256) 0)) (.cse0 (= 0 (mod ~y$r_buff1_thd1~0_In-746861885 256))) (.cse1 (= 0 (mod ~y$w_buff1_used~0_In-746861885 256)))) (or (and (= 0 |P0Thread1of1ForFork0_#t~ite8_Out-746861885|) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (= ~y$r_buff1_thd1~0_In-746861885 |P0Thread1of1ForFork0_#t~ite8_Out-746861885|) (or .cse3 .cse2) (or .cse0 .cse1)))) InVars {~y$r_buff1_thd1~0=~y$r_buff1_thd1~0_In-746861885, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-746861885, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In-746861885, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-746861885} OutVars{~y$r_buff1_thd1~0=~y$r_buff1_thd1~0_In-746861885, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-746861885, P0Thread1of1ForFork0_#t~ite8=|P0Thread1of1ForFork0_#t~ite8_Out-746861885|, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In-746861885, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-746861885} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite8] because there is no mapped edge [2019-12-07 11:10:06,399 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [727] [727] L744-2-->P0EXIT: Formula: (and (= v_~y$r_buff1_thd1~0_51 |v_P0Thread1of1ForFork0_#t~ite8_26|) (= |v_P0Thread1of1ForFork0_#res.offset_3| 0) (= 0 |v_P0Thread1of1ForFork0_#res.base_3|) (= v_~__unbuffered_cnt~0_33 (+ v_~__unbuffered_cnt~0_34 1))) InVars {P0Thread1of1ForFork0_#t~ite8=|v_P0Thread1of1ForFork0_#t~ite8_26|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_34} OutVars{~y$r_buff1_thd1~0=v_~y$r_buff1_thd1~0_51, P0Thread1of1ForFork0_#res.offset=|v_P0Thread1of1ForFork0_#res.offset_3|, P0Thread1of1ForFork0_#t~ite8=|v_P0Thread1of1ForFork0_#t~ite8_25|, P0Thread1of1ForFork0_#res.base=|v_P0Thread1of1ForFork0_#res.base_3|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_33} 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:10:06,400 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [750] [750] L766-->L766-8: Formula: (let ((.cse0 (= 0 (mod ~weak$$choice2~0_In654265737 256)))) (or (and (= |P1Thread1of1ForFork1_#t~ite17_In654265737| |P1Thread1of1ForFork1_#t~ite17_Out654265737|) (not .cse0) (= |P1Thread1of1ForFork1_#t~ite18_Out654265737| ~y$w_buff1~0_In654265737)) (and (= ~y$w_buff1~0_In654265737 |P1Thread1of1ForFork1_#t~ite17_Out654265737|) (= |P1Thread1of1ForFork1_#t~ite18_Out654265737| |P1Thread1of1ForFork1_#t~ite17_Out654265737|) .cse0 (let ((.cse1 (= (mod ~y$r_buff0_thd2~0_In654265737 256) 0))) (or (= 0 (mod ~y$w_buff0_used~0_In654265737 256)) (and .cse1 (= (mod ~y$w_buff1_used~0_In654265737 256) 0)) (and .cse1 (= (mod ~y$r_buff1_thd2~0_In654265737 256) 0))))))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In654265737, ~y$w_buff1~0=~y$w_buff1~0_In654265737, ~y$w_buff0_used~0=~y$w_buff0_used~0_In654265737, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In654265737, ~weak$$choice2~0=~weak$$choice2~0_In654265737, P1Thread1of1ForFork1_#t~ite17=|P1Thread1of1ForFork1_#t~ite17_In654265737|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In654265737} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In654265737, P1Thread1of1ForFork1_#t~ite18=|P1Thread1of1ForFork1_#t~ite18_Out654265737|, ~y$w_buff1~0=~y$w_buff1~0_In654265737, ~y$w_buff0_used~0=~y$w_buff0_used~0_In654265737, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In654265737, ~weak$$choice2~0=~weak$$choice2~0_In654265737, P1Thread1of1ForFork1_#t~ite17=|P1Thread1of1ForFork1_#t~ite17_Out654265737|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In654265737} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite18, P1Thread1of1ForFork1_#t~ite17] because there is no mapped edge [2019-12-07 11:10:06,400 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [751] [751] L767-->L767-8: Formula: (let ((.cse0 (= (mod ~weak$$choice2~0_In-20780897 256) 0))) (or (and (not .cse0) (= |P1Thread1of1ForFork1_#t~ite21_Out-20780897| ~y$w_buff0_used~0_In-20780897) (= |P1Thread1of1ForFork1_#t~ite20_In-20780897| |P1Thread1of1ForFork1_#t~ite20_Out-20780897|)) (and (= |P1Thread1of1ForFork1_#t~ite21_Out-20780897| |P1Thread1of1ForFork1_#t~ite20_Out-20780897|) (let ((.cse1 (= (mod ~y$r_buff0_thd2~0_In-20780897 256) 0))) (or (and .cse1 (= 0 (mod ~y$w_buff1_used~0_In-20780897 256))) (= 0 (mod ~y$w_buff0_used~0_In-20780897 256)) (and .cse1 (= (mod ~y$r_buff1_thd2~0_In-20780897 256) 0)))) (= |P1Thread1of1ForFork1_#t~ite20_Out-20780897| ~y$w_buff0_used~0_In-20780897) .cse0))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-20780897, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-20780897, P1Thread1of1ForFork1_#t~ite20=|P1Thread1of1ForFork1_#t~ite20_In-20780897|, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-20780897, ~weak$$choice2~0=~weak$$choice2~0_In-20780897, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-20780897} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-20780897, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-20780897, P1Thread1of1ForFork1_#t~ite20=|P1Thread1of1ForFork1_#t~ite20_Out-20780897|, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-20780897, P1Thread1of1ForFork1_#t~ite21=|P1Thread1of1ForFork1_#t~ite21_Out-20780897|, ~weak$$choice2~0=~weak$$choice2~0_In-20780897, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-20780897} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite20, P1Thread1of1ForFork1_#t~ite21] because there is no mapped edge [2019-12-07 11:10:06,401 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [763] [763] L768-->L768-8: Formula: (let ((.cse5 (= 0 (mod ~y$w_buff0_used~0_In-1811484376 256))) (.cse4 (= (mod ~y$r_buff1_thd2~0_In-1811484376 256) 0)) (.cse3 (= (mod ~y$w_buff1_used~0_In-1811484376 256) 0)) (.cse0 (= 0 (mod ~weak$$choice2~0_In-1811484376 256))) (.cse1 (= |P1Thread1of1ForFork1_#t~ite24_Out-1811484376| |P1Thread1of1ForFork1_#t~ite23_Out-1811484376|)) (.cse2 (= (mod ~y$r_buff0_thd2~0_In-1811484376 256) 0))) (or (and (or (and (= |P1Thread1of1ForFork1_#t~ite24_Out-1811484376| ~y$w_buff1_used~0_In-1811484376) (not .cse0) (= |P1Thread1of1ForFork1_#t~ite23_Out-1811484376| |P1Thread1of1ForFork1_#t~ite23_In-1811484376|)) (and (= |P1Thread1of1ForFork1_#t~ite23_Out-1811484376| ~y$w_buff1_used~0_In-1811484376) .cse1 .cse0 (or (and .cse2 .cse3) (and .cse4 .cse2) .cse5))) (= |P1Thread1of1ForFork1_#t~ite22_In-1811484376| |P1Thread1of1ForFork1_#t~ite22_Out-1811484376|)) (let ((.cse6 (not .cse2))) (and (not .cse5) (or .cse6 (not .cse4)) (= |P1Thread1of1ForFork1_#t~ite23_Out-1811484376| |P1Thread1of1ForFork1_#t~ite22_Out-1811484376|) (or .cse6 (not .cse3)) (= |P1Thread1of1ForFork1_#t~ite22_Out-1811484376| 0) .cse0 .cse1)))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-1811484376, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-1811484376, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-1811484376, P1Thread1of1ForFork1_#t~ite23=|P1Thread1of1ForFork1_#t~ite23_In-1811484376|, P1Thread1of1ForFork1_#t~ite22=|P1Thread1of1ForFork1_#t~ite22_In-1811484376|, ~weak$$choice2~0=~weak$$choice2~0_In-1811484376, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1811484376} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-1811484376, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-1811484376, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-1811484376, P1Thread1of1ForFork1_#t~ite23=|P1Thread1of1ForFork1_#t~ite23_Out-1811484376|, P1Thread1of1ForFork1_#t~ite24=|P1Thread1of1ForFork1_#t~ite24_Out-1811484376|, P1Thread1of1ForFork1_#t~ite22=|P1Thread1of1ForFork1_#t~ite22_Out-1811484376|, ~weak$$choice2~0=~weak$$choice2~0_In-1811484376, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1811484376} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite23, P1Thread1of1ForFork1_#t~ite24, P1Thread1of1ForFork1_#t~ite22] because there is no mapped edge [2019-12-07 11:10:06,401 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [769] [769] L768-8-->L770: Formula: (and (not (= 0 (mod v_~weak$$choice2~0_105 256))) (= v_~y$w_buff1_used~0_417 |v_P1Thread1of1ForFork1_#t~ite24_23|) (= v_~y$r_buff0_thd2~0_320 v_~y$r_buff0_thd2~0_319)) InVars {~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_320, P1Thread1of1ForFork1_#t~ite24=|v_P1Thread1of1ForFork1_#t~ite24_23|, ~weak$$choice2~0=v_~weak$$choice2~0_105} OutVars{~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_319, P1Thread1of1ForFork1_#t~ite23=|v_P1Thread1of1ForFork1_#t~ite23_20|, P1Thread1of1ForFork1_#t~ite24=|v_P1Thread1of1ForFork1_#t~ite24_22|, P1Thread1of1ForFork1_#t~ite22=|v_P1Thread1of1ForFork1_#t~ite22_18|, P1Thread1of1ForFork1_#t~ite27=|v_P1Thread1of1ForFork1_#t~ite27_33|, ~weak$$choice2~0=v_~weak$$choice2~0_105, P1Thread1of1ForFork1_#t~ite25=|v_P1Thread1of1ForFork1_#t~ite25_26|, P1Thread1of1ForFork1_#t~ite26=|v_P1Thread1of1ForFork1_#t~ite26_30|, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_417} AuxVars[] AssignedVars[~y$r_buff0_thd2~0, P1Thread1of1ForFork1_#t~ite23, P1Thread1of1ForFork1_#t~ite24, P1Thread1of1ForFork1_#t~ite22, P1Thread1of1ForFork1_#t~ite27, P1Thread1of1ForFork1_#t~ite25, P1Thread1of1ForFork1_#t~ite26, ~y$w_buff1_used~0] because there is no mapped edge [2019-12-07 11:10:06,401 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [762] [762] L770-->L770-8: Formula: (let ((.cse0 (= 0 (mod ~weak$$choice2~0_In1816745652 256)))) (or (and (= |P1Thread1of1ForFork1_#t~ite28_In1816745652| |P1Thread1of1ForFork1_#t~ite28_Out1816745652|) (= |P1Thread1of1ForFork1_#t~ite29_In1816745652| |P1Thread1of1ForFork1_#t~ite29_Out1816745652|) (not .cse0) (= ~y$r_buff1_thd2~0_In1816745652 |P1Thread1of1ForFork1_#t~ite30_Out1816745652|)) (let ((.cse1 (not (= 0 (mod ~y$r_buff0_thd2~0_In1816745652 256))))) (and .cse0 (or .cse1 (not (= 0 (mod ~y$w_buff1_used~0_In1816745652 256)))) (= |P1Thread1of1ForFork1_#t~ite30_Out1816745652| |P1Thread1of1ForFork1_#t~ite29_Out1816745652|) (not (= (mod ~y$w_buff0_used~0_In1816745652 256) 0)) (= |P1Thread1of1ForFork1_#t~ite28_Out1816745652| |P1Thread1of1ForFork1_#t~ite29_Out1816745652|) (= |P1Thread1of1ForFork1_#t~ite28_Out1816745652| 0) (or .cse1 (not (= (mod ~y$r_buff1_thd2~0_In1816745652 256) 0))))))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In1816745652, P1Thread1of1ForFork1_#t~ite29=|P1Thread1of1ForFork1_#t~ite29_In1816745652|, ~y$w_buff0_used~0=~y$w_buff0_used~0_In1816745652, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In1816745652, ~weak$$choice2~0=~weak$$choice2~0_In1816745652, P1Thread1of1ForFork1_#t~ite28=|P1Thread1of1ForFork1_#t~ite28_In1816745652|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1816745652} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In1816745652, P1Thread1of1ForFork1_#t~ite29=|P1Thread1of1ForFork1_#t~ite29_Out1816745652|, P1Thread1of1ForFork1_#t~ite30=|P1Thread1of1ForFork1_#t~ite30_Out1816745652|, ~y$w_buff0_used~0=~y$w_buff0_used~0_In1816745652, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In1816745652, ~weak$$choice2~0=~weak$$choice2~0_In1816745652, P1Thread1of1ForFork1_#t~ite28=|P1Thread1of1ForFork1_#t~ite28_Out1816745652|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1816745652} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite29, P1Thread1of1ForFork1_#t~ite30, P1Thread1of1ForFork1_#t~ite28] because there is no mapped edge [2019-12-07 11:10:06,401 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [696] [696] L772-->L776: Formula: (and (= v_~y~0_43 v_~y$mem_tmp~0_8) (not (= 0 (mod v_~y$flush_delayed~0_12 256))) (= 0 v_~y$flush_delayed~0_11)) InVars {~y$mem_tmp~0=v_~y$mem_tmp~0_8, ~y$flush_delayed~0=v_~y$flush_delayed~0_12} OutVars{~y$mem_tmp~0=v_~y$mem_tmp~0_8, P1Thread1of1ForFork1_#t~ite31=|v_P1Thread1of1ForFork1_#t~ite31_5|, ~y$flush_delayed~0=v_~y$flush_delayed~0_11, ~y~0=v_~y~0_43} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite31, ~y$flush_delayed~0, ~y~0] because there is no mapped edge [2019-12-07 11:10:06,401 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [709] [709] L776-2-->L776-5: Formula: (let ((.cse0 (= |P1Thread1of1ForFork1_#t~ite33_Out161885343| |P1Thread1of1ForFork1_#t~ite32_Out161885343|)) (.cse1 (= 0 (mod ~y$r_buff1_thd2~0_In161885343 256))) (.cse2 (= 0 (mod ~y$w_buff1_used~0_In161885343 256)))) (or (and .cse0 (or .cse1 .cse2) (= |P1Thread1of1ForFork1_#t~ite32_Out161885343| ~y~0_In161885343)) (and (= ~y$w_buff1~0_In161885343 |P1Thread1of1ForFork1_#t~ite32_Out161885343|) .cse0 (not .cse1) (not .cse2)))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In161885343, ~y$w_buff1~0=~y$w_buff1~0_In161885343, ~y~0=~y~0_In161885343, ~y$w_buff1_used~0=~y$w_buff1_used~0_In161885343} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In161885343, ~y$w_buff1~0=~y$w_buff1~0_In161885343, P1Thread1of1ForFork1_#t~ite32=|P1Thread1of1ForFork1_#t~ite32_Out161885343|, P1Thread1of1ForFork1_#t~ite33=|P1Thread1of1ForFork1_#t~ite33_Out161885343|, ~y~0=~y~0_In161885343, ~y$w_buff1_used~0=~y$w_buff1_used~0_In161885343} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite32, P1Thread1of1ForFork1_#t~ite33] because there is no mapped edge [2019-12-07 11:10:06,402 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [713] [713] L777-->L777-2: Formula: (let ((.cse0 (= (mod ~y$w_buff0_used~0_In-1551415730 256) 0)) (.cse1 (= 0 (mod ~y$r_buff0_thd2~0_In-1551415730 256)))) (or (and (= ~y$w_buff0_used~0_In-1551415730 |P1Thread1of1ForFork1_#t~ite34_Out-1551415730|) (or .cse0 .cse1)) (and (not .cse0) (not .cse1) (= |P1Thread1of1ForFork1_#t~ite34_Out-1551415730| 0)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-1551415730, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-1551415730} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-1551415730, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-1551415730, P1Thread1of1ForFork1_#t~ite34=|P1Thread1of1ForFork1_#t~ite34_Out-1551415730|} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite34] because there is no mapped edge [2019-12-07 11:10:06,402 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [715] [715] L778-->L778-2: Formula: (let ((.cse1 (= 0 (mod ~y$r_buff1_thd2~0_In-921525876 256))) (.cse0 (= 0 (mod ~y$w_buff1_used~0_In-921525876 256))) (.cse2 (= (mod ~y$w_buff0_used~0_In-921525876 256) 0)) (.cse3 (= 0 (mod ~y$r_buff0_thd2~0_In-921525876 256)))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= |P1Thread1of1ForFork1_#t~ite35_Out-921525876| 0)) (and (or .cse1 .cse0) (= ~y$w_buff1_used~0_In-921525876 |P1Thread1of1ForFork1_#t~ite35_Out-921525876|) (or .cse2 .cse3)))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-921525876, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-921525876, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-921525876, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-921525876} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-921525876, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-921525876, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-921525876, P1Thread1of1ForFork1_#t~ite35=|P1Thread1of1ForFork1_#t~ite35_Out-921525876|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-921525876} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite35] because there is no mapped edge [2019-12-07 11:10:06,402 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [705] [705] L779-->L779-2: Formula: (let ((.cse1 (= 0 (mod ~y$r_buff0_thd2~0_In-258498919 256))) (.cse0 (= 0 (mod ~y$w_buff0_used~0_In-258498919 256)))) (or (and (not .cse0) (not .cse1) (= |P1Thread1of1ForFork1_#t~ite36_Out-258498919| 0)) (and (= |P1Thread1of1ForFork1_#t~ite36_Out-258498919| ~y$r_buff0_thd2~0_In-258498919) (or .cse1 .cse0)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-258498919, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-258498919} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-258498919, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-258498919, P1Thread1of1ForFork1_#t~ite36=|P1Thread1of1ForFork1_#t~ite36_Out-258498919|} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite36] because there is no mapped edge [2019-12-07 11:10:06,403 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [702] [702] L780-->L780-2: Formula: (let ((.cse2 (= 0 (mod ~y$r_buff0_thd2~0_In-1055981914 256))) (.cse3 (= (mod ~y$w_buff0_used~0_In-1055981914 256) 0)) (.cse1 (= (mod ~y$w_buff1_used~0_In-1055981914 256) 0)) (.cse0 (= 0 (mod ~y$r_buff1_thd2~0_In-1055981914 256)))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= 0 |P1Thread1of1ForFork1_#t~ite37_Out-1055981914|)) (and (or .cse2 .cse3) (= ~y$r_buff1_thd2~0_In-1055981914 |P1Thread1of1ForFork1_#t~ite37_Out-1055981914|) (or .cse1 .cse0)))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-1055981914, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-1055981914, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-1055981914, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1055981914} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-1055981914, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-1055981914, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-1055981914, P1Thread1of1ForFork1_#t~ite37=|P1Thread1of1ForFork1_#t~ite37_Out-1055981914|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1055981914} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite37] because there is no mapped edge [2019-12-07 11:10:06,403 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [746] [746] L780-2-->P1EXIT: Formula: (and (= 0 |v_P1Thread1of1ForFork1_#res.base_3|) (= (+ v_~__unbuffered_cnt~0_49 1) v_~__unbuffered_cnt~0_48) (= |v_P1Thread1of1ForFork1_#res.offset_3| 0) (= v_~y$r_buff1_thd2~0_174 |v_P1Thread1of1ForFork1_#t~ite37_32|)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_49, P1Thread1of1ForFork1_#t~ite37=|v_P1Thread1of1ForFork1_#t~ite37_32|} OutVars{~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_174, P1Thread1of1ForFork1_#res.offset=|v_P1Thread1of1ForFork1_#res.offset_3|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_48, P1Thread1of1ForFork1_#res.base=|v_P1Thread1of1ForFork1_#res.base_3|, P1Thread1of1ForFork1_#t~ite37=|v_P1Thread1of1ForFork1_#t~ite37_31|} 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:10:06,403 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [685] [685] L801-1-->L807: Formula: (and (not (= 0 (mod v_~main$tmp_guard0~0_6 256))) (= v_~main$tmp_guard0~0_6 (ite (= (ite (= 2 v_~__unbuffered_cnt~0_18) 1 0) 0) 0 1))) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_18} OutVars{~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_18, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_6, ULTIMATE.start_main_#t~nondet39=|v_ULTIMATE.start_main_#t~nondet39_6|} AuxVars[] AssignedVars[~main$tmp_guard0~0, ULTIMATE.start_main_#t~nondet39] because there is no mapped edge [2019-12-07 11:10:06,403 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [720] [720] L807-2-->L807-4: Formula: (let ((.cse0 (= 0 (mod ~y$w_buff1_used~0_In2105048073 256))) (.cse1 (= (mod ~y$r_buff1_thd0~0_In2105048073 256) 0))) (or (and (= |ULTIMATE.start_main_#t~ite40_Out2105048073| ~y~0_In2105048073) (or .cse0 .cse1)) (and (= |ULTIMATE.start_main_#t~ite40_Out2105048073| ~y$w_buff1~0_In2105048073) (not .cse0) (not .cse1)))) InVars {~y$w_buff1~0=~y$w_buff1~0_In2105048073, ~y~0=~y~0_In2105048073, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In2105048073, ~y$w_buff1_used~0=~y$w_buff1_used~0_In2105048073} OutVars{ULTIMATE.start_main_#t~ite40=|ULTIMATE.start_main_#t~ite40_Out2105048073|, ~y$w_buff1~0=~y$w_buff1~0_In2105048073, ~y~0=~y~0_In2105048073, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In2105048073, ~y$w_buff1_used~0=~y$w_buff1_used~0_In2105048073} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite40] because there is no mapped edge [2019-12-07 11:10:06,403 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [682] [682] L807-4-->L808: Formula: (= v_~y~0_34 |v_ULTIMATE.start_main_#t~ite40_14|) InVars {ULTIMATE.start_main_#t~ite40=|v_ULTIMATE.start_main_#t~ite40_14|} OutVars{ULTIMATE.start_main_#t~ite41=|v_ULTIMATE.start_main_#t~ite41_13|, ULTIMATE.start_main_#t~ite40=|v_ULTIMATE.start_main_#t~ite40_13|, ~y~0=v_~y~0_34} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite41, ULTIMATE.start_main_#t~ite40, ~y~0] because there is no mapped edge [2019-12-07 11:10:06,403 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [716] [716] L808-->L808-2: Formula: (let ((.cse1 (= 0 (mod ~y$w_buff0_used~0_In-715104310 256))) (.cse0 (= 0 (mod ~y$r_buff0_thd0~0_In-715104310 256)))) (or (and (not .cse0) (= 0 |ULTIMATE.start_main_#t~ite42_Out-715104310|) (not .cse1)) (and (= ~y$w_buff0_used~0_In-715104310 |ULTIMATE.start_main_#t~ite42_Out-715104310|) (or .cse1 .cse0)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-715104310, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-715104310} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-715104310, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-715104310, ULTIMATE.start_main_#t~ite42=|ULTIMATE.start_main_#t~ite42_Out-715104310|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite42] because there is no mapped edge [2019-12-07 11:10:06,403 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [710] [710] L809-->L809-2: Formula: (let ((.cse2 (= (mod ~y$w_buff0_used~0_In1649864397 256) 0)) (.cse3 (= 0 (mod ~y$r_buff0_thd0~0_In1649864397 256))) (.cse1 (= (mod ~y$r_buff1_thd0~0_In1649864397 256) 0)) (.cse0 (= (mod ~y$w_buff1_used~0_In1649864397 256) 0))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= |ULTIMATE.start_main_#t~ite43_Out1649864397| 0)) (and (or .cse2 .cse3) (or .cse1 .cse0) (= |ULTIMATE.start_main_#t~ite43_Out1649864397| ~y$w_buff1_used~0_In1649864397)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In1649864397, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In1649864397, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In1649864397, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1649864397} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In1649864397, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In1649864397, ULTIMATE.start_main_#t~ite43=|ULTIMATE.start_main_#t~ite43_Out1649864397|, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In1649864397, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1649864397} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite43] because there is no mapped edge [2019-12-07 11:10:06,404 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [721] [721] L810-->L810-2: Formula: (let ((.cse1 (= 0 (mod ~y$r_buff0_thd0~0_In-629745605 256))) (.cse0 (= (mod ~y$w_buff0_used~0_In-629745605 256) 0))) (or (and (not .cse0) (= 0 |ULTIMATE.start_main_#t~ite44_Out-629745605|) (not .cse1)) (and (= ~y$r_buff0_thd0~0_In-629745605 |ULTIMATE.start_main_#t~ite44_Out-629745605|) (or .cse1 .cse0)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-629745605, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-629745605} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-629745605, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-629745605, ULTIMATE.start_main_#t~ite44=|ULTIMATE.start_main_#t~ite44_Out-629745605|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite44] because there is no mapped edge [2019-12-07 11:10:06,404 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [712] [712] L811-->L811-2: Formula: (let ((.cse1 (= 0 (mod ~y$w_buff0_used~0_In807054505 256))) (.cse0 (= 0 (mod ~y$r_buff0_thd0~0_In807054505 256))) (.cse3 (= (mod ~y$w_buff1_used~0_In807054505 256) 0)) (.cse2 (= (mod ~y$r_buff1_thd0~0_In807054505 256) 0))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= |ULTIMATE.start_main_#t~ite45_Out807054505| 0)) (and (or .cse1 .cse0) (or .cse3 .cse2) (= |ULTIMATE.start_main_#t~ite45_Out807054505| ~y$r_buff1_thd0~0_In807054505)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In807054505, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In807054505, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In807054505, ~y$w_buff1_used~0=~y$w_buff1_used~0_In807054505} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In807054505, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In807054505, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In807054505, ULTIMATE.start_main_#t~ite45=|ULTIMATE.start_main_#t~ite45_Out807054505|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In807054505} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite45] because there is no mapped edge [2019-12-07 11:10:06,404 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [765] [765] L811-2-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= |v_ULTIMATE.start___VERIFIER_assert_#in~expression_8| (mod v_~main$tmp_guard1~0_28 256)) (= v_ULTIMATE.start___VERIFIER_assert_~expression_16 |v_ULTIMATE.start___VERIFIER_assert_#in~expression_8|) (= v_ULTIMATE.start___VERIFIER_assert_~expression_16 0) (= v_~y$r_buff1_thd0~0_112 |v_ULTIMATE.start_main_#t~ite45_56|) (= (ite (= 0 (ite (not (and (= 1 v_~__unbuffered_p1_EAX~0_37) (= v_~__unbuffered_p1_EBX~0_29 0) (= 0 v_~__unbuffered_p0_EAX~0_76))) 1 0)) 0 1) v_~main$tmp_guard1~0_28)) InVars {~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_76, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_29, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_37, ULTIMATE.start_main_#t~ite45=|v_ULTIMATE.start_main_#t~ite45_56|} OutVars{~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_76, ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_16, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_29, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_37, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_28, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_112, ULTIMATE.start_main_#t~ite45=|v_ULTIMATE.start_main_#t~ite45_55|, 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:10:06,451 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/run_dir_0df3a77f-33f6-407c-b0ee-db2aaf6b1a92/bin/uautomizer/witness.graphml [2019-12-07 11:10:06,451 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-12-07 11:10:06,452 INFO L168 Benchmark]: Toolchain (without parser) took 9353.69 ms. Allocated memory was 1.0 GB in the beginning and 1.5 GB in the end (delta: 425.2 MB). Free memory was 938.2 MB in the beginning and 936.1 MB in the end (delta: 2.1 MB). Peak memory consumption was 427.3 MB. Max. memory is 11.5 GB. [2019-12-07 11:10:06,453 INFO L168 Benchmark]: CDTParser took 0.20 ms. Allocated memory is still 1.0 GB. Free memory is still 958.7 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-12-07 11:10:06,453 INFO L168 Benchmark]: CACSL2BoogieTranslator took 401.61 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 114.8 MB). Free memory was 938.2 MB in the beginning and 1.1 GB in the end (delta: -145.8 MB). Peak memory consumption was 18.4 MB. Max. memory is 11.5 GB. [2019-12-07 11:10:06,453 INFO L168 Benchmark]: Boogie Procedure Inliner took 35.13 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. [2019-12-07 11:10:06,453 INFO L168 Benchmark]: Boogie Preprocessor took 23.97 ms. Allocated memory is still 1.1 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-12-07 11:10:06,454 INFO L168 Benchmark]: RCFGBuilder took 386.07 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 48.8 MB). Peak memory consumption was 48.8 MB. Max. memory is 11.5 GB. [2019-12-07 11:10:06,454 INFO L168 Benchmark]: TraceAbstraction took 8445.96 ms. Allocated memory was 1.1 GB in the beginning and 1.5 GB in the end (delta: 310.4 MB). Free memory was 1.0 GB in the beginning and 962.0 MB in the end (delta: 68.0 MB). Peak memory consumption was 378.3 MB. Max. memory is 11.5 GB. [2019-12-07 11:10:06,454 INFO L168 Benchmark]: Witness Printer took 57.59 ms. Allocated memory is still 1.5 GB. Free memory was 962.0 MB in the beginning and 936.1 MB in the end (delta: 25.9 MB). Peak memory consumption was 25.9 MB. Max. memory is 11.5 GB. [2019-12-07 11:10:06,456 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.20 ms. Allocated memory is still 1.0 GB. Free memory is still 958.7 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 401.61 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 114.8 MB). Free memory was 938.2 MB in the beginning and 1.1 GB in the end (delta: -145.8 MB). Peak memory consumption was 18.4 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 35.13 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 23.97 ms. Allocated memory is still 1.1 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 386.07 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 48.8 MB). Peak memory consumption was 48.8 MB. Max. memory is 11.5 GB. * TraceAbstraction took 8445.96 ms. Allocated memory was 1.1 GB in the beginning and 1.5 GB in the end (delta: 310.4 MB). Free memory was 1.0 GB in the beginning and 962.0 MB in the end (delta: 68.0 MB). Peak memory consumption was 378.3 MB. Max. memory is 11.5 GB. * Witness Printer took 57.59 ms. Allocated memory is still 1.5 GB. Free memory was 962.0 MB in the beginning and 936.1 MB in the end (delta: 25.9 MB). Peak memory consumption was 25.9 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks LbeTime: 3.1s, 148 ProgramPointsBefore, 75 ProgramPointsAfterwards, 182 TransitionsBefore, 84 TransitionsAfterwards, 12056 CoEnabledTransitionPairs, 12 FixpointIterations, 30 TrivialSequentialCompositions, 48 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 31 ConcurrentYvCompositions, 28 ChoiceCompositions, 4966 VarBasedMoverChecksPositive, 278 VarBasedMoverChecksNegative, 167 SemBasedMoverChecksPositive, 218 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 1.0s, 0 MoverChecksTotal, 77720 CheckedPairsTotal, 109 TotalNumberOfCompositions - CounterExampleResult [Line: 4]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L799] FCALL, FORK 0 pthread_create(&t317, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, 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] [L726] 1 y$w_buff1 = y$w_buff0 [L727] 1 y$w_buff0 = 1 [L728] 1 y$w_buff1_used = y$w_buff0_used [L729] 1 y$w_buff0_used = (_Bool)1 [L801] FCALL, FORK 0 pthread_create(&t318, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L740] 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_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=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] [L754] 2 x = 1 [L757] 2 __unbuffered_p1_EAX = x [L760] 2 weak$$choice0 = __VERIFIER_nondet_bool() [L761] 2 weak$$choice2 = __VERIFIER_nondet_bool() [L762] 2 y$flush_delayed = weak$$choice2 [L763] 2 y$mem_tmp = y VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=6, weak$$choice2=1, x=1, 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] [L764] 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_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=6, weak$$choice2=1, x=1, 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] [L740] 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) [L741] 1 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$w_buff0_used [L742] 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 [L764] 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) [L765] EXPR 2 weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff0)) VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=6, weak$$choice2=1, 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))=1, x=1, 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] [L765] 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)) [L766] 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)) [L767] 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)) [L770] 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)) [L771] 2 __unbuffered_p1_EBX = y VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=6, weak$$choice2=1, x=1, 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] [L776] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=6, weak$$choice2=1, 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=0, y$w_buff1=0, y$w_buff1_used=0] [L776] 2 y = y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) [L777] 2 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used [L778] 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 [L779] 2 y$r_buff0_thd2 = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2 [L807] 0 y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=6, weak$$choice2=1, 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=0, y$w_buff1=0, y$w_buff1_used=0] [L808] 0 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L809] 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 [L810] 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, 142 locations, 2 error locations. Result: UNSAFE, OverallTime: 8.3s, OverallIterations: 14, TraceHistogramMax: 1, AutomataDifference: 2.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 1676 SDtfs, 1517 SDslu, 3493 SDs, 0 SdLazy, 2773 SolverSat, 83 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 1.8s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 106 GetRequests, 25 SyntacticMatches, 11 SemanticMatches, 70 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 119 ImplicationChecksByTransitivity, 0.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=12203occurred 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: 0.9s AutomataMinimizationTime, 13 MinimizatonAttempts, 6936 StatesRemovedByMinimization, 11 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.5s InterpolantComputationTime, 479 NumberOfCodeBlocks, 479 NumberOfCodeBlocksAsserted, 14 NumberOfCheckSat, 414 ConstructedInterpolants, 0 QuantifiedInterpolants, 65502 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 13 InterpolantComputations, 13 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...