./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/pthread-wmm/mix007_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_1a2178b0-732b-4b0e-b780-299a7cc3ed4b/bin/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/run_dir_1a2178b0-732b-4b0e-b780-299a7cc3ed4b/bin/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_1a2178b0-732b-4b0e-b780-299a7cc3ed4b/bin/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_1a2178b0-732b-4b0e-b780-299a7cc3ed4b/bin/uautomizer/config/AutomizerReach.xml -i ../../sv-benchmarks/c/pthread-wmm/mix007_tso.opt.i -s /tmp/vcloud-vcloud-master/worker/run_dir_1a2178b0-732b-4b0e-b780-299a7cc3ed4b/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_1a2178b0-732b-4b0e-b780-299a7cc3ed4b/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 ef5d4c1875fb0acc4aabdab212d8e9fac97c9064 ........................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................ 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 13:43:42,120 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-07 13:43:42,122 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-07 13:43:42,129 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-07 13:43:42,129 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-07 13:43:42,130 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-07 13:43:42,131 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-07 13:43:42,132 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-07 13:43:42,134 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-07 13:43:42,134 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-07 13:43:42,135 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-07 13:43:42,136 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-07 13:43:42,136 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-07 13:43:42,137 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-07 13:43:42,137 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-07 13:43:42,138 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-07 13:43:42,139 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-07 13:43:42,139 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-07 13:43:42,141 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-07 13:43:42,143 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-07 13:43:42,144 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-07 13:43:42,145 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-07 13:43:42,145 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-07 13:43:42,146 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-07 13:43:42,148 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-07 13:43:42,148 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-07 13:43:42,148 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-07 13:43:42,148 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-07 13:43:42,149 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-07 13:43:42,149 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-07 13:43:42,149 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-07 13:43:42,150 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-07 13:43:42,150 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-07 13:43:42,151 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-07 13:43:42,151 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-07 13:43:42,151 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-07 13:43:42,152 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-07 13:43:42,152 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-07 13:43:42,152 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-07 13:43:42,153 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-07 13:43:42,153 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-07 13:43:42,153 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_1a2178b0-732b-4b0e-b780-299a7cc3ed4b/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf [2019-12-07 13:43:42,163 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-07 13:43:42,163 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-07 13:43:42,163 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-07 13:43:42,164 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-07 13:43:42,164 INFO L138 SettingsManager]: * Use SBE=true [2019-12-07 13:43:42,164 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-07 13:43:42,164 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-07 13:43:42,164 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-07 13:43:42,164 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-07 13:43:42,164 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-07 13:43:42,165 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-07 13:43:42,165 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-07 13:43:42,165 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-07 13:43:42,165 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-07 13:43:42,165 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-07 13:43:42,165 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-07 13:43:42,165 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-07 13:43:42,165 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-07 13:43:42,166 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-12-07 13:43:42,166 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-07 13:43:42,166 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-07 13:43:42,166 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-07 13:43:42,166 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-07 13:43:42,166 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-07 13:43:42,166 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-07 13:43:42,166 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-12-07 13:43:42,167 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-07 13:43:42,167 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-07 13:43:42,167 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2019-12-07 13:43:42,167 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_1a2178b0-732b-4b0e-b780-299a7cc3ed4b/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 -> ef5d4c1875fb0acc4aabdab212d8e9fac97c9064 [2019-12-07 13:43:42,270 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-07 13:43:42,280 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-07 13:43:42,283 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-07 13:43:42,285 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-07 13:43:42,285 INFO L275 PluginConnector]: CDTParser initialized [2019-12-07 13:43:42,286 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_1a2178b0-732b-4b0e-b780-299a7cc3ed4b/bin/uautomizer/../../sv-benchmarks/c/pthread-wmm/mix007_tso.opt.i [2019-12-07 13:43:42,325 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_1a2178b0-732b-4b0e-b780-299a7cc3ed4b/bin/uautomizer/data/99a407c07/b7cee0406b094658a9c9e5c5afca2376/FLAG1eea368ac [2019-12-07 13:43:42,723 INFO L306 CDTParser]: Found 1 translation units. [2019-12-07 13:43:42,723 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_1a2178b0-732b-4b0e-b780-299a7cc3ed4b/sv-benchmarks/c/pthread-wmm/mix007_tso.opt.i [2019-12-07 13:43:42,734 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_1a2178b0-732b-4b0e-b780-299a7cc3ed4b/bin/uautomizer/data/99a407c07/b7cee0406b094658a9c9e5c5afca2376/FLAG1eea368ac [2019-12-07 13:43:42,743 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_1a2178b0-732b-4b0e-b780-299a7cc3ed4b/bin/uautomizer/data/99a407c07/b7cee0406b094658a9c9e5c5afca2376 [2019-12-07 13:43:42,745 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-07 13:43:42,745 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-12-07 13:43:42,746 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-07 13:43:42,746 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-07 13:43:42,748 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-07 13:43:42,749 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.12 01:43:42" (1/1) ... [2019-12-07 13:43:42,751 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@551fb3cf and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 01:43:42, skipping insertion in model container [2019-12-07 13:43:42,751 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.12 01:43:42" (1/1) ... [2019-12-07 13:43:42,755 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-07 13:43:42,786 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-07 13:43:43,066 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-07 13:43:43,073 INFO L203 MainTranslator]: Completed pre-run [2019-12-07 13:43:43,114 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-07 13:43:43,160 INFO L208 MainTranslator]: Completed translation [2019-12-07 13:43:43,160 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 01:43:43 WrapperNode [2019-12-07 13:43:43,160 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-07 13:43:43,161 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-07 13:43:43,161 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-07 13:43:43,161 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-07 13:43:43,166 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 01:43:43" (1/1) ... [2019-12-07 13:43:43,180 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 01:43:43" (1/1) ... [2019-12-07 13:43:43,200 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-07 13:43:43,200 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-07 13:43:43,200 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-07 13:43:43,200 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-07 13:43:43,207 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 01:43:43" (1/1) ... [2019-12-07 13:43:43,207 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 01:43:43" (1/1) ... [2019-12-07 13:43:43,211 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 01:43:43" (1/1) ... [2019-12-07 13:43:43,211 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 01:43:43" (1/1) ... [2019-12-07 13:43:43,219 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 01:43:43" (1/1) ... [2019-12-07 13:43:43,222 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 01:43:43" (1/1) ... [2019-12-07 13:43:43,224 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 01:43:43" (1/1) ... [2019-12-07 13:43:43,228 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-07 13:43:43,228 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-07 13:43:43,228 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-07 13:43:43,228 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-07 13:43:43,229 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 01:43:43" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_1a2178b0-732b-4b0e-b780-299a7cc3ed4b/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 13:43:43,268 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-12-07 13:43:43,269 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2019-12-07 13:43:43,269 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-12-07 13:43:43,269 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-12-07 13:43:43,269 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2019-12-07 13:43:43,269 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2019-12-07 13:43:43,269 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2019-12-07 13:43:43,269 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2019-12-07 13:43:43,269 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2019-12-07 13:43:43,269 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2019-12-07 13:43:43,270 INFO L130 BoogieDeclarations]: Found specification of procedure P3 [2019-12-07 13:43:43,270 INFO L138 BoogieDeclarations]: Found implementation of procedure P3 [2019-12-07 13:43:43,270 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2019-12-07 13:43:43,270 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-07 13:43:43,270 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-07 13:43:43,271 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 13:43:43,713 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-07 13:43:43,713 INFO L287 CfgBuilder]: Removed 8 assume(true) statements. [2019-12-07 13:43:43,714 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 01:43:43 BoogieIcfgContainer [2019-12-07 13:43:43,714 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-07 13:43:43,715 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-07 13:43:43,715 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-07 13:43:43,717 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-07 13:43:43,717 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.12 01:43:42" (1/3) ... [2019-12-07 13:43:43,718 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@20360522 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.12 01:43:43, skipping insertion in model container [2019-12-07 13:43:43,718 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 01:43:43" (2/3) ... [2019-12-07 13:43:43,718 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@20360522 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.12 01:43:43, skipping insertion in model container [2019-12-07 13:43:43,718 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 01:43:43" (3/3) ... [2019-12-07 13:43:43,719 INFO L109 eAbstractionObserver]: Analyzing ICFG mix007_tso.opt.i [2019-12-07 13:43:43,726 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-12-07 13:43:43,726 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-07 13:43:43,731 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2019-12-07 13:43:43,732 INFO L339 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2019-12-07 13:43:43,763 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:43:43,763 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:43:43,763 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork3_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:43:43,763 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork3_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:43:43,763 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:43:43,763 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:43:43,764 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:43:43,764 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:43:43,764 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:43:43,764 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:43:43,764 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:43:43,764 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:43:43,765 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:43:43,765 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:43:43,766 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:43:43,766 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:43:43,766 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:43:43,766 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:43:43,766 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:43:43,766 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:43:43,766 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:43:43,767 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:43:43,767 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:43:43,767 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:43:43,767 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:43:43,767 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:43:43,767 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:43:43,767 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:43:43,768 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:43:43,768 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:43:43,768 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:43:43,768 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:43:43,768 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:43:43,768 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:43:43,768 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:43:43,768 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:43:43,768 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:43:43,769 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:43:43,769 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:43:43,769 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:43:43,769 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:43:43,769 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:43:43,769 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:43:43,769 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:43:43,769 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:43:43,769 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:43:43,770 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:43:43,770 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:43:43,770 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:43:43,770 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:43:43,770 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:43:43,770 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:43:43,770 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:43:43,770 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:43:43,770 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:43:43,770 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:43:43,771 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:43:43,771 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:43:43,771 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:43:43,771 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:43:43,771 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:43:43,771 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:43:43,771 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:43:43,771 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:43:43,771 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:43:43,772 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:43:43,772 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:43:43,772 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:43:43,772 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:43:43,772 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:43:43,772 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:43:43,773 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:43:43,773 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:43:43,773 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:43:43,773 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:43:43,773 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:43:43,773 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:43:43,773 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:43:43,773 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:43:43,773 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:43:43,774 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:43:43,774 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:43:43,774 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:43:43,774 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:43:43,774 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:43:43,774 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:43:43,774 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:43:43,774 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:43:43,774 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:43:43,774 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:43:43,775 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:43:43,775 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:43:43,775 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:43:43,775 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:43:43,775 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:43:43,775 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:43:43,775 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:43:43,775 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:43:43,775 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:43:43,776 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:43:43,776 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:43:43,776 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:43:43,776 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:43:43,776 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:43:43,776 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:43:43,776 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:43:43,777 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:43:43,777 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:43:43,777 WARN L315 ript$VariableManager]: TermVariabe P3Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:43:43,777 WARN L315 ript$VariableManager]: TermVariabe P3Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:43:43,777 WARN L315 ript$VariableManager]: TermVariabe P3Thread1of1ForFork2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:43:43,777 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:43:43,778 WARN L315 ript$VariableManager]: TermVariabe P3Thread1of1ForFork2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:43:43,778 WARN L315 ript$VariableManager]: TermVariabe P3Thread1of1ForFork2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:43:43,778 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~nondet26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:43:43,778 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~nondet27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:43:43,778 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~nondet26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:43:43,778 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~nondet27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:43:43,778 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:43:43,778 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:43:43,778 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:43:43,779 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:43:43,779 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:43:43,779 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:43:43,779 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:43:43,779 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:43:43,779 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:43:43,779 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:43:43,779 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:43:43,779 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:43:43,779 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:43:43,780 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:43:43,780 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:43:43,780 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:43:43,780 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:43:43,780 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:43:43,780 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:43:43,780 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:43:43,780 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:43:43,780 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:43:43,780 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:43:43,781 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:43:43,781 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:43:43,781 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:43:43,781 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:43:43,781 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:43:43,781 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:43:43,781 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:43:43,781 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:43:43,781 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:43:43,781 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:43:43,782 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:43:43,782 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:43:43,782 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:43:43,782 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:43:43,782 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:43:43,782 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:43:43,782 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:43:43,782 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:43:43,782 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:43:43,782 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:43:43,783 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:43:43,783 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:43:43,783 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:43:43,783 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:43:43,783 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:43:43,783 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:43:43,783 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:43:43,783 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:43:43,783 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:43:43,783 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:43:43,784 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:43:43,784 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:43:43,784 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:43:43,784 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:43:43,784 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:43:43,784 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:43:43,784 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:43:43,784 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:43:43,784 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:43:43,784 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:43:43,785 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:43:43,785 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:43:43,785 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:43:43,785 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:43:43,785 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:43:43,785 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:43:43,785 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:43:43,785 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:43:43,785 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:43:43,785 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:43:43,785 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:43:43,786 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:43:43,786 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:43:43,786 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:43:43,786 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:43:43,786 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:43:43,786 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:43:43,786 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:43:43,786 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:43:43,786 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:43:43,786 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:43:43,787 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:43:43,787 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:43:43,787 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:43:43,787 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:43:43,787 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:43:43,787 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:43:43,787 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:43:43,787 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:43:43,787 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:43:43,787 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:43:43,787 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:43:43,788 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:43:43,788 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite52| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:43:43,788 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite52| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:43:43,788 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite52| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:43:43,788 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite52| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:43:43,788 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite53| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:43:43,788 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite53| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:43:43,788 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite53| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:43:43,788 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite53| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:43:43,788 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:43:43,789 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:43:43,789 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:43:43,789 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:43:43,789 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:43:43,789 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:43:43,801 INFO L249 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2019-12-07 13:43:43,814 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-07 13:43:43,814 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-07 13:43:43,814 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-07 13:43:43,814 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-12-07 13:43:43,814 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-07 13:43:43,814 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-07 13:43:43,814 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-07 13:43:43,814 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-07 13:43:43,829 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 212 places, 255 transitions [2019-12-07 13:43:43,830 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 212 places, 255 transitions [2019-12-07 13:43:43,903 INFO L134 PetriNetUnfolder]: 56/251 cut-off events. [2019-12-07 13:43:43,904 INFO L135 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-07 13:43:43,918 INFO L76 FinitePrefix]: Finished finitePrefix Result has 264 conditions, 251 events. 56/251 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 13. Compared 941 event pairs. 12/205 useless extension candidates. Maximal degree in co-relation 217. Up to 2 conditions per place. [2019-12-07 13:43:43,941 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 212 places, 255 transitions [2019-12-07 13:43:43,978 INFO L134 PetriNetUnfolder]: 56/251 cut-off events. [2019-12-07 13:43:43,978 INFO L135 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-07 13:43:43,987 INFO L76 FinitePrefix]: Finished finitePrefix Result has 264 conditions, 251 events. 56/251 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 13. Compared 941 event pairs. 12/205 useless extension candidates. Maximal degree in co-relation 217. Up to 2 conditions per place. [2019-12-07 13:43:44,012 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 26510 [2019-12-07 13:43:44,013 INFO L170 etLargeBlockEncoding]: Semantic Check. [2019-12-07 13:43:47,553 WARN L192 SmtUtils]: Spent 160.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 54 [2019-12-07 13:43:47,752 WARN L192 SmtUtils]: Spent 177.00 ms on a formula simplification. DAG size of input: 101 DAG size of output: 99 [2019-12-07 13:43:47,878 INFO L206 etLargeBlockEncoding]: Checked pairs total: 141939 [2019-12-07 13:43:47,878 INFO L214 etLargeBlockEncoding]: Total number of compositions: 133 [2019-12-07 13:43:47,880 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 112 places, 132 transitions [2019-12-07 13:43:55,242 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 85966 states. [2019-12-07 13:43:55,244 INFO L276 IsEmpty]: Start isEmpty. Operand 85966 states. [2019-12-07 13:43:55,249 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2019-12-07 13:43:55,249 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 13:43:55,250 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 13:43:55,250 INFO L410 AbstractCegarLoop]: === Iteration 1 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 13:43:55,254 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 13:43:55,254 INFO L82 PathProgramCache]: Analyzing trace with hash 1287441752, now seen corresponding path program 1 times [2019-12-07 13:43:55,259 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 13:43:55,259 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [660365269] [2019-12-07 13:43:55,259 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 13:43:55,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 13:43:55,422 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 13:43:55,423 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [660365269] [2019-12-07 13:43:55,423 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 13:43:55,424 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-07 13:43:55,424 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1528034471] [2019-12-07 13:43:55,427 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 13:43:55,427 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 13:43:55,436 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 13:43:55,436 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 13:43:55,438 INFO L87 Difference]: Start difference. First operand 85966 states. Second operand 3 states. [2019-12-07 13:43:56,150 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 13:43:56,150 INFO L93 Difference]: Finished difference Result 85406 states and 393472 transitions. [2019-12-07 13:43:56,151 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 13:43:56,152 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 9 [2019-12-07 13:43:56,152 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 13:43:56,625 INFO L225 Difference]: With dead ends: 85406 [2019-12-07 13:43:56,625 INFO L226 Difference]: Without dead ends: 79558 [2019-12-07 13:43:56,626 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 13:43:57,918 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79558 states. [2019-12-07 13:43:59,134 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79558 to 79558. [2019-12-07 13:43:59,135 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 79558 states. [2019-12-07 13:43:59,426 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79558 states to 79558 states and 366284 transitions. [2019-12-07 13:43:59,427 INFO L78 Accepts]: Start accepts. Automaton has 79558 states and 366284 transitions. Word has length 9 [2019-12-07 13:43:59,428 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 13:43:59,428 INFO L462 AbstractCegarLoop]: Abstraction has 79558 states and 366284 transitions. [2019-12-07 13:43:59,428 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 13:43:59,428 INFO L276 IsEmpty]: Start isEmpty. Operand 79558 states and 366284 transitions. [2019-12-07 13:43:59,434 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-12-07 13:43:59,434 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 13:43:59,435 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 13:43:59,435 INFO L410 AbstractCegarLoop]: === Iteration 2 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 13:43:59,435 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 13:43:59,435 INFO L82 PathProgramCache]: Analyzing trace with hash 1721975953, now seen corresponding path program 1 times [2019-12-07 13:43:59,435 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 13:43:59,435 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1008935746] [2019-12-07 13:43:59,435 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 13:43:59,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 13:43:59,496 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 13:43:59,496 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1008935746] [2019-12-07 13:43:59,496 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 13:43:59,496 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 13:43:59,497 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1999154707] [2019-12-07 13:43:59,497 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 13:43:59,498 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 13:43:59,498 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 13:43:59,498 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 13:43:59,498 INFO L87 Difference]: Start difference. First operand 79558 states and 366284 transitions. Second operand 4 states. [2019-12-07 13:44:01,846 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 13:44:01,847 INFO L93 Difference]: Finished difference Result 126790 states and 563012 transitions. [2019-12-07 13:44:01,847 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-07 13:44:01,848 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 15 [2019-12-07 13:44:01,848 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 13:44:02,285 INFO L225 Difference]: With dead ends: 126790 [2019-12-07 13:44:02,286 INFO L226 Difference]: Without dead ends: 126726 [2019-12-07 13:44:02,286 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 13:44:03,630 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 126726 states. [2019-12-07 13:44:05,481 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 126726 to 123582. [2019-12-07 13:44:05,482 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 123582 states. [2019-12-07 13:44:05,859 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 123582 states to 123582 states and 551516 transitions. [2019-12-07 13:44:05,859 INFO L78 Accepts]: Start accepts. Automaton has 123582 states and 551516 transitions. Word has length 15 [2019-12-07 13:44:05,859 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 13:44:05,859 INFO L462 AbstractCegarLoop]: Abstraction has 123582 states and 551516 transitions. [2019-12-07 13:44:05,859 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 13:44:05,859 INFO L276 IsEmpty]: Start isEmpty. Operand 123582 states and 551516 transitions. [2019-12-07 13:44:05,865 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-12-07 13:44:05,865 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 13:44:05,865 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 13:44:05,866 INFO L410 AbstractCegarLoop]: === Iteration 3 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 13:44:05,866 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 13:44:05,866 INFO L82 PathProgramCache]: Analyzing trace with hash -1760528869, now seen corresponding path program 1 times [2019-12-07 13:44:05,866 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 13:44:05,866 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [439635830] [2019-12-07 13:44:05,866 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 13:44:05,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 13:44:05,925 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 13:44:05,925 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [439635830] [2019-12-07 13:44:05,926 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 13:44:05,926 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 13:44:05,926 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1250777402] [2019-12-07 13:44:05,926 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 13:44:05,926 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 13:44:05,926 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 13:44:05,926 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 13:44:05,926 INFO L87 Difference]: Start difference. First operand 123582 states and 551516 transitions. Second operand 4 states. [2019-12-07 13:44:07,190 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 13:44:07,191 INFO L93 Difference]: Finished difference Result 159910 states and 703928 transitions. [2019-12-07 13:44:07,191 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-07 13:44:07,191 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 18 [2019-12-07 13:44:07,192 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 13:44:07,607 INFO L225 Difference]: With dead ends: 159910 [2019-12-07 13:44:07,607 INFO L226 Difference]: Without dead ends: 159850 [2019-12-07 13:44:07,607 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 13:44:09,083 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 159850 states. [2019-12-07 13:44:12,917 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 159850 to 141658. [2019-12-07 13:44:12,917 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 141658 states. [2019-12-07 13:44:13,363 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 141658 states to 141658 states and 629312 transitions. [2019-12-07 13:44:13,363 INFO L78 Accepts]: Start accepts. Automaton has 141658 states and 629312 transitions. Word has length 18 [2019-12-07 13:44:13,363 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 13:44:13,363 INFO L462 AbstractCegarLoop]: Abstraction has 141658 states and 629312 transitions. [2019-12-07 13:44:13,363 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 13:44:13,363 INFO L276 IsEmpty]: Start isEmpty. Operand 141658 states and 629312 transitions. [2019-12-07 13:44:13,379 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-12-07 13:44:13,379 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 13:44:13,380 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 13:44:13,380 INFO L410 AbstractCegarLoop]: === Iteration 4 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 13:44:13,380 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 13:44:13,380 INFO L82 PathProgramCache]: Analyzing trace with hash 176800759, now seen corresponding path program 1 times [2019-12-07 13:44:13,380 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 13:44:13,380 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2016180371] [2019-12-07 13:44:13,381 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 13:44:13,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 13:44:13,453 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 13:44:13,454 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2016180371] [2019-12-07 13:44:13,454 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 13:44:13,454 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-07 13:44:13,454 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [294507194] [2019-12-07 13:44:13,455 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 13:44:13,455 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 13:44:13,455 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 13:44:13,455 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 13:44:13,455 INFO L87 Difference]: Start difference. First operand 141658 states and 629312 transitions. Second operand 3 states. [2019-12-07 13:44:14,676 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 13:44:14,676 INFO L93 Difference]: Finished difference Result 211830 states and 899709 transitions. [2019-12-07 13:44:14,676 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 13:44:14,676 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 20 [2019-12-07 13:44:14,676 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 13:44:15,254 INFO L225 Difference]: With dead ends: 211830 [2019-12-07 13:44:15,254 INFO L226 Difference]: Without dead ends: 211290 [2019-12-07 13:44:15,255 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 13:44:16,965 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 211290 states. [2019-12-07 13:44:22,903 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 211290 to 205249. [2019-12-07 13:44:22,903 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 205249 states. [2019-12-07 13:44:23,549 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 205249 states to 205249 states and 879959 transitions. [2019-12-07 13:44:23,549 INFO L78 Accepts]: Start accepts. Automaton has 205249 states and 879959 transitions. Word has length 20 [2019-12-07 13:44:23,549 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 13:44:23,549 INFO L462 AbstractCegarLoop]: Abstraction has 205249 states and 879959 transitions. [2019-12-07 13:44:23,549 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 13:44:23,549 INFO L276 IsEmpty]: Start isEmpty. Operand 205249 states and 879959 transitions. [2019-12-07 13:44:23,566 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-12-07 13:44:23,566 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 13:44:23,566 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] [2019-12-07 13:44:23,567 INFO L410 AbstractCegarLoop]: === Iteration 5 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 13:44:23,567 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 13:44:23,567 INFO L82 PathProgramCache]: Analyzing trace with hash -489613445, now seen corresponding path program 1 times [2019-12-07 13:44:23,567 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 13:44:23,567 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1957578790] [2019-12-07 13:44:23,567 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 13:44:23,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 13:44:23,615 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 13:44:23,616 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1957578790] [2019-12-07 13:44:23,616 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 13:44:23,616 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 13:44:23,616 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [604046014] [2019-12-07 13:44:23,616 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 13:44:23,616 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 13:44:23,617 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 13:44:23,617 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 13:44:23,617 INFO L87 Difference]: Start difference. First operand 205249 states and 879959 transitions. Second operand 3 states. [2019-12-07 13:44:24,560 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 13:44:24,560 INFO L93 Difference]: Finished difference Result 205249 states and 870994 transitions. [2019-12-07 13:44:24,561 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 13:44:24,561 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 21 [2019-12-07 13:44:24,561 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 13:44:25,597 INFO L225 Difference]: With dead ends: 205249 [2019-12-07 13:44:25,597 INFO L226 Difference]: Without dead ends: 205249 [2019-12-07 13:44:25,598 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 13:44:27,206 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 205249 states. [2019-12-07 13:44:30,071 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 205249 to 204643. [2019-12-07 13:44:30,071 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 204643 states. [2019-12-07 13:44:30,714 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 204643 states to 204643 states and 868870 transitions. [2019-12-07 13:44:30,714 INFO L78 Accepts]: Start accepts. Automaton has 204643 states and 868870 transitions. Word has length 21 [2019-12-07 13:44:30,715 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 13:44:30,715 INFO L462 AbstractCegarLoop]: Abstraction has 204643 states and 868870 transitions. [2019-12-07 13:44:30,715 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 13:44:30,715 INFO L276 IsEmpty]: Start isEmpty. Operand 204643 states and 868870 transitions. [2019-12-07 13:44:30,728 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-12-07 13:44:30,728 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 13:44:30,728 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] [2019-12-07 13:44:30,728 INFO L410 AbstractCegarLoop]: === Iteration 6 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 13:44:30,729 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 13:44:30,729 INFO L82 PathProgramCache]: Analyzing trace with hash 695884557, now seen corresponding path program 1 times [2019-12-07 13:44:30,729 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 13:44:30,729 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1055091424] [2019-12-07 13:44:30,729 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 13:44:30,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 13:44:30,790 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 13:44:30,791 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1055091424] [2019-12-07 13:44:30,791 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 13:44:30,791 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 13:44:30,791 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1518795694] [2019-12-07 13:44:30,792 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 13:44:30,792 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 13:44:30,792 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 13:44:30,792 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-07 13:44:30,792 INFO L87 Difference]: Start difference. First operand 204643 states and 868870 transitions. Second operand 4 states. [2019-12-07 13:44:31,795 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 13:44:31,795 INFO L93 Difference]: Finished difference Result 210337 states and 885473 transitions. [2019-12-07 13:44:31,796 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 13:44:31,796 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 21 [2019-12-07 13:44:31,796 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 13:44:32,365 INFO L225 Difference]: With dead ends: 210337 [2019-12-07 13:44:32,366 INFO L226 Difference]: Without dead ends: 210337 [2019-12-07 13:44:32,366 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 13:44:36,671 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 210337 states. [2019-12-07 13:44:39,638 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 210337 to 203314. [2019-12-07 13:44:39,638 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 203314 states. [2019-12-07 13:44:40,280 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 203314 states to 203314 states and 864339 transitions. [2019-12-07 13:44:40,281 INFO L78 Accepts]: Start accepts. Automaton has 203314 states and 864339 transitions. Word has length 21 [2019-12-07 13:44:40,281 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 13:44:40,281 INFO L462 AbstractCegarLoop]: Abstraction has 203314 states and 864339 transitions. [2019-12-07 13:44:40,281 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 13:44:40,281 INFO L276 IsEmpty]: Start isEmpty. Operand 203314 states and 864339 transitions. [2019-12-07 13:44:40,297 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-12-07 13:44:40,297 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 13:44:40,297 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] [2019-12-07 13:44:40,297 INFO L410 AbstractCegarLoop]: === Iteration 7 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 13:44:40,297 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 13:44:40,298 INFO L82 PathProgramCache]: Analyzing trace with hash -259475625, now seen corresponding path program 1 times [2019-12-07 13:44:40,298 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 13:44:40,298 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1114158758] [2019-12-07 13:44:40,298 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 13:44:40,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 13:44:40,696 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 13:44:40,696 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1114158758] [2019-12-07 13:44:40,697 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 13:44:40,697 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 13:44:40,697 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1352624358] [2019-12-07 13:44:40,697 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 13:44:40,697 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 13:44:40,697 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 13:44:40,697 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 13:44:40,697 INFO L87 Difference]: Start difference. First operand 203314 states and 864339 transitions. Second operand 4 states. [2019-12-07 13:44:41,432 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 13:44:41,433 INFO L93 Difference]: Finished difference Result 181096 states and 721825 transitions. [2019-12-07 13:44:41,433 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 13:44:41,433 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 21 [2019-12-07 13:44:41,433 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 13:44:41,843 INFO L225 Difference]: With dead ends: 181096 [2019-12-07 13:44:41,843 INFO L226 Difference]: Without dead ends: 168749 [2019-12-07 13:44:41,843 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 13:44:43,113 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 168749 states. [2019-12-07 13:44:45,499 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 168749 to 168749. [2019-12-07 13:44:45,499 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 168749 states. [2019-12-07 13:44:46,586 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 168749 states to 168749 states and 678228 transitions. [2019-12-07 13:44:46,586 INFO L78 Accepts]: Start accepts. Automaton has 168749 states and 678228 transitions. Word has length 21 [2019-12-07 13:44:46,586 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 13:44:46,586 INFO L462 AbstractCegarLoop]: Abstraction has 168749 states and 678228 transitions. [2019-12-07 13:44:46,586 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 13:44:46,586 INFO L276 IsEmpty]: Start isEmpty. Operand 168749 states and 678228 transitions. [2019-12-07 13:44:46,599 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-12-07 13:44:46,599 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 13:44:46,600 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] [2019-12-07 13:44:46,600 INFO L410 AbstractCegarLoop]: === Iteration 8 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 13:44:46,600 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 13:44:46,600 INFO L82 PathProgramCache]: Analyzing trace with hash 556520531, now seen corresponding path program 1 times [2019-12-07 13:44:46,600 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 13:44:46,600 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1860685573] [2019-12-07 13:44:46,600 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 13:44:46,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 13:44:46,651 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 13:44:46,651 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1860685573] [2019-12-07 13:44:46,651 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 13:44:46,651 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 13:44:46,651 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [589424295] [2019-12-07 13:44:46,652 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-07 13:44:46,652 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 13:44:46,652 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-07 13:44:46,652 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-07 13:44:46,652 INFO L87 Difference]: Start difference. First operand 168749 states and 678228 transitions. Second operand 5 states. [2019-12-07 13:44:46,973 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 13:44:46,973 INFO L93 Difference]: Finished difference Result 85959 states and 300035 transitions. [2019-12-07 13:44:46,973 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-07 13:44:46,973 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 22 [2019-12-07 13:44:46,974 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 13:44:47,109 INFO L225 Difference]: With dead ends: 85959 [2019-12-07 13:44:47,109 INFO L226 Difference]: Without dead ends: 75574 [2019-12-07 13:44:47,109 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-12-07 13:44:47,580 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75574 states. [2019-12-07 13:44:48,435 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75574 to 74203. [2019-12-07 13:44:48,435 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 74203 states. [2019-12-07 13:44:48,588 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74203 states to 74203 states and 256414 transitions. [2019-12-07 13:44:48,589 INFO L78 Accepts]: Start accepts. Automaton has 74203 states and 256414 transitions. Word has length 22 [2019-12-07 13:44:48,589 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 13:44:48,589 INFO L462 AbstractCegarLoop]: Abstraction has 74203 states and 256414 transitions. [2019-12-07 13:44:48,589 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-07 13:44:48,589 INFO L276 IsEmpty]: Start isEmpty. Operand 74203 states and 256414 transitions. [2019-12-07 13:44:48,896 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2019-12-07 13:44:48,896 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 13:44:48,896 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 13:44:48,897 INFO L410 AbstractCegarLoop]: === Iteration 9 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 13:44:48,897 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 13:44:48,897 INFO L82 PathProgramCache]: Analyzing trace with hash -10687230, now seen corresponding path program 1 times [2019-12-07 13:44:48,897 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 13:44:48,897 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [482138632] [2019-12-07 13:44:48,897 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 13:44:48,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 13:44:48,949 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 13:44:48,949 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [482138632] [2019-12-07 13:44:48,949 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 13:44:48,949 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 13:44:48,950 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1754445283] [2019-12-07 13:44:48,950 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 13:44:48,950 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 13:44:48,950 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 13:44:48,950 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-07 13:44:48,950 INFO L87 Difference]: Start difference. First operand 74203 states and 256414 transitions. Second operand 4 states. [2019-12-07 13:44:49,203 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 13:44:49,203 INFO L93 Difference]: Finished difference Result 72468 states and 249972 transitions. [2019-12-07 13:44:49,204 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 13:44:49,204 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 23 [2019-12-07 13:44:49,205 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 13:44:49,328 INFO L225 Difference]: With dead ends: 72468 [2019-12-07 13:44:49,329 INFO L226 Difference]: Without dead ends: 72468 [2019-12-07 13:44:49,329 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 13:44:49,786 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72468 states. [2019-12-07 13:44:50,448 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72468 to 50209. [2019-12-07 13:44:50,448 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 50209 states. [2019-12-07 13:44:50,549 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50209 states to 50209 states and 171824 transitions. [2019-12-07 13:44:50,549 INFO L78 Accepts]: Start accepts. Automaton has 50209 states and 171824 transitions. Word has length 23 [2019-12-07 13:44:50,549 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 13:44:50,549 INFO L462 AbstractCegarLoop]: Abstraction has 50209 states and 171824 transitions. [2019-12-07 13:44:50,549 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 13:44:50,549 INFO L276 IsEmpty]: Start isEmpty. Operand 50209 states and 171824 transitions. [2019-12-07 13:44:50,559 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-12-07 13:44:50,559 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 13:44:50,559 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 13:44:50,559 INFO L410 AbstractCegarLoop]: === Iteration 10 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 13:44:50,559 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 13:44:50,559 INFO L82 PathProgramCache]: Analyzing trace with hash 1913222537, now seen corresponding path program 1 times [2019-12-07 13:44:50,560 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 13:44:50,560 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [511468665] [2019-12-07 13:44:50,560 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 13:44:50,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 13:44:50,612 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 13:44:50,613 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [511468665] [2019-12-07 13:44:50,613 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 13:44:50,613 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-07 13:44:50,613 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1046833545] [2019-12-07 13:44:50,613 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-07 13:44:50,613 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 13:44:50,613 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-07 13:44:50,613 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2019-12-07 13:44:50,614 INFO L87 Difference]: Start difference. First operand 50209 states and 171824 transitions. Second operand 6 states. [2019-12-07 13:44:50,700 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 13:44:50,700 INFO L93 Difference]: Finished difference Result 14346 states and 47255 transitions. [2019-12-07 13:44:50,701 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-07 13:44:50,701 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 26 [2019-12-07 13:44:50,701 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 13:44:50,715 INFO L225 Difference]: With dead ends: 14346 [2019-12-07 13:44:50,715 INFO L226 Difference]: Without dead ends: 11383 [2019-12-07 13:44:50,716 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2019-12-07 13:44:50,744 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11383 states. [2019-12-07 13:44:50,840 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11383 to 10794. [2019-12-07 13:44:50,840 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10794 states. [2019-12-07 13:44:50,857 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10794 states to 10794 states and 35281 transitions. [2019-12-07 13:44:50,857 INFO L78 Accepts]: Start accepts. Automaton has 10794 states and 35281 transitions. Word has length 26 [2019-12-07 13:44:50,858 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 13:44:50,858 INFO L462 AbstractCegarLoop]: Abstraction has 10794 states and 35281 transitions. [2019-12-07 13:44:50,858 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-07 13:44:50,858 INFO L276 IsEmpty]: Start isEmpty. Operand 10794 states and 35281 transitions. [2019-12-07 13:44:50,867 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2019-12-07 13:44:50,867 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 13:44:50,867 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 13:44:50,867 INFO L410 AbstractCegarLoop]: === Iteration 11 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 13:44:50,867 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 13:44:50,867 INFO L82 PathProgramCache]: Analyzing trace with hash -1880413774, now seen corresponding path program 1 times [2019-12-07 13:44:50,867 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 13:44:50,867 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [386599318] [2019-12-07 13:44:50,867 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 13:44:50,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 13:44:50,906 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 13:44:50,906 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [386599318] [2019-12-07 13:44:50,906 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 13:44:50,906 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 13:44:50,906 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [682364170] [2019-12-07 13:44:50,907 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-07 13:44:50,907 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 13:44:50,907 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-07 13:44:50,907 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-07 13:44:50,907 INFO L87 Difference]: Start difference. First operand 10794 states and 35281 transitions. Second operand 5 states. [2019-12-07 13:44:51,176 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 13:44:51,176 INFO L93 Difference]: Finished difference Result 11689 states and 37228 transitions. [2019-12-07 13:44:51,176 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-07 13:44:51,177 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 34 [2019-12-07 13:44:51,177 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 13:44:51,190 INFO L225 Difference]: With dead ends: 11689 [2019-12-07 13:44:51,190 INFO L226 Difference]: Without dead ends: 11688 [2019-12-07 13:44:51,190 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-12-07 13:44:51,218 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11688 states. [2019-12-07 13:44:51,318 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11688 to 11087. [2019-12-07 13:44:51,318 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11087 states. [2019-12-07 13:44:51,725 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11087 states to 11087 states and 35933 transitions. [2019-12-07 13:44:51,725 INFO L78 Accepts]: Start accepts. Automaton has 11087 states and 35933 transitions. Word has length 34 [2019-12-07 13:44:51,726 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 13:44:51,726 INFO L462 AbstractCegarLoop]: Abstraction has 11087 states and 35933 transitions. [2019-12-07 13:44:51,726 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-07 13:44:51,726 INFO L276 IsEmpty]: Start isEmpty. Operand 11087 states and 35933 transitions. [2019-12-07 13:44:51,739 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2019-12-07 13:44:51,739 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 13:44:51,739 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] [2019-12-07 13:44:51,739 INFO L410 AbstractCegarLoop]: === Iteration 12 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 13:44:51,740 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 13:44:51,740 INFO L82 PathProgramCache]: Analyzing trace with hash 743648653, now seen corresponding path program 1 times [2019-12-07 13:44:51,740 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 13:44:51,740 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1909000237] [2019-12-07 13:44:51,740 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 13:44:51,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 13:44:51,802 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 13:44:51,802 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1909000237] [2019-12-07 13:44:51,802 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 13:44:51,802 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-07 13:44:51,802 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [103539568] [2019-12-07 13:44:51,802 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-07 13:44:51,802 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 13:44:51,803 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-07 13:44:51,803 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2019-12-07 13:44:51,803 INFO L87 Difference]: Start difference. First operand 11087 states and 35933 transitions. Second operand 7 states. [2019-12-07 13:44:51,894 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 13:44:51,895 INFO L93 Difference]: Finished difference Result 9326 states and 31880 transitions. [2019-12-07 13:44:51,895 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-07 13:44:51,895 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 49 [2019-12-07 13:44:51,895 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 13:44:51,911 INFO L225 Difference]: With dead ends: 9326 [2019-12-07 13:44:51,912 INFO L226 Difference]: Without dead ends: 9119 [2019-12-07 13:44:51,912 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=45, Invalid=65, Unknown=0, NotChecked=0, Total=110 [2019-12-07 13:44:51,937 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9119 states. [2019-12-07 13:44:52,017 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9119 to 8527. [2019-12-07 13:44:52,017 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8527 states. [2019-12-07 13:44:52,031 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8527 states to 8527 states and 29950 transitions. [2019-12-07 13:44:52,031 INFO L78 Accepts]: Start accepts. Automaton has 8527 states and 29950 transitions. Word has length 49 [2019-12-07 13:44:52,031 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 13:44:52,031 INFO L462 AbstractCegarLoop]: Abstraction has 8527 states and 29950 transitions. [2019-12-07 13:44:52,031 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-07 13:44:52,031 INFO L276 IsEmpty]: Start isEmpty. Operand 8527 states and 29950 transitions. [2019-12-07 13:44:52,041 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-07 13:44:52,041 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 13:44:52,041 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 13:44:52,041 INFO L410 AbstractCegarLoop]: === Iteration 13 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 13:44:52,042 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 13:44:52,042 INFO L82 PathProgramCache]: Analyzing trace with hash -136500077, now seen corresponding path program 1 times [2019-12-07 13:44:52,042 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 13:44:52,042 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [194259686] [2019-12-07 13:44:52,042 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 13:44:52,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 13:44:52,124 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 13:44:52,124 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [194259686] [2019-12-07 13:44:52,124 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 13:44:52,124 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 13:44:52,124 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1764281767] [2019-12-07 13:44:52,125 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 13:44:52,125 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 13:44:52,125 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 13:44:52,125 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 13:44:52,125 INFO L87 Difference]: Start difference. First operand 8527 states and 29950 transitions. Second operand 4 states. [2019-12-07 13:44:52,198 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 13:44:52,198 INFO L93 Difference]: Finished difference Result 13283 states and 44423 transitions. [2019-12-07 13:44:52,198 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-07 13:44:52,199 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 65 [2019-12-07 13:44:52,199 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 13:44:52,215 INFO L225 Difference]: With dead ends: 13283 [2019-12-07 13:44:52,216 INFO L226 Difference]: Without dead ends: 12675 [2019-12-07 13:44:52,216 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 13:44:52,245 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12675 states. [2019-12-07 13:44:52,336 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12675 to 8155. [2019-12-07 13:44:52,336 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8155 states. [2019-12-07 13:44:52,349 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8155 states to 8155 states and 28478 transitions. [2019-12-07 13:44:52,349 INFO L78 Accepts]: Start accepts. Automaton has 8155 states and 28478 transitions. Word has length 65 [2019-12-07 13:44:52,349 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 13:44:52,349 INFO L462 AbstractCegarLoop]: Abstraction has 8155 states and 28478 transitions. [2019-12-07 13:44:52,350 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 13:44:52,350 INFO L276 IsEmpty]: Start isEmpty. Operand 8155 states and 28478 transitions. [2019-12-07 13:44:52,358 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-07 13:44:52,358 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 13:44:52,358 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 13:44:52,358 INFO L410 AbstractCegarLoop]: === Iteration 14 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 13:44:52,358 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 13:44:52,358 INFO L82 PathProgramCache]: Analyzing trace with hash -2053431971, now seen corresponding path program 2 times [2019-12-07 13:44:52,358 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 13:44:52,358 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [672232232] [2019-12-07 13:44:52,359 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 13:44:52,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 13:44:52,402 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 13:44:52,402 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [672232232] [2019-12-07 13:44:52,402 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 13:44:52,402 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 13:44:52,402 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [814950827] [2019-12-07 13:44:52,403 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 13:44:52,403 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 13:44:52,403 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 13:44:52,403 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 13:44:52,403 INFO L87 Difference]: Start difference. First operand 8155 states and 28478 transitions. Second operand 4 states. [2019-12-07 13:44:52,437 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 13:44:52,437 INFO L93 Difference]: Finished difference Result 9215 states and 31394 transitions. [2019-12-07 13:44:52,437 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 13:44:52,437 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 65 [2019-12-07 13:44:52,437 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 13:44:52,445 INFO L225 Difference]: With dead ends: 9215 [2019-12-07 13:44:52,445 INFO L226 Difference]: Without dead ends: 5339 [2019-12-07 13:44:52,445 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 13:44:52,460 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5339 states. [2019-12-07 13:44:52,507 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5339 to 5339. [2019-12-07 13:44:52,507 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5339 states. [2019-12-07 13:44:52,515 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5339 states to 5339 states and 16885 transitions. [2019-12-07 13:44:52,515 INFO L78 Accepts]: Start accepts. Automaton has 5339 states and 16885 transitions. Word has length 65 [2019-12-07 13:44:52,515 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 13:44:52,515 INFO L462 AbstractCegarLoop]: Abstraction has 5339 states and 16885 transitions. [2019-12-07 13:44:52,515 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 13:44:52,515 INFO L276 IsEmpty]: Start isEmpty. Operand 5339 states and 16885 transitions. [2019-12-07 13:44:52,520 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-07 13:44:52,520 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 13:44:52,520 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 13:44:52,520 INFO L410 AbstractCegarLoop]: === Iteration 15 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 13:44:52,520 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 13:44:52,520 INFO L82 PathProgramCache]: Analyzing trace with hash 544269315, now seen corresponding path program 3 times [2019-12-07 13:44:52,521 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 13:44:52,521 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [827744369] [2019-12-07 13:44:52,521 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 13:44:52,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 13:44:52,562 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 13:44:52,563 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [827744369] [2019-12-07 13:44:52,563 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 13:44:52,563 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 13:44:52,563 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [190187241] [2019-12-07 13:44:52,563 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 13:44:52,563 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 13:44:52,563 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 13:44:52,563 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 13:44:52,563 INFO L87 Difference]: Start difference. First operand 5339 states and 16885 transitions. Second operand 4 states. [2019-12-07 13:44:52,587 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 13:44:52,587 INFO L93 Difference]: Finished difference Result 5894 states and 18141 transitions. [2019-12-07 13:44:52,587 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 13:44:52,588 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 65 [2019-12-07 13:44:52,588 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 13:44:52,591 INFO L225 Difference]: With dead ends: 5894 [2019-12-07 13:44:52,591 INFO L226 Difference]: Without dead ends: 2977 [2019-12-07 13:44:52,592 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 13:44:52,600 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2977 states. [2019-12-07 13:44:52,623 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2977 to 2977. [2019-12-07 13:44:52,623 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2977 states. [2019-12-07 13:44:52,627 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2977 states to 2977 states and 8265 transitions. [2019-12-07 13:44:52,627 INFO L78 Accepts]: Start accepts. Automaton has 2977 states and 8265 transitions. Word has length 65 [2019-12-07 13:44:52,627 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 13:44:52,627 INFO L462 AbstractCegarLoop]: Abstraction has 2977 states and 8265 transitions. [2019-12-07 13:44:52,627 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 13:44:52,627 INFO L276 IsEmpty]: Start isEmpty. Operand 2977 states and 8265 transitions. [2019-12-07 13:44:52,629 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-07 13:44:52,630 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 13:44:52,630 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 13:44:52,630 INFO L410 AbstractCegarLoop]: === Iteration 16 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 13:44:52,630 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 13:44:52,630 INFO L82 PathProgramCache]: Analyzing trace with hash -1103053199, now seen corresponding path program 4 times [2019-12-07 13:44:52,630 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 13:44:52,630 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2050699523] [2019-12-07 13:44:52,630 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 13:44:52,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 13:44:52,688 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 13:44:52,688 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2050699523] [2019-12-07 13:44:52,688 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 13:44:52,688 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 13:44:52,688 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [663105168] [2019-12-07 13:44:52,689 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 13:44:52,689 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 13:44:52,689 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 13:44:52,689 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-07 13:44:52,689 INFO L87 Difference]: Start difference. First operand 2977 states and 8265 transitions. Second operand 4 states. [2019-12-07 13:44:52,713 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 13:44:52,713 INFO L93 Difference]: Finished difference Result 3384 states and 9200 transitions. [2019-12-07 13:44:52,713 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 13:44:52,714 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 65 [2019-12-07 13:44:52,714 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 13:44:52,714 INFO L225 Difference]: With dead ends: 3384 [2019-12-07 13:44:52,714 INFO L226 Difference]: Without dead ends: 484 [2019-12-07 13:44:52,715 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 13:44:52,716 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 484 states. [2019-12-07 13:44:52,720 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 484 to 484. [2019-12-07 13:44:52,720 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 484 states. [2019-12-07 13:44:52,721 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 484 states to 484 states and 1061 transitions. [2019-12-07 13:44:52,721 INFO L78 Accepts]: Start accepts. Automaton has 484 states and 1061 transitions. Word has length 65 [2019-12-07 13:44:52,721 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 13:44:52,721 INFO L462 AbstractCegarLoop]: Abstraction has 484 states and 1061 transitions. [2019-12-07 13:44:52,721 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 13:44:52,722 INFO L276 IsEmpty]: Start isEmpty. Operand 484 states and 1061 transitions. [2019-12-07 13:44:52,722 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-07 13:44:52,722 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 13:44:52,722 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 13:44:52,723 INFO L410 AbstractCegarLoop]: === Iteration 17 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 13:44:52,723 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 13:44:52,723 INFO L82 PathProgramCache]: Analyzing trace with hash 160851567, now seen corresponding path program 5 times [2019-12-07 13:44:52,723 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 13:44:52,723 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1569759610] [2019-12-07 13:44:52,723 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 13:44:52,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 13:44:52,797 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 13:44:52,797 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1569759610] [2019-12-07 13:44:52,797 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 13:44:52,797 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 13:44:52,797 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [233235237] [2019-12-07 13:44:52,797 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-07 13:44:52,797 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 13:44:52,798 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-07 13:44:52,798 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-12-07 13:44:52,798 INFO L87 Difference]: Start difference. First operand 484 states and 1061 transitions. Second operand 6 states. [2019-12-07 13:44:52,844 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 13:44:52,844 INFO L93 Difference]: Finished difference Result 955 states and 2108 transitions. [2019-12-07 13:44:52,844 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-07 13:44:52,845 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 65 [2019-12-07 13:44:52,845 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 13:44:52,845 INFO L225 Difference]: With dead ends: 955 [2019-12-07 13:44:52,845 INFO L226 Difference]: Without dead ends: 484 [2019-12-07 13:44:52,845 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2019-12-07 13:44:52,847 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 484 states. [2019-12-07 13:44:52,849 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 484 to 484. [2019-12-07 13:44:52,849 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 484 states. [2019-12-07 13:44:52,850 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 484 states to 484 states and 1060 transitions. [2019-12-07 13:44:52,850 INFO L78 Accepts]: Start accepts. Automaton has 484 states and 1060 transitions. Word has length 65 [2019-12-07 13:44:52,850 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 13:44:52,850 INFO L462 AbstractCegarLoop]: Abstraction has 484 states and 1060 transitions. [2019-12-07 13:44:52,850 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-07 13:44:52,850 INFO L276 IsEmpty]: Start isEmpty. Operand 484 states and 1060 transitions. [2019-12-07 13:44:52,851 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-12-07 13:44:52,851 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 13:44:52,851 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 13:44:52,851 INFO L410 AbstractCegarLoop]: === Iteration 18 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 13:44:52,851 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 13:44:52,851 INFO L82 PathProgramCache]: Analyzing trace with hash 1736859180, now seen corresponding path program 1 times [2019-12-07 13:44:52,851 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 13:44:52,851 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1597525457] [2019-12-07 13:44:52,851 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 13:44:52,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 13:44:52,900 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 13:44:52,900 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1597525457] [2019-12-07 13:44:52,900 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 13:44:52,900 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-07 13:44:52,900 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1483387493] [2019-12-07 13:44:52,901 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-07 13:44:52,901 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 13:44:52,901 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-07 13:44:52,901 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-12-07 13:44:52,901 INFO L87 Difference]: Start difference. First operand 484 states and 1060 transitions. Second operand 7 states. [2019-12-07 13:44:53,020 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 13:44:53,021 INFO L93 Difference]: Finished difference Result 989 states and 2130 transitions. [2019-12-07 13:44:53,021 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-12-07 13:44:53,021 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 66 [2019-12-07 13:44:53,021 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 13:44:53,022 INFO L225 Difference]: With dead ends: 989 [2019-12-07 13:44:53,022 INFO L226 Difference]: Without dead ends: 738 [2019-12-07 13:44:53,022 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2019-12-07 13:44:53,023 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 738 states. [2019-12-07 13:44:53,026 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 738 to 550. [2019-12-07 13:44:53,026 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 550 states. [2019-12-07 13:44:53,027 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 550 states to 550 states and 1179 transitions. [2019-12-07 13:44:53,027 INFO L78 Accepts]: Start accepts. Automaton has 550 states and 1179 transitions. Word has length 66 [2019-12-07 13:44:53,027 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 13:44:53,027 INFO L462 AbstractCegarLoop]: Abstraction has 550 states and 1179 transitions. [2019-12-07 13:44:53,027 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-07 13:44:53,027 INFO L276 IsEmpty]: Start isEmpty. Operand 550 states and 1179 transitions. [2019-12-07 13:44:53,028 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-12-07 13:44:53,028 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 13:44:53,028 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 13:44:53,028 INFO L410 AbstractCegarLoop]: === Iteration 19 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 13:44:53,028 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 13:44:53,028 INFO L82 PathProgramCache]: Analyzing trace with hash 1869585708, now seen corresponding path program 2 times [2019-12-07 13:44:53,028 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 13:44:53,029 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1810126434] [2019-12-07 13:44:53,029 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 13:44:53,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-07 13:44:53,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-07 13:44:53,106 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-07 13:44:53,107 INFO L475 BasicCegarLoop]: Counterexample might be feasible [2019-12-07 13:44:53,109 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1061] [1061] ULTIMATE.startENTRY-->L856: Formula: (let ((.cse0 (store |v_#valid_90| 0 0))) (and (= v_~__unbuffered_cnt~0_147 0) (= 0 v_~__unbuffered_p0_EAX~0_62) (= 0 (select .cse0 |v_ULTIMATE.start_main_~#t205~0.base_44|)) (= v_~z$r_buff0_thd1~0_96 0) (= 0 v_~__unbuffered_p2_EAX~0_75) (= 0 v_~z$mem_tmp~0_203) (= v_~z$read_delayed_var~0.offset_6 0) (= v_~z$r_buff1_thd1~0_165 0) (= v_~__unbuffered_p2_EBX~0_79 0) (= 0 v_~z$flush_delayed~0_235) (= 0 v_~z$r_buff0_thd4~0_512) (= |v_ULTIMATE.start_main_~#t205~0.offset_28| 0) (= 0 v_~z$r_buff0_thd3~0_418) (< |v_#StackHeapBarrier_18| |v_ULTIMATE.start_main_~#t205~0.base_44|) (= v_~z$w_buff0_used~0_907 0) (= v_~z$read_delayed_var~0.base_6 0) (= v_~weak$$choice2~0_286 0) (< 0 |v_#StackHeapBarrier_18|) (= 0 v_~__unbuffered_p3_EBX~0_60) (= (store |v_#memory_int_30| |v_ULTIMATE.start_main_~#t205~0.base_44| (store (select |v_#memory_int_30| |v_ULTIMATE.start_main_~#t205~0.base_44|) |v_ULTIMATE.start_main_~#t205~0.offset_28| 0)) |v_#memory_int_29|) (= v_~z$w_buff0~0_341 0) (= |v_#length_29| (store |v_#length_30| |v_ULTIMATE.start_main_~#t205~0.base_44| 4)) (= 0 v_~__unbuffered_p3_EAX~0_66) (= v_~z$read_delayed~0_7 0) (= v_~z$r_buff0_thd0~0_165 0) (= v_~a~0_32 0) (= |v_#NULL.offset_5| 0) (= 0 v_~z$r_buff1_thd3~0_405) (= v_~z$r_buff0_thd2~0_96 0) (= v_~y~0_94 0) (= 0 v_~weak$$choice0~0_191) (= v_~z$w_buff1~0_234 0) (= v_~x~0_46 0) (= v_~main$tmp_guard1~0_52 0) (= v_~z$w_buff1_used~0_667 0) (= v_~z$r_buff1_thd2~0_165 0) (= |v_#valid_88| (store .cse0 |v_ULTIMATE.start_main_~#t205~0.base_44| 1)) (= 0 |v_#NULL.base_5|) (= 0 v_~z$r_buff1_thd4~0_334) (= v_~z~0_304 0) (= v_~z$r_buff1_thd0~0_255 0) (= v_~main$tmp_guard0~0_37 0))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_18|, #valid=|v_#valid_90|, #memory_int=|v_#memory_int_30|, #length=|v_#length_30|} OutVars{ULTIMATE.start_main_~#t205~0.offset=|v_ULTIMATE.start_main_~#t205~0.offset_28|, ULTIMATE.start_main_#t~nondet57=|v_ULTIMATE.start_main_#t~nondet57_8|, ULTIMATE.start_main_#t~nondet55=|v_ULTIMATE.start_main_#t~nondet55_8|, ~z$r_buff1_thd2~0=v_~z$r_buff1_thd2~0_165, #NULL.offset=|v_#NULL.offset_5|, ULTIMATE.start_main_~#t208~0.offset=|v_ULTIMATE.start_main_~#t208~0.offset_18|, ULTIMATE.start_main_#t~ite64=|v_ULTIMATE.start_main_#t~ite64_104|, ~a~0=v_~a~0_32, ~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_165, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_62, ULTIMATE.start_main_~#t206~0.base=|v_ULTIMATE.start_main_~#t206~0.base_36|, ~z$r_buff0_thd4~0=v_~z$r_buff0_thd4~0_512, ~__unbuffered_p3_EAX~0=v_~__unbuffered_p3_EAX~0_66, #length=|v_#length_29|, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_75, ULTIMATE.start_main_~#t208~0.base=|v_ULTIMATE.start_main_~#t208~0.base_24|, ~z$mem_tmp~0=v_~z$mem_tmp~0_203, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_79, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_667, ~z$flush_delayed~0=v_~z$flush_delayed~0_235, ULTIMATE.start_main_~#t206~0.offset=|v_ULTIMATE.start_main_~#t206~0.offset_24|, ULTIMATE.start_main_#t~ite63=|v_ULTIMATE.start_main_#t~ite63_28|, ~weak$$choice0~0=v_~weak$$choice0~0_191, #StackHeapBarrier=|v_#StackHeapBarrier_18|, ULTIMATE.start_main_#t~ite61=|v_ULTIMATE.start_main_#t~ite61_206|, ~z$r_buff1_thd1~0=v_~z$r_buff1_thd1~0_165, ~z$read_delayed_var~0.base=v_~z$read_delayed_var~0.base_6, ~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_418, ULTIMATE.start_main_~#t207~0.offset=|v_ULTIMATE.start_main_~#t207~0.offset_18|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_147, ~x~0=v_~x~0_46, ~z$r_buff1_thd4~0=v_~z$r_buff1_thd4~0_334, ULTIMATE.start_main_#t~nondet58=|v_ULTIMATE.start_main_#t~nondet58_21|, ULTIMATE.start_main_#t~nondet56=|v_ULTIMATE.start_main_#t~nondet56_8|, ~z$read_delayed~0=v_~z$read_delayed~0_7, ~z$w_buff1~0=v_~z$w_buff1~0_234, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_52, ~z$read_delayed_var~0.offset=v_~z$read_delayed_var~0.offset_6, ULTIMATE.start_main_~#t207~0.base=|v_ULTIMATE.start_main_~#t207~0.base_23|, ~z$r_buff1_thd0~0=v_~z$r_buff1_thd0~0_255, ~y~0=v_~y~0_94, ~z$r_buff0_thd2~0=v_~z$r_buff0_thd2~0_96, ULTIMATE.start_main_~#t205~0.base=|v_ULTIMATE.start_main_~#t205~0.base_44|, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_907, ~z$w_buff0~0=v_~z$w_buff0~0_341, ~z$r_buff1_thd3~0=v_~z$r_buff1_thd3~0_405, ULTIMATE.start_main_#t~ite59=|v_ULTIMATE.start_main_#t~ite59_68|, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_37, ~__unbuffered_p3_EBX~0=v_~__unbuffered_p3_EBX~0_60, #NULL.base=|v_#NULL.base_5|, ULTIMATE.start_main_#t~ite62=|v_ULTIMATE.start_main_#t~ite62_80|, ULTIMATE.start_main_#t~ite60=|v_ULTIMATE.start_main_#t~ite60_97|, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_27|, #valid=|v_#valid_88|, #memory_int=|v_#memory_int_29|, ~z~0=v_~z~0_304, ~weak$$choice2~0=v_~weak$$choice2~0_286, ~z$r_buff0_thd1~0=v_~z$r_buff0_thd1~0_96} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t205~0.offset, ULTIMATE.start_main_#t~nondet57, ULTIMATE.start_main_#t~nondet55, ~z$r_buff1_thd2~0, #NULL.offset, ULTIMATE.start_main_~#t208~0.offset, ULTIMATE.start_main_#t~ite64, ~a~0, ~z$r_buff0_thd0~0, ~__unbuffered_p0_EAX~0, ULTIMATE.start_main_~#t206~0.base, ~z$r_buff0_thd4~0, ~__unbuffered_p3_EAX~0, #length, ~__unbuffered_p2_EAX~0, ULTIMATE.start_main_~#t208~0.base, ~z$mem_tmp~0, ~__unbuffered_p2_EBX~0, ~z$w_buff1_used~0, ~z$flush_delayed~0, ULTIMATE.start_main_~#t206~0.offset, ULTIMATE.start_main_#t~ite63, ~weak$$choice0~0, ULTIMATE.start_main_#t~ite61, ~z$r_buff1_thd1~0, ~z$read_delayed_var~0.base, ~z$r_buff0_thd3~0, ULTIMATE.start_main_~#t207~0.offset, ~__unbuffered_cnt~0, ~x~0, ~z$r_buff1_thd4~0, ULTIMATE.start_main_#t~nondet58, ULTIMATE.start_main_#t~nondet56, ~z$read_delayed~0, ~z$w_buff1~0, ~main$tmp_guard1~0, ~z$read_delayed_var~0.offset, ULTIMATE.start_main_~#t207~0.base, ~z$r_buff1_thd0~0, ~y~0, ~z$r_buff0_thd2~0, ULTIMATE.start_main_~#t205~0.base, ~z$w_buff0_used~0, ~z$w_buff0~0, ~z$r_buff1_thd3~0, ULTIMATE.start_main_#t~ite59, ~main$tmp_guard0~0, ~__unbuffered_p3_EBX~0, #NULL.base, ULTIMATE.start_main_#t~ite62, ULTIMATE.start_main_#t~ite60, ULTIMATE.start_main_#res, #valid, #memory_int, ~z~0, ~weak$$choice2~0, ~z$r_buff0_thd1~0] because there is no mapped edge [2019-12-07 13:44:53,110 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1033] [1033] L856-1-->L858: Formula: (and (= |v_#length_19| (store |v_#length_20| |v_ULTIMATE.start_main_~#t206~0.base_11| 4)) (not (= 0 |v_ULTIMATE.start_main_~#t206~0.base_11|)) (= |v_ULTIMATE.start_main_~#t206~0.offset_10| 0) (= (select |v_#valid_45| |v_ULTIMATE.start_main_~#t206~0.base_11|) 0) (= (store |v_#memory_int_20| |v_ULTIMATE.start_main_~#t206~0.base_11| (store (select |v_#memory_int_20| |v_ULTIMATE.start_main_~#t206~0.base_11|) |v_ULTIMATE.start_main_~#t206~0.offset_10| 1)) |v_#memory_int_19|) (< |v_#StackHeapBarrier_11| |v_ULTIMATE.start_main_~#t206~0.base_11|) (= (store |v_#valid_45| |v_ULTIMATE.start_main_~#t206~0.base_11| 1) |v_#valid_44|)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_11|, #valid=|v_#valid_45|, #memory_int=|v_#memory_int_20|, #length=|v_#length_20|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_11|, ULTIMATE.start_main_~#t206~0.base=|v_ULTIMATE.start_main_~#t206~0.base_11|, ULTIMATE.start_main_#t~nondet55=|v_ULTIMATE.start_main_#t~nondet55_5|, #valid=|v_#valid_44|, #memory_int=|v_#memory_int_19|, #length=|v_#length_19|, ULTIMATE.start_main_~#t206~0.offset=|v_ULTIMATE.start_main_~#t206~0.offset_10|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t206~0.base, ULTIMATE.start_main_#t~nondet55, #valid, #memory_int, #length, ULTIMATE.start_main_~#t206~0.offset] because there is no mapped edge [2019-12-07 13:44:53,110 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1035] [1035] L858-1-->L860: Formula: (and (= (store |v_#memory_int_22| |v_ULTIMATE.start_main_~#t207~0.base_12| (store (select |v_#memory_int_22| |v_ULTIMATE.start_main_~#t207~0.base_12|) |v_ULTIMATE.start_main_~#t207~0.offset_11| 2)) |v_#memory_int_21|) (= (store |v_#valid_49| |v_ULTIMATE.start_main_~#t207~0.base_12| 1) |v_#valid_48|) (= |v_ULTIMATE.start_main_~#t207~0.offset_11| 0) (< |v_#StackHeapBarrier_13| |v_ULTIMATE.start_main_~#t207~0.base_12|) (not (= |v_ULTIMATE.start_main_~#t207~0.base_12| 0)) (= 0 (select |v_#valid_49| |v_ULTIMATE.start_main_~#t207~0.base_12|)) (= (store |v_#length_22| |v_ULTIMATE.start_main_~#t207~0.base_12| 4) |v_#length_21|)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_13|, #valid=|v_#valid_49|, #memory_int=|v_#memory_int_22|, #length=|v_#length_22|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_13|, #valid=|v_#valid_48|, ULTIMATE.start_main_#t~nondet56=|v_ULTIMATE.start_main_#t~nondet56_5|, #memory_int=|v_#memory_int_21|, ULTIMATE.start_main_~#t207~0.offset=|v_ULTIMATE.start_main_~#t207~0.offset_11|, #length=|v_#length_21|, ULTIMATE.start_main_~#t207~0.base=|v_ULTIMATE.start_main_~#t207~0.base_12|} AuxVars[] AssignedVars[#valid, ULTIMATE.start_main_#t~nondet56, #memory_int, ULTIMATE.start_main_~#t207~0.offset, #length, ULTIMATE.start_main_~#t207~0.base] because there is no mapped edge [2019-12-07 13:44:53,111 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1037] [1037] L860-1-->L862: Formula: (and (= (select |v_#valid_51| |v_ULTIMATE.start_main_~#t208~0.base_13|) 0) (< |v_#StackHeapBarrier_14| |v_ULTIMATE.start_main_~#t208~0.base_13|) (= |v_#length_23| (store |v_#length_24| |v_ULTIMATE.start_main_~#t208~0.base_13| 4)) (= |v_#valid_50| (store |v_#valid_51| |v_ULTIMATE.start_main_~#t208~0.base_13| 1)) (= |v_ULTIMATE.start_main_~#t208~0.offset_11| 0) (= (store |v_#memory_int_24| |v_ULTIMATE.start_main_~#t208~0.base_13| (store (select |v_#memory_int_24| |v_ULTIMATE.start_main_~#t208~0.base_13|) |v_ULTIMATE.start_main_~#t208~0.offset_11| 3)) |v_#memory_int_23|) (not (= 0 |v_ULTIMATE.start_main_~#t208~0.base_13|))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_14|, #valid=|v_#valid_51|, #memory_int=|v_#memory_int_24|, #length=|v_#length_24|} OutVars{ULTIMATE.start_main_~#t208~0.base=|v_ULTIMATE.start_main_~#t208~0.base_13|, #StackHeapBarrier=|v_#StackHeapBarrier_14|, ULTIMATE.start_main_#t~nondet57=|v_ULTIMATE.start_main_#t~nondet57_5|, #valid=|v_#valid_50|, #memory_int=|v_#memory_int_23|, #length=|v_#length_23|, ULTIMATE.start_main_~#t208~0.offset=|v_ULTIMATE.start_main_~#t208~0.offset_11|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t208~0.base, ULTIMATE.start_main_#t~nondet57, #valid, #memory_int, #length, ULTIMATE.start_main_~#t208~0.offset] because there is no mapped edge [2019-12-07 13:44:53,111 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [907] [907] P3ENTRY-->L4-3: Formula: (and (= 1 v_~z$w_buff0~0_34) (= v_~z$w_buff0~0_35 v_~z$w_buff1~0_22) (= |v_P3Thread1of1ForFork2_#in~arg.offset_9| v_P3Thread1of1ForFork2_~arg.offset_7) (= (ite (not (and (not (= (mod v_~z$w_buff0_used~0_105 256) 0)) (not (= (mod v_~z$w_buff1_used~0_57 256) 0)))) 1 0) |v_P3Thread1of1ForFork2___VERIFIER_assert_#in~expression_7|) (not (= v_P3Thread1of1ForFork2___VERIFIER_assert_~expression_9 0)) (= v_P3Thread1of1ForFork2_~arg.base_7 |v_P3Thread1of1ForFork2_#in~arg.base_9|) (= v_~z$w_buff0_used~0_106 v_~z$w_buff1_used~0_57) (= v_~z$w_buff0_used~0_105 1) (= v_P3Thread1of1ForFork2___VERIFIER_assert_~expression_9 |v_P3Thread1of1ForFork2___VERIFIER_assert_#in~expression_7|)) InVars {~z$w_buff0_used~0=v_~z$w_buff0_used~0_106, ~z$w_buff0~0=v_~z$w_buff0~0_35, P3Thread1of1ForFork2_#in~arg.offset=|v_P3Thread1of1ForFork2_#in~arg.offset_9|, P3Thread1of1ForFork2_#in~arg.base=|v_P3Thread1of1ForFork2_#in~arg.base_9|} OutVars{P3Thread1of1ForFork2___VERIFIER_assert_~expression=v_P3Thread1of1ForFork2___VERIFIER_assert_~expression_9, P3Thread1of1ForFork2_~arg.offset=v_P3Thread1of1ForFork2_~arg.offset_7, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_105, ~z$w_buff0~0=v_~z$w_buff0~0_34, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_57, P3Thread1of1ForFork2_#in~arg.offset=|v_P3Thread1of1ForFork2_#in~arg.offset_9|, ~z$w_buff1~0=v_~z$w_buff1~0_22, P3Thread1of1ForFork2___VERIFIER_assert_#in~expression=|v_P3Thread1of1ForFork2___VERIFIER_assert_#in~expression_7|, P3Thread1of1ForFork2_~arg.base=v_P3Thread1of1ForFork2_~arg.base_7, P3Thread1of1ForFork2_#in~arg.base=|v_P3Thread1of1ForFork2_#in~arg.base_9|} AuxVars[] AssignedVars[P3Thread1of1ForFork2___VERIFIER_assert_~expression, P3Thread1of1ForFork2_~arg.offset, ~z$w_buff0_used~0, ~z$w_buff0~0, ~z$w_buff1_used~0, ~z$w_buff1~0, P3Thread1of1ForFork2___VERIFIER_assert_#in~expression, P3Thread1of1ForFork2_~arg.base] because there is no mapped edge [2019-12-07 13:44:53,112 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [984] [984] L818-2-->L818-5: Formula: (let ((.cse1 (= |P3Thread1of1ForFork2_#t~ite29_Out-1065028430| |P3Thread1of1ForFork2_#t~ite28_Out-1065028430|)) (.cse2 (= (mod ~z$r_buff0_thd4~0_In-1065028430 256) 0)) (.cse0 (= 0 (mod ~z$w_buff0_used~0_In-1065028430 256)))) (or (and (not .cse0) .cse1 (= |P3Thread1of1ForFork2_#t~ite28_Out-1065028430| ~z$w_buff0~0_In-1065028430) (not .cse2)) (and .cse1 (or .cse2 .cse0) (= |P3Thread1of1ForFork2_#t~ite28_Out-1065028430| ~z$w_buff1~0_In-1065028430)))) InVars {~z$w_buff0~0=~z$w_buff0~0_In-1065028430, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1065028430, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In-1065028430, ~z$w_buff1~0=~z$w_buff1~0_In-1065028430} OutVars{P3Thread1of1ForFork2_#t~ite29=|P3Thread1of1ForFork2_#t~ite29_Out-1065028430|, P3Thread1of1ForFork2_#t~ite28=|P3Thread1of1ForFork2_#t~ite28_Out-1065028430|, ~z$w_buff0~0=~z$w_buff0~0_In-1065028430, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1065028430, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In-1065028430, ~z$w_buff1~0=~z$w_buff1~0_In-1065028430} AuxVars[] AssignedVars[P3Thread1of1ForFork2_#t~ite29, P3Thread1of1ForFork2_#t~ite28] because there is no mapped edge [2019-12-07 13:44:53,115 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [942] [942] L823-->L824: Formula: (and (= v_~z$r_buff0_thd4~0_105 v_~z$r_buff0_thd4~0_104) (not (= 0 (mod v_~weak$$choice2~0_68 256)))) InVars {~z$r_buff0_thd4~0=v_~z$r_buff0_thd4~0_105, ~weak$$choice2~0=v_~weak$$choice2~0_68} OutVars{P3Thread1of1ForFork2_#t~ite42=|v_P3Thread1of1ForFork2_#t~ite42_6|, P3Thread1of1ForFork2_#t~ite43=|v_P3Thread1of1ForFork2_#t~ite43_9|, P3Thread1of1ForFork2_#t~ite44=|v_P3Thread1of1ForFork2_#t~ite44_9|, ~z$r_buff0_thd4~0=v_~z$r_buff0_thd4~0_104, ~weak$$choice2~0=v_~weak$$choice2~0_68} AuxVars[] AssignedVars[P3Thread1of1ForFork2_#t~ite42, P3Thread1of1ForFork2_#t~ite43, P3Thread1of1ForFork2_#t~ite44, ~z$r_buff0_thd4~0] because there is no mapped edge [2019-12-07 13:44:53,116 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [978] [978] L826-->L826-2: Formula: (let ((.cse0 (= 0 (mod ~z$flush_delayed~0_In2020964158 256)))) (or (and (= ~z~0_In2020964158 |P3Thread1of1ForFork2_#t~ite48_Out2020964158|) .cse0) (and (not .cse0) (= |P3Thread1of1ForFork2_#t~ite48_Out2020964158| ~z$mem_tmp~0_In2020964158)))) InVars {~z$mem_tmp~0=~z$mem_tmp~0_In2020964158, ~z$flush_delayed~0=~z$flush_delayed~0_In2020964158, ~z~0=~z~0_In2020964158} OutVars{~z$mem_tmp~0=~z$mem_tmp~0_In2020964158, P3Thread1of1ForFork2_#t~ite48=|P3Thread1of1ForFork2_#t~ite48_Out2020964158|, ~z$flush_delayed~0=~z$flush_delayed~0_In2020964158, ~z~0=~z~0_In2020964158} AuxVars[] AssignedVars[P3Thread1of1ForFork2_#t~ite48] because there is no mapped edge [2019-12-07 13:44:53,117 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1028] [1028] P0ENTRY-->P0EXIT: Formula: (and (= 0 |v_P0Thread1of1ForFork3_#res.base_3|) (= v_~__unbuffered_cnt~0_71 (+ v_~__unbuffered_cnt~0_72 1)) (= v_~x~0_14 v_~__unbuffered_p0_EAX~0_18) (= v_~a~0_16 1) (= |v_P0Thread1of1ForFork3_#in~arg.offset_10| v_P0Thread1of1ForFork3_~arg.offset_8) (= |v_P0Thread1of1ForFork3_#res.offset_3| 0) (= v_P0Thread1of1ForFork3_~arg.base_8 |v_P0Thread1of1ForFork3_#in~arg.base_10|)) InVars {P0Thread1of1ForFork3_#in~arg.offset=|v_P0Thread1of1ForFork3_#in~arg.offset_10|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_72, P0Thread1of1ForFork3_#in~arg.base=|v_P0Thread1of1ForFork3_#in~arg.base_10|, ~x~0=v_~x~0_14} OutVars{~a~0=v_~a~0_16, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_18, P0Thread1of1ForFork3_#in~arg.offset=|v_P0Thread1of1ForFork3_#in~arg.offset_10|, P0Thread1of1ForFork3_~arg.base=v_P0Thread1of1ForFork3_~arg.base_8, P0Thread1of1ForFork3_#res.base=|v_P0Thread1of1ForFork3_#res.base_3|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_71, P0Thread1of1ForFork3_#res.offset=|v_P0Thread1of1ForFork3_#res.offset_3|, P0Thread1of1ForFork3_~arg.offset=v_P0Thread1of1ForFork3_~arg.offset_8, P0Thread1of1ForFork3_#in~arg.base=|v_P0Thread1of1ForFork3_#in~arg.base_10|, ~x~0=v_~x~0_14} AuxVars[] AssignedVars[~a~0, ~__unbuffered_p0_EAX~0, P0Thread1of1ForFork3_~arg.base, P0Thread1of1ForFork3_#res.base, ~__unbuffered_cnt~0, P0Thread1of1ForFork3_#res.offset, P0Thread1of1ForFork3_~arg.offset] because there is no mapped edge [2019-12-07 13:44:53,117 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1027] [1027] P1ENTRY-->P1EXIT: Formula: (and (= 0 |v_P1Thread1of1ForFork0_#res.offset_3|) (= v_P1Thread1of1ForFork0_~arg.base_4 |v_P1Thread1of1ForFork0_#in~arg.base_6|) (= (+ v_~__unbuffered_cnt~0_66 1) v_~__unbuffered_cnt~0_65) (= v_~y~0_39 1) (= v_~x~0_11 1) (= 0 |v_P1Thread1of1ForFork0_#res.base_3|) (= v_P1Thread1of1ForFork0_~arg.offset_4 |v_P1Thread1of1ForFork0_#in~arg.offset_6|)) InVars {P1Thread1of1ForFork0_#in~arg.base=|v_P1Thread1of1ForFork0_#in~arg.base_6|, P1Thread1of1ForFork0_#in~arg.offset=|v_P1Thread1of1ForFork0_#in~arg.offset_6|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_66} OutVars{P1Thread1of1ForFork0_~arg.offset=v_P1Thread1of1ForFork0_~arg.offset_4, P1Thread1of1ForFork0_~arg.base=v_P1Thread1of1ForFork0_~arg.base_4, P1Thread1of1ForFork0_#in~arg.base=|v_P1Thread1of1ForFork0_#in~arg.base_6|, P1Thread1of1ForFork0_#in~arg.offset=|v_P1Thread1of1ForFork0_#in~arg.offset_6|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_65, P1Thread1of1ForFork0_#res.offset=|v_P1Thread1of1ForFork0_#res.offset_3|, ~y~0=v_~y~0_39, P1Thread1of1ForFork0_#res.base=|v_P1Thread1of1ForFork0_#res.base_3|, ~x~0=v_~x~0_11} AuxVars[] AssignedVars[P1Thread1of1ForFork0_~arg.offset, P1Thread1of1ForFork0_~arg.base, ~__unbuffered_cnt~0, P1Thread1of1ForFork0_#res.offset, ~y~0, P1Thread1of1ForFork0_#res.base, ~x~0] because there is no mapped edge [2019-12-07 13:44:53,124 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [983] [983] L788-->L788-2: Formula: (let ((.cse0 (= 0 (mod ~z$flush_delayed~0_In-39332699 256)))) (or (and (= |P2Thread1of1ForFork1_#t~ite25_Out-39332699| ~z~0_In-39332699) .cse0) (and (not .cse0) (= ~z$mem_tmp~0_In-39332699 |P2Thread1of1ForFork1_#t~ite25_Out-39332699|)))) InVars {~z$mem_tmp~0=~z$mem_tmp~0_In-39332699, ~z$flush_delayed~0=~z$flush_delayed~0_In-39332699, ~z~0=~z~0_In-39332699} OutVars{~z$mem_tmp~0=~z$mem_tmp~0_In-39332699, P2Thread1of1ForFork1_#t~ite25=|P2Thread1of1ForFork1_#t~ite25_Out-39332699|, ~z$flush_delayed~0=~z$flush_delayed~0_In-39332699, ~z~0=~z~0_In-39332699} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite25] because there is no mapped edge [2019-12-07 13:44:53,124 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [997] [997] L834-->L834-2: Formula: (let ((.cse1 (= 0 (mod ~z$w_buff0_used~0_In-988481534 256))) (.cse0 (= 0 (mod ~z$r_buff0_thd4~0_In-988481534 256)))) (or (and (= 0 |P3Thread1of1ForFork2_#t~ite51_Out-988481534|) (not .cse0) (not .cse1)) (and (or .cse1 .cse0) (= ~z$w_buff0_used~0_In-988481534 |P3Thread1of1ForFork2_#t~ite51_Out-988481534|)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-988481534, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In-988481534} OutVars{P3Thread1of1ForFork2_#t~ite51=|P3Thread1of1ForFork2_#t~ite51_Out-988481534|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-988481534, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In-988481534} AuxVars[] AssignedVars[P3Thread1of1ForFork2_#t~ite51] because there is no mapped edge [2019-12-07 13:44:53,125 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [986] [986] L835-->L835-2: Formula: (let ((.cse2 (= (mod ~z$w_buff1_used~0_In-19083211 256) 0)) (.cse3 (= (mod ~z$r_buff1_thd4~0_In-19083211 256) 0)) (.cse1 (= 0 (mod ~z$r_buff0_thd4~0_In-19083211 256))) (.cse0 (= (mod ~z$w_buff0_used~0_In-19083211 256) 0))) (or (and (= 0 |P3Thread1of1ForFork2_#t~ite52_Out-19083211|) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (= ~z$w_buff1_used~0_In-19083211 |P3Thread1of1ForFork2_#t~ite52_Out-19083211|) (or .cse2 .cse3) (or .cse1 .cse0)))) InVars {~z$r_buff1_thd4~0=~z$r_buff1_thd4~0_In-19083211, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-19083211, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In-19083211, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-19083211} OutVars{P3Thread1of1ForFork2_#t~ite52=|P3Thread1of1ForFork2_#t~ite52_Out-19083211|, ~z$r_buff1_thd4~0=~z$r_buff1_thd4~0_In-19083211, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-19083211, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In-19083211, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-19083211} AuxVars[] AssignedVars[P3Thread1of1ForFork2_#t~ite52] because there is no mapped edge [2019-12-07 13:44:53,125 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [982] [982] L836-->L837: Formula: (let ((.cse1 (= 0 (mod ~z$w_buff0_used~0_In-870090006 256))) (.cse0 (= ~z$r_buff0_thd4~0_Out-870090006 ~z$r_buff0_thd4~0_In-870090006)) (.cse2 (= 0 (mod ~z$r_buff0_thd4~0_In-870090006 256)))) (or (and .cse0 .cse1) (and (not .cse2) (= ~z$r_buff0_thd4~0_Out-870090006 0) (not .cse1)) (and .cse0 .cse2))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-870090006, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In-870090006} OutVars{P3Thread1of1ForFork2_#t~ite53=|P3Thread1of1ForFork2_#t~ite53_Out-870090006|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-870090006, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_Out-870090006} AuxVars[] AssignedVars[P3Thread1of1ForFork2_#t~ite53, ~z$r_buff0_thd4~0] because there is no mapped edge [2019-12-07 13:44:53,125 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [981] [981] L837-->L837-2: Formula: (let ((.cse3 (= 0 (mod ~z$r_buff0_thd4~0_In958371948 256))) (.cse2 (= 0 (mod ~z$w_buff0_used~0_In958371948 256))) (.cse1 (= (mod ~z$r_buff1_thd4~0_In958371948 256) 0)) (.cse0 (= 0 (mod ~z$w_buff1_used~0_In958371948 256)))) (or (and (or .cse0 .cse1) (or .cse2 .cse3) (= ~z$r_buff1_thd4~0_In958371948 |P3Thread1of1ForFork2_#t~ite54_Out958371948|)) (and (= 0 |P3Thread1of1ForFork2_#t~ite54_Out958371948|) (or (and (not .cse3) (not .cse2)) (and (not .cse1) (not .cse0)))))) InVars {~z$r_buff1_thd4~0=~z$r_buff1_thd4~0_In958371948, ~z$w_buff0_used~0=~z$w_buff0_used~0_In958371948, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In958371948, ~z$w_buff1_used~0=~z$w_buff1_used~0_In958371948} OutVars{P3Thread1of1ForFork2_#t~ite54=|P3Thread1of1ForFork2_#t~ite54_Out958371948|, ~z$r_buff1_thd4~0=~z$r_buff1_thd4~0_In958371948, ~z$w_buff0_used~0=~z$w_buff0_used~0_In958371948, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In958371948, ~z$w_buff1_used~0=~z$w_buff1_used~0_In958371948} AuxVars[] AssignedVars[P3Thread1of1ForFork2_#t~ite54] because there is no mapped edge [2019-12-07 13:44:53,126 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1032] [1032] L837-2-->P3EXIT: Formula: (and (= |v_P3Thread1of1ForFork2_#t~ite54_30| v_~z$r_buff1_thd4~0_260) (= 0 |v_P3Thread1of1ForFork2_#res.base_3|) (= 0 |v_P3Thread1of1ForFork2_#res.offset_3|) (= (+ v_~__unbuffered_cnt~0_84 1) v_~__unbuffered_cnt~0_83)) InVars {P3Thread1of1ForFork2_#t~ite54=|v_P3Thread1of1ForFork2_#t~ite54_30|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_84} OutVars{P3Thread1of1ForFork2_#t~ite54=|v_P3Thread1of1ForFork2_#t~ite54_29|, P3Thread1of1ForFork2_#res.base=|v_P3Thread1of1ForFork2_#res.base_3|, ~z$r_buff1_thd4~0=v_~z$r_buff1_thd4~0_260, P3Thread1of1ForFork2_#res.offset=|v_P3Thread1of1ForFork2_#res.offset_3|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_83} AuxVars[] AssignedVars[P3Thread1of1ForFork2_#t~ite54, P3Thread1of1ForFork2_#res.base, ~z$r_buff1_thd4~0, P3Thread1of1ForFork2_#res.offset, ~__unbuffered_cnt~0] because there is no mapped edge [2019-12-07 13:44:53,126 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1023] [1023] L788-2-->P2EXIT: Formula: (and (= 0 |v_P2Thread1of1ForFork1_#res.offset_3|) (= 0 v_~z$flush_delayed~0_189) (= v_~z~0_189 |v_P2Thread1of1ForFork1_#t~ite25_44|) (= (+ v_~__unbuffered_cnt~0_56 1) v_~__unbuffered_cnt~0_55) (= 0 |v_P2Thread1of1ForFork1_#res.base_3|)) InVars {P2Thread1of1ForFork1_#t~ite25=|v_P2Thread1of1ForFork1_#t~ite25_44|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_56} OutVars{P2Thread1of1ForFork1_#t~ite25=|v_P2Thread1of1ForFork1_#t~ite25_43|, P2Thread1of1ForFork1_#res.base=|v_P2Thread1of1ForFork1_#res.base_3|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_55, ~z$flush_delayed~0=v_~z$flush_delayed~0_189, ~z~0=v_~z~0_189, P2Thread1of1ForFork1_#res.offset=|v_P2Thread1of1ForFork1_#res.offset_3|} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite25, P2Thread1of1ForFork1_#res.base, ~__unbuffered_cnt~0, ~z$flush_delayed~0, ~z~0, P2Thread1of1ForFork1_#res.offset] because there is no mapped edge [2019-12-07 13:44:53,126 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [908] [908] L866-->L868-2: Formula: (and (or (= (mod v_~z$w_buff0_used~0_107 256) 0) (= 0 (mod v_~z$r_buff0_thd0~0_14 256))) (not (= (mod v_~main$tmp_guard0~0_4 256) 0))) InVars {~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_14, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_107, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_4} OutVars{~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_14, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_107, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_4} AuxVars[] AssignedVars[] because there is no mapped edge [2019-12-07 13:44:53,126 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [980] [980] L868-2-->L868-5: Formula: (let ((.cse0 (= |ULTIMATE.start_main_#t~ite59_Out215125788| |ULTIMATE.start_main_#t~ite60_Out215125788|)) (.cse2 (= 0 (mod ~z$w_buff1_used~0_In215125788 256))) (.cse1 (= 0 (mod ~z$r_buff1_thd0~0_In215125788 256)))) (or (and .cse0 (not .cse1) (not .cse2) (= |ULTIMATE.start_main_#t~ite59_Out215125788| ~z$w_buff1~0_In215125788)) (and .cse0 (= |ULTIMATE.start_main_#t~ite59_Out215125788| ~z~0_In215125788) (or .cse2 .cse1)))) InVars {~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In215125788, ~z$w_buff1_used~0=~z$w_buff1_used~0_In215125788, ~z$w_buff1~0=~z$w_buff1~0_In215125788, ~z~0=~z~0_In215125788} OutVars{ULTIMATE.start_main_#t~ite60=|ULTIMATE.start_main_#t~ite60_Out215125788|, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In215125788, ~z$w_buff1_used~0=~z$w_buff1_used~0_In215125788, ~z$w_buff1~0=~z$w_buff1~0_In215125788, ULTIMATE.start_main_#t~ite59=|ULTIMATE.start_main_#t~ite59_Out215125788|, ~z~0=~z~0_In215125788} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite60, ULTIMATE.start_main_#t~ite59] because there is no mapped edge [2019-12-07 13:44:53,127 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [995] [995] L869-->L869-2: Formula: (let ((.cse0 (= (mod ~z$r_buff0_thd0~0_In-1452461126 256) 0)) (.cse1 (= (mod ~z$w_buff0_used~0_In-1452461126 256) 0))) (or (and (= 0 |ULTIMATE.start_main_#t~ite61_Out-1452461126|) (not .cse0) (not .cse1)) (and (or .cse0 .cse1) (= |ULTIMATE.start_main_#t~ite61_Out-1452461126| ~z$w_buff0_used~0_In-1452461126)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-1452461126, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1452461126} OutVars{~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-1452461126, ULTIMATE.start_main_#t~ite61=|ULTIMATE.start_main_#t~ite61_Out-1452461126|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1452461126} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite61] because there is no mapped edge [2019-12-07 13:44:53,127 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1001] [1001] L870-->L870-2: Formula: (let ((.cse3 (= (mod ~z$w_buff0_used~0_In302605464 256) 0)) (.cse2 (= (mod ~z$r_buff0_thd0~0_In302605464 256) 0)) (.cse1 (= (mod ~z$r_buff1_thd0~0_In302605464 256) 0)) (.cse0 (= 0 (mod ~z$w_buff1_used~0_In302605464 256)))) (or (and (= |ULTIMATE.start_main_#t~ite62_Out302605464| 0) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse3 .cse2) (= |ULTIMATE.start_main_#t~ite62_Out302605464| ~z$w_buff1_used~0_In302605464) (or .cse1 .cse0)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In302605464, ~z$w_buff0_used~0=~z$w_buff0_used~0_In302605464, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In302605464, ~z$w_buff1_used~0=~z$w_buff1_used~0_In302605464} OutVars{ULTIMATE.start_main_#t~ite62=|ULTIMATE.start_main_#t~ite62_Out302605464|, ~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In302605464, ~z$w_buff0_used~0=~z$w_buff0_used~0_In302605464, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In302605464, ~z$w_buff1_used~0=~z$w_buff1_used~0_In302605464} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite62] because there is no mapped edge [2019-12-07 13:44:53,128 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [979] [979] L871-->L871-2: Formula: (let ((.cse0 (= (mod ~z$w_buff0_used~0_In574431356 256) 0)) (.cse1 (= (mod ~z$r_buff0_thd0~0_In574431356 256) 0))) (or (and (not .cse0) (= 0 |ULTIMATE.start_main_#t~ite63_Out574431356|) (not .cse1)) (and (= ~z$r_buff0_thd0~0_In574431356 |ULTIMATE.start_main_#t~ite63_Out574431356|) (or .cse0 .cse1)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In574431356, ~z$w_buff0_used~0=~z$w_buff0_used~0_In574431356} OutVars{ULTIMATE.start_main_#t~ite63=|ULTIMATE.start_main_#t~ite63_Out574431356|, ~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In574431356, ~z$w_buff0_used~0=~z$w_buff0_used~0_In574431356} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite63] because there is no mapped edge [2019-12-07 13:44:53,129 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [987] [987] L872-->L872-2: Formula: (let ((.cse2 (= (mod ~z$r_buff1_thd0~0_In887434408 256) 0)) (.cse3 (= (mod ~z$w_buff1_used~0_In887434408 256) 0)) (.cse0 (= 0 (mod ~z$w_buff0_used~0_In887434408 256))) (.cse1 (= (mod ~z$r_buff0_thd0~0_In887434408 256) 0))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= |ULTIMATE.start_main_#t~ite64_Out887434408| 0)) (and (or .cse2 .cse3) (= ~z$r_buff1_thd0~0_In887434408 |ULTIMATE.start_main_#t~ite64_Out887434408|) (or .cse0 .cse1)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In887434408, ~z$w_buff0_used~0=~z$w_buff0_used~0_In887434408, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In887434408, ~z$w_buff1_used~0=~z$w_buff1_used~0_In887434408} OutVars{~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In887434408, ~z$w_buff0_used~0=~z$w_buff0_used~0_In887434408, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In887434408, ~z$w_buff1_used~0=~z$w_buff1_used~0_In887434408, ULTIMATE.start_main_#t~ite64=|ULTIMATE.start_main_#t~ite64_Out887434408|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite64] because there is no mapped edge [2019-12-07 13:44:53,129 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1049] [1049] L872-2-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= |v_ULTIMATE.start___VERIFIER_assert_#in~expression_12| (mod v_~main$tmp_guard1~0_18 256)) (= v_~main$tmp_guard1~0_18 (ite (= 0 (ite (not (and (= 0 v_~__unbuffered_p0_EAX~0_26) (= 1 v_~__unbuffered_p3_EAX~0_28) (= 0 v_~__unbuffered_p3_EBX~0_24) (= v_~__unbuffered_p2_EBX~0_43 0) (= v_~y~0_52 2) (= 2 v_~__unbuffered_p2_EAX~0_41))) 1 0)) 0 1)) (= v_ULTIMATE.start___VERIFIER_assert_~expression_15 |v_ULTIMATE.start___VERIFIER_assert_#in~expression_12|) (= v_ULTIMATE.start___VERIFIER_assert_~expression_15 0) (= v_~z$r_buff1_thd0~0_221 |v_ULTIMATE.start_main_#t~ite64_41|)) InVars {~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_26, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_43, ~__unbuffered_p3_EAX~0=v_~__unbuffered_p3_EAX~0_28, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_41, ~__unbuffered_p3_EBX~0=v_~__unbuffered_p3_EBX~0_24, ~y~0=v_~y~0_52, ULTIMATE.start_main_#t~ite64=|v_ULTIMATE.start_main_#t~ite64_41|} OutVars{~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_26, ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_15, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_43, ~z$r_buff1_thd0~0=v_~z$r_buff1_thd0~0_221, ~__unbuffered_p3_EAX~0=v_~__unbuffered_p3_EAX~0_28, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_18, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_41, ~__unbuffered_p3_EBX~0=v_~__unbuffered_p3_EBX~0_24, ~y~0=v_~y~0_52, ULTIMATE.start_main_#t~ite64=|v_ULTIMATE.start_main_#t~ite64_40|, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_12|} AuxVars[] AssignedVars[ULTIMATE.start___VERIFIER_assert_~expression, ~z$r_buff1_thd0~0, ~main$tmp_guard1~0, ULTIMATE.start_main_#t~ite64, ULTIMATE.start___VERIFIER_assert_#in~expression] because there is no mapped edge [2019-12-07 13:44:53,196 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 07.12 01:44:53 BasicIcfg [2019-12-07 13:44:53,196 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-07 13:44:53,196 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-12-07 13:44:53,196 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-12-07 13:44:53,196 INFO L275 PluginConnector]: Witness Printer initialized [2019-12-07 13:44:53,197 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 01:43:43" (3/4) ... [2019-12-07 13:44:53,198 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2019-12-07 13:44:53,199 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1061] [1061] ULTIMATE.startENTRY-->L856: Formula: (let ((.cse0 (store |v_#valid_90| 0 0))) (and (= v_~__unbuffered_cnt~0_147 0) (= 0 v_~__unbuffered_p0_EAX~0_62) (= 0 (select .cse0 |v_ULTIMATE.start_main_~#t205~0.base_44|)) (= v_~z$r_buff0_thd1~0_96 0) (= 0 v_~__unbuffered_p2_EAX~0_75) (= 0 v_~z$mem_tmp~0_203) (= v_~z$read_delayed_var~0.offset_6 0) (= v_~z$r_buff1_thd1~0_165 0) (= v_~__unbuffered_p2_EBX~0_79 0) (= 0 v_~z$flush_delayed~0_235) (= 0 v_~z$r_buff0_thd4~0_512) (= |v_ULTIMATE.start_main_~#t205~0.offset_28| 0) (= 0 v_~z$r_buff0_thd3~0_418) (< |v_#StackHeapBarrier_18| |v_ULTIMATE.start_main_~#t205~0.base_44|) (= v_~z$w_buff0_used~0_907 0) (= v_~z$read_delayed_var~0.base_6 0) (= v_~weak$$choice2~0_286 0) (< 0 |v_#StackHeapBarrier_18|) (= 0 v_~__unbuffered_p3_EBX~0_60) (= (store |v_#memory_int_30| |v_ULTIMATE.start_main_~#t205~0.base_44| (store (select |v_#memory_int_30| |v_ULTIMATE.start_main_~#t205~0.base_44|) |v_ULTIMATE.start_main_~#t205~0.offset_28| 0)) |v_#memory_int_29|) (= v_~z$w_buff0~0_341 0) (= |v_#length_29| (store |v_#length_30| |v_ULTIMATE.start_main_~#t205~0.base_44| 4)) (= 0 v_~__unbuffered_p3_EAX~0_66) (= v_~z$read_delayed~0_7 0) (= v_~z$r_buff0_thd0~0_165 0) (= v_~a~0_32 0) (= |v_#NULL.offset_5| 0) (= 0 v_~z$r_buff1_thd3~0_405) (= v_~z$r_buff0_thd2~0_96 0) (= v_~y~0_94 0) (= 0 v_~weak$$choice0~0_191) (= v_~z$w_buff1~0_234 0) (= v_~x~0_46 0) (= v_~main$tmp_guard1~0_52 0) (= v_~z$w_buff1_used~0_667 0) (= v_~z$r_buff1_thd2~0_165 0) (= |v_#valid_88| (store .cse0 |v_ULTIMATE.start_main_~#t205~0.base_44| 1)) (= 0 |v_#NULL.base_5|) (= 0 v_~z$r_buff1_thd4~0_334) (= v_~z~0_304 0) (= v_~z$r_buff1_thd0~0_255 0) (= v_~main$tmp_guard0~0_37 0))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_18|, #valid=|v_#valid_90|, #memory_int=|v_#memory_int_30|, #length=|v_#length_30|} OutVars{ULTIMATE.start_main_~#t205~0.offset=|v_ULTIMATE.start_main_~#t205~0.offset_28|, ULTIMATE.start_main_#t~nondet57=|v_ULTIMATE.start_main_#t~nondet57_8|, ULTIMATE.start_main_#t~nondet55=|v_ULTIMATE.start_main_#t~nondet55_8|, ~z$r_buff1_thd2~0=v_~z$r_buff1_thd2~0_165, #NULL.offset=|v_#NULL.offset_5|, ULTIMATE.start_main_~#t208~0.offset=|v_ULTIMATE.start_main_~#t208~0.offset_18|, ULTIMATE.start_main_#t~ite64=|v_ULTIMATE.start_main_#t~ite64_104|, ~a~0=v_~a~0_32, ~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_165, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_62, ULTIMATE.start_main_~#t206~0.base=|v_ULTIMATE.start_main_~#t206~0.base_36|, ~z$r_buff0_thd4~0=v_~z$r_buff0_thd4~0_512, ~__unbuffered_p3_EAX~0=v_~__unbuffered_p3_EAX~0_66, #length=|v_#length_29|, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_75, ULTIMATE.start_main_~#t208~0.base=|v_ULTIMATE.start_main_~#t208~0.base_24|, ~z$mem_tmp~0=v_~z$mem_tmp~0_203, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_79, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_667, ~z$flush_delayed~0=v_~z$flush_delayed~0_235, ULTIMATE.start_main_~#t206~0.offset=|v_ULTIMATE.start_main_~#t206~0.offset_24|, ULTIMATE.start_main_#t~ite63=|v_ULTIMATE.start_main_#t~ite63_28|, ~weak$$choice0~0=v_~weak$$choice0~0_191, #StackHeapBarrier=|v_#StackHeapBarrier_18|, ULTIMATE.start_main_#t~ite61=|v_ULTIMATE.start_main_#t~ite61_206|, ~z$r_buff1_thd1~0=v_~z$r_buff1_thd1~0_165, ~z$read_delayed_var~0.base=v_~z$read_delayed_var~0.base_6, ~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_418, ULTIMATE.start_main_~#t207~0.offset=|v_ULTIMATE.start_main_~#t207~0.offset_18|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_147, ~x~0=v_~x~0_46, ~z$r_buff1_thd4~0=v_~z$r_buff1_thd4~0_334, ULTIMATE.start_main_#t~nondet58=|v_ULTIMATE.start_main_#t~nondet58_21|, ULTIMATE.start_main_#t~nondet56=|v_ULTIMATE.start_main_#t~nondet56_8|, ~z$read_delayed~0=v_~z$read_delayed~0_7, ~z$w_buff1~0=v_~z$w_buff1~0_234, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_52, ~z$read_delayed_var~0.offset=v_~z$read_delayed_var~0.offset_6, ULTIMATE.start_main_~#t207~0.base=|v_ULTIMATE.start_main_~#t207~0.base_23|, ~z$r_buff1_thd0~0=v_~z$r_buff1_thd0~0_255, ~y~0=v_~y~0_94, ~z$r_buff0_thd2~0=v_~z$r_buff0_thd2~0_96, ULTIMATE.start_main_~#t205~0.base=|v_ULTIMATE.start_main_~#t205~0.base_44|, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_907, ~z$w_buff0~0=v_~z$w_buff0~0_341, ~z$r_buff1_thd3~0=v_~z$r_buff1_thd3~0_405, ULTIMATE.start_main_#t~ite59=|v_ULTIMATE.start_main_#t~ite59_68|, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_37, ~__unbuffered_p3_EBX~0=v_~__unbuffered_p3_EBX~0_60, #NULL.base=|v_#NULL.base_5|, ULTIMATE.start_main_#t~ite62=|v_ULTIMATE.start_main_#t~ite62_80|, ULTIMATE.start_main_#t~ite60=|v_ULTIMATE.start_main_#t~ite60_97|, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_27|, #valid=|v_#valid_88|, #memory_int=|v_#memory_int_29|, ~z~0=v_~z~0_304, ~weak$$choice2~0=v_~weak$$choice2~0_286, ~z$r_buff0_thd1~0=v_~z$r_buff0_thd1~0_96} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t205~0.offset, ULTIMATE.start_main_#t~nondet57, ULTIMATE.start_main_#t~nondet55, ~z$r_buff1_thd2~0, #NULL.offset, ULTIMATE.start_main_~#t208~0.offset, ULTIMATE.start_main_#t~ite64, ~a~0, ~z$r_buff0_thd0~0, ~__unbuffered_p0_EAX~0, ULTIMATE.start_main_~#t206~0.base, ~z$r_buff0_thd4~0, ~__unbuffered_p3_EAX~0, #length, ~__unbuffered_p2_EAX~0, ULTIMATE.start_main_~#t208~0.base, ~z$mem_tmp~0, ~__unbuffered_p2_EBX~0, ~z$w_buff1_used~0, ~z$flush_delayed~0, ULTIMATE.start_main_~#t206~0.offset, ULTIMATE.start_main_#t~ite63, ~weak$$choice0~0, ULTIMATE.start_main_#t~ite61, ~z$r_buff1_thd1~0, ~z$read_delayed_var~0.base, ~z$r_buff0_thd3~0, ULTIMATE.start_main_~#t207~0.offset, ~__unbuffered_cnt~0, ~x~0, ~z$r_buff1_thd4~0, ULTIMATE.start_main_#t~nondet58, ULTIMATE.start_main_#t~nondet56, ~z$read_delayed~0, ~z$w_buff1~0, ~main$tmp_guard1~0, ~z$read_delayed_var~0.offset, ULTIMATE.start_main_~#t207~0.base, ~z$r_buff1_thd0~0, ~y~0, ~z$r_buff0_thd2~0, ULTIMATE.start_main_~#t205~0.base, ~z$w_buff0_used~0, ~z$w_buff0~0, ~z$r_buff1_thd3~0, ULTIMATE.start_main_#t~ite59, ~main$tmp_guard0~0, ~__unbuffered_p3_EBX~0, #NULL.base, ULTIMATE.start_main_#t~ite62, ULTIMATE.start_main_#t~ite60, ULTIMATE.start_main_#res, #valid, #memory_int, ~z~0, ~weak$$choice2~0, ~z$r_buff0_thd1~0] because there is no mapped edge [2019-12-07 13:44:53,199 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1033] [1033] L856-1-->L858: Formula: (and (= |v_#length_19| (store |v_#length_20| |v_ULTIMATE.start_main_~#t206~0.base_11| 4)) (not (= 0 |v_ULTIMATE.start_main_~#t206~0.base_11|)) (= |v_ULTIMATE.start_main_~#t206~0.offset_10| 0) (= (select |v_#valid_45| |v_ULTIMATE.start_main_~#t206~0.base_11|) 0) (= (store |v_#memory_int_20| |v_ULTIMATE.start_main_~#t206~0.base_11| (store (select |v_#memory_int_20| |v_ULTIMATE.start_main_~#t206~0.base_11|) |v_ULTIMATE.start_main_~#t206~0.offset_10| 1)) |v_#memory_int_19|) (< |v_#StackHeapBarrier_11| |v_ULTIMATE.start_main_~#t206~0.base_11|) (= (store |v_#valid_45| |v_ULTIMATE.start_main_~#t206~0.base_11| 1) |v_#valid_44|)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_11|, #valid=|v_#valid_45|, #memory_int=|v_#memory_int_20|, #length=|v_#length_20|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_11|, ULTIMATE.start_main_~#t206~0.base=|v_ULTIMATE.start_main_~#t206~0.base_11|, ULTIMATE.start_main_#t~nondet55=|v_ULTIMATE.start_main_#t~nondet55_5|, #valid=|v_#valid_44|, #memory_int=|v_#memory_int_19|, #length=|v_#length_19|, ULTIMATE.start_main_~#t206~0.offset=|v_ULTIMATE.start_main_~#t206~0.offset_10|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t206~0.base, ULTIMATE.start_main_#t~nondet55, #valid, #memory_int, #length, ULTIMATE.start_main_~#t206~0.offset] because there is no mapped edge [2019-12-07 13:44:53,200 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1035] [1035] L858-1-->L860: Formula: (and (= (store |v_#memory_int_22| |v_ULTIMATE.start_main_~#t207~0.base_12| (store (select |v_#memory_int_22| |v_ULTIMATE.start_main_~#t207~0.base_12|) |v_ULTIMATE.start_main_~#t207~0.offset_11| 2)) |v_#memory_int_21|) (= (store |v_#valid_49| |v_ULTIMATE.start_main_~#t207~0.base_12| 1) |v_#valid_48|) (= |v_ULTIMATE.start_main_~#t207~0.offset_11| 0) (< |v_#StackHeapBarrier_13| |v_ULTIMATE.start_main_~#t207~0.base_12|) (not (= |v_ULTIMATE.start_main_~#t207~0.base_12| 0)) (= 0 (select |v_#valid_49| |v_ULTIMATE.start_main_~#t207~0.base_12|)) (= (store |v_#length_22| |v_ULTIMATE.start_main_~#t207~0.base_12| 4) |v_#length_21|)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_13|, #valid=|v_#valid_49|, #memory_int=|v_#memory_int_22|, #length=|v_#length_22|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_13|, #valid=|v_#valid_48|, ULTIMATE.start_main_#t~nondet56=|v_ULTIMATE.start_main_#t~nondet56_5|, #memory_int=|v_#memory_int_21|, ULTIMATE.start_main_~#t207~0.offset=|v_ULTIMATE.start_main_~#t207~0.offset_11|, #length=|v_#length_21|, ULTIMATE.start_main_~#t207~0.base=|v_ULTIMATE.start_main_~#t207~0.base_12|} AuxVars[] AssignedVars[#valid, ULTIMATE.start_main_#t~nondet56, #memory_int, ULTIMATE.start_main_~#t207~0.offset, #length, ULTIMATE.start_main_~#t207~0.base] because there is no mapped edge [2019-12-07 13:44:53,200 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1037] [1037] L860-1-->L862: Formula: (and (= (select |v_#valid_51| |v_ULTIMATE.start_main_~#t208~0.base_13|) 0) (< |v_#StackHeapBarrier_14| |v_ULTIMATE.start_main_~#t208~0.base_13|) (= |v_#length_23| (store |v_#length_24| |v_ULTIMATE.start_main_~#t208~0.base_13| 4)) (= |v_#valid_50| (store |v_#valid_51| |v_ULTIMATE.start_main_~#t208~0.base_13| 1)) (= |v_ULTIMATE.start_main_~#t208~0.offset_11| 0) (= (store |v_#memory_int_24| |v_ULTIMATE.start_main_~#t208~0.base_13| (store (select |v_#memory_int_24| |v_ULTIMATE.start_main_~#t208~0.base_13|) |v_ULTIMATE.start_main_~#t208~0.offset_11| 3)) |v_#memory_int_23|) (not (= 0 |v_ULTIMATE.start_main_~#t208~0.base_13|))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_14|, #valid=|v_#valid_51|, #memory_int=|v_#memory_int_24|, #length=|v_#length_24|} OutVars{ULTIMATE.start_main_~#t208~0.base=|v_ULTIMATE.start_main_~#t208~0.base_13|, #StackHeapBarrier=|v_#StackHeapBarrier_14|, ULTIMATE.start_main_#t~nondet57=|v_ULTIMATE.start_main_#t~nondet57_5|, #valid=|v_#valid_50|, #memory_int=|v_#memory_int_23|, #length=|v_#length_23|, ULTIMATE.start_main_~#t208~0.offset=|v_ULTIMATE.start_main_~#t208~0.offset_11|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t208~0.base, ULTIMATE.start_main_#t~nondet57, #valid, #memory_int, #length, ULTIMATE.start_main_~#t208~0.offset] because there is no mapped edge [2019-12-07 13:44:53,200 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [907] [907] P3ENTRY-->L4-3: Formula: (and (= 1 v_~z$w_buff0~0_34) (= v_~z$w_buff0~0_35 v_~z$w_buff1~0_22) (= |v_P3Thread1of1ForFork2_#in~arg.offset_9| v_P3Thread1of1ForFork2_~arg.offset_7) (= (ite (not (and (not (= (mod v_~z$w_buff0_used~0_105 256) 0)) (not (= (mod v_~z$w_buff1_used~0_57 256) 0)))) 1 0) |v_P3Thread1of1ForFork2___VERIFIER_assert_#in~expression_7|) (not (= v_P3Thread1of1ForFork2___VERIFIER_assert_~expression_9 0)) (= v_P3Thread1of1ForFork2_~arg.base_7 |v_P3Thread1of1ForFork2_#in~arg.base_9|) (= v_~z$w_buff0_used~0_106 v_~z$w_buff1_used~0_57) (= v_~z$w_buff0_used~0_105 1) (= v_P3Thread1of1ForFork2___VERIFIER_assert_~expression_9 |v_P3Thread1of1ForFork2___VERIFIER_assert_#in~expression_7|)) InVars {~z$w_buff0_used~0=v_~z$w_buff0_used~0_106, ~z$w_buff0~0=v_~z$w_buff0~0_35, P3Thread1of1ForFork2_#in~arg.offset=|v_P3Thread1of1ForFork2_#in~arg.offset_9|, P3Thread1of1ForFork2_#in~arg.base=|v_P3Thread1of1ForFork2_#in~arg.base_9|} OutVars{P3Thread1of1ForFork2___VERIFIER_assert_~expression=v_P3Thread1of1ForFork2___VERIFIER_assert_~expression_9, P3Thread1of1ForFork2_~arg.offset=v_P3Thread1of1ForFork2_~arg.offset_7, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_105, ~z$w_buff0~0=v_~z$w_buff0~0_34, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_57, P3Thread1of1ForFork2_#in~arg.offset=|v_P3Thread1of1ForFork2_#in~arg.offset_9|, ~z$w_buff1~0=v_~z$w_buff1~0_22, P3Thread1of1ForFork2___VERIFIER_assert_#in~expression=|v_P3Thread1of1ForFork2___VERIFIER_assert_#in~expression_7|, P3Thread1of1ForFork2_~arg.base=v_P3Thread1of1ForFork2_~arg.base_7, P3Thread1of1ForFork2_#in~arg.base=|v_P3Thread1of1ForFork2_#in~arg.base_9|} AuxVars[] AssignedVars[P3Thread1of1ForFork2___VERIFIER_assert_~expression, P3Thread1of1ForFork2_~arg.offset, ~z$w_buff0_used~0, ~z$w_buff0~0, ~z$w_buff1_used~0, ~z$w_buff1~0, P3Thread1of1ForFork2___VERIFIER_assert_#in~expression, P3Thread1of1ForFork2_~arg.base] because there is no mapped edge [2019-12-07 13:44:53,201 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [984] [984] L818-2-->L818-5: Formula: (let ((.cse1 (= |P3Thread1of1ForFork2_#t~ite29_Out-1065028430| |P3Thread1of1ForFork2_#t~ite28_Out-1065028430|)) (.cse2 (= (mod ~z$r_buff0_thd4~0_In-1065028430 256) 0)) (.cse0 (= 0 (mod ~z$w_buff0_used~0_In-1065028430 256)))) (or (and (not .cse0) .cse1 (= |P3Thread1of1ForFork2_#t~ite28_Out-1065028430| ~z$w_buff0~0_In-1065028430) (not .cse2)) (and .cse1 (or .cse2 .cse0) (= |P3Thread1of1ForFork2_#t~ite28_Out-1065028430| ~z$w_buff1~0_In-1065028430)))) InVars {~z$w_buff0~0=~z$w_buff0~0_In-1065028430, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1065028430, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In-1065028430, ~z$w_buff1~0=~z$w_buff1~0_In-1065028430} OutVars{P3Thread1of1ForFork2_#t~ite29=|P3Thread1of1ForFork2_#t~ite29_Out-1065028430|, P3Thread1of1ForFork2_#t~ite28=|P3Thread1of1ForFork2_#t~ite28_Out-1065028430|, ~z$w_buff0~0=~z$w_buff0~0_In-1065028430, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1065028430, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In-1065028430, ~z$w_buff1~0=~z$w_buff1~0_In-1065028430} AuxVars[] AssignedVars[P3Thread1of1ForFork2_#t~ite29, P3Thread1of1ForFork2_#t~ite28] because there is no mapped edge [2019-12-07 13:44:53,205 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [942] [942] L823-->L824: Formula: (and (= v_~z$r_buff0_thd4~0_105 v_~z$r_buff0_thd4~0_104) (not (= 0 (mod v_~weak$$choice2~0_68 256)))) InVars {~z$r_buff0_thd4~0=v_~z$r_buff0_thd4~0_105, ~weak$$choice2~0=v_~weak$$choice2~0_68} OutVars{P3Thread1of1ForFork2_#t~ite42=|v_P3Thread1of1ForFork2_#t~ite42_6|, P3Thread1of1ForFork2_#t~ite43=|v_P3Thread1of1ForFork2_#t~ite43_9|, P3Thread1of1ForFork2_#t~ite44=|v_P3Thread1of1ForFork2_#t~ite44_9|, ~z$r_buff0_thd4~0=v_~z$r_buff0_thd4~0_104, ~weak$$choice2~0=v_~weak$$choice2~0_68} AuxVars[] AssignedVars[P3Thread1of1ForFork2_#t~ite42, P3Thread1of1ForFork2_#t~ite43, P3Thread1of1ForFork2_#t~ite44, ~z$r_buff0_thd4~0] because there is no mapped edge [2019-12-07 13:44:53,205 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [978] [978] L826-->L826-2: Formula: (let ((.cse0 (= 0 (mod ~z$flush_delayed~0_In2020964158 256)))) (or (and (= ~z~0_In2020964158 |P3Thread1of1ForFork2_#t~ite48_Out2020964158|) .cse0) (and (not .cse0) (= |P3Thread1of1ForFork2_#t~ite48_Out2020964158| ~z$mem_tmp~0_In2020964158)))) InVars {~z$mem_tmp~0=~z$mem_tmp~0_In2020964158, ~z$flush_delayed~0=~z$flush_delayed~0_In2020964158, ~z~0=~z~0_In2020964158} OutVars{~z$mem_tmp~0=~z$mem_tmp~0_In2020964158, P3Thread1of1ForFork2_#t~ite48=|P3Thread1of1ForFork2_#t~ite48_Out2020964158|, ~z$flush_delayed~0=~z$flush_delayed~0_In2020964158, ~z~0=~z~0_In2020964158} AuxVars[] AssignedVars[P3Thread1of1ForFork2_#t~ite48] because there is no mapped edge [2019-12-07 13:44:53,206 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1028] [1028] P0ENTRY-->P0EXIT: Formula: (and (= 0 |v_P0Thread1of1ForFork3_#res.base_3|) (= v_~__unbuffered_cnt~0_71 (+ v_~__unbuffered_cnt~0_72 1)) (= v_~x~0_14 v_~__unbuffered_p0_EAX~0_18) (= v_~a~0_16 1) (= |v_P0Thread1of1ForFork3_#in~arg.offset_10| v_P0Thread1of1ForFork3_~arg.offset_8) (= |v_P0Thread1of1ForFork3_#res.offset_3| 0) (= v_P0Thread1of1ForFork3_~arg.base_8 |v_P0Thread1of1ForFork3_#in~arg.base_10|)) InVars {P0Thread1of1ForFork3_#in~arg.offset=|v_P0Thread1of1ForFork3_#in~arg.offset_10|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_72, P0Thread1of1ForFork3_#in~arg.base=|v_P0Thread1of1ForFork3_#in~arg.base_10|, ~x~0=v_~x~0_14} OutVars{~a~0=v_~a~0_16, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_18, P0Thread1of1ForFork3_#in~arg.offset=|v_P0Thread1of1ForFork3_#in~arg.offset_10|, P0Thread1of1ForFork3_~arg.base=v_P0Thread1of1ForFork3_~arg.base_8, P0Thread1of1ForFork3_#res.base=|v_P0Thread1of1ForFork3_#res.base_3|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_71, P0Thread1of1ForFork3_#res.offset=|v_P0Thread1of1ForFork3_#res.offset_3|, P0Thread1of1ForFork3_~arg.offset=v_P0Thread1of1ForFork3_~arg.offset_8, P0Thread1of1ForFork3_#in~arg.base=|v_P0Thread1of1ForFork3_#in~arg.base_10|, ~x~0=v_~x~0_14} AuxVars[] AssignedVars[~a~0, ~__unbuffered_p0_EAX~0, P0Thread1of1ForFork3_~arg.base, P0Thread1of1ForFork3_#res.base, ~__unbuffered_cnt~0, P0Thread1of1ForFork3_#res.offset, P0Thread1of1ForFork3_~arg.offset] because there is no mapped edge [2019-12-07 13:44:53,206 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1027] [1027] P1ENTRY-->P1EXIT: Formula: (and (= 0 |v_P1Thread1of1ForFork0_#res.offset_3|) (= v_P1Thread1of1ForFork0_~arg.base_4 |v_P1Thread1of1ForFork0_#in~arg.base_6|) (= (+ v_~__unbuffered_cnt~0_66 1) v_~__unbuffered_cnt~0_65) (= v_~y~0_39 1) (= v_~x~0_11 1) (= 0 |v_P1Thread1of1ForFork0_#res.base_3|) (= v_P1Thread1of1ForFork0_~arg.offset_4 |v_P1Thread1of1ForFork0_#in~arg.offset_6|)) InVars {P1Thread1of1ForFork0_#in~arg.base=|v_P1Thread1of1ForFork0_#in~arg.base_6|, P1Thread1of1ForFork0_#in~arg.offset=|v_P1Thread1of1ForFork0_#in~arg.offset_6|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_66} OutVars{P1Thread1of1ForFork0_~arg.offset=v_P1Thread1of1ForFork0_~arg.offset_4, P1Thread1of1ForFork0_~arg.base=v_P1Thread1of1ForFork0_~arg.base_4, P1Thread1of1ForFork0_#in~arg.base=|v_P1Thread1of1ForFork0_#in~arg.base_6|, P1Thread1of1ForFork0_#in~arg.offset=|v_P1Thread1of1ForFork0_#in~arg.offset_6|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_65, P1Thread1of1ForFork0_#res.offset=|v_P1Thread1of1ForFork0_#res.offset_3|, ~y~0=v_~y~0_39, P1Thread1of1ForFork0_#res.base=|v_P1Thread1of1ForFork0_#res.base_3|, ~x~0=v_~x~0_11} AuxVars[] AssignedVars[P1Thread1of1ForFork0_~arg.offset, P1Thread1of1ForFork0_~arg.base, ~__unbuffered_cnt~0, P1Thread1of1ForFork0_#res.offset, ~y~0, P1Thread1of1ForFork0_#res.base, ~x~0] because there is no mapped edge [2019-12-07 13:44:53,213 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [983] [983] L788-->L788-2: Formula: (let ((.cse0 (= 0 (mod ~z$flush_delayed~0_In-39332699 256)))) (or (and (= |P2Thread1of1ForFork1_#t~ite25_Out-39332699| ~z~0_In-39332699) .cse0) (and (not .cse0) (= ~z$mem_tmp~0_In-39332699 |P2Thread1of1ForFork1_#t~ite25_Out-39332699|)))) InVars {~z$mem_tmp~0=~z$mem_tmp~0_In-39332699, ~z$flush_delayed~0=~z$flush_delayed~0_In-39332699, ~z~0=~z~0_In-39332699} OutVars{~z$mem_tmp~0=~z$mem_tmp~0_In-39332699, P2Thread1of1ForFork1_#t~ite25=|P2Thread1of1ForFork1_#t~ite25_Out-39332699|, ~z$flush_delayed~0=~z$flush_delayed~0_In-39332699, ~z~0=~z~0_In-39332699} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite25] because there is no mapped edge [2019-12-07 13:44:53,213 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [997] [997] L834-->L834-2: Formula: (let ((.cse1 (= 0 (mod ~z$w_buff0_used~0_In-988481534 256))) (.cse0 (= 0 (mod ~z$r_buff0_thd4~0_In-988481534 256)))) (or (and (= 0 |P3Thread1of1ForFork2_#t~ite51_Out-988481534|) (not .cse0) (not .cse1)) (and (or .cse1 .cse0) (= ~z$w_buff0_used~0_In-988481534 |P3Thread1of1ForFork2_#t~ite51_Out-988481534|)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-988481534, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In-988481534} OutVars{P3Thread1of1ForFork2_#t~ite51=|P3Thread1of1ForFork2_#t~ite51_Out-988481534|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-988481534, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In-988481534} AuxVars[] AssignedVars[P3Thread1of1ForFork2_#t~ite51] because there is no mapped edge [2019-12-07 13:44:53,214 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [986] [986] L835-->L835-2: Formula: (let ((.cse2 (= (mod ~z$w_buff1_used~0_In-19083211 256) 0)) (.cse3 (= (mod ~z$r_buff1_thd4~0_In-19083211 256) 0)) (.cse1 (= 0 (mod ~z$r_buff0_thd4~0_In-19083211 256))) (.cse0 (= (mod ~z$w_buff0_used~0_In-19083211 256) 0))) (or (and (= 0 |P3Thread1of1ForFork2_#t~ite52_Out-19083211|) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (= ~z$w_buff1_used~0_In-19083211 |P3Thread1of1ForFork2_#t~ite52_Out-19083211|) (or .cse2 .cse3) (or .cse1 .cse0)))) InVars {~z$r_buff1_thd4~0=~z$r_buff1_thd4~0_In-19083211, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-19083211, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In-19083211, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-19083211} OutVars{P3Thread1of1ForFork2_#t~ite52=|P3Thread1of1ForFork2_#t~ite52_Out-19083211|, ~z$r_buff1_thd4~0=~z$r_buff1_thd4~0_In-19083211, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-19083211, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In-19083211, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-19083211} AuxVars[] AssignedVars[P3Thread1of1ForFork2_#t~ite52] because there is no mapped edge [2019-12-07 13:44:53,214 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [982] [982] L836-->L837: Formula: (let ((.cse1 (= 0 (mod ~z$w_buff0_used~0_In-870090006 256))) (.cse0 (= ~z$r_buff0_thd4~0_Out-870090006 ~z$r_buff0_thd4~0_In-870090006)) (.cse2 (= 0 (mod ~z$r_buff0_thd4~0_In-870090006 256)))) (or (and .cse0 .cse1) (and (not .cse2) (= ~z$r_buff0_thd4~0_Out-870090006 0) (not .cse1)) (and .cse0 .cse2))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-870090006, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In-870090006} OutVars{P3Thread1of1ForFork2_#t~ite53=|P3Thread1of1ForFork2_#t~ite53_Out-870090006|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-870090006, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_Out-870090006} AuxVars[] AssignedVars[P3Thread1of1ForFork2_#t~ite53, ~z$r_buff0_thd4~0] because there is no mapped edge [2019-12-07 13:44:53,214 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [981] [981] L837-->L837-2: Formula: (let ((.cse3 (= 0 (mod ~z$r_buff0_thd4~0_In958371948 256))) (.cse2 (= 0 (mod ~z$w_buff0_used~0_In958371948 256))) (.cse1 (= (mod ~z$r_buff1_thd4~0_In958371948 256) 0)) (.cse0 (= 0 (mod ~z$w_buff1_used~0_In958371948 256)))) (or (and (or .cse0 .cse1) (or .cse2 .cse3) (= ~z$r_buff1_thd4~0_In958371948 |P3Thread1of1ForFork2_#t~ite54_Out958371948|)) (and (= 0 |P3Thread1of1ForFork2_#t~ite54_Out958371948|) (or (and (not .cse3) (not .cse2)) (and (not .cse1) (not .cse0)))))) InVars {~z$r_buff1_thd4~0=~z$r_buff1_thd4~0_In958371948, ~z$w_buff0_used~0=~z$w_buff0_used~0_In958371948, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In958371948, ~z$w_buff1_used~0=~z$w_buff1_used~0_In958371948} OutVars{P3Thread1of1ForFork2_#t~ite54=|P3Thread1of1ForFork2_#t~ite54_Out958371948|, ~z$r_buff1_thd4~0=~z$r_buff1_thd4~0_In958371948, ~z$w_buff0_used~0=~z$w_buff0_used~0_In958371948, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In958371948, ~z$w_buff1_used~0=~z$w_buff1_used~0_In958371948} AuxVars[] AssignedVars[P3Thread1of1ForFork2_#t~ite54] because there is no mapped edge [2019-12-07 13:44:53,214 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1032] [1032] L837-2-->P3EXIT: Formula: (and (= |v_P3Thread1of1ForFork2_#t~ite54_30| v_~z$r_buff1_thd4~0_260) (= 0 |v_P3Thread1of1ForFork2_#res.base_3|) (= 0 |v_P3Thread1of1ForFork2_#res.offset_3|) (= (+ v_~__unbuffered_cnt~0_84 1) v_~__unbuffered_cnt~0_83)) InVars {P3Thread1of1ForFork2_#t~ite54=|v_P3Thread1of1ForFork2_#t~ite54_30|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_84} OutVars{P3Thread1of1ForFork2_#t~ite54=|v_P3Thread1of1ForFork2_#t~ite54_29|, P3Thread1of1ForFork2_#res.base=|v_P3Thread1of1ForFork2_#res.base_3|, ~z$r_buff1_thd4~0=v_~z$r_buff1_thd4~0_260, P3Thread1of1ForFork2_#res.offset=|v_P3Thread1of1ForFork2_#res.offset_3|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_83} AuxVars[] AssignedVars[P3Thread1of1ForFork2_#t~ite54, P3Thread1of1ForFork2_#res.base, ~z$r_buff1_thd4~0, P3Thread1of1ForFork2_#res.offset, ~__unbuffered_cnt~0] because there is no mapped edge [2019-12-07 13:44:53,214 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1023] [1023] L788-2-->P2EXIT: Formula: (and (= 0 |v_P2Thread1of1ForFork1_#res.offset_3|) (= 0 v_~z$flush_delayed~0_189) (= v_~z~0_189 |v_P2Thread1of1ForFork1_#t~ite25_44|) (= (+ v_~__unbuffered_cnt~0_56 1) v_~__unbuffered_cnt~0_55) (= 0 |v_P2Thread1of1ForFork1_#res.base_3|)) InVars {P2Thread1of1ForFork1_#t~ite25=|v_P2Thread1of1ForFork1_#t~ite25_44|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_56} OutVars{P2Thread1of1ForFork1_#t~ite25=|v_P2Thread1of1ForFork1_#t~ite25_43|, P2Thread1of1ForFork1_#res.base=|v_P2Thread1of1ForFork1_#res.base_3|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_55, ~z$flush_delayed~0=v_~z$flush_delayed~0_189, ~z~0=v_~z~0_189, P2Thread1of1ForFork1_#res.offset=|v_P2Thread1of1ForFork1_#res.offset_3|} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite25, P2Thread1of1ForFork1_#res.base, ~__unbuffered_cnt~0, ~z$flush_delayed~0, ~z~0, P2Thread1of1ForFork1_#res.offset] because there is no mapped edge [2019-12-07 13:44:53,215 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [908] [908] L866-->L868-2: Formula: (and (or (= (mod v_~z$w_buff0_used~0_107 256) 0) (= 0 (mod v_~z$r_buff0_thd0~0_14 256))) (not (= (mod v_~main$tmp_guard0~0_4 256) 0))) InVars {~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_14, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_107, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_4} OutVars{~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_14, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_107, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_4} AuxVars[] AssignedVars[] because there is no mapped edge [2019-12-07 13:44:53,215 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [980] [980] L868-2-->L868-5: Formula: (let ((.cse0 (= |ULTIMATE.start_main_#t~ite59_Out215125788| |ULTIMATE.start_main_#t~ite60_Out215125788|)) (.cse2 (= 0 (mod ~z$w_buff1_used~0_In215125788 256))) (.cse1 (= 0 (mod ~z$r_buff1_thd0~0_In215125788 256)))) (or (and .cse0 (not .cse1) (not .cse2) (= |ULTIMATE.start_main_#t~ite59_Out215125788| ~z$w_buff1~0_In215125788)) (and .cse0 (= |ULTIMATE.start_main_#t~ite59_Out215125788| ~z~0_In215125788) (or .cse2 .cse1)))) InVars {~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In215125788, ~z$w_buff1_used~0=~z$w_buff1_used~0_In215125788, ~z$w_buff1~0=~z$w_buff1~0_In215125788, ~z~0=~z~0_In215125788} OutVars{ULTIMATE.start_main_#t~ite60=|ULTIMATE.start_main_#t~ite60_Out215125788|, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In215125788, ~z$w_buff1_used~0=~z$w_buff1_used~0_In215125788, ~z$w_buff1~0=~z$w_buff1~0_In215125788, ULTIMATE.start_main_#t~ite59=|ULTIMATE.start_main_#t~ite59_Out215125788|, ~z~0=~z~0_In215125788} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite60, ULTIMATE.start_main_#t~ite59] because there is no mapped edge [2019-12-07 13:44:53,216 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [995] [995] L869-->L869-2: Formula: (let ((.cse0 (= (mod ~z$r_buff0_thd0~0_In-1452461126 256) 0)) (.cse1 (= (mod ~z$w_buff0_used~0_In-1452461126 256) 0))) (or (and (= 0 |ULTIMATE.start_main_#t~ite61_Out-1452461126|) (not .cse0) (not .cse1)) (and (or .cse0 .cse1) (= |ULTIMATE.start_main_#t~ite61_Out-1452461126| ~z$w_buff0_used~0_In-1452461126)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-1452461126, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1452461126} OutVars{~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-1452461126, ULTIMATE.start_main_#t~ite61=|ULTIMATE.start_main_#t~ite61_Out-1452461126|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1452461126} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite61] because there is no mapped edge [2019-12-07 13:44:53,216 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1001] [1001] L870-->L870-2: Formula: (let ((.cse3 (= (mod ~z$w_buff0_used~0_In302605464 256) 0)) (.cse2 (= (mod ~z$r_buff0_thd0~0_In302605464 256) 0)) (.cse1 (= (mod ~z$r_buff1_thd0~0_In302605464 256) 0)) (.cse0 (= 0 (mod ~z$w_buff1_used~0_In302605464 256)))) (or (and (= |ULTIMATE.start_main_#t~ite62_Out302605464| 0) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse3 .cse2) (= |ULTIMATE.start_main_#t~ite62_Out302605464| ~z$w_buff1_used~0_In302605464) (or .cse1 .cse0)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In302605464, ~z$w_buff0_used~0=~z$w_buff0_used~0_In302605464, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In302605464, ~z$w_buff1_used~0=~z$w_buff1_used~0_In302605464} OutVars{ULTIMATE.start_main_#t~ite62=|ULTIMATE.start_main_#t~ite62_Out302605464|, ~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In302605464, ~z$w_buff0_used~0=~z$w_buff0_used~0_In302605464, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In302605464, ~z$w_buff1_used~0=~z$w_buff1_used~0_In302605464} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite62] because there is no mapped edge [2019-12-07 13:44:53,217 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [979] [979] L871-->L871-2: Formula: (let ((.cse0 (= (mod ~z$w_buff0_used~0_In574431356 256) 0)) (.cse1 (= (mod ~z$r_buff0_thd0~0_In574431356 256) 0))) (or (and (not .cse0) (= 0 |ULTIMATE.start_main_#t~ite63_Out574431356|) (not .cse1)) (and (= ~z$r_buff0_thd0~0_In574431356 |ULTIMATE.start_main_#t~ite63_Out574431356|) (or .cse0 .cse1)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In574431356, ~z$w_buff0_used~0=~z$w_buff0_used~0_In574431356} OutVars{ULTIMATE.start_main_#t~ite63=|ULTIMATE.start_main_#t~ite63_Out574431356|, ~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In574431356, ~z$w_buff0_used~0=~z$w_buff0_used~0_In574431356} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite63] because there is no mapped edge [2019-12-07 13:44:53,217 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [987] [987] L872-->L872-2: Formula: (let ((.cse2 (= (mod ~z$r_buff1_thd0~0_In887434408 256) 0)) (.cse3 (= (mod ~z$w_buff1_used~0_In887434408 256) 0)) (.cse0 (= 0 (mod ~z$w_buff0_used~0_In887434408 256))) (.cse1 (= (mod ~z$r_buff0_thd0~0_In887434408 256) 0))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= |ULTIMATE.start_main_#t~ite64_Out887434408| 0)) (and (or .cse2 .cse3) (= ~z$r_buff1_thd0~0_In887434408 |ULTIMATE.start_main_#t~ite64_Out887434408|) (or .cse0 .cse1)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In887434408, ~z$w_buff0_used~0=~z$w_buff0_used~0_In887434408, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In887434408, ~z$w_buff1_used~0=~z$w_buff1_used~0_In887434408} OutVars{~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In887434408, ~z$w_buff0_used~0=~z$w_buff0_used~0_In887434408, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In887434408, ~z$w_buff1_used~0=~z$w_buff1_used~0_In887434408, ULTIMATE.start_main_#t~ite64=|ULTIMATE.start_main_#t~ite64_Out887434408|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite64] because there is no mapped edge [2019-12-07 13:44:53,217 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1049] [1049] L872-2-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= |v_ULTIMATE.start___VERIFIER_assert_#in~expression_12| (mod v_~main$tmp_guard1~0_18 256)) (= v_~main$tmp_guard1~0_18 (ite (= 0 (ite (not (and (= 0 v_~__unbuffered_p0_EAX~0_26) (= 1 v_~__unbuffered_p3_EAX~0_28) (= 0 v_~__unbuffered_p3_EBX~0_24) (= v_~__unbuffered_p2_EBX~0_43 0) (= v_~y~0_52 2) (= 2 v_~__unbuffered_p2_EAX~0_41))) 1 0)) 0 1)) (= v_ULTIMATE.start___VERIFIER_assert_~expression_15 |v_ULTIMATE.start___VERIFIER_assert_#in~expression_12|) (= v_ULTIMATE.start___VERIFIER_assert_~expression_15 0) (= v_~z$r_buff1_thd0~0_221 |v_ULTIMATE.start_main_#t~ite64_41|)) InVars {~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_26, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_43, ~__unbuffered_p3_EAX~0=v_~__unbuffered_p3_EAX~0_28, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_41, ~__unbuffered_p3_EBX~0=v_~__unbuffered_p3_EBX~0_24, ~y~0=v_~y~0_52, ULTIMATE.start_main_#t~ite64=|v_ULTIMATE.start_main_#t~ite64_41|} OutVars{~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_26, ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_15, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_43, ~z$r_buff1_thd0~0=v_~z$r_buff1_thd0~0_221, ~__unbuffered_p3_EAX~0=v_~__unbuffered_p3_EAX~0_28, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_18, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_41, ~__unbuffered_p3_EBX~0=v_~__unbuffered_p3_EBX~0_24, ~y~0=v_~y~0_52, ULTIMATE.start_main_#t~ite64=|v_ULTIMATE.start_main_#t~ite64_40|, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_12|} AuxVars[] AssignedVars[ULTIMATE.start___VERIFIER_assert_~expression, ~z$r_buff1_thd0~0, ~main$tmp_guard1~0, ULTIMATE.start_main_#t~ite64, ULTIMATE.start___VERIFIER_assert_#in~expression] because there is no mapped edge [2019-12-07 13:44:53,281 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/run_dir_1a2178b0-732b-4b0e-b780-299a7cc3ed4b/bin/uautomizer/witness.graphml [2019-12-07 13:44:53,281 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-12-07 13:44:53,282 INFO L168 Benchmark]: Toolchain (without parser) took 70536.78 ms. Allocated memory was 1.0 GB in the beginning and 6.2 GB in the end (delta: 5.2 GB). Free memory was 944.7 MB in the beginning and 5.0 GB in the end (delta: -4.1 GB). Peak memory consumption was 1.1 GB. Max. memory is 11.5 GB. [2019-12-07 13:44:53,282 INFO L168 Benchmark]: CDTParser took 0.23 ms. Allocated memory is still 1.0 GB. Free memory is still 964.0 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-12-07 13:44:53,283 INFO L168 Benchmark]: CACSL2BoogieTranslator took 414.65 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 143.1 MB). Free memory was 944.7 MB in the beginning and 1.1 GB in the end (delta: -160.8 MB). Peak memory consumption was 18.4 MB. Max. memory is 11.5 GB. [2019-12-07 13:44:53,283 INFO L168 Benchmark]: Boogie Procedure Inliner took 39.17 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-12-07 13:44:53,283 INFO L168 Benchmark]: Boogie Preprocessor took 27.45 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. [2019-12-07 13:44:53,284 INFO L168 Benchmark]: RCFGBuilder took 486.29 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 61.1 MB). Peak memory consumption was 61.1 MB. Max. memory is 11.5 GB. [2019-12-07 13:44:53,284 INFO L168 Benchmark]: TraceAbstraction took 69480.85 ms. Allocated memory was 1.2 GB in the beginning and 6.2 GB in the end (delta: 5.0 GB). Free memory was 1.0 GB in the beginning and 5.1 GB in the end (delta: -4.0 GB). Peak memory consumption was 1.0 GB. Max. memory is 11.5 GB. [2019-12-07 13:44:53,284 INFO L168 Benchmark]: Witness Printer took 85.09 ms. Allocated memory is still 6.2 GB. Free memory was 5.1 GB in the beginning and 5.0 GB in the end (delta: 66.5 MB). Peak memory consumption was 66.5 MB. Max. memory is 11.5 GB. [2019-12-07 13:44:53,286 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.23 ms. Allocated memory is still 1.0 GB. Free memory is still 964.0 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 414.65 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 143.1 MB). Free memory was 944.7 MB in the beginning and 1.1 GB in the end (delta: -160.8 MB). Peak memory consumption was 18.4 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 39.17 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * Boogie Preprocessor took 27.45 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. * RCFGBuilder took 486.29 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 61.1 MB). Peak memory consumption was 61.1 MB. Max. memory is 11.5 GB. * TraceAbstraction took 69480.85 ms. Allocated memory was 1.2 GB in the beginning and 6.2 GB in the end (delta: 5.0 GB). Free memory was 1.0 GB in the beginning and 5.1 GB in the end (delta: -4.0 GB). Peak memory consumption was 1.0 GB. Max. memory is 11.5 GB. * Witness Printer took 85.09 ms. Allocated memory is still 6.2 GB. Free memory was 5.1 GB in the beginning and 5.0 GB in the end (delta: 66.5 MB). Peak memory consumption was 66.5 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks LbeTime: 4.0s, 212 ProgramPointsBefore, 112 ProgramPointsAfterwards, 255 TransitionsBefore, 132 TransitionsAfterwards, 26510 CoEnabledTransitionPairs, 8 FixpointIterations, 38 TrivialSequentialCompositions, 47 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 48 ConcurrentYvCompositions, 28 ChoiceCompositions, 11185 VarBasedMoverChecksPositive, 321 VarBasedMoverChecksNegative, 83 SemBasedMoverChecksPositive, 338 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 1.2s, 0 MoverChecksTotal, 141939 CheckedPairsTotal, 133 TotalNumberOfCompositions - CounterExampleResult [Line: 4]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L856] FCALL, FORK 0 pthread_create(&t205, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L858] FCALL, FORK 0 pthread_create(&t206, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=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, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L860] FCALL, FORK 0 pthread_create(&t207, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0: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, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L862] FCALL, FORK 0 pthread_create(&t208, ((void *)0), P3, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0: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, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L806] 4 z$r_buff1_thd0 = z$r_buff0_thd0 [L807] 4 z$r_buff1_thd1 = z$r_buff0_thd1 [L808] 4 z$r_buff1_thd2 = z$r_buff0_thd2 [L809] 4 z$r_buff1_thd3 = z$r_buff0_thd3 [L810] 4 z$r_buff1_thd4 = z$r_buff0_thd4 [L811] 4 z$r_buff0_thd4 = (_Bool)1 [L814] 4 weak$$choice0 = __VERIFIER_nondet_bool() [L815] 4 weak$$choice2 = __VERIFIER_nondet_bool() [L816] 4 z$flush_delayed = weak$$choice2 [L817] 4 z$mem_tmp = z VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=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=0, y=0, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L818] EXPR 4 !z$w_buff0_used || !z$r_buff0_thd4 && !z$w_buff1_used || !z$r_buff0_thd4 && !z$r_buff1_thd4 ? z : (z$w_buff0_used && z$r_buff0_thd4 ? z$w_buff0 : z$w_buff1) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=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=0, y=0, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L818] 4 z = !z$w_buff0_used || !z$r_buff0_thd4 && !z$w_buff1_used || !z$r_buff0_thd4 && !z$r_buff1_thd4 ? z : (z$w_buff0_used && z$r_buff0_thd4 ? z$w_buff0 : z$w_buff1) [L819] EXPR 4 weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd4 && !z$w_buff1_used || !z$r_buff0_thd4 && !z$r_buff1_thd4 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd4 ? z$w_buff0 : z$w_buff0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=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=0, y=0, z=1, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L819] 4 z$w_buff0 = weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd4 && !z$w_buff1_used || !z$r_buff0_thd4 && !z$r_buff1_thd4 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd4 ? z$w_buff0 : z$w_buff0)) [L820] EXPR 4 weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd4 && !z$w_buff1_used || !z$r_buff0_thd4 && !z$r_buff1_thd4 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd4 ? z$w_buff1 : z$w_buff1)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=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=0, y=0, z=1, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L820] 4 z$w_buff1 = weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd4 && !z$w_buff1_used || !z$r_buff0_thd4 && !z$r_buff1_thd4 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd4 ? z$w_buff1 : z$w_buff1)) [L821] EXPR 4 weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd4 && !z$w_buff1_used || !z$r_buff0_thd4 && !z$r_buff1_thd4 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$w_buff0_used)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=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=0, y=0, z=1, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L821] 4 z$w_buff0_used = weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd4 && !z$w_buff1_used || !z$r_buff0_thd4 && !z$r_buff1_thd4 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$w_buff0_used)) [L822] EXPR 4 weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd4 && !z$w_buff1_used || !z$r_buff0_thd4 && !z$r_buff1_thd4 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : (_Bool)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=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=0, y=0, z=1, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L822] 4 z$w_buff1_used = weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd4 && !z$w_buff1_used || !z$r_buff0_thd4 && !z$r_buff1_thd4 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : (_Bool)0)) [L824] EXPR 4 weak$$choice2 ? z$r_buff1_thd4 : (!z$w_buff0_used || !z$r_buff0_thd4 && !z$w_buff1_used || !z$r_buff0_thd4 && !z$r_buff1_thd4 ? z$r_buff1_thd4 : (z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : (_Bool)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=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=0, y=0, z=1, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L824] 4 z$r_buff1_thd4 = weak$$choice2 ? z$r_buff1_thd4 : (!z$w_buff0_used || !z$r_buff0_thd4 && !z$w_buff1_used || !z$r_buff0_thd4 && !z$r_buff1_thd4 ? z$r_buff1_thd4 : (z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : (_Bool)0)) [L825] 4 __unbuffered_p3_EAX = z VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=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=0, y=0, z=1, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L826] 4 z = z$flush_delayed ? z$mem_tmp : z [L827] 4 z$flush_delayed = (_Bool)0 [L830] 4 __unbuffered_p3_EBX = a VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=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=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L770] 3 y = 2 [L773] 3 __unbuffered_p2_EAX = y [L776] 3 weak$$choice0 = __VERIFIER_nondet_bool() [L777] 3 weak$$choice2 = __VERIFIER_nondet_bool() [L778] 3 z$flush_delayed = weak$$choice2 [L779] 3 z$mem_tmp = z VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=3, weak$$choice2=1, x=1, y=2, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L780] EXPR 3 !z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff1) VAL [!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff1)=0, \result={0:0}, \result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=3, weak$$choice2=1, x=1, y=2, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L780] 3 z = !z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff1) [L781] EXPR 3 weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff0)) VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=3, weak$$choice2=1, weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff0))=1, x=1, y=2, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L833] EXPR 4 z$w_buff0_used && z$r_buff0_thd4 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd4 ? z$w_buff1 : z) VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=3, weak$$choice2=1, weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff0))=1, x=1, y=2, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L781] 3 z$w_buff0 = weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff0)) [L782] EXPR 3 weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff1 : z$w_buff1)) VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=3, weak$$choice2=1, weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff1 : z$w_buff1))=0, x=1, y=2, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L782] 3 z$w_buff1 = weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff1 : z$w_buff1)) [L783] EXPR 3 weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used)) VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=3, weak$$choice2=1, weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used))=1, x=1, y=2, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L783] 3 z$w_buff0_used = weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used)) [L784] EXPR 3 weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=3, weak$$choice2=1, weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0))=0, x=1, y=2, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L784] 3 z$w_buff1_used = weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L785] EXPR 3 weak$$choice2 ? z$r_buff0_thd3 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$r_buff0_thd3 : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$r_buff0_thd3)) VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=3, weak$$choice2=1, weak$$choice2 ? z$r_buff0_thd3 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$r_buff0_thd3 : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$r_buff0_thd3))=0, x=1, y=2, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L785] 3 z$r_buff0_thd3 = weak$$choice2 ? z$r_buff0_thd3 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$r_buff0_thd3 : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$r_buff0_thd3)) [L786] EXPR 3 weak$$choice2 ? z$r_buff1_thd3 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$r_buff1_thd3 : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=3, weak$$choice2=1, weak$$choice2 ? z$r_buff1_thd3 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$r_buff1_thd3 : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0))=0, x=1, y=2, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L786] 3 z$r_buff1_thd3 = weak$$choice2 ? z$r_buff1_thd3 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$r_buff1_thd3 : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L787] 3 __unbuffered_p2_EBX = z VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=3, weak$$choice2=1, x=1, y=2, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L833] 4 z = z$w_buff0_used && z$r_buff0_thd4 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd4 ? z$w_buff1 : z) [L834] 4 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$w_buff0_used [L835] 4 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd4 || z$w_buff1_used && z$r_buff1_thd4 ? (_Bool)0 : z$w_buff1_used [L864] 0 main$tmp_guard0 = __unbuffered_cnt == 4 VAL [\result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=3, weak$$choice2=1, x=1, y=2, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L868] 0 z = z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z) [L869] 0 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used [L870] 0 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$w_buff1_used [L871] 0 z$r_buff0_thd0 = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0 - StatisticsResult: Ultimate Automizer benchmark data CFG has 5 procedures, 200 locations, 2 error locations. Result: UNSAFE, OverallTime: 69.2s, OverallIterations: 19, TraceHistogramMax: 1, AutomataDifference: 13.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 3439 SDtfs, 5186 SDslu, 5512 SDs, 0 SdLazy, 1070 SolverSat, 148 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.8s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 86 GetRequests, 16 SyntacticMatches, 2 SemanticMatches, 68 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 0.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=205249occurred in iteration=4, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 41.9s AutomataMinimizationTime, 18 MinimizatonAttempts, 65126 StatesRemovedByMinimization, 12 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.3s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 0.7s InterpolantComputationTime, 736 NumberOfCodeBlocks, 736 NumberOfCodeBlocksAsserted, 19 NumberOfCheckSat, 652 ConstructedInterpolants, 0 QuantifiedInterpolants, 190914 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 18 InterpolantComputations, 18 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! Received shutdown request...