./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/pthread-wmm/mix003_tso.opt.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version f470102c Calling Ultimate with: /usr/lib/jvm/java-8-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/run_dir_14244678-f1b6-458f-9803-0f7cda029d95/bin/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/run_dir_14244678-f1b6-458f-9803-0f7cda029d95/bin/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_14244678-f1b6-458f-9803-0f7cda029d95/bin/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_14244678-f1b6-458f-9803-0f7cda029d95/bin/uautomizer/config/AutomizerReach.xml -i ../../sv-benchmarks/c/pthread-wmm/mix003_tso.opt.i -s /tmp/vcloud-vcloud-master/worker/run_dir_14244678-f1b6-458f-9803-0f7cda029d95/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_14244678-f1b6-458f-9803-0f7cda029d95/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 9850a9a94d8e560b4dbc04db1ee9465998ac7faa .............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................. 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 18:20:31,929 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-07 18:20:31,930 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-07 18:20:31,937 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-07 18:20:31,938 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-07 18:20:31,938 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-07 18:20:31,939 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-07 18:20:31,941 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-07 18:20:31,942 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-07 18:20:31,942 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-07 18:20:31,943 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-07 18:20:31,944 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-07 18:20:31,944 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-07 18:20:31,945 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-07 18:20:31,945 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-07 18:20:31,946 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-07 18:20:31,947 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-07 18:20:31,947 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-07 18:20:31,949 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-07 18:20:31,950 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-07 18:20:31,951 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-07 18:20:31,952 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-07 18:20:31,953 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-07 18:20:31,953 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-07 18:20:31,955 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-07 18:20:31,955 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-07 18:20:31,955 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-07 18:20:31,956 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-07 18:20:31,956 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-07 18:20:31,956 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-07 18:20:31,957 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-07 18:20:31,957 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-07 18:20:31,957 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-07 18:20:31,958 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-07 18:20:31,959 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-07 18:20:31,959 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-07 18:20:31,959 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-07 18:20:31,959 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-07 18:20:31,959 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-07 18:20:31,960 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-07 18:20:31,960 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-07 18:20:31,961 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_14244678-f1b6-458f-9803-0f7cda029d95/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf [2019-12-07 18:20:31,970 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-07 18:20:31,970 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-07 18:20:31,971 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-07 18:20:31,971 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-07 18:20:31,971 INFO L138 SettingsManager]: * Use SBE=true [2019-12-07 18:20:31,972 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-07 18:20:31,972 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-07 18:20:31,972 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-07 18:20:31,972 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-07 18:20:31,972 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-07 18:20:31,972 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-07 18:20:31,972 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-07 18:20:31,972 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-07 18:20:31,973 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-07 18:20:31,973 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-07 18:20:31,973 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-07 18:20:31,973 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-07 18:20:31,973 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-07 18:20:31,973 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-12-07 18:20:31,973 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-07 18:20:31,973 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-07 18:20:31,974 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-07 18:20:31,974 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-07 18:20:31,974 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-07 18:20:31,974 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-07 18:20:31,974 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-12-07 18:20:31,974 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-07 18:20:31,974 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-07 18:20:31,974 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2019-12-07 18:20:31,975 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_14244678-f1b6-458f-9803-0f7cda029d95/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 -> 9850a9a94d8e560b4dbc04db1ee9465998ac7faa [2019-12-07 18:20:32,072 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-07 18:20:32,082 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-07 18:20:32,084 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-07 18:20:32,086 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-07 18:20:32,086 INFO L275 PluginConnector]: CDTParser initialized [2019-12-07 18:20:32,087 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_14244678-f1b6-458f-9803-0f7cda029d95/bin/uautomizer/../../sv-benchmarks/c/pthread-wmm/mix003_tso.opt.i [2019-12-07 18:20:32,133 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_14244678-f1b6-458f-9803-0f7cda029d95/bin/uautomizer/data/7a875a99f/4066c4804ffa49c6a2771aff02cd7c1a/FLAGb17cc2957 [2019-12-07 18:20:32,599 INFO L306 CDTParser]: Found 1 translation units. [2019-12-07 18:20:32,600 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_14244678-f1b6-458f-9803-0f7cda029d95/sv-benchmarks/c/pthread-wmm/mix003_tso.opt.i [2019-12-07 18:20:32,611 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_14244678-f1b6-458f-9803-0f7cda029d95/bin/uautomizer/data/7a875a99f/4066c4804ffa49c6a2771aff02cd7c1a/FLAGb17cc2957 [2019-12-07 18:20:33,108 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_14244678-f1b6-458f-9803-0f7cda029d95/bin/uautomizer/data/7a875a99f/4066c4804ffa49c6a2771aff02cd7c1a [2019-12-07 18:20:33,110 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-07 18:20:33,111 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-12-07 18:20:33,112 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-07 18:20:33,112 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-07 18:20:33,115 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-07 18:20:33,115 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.12 06:20:33" (1/1) ... [2019-12-07 18:20:33,117 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7b6fc423 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 06:20:33, skipping insertion in model container [2019-12-07 18:20:33,118 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.12 06:20:33" (1/1) ... [2019-12-07 18:20:33,123 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-07 18:20:33,154 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-07 18:20:33,409 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-07 18:20:33,417 INFO L203 MainTranslator]: Completed pre-run [2019-12-07 18:20:33,463 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-07 18:20:33,511 INFO L208 MainTranslator]: Completed translation [2019-12-07 18:20:33,511 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 06:20:33 WrapperNode [2019-12-07 18:20:33,511 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-07 18:20:33,512 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-07 18:20:33,512 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-07 18:20:33,512 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-07 18:20:33,518 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 06:20:33" (1/1) ... [2019-12-07 18:20:33,532 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 06:20:33" (1/1) ... [2019-12-07 18:20:33,554 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-07 18:20:33,554 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-07 18:20:33,554 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-07 18:20:33,554 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-07 18:20:33,561 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 06:20:33" (1/1) ... [2019-12-07 18:20:33,561 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 06:20:33" (1/1) ... [2019-12-07 18:20:33,565 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 06:20:33" (1/1) ... [2019-12-07 18:20:33,565 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 06:20:33" (1/1) ... [2019-12-07 18:20:33,573 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 06:20:33" (1/1) ... [2019-12-07 18:20:33,576 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 06:20:33" (1/1) ... [2019-12-07 18:20:33,579 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 06:20:33" (1/1) ... [2019-12-07 18:20:33,582 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-07 18:20:33,583 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-07 18:20:33,583 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-07 18:20:33,583 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-07 18:20:33,584 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 06:20:33" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_14244678-f1b6-458f-9803-0f7cda029d95/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 18:20:33,624 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-12-07 18:20:33,625 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2019-12-07 18:20:33,625 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-12-07 18:20:33,625 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-12-07 18:20:33,625 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2019-12-07 18:20:33,625 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2019-12-07 18:20:33,625 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2019-12-07 18:20:33,625 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2019-12-07 18:20:33,625 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2019-12-07 18:20:33,625 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2019-12-07 18:20:33,625 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2019-12-07 18:20:33,626 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-07 18:20:33,626 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-07 18:20:33,627 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 18:20:34,000 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-07 18:20:34,000 INFO L287 CfgBuilder]: Removed 8 assume(true) statements. [2019-12-07 18:20:34,001 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 06:20:34 BoogieIcfgContainer [2019-12-07 18:20:34,001 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-07 18:20:34,002 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-07 18:20:34,002 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-07 18:20:34,004 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-07 18:20:34,004 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.12 06:20:33" (1/3) ... [2019-12-07 18:20:34,004 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@217543cc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.12 06:20:34, skipping insertion in model container [2019-12-07 18:20:34,004 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 06:20:33" (2/3) ... [2019-12-07 18:20:34,005 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@217543cc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.12 06:20:34, skipping insertion in model container [2019-12-07 18:20:34,005 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 06:20:34" (3/3) ... [2019-12-07 18:20:34,006 INFO L109 eAbstractionObserver]: Analyzing ICFG mix003_tso.opt.i [2019-12-07 18:20:34,012 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-12-07 18:20:34,012 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-07 18:20:34,017 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2019-12-07 18:20:34,017 INFO L339 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2019-12-07 18:20:34,046 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:20:34,046 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:20:34,046 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:20:34,046 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:20:34,047 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:20:34,047 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:20:34,048 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:20:34,048 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:20:34,048 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:20:34,048 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:20:34,048 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:20:34,048 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:20:34,048 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:20:34,048 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:20:34,048 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:20:34,048 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:20:34,049 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:20:34,049 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:20:34,049 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:20:34,049 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:20:34,049 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:20:34,049 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:20:34,049 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:20:34,049 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:20:34,049 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:20:34,050 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:20:34,050 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:20:34,050 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:20:34,050 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:20:34,050 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:20:34,050 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:20:34,050 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:20:34,050 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:20:34,051 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:20:34,051 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:20:34,051 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:20:34,051 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:20:34,051 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:20:34,051 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:20:34,051 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:20:34,051 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:20:34,051 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:20:34,051 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:20:34,052 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:20:34,052 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:20:34,052 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:20:34,052 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:20:34,052 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:20:34,052 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:20:34,052 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:20:34,052 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:20:34,052 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:20:34,053 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:20:34,053 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:20:34,053 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:20:34,053 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:20:34,053 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:20:34,053 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:20:34,053 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:20:34,053 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:20:34,053 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:20:34,054 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:20:34,054 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:20:34,054 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:20:34,054 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:20:34,054 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:20:34,054 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:20:34,054 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:20:34,054 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:20:34,054 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:20:34,055 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:20:34,055 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:20:34,055 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:20:34,055 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:20:34,055 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:20:34,055 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:20:34,055 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:20:34,055 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:20:34,055 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:20:34,055 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:20:34,056 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:20:34,056 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:20:34,056 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:20:34,056 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:20:34,056 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:20:34,056 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:20:34,056 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:20:34,056 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:20:34,056 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:20:34,056 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:20:34,057 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:20:34,057 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:20:34,057 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:20:34,057 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:20:34,057 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:20:34,057 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:20:34,057 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:20:34,057 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:20:34,057 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:20:34,058 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:20:34,058 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:20:34,059 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:20:34,059 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:20:34,059 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:20:34,059 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:20:34,059 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:20:34,059 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:20:34,059 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:20:34,059 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:20:34,059 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:20:34,059 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:20:34,060 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:20:34,060 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:20:34,060 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:20:34,060 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:20:34,060 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:20:34,060 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:20:34,060 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:20:34,060 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:20:34,060 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:20:34,061 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:20:34,061 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:20:34,061 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:20:34,061 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:20:34,061 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:20:34,061 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:20:34,061 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:20:34,061 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:20:34,062 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:20:34,062 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:20:34,062 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:20:34,062 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:20:34,062 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:20:34,062 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:20:34,062 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:20:34,062 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:20:34,063 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:20:34,063 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:20:34,063 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:20:34,063 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:20:34,063 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:20:34,063 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:20:34,063 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:20:34,063 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:20:34,063 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:20:34,063 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:20:34,063 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:20:34,064 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:20:34,064 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:20:34,064 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:20:34,064 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:20:34,064 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:20:34,064 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:20:34,064 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:20:34,064 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:20:34,064 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:20:34,064 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:20:34,065 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:20:34,065 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:20:34,065 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:20:34,065 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:20:34,065 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:20:34,065 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:20:34,065 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:20:34,065 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:20:34,065 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:20:34,065 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:20:34,066 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:20:34,066 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:20:34,066 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:20:34,066 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:20:34,066 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:20:34,066 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:20:34,066 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:20:34,066 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:20:34,066 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:20:34,066 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:20:34,066 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:20:34,067 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:20:34,067 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:20:34,067 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:20:34,067 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:20:34,067 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:20:34,067 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:20:34,067 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:20:34,067 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:20:34,067 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:20:34,067 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:20:34,068 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:20:34,068 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:20:34,068 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:20:34,068 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:20:34,068 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:20:34,068 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:20:34,068 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:20:34,068 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:20:34,068 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:20:34,068 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:20:34,069 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:20:34,069 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:20:34,069 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:20:34,069 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:20:34,069 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:20:34,069 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:20:34,069 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:20:34,069 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:20:34,069 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:20:34,069 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:20:34,069 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite52| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:20:34,070 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite52| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:20:34,070 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite52| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:20:34,070 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite52| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:20:34,070 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite53| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:20:34,070 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite53| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:20:34,070 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite53| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:20:34,070 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite53| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:20:34,070 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:20:34,070 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:20:34,071 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:20:34,071 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:20:34,071 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:20:34,071 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:20:34,083 INFO L249 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2019-12-07 18:20:34,097 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-07 18:20:34,097 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-07 18:20:34,097 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-07 18:20:34,097 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-12-07 18:20:34,097 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-07 18:20:34,097 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-07 18:20:34,097 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-07 18:20:34,097 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-07 18:20:34,109 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 196 places, 242 transitions [2019-12-07 18:20:34,110 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 196 places, 242 transitions [2019-12-07 18:20:34,183 INFO L134 PetriNetUnfolder]: 56/239 cut-off events. [2019-12-07 18:20:34,183 INFO L135 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-07 18:20:34,197 INFO L76 FinitePrefix]: Finished finitePrefix Result has 249 conditions, 239 events. 56/239 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 13. Compared 934 event pairs. 9/190 useless extension candidates. Maximal degree in co-relation 206. Up to 2 conditions per place. [2019-12-07 18:20:34,220 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 196 places, 242 transitions [2019-12-07 18:20:34,254 INFO L134 PetriNetUnfolder]: 56/239 cut-off events. [2019-12-07 18:20:34,254 INFO L135 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-07 18:20:34,262 INFO L76 FinitePrefix]: Finished finitePrefix Result has 249 conditions, 239 events. 56/239 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 13. Compared 934 event pairs. 9/190 useless extension candidates. Maximal degree in co-relation 206. Up to 2 conditions per place. [2019-12-07 18:20:34,286 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 24630 [2019-12-07 18:20:34,287 INFO L170 etLargeBlockEncoding]: Semantic Check. [2019-12-07 18:20:37,765 WARN L192 SmtUtils]: Spent 154.00 ms on a formula simplification. DAG size of input: 95 DAG size of output: 93 [2019-12-07 18:20:37,935 INFO L206 etLargeBlockEncoding]: Checked pairs total: 123368 [2019-12-07 18:20:37,935 INFO L214 etLargeBlockEncoding]: Total number of compositions: 129 [2019-12-07 18:20:37,938 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 105 places, 127 transitions [2019-12-07 18:20:40,465 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 42030 states. [2019-12-07 18:20:40,467 INFO L276 IsEmpty]: Start isEmpty. Operand 42030 states. [2019-12-07 18:20:40,471 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-12-07 18:20:40,471 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 18:20:40,472 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2019-12-07 18:20:40,472 INFO L410 AbstractCegarLoop]: === Iteration 1 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 18:20:40,476 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 18:20:40,476 INFO L82 PathProgramCache]: Analyzing trace with hash -668359293, now seen corresponding path program 1 times [2019-12-07 18:20:40,481 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 18:20:40,481 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [544758197] [2019-12-07 18:20:40,481 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 18:20:40,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:20:40,625 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 18:20:40,625 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [544758197] [2019-12-07 18:20:40,625 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 18:20:40,626 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-07 18:20:40,626 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [913208198] [2019-12-07 18:20:40,629 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 18:20:40,629 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 18:20:40,638 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 18:20:40,638 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 18:20:40,639 INFO L87 Difference]: Start difference. First operand 42030 states. Second operand 3 states. [2019-12-07 18:20:41,083 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 18:20:41,083 INFO L93 Difference]: Finished difference Result 41734 states and 171976 transitions. [2019-12-07 18:20:41,084 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 18:20:41,085 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 7 [2019-12-07 18:20:41,085 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 18:20:41,323 INFO L225 Difference]: With dead ends: 41734 [2019-12-07 18:20:41,323 INFO L226 Difference]: Without dead ends: 38878 [2019-12-07 18:20:41,324 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 18:20:41,859 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38878 states. [2019-12-07 18:20:42,524 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38878 to 38878. [2019-12-07 18:20:42,525 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38878 states. [2019-12-07 18:20:42,698 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38878 states to 38878 states and 160088 transitions. [2019-12-07 18:20:42,699 INFO L78 Accepts]: Start accepts. Automaton has 38878 states and 160088 transitions. Word has length 7 [2019-12-07 18:20:42,700 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 18:20:42,700 INFO L462 AbstractCegarLoop]: Abstraction has 38878 states and 160088 transitions. [2019-12-07 18:20:42,700 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 18:20:42,700 INFO L276 IsEmpty]: Start isEmpty. Operand 38878 states and 160088 transitions. [2019-12-07 18:20:42,703 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-12-07 18:20:42,703 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 18:20:42,704 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 18:20:42,704 INFO L410 AbstractCegarLoop]: === Iteration 2 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 18:20:42,704 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 18:20:42,704 INFO L82 PathProgramCache]: Analyzing trace with hash 298788116, now seen corresponding path program 1 times [2019-12-07 18:20:42,704 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 18:20:42,704 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [318041861] [2019-12-07 18:20:42,704 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 18:20:42,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:20:42,752 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 18:20:42,752 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [318041861] [2019-12-07 18:20:42,752 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 18:20:42,752 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 18:20:42,752 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [707622300] [2019-12-07 18:20:42,753 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 18:20:42,753 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 18:20:42,754 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 18:20:42,754 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 18:20:42,754 INFO L87 Difference]: Start difference. First operand 38878 states and 160088 transitions. Second operand 3 states. [2019-12-07 18:20:42,875 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 18:20:42,875 INFO L93 Difference]: Finished difference Result 21899 states and 79018 transitions. [2019-12-07 18:20:42,876 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 18:20:42,876 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 13 [2019-12-07 18:20:42,876 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 18:20:43,004 INFO L225 Difference]: With dead ends: 21899 [2019-12-07 18:20:43,004 INFO L226 Difference]: Without dead ends: 21899 [2019-12-07 18:20:43,004 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 18:20:43,282 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21899 states. [2019-12-07 18:20:43,602 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21899 to 21899. [2019-12-07 18:20:43,603 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21899 states. [2019-12-07 18:20:43,641 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21899 states to 21899 states and 79018 transitions. [2019-12-07 18:20:43,641 INFO L78 Accepts]: Start accepts. Automaton has 21899 states and 79018 transitions. Word has length 13 [2019-12-07 18:20:43,641 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 18:20:43,641 INFO L462 AbstractCegarLoop]: Abstraction has 21899 states and 79018 transitions. [2019-12-07 18:20:43,641 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 18:20:43,641 INFO L276 IsEmpty]: Start isEmpty. Operand 21899 states and 79018 transitions. [2019-12-07 18:20:43,643 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-12-07 18:20:43,643 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 18:20:43,643 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 18:20:43,643 INFO L410 AbstractCegarLoop]: === Iteration 3 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 18:20:43,643 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 18:20:43,643 INFO L82 PathProgramCache]: Analyzing trace with hash 521500695, now seen corresponding path program 1 times [2019-12-07 18:20:43,643 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 18:20:43,644 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [584691298] [2019-12-07 18:20:43,644 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 18:20:43,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:20:43,698 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 18:20:43,698 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [584691298] [2019-12-07 18:20:43,698 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 18:20:43,698 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 18:20:43,698 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1295457433] [2019-12-07 18:20:43,699 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 18:20:43,699 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 18:20:43,699 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 18:20:43,699 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 18:20:43,699 INFO L87 Difference]: Start difference. First operand 21899 states and 79018 transitions. Second operand 4 states. [2019-12-07 18:20:43,965 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 18:20:43,966 INFO L93 Difference]: Finished difference Result 33427 states and 115552 transitions. [2019-12-07 18:20:43,966 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-07 18:20:43,966 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 14 [2019-12-07 18:20:43,966 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 18:20:44,020 INFO L225 Difference]: With dead ends: 33427 [2019-12-07 18:20:44,020 INFO L226 Difference]: Without dead ends: 33411 [2019-12-07 18:20:44,020 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-07 18:20:44,349 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33411 states. [2019-12-07 18:20:44,822 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33411 to 32588. [2019-12-07 18:20:44,822 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32588 states. [2019-12-07 18:20:44,881 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32588 states to 32588 states and 113374 transitions. [2019-12-07 18:20:44,881 INFO L78 Accepts]: Start accepts. Automaton has 32588 states and 113374 transitions. Word has length 14 [2019-12-07 18:20:44,881 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 18:20:44,881 INFO L462 AbstractCegarLoop]: Abstraction has 32588 states and 113374 transitions. [2019-12-07 18:20:44,881 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 18:20:44,881 INFO L276 IsEmpty]: Start isEmpty. Operand 32588 states and 113374 transitions. [2019-12-07 18:20:44,883 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-12-07 18:20:44,883 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 18:20:44,883 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 18:20:44,883 INFO L410 AbstractCegarLoop]: === Iteration 4 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 18:20:44,883 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 18:20:44,883 INFO L82 PathProgramCache]: Analyzing trace with hash -46103865, now seen corresponding path program 1 times [2019-12-07 18:20:44,884 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 18:20:44,884 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [379996500] [2019-12-07 18:20:44,884 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 18:20:44,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:20:44,923 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 18:20:44,923 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [379996500] [2019-12-07 18:20:44,923 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 18:20:44,923 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 18:20:44,923 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1375251676] [2019-12-07 18:20:44,924 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 18:20:44,924 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 18:20:44,924 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 18:20:44,924 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 18:20:44,924 INFO L87 Difference]: Start difference. First operand 32588 states and 113374 transitions. Second operand 4 states. [2019-12-07 18:20:45,198 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 18:20:45,199 INFO L93 Difference]: Finished difference Result 41783 states and 142906 transitions. [2019-12-07 18:20:45,199 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-07 18:20:45,199 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 16 [2019-12-07 18:20:45,199 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 18:20:45,267 INFO L225 Difference]: With dead ends: 41783 [2019-12-07 18:20:45,267 INFO L226 Difference]: Without dead ends: 41769 [2019-12-07 18:20:45,267 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 18:20:45,628 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41769 states. [2019-12-07 18:20:46,099 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41769 to 37544. [2019-12-07 18:20:46,100 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37544 states. [2019-12-07 18:20:46,163 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37544 states to 37544 states and 129789 transitions. [2019-12-07 18:20:46,163 INFO L78 Accepts]: Start accepts. Automaton has 37544 states and 129789 transitions. Word has length 16 [2019-12-07 18:20:46,163 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 18:20:46,163 INFO L462 AbstractCegarLoop]: Abstraction has 37544 states and 129789 transitions. [2019-12-07 18:20:46,163 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 18:20:46,163 INFO L276 IsEmpty]: Start isEmpty. Operand 37544 states and 129789 transitions. [2019-12-07 18:20:46,167 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-12-07 18:20:46,167 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 18:20:46,167 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 18:20:46,167 INFO L410 AbstractCegarLoop]: === Iteration 5 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 18:20:46,167 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 18:20:46,167 INFO L82 PathProgramCache]: Analyzing trace with hash 353080702, now seen corresponding path program 1 times [2019-12-07 18:20:46,167 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 18:20:46,168 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2105047100] [2019-12-07 18:20:46,168 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 18:20:46,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:20:46,226 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 18:20:46,227 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2105047100] [2019-12-07 18:20:46,227 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 18:20:46,227 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 18:20:46,227 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [669911896] [2019-12-07 18:20:46,227 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 18:20:46,227 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 18:20:46,227 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 18:20:46,228 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-07 18:20:46,228 INFO L87 Difference]: Start difference. First operand 37544 states and 129789 transitions. Second operand 4 states. [2019-12-07 18:20:46,348 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 18:20:46,348 INFO L93 Difference]: Finished difference Result 37502 states and 129587 transitions. [2019-12-07 18:20:46,349 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 18:20:46,349 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 19 [2019-12-07 18:20:46,349 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 18:20:46,409 INFO L225 Difference]: With dead ends: 37502 [2019-12-07 18:20:46,409 INFO L226 Difference]: Without dead ends: 37502 [2019-12-07 18:20:46,410 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-07 18:20:46,755 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37502 states. [2019-12-07 18:20:47,129 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37502 to 37458. [2019-12-07 18:20:47,129 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37458 states. [2019-12-07 18:20:47,197 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37458 states to 37458 states and 129514 transitions. [2019-12-07 18:20:47,198 INFO L78 Accepts]: Start accepts. Automaton has 37458 states and 129514 transitions. Word has length 19 [2019-12-07 18:20:47,198 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 18:20:47,198 INFO L462 AbstractCegarLoop]: Abstraction has 37458 states and 129514 transitions. [2019-12-07 18:20:47,198 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 18:20:47,198 INFO L276 IsEmpty]: Start isEmpty. Operand 37458 states and 129514 transitions. [2019-12-07 18:20:47,204 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-12-07 18:20:47,205 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 18:20:47,205 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] [2019-12-07 18:20:47,205 INFO L410 AbstractCegarLoop]: === Iteration 6 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 18:20:47,205 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 18:20:47,205 INFO L82 PathProgramCache]: Analyzing trace with hash -149145903, now seen corresponding path program 1 times [2019-12-07 18:20:47,205 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 18:20:47,206 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1703550804] [2019-12-07 18:20:47,206 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 18:20:47,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:20:47,246 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 18:20:47,246 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1703550804] [2019-12-07 18:20:47,246 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 18:20:47,246 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-07 18:20:47,247 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [432287002] [2019-12-07 18:20:47,247 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 18:20:47,247 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 18:20:47,247 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 18:20:47,247 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 18:20:47,248 INFO L87 Difference]: Start difference. First operand 37458 states and 129514 transitions. Second operand 3 states. [2019-12-07 18:20:47,368 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 18:20:47,368 INFO L93 Difference]: Finished difference Result 35424 states and 122277 transitions. [2019-12-07 18:20:47,368 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 18:20:47,368 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 20 [2019-12-07 18:20:47,369 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 18:20:47,505 INFO L225 Difference]: With dead ends: 35424 [2019-12-07 18:20:47,505 INFO L226 Difference]: Without dead ends: 35424 [2019-12-07 18:20:47,506 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 18:20:47,843 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35424 states. [2019-12-07 18:20:48,181 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35424 to 35424. [2019-12-07 18:20:48,181 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35424 states. [2019-12-07 18:20:48,243 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35424 states to 35424 states and 122277 transitions. [2019-12-07 18:20:48,243 INFO L78 Accepts]: Start accepts. Automaton has 35424 states and 122277 transitions. Word has length 20 [2019-12-07 18:20:48,243 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 18:20:48,244 INFO L462 AbstractCegarLoop]: Abstraction has 35424 states and 122277 transitions. [2019-12-07 18:20:48,244 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 18:20:48,244 INFO L276 IsEmpty]: Start isEmpty. Operand 35424 states and 122277 transitions. [2019-12-07 18:20:48,252 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2019-12-07 18:20:48,252 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 18:20:48,252 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] [2019-12-07 18:20:48,252 INFO L410 AbstractCegarLoop]: === Iteration 7 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 18:20:48,253 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 18:20:48,253 INFO L82 PathProgramCache]: Analyzing trace with hash -1967693899, now seen corresponding path program 1 times [2019-12-07 18:20:48,253 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 18:20:48,253 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1852743978] [2019-12-07 18:20:48,253 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 18:20:48,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:20:48,295 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 18:20:48,296 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1852743978] [2019-12-07 18:20:48,296 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 18:20:48,296 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 18:20:48,296 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [747523055] [2019-12-07 18:20:48,296 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-07 18:20:48,297 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 18:20:48,297 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-07 18:20:48,297 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-07 18:20:48,297 INFO L87 Difference]: Start difference. First operand 35424 states and 122277 transitions. Second operand 5 states. [2019-12-07 18:20:48,758 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 18:20:48,758 INFO L93 Difference]: Finished difference Result 42312 states and 143653 transitions. [2019-12-07 18:20:48,758 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-12-07 18:20:48,758 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 23 [2019-12-07 18:20:48,758 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 18:20:48,825 INFO L225 Difference]: With dead ends: 42312 [2019-12-07 18:20:48,825 INFO L226 Difference]: Without dead ends: 42285 [2019-12-07 18:20:48,825 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2019-12-07 18:20:49,186 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42285 states. [2019-12-07 18:20:49,616 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42285 to 35423. [2019-12-07 18:20:49,616 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35423 states. [2019-12-07 18:20:49,676 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35423 states to 35423 states and 122277 transitions. [2019-12-07 18:20:49,677 INFO L78 Accepts]: Start accepts. Automaton has 35423 states and 122277 transitions. Word has length 23 [2019-12-07 18:20:49,677 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 18:20:49,677 INFO L462 AbstractCegarLoop]: Abstraction has 35423 states and 122277 transitions. [2019-12-07 18:20:49,677 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-07 18:20:49,677 INFO L276 IsEmpty]: Start isEmpty. Operand 35423 states and 122277 transitions. [2019-12-07 18:20:49,705 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2019-12-07 18:20:49,705 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 18:20:49,706 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] [2019-12-07 18:20:49,706 INFO L410 AbstractCegarLoop]: === Iteration 8 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 18:20:49,706 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 18:20:49,706 INFO L82 PathProgramCache]: Analyzing trace with hash 1313151003, now seen corresponding path program 1 times [2019-12-07 18:20:49,706 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 18:20:49,706 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1520567805] [2019-12-07 18:20:49,706 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 18:20:49,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:20:49,745 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 18:20:49,745 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1520567805] [2019-12-07 18:20:49,745 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 18:20:49,745 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 18:20:49,745 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2137164826] [2019-12-07 18:20:49,746 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 18:20:49,746 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 18:20:49,746 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 18:20:49,746 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-07 18:20:49,746 INFO L87 Difference]: Start difference. First operand 35423 states and 122277 transitions. Second operand 4 states. [2019-12-07 18:20:50,049 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 18:20:50,049 INFO L93 Difference]: Finished difference Result 63928 states and 220767 transitions. [2019-12-07 18:20:50,049 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 18:20:50,050 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 34 [2019-12-07 18:20:50,050 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 18:20:50,158 INFO L225 Difference]: With dead ends: 63928 [2019-12-07 18:20:50,158 INFO L226 Difference]: Without dead ends: 63928 [2019-12-07 18:20:50,158 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 1 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 18:20:50,603 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63928 states. [2019-12-07 18:20:51,263 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63928 to 50736. [2019-12-07 18:20:51,263 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 50736 states. [2019-12-07 18:20:51,378 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50736 states to 50736 states and 177622 transitions. [2019-12-07 18:20:51,378 INFO L78 Accepts]: Start accepts. Automaton has 50736 states and 177622 transitions. Word has length 34 [2019-12-07 18:20:51,378 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 18:20:51,378 INFO L462 AbstractCegarLoop]: Abstraction has 50736 states and 177622 transitions. [2019-12-07 18:20:51,378 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 18:20:51,378 INFO L276 IsEmpty]: Start isEmpty. Operand 50736 states and 177622 transitions. [2019-12-07 18:20:51,428 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2019-12-07 18:20:51,428 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 18:20:51,428 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] [2019-12-07 18:20:51,428 INFO L410 AbstractCegarLoop]: === Iteration 9 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 18:20:51,429 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 18:20:51,429 INFO L82 PathProgramCache]: Analyzing trace with hash -1754326611, now seen corresponding path program 2 times [2019-12-07 18:20:51,429 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 18:20:51,429 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [573367737] [2019-12-07 18:20:51,429 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 18:20:51,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:20:51,466 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 18:20:51,467 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [573367737] [2019-12-07 18:20:51,467 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 18:20:51,467 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 18:20:51,467 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1731705158] [2019-12-07 18:20:51,467 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 18:20:51,467 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 18:20:51,468 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 18:20:51,468 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-07 18:20:51,468 INFO L87 Difference]: Start difference. First operand 50736 states and 177622 transitions. Second operand 4 states. [2019-12-07 18:20:51,506 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 18:20:51,506 INFO L93 Difference]: Finished difference Result 7873 states and 22900 transitions. [2019-12-07 18:20:51,506 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 18:20:51,506 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 34 [2019-12-07 18:20:51,506 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 18:20:51,514 INFO L225 Difference]: With dead ends: 7873 [2019-12-07 18:20:51,514 INFO L226 Difference]: Without dead ends: 7873 [2019-12-07 18:20:51,515 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 18:20:51,531 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7873 states. [2019-12-07 18:20:51,656 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7873 to 7865. [2019-12-07 18:20:51,657 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7865 states. [2019-12-07 18:20:51,666 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7865 states to 7865 states and 22878 transitions. [2019-12-07 18:20:51,667 INFO L78 Accepts]: Start accepts. Automaton has 7865 states and 22878 transitions. Word has length 34 [2019-12-07 18:20:51,667 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 18:20:51,667 INFO L462 AbstractCegarLoop]: Abstraction has 7865 states and 22878 transitions. [2019-12-07 18:20:51,667 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 18:20:51,667 INFO L276 IsEmpty]: Start isEmpty. Operand 7865 states and 22878 transitions. [2019-12-07 18:20:51,674 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2019-12-07 18:20:51,674 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 18:20:51,675 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] [2019-12-07 18:20:51,675 INFO L410 AbstractCegarLoop]: === Iteration 10 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 18:20:51,675 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 18:20:51,675 INFO L82 PathProgramCache]: Analyzing trace with hash -360370146, now seen corresponding path program 1 times [2019-12-07 18:20:51,675 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 18:20:51,675 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [390383938] [2019-12-07 18:20:51,675 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 18:20:51,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:20:51,738 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 18:20:51,738 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [390383938] [2019-12-07 18:20:51,739 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 18:20:51,739 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-07 18:20:51,739 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [914550843] [2019-12-07 18:20:51,739 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-07 18:20:51,739 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 18:20:51,739 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-07 18:20:51,740 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-07 18:20:51,740 INFO L87 Difference]: Start difference. First operand 7865 states and 22878 transitions. Second operand 5 states. [2019-12-07 18:20:51,993 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 18:20:51,993 INFO L93 Difference]: Finished difference Result 8849 states and 25324 transitions. [2019-12-07 18:20:51,993 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-07 18:20:51,993 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 45 [2019-12-07 18:20:51,994 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 18:20:52,002 INFO L225 Difference]: With dead ends: 8849 [2019-12-07 18:20:52,002 INFO L226 Difference]: Without dead ends: 8849 [2019-12-07 18:20:52,002 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 18:20:52,019 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8849 states. [2019-12-07 18:20:52,084 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8849 to 8603. [2019-12-07 18:20:52,084 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8603 states. [2019-12-07 18:20:52,095 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8603 states to 8603 states and 24809 transitions. [2019-12-07 18:20:52,095 INFO L78 Accepts]: Start accepts. Automaton has 8603 states and 24809 transitions. Word has length 45 [2019-12-07 18:20:52,095 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 18:20:52,095 INFO L462 AbstractCegarLoop]: Abstraction has 8603 states and 24809 transitions. [2019-12-07 18:20:52,095 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-07 18:20:52,095 INFO L276 IsEmpty]: Start isEmpty. Operand 8603 states and 24809 transitions. [2019-12-07 18:20:52,102 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2019-12-07 18:20:52,102 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 18:20:52,102 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] [2019-12-07 18:20:52,102 INFO L410 AbstractCegarLoop]: === Iteration 11 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 18:20:52,102 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 18:20:52,102 INFO L82 PathProgramCache]: Analyzing trace with hash 181285084, now seen corresponding path program 1 times [2019-12-07 18:20:52,103 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 18:20:52,103 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [735100509] [2019-12-07 18:20:52,103 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 18:20:52,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:20:52,141 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 18:20:52,141 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [735100509] [2019-12-07 18:20:52,141 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 18:20:52,142 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 18:20:52,142 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1443184540] [2019-12-07 18:20:52,142 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 18:20:52,142 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 18:20:52,142 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 18:20:52,143 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 18:20:52,143 INFO L87 Difference]: Start difference. First operand 8603 states and 24809 transitions. Second operand 4 states. [2019-12-07 18:20:52,173 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 18:20:52,173 INFO L93 Difference]: Finished difference Result 10279 states and 28696 transitions. [2019-12-07 18:20:52,173 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 18:20:52,173 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 46 [2019-12-07 18:20:52,173 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 18:20:52,183 INFO L225 Difference]: With dead ends: 10279 [2019-12-07 18:20:52,183 INFO L226 Difference]: Without dead ends: 8607 [2019-12-07 18:20:52,183 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 18:20:52,200 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8607 states. [2019-12-07 18:20:52,264 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8607 to 8311. [2019-12-07 18:20:52,264 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8311 states. [2019-12-07 18:20:52,275 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8311 states to 8311 states and 24042 transitions. [2019-12-07 18:20:52,275 INFO L78 Accepts]: Start accepts. Automaton has 8311 states and 24042 transitions. Word has length 46 [2019-12-07 18:20:52,275 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 18:20:52,275 INFO L462 AbstractCegarLoop]: Abstraction has 8311 states and 24042 transitions. [2019-12-07 18:20:52,275 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 18:20:52,275 INFO L276 IsEmpty]: Start isEmpty. Operand 8311 states and 24042 transitions. [2019-12-07 18:20:52,282 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2019-12-07 18:20:52,282 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 18:20:52,282 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] [2019-12-07 18:20:52,282 INFO L410 AbstractCegarLoop]: === Iteration 12 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 18:20:52,282 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 18:20:52,282 INFO L82 PathProgramCache]: Analyzing trace with hash -1950563102, now seen corresponding path program 2 times [2019-12-07 18:20:52,282 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 18:20:52,282 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1570984202] [2019-12-07 18:20:52,282 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 18:20:52,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:20:52,506 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 18:20:52,506 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1570984202] [2019-12-07 18:20:52,506 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 18:20:52,506 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-12-07 18:20:52,506 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [270933641] [2019-12-07 18:20:52,506 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-12-07 18:20:52,506 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 18:20:52,506 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-12-07 18:20:52,507 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=84, Unknown=0, NotChecked=0, Total=110 [2019-12-07 18:20:52,507 INFO L87 Difference]: Start difference. First operand 8311 states and 24042 transitions. Second operand 11 states. [2019-12-07 18:20:53,640 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 18:20:53,640 INFO L93 Difference]: Finished difference Result 16603 states and 47217 transitions. [2019-12-07 18:20:53,640 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2019-12-07 18:20:53,640 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 46 [2019-12-07 18:20:53,640 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 18:20:53,655 INFO L225 Difference]: With dead ends: 16603 [2019-12-07 18:20:53,655 INFO L226 Difference]: Without dead ends: 13605 [2019-12-07 18:20:53,656 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 77 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=108, Invalid=398, Unknown=0, NotChecked=0, Total=506 [2019-12-07 18:20:53,679 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13605 states. [2019-12-07 18:20:53,788 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13605 to 12546. [2019-12-07 18:20:53,788 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12546 states. [2019-12-07 18:20:53,807 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12546 states to 12546 states and 36901 transitions. [2019-12-07 18:20:53,807 INFO L78 Accepts]: Start accepts. Automaton has 12546 states and 36901 transitions. Word has length 46 [2019-12-07 18:20:53,807 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 18:20:53,808 INFO L462 AbstractCegarLoop]: Abstraction has 12546 states and 36901 transitions. [2019-12-07 18:20:53,808 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-12-07 18:20:53,808 INFO L276 IsEmpty]: Start isEmpty. Operand 12546 states and 36901 transitions. [2019-12-07 18:20:53,818 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2019-12-07 18:20:53,818 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 18:20:53,818 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] [2019-12-07 18:20:53,818 INFO L410 AbstractCegarLoop]: === Iteration 13 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 18:20:53,818 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 18:20:53,818 INFO L82 PathProgramCache]: Analyzing trace with hash -842693778, now seen corresponding path program 1 times [2019-12-07 18:20:53,818 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 18:20:53,819 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [211915082] [2019-12-07 18:20:53,819 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 18:20:53,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:20:53,862 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 18:20:53,862 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [211915082] [2019-12-07 18:20:53,863 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 18:20:53,863 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-07 18:20:53,863 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1639809981] [2019-12-07 18:20:53,863 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-07 18:20:53,863 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 18:20:53,863 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-07 18:20:53,863 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-07 18:20:53,863 INFO L87 Difference]: Start difference. First operand 12546 states and 36901 transitions. Second operand 5 states. [2019-12-07 18:20:54,093 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 18:20:54,093 INFO L93 Difference]: Finished difference Result 11817 states and 34048 transitions. [2019-12-07 18:20:54,093 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-07 18:20:54,093 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 46 [2019-12-07 18:20:54,093 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 18:20:54,104 INFO L225 Difference]: With dead ends: 11817 [2019-12-07 18:20:54,104 INFO L226 Difference]: Without dead ends: 11817 [2019-12-07 18:20:54,104 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 5 SyntacticMatches, 2 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2019-12-07 18:20:54,125 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11817 states. [2019-12-07 18:20:54,203 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11817 to 8717. [2019-12-07 18:20:54,203 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8717 states. [2019-12-07 18:20:54,215 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8717 states to 8717 states and 24922 transitions. [2019-12-07 18:20:54,215 INFO L78 Accepts]: Start accepts. Automaton has 8717 states and 24922 transitions. Word has length 46 [2019-12-07 18:20:54,215 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 18:20:54,215 INFO L462 AbstractCegarLoop]: Abstraction has 8717 states and 24922 transitions. [2019-12-07 18:20:54,215 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-07 18:20:54,215 INFO L276 IsEmpty]: Start isEmpty. Operand 8717 states and 24922 transitions. [2019-12-07 18:20:54,221 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2019-12-07 18:20:54,222 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 18:20:54,222 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] [2019-12-07 18:20:54,222 INFO L410 AbstractCegarLoop]: === Iteration 14 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 18:20:54,222 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 18:20:54,222 INFO L82 PathProgramCache]: Analyzing trace with hash 1138071248, now seen corresponding path program 1 times [2019-12-07 18:20:54,222 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 18:20:54,222 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [247456977] [2019-12-07 18:20:54,222 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 18:20:54,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:20:54,268 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 18:20:54,268 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [247456977] [2019-12-07 18:20:54,269 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 18:20:54,269 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 18:20:54,269 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1665207520] [2019-12-07 18:20:54,269 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 18:20:54,269 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 18:20:54,269 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 18:20:54,270 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 18:20:54,270 INFO L87 Difference]: Start difference. First operand 8717 states and 24922 transitions. Second operand 4 states. [2019-12-07 18:20:54,306 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 18:20:54,306 INFO L93 Difference]: Finished difference Result 13484 states and 36629 transitions. [2019-12-07 18:20:54,306 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 18:20:54,306 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 47 [2019-12-07 18:20:54,306 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 18:20:54,314 INFO L225 Difference]: With dead ends: 13484 [2019-12-07 18:20:54,314 INFO L226 Difference]: Without dead ends: 8417 [2019-12-07 18:20:54,314 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 18:20:54,330 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8417 states. [2019-12-07 18:20:54,384 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8417 to 8278. [2019-12-07 18:20:54,384 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8278 states. [2019-12-07 18:20:54,393 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8278 states to 8278 states and 20543 transitions. [2019-12-07 18:20:54,394 INFO L78 Accepts]: Start accepts. Automaton has 8278 states and 20543 transitions. Word has length 47 [2019-12-07 18:20:54,394 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 18:20:54,394 INFO L462 AbstractCegarLoop]: Abstraction has 8278 states and 20543 transitions. [2019-12-07 18:20:54,394 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 18:20:54,394 INFO L276 IsEmpty]: Start isEmpty. Operand 8278 states and 20543 transitions. [2019-12-07 18:20:54,399 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2019-12-07 18:20:54,399 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 18:20:54,400 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] [2019-12-07 18:20:54,400 INFO L410 AbstractCegarLoop]: === Iteration 15 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 18:20:54,400 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 18:20:54,400 INFO L82 PathProgramCache]: Analyzing trace with hash -160832526, now seen corresponding path program 2 times [2019-12-07 18:20:54,400 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 18:20:54,400 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1339909633] [2019-12-07 18:20:54,400 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 18:20:54,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:20:54,436 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 18:20:54,437 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1339909633] [2019-12-07 18:20:54,437 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 18:20:54,437 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 18:20:54,437 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2082230630] [2019-12-07 18:20:54,437 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-07 18:20:54,437 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 18:20:54,438 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-07 18:20:54,438 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-12-07 18:20:54,438 INFO L87 Difference]: Start difference. First operand 8278 states and 20543 transitions. Second operand 5 states. [2019-12-07 18:20:54,465 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 18:20:54,465 INFO L93 Difference]: Finished difference Result 6440 states and 16215 transitions. [2019-12-07 18:20:54,465 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-07 18:20:54,465 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 47 [2019-12-07 18:20:54,466 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 18:20:54,467 INFO L225 Difference]: With dead ends: 6440 [2019-12-07 18:20:54,467 INFO L226 Difference]: Without dead ends: 825 [2019-12-07 18:20:54,467 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-12-07 18:20:54,469 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 825 states. [2019-12-07 18:20:54,475 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 825 to 803. [2019-12-07 18:20:54,475 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 803 states. [2019-12-07 18:20:54,477 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 803 states to 803 states and 1767 transitions. [2019-12-07 18:20:54,477 INFO L78 Accepts]: Start accepts. Automaton has 803 states and 1767 transitions. Word has length 47 [2019-12-07 18:20:54,477 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 18:20:54,477 INFO L462 AbstractCegarLoop]: Abstraction has 803 states and 1767 transitions. [2019-12-07 18:20:54,477 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-07 18:20:54,477 INFO L276 IsEmpty]: Start isEmpty. Operand 803 states and 1767 transitions. [2019-12-07 18:20:54,478 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2019-12-07 18:20:54,478 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 18:20:54,478 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 18:20:54,478 INFO L410 AbstractCegarLoop]: === Iteration 16 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 18:20:54,479 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 18:20:54,479 INFO L82 PathProgramCache]: Analyzing trace with hash 429224045, now seen corresponding path program 1 times [2019-12-07 18:20:54,479 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 18:20:54,479 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [675269410] [2019-12-07 18:20:54,479 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 18:20:54,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:20:54,599 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 18:20:54,600 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [675269410] [2019-12-07 18:20:54,600 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 18:20:54,600 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-12-07 18:20:54,600 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [281127834] [2019-12-07 18:20:54,600 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-12-07 18:20:54,600 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 18:20:54,601 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-12-07 18:20:54,601 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2019-12-07 18:20:54,601 INFO L87 Difference]: Start difference. First operand 803 states and 1767 transitions. Second operand 10 states. [2019-12-07 18:20:55,014 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 18:20:55,015 INFO L93 Difference]: Finished difference Result 1728 states and 3782 transitions. [2019-12-07 18:20:55,015 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-12-07 18:20:55,015 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 62 [2019-12-07 18:20:55,015 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 18:20:55,016 INFO L225 Difference]: With dead ends: 1728 [2019-12-07 18:20:55,016 INFO L226 Difference]: Without dead ends: 1728 [2019-12-07 18:20:55,016 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=57, Invalid=183, Unknown=0, NotChecked=0, Total=240 [2019-12-07 18:20:55,018 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1728 states. [2019-12-07 18:20:55,025 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1728 to 884. [2019-12-07 18:20:55,025 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 884 states. [2019-12-07 18:20:55,026 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 884 states to 884 states and 1968 transitions. [2019-12-07 18:20:55,026 INFO L78 Accepts]: Start accepts. Automaton has 884 states and 1968 transitions. Word has length 62 [2019-12-07 18:20:55,026 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 18:20:55,026 INFO L462 AbstractCegarLoop]: Abstraction has 884 states and 1968 transitions. [2019-12-07 18:20:55,026 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-12-07 18:20:55,026 INFO L276 IsEmpty]: Start isEmpty. Operand 884 states and 1968 transitions. [2019-12-07 18:20:55,027 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2019-12-07 18:20:55,027 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 18:20:55,027 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 18:20:55,027 INFO L410 AbstractCegarLoop]: === Iteration 17 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 18:20:55,027 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 18:20:55,027 INFO L82 PathProgramCache]: Analyzing trace with hash 575902287, now seen corresponding path program 2 times [2019-12-07 18:20:55,027 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 18:20:55,028 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1683544630] [2019-12-07 18:20:55,028 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 18:20:55,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:20:55,079 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 18:20:55,080 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1683544630] [2019-12-07 18:20:55,080 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 18:20:55,080 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-07 18:20:55,080 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [358062181] [2019-12-07 18:20:55,080 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-12-07 18:20:55,080 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 18:20:55,080 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-12-07 18:20:55,080 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2019-12-07 18:20:55,080 INFO L87 Difference]: Start difference. First operand 884 states and 1968 transitions. Second operand 8 states. [2019-12-07 18:20:55,231 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 18:20:55,231 INFO L93 Difference]: Finished difference Result 1344 states and 2912 transitions. [2019-12-07 18:20:55,231 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-12-07 18:20:55,231 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 62 [2019-12-07 18:20:55,231 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 18:20:55,232 INFO L225 Difference]: With dead ends: 1344 [2019-12-07 18:20:55,232 INFO L226 Difference]: Without dead ends: 952 [2019-12-07 18:20:55,232 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=54, Invalid=186, Unknown=0, NotChecked=0, Total=240 [2019-12-07 18:20:55,234 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 952 states. [2019-12-07 18:20:55,239 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 952 to 897. [2019-12-07 18:20:55,239 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 897 states. [2019-12-07 18:20:55,240 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 897 states to 897 states and 1948 transitions. [2019-12-07 18:20:55,240 INFO L78 Accepts]: Start accepts. Automaton has 897 states and 1948 transitions. Word has length 62 [2019-12-07 18:20:55,240 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 18:20:55,240 INFO L462 AbstractCegarLoop]: Abstraction has 897 states and 1948 transitions. [2019-12-07 18:20:55,240 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-12-07 18:20:55,240 INFO L276 IsEmpty]: Start isEmpty. Operand 897 states and 1948 transitions. [2019-12-07 18:20:55,240 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2019-12-07 18:20:55,241 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 18:20:55,241 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 18:20:55,241 INFO L410 AbstractCegarLoop]: === Iteration 18 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 18:20:55,241 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 18:20:55,241 INFO L82 PathProgramCache]: Analyzing trace with hash -124190557, now seen corresponding path program 3 times [2019-12-07 18:20:55,241 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 18:20:55,241 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1249988742] [2019-12-07 18:20:55,241 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 18:20:55,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:20:55,295 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 18:20:55,295 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1249988742] [2019-12-07 18:20:55,295 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 18:20:55,295 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-07 18:20:55,296 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [144100221] [2019-12-07 18:20:55,296 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-07 18:20:55,296 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 18:20:55,296 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-07 18:20:55,296 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-12-07 18:20:55,296 INFO L87 Difference]: Start difference. First operand 897 states and 1948 transitions. Second operand 6 states. [2019-12-07 18:20:55,524 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 18:20:55,524 INFO L93 Difference]: Finished difference Result 1139 states and 2414 transitions. [2019-12-07 18:20:55,524 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-07 18:20:55,525 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 62 [2019-12-07 18:20:55,525 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 18:20:55,525 INFO L225 Difference]: With dead ends: 1139 [2019-12-07 18:20:55,525 INFO L226 Difference]: Without dead ends: 1139 [2019-12-07 18:20:55,526 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 4 SyntacticMatches, 1 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2019-12-07 18:20:55,527 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1139 states. [2019-12-07 18:20:55,532 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1139 to 903. [2019-12-07 18:20:55,532 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 903 states. [2019-12-07 18:20:55,533 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 903 states to 903 states and 1959 transitions. [2019-12-07 18:20:55,533 INFO L78 Accepts]: Start accepts. Automaton has 903 states and 1959 transitions. Word has length 62 [2019-12-07 18:20:55,533 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 18:20:55,534 INFO L462 AbstractCegarLoop]: Abstraction has 903 states and 1959 transitions. [2019-12-07 18:20:55,534 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-07 18:20:55,534 INFO L276 IsEmpty]: Start isEmpty. Operand 903 states and 1959 transitions. [2019-12-07 18:20:55,534 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2019-12-07 18:20:55,534 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 18:20:55,534 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 18:20:55,535 INFO L410 AbstractCegarLoop]: === Iteration 19 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 18:20:55,535 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 18:20:55,535 INFO L82 PathProgramCache]: Analyzing trace with hash 1967740323, now seen corresponding path program 4 times [2019-12-07 18:20:55,535 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 18:20:55,535 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1959068432] [2019-12-07 18:20:55,535 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 18:20:55,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:20:55,569 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 18:20:55,569 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1959068432] [2019-12-07 18:20:55,569 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 18:20:55,569 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 18:20:55,569 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [920562916] [2019-12-07 18:20:55,569 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 18:20:55,569 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 18:20:55,569 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 18:20:55,570 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 18:20:55,570 INFO L87 Difference]: Start difference. First operand 903 states and 1959 transitions. Second operand 3 states. [2019-12-07 18:20:55,578 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 18:20:55,578 INFO L93 Difference]: Finished difference Result 903 states and 1958 transitions. [2019-12-07 18:20:55,578 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 18:20:55,579 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 62 [2019-12-07 18:20:55,579 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 18:20:55,579 INFO L225 Difference]: With dead ends: 903 [2019-12-07 18:20:55,579 INFO L226 Difference]: Without dead ends: 903 [2019-12-07 18:20:55,580 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 18:20:55,581 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 903 states. [2019-12-07 18:20:55,585 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 903 to 822. [2019-12-07 18:20:55,586 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 822 states. [2019-12-07 18:20:55,586 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 822 states to 822 states and 1805 transitions. [2019-12-07 18:20:55,586 INFO L78 Accepts]: Start accepts. Automaton has 822 states and 1805 transitions. Word has length 62 [2019-12-07 18:20:55,587 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 18:20:55,587 INFO L462 AbstractCegarLoop]: Abstraction has 822 states and 1805 transitions. [2019-12-07 18:20:55,587 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 18:20:55,587 INFO L276 IsEmpty]: Start isEmpty. Operand 822 states and 1805 transitions. [2019-12-07 18:20:55,587 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2019-12-07 18:20:55,587 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 18:20:55,587 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 18:20:55,588 INFO L410 AbstractCegarLoop]: === Iteration 20 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 18:20:55,588 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 18:20:55,588 INFO L82 PathProgramCache]: Analyzing trace with hash 799739627, now seen corresponding path program 1 times [2019-12-07 18:20:55,588 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 18:20:55,588 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1043558038] [2019-12-07 18:20:55,588 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 18:20:55,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-07 18:20:55,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-07 18:20:55,653 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-07 18:20:55,653 INFO L475 BasicCegarLoop]: Counterexample might be feasible [2019-12-07 18:20:55,655 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1028] [1028] ULTIMATE.startENTRY-->L835: Formula: (let ((.cse0 (store |v_#valid_106| 0 0))) (and (= v_~y$flush_delayed~0_334 0) (= 0 v_~y$read_delayed_var~0.offset_7) (= v_~y$r_buff0_thd0~0_211 0) (= |v_#NULL.offset_7| 0) (= v_~y$w_buff0_used~0_972 0) (= v_~y$w_buff1~0_277 0) (= (store .cse0 |v_ULTIMATE.start_main_~#t86~0.base_69| 1) |v_#valid_104|) (= v_~y$read_delayed~0_7 0) (= v_~main$tmp_guard1~0_59 0) (= 0 v_~y$r_buff0_thd2~0_408) (= v_~y$r_buff1_thd0~0_314 0) (= v_~y$w_buff1_used~0_548 0) (< 0 |v_#StackHeapBarrier_16|) (= v_~y$r_buff1_thd1~0_221 0) (= v_~__unbuffered_cnt~0_149 0) (= v_~y$r_buff0_thd1~0_150 0) (= v_~y$mem_tmp~0_266 0) (= 0 v_~__unbuffered_p0_EAX~0_59) (< |v_#StackHeapBarrier_16| |v_ULTIMATE.start_main_~#t86~0.base_69|) (= v_~y~0_368 0) (= (store |v_#memory_int_20| |v_ULTIMATE.start_main_~#t86~0.base_69| (store (select |v_#memory_int_20| |v_ULTIMATE.start_main_~#t86~0.base_69|) |v_ULTIMATE.start_main_~#t86~0.offset_41| 0)) |v_#memory_int_19|) (= v_~main$tmp_guard0~0_20 0) (= 0 v_~y$r_buff0_thd3~0_638) (= 0 v_~y$read_delayed_var~0.base_7) (= 0 |v_#NULL.base_7|) (= 0 v_~weak$$choice0~0_253) (= v_~z~0_27 0) (= 0 v_~y$w_buff0~0_388) (= 0 v_~__unbuffered_p2_EAX~0_67) (= |v_ULTIMATE.start_main_~#t86~0.offset_41| 0) (= 0 v_~y$r_buff1_thd3~0_405) (= 0 v_~y$r_buff1_thd2~0_395) (= v_~__unbuffered_p1_EBX~0_68 0) (= v_~weak$$choice2~0_330 0) (= 0 (select .cse0 |v_ULTIMATE.start_main_~#t86~0.base_69|)) (= |v_#length_21| (store |v_#length_22| |v_ULTIMATE.start_main_~#t86~0.base_69| 4)) (= 0 v_~__unbuffered_p1_EAX~0_81) (= v_~__unbuffered_p2_EBX~0_61 0) (= v_~x~0_47 0))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_16|, #valid=|v_#valid_106|, #memory_int=|v_#memory_int_20|, #length=|v_#length_22|} OutVars{ULTIMATE.start_main_#t~nondet57=|v_ULTIMATE.start_main_#t~nondet57_18|, ULTIMATE.start_main_#t~nondet55=|v_ULTIMATE.start_main_#t~nondet55_8|, #NULL.offset=|v_#NULL.offset_7|, ULTIMATE.start_main_~#t86~0.base=|v_ULTIMATE.start_main_~#t86~0.base_69|, ~y$read_delayed~0=v_~y$read_delayed~0_7, ~y$mem_tmp~0=v_~y$mem_tmp~0_266, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_59, ~y$r_buff1_thd3~0=v_~y$r_buff1_thd3~0_405, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_81, ~y$r_buff0_thd1~0=v_~y$r_buff0_thd1~0_150, ~y$flush_delayed~0=v_~y$flush_delayed~0_334, ULTIMATE.start_main_~#t88~0.offset=|v_ULTIMATE.start_main_~#t88~0.offset_14|, #length=|v_#length_21|, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_67, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_61, ULTIMATE.start_main_#t~ite58=|v_ULTIMATE.start_main_#t~ite58_54|, ULTIMATE.start_main_~#t87~0.offset=|v_ULTIMATE.start_main_~#t87~0.offset_41|, ULTIMATE.start_main_#t~ite63=|v_ULTIMATE.start_main_#t~ite63_117|, ~weak$$choice0~0=v_~weak$$choice0~0_253, #StackHeapBarrier=|v_#StackHeapBarrier_16|, ULTIMATE.start_main_#t~ite61=|v_ULTIMATE.start_main_#t~ite61_40|, ~y$w_buff1~0=v_~y$w_buff1~0_277, ~y$read_delayed_var~0.base=v_~y$read_delayed_var~0.base_7, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_408, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_149, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_314, ~x~0=v_~x~0_47, ULTIMATE.start_main_~#t86~0.offset=|v_ULTIMATE.start_main_~#t86~0.offset_41|, ULTIMATE.start_main_~#t88~0.base=|v_ULTIMATE.start_main_~#t88~0.base_43|, ~y$read_delayed_var~0.offset=v_~y$read_delayed_var~0.offset_7, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_972, ULTIMATE.start_main_#t~nondet56=|v_ULTIMATE.start_main_#t~nondet56_9|, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_59, ~y$r_buff1_thd1~0=v_~y$r_buff1_thd1~0_221, ~y$w_buff0~0=v_~y$w_buff0~0_388, ~y$r_buff0_thd3~0=v_~y$r_buff0_thd3~0_638, ULTIMATE.start_main_~#t87~0.base=|v_ULTIMATE.start_main_~#t87~0.base_70|, ~y~0=v_~y~0_368, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_68, ULTIMATE.start_main_#t~ite59=|v_ULTIMATE.start_main_#t~ite59_74|, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_20, #NULL.base=|v_#NULL.base_7|, ULTIMATE.start_main_#t~ite62=|v_ULTIMATE.start_main_#t~ite62_28|, ~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_395, ULTIMATE.start_main_#t~ite60=|v_ULTIMATE.start_main_#t~ite60_478|, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_43|, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_211, #valid=|v_#valid_104|, #memory_int=|v_#memory_int_19|, ~z~0=v_~z~0_27, ~weak$$choice2~0=v_~weak$$choice2~0_330, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_548} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet57, ULTIMATE.start_main_#t~nondet55, #NULL.offset, ULTIMATE.start_main_~#t86~0.base, ~y$read_delayed~0, ~y$mem_tmp~0, ~__unbuffered_p0_EAX~0, ~y$r_buff1_thd3~0, ~__unbuffered_p1_EAX~0, ~y$r_buff0_thd1~0, ~y$flush_delayed~0, ULTIMATE.start_main_~#t88~0.offset, #length, ~__unbuffered_p2_EAX~0, ~__unbuffered_p2_EBX~0, ULTIMATE.start_main_#t~ite58, ULTIMATE.start_main_~#t87~0.offset, ULTIMATE.start_main_#t~ite63, ~weak$$choice0~0, ULTIMATE.start_main_#t~ite61, ~y$w_buff1~0, ~y$read_delayed_var~0.base, ~y$r_buff0_thd2~0, ~__unbuffered_cnt~0, ~y$r_buff1_thd0~0, ~x~0, ULTIMATE.start_main_~#t86~0.offset, ULTIMATE.start_main_~#t88~0.base, ~y$read_delayed_var~0.offset, ~y$w_buff0_used~0, ULTIMATE.start_main_#t~nondet56, ~main$tmp_guard1~0, ~y$r_buff1_thd1~0, ~y$w_buff0~0, ~y$r_buff0_thd3~0, ULTIMATE.start_main_~#t87~0.base, ~y~0, ~__unbuffered_p1_EBX~0, ULTIMATE.start_main_#t~ite59, ~main$tmp_guard0~0, #NULL.base, ULTIMATE.start_main_#t~ite62, ~y$r_buff1_thd2~0, ULTIMATE.start_main_#t~ite60, ULTIMATE.start_main_#res, ~y$r_buff0_thd0~0, #valid, #memory_int, ~z~0, ~weak$$choice2~0, ~y$w_buff1_used~0] because there is no mapped edge [2019-12-07 18:20:55,656 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1004] [1004] L835-1-->L837: Formula: (and (< |v_#StackHeapBarrier_10| |v_ULTIMATE.start_main_~#t87~0.base_12|) (= 0 (select |v_#valid_37| |v_ULTIMATE.start_main_~#t87~0.base_12|)) (= (store |v_#length_16| |v_ULTIMATE.start_main_~#t87~0.base_12| 4) |v_#length_15|) (not (= |v_ULTIMATE.start_main_~#t87~0.base_12| 0)) (= (store |v_#memory_int_14| |v_ULTIMATE.start_main_~#t87~0.base_12| (store (select |v_#memory_int_14| |v_ULTIMATE.start_main_~#t87~0.base_12|) |v_ULTIMATE.start_main_~#t87~0.offset_10| 1)) |v_#memory_int_13|) (= |v_ULTIMATE.start_main_~#t87~0.offset_10| 0) (= |v_#valid_36| (store |v_#valid_37| |v_ULTIMATE.start_main_~#t87~0.base_12| 1))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_10|, #valid=|v_#valid_37|, #memory_int=|v_#memory_int_14|, #length=|v_#length_16|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_10|, ULTIMATE.start_main_#t~nondet55=|v_ULTIMATE.start_main_#t~nondet55_4|, ULTIMATE.start_main_~#t87~0.base=|v_ULTIMATE.start_main_~#t87~0.base_12|, #valid=|v_#valid_36|, #memory_int=|v_#memory_int_13|, #length=|v_#length_15|, ULTIMATE.start_main_~#t87~0.offset=|v_ULTIMATE.start_main_~#t87~0.offset_10|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet55, ULTIMATE.start_main_~#t87~0.base, #valid, #memory_int, #length, ULTIMATE.start_main_~#t87~0.offset] because there is no mapped edge [2019-12-07 18:20:55,656 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1000] [1000] L837-1-->L839: Formula: (and (= |v_#memory_int_11| (store |v_#memory_int_12| |v_ULTIMATE.start_main_~#t88~0.base_11| (store (select |v_#memory_int_12| |v_ULTIMATE.start_main_~#t88~0.base_11|) |v_ULTIMATE.start_main_~#t88~0.offset_9| 2))) (= 0 (select |v_#valid_33| |v_ULTIMATE.start_main_~#t88~0.base_11|)) (not (= 0 |v_ULTIMATE.start_main_~#t88~0.base_11|)) (= (store |v_#valid_33| |v_ULTIMATE.start_main_~#t88~0.base_11| 1) |v_#valid_32|) (= |v_ULTIMATE.start_main_~#t88~0.offset_9| 0) (< |v_#StackHeapBarrier_8| |v_ULTIMATE.start_main_~#t88~0.base_11|) (= (store |v_#length_14| |v_ULTIMATE.start_main_~#t88~0.base_11| 4) |v_#length_13|)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_8|, #valid=|v_#valid_33|, #memory_int=|v_#memory_int_12|, #length=|v_#length_14|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_8|, #valid=|v_#valid_32|, ULTIMATE.start_main_#t~nondet56=|v_ULTIMATE.start_main_#t~nondet56_5|, #memory_int=|v_#memory_int_11|, ULTIMATE.start_main_~#t88~0.offset=|v_ULTIMATE.start_main_~#t88~0.offset_9|, #length=|v_#length_13|, ULTIMATE.start_main_~#t88~0.base=|v_ULTIMATE.start_main_~#t88~0.base_11|} AuxVars[] AssignedVars[#valid, ULTIMATE.start_main_#t~nondet56, #memory_int, ULTIMATE.start_main_~#t88~0.offset, #length, ULTIMATE.start_main_~#t88~0.base] because there is no mapped edge [2019-12-07 18:20:55,657 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [876] [876] P2ENTRY-->L4-3: Formula: (and (= v_~y$w_buff1_used~0_65 v_~y$w_buff0_used~0_118) (not (= 0 v_P2Thread1of1ForFork0___VERIFIER_assert_~expression_16)) (= v_P2Thread1of1ForFork0___VERIFIER_assert_~expression_16 |v_P2Thread1of1ForFork0___VERIFIER_assert_#in~expression_14|) (= 1 v_~y$w_buff0~0_43) (= (ite (not (and (not (= (mod v_~y$w_buff1_used~0_65 256) 0)) (not (= (mod v_~y$w_buff0_used~0_117 256) 0)))) 1 0) |v_P2Thread1of1ForFork0___VERIFIER_assert_#in~expression_14|) (= |v_P2Thread1of1ForFork0_#in~arg.offset_16| v_P2Thread1of1ForFork0_~arg.offset_14) (= v_~y$w_buff0_used~0_117 1) (= v_~y$w_buff0~0_44 v_~y$w_buff1~0_29) (= |v_P2Thread1of1ForFork0_#in~arg.base_16| v_P2Thread1of1ForFork0_~arg.base_14)) InVars {P2Thread1of1ForFork0_#in~arg.offset=|v_P2Thread1of1ForFork0_#in~arg.offset_16|, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_118, ~y$w_buff0~0=v_~y$w_buff0~0_44, P2Thread1of1ForFork0_#in~arg.base=|v_P2Thread1of1ForFork0_#in~arg.base_16|} OutVars{P2Thread1of1ForFork0_~arg.base=v_P2Thread1of1ForFork0_~arg.base_14, P2Thread1of1ForFork0_#in~arg.offset=|v_P2Thread1of1ForFork0_#in~arg.offset_16|, P2Thread1of1ForFork0___VERIFIER_assert_#in~expression=|v_P2Thread1of1ForFork0___VERIFIER_assert_#in~expression_14|, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_117, ~y$w_buff1~0=v_~y$w_buff1~0_29, ~y$w_buff0~0=v_~y$w_buff0~0_43, P2Thread1of1ForFork0_~arg.offset=v_P2Thread1of1ForFork0_~arg.offset_14, P2Thread1of1ForFork0_#in~arg.base=|v_P2Thread1of1ForFork0_#in~arg.base_16|, P2Thread1of1ForFork0___VERIFIER_assert_~expression=v_P2Thread1of1ForFork0___VERIFIER_assert_~expression_16, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_65} AuxVars[] AssignedVars[P2Thread1of1ForFork0_~arg.base, P2Thread1of1ForFork0___VERIFIER_assert_#in~expression, ~y$w_buff0_used~0, ~y$w_buff1~0, ~y$w_buff0~0, P2Thread1of1ForFork0_~arg.offset, P2Thread1of1ForFork0___VERIFIER_assert_~expression, ~y$w_buff1_used~0] because there is no mapped edge [2019-12-07 18:20:55,657 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [958] [958] L797-2-->L797-4: Formula: (let ((.cse1 (= (mod ~y$r_buff0_thd3~0_In1850866195 256) 0)) (.cse0 (= (mod ~y$w_buff0_used~0_In1850866195 256) 0))) (or (and (= |P2Thread1of1ForFork0_#t~ite28_Out1850866195| ~y$w_buff0~0_In1850866195) (not .cse0) (not .cse1)) (and (= |P2Thread1of1ForFork0_#t~ite28_Out1850866195| ~y$w_buff1~0_In1850866195) (or .cse1 .cse0)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In1850866195, ~y$w_buff1~0=~y$w_buff1~0_In1850866195, ~y$w_buff0~0=~y$w_buff0~0_In1850866195, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In1850866195} OutVars{P2Thread1of1ForFork0_#t~ite28=|P2Thread1of1ForFork0_#t~ite28_Out1850866195|, ~y$w_buff0_used~0=~y$w_buff0_used~0_In1850866195, ~y$w_buff1~0=~y$w_buff1~0_In1850866195, ~y$w_buff0~0=~y$w_buff0~0_In1850866195, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In1850866195} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite28] because there is no mapped edge [2019-12-07 18:20:55,657 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [912] [912] L797-4-->L798: Formula: (= v_~y~0_64 |v_P2Thread1of1ForFork0_#t~ite28_6|) InVars {P2Thread1of1ForFork0_#t~ite28=|v_P2Thread1of1ForFork0_#t~ite28_6|} OutVars{P2Thread1of1ForFork0_#t~ite28=|v_P2Thread1of1ForFork0_#t~ite28_5|, P2Thread1of1ForFork0_#t~ite29=|v_P2Thread1of1ForFork0_#t~ite29_5|, ~y~0=v_~y~0_64} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite28, P2Thread1of1ForFork0_#t~ite29, ~y~0] because there is no mapped edge [2019-12-07 18:20:55,660 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [915] [915] L802-->L803: Formula: (and (= v_~y$r_buff0_thd3~0_173 v_~y$r_buff0_thd3~0_172) (not (= 0 (mod v_~weak$$choice2~0_74 256)))) InVars {~y$r_buff0_thd3~0=v_~y$r_buff0_thd3~0_173, ~weak$$choice2~0=v_~weak$$choice2~0_74} OutVars{P2Thread1of1ForFork0_#t~ite44=|v_P2Thread1of1ForFork0_#t~ite44_8|, P2Thread1of1ForFork0_#t~ite43=|v_P2Thread1of1ForFork0_#t~ite43_10|, ~y$r_buff0_thd3~0=v_~y$r_buff0_thd3~0_172, P2Thread1of1ForFork0_#t~ite42=|v_P2Thread1of1ForFork0_#t~ite42_11|, ~weak$$choice2~0=v_~weak$$choice2~0_74} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite44, P2Thread1of1ForFork0_#t~ite43, ~y$r_buff0_thd3~0, P2Thread1of1ForFork0_#t~ite42] because there is no mapped edge [2019-12-07 18:20:55,661 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [948] [948] L805-->L805-2: Formula: (let ((.cse0 (= (mod ~y$flush_delayed~0_In-1135351185 256) 0))) (or (and (= |P2Thread1of1ForFork0_#t~ite48_Out-1135351185| ~y~0_In-1135351185) .cse0) (and (= |P2Thread1of1ForFork0_#t~ite48_Out-1135351185| ~y$mem_tmp~0_In-1135351185) (not .cse0)))) InVars {~y$mem_tmp~0=~y$mem_tmp~0_In-1135351185, ~y$flush_delayed~0=~y$flush_delayed~0_In-1135351185, ~y~0=~y~0_In-1135351185} OutVars{P2Thread1of1ForFork0_#t~ite48=|P2Thread1of1ForFork0_#t~ite48_Out-1135351185|, ~y$mem_tmp~0=~y$mem_tmp~0_In-1135351185, ~y$flush_delayed~0=~y$flush_delayed~0_In-1135351185, ~y~0=~y~0_In-1135351185} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite48] because there is no mapped edge [2019-12-07 18:20:55,661 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [993] [993] P0ENTRY-->P0EXIT: Formula: (and (= |v_P0Thread1of1ForFork1_#in~arg.base_11| v_P0Thread1of1ForFork1_~arg.base_9) (= v_~__unbuffered_cnt~0_102 (+ v_~__unbuffered_cnt~0_103 1)) (= v_P0Thread1of1ForFork1_~arg.offset_9 |v_P0Thread1of1ForFork1_#in~arg.offset_11|) (= v_~z~0_15 1) (= 0 |v_P0Thread1of1ForFork1_#res.offset_7|) (= v_~x~0_38 v_~__unbuffered_p0_EAX~0_22) (= 0 |v_P0Thread1of1ForFork1_#res.base_7|)) InVars {P0Thread1of1ForFork1_#in~arg.offset=|v_P0Thread1of1ForFork1_#in~arg.offset_11|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_103, P0Thread1of1ForFork1_#in~arg.base=|v_P0Thread1of1ForFork1_#in~arg.base_11|, ~x~0=v_~x~0_38} OutVars{~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_22, P0Thread1of1ForFork1_#res.offset=|v_P0Thread1of1ForFork1_#res.offset_7|, P0Thread1of1ForFork1_#in~arg.offset=|v_P0Thread1of1ForFork1_#in~arg.offset_11|, P0Thread1of1ForFork1_#res.base=|v_P0Thread1of1ForFork1_#res.base_7|, P0Thread1of1ForFork1_~arg.offset=v_P0Thread1of1ForFork1_~arg.offset_9, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_102, ~z~0=v_~z~0_15, P0Thread1of1ForFork1_#in~arg.base=|v_P0Thread1of1ForFork1_#in~arg.base_11|, ~x~0=v_~x~0_38, P0Thread1of1ForFork1_~arg.base=v_P0Thread1of1ForFork1_~arg.base_9} AuxVars[] AssignedVars[~__unbuffered_p0_EAX~0, P0Thread1of1ForFork1_#res.offset, P0Thread1of1ForFork1_#res.base, P0Thread1of1ForFork1_~arg.offset, ~__unbuffered_cnt~0, ~z~0, P0Thread1of1ForFork1_~arg.base] because there is no mapped edge [2019-12-07 18:20:55,666 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [961] [961] L768-->L768-2: Formula: (let ((.cse0 (= 0 (mod ~y$flush_delayed~0_In-560489104 256)))) (or (and (= |P1Thread1of1ForFork2_#t~ite25_Out-560489104| ~y$mem_tmp~0_In-560489104) (not .cse0)) (and .cse0 (= |P1Thread1of1ForFork2_#t~ite25_Out-560489104| ~y~0_In-560489104)))) InVars {~y$mem_tmp~0=~y$mem_tmp~0_In-560489104, ~y$flush_delayed~0=~y$flush_delayed~0_In-560489104, ~y~0=~y~0_In-560489104} OutVars{~y$mem_tmp~0=~y$mem_tmp~0_In-560489104, ~y$flush_delayed~0=~y$flush_delayed~0_In-560489104, ~y~0=~y~0_In-560489104, P1Thread1of1ForFork2_#t~ite25=|P1Thread1of1ForFork2_#t~ite25_Out-560489104|} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#t~ite25] because there is no mapped edge [2019-12-07 18:20:55,666 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1002] [1002] L768-2-->P1EXIT: Formula: (and (= 0 |v_P1Thread1of1ForFork2_#res.offset_3|) (= 0 |v_P1Thread1of1ForFork2_#res.base_3|) (= v_~y~0_266 |v_P1Thread1of1ForFork2_#t~ite25_114|) (= v_~__unbuffered_cnt~0_136 (+ v_~__unbuffered_cnt~0_137 1)) (= v_~y$flush_delayed~0_286 0)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_137, P1Thread1of1ForFork2_#t~ite25=|v_P1Thread1of1ForFork2_#t~ite25_114|} OutVars{P1Thread1of1ForFork2_#res.offset=|v_P1Thread1of1ForFork2_#res.offset_3|, ~y$flush_delayed~0=v_~y$flush_delayed~0_286, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_136, ~y~0=v_~y~0_266, P1Thread1of1ForFork2_#res.base=|v_P1Thread1of1ForFork2_#res.base_3|, P1Thread1of1ForFork2_#t~ite25=|v_P1Thread1of1ForFork2_#t~ite25_113|} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#res.offset, ~y$flush_delayed~0, ~__unbuffered_cnt~0, ~y~0, P1Thread1of1ForFork2_#res.base, P1Thread1of1ForFork2_#t~ite25] because there is no mapped edge [2019-12-07 18:20:55,667 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [962] [962] L813-->L813-2: Formula: (let ((.cse1 (= (mod ~y$r_buff0_thd3~0_In1841889519 256) 0)) (.cse0 (= 0 (mod ~y$w_buff0_used~0_In1841889519 256)))) (or (and (= 0 |P2Thread1of1ForFork0_#t~ite51_Out1841889519|) (not .cse0) (not .cse1)) (and (or .cse1 .cse0) (= ~y$w_buff0_used~0_In1841889519 |P2Thread1of1ForFork0_#t~ite51_Out1841889519|)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In1841889519, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In1841889519} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In1841889519, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In1841889519, P2Thread1of1ForFork0_#t~ite51=|P2Thread1of1ForFork0_#t~ite51_Out1841889519|} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite51] because there is no mapped edge [2019-12-07 18:20:55,668 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [960] [960] L814-->L814-2: Formula: (let ((.cse2 (= (mod ~y$w_buff0_used~0_In-1753633772 256) 0)) (.cse3 (= 0 (mod ~y$r_buff0_thd3~0_In-1753633772 256))) (.cse1 (= 0 (mod ~y$w_buff1_used~0_In-1753633772 256))) (.cse0 (= (mod ~y$r_buff1_thd3~0_In-1753633772 256) 0))) (or (and (or .cse0 .cse1) (or .cse2 .cse3) (= |P2Thread1of1ForFork0_#t~ite52_Out-1753633772| ~y$w_buff1_used~0_In-1753633772)) (and (= |P2Thread1of1ForFork0_#t~ite52_Out-1753633772| 0) (or (and (not .cse2) (not .cse3)) (and (not .cse1) (not .cse0)))))) InVars {~y$r_buff1_thd3~0=~y$r_buff1_thd3~0_In-1753633772, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-1753633772, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In-1753633772, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1753633772} OutVars{~y$r_buff1_thd3~0=~y$r_buff1_thd3~0_In-1753633772, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-1753633772, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In-1753633772, P2Thread1of1ForFork0_#t~ite52=|P2Thread1of1ForFork0_#t~ite52_Out-1753633772|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1753633772} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite52] because there is no mapped edge [2019-12-07 18:20:55,668 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [952] [952] L815-->L816: Formula: (let ((.cse0 (= 0 (mod ~y$w_buff0_used~0_In-2042044204 256))) (.cse2 (= ~y$r_buff0_thd3~0_In-2042044204 ~y$r_buff0_thd3~0_Out-2042044204)) (.cse1 (= (mod ~y$r_buff0_thd3~0_In-2042044204 256) 0))) (or (and (= ~y$r_buff0_thd3~0_Out-2042044204 0) (not .cse0) (not .cse1)) (and .cse0 .cse2) (and .cse2 .cse1))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-2042044204, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In-2042044204} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-2042044204, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_Out-2042044204, P2Thread1of1ForFork0_#t~ite53=|P2Thread1of1ForFork0_#t~ite53_Out-2042044204|} AuxVars[] AssignedVars[~y$r_buff0_thd3~0, P2Thread1of1ForFork0_#t~ite53] because there is no mapped edge [2019-12-07 18:20:55,668 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [951] [951] L816-->L816-2: Formula: (let ((.cse0 (= (mod ~y$w_buff0_used~0_In-1907151461 256) 0)) (.cse1 (= 0 (mod ~y$r_buff0_thd3~0_In-1907151461 256))) (.cse3 (= (mod ~y$r_buff1_thd3~0_In-1907151461 256) 0)) (.cse2 (= 0 (mod ~y$w_buff1_used~0_In-1907151461 256)))) (or (and (or .cse0 .cse1) (= ~y$r_buff1_thd3~0_In-1907151461 |P2Thread1of1ForFork0_#t~ite54_Out-1907151461|) (or .cse2 .cse3)) (and (= 0 |P2Thread1of1ForFork0_#t~ite54_Out-1907151461|) (or (and (not .cse0) (not .cse1)) (and (not .cse3) (not .cse2)))))) InVars {~y$r_buff1_thd3~0=~y$r_buff1_thd3~0_In-1907151461, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-1907151461, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In-1907151461, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1907151461} OutVars{~y$r_buff1_thd3~0=~y$r_buff1_thd3~0_In-1907151461, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-1907151461, P2Thread1of1ForFork0_#t~ite54=|P2Thread1of1ForFork0_#t~ite54_Out-1907151461|, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In-1907151461, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1907151461} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite54] because there is no mapped edge [2019-12-07 18:20:55,668 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [983] [983] L816-2-->P2EXIT: Formula: (and (= |v_P2Thread1of1ForFork0_#res.base_3| 0) (= (+ v_~__unbuffered_cnt~0_89 1) v_~__unbuffered_cnt~0_88) (= |v_P2Thread1of1ForFork0_#res.offset_3| 0) (= v_~y$r_buff1_thd3~0_178 |v_P2Thread1of1ForFork0_#t~ite54_30|)) InVars {P2Thread1of1ForFork0_#t~ite54=|v_P2Thread1of1ForFork0_#t~ite54_30|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_89} OutVars{~y$r_buff1_thd3~0=v_~y$r_buff1_thd3~0_178, P2Thread1of1ForFork0_#res.base=|v_P2Thread1of1ForFork0_#res.base_3|, P2Thread1of1ForFork0_#t~ite54=|v_P2Thread1of1ForFork0_#t~ite54_29|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_88, P2Thread1of1ForFork0_#res.offset=|v_P2Thread1of1ForFork0_#res.offset_3|} AuxVars[] AssignedVars[~y$r_buff1_thd3~0, P2Thread1of1ForFork0_#res.base, P2Thread1of1ForFork0_#t~ite54, ~__unbuffered_cnt~0, P2Thread1of1ForFork0_#res.offset] because there is no mapped edge [2019-12-07 18:20:55,668 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [943] [943] L839-1-->L845: Formula: (and (not (= 0 (mod v_~main$tmp_guard0~0_9 256))) (= v_~main$tmp_guard0~0_9 (ite (= 0 (ite (= 3 v_~__unbuffered_cnt~0_58) 1 0)) 0 1))) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_58} OutVars{ULTIMATE.start_main_#t~nondet57=|v_ULTIMATE.start_main_#t~nondet57_7|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_58, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_9} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet57, ~main$tmp_guard0~0] because there is no mapped edge [2019-12-07 18:20:55,669 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [945] [945] L845-2-->L845-5: Formula: (let ((.cse0 (= 0 (mod ~y$w_buff1_used~0_In1882504871 256))) (.cse2 (= 0 (mod ~y$r_buff1_thd0~0_In1882504871 256))) (.cse1 (= |ULTIMATE.start_main_#t~ite58_Out1882504871| |ULTIMATE.start_main_#t~ite59_Out1882504871|))) (or (and (= |ULTIMATE.start_main_#t~ite58_Out1882504871| ~y$w_buff1~0_In1882504871) (not .cse0) .cse1 (not .cse2)) (and (or .cse0 .cse2) (= |ULTIMATE.start_main_#t~ite58_Out1882504871| ~y~0_In1882504871) .cse1))) InVars {~y$w_buff1~0=~y$w_buff1~0_In1882504871, ~y~0=~y~0_In1882504871, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In1882504871, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1882504871} OutVars{~y$w_buff1~0=~y$w_buff1~0_In1882504871, ULTIMATE.start_main_#t~ite58=|ULTIMATE.start_main_#t~ite58_Out1882504871|, ULTIMATE.start_main_#t~ite59=|ULTIMATE.start_main_#t~ite59_Out1882504871|, ~y~0=~y~0_In1882504871, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In1882504871, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1882504871} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite58, ULTIMATE.start_main_#t~ite59] because there is no mapped edge [2019-12-07 18:20:55,669 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [964] [964] L846-->L846-2: Formula: (let ((.cse0 (= (mod ~y$w_buff0_used~0_In-202943053 256) 0)) (.cse1 (= 0 (mod ~y$r_buff0_thd0~0_In-202943053 256)))) (or (and (or .cse0 .cse1) (= ~y$w_buff0_used~0_In-202943053 |ULTIMATE.start_main_#t~ite60_Out-202943053|)) (and (not .cse0) (not .cse1) (= 0 |ULTIMATE.start_main_#t~ite60_Out-202943053|)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-202943053, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-202943053} OutVars{ULTIMATE.start_main_#t~ite60=|ULTIMATE.start_main_#t~ite60_Out-202943053|, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-202943053, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-202943053} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite60] because there is no mapped edge [2019-12-07 18:20:55,670 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [946] [946] L847-->L847-2: Formula: (let ((.cse2 (= 0 (mod ~y$w_buff1_used~0_In1460982518 256))) (.cse3 (= (mod ~y$r_buff1_thd0~0_In1460982518 256) 0)) (.cse0 (= (mod ~y$r_buff0_thd0~0_In1460982518 256) 0)) (.cse1 (= (mod ~y$w_buff0_used~0_In1460982518 256) 0))) (or (and (or .cse0 .cse1) (or .cse2 .cse3) (= |ULTIMATE.start_main_#t~ite61_Out1460982518| ~y$w_buff1_used~0_In1460982518)) (and (or (and (not .cse2) (not .cse3)) (and (not .cse0) (not .cse1))) (= |ULTIMATE.start_main_#t~ite61_Out1460982518| 0)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In1460982518, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In1460982518, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In1460982518, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1460982518} OutVars{ULTIMATE.start_main_#t~ite61=|ULTIMATE.start_main_#t~ite61_Out1460982518|, ~y$w_buff0_used~0=~y$w_buff0_used~0_In1460982518, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In1460982518, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In1460982518, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1460982518} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite61] because there is no mapped edge [2019-12-07 18:20:55,670 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [963] [963] L848-->L848-2: Formula: (let ((.cse0 (= 0 (mod ~y$w_buff0_used~0_In1369605376 256))) (.cse1 (= (mod ~y$r_buff0_thd0~0_In1369605376 256) 0))) (or (and (or .cse0 .cse1) (= ~y$r_buff0_thd0~0_In1369605376 |ULTIMATE.start_main_#t~ite62_Out1369605376|)) (and (= 0 |ULTIMATE.start_main_#t~ite62_Out1369605376|) (not .cse0) (not .cse1)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In1369605376, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In1369605376} OutVars{ULTIMATE.start_main_#t~ite62=|ULTIMATE.start_main_#t~ite62_Out1369605376|, ~y$w_buff0_used~0=~y$w_buff0_used~0_In1369605376, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In1369605376} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite62] because there is no mapped edge [2019-12-07 18:20:55,671 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [950] [950] L849-->L849-2: Formula: (let ((.cse3 (= 0 (mod ~y$r_buff0_thd0~0_In386743935 256))) (.cse2 (= 0 (mod ~y$w_buff0_used~0_In386743935 256))) (.cse0 (= (mod ~y$w_buff1_used~0_In386743935 256) 0)) (.cse1 (= (mod ~y$r_buff1_thd0~0_In386743935 256) 0))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= |ULTIMATE.start_main_#t~ite63_Out386743935| 0)) (and (or .cse3 .cse2) (or .cse0 .cse1) (= ~y$r_buff1_thd0~0_In386743935 |ULTIMATE.start_main_#t~ite63_Out386743935|)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In386743935, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In386743935, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In386743935, ~y$w_buff1_used~0=~y$w_buff1_used~0_In386743935} OutVars{ULTIMATE.start_main_#t~ite63=|ULTIMATE.start_main_#t~ite63_Out386743935|, ~y$w_buff0_used~0=~y$w_buff0_used~0_In386743935, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In386743935, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In386743935, ~y$w_buff1_used~0=~y$w_buff1_used~0_In386743935} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite63] because there is no mapped edge [2019-12-07 18:20:55,671 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1006] [1006] L849-2-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= v_~y$r_buff1_thd0~0_245 |v_ULTIMATE.start_main_#t~ite63_46|) (= v_~main$tmp_guard1~0_20 (ite (= (ite (not (and (= 0 v_~__unbuffered_p0_EAX~0_26) (= 1 v_~__unbuffered_p2_EAX~0_21) (= v_~__unbuffered_p1_EBX~0_25 0) (= 1 v_~__unbuffered_p1_EAX~0_47) (= v_~__unbuffered_p2_EBX~0_24 0))) 1 0) 0) 0 1)) (= |v_ULTIMATE.start___VERIFIER_assert_#in~expression_10| (mod v_~main$tmp_guard1~0_20 256)) (= v_ULTIMATE.start___VERIFIER_assert_~expression_15 0) (= v_ULTIMATE.start___VERIFIER_assert_~expression_15 |v_ULTIMATE.start___VERIFIER_assert_#in~expression_10|)) InVars {ULTIMATE.start_main_#t~ite63=|v_ULTIMATE.start_main_#t~ite63_46|, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_26, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_25, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_24, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_47, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_21} OutVars{ULTIMATE.start_main_#t~ite63=|v_ULTIMATE.start_main_#t~ite63_45|, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_26, ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_15, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_25, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_24, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_47, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_20, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_21, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_245, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_10|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite63, ULTIMATE.start___VERIFIER_assert_~expression, ~main$tmp_guard1~0, ~y$r_buff1_thd0~0, ULTIMATE.start___VERIFIER_assert_#in~expression] because there is no mapped edge [2019-12-07 18:20:55,732 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 07.12 06:20:55 BasicIcfg [2019-12-07 18:20:55,732 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-07 18:20:55,732 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-12-07 18:20:55,732 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-12-07 18:20:55,732 INFO L275 PluginConnector]: Witness Printer initialized [2019-12-07 18:20:55,733 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 06:20:34" (3/4) ... [2019-12-07 18:20:55,734 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2019-12-07 18:20:55,735 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1028] [1028] ULTIMATE.startENTRY-->L835: Formula: (let ((.cse0 (store |v_#valid_106| 0 0))) (and (= v_~y$flush_delayed~0_334 0) (= 0 v_~y$read_delayed_var~0.offset_7) (= v_~y$r_buff0_thd0~0_211 0) (= |v_#NULL.offset_7| 0) (= v_~y$w_buff0_used~0_972 0) (= v_~y$w_buff1~0_277 0) (= (store .cse0 |v_ULTIMATE.start_main_~#t86~0.base_69| 1) |v_#valid_104|) (= v_~y$read_delayed~0_7 0) (= v_~main$tmp_guard1~0_59 0) (= 0 v_~y$r_buff0_thd2~0_408) (= v_~y$r_buff1_thd0~0_314 0) (= v_~y$w_buff1_used~0_548 0) (< 0 |v_#StackHeapBarrier_16|) (= v_~y$r_buff1_thd1~0_221 0) (= v_~__unbuffered_cnt~0_149 0) (= v_~y$r_buff0_thd1~0_150 0) (= v_~y$mem_tmp~0_266 0) (= 0 v_~__unbuffered_p0_EAX~0_59) (< |v_#StackHeapBarrier_16| |v_ULTIMATE.start_main_~#t86~0.base_69|) (= v_~y~0_368 0) (= (store |v_#memory_int_20| |v_ULTIMATE.start_main_~#t86~0.base_69| (store (select |v_#memory_int_20| |v_ULTIMATE.start_main_~#t86~0.base_69|) |v_ULTIMATE.start_main_~#t86~0.offset_41| 0)) |v_#memory_int_19|) (= v_~main$tmp_guard0~0_20 0) (= 0 v_~y$r_buff0_thd3~0_638) (= 0 v_~y$read_delayed_var~0.base_7) (= 0 |v_#NULL.base_7|) (= 0 v_~weak$$choice0~0_253) (= v_~z~0_27 0) (= 0 v_~y$w_buff0~0_388) (= 0 v_~__unbuffered_p2_EAX~0_67) (= |v_ULTIMATE.start_main_~#t86~0.offset_41| 0) (= 0 v_~y$r_buff1_thd3~0_405) (= 0 v_~y$r_buff1_thd2~0_395) (= v_~__unbuffered_p1_EBX~0_68 0) (= v_~weak$$choice2~0_330 0) (= 0 (select .cse0 |v_ULTIMATE.start_main_~#t86~0.base_69|)) (= |v_#length_21| (store |v_#length_22| |v_ULTIMATE.start_main_~#t86~0.base_69| 4)) (= 0 v_~__unbuffered_p1_EAX~0_81) (= v_~__unbuffered_p2_EBX~0_61 0) (= v_~x~0_47 0))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_16|, #valid=|v_#valid_106|, #memory_int=|v_#memory_int_20|, #length=|v_#length_22|} OutVars{ULTIMATE.start_main_#t~nondet57=|v_ULTIMATE.start_main_#t~nondet57_18|, ULTIMATE.start_main_#t~nondet55=|v_ULTIMATE.start_main_#t~nondet55_8|, #NULL.offset=|v_#NULL.offset_7|, ULTIMATE.start_main_~#t86~0.base=|v_ULTIMATE.start_main_~#t86~0.base_69|, ~y$read_delayed~0=v_~y$read_delayed~0_7, ~y$mem_tmp~0=v_~y$mem_tmp~0_266, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_59, ~y$r_buff1_thd3~0=v_~y$r_buff1_thd3~0_405, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_81, ~y$r_buff0_thd1~0=v_~y$r_buff0_thd1~0_150, ~y$flush_delayed~0=v_~y$flush_delayed~0_334, ULTIMATE.start_main_~#t88~0.offset=|v_ULTIMATE.start_main_~#t88~0.offset_14|, #length=|v_#length_21|, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_67, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_61, ULTIMATE.start_main_#t~ite58=|v_ULTIMATE.start_main_#t~ite58_54|, ULTIMATE.start_main_~#t87~0.offset=|v_ULTIMATE.start_main_~#t87~0.offset_41|, ULTIMATE.start_main_#t~ite63=|v_ULTIMATE.start_main_#t~ite63_117|, ~weak$$choice0~0=v_~weak$$choice0~0_253, #StackHeapBarrier=|v_#StackHeapBarrier_16|, ULTIMATE.start_main_#t~ite61=|v_ULTIMATE.start_main_#t~ite61_40|, ~y$w_buff1~0=v_~y$w_buff1~0_277, ~y$read_delayed_var~0.base=v_~y$read_delayed_var~0.base_7, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_408, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_149, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_314, ~x~0=v_~x~0_47, ULTIMATE.start_main_~#t86~0.offset=|v_ULTIMATE.start_main_~#t86~0.offset_41|, ULTIMATE.start_main_~#t88~0.base=|v_ULTIMATE.start_main_~#t88~0.base_43|, ~y$read_delayed_var~0.offset=v_~y$read_delayed_var~0.offset_7, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_972, ULTIMATE.start_main_#t~nondet56=|v_ULTIMATE.start_main_#t~nondet56_9|, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_59, ~y$r_buff1_thd1~0=v_~y$r_buff1_thd1~0_221, ~y$w_buff0~0=v_~y$w_buff0~0_388, ~y$r_buff0_thd3~0=v_~y$r_buff0_thd3~0_638, ULTIMATE.start_main_~#t87~0.base=|v_ULTIMATE.start_main_~#t87~0.base_70|, ~y~0=v_~y~0_368, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_68, ULTIMATE.start_main_#t~ite59=|v_ULTIMATE.start_main_#t~ite59_74|, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_20, #NULL.base=|v_#NULL.base_7|, ULTIMATE.start_main_#t~ite62=|v_ULTIMATE.start_main_#t~ite62_28|, ~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_395, ULTIMATE.start_main_#t~ite60=|v_ULTIMATE.start_main_#t~ite60_478|, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_43|, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_211, #valid=|v_#valid_104|, #memory_int=|v_#memory_int_19|, ~z~0=v_~z~0_27, ~weak$$choice2~0=v_~weak$$choice2~0_330, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_548} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet57, ULTIMATE.start_main_#t~nondet55, #NULL.offset, ULTIMATE.start_main_~#t86~0.base, ~y$read_delayed~0, ~y$mem_tmp~0, ~__unbuffered_p0_EAX~0, ~y$r_buff1_thd3~0, ~__unbuffered_p1_EAX~0, ~y$r_buff0_thd1~0, ~y$flush_delayed~0, ULTIMATE.start_main_~#t88~0.offset, #length, ~__unbuffered_p2_EAX~0, ~__unbuffered_p2_EBX~0, ULTIMATE.start_main_#t~ite58, ULTIMATE.start_main_~#t87~0.offset, ULTIMATE.start_main_#t~ite63, ~weak$$choice0~0, ULTIMATE.start_main_#t~ite61, ~y$w_buff1~0, ~y$read_delayed_var~0.base, ~y$r_buff0_thd2~0, ~__unbuffered_cnt~0, ~y$r_buff1_thd0~0, ~x~0, ULTIMATE.start_main_~#t86~0.offset, ULTIMATE.start_main_~#t88~0.base, ~y$read_delayed_var~0.offset, ~y$w_buff0_used~0, ULTIMATE.start_main_#t~nondet56, ~main$tmp_guard1~0, ~y$r_buff1_thd1~0, ~y$w_buff0~0, ~y$r_buff0_thd3~0, ULTIMATE.start_main_~#t87~0.base, ~y~0, ~__unbuffered_p1_EBX~0, ULTIMATE.start_main_#t~ite59, ~main$tmp_guard0~0, #NULL.base, ULTIMATE.start_main_#t~ite62, ~y$r_buff1_thd2~0, ULTIMATE.start_main_#t~ite60, ULTIMATE.start_main_#res, ~y$r_buff0_thd0~0, #valid, #memory_int, ~z~0, ~weak$$choice2~0, ~y$w_buff1_used~0] because there is no mapped edge [2019-12-07 18:20:55,735 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1004] [1004] L835-1-->L837: Formula: (and (< |v_#StackHeapBarrier_10| |v_ULTIMATE.start_main_~#t87~0.base_12|) (= 0 (select |v_#valid_37| |v_ULTIMATE.start_main_~#t87~0.base_12|)) (= (store |v_#length_16| |v_ULTIMATE.start_main_~#t87~0.base_12| 4) |v_#length_15|) (not (= |v_ULTIMATE.start_main_~#t87~0.base_12| 0)) (= (store |v_#memory_int_14| |v_ULTIMATE.start_main_~#t87~0.base_12| (store (select |v_#memory_int_14| |v_ULTIMATE.start_main_~#t87~0.base_12|) |v_ULTIMATE.start_main_~#t87~0.offset_10| 1)) |v_#memory_int_13|) (= |v_ULTIMATE.start_main_~#t87~0.offset_10| 0) (= |v_#valid_36| (store |v_#valid_37| |v_ULTIMATE.start_main_~#t87~0.base_12| 1))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_10|, #valid=|v_#valid_37|, #memory_int=|v_#memory_int_14|, #length=|v_#length_16|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_10|, ULTIMATE.start_main_#t~nondet55=|v_ULTIMATE.start_main_#t~nondet55_4|, ULTIMATE.start_main_~#t87~0.base=|v_ULTIMATE.start_main_~#t87~0.base_12|, #valid=|v_#valid_36|, #memory_int=|v_#memory_int_13|, #length=|v_#length_15|, ULTIMATE.start_main_~#t87~0.offset=|v_ULTIMATE.start_main_~#t87~0.offset_10|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet55, ULTIMATE.start_main_~#t87~0.base, #valid, #memory_int, #length, ULTIMATE.start_main_~#t87~0.offset] because there is no mapped edge [2019-12-07 18:20:55,735 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1000] [1000] L837-1-->L839: Formula: (and (= |v_#memory_int_11| (store |v_#memory_int_12| |v_ULTIMATE.start_main_~#t88~0.base_11| (store (select |v_#memory_int_12| |v_ULTIMATE.start_main_~#t88~0.base_11|) |v_ULTIMATE.start_main_~#t88~0.offset_9| 2))) (= 0 (select |v_#valid_33| |v_ULTIMATE.start_main_~#t88~0.base_11|)) (not (= 0 |v_ULTIMATE.start_main_~#t88~0.base_11|)) (= (store |v_#valid_33| |v_ULTIMATE.start_main_~#t88~0.base_11| 1) |v_#valid_32|) (= |v_ULTIMATE.start_main_~#t88~0.offset_9| 0) (< |v_#StackHeapBarrier_8| |v_ULTIMATE.start_main_~#t88~0.base_11|) (= (store |v_#length_14| |v_ULTIMATE.start_main_~#t88~0.base_11| 4) |v_#length_13|)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_8|, #valid=|v_#valid_33|, #memory_int=|v_#memory_int_12|, #length=|v_#length_14|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_8|, #valid=|v_#valid_32|, ULTIMATE.start_main_#t~nondet56=|v_ULTIMATE.start_main_#t~nondet56_5|, #memory_int=|v_#memory_int_11|, ULTIMATE.start_main_~#t88~0.offset=|v_ULTIMATE.start_main_~#t88~0.offset_9|, #length=|v_#length_13|, ULTIMATE.start_main_~#t88~0.base=|v_ULTIMATE.start_main_~#t88~0.base_11|} AuxVars[] AssignedVars[#valid, ULTIMATE.start_main_#t~nondet56, #memory_int, ULTIMATE.start_main_~#t88~0.offset, #length, ULTIMATE.start_main_~#t88~0.base] because there is no mapped edge [2019-12-07 18:20:55,736 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [876] [876] P2ENTRY-->L4-3: Formula: (and (= v_~y$w_buff1_used~0_65 v_~y$w_buff0_used~0_118) (not (= 0 v_P2Thread1of1ForFork0___VERIFIER_assert_~expression_16)) (= v_P2Thread1of1ForFork0___VERIFIER_assert_~expression_16 |v_P2Thread1of1ForFork0___VERIFIER_assert_#in~expression_14|) (= 1 v_~y$w_buff0~0_43) (= (ite (not (and (not (= (mod v_~y$w_buff1_used~0_65 256) 0)) (not (= (mod v_~y$w_buff0_used~0_117 256) 0)))) 1 0) |v_P2Thread1of1ForFork0___VERIFIER_assert_#in~expression_14|) (= |v_P2Thread1of1ForFork0_#in~arg.offset_16| v_P2Thread1of1ForFork0_~arg.offset_14) (= v_~y$w_buff0_used~0_117 1) (= v_~y$w_buff0~0_44 v_~y$w_buff1~0_29) (= |v_P2Thread1of1ForFork0_#in~arg.base_16| v_P2Thread1of1ForFork0_~arg.base_14)) InVars {P2Thread1of1ForFork0_#in~arg.offset=|v_P2Thread1of1ForFork0_#in~arg.offset_16|, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_118, ~y$w_buff0~0=v_~y$w_buff0~0_44, P2Thread1of1ForFork0_#in~arg.base=|v_P2Thread1of1ForFork0_#in~arg.base_16|} OutVars{P2Thread1of1ForFork0_~arg.base=v_P2Thread1of1ForFork0_~arg.base_14, P2Thread1of1ForFork0_#in~arg.offset=|v_P2Thread1of1ForFork0_#in~arg.offset_16|, P2Thread1of1ForFork0___VERIFIER_assert_#in~expression=|v_P2Thread1of1ForFork0___VERIFIER_assert_#in~expression_14|, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_117, ~y$w_buff1~0=v_~y$w_buff1~0_29, ~y$w_buff0~0=v_~y$w_buff0~0_43, P2Thread1of1ForFork0_~arg.offset=v_P2Thread1of1ForFork0_~arg.offset_14, P2Thread1of1ForFork0_#in~arg.base=|v_P2Thread1of1ForFork0_#in~arg.base_16|, P2Thread1of1ForFork0___VERIFIER_assert_~expression=v_P2Thread1of1ForFork0___VERIFIER_assert_~expression_16, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_65} AuxVars[] AssignedVars[P2Thread1of1ForFork0_~arg.base, P2Thread1of1ForFork0___VERIFIER_assert_#in~expression, ~y$w_buff0_used~0, ~y$w_buff1~0, ~y$w_buff0~0, P2Thread1of1ForFork0_~arg.offset, P2Thread1of1ForFork0___VERIFIER_assert_~expression, ~y$w_buff1_used~0] because there is no mapped edge [2019-12-07 18:20:55,736 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [958] [958] L797-2-->L797-4: Formula: (let ((.cse1 (= (mod ~y$r_buff0_thd3~0_In1850866195 256) 0)) (.cse0 (= (mod ~y$w_buff0_used~0_In1850866195 256) 0))) (or (and (= |P2Thread1of1ForFork0_#t~ite28_Out1850866195| ~y$w_buff0~0_In1850866195) (not .cse0) (not .cse1)) (and (= |P2Thread1of1ForFork0_#t~ite28_Out1850866195| ~y$w_buff1~0_In1850866195) (or .cse1 .cse0)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In1850866195, ~y$w_buff1~0=~y$w_buff1~0_In1850866195, ~y$w_buff0~0=~y$w_buff0~0_In1850866195, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In1850866195} OutVars{P2Thread1of1ForFork0_#t~ite28=|P2Thread1of1ForFork0_#t~ite28_Out1850866195|, ~y$w_buff0_used~0=~y$w_buff0_used~0_In1850866195, ~y$w_buff1~0=~y$w_buff1~0_In1850866195, ~y$w_buff0~0=~y$w_buff0~0_In1850866195, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In1850866195} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite28] because there is no mapped edge [2019-12-07 18:20:55,736 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [912] [912] L797-4-->L798: Formula: (= v_~y~0_64 |v_P2Thread1of1ForFork0_#t~ite28_6|) InVars {P2Thread1of1ForFork0_#t~ite28=|v_P2Thread1of1ForFork0_#t~ite28_6|} OutVars{P2Thread1of1ForFork0_#t~ite28=|v_P2Thread1of1ForFork0_#t~ite28_5|, P2Thread1of1ForFork0_#t~ite29=|v_P2Thread1of1ForFork0_#t~ite29_5|, ~y~0=v_~y~0_64} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite28, P2Thread1of1ForFork0_#t~ite29, ~y~0] because there is no mapped edge [2019-12-07 18:20:55,739 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [915] [915] L802-->L803: Formula: (and (= v_~y$r_buff0_thd3~0_173 v_~y$r_buff0_thd3~0_172) (not (= 0 (mod v_~weak$$choice2~0_74 256)))) InVars {~y$r_buff0_thd3~0=v_~y$r_buff0_thd3~0_173, ~weak$$choice2~0=v_~weak$$choice2~0_74} OutVars{P2Thread1of1ForFork0_#t~ite44=|v_P2Thread1of1ForFork0_#t~ite44_8|, P2Thread1of1ForFork0_#t~ite43=|v_P2Thread1of1ForFork0_#t~ite43_10|, ~y$r_buff0_thd3~0=v_~y$r_buff0_thd3~0_172, P2Thread1of1ForFork0_#t~ite42=|v_P2Thread1of1ForFork0_#t~ite42_11|, ~weak$$choice2~0=v_~weak$$choice2~0_74} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite44, P2Thread1of1ForFork0_#t~ite43, ~y$r_buff0_thd3~0, P2Thread1of1ForFork0_#t~ite42] because there is no mapped edge [2019-12-07 18:20:55,740 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [948] [948] L805-->L805-2: Formula: (let ((.cse0 (= (mod ~y$flush_delayed~0_In-1135351185 256) 0))) (or (and (= |P2Thread1of1ForFork0_#t~ite48_Out-1135351185| ~y~0_In-1135351185) .cse0) (and (= |P2Thread1of1ForFork0_#t~ite48_Out-1135351185| ~y$mem_tmp~0_In-1135351185) (not .cse0)))) InVars {~y$mem_tmp~0=~y$mem_tmp~0_In-1135351185, ~y$flush_delayed~0=~y$flush_delayed~0_In-1135351185, ~y~0=~y~0_In-1135351185} OutVars{P2Thread1of1ForFork0_#t~ite48=|P2Thread1of1ForFork0_#t~ite48_Out-1135351185|, ~y$mem_tmp~0=~y$mem_tmp~0_In-1135351185, ~y$flush_delayed~0=~y$flush_delayed~0_In-1135351185, ~y~0=~y~0_In-1135351185} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite48] because there is no mapped edge [2019-12-07 18:20:55,740 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [993] [993] P0ENTRY-->P0EXIT: Formula: (and (= |v_P0Thread1of1ForFork1_#in~arg.base_11| v_P0Thread1of1ForFork1_~arg.base_9) (= v_~__unbuffered_cnt~0_102 (+ v_~__unbuffered_cnt~0_103 1)) (= v_P0Thread1of1ForFork1_~arg.offset_9 |v_P0Thread1of1ForFork1_#in~arg.offset_11|) (= v_~z~0_15 1) (= 0 |v_P0Thread1of1ForFork1_#res.offset_7|) (= v_~x~0_38 v_~__unbuffered_p0_EAX~0_22) (= 0 |v_P0Thread1of1ForFork1_#res.base_7|)) InVars {P0Thread1of1ForFork1_#in~arg.offset=|v_P0Thread1of1ForFork1_#in~arg.offset_11|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_103, P0Thread1of1ForFork1_#in~arg.base=|v_P0Thread1of1ForFork1_#in~arg.base_11|, ~x~0=v_~x~0_38} OutVars{~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_22, P0Thread1of1ForFork1_#res.offset=|v_P0Thread1of1ForFork1_#res.offset_7|, P0Thread1of1ForFork1_#in~arg.offset=|v_P0Thread1of1ForFork1_#in~arg.offset_11|, P0Thread1of1ForFork1_#res.base=|v_P0Thread1of1ForFork1_#res.base_7|, P0Thread1of1ForFork1_~arg.offset=v_P0Thread1of1ForFork1_~arg.offset_9, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_102, ~z~0=v_~z~0_15, P0Thread1of1ForFork1_#in~arg.base=|v_P0Thread1of1ForFork1_#in~arg.base_11|, ~x~0=v_~x~0_38, P0Thread1of1ForFork1_~arg.base=v_P0Thread1of1ForFork1_~arg.base_9} AuxVars[] AssignedVars[~__unbuffered_p0_EAX~0, P0Thread1of1ForFork1_#res.offset, P0Thread1of1ForFork1_#res.base, P0Thread1of1ForFork1_~arg.offset, ~__unbuffered_cnt~0, ~z~0, P0Thread1of1ForFork1_~arg.base] because there is no mapped edge [2019-12-07 18:20:55,745 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [961] [961] L768-->L768-2: Formula: (let ((.cse0 (= 0 (mod ~y$flush_delayed~0_In-560489104 256)))) (or (and (= |P1Thread1of1ForFork2_#t~ite25_Out-560489104| ~y$mem_tmp~0_In-560489104) (not .cse0)) (and .cse0 (= |P1Thread1of1ForFork2_#t~ite25_Out-560489104| ~y~0_In-560489104)))) InVars {~y$mem_tmp~0=~y$mem_tmp~0_In-560489104, ~y$flush_delayed~0=~y$flush_delayed~0_In-560489104, ~y~0=~y~0_In-560489104} OutVars{~y$mem_tmp~0=~y$mem_tmp~0_In-560489104, ~y$flush_delayed~0=~y$flush_delayed~0_In-560489104, ~y~0=~y~0_In-560489104, P1Thread1of1ForFork2_#t~ite25=|P1Thread1of1ForFork2_#t~ite25_Out-560489104|} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#t~ite25] because there is no mapped edge [2019-12-07 18:20:55,745 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1002] [1002] L768-2-->P1EXIT: Formula: (and (= 0 |v_P1Thread1of1ForFork2_#res.offset_3|) (= 0 |v_P1Thread1of1ForFork2_#res.base_3|) (= v_~y~0_266 |v_P1Thread1of1ForFork2_#t~ite25_114|) (= v_~__unbuffered_cnt~0_136 (+ v_~__unbuffered_cnt~0_137 1)) (= v_~y$flush_delayed~0_286 0)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_137, P1Thread1of1ForFork2_#t~ite25=|v_P1Thread1of1ForFork2_#t~ite25_114|} OutVars{P1Thread1of1ForFork2_#res.offset=|v_P1Thread1of1ForFork2_#res.offset_3|, ~y$flush_delayed~0=v_~y$flush_delayed~0_286, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_136, ~y~0=v_~y~0_266, P1Thread1of1ForFork2_#res.base=|v_P1Thread1of1ForFork2_#res.base_3|, P1Thread1of1ForFork2_#t~ite25=|v_P1Thread1of1ForFork2_#t~ite25_113|} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#res.offset, ~y$flush_delayed~0, ~__unbuffered_cnt~0, ~y~0, P1Thread1of1ForFork2_#res.base, P1Thread1of1ForFork2_#t~ite25] because there is no mapped edge [2019-12-07 18:20:55,746 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [962] [962] L813-->L813-2: Formula: (let ((.cse1 (= (mod ~y$r_buff0_thd3~0_In1841889519 256) 0)) (.cse0 (= 0 (mod ~y$w_buff0_used~0_In1841889519 256)))) (or (and (= 0 |P2Thread1of1ForFork0_#t~ite51_Out1841889519|) (not .cse0) (not .cse1)) (and (or .cse1 .cse0) (= ~y$w_buff0_used~0_In1841889519 |P2Thread1of1ForFork0_#t~ite51_Out1841889519|)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In1841889519, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In1841889519} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In1841889519, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In1841889519, P2Thread1of1ForFork0_#t~ite51=|P2Thread1of1ForFork0_#t~ite51_Out1841889519|} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite51] because there is no mapped edge [2019-12-07 18:20:55,746 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [960] [960] L814-->L814-2: Formula: (let ((.cse2 (= (mod ~y$w_buff0_used~0_In-1753633772 256) 0)) (.cse3 (= 0 (mod ~y$r_buff0_thd3~0_In-1753633772 256))) (.cse1 (= 0 (mod ~y$w_buff1_used~0_In-1753633772 256))) (.cse0 (= (mod ~y$r_buff1_thd3~0_In-1753633772 256) 0))) (or (and (or .cse0 .cse1) (or .cse2 .cse3) (= |P2Thread1of1ForFork0_#t~ite52_Out-1753633772| ~y$w_buff1_used~0_In-1753633772)) (and (= |P2Thread1of1ForFork0_#t~ite52_Out-1753633772| 0) (or (and (not .cse2) (not .cse3)) (and (not .cse1) (not .cse0)))))) InVars {~y$r_buff1_thd3~0=~y$r_buff1_thd3~0_In-1753633772, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-1753633772, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In-1753633772, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1753633772} OutVars{~y$r_buff1_thd3~0=~y$r_buff1_thd3~0_In-1753633772, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-1753633772, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In-1753633772, P2Thread1of1ForFork0_#t~ite52=|P2Thread1of1ForFork0_#t~ite52_Out-1753633772|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1753633772} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite52] because there is no mapped edge [2019-12-07 18:20:55,747 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [952] [952] L815-->L816: Formula: (let ((.cse0 (= 0 (mod ~y$w_buff0_used~0_In-2042044204 256))) (.cse2 (= ~y$r_buff0_thd3~0_In-2042044204 ~y$r_buff0_thd3~0_Out-2042044204)) (.cse1 (= (mod ~y$r_buff0_thd3~0_In-2042044204 256) 0))) (or (and (= ~y$r_buff0_thd3~0_Out-2042044204 0) (not .cse0) (not .cse1)) (and .cse0 .cse2) (and .cse2 .cse1))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-2042044204, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In-2042044204} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-2042044204, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_Out-2042044204, P2Thread1of1ForFork0_#t~ite53=|P2Thread1of1ForFork0_#t~ite53_Out-2042044204|} AuxVars[] AssignedVars[~y$r_buff0_thd3~0, P2Thread1of1ForFork0_#t~ite53] because there is no mapped edge [2019-12-07 18:20:55,747 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [951] [951] L816-->L816-2: Formula: (let ((.cse0 (= (mod ~y$w_buff0_used~0_In-1907151461 256) 0)) (.cse1 (= 0 (mod ~y$r_buff0_thd3~0_In-1907151461 256))) (.cse3 (= (mod ~y$r_buff1_thd3~0_In-1907151461 256) 0)) (.cse2 (= 0 (mod ~y$w_buff1_used~0_In-1907151461 256)))) (or (and (or .cse0 .cse1) (= ~y$r_buff1_thd3~0_In-1907151461 |P2Thread1of1ForFork0_#t~ite54_Out-1907151461|) (or .cse2 .cse3)) (and (= 0 |P2Thread1of1ForFork0_#t~ite54_Out-1907151461|) (or (and (not .cse0) (not .cse1)) (and (not .cse3) (not .cse2)))))) InVars {~y$r_buff1_thd3~0=~y$r_buff1_thd3~0_In-1907151461, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-1907151461, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In-1907151461, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1907151461} OutVars{~y$r_buff1_thd3~0=~y$r_buff1_thd3~0_In-1907151461, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-1907151461, P2Thread1of1ForFork0_#t~ite54=|P2Thread1of1ForFork0_#t~ite54_Out-1907151461|, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In-1907151461, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1907151461} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite54] because there is no mapped edge [2019-12-07 18:20:55,747 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [983] [983] L816-2-->P2EXIT: Formula: (and (= |v_P2Thread1of1ForFork0_#res.base_3| 0) (= (+ v_~__unbuffered_cnt~0_89 1) v_~__unbuffered_cnt~0_88) (= |v_P2Thread1of1ForFork0_#res.offset_3| 0) (= v_~y$r_buff1_thd3~0_178 |v_P2Thread1of1ForFork0_#t~ite54_30|)) InVars {P2Thread1of1ForFork0_#t~ite54=|v_P2Thread1of1ForFork0_#t~ite54_30|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_89} OutVars{~y$r_buff1_thd3~0=v_~y$r_buff1_thd3~0_178, P2Thread1of1ForFork0_#res.base=|v_P2Thread1of1ForFork0_#res.base_3|, P2Thread1of1ForFork0_#t~ite54=|v_P2Thread1of1ForFork0_#t~ite54_29|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_88, P2Thread1of1ForFork0_#res.offset=|v_P2Thread1of1ForFork0_#res.offset_3|} AuxVars[] AssignedVars[~y$r_buff1_thd3~0, P2Thread1of1ForFork0_#res.base, P2Thread1of1ForFork0_#t~ite54, ~__unbuffered_cnt~0, P2Thread1of1ForFork0_#res.offset] because there is no mapped edge [2019-12-07 18:20:55,747 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [943] [943] L839-1-->L845: Formula: (and (not (= 0 (mod v_~main$tmp_guard0~0_9 256))) (= v_~main$tmp_guard0~0_9 (ite (= 0 (ite (= 3 v_~__unbuffered_cnt~0_58) 1 0)) 0 1))) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_58} OutVars{ULTIMATE.start_main_#t~nondet57=|v_ULTIMATE.start_main_#t~nondet57_7|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_58, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_9} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet57, ~main$tmp_guard0~0] because there is no mapped edge [2019-12-07 18:20:55,748 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [945] [945] L845-2-->L845-5: Formula: (let ((.cse0 (= 0 (mod ~y$w_buff1_used~0_In1882504871 256))) (.cse2 (= 0 (mod ~y$r_buff1_thd0~0_In1882504871 256))) (.cse1 (= |ULTIMATE.start_main_#t~ite58_Out1882504871| |ULTIMATE.start_main_#t~ite59_Out1882504871|))) (or (and (= |ULTIMATE.start_main_#t~ite58_Out1882504871| ~y$w_buff1~0_In1882504871) (not .cse0) .cse1 (not .cse2)) (and (or .cse0 .cse2) (= |ULTIMATE.start_main_#t~ite58_Out1882504871| ~y~0_In1882504871) .cse1))) InVars {~y$w_buff1~0=~y$w_buff1~0_In1882504871, ~y~0=~y~0_In1882504871, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In1882504871, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1882504871} OutVars{~y$w_buff1~0=~y$w_buff1~0_In1882504871, ULTIMATE.start_main_#t~ite58=|ULTIMATE.start_main_#t~ite58_Out1882504871|, ULTIMATE.start_main_#t~ite59=|ULTIMATE.start_main_#t~ite59_Out1882504871|, ~y~0=~y~0_In1882504871, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In1882504871, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1882504871} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite58, ULTIMATE.start_main_#t~ite59] because there is no mapped edge [2019-12-07 18:20:55,748 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [964] [964] L846-->L846-2: Formula: (let ((.cse0 (= (mod ~y$w_buff0_used~0_In-202943053 256) 0)) (.cse1 (= 0 (mod ~y$r_buff0_thd0~0_In-202943053 256)))) (or (and (or .cse0 .cse1) (= ~y$w_buff0_used~0_In-202943053 |ULTIMATE.start_main_#t~ite60_Out-202943053|)) (and (not .cse0) (not .cse1) (= 0 |ULTIMATE.start_main_#t~ite60_Out-202943053|)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-202943053, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-202943053} OutVars{ULTIMATE.start_main_#t~ite60=|ULTIMATE.start_main_#t~ite60_Out-202943053|, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-202943053, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-202943053} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite60] because there is no mapped edge [2019-12-07 18:20:55,748 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [946] [946] L847-->L847-2: Formula: (let ((.cse2 (= 0 (mod ~y$w_buff1_used~0_In1460982518 256))) (.cse3 (= (mod ~y$r_buff1_thd0~0_In1460982518 256) 0)) (.cse0 (= (mod ~y$r_buff0_thd0~0_In1460982518 256) 0)) (.cse1 (= (mod ~y$w_buff0_used~0_In1460982518 256) 0))) (or (and (or .cse0 .cse1) (or .cse2 .cse3) (= |ULTIMATE.start_main_#t~ite61_Out1460982518| ~y$w_buff1_used~0_In1460982518)) (and (or (and (not .cse2) (not .cse3)) (and (not .cse0) (not .cse1))) (= |ULTIMATE.start_main_#t~ite61_Out1460982518| 0)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In1460982518, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In1460982518, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In1460982518, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1460982518} OutVars{ULTIMATE.start_main_#t~ite61=|ULTIMATE.start_main_#t~ite61_Out1460982518|, ~y$w_buff0_used~0=~y$w_buff0_used~0_In1460982518, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In1460982518, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In1460982518, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1460982518} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite61] because there is no mapped edge [2019-12-07 18:20:55,749 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [963] [963] L848-->L848-2: Formula: (let ((.cse0 (= 0 (mod ~y$w_buff0_used~0_In1369605376 256))) (.cse1 (= (mod ~y$r_buff0_thd0~0_In1369605376 256) 0))) (or (and (or .cse0 .cse1) (= ~y$r_buff0_thd0~0_In1369605376 |ULTIMATE.start_main_#t~ite62_Out1369605376|)) (and (= 0 |ULTIMATE.start_main_#t~ite62_Out1369605376|) (not .cse0) (not .cse1)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In1369605376, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In1369605376} OutVars{ULTIMATE.start_main_#t~ite62=|ULTIMATE.start_main_#t~ite62_Out1369605376|, ~y$w_buff0_used~0=~y$w_buff0_used~0_In1369605376, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In1369605376} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite62] because there is no mapped edge [2019-12-07 18:20:55,749 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [950] [950] L849-->L849-2: Formula: (let ((.cse3 (= 0 (mod ~y$r_buff0_thd0~0_In386743935 256))) (.cse2 (= 0 (mod ~y$w_buff0_used~0_In386743935 256))) (.cse0 (= (mod ~y$w_buff1_used~0_In386743935 256) 0)) (.cse1 (= (mod ~y$r_buff1_thd0~0_In386743935 256) 0))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= |ULTIMATE.start_main_#t~ite63_Out386743935| 0)) (and (or .cse3 .cse2) (or .cse0 .cse1) (= ~y$r_buff1_thd0~0_In386743935 |ULTIMATE.start_main_#t~ite63_Out386743935|)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In386743935, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In386743935, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In386743935, ~y$w_buff1_used~0=~y$w_buff1_used~0_In386743935} OutVars{ULTIMATE.start_main_#t~ite63=|ULTIMATE.start_main_#t~ite63_Out386743935|, ~y$w_buff0_used~0=~y$w_buff0_used~0_In386743935, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In386743935, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In386743935, ~y$w_buff1_used~0=~y$w_buff1_used~0_In386743935} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite63] because there is no mapped edge [2019-12-07 18:20:55,749 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1006] [1006] L849-2-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= v_~y$r_buff1_thd0~0_245 |v_ULTIMATE.start_main_#t~ite63_46|) (= v_~main$tmp_guard1~0_20 (ite (= (ite (not (and (= 0 v_~__unbuffered_p0_EAX~0_26) (= 1 v_~__unbuffered_p2_EAX~0_21) (= v_~__unbuffered_p1_EBX~0_25 0) (= 1 v_~__unbuffered_p1_EAX~0_47) (= v_~__unbuffered_p2_EBX~0_24 0))) 1 0) 0) 0 1)) (= |v_ULTIMATE.start___VERIFIER_assert_#in~expression_10| (mod v_~main$tmp_guard1~0_20 256)) (= v_ULTIMATE.start___VERIFIER_assert_~expression_15 0) (= v_ULTIMATE.start___VERIFIER_assert_~expression_15 |v_ULTIMATE.start___VERIFIER_assert_#in~expression_10|)) InVars {ULTIMATE.start_main_#t~ite63=|v_ULTIMATE.start_main_#t~ite63_46|, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_26, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_25, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_24, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_47, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_21} OutVars{ULTIMATE.start_main_#t~ite63=|v_ULTIMATE.start_main_#t~ite63_45|, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_26, ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_15, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_25, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_24, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_47, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_20, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_21, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_245, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_10|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite63, ULTIMATE.start___VERIFIER_assert_~expression, ~main$tmp_guard1~0, ~y$r_buff1_thd0~0, ULTIMATE.start___VERIFIER_assert_#in~expression] because there is no mapped edge [2019-12-07 18:20:55,810 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/run_dir_14244678-f1b6-458f-9803-0f7cda029d95/bin/uautomizer/witness.graphml [2019-12-07 18:20:55,810 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-12-07 18:20:55,811 INFO L168 Benchmark]: Toolchain (without parser) took 22700.13 ms. Allocated memory was 1.0 GB in the beginning and 3.0 GB in the end (delta: 2.0 GB). Free memory was 939.8 MB in the beginning and 2.5 GB in the end (delta: -1.5 GB). Peak memory consumption was 478.1 MB. Max. memory is 11.5 GB. [2019-12-07 18:20:55,811 INFO L168 Benchmark]: CDTParser took 0.20 ms. Allocated memory is still 1.0 GB. Free memory is still 961.3 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-12-07 18:20:55,812 INFO L168 Benchmark]: CACSL2BoogieTranslator took 399.40 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 99.6 MB). Free memory was 939.8 MB in the beginning and 1.1 GB in the end (delta: -121.0 MB). Peak memory consumption was 18.4 MB. Max. memory is 11.5 GB. [2019-12-07 18:20:55,812 INFO L168 Benchmark]: Boogie Procedure Inliner took 42.50 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 18:20:55,812 INFO L168 Benchmark]: Boogie Preprocessor took 28.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 18:20:55,812 INFO L168 Benchmark]: RCFGBuilder took 418.69 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 995.9 MB in the end (delta: 59.5 MB). Peak memory consumption was 59.5 MB. Max. memory is 11.5 GB. [2019-12-07 18:20:55,813 INFO L168 Benchmark]: TraceAbstraction took 21730.23 ms. Allocated memory was 1.1 GB in the beginning and 3.0 GB in the end (delta: 1.9 GB). Free memory was 995.9 MB in the beginning and 2.5 GB in the end (delta: -1.5 GB). Peak memory consumption was 382.9 MB. Max. memory is 11.5 GB. [2019-12-07 18:20:55,813 INFO L168 Benchmark]: Witness Printer took 77.91 ms. Allocated memory is still 3.0 GB. Free memory was 2.5 GB in the beginning and 2.5 GB in the end (delta: 51.7 MB). Peak memory consumption was 51.7 MB. Max. memory is 11.5 GB. [2019-12-07 18:20:55,814 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 961.3 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 399.40 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 99.6 MB). Free memory was 939.8 MB in the beginning and 1.1 GB in the end (delta: -121.0 MB). Peak memory consumption was 18.4 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 42.50 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. * Boogie Preprocessor took 28.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. * RCFGBuilder took 418.69 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 995.9 MB in the end (delta: 59.5 MB). Peak memory consumption was 59.5 MB. Max. memory is 11.5 GB. * TraceAbstraction took 21730.23 ms. Allocated memory was 1.1 GB in the beginning and 3.0 GB in the end (delta: 1.9 GB). Free memory was 995.9 MB in the beginning and 2.5 GB in the end (delta: -1.5 GB). Peak memory consumption was 382.9 MB. Max. memory is 11.5 GB. * Witness Printer took 77.91 ms. Allocated memory is still 3.0 GB. Free memory was 2.5 GB in the beginning and 2.5 GB in the end (delta: 51.7 MB). Peak memory consumption was 51.7 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks LbeTime: 3.8s, 196 ProgramPointsBefore, 105 ProgramPointsAfterwards, 242 TransitionsBefore, 127 TransitionsAfterwards, 24630 CoEnabledTransitionPairs, 7 FixpointIterations, 35 TrivialSequentialCompositions, 42 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 52 ConcurrentYvCompositions, 28 ChoiceCompositions, 9301 VarBasedMoverChecksPositive, 327 VarBasedMoverChecksNegative, 92 SemBasedMoverChecksPositive, 328 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 1.3s, 0 MoverChecksTotal, 123368 CheckedPairsTotal, 129 TotalNumberOfCompositions - CounterExampleResult [Line: 4]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L835] FCALL, FORK 0 pthread_create(&t86, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_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_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L837] FCALL, FORK 0 pthread_create(&t87, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0: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_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L839] FCALL, FORK 0 pthread_create(&t88, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0: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_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L786] 3 y$r_buff1_thd0 = y$r_buff0_thd0 [L787] 3 y$r_buff1_thd1 = y$r_buff0_thd1 [L788] 3 y$r_buff1_thd2 = y$r_buff0_thd2 [L789] 3 y$r_buff1_thd3 = y$r_buff0_thd3 [L790] 3 y$r_buff0_thd3 = (_Bool)1 [L793] 3 weak$$choice0 = __VERIFIER_nondet_bool() [L794] 3 weak$$choice2 = __VERIFIER_nondet_bool() [L795] 3 y$flush_delayed = weak$$choice2 [L796] 3 y$mem_tmp = y VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=3, weak$$choice2=1, x=0, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=0] [L797] 3 !y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y : (y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : y$w_buff1) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=3, weak$$choice2=1, x=0, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=0] [L798] EXPR 3 weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : y$w_buff0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=3, weak$$choice2=1, x=0, y=1, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=0] [L798] 3 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : y$w_buff0)) [L799] EXPR 3 weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff1 : y$w_buff1)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=3, weak$$choice2=1, x=0, y=1, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=0] [L799] 3 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff1 : y$w_buff1)) [L800] EXPR 3 weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=3, weak$$choice2=1, x=0, y=1, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=0] [L800] 3 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used)) [L801] EXPR 3 weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=3, weak$$choice2=1, x=0, y=1, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=0] [L801] 3 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L803] EXPR 3 weak$$choice2 ? y$r_buff1_thd3 : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$r_buff1_thd3 : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=3, weak$$choice2=1, x=0, y=1, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=0] [L803] 3 y$r_buff1_thd3 = weak$$choice2 ? y$r_buff1_thd3 : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$r_buff1_thd3 : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L804] 3 __unbuffered_p2_EAX = y VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=3, weak$$choice2=1, x=0, y=1, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=0] [L805] 3 y = y$flush_delayed ? y$mem_tmp : y [L806] 3 y$flush_delayed = (_Bool)0 [L809] 3 __unbuffered_p2_EBX = z VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=3, weak$$choice2=1, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=0] [L750] 2 x = 1 [L753] 2 __unbuffered_p1_EAX = x [L756] 2 weak$$choice0 = __VERIFIER_nondet_bool() [L757] 2 weak$$choice2 = __VERIFIER_nondet_bool() [L758] 2 y$flush_delayed = weak$$choice2 [L759] 2 y$mem_tmp = y VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=2, weak$$choice2=1, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L760] 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, \result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=2, weak$$choice2=1, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L760] 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) [L761] 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 [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=2, 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=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L761] 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)) [L762] EXPR 2 weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff1 : y$w_buff1)) VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=2, weak$$choice2=1, 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))=0, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L762] 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)) [L763] EXPR 2 weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used)) VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=2, weak$$choice2=1, 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))=1, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L763] 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)) [L764] EXPR 2 weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=2, weak$$choice2=1, weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0))=0, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L764] 2 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L765] EXPR 2 weak$$choice2 ? y$r_buff0_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff0_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2)) VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=2, weak$$choice2=1, weak$$choice2 ? y$r_buff0_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff0_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2))=0, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L765] 2 y$r_buff0_thd2 = weak$$choice2 ? y$r_buff0_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff0_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2)) [L766] EXPR 2 weak$$choice2 ? y$r_buff1_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff1_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=2, weak$$choice2=1, 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))=0, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L766] 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)) [L767] 2 __unbuffered_p1_EBX = y VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=2, weak$$choice2=1, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L812] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y) VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=2, weak$$choice2=1, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L812] 3 y = y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y) [L813] 3 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used [L814] 3 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$w_buff1_used [L845] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=2, weak$$choice2=1, x=1, y=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L845] 0 y = y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) [L846] 0 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L847] 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 [L848] 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 4 procedures, 187 locations, 2 error locations. Result: UNSAFE, OverallTime: 21.5s, OverallIterations: 20, TraceHistogramMax: 1, AutomataDifference: 5.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 3966 SDtfs, 4193 SDslu, 7515 SDs, 0 SdLazy, 4008 SolverSat, 202 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 2.3s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 140 GetRequests, 33 SyntacticMatches, 12 SemanticMatches, 95 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 131 ImplicationChecksByTransitivity, 0.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=50736occurred in iteration=8, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 8.0s AutomataMinimizationTime, 19 MinimizatonAttempts, 31232 StatesRemovedByMinimization, 16 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 0.8s InterpolantComputationTime, 768 NumberOfCodeBlocks, 768 NumberOfCodeBlocksAsserted, 20 NumberOfCheckSat, 686 ConstructedInterpolants, 0 QuantifiedInterpolants, 114911 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 19 InterpolantComputations, 19 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...