./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/pthread-wmm/mix052_tso.opt.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version f470102c Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx12G -Xms1G -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/pthread-wmm/mix052_tso.opt.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --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 a68dfdc5231f91ed72bde1129b01e1dc58aa71eb ............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................ 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-11-28 18:19:02,990 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-28 18:19:02,992 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-28 18:19:03,011 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-28 18:19:03,011 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-28 18:19:03,013 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-28 18:19:03,015 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-28 18:19:03,025 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-28 18:19:03,031 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-28 18:19:03,034 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-28 18:19:03,035 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-28 18:19:03,037 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-28 18:19:03,038 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-28 18:19:03,040 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-28 18:19:03,041 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-28 18:19:03,043 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-28 18:19:03,045 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-28 18:19:03,046 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-28 18:19:03,048 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-28 18:19:03,052 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-28 18:19:03,056 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-28 18:19:03,061 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-28 18:19:03,062 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-28 18:19:03,064 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-28 18:19:03,067 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-28 18:19:03,068 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-28 18:19:03,068 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-28 18:19:03,070 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-28 18:19:03,070 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-28 18:19:03,071 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-28 18:19:03,072 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-28 18:19:03,072 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-28 18:19:03,073 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-28 18:19:03,074 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-28 18:19:03,076 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-28 18:19:03,076 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-28 18:19:03,077 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-28 18:19:03,077 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-28 18:19:03,078 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-28 18:19:03,079 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-28 18:19:03,080 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-28 18:19:03,081 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2019-11-28 18:19:03,113 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-28 18:19:03,113 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-28 18:19:03,121 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-28 18:19:03,121 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-28 18:19:03,121 INFO L138 SettingsManager]: * Use SBE=true [2019-11-28 18:19:03,122 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-28 18:19:03,122 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-28 18:19:03,122 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-28 18:19:03,122 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-28 18:19:03,123 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-28 18:19:03,123 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-11-28 18:19:03,123 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-28 18:19:03,123 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-11-28 18:19:03,124 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-28 18:19:03,124 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-28 18:19:03,124 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-28 18:19:03,124 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-11-28 18:19:03,125 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-28 18:19:03,125 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-28 18:19:03,125 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-28 18:19:03,126 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-28 18:19:03,126 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-28 18:19:03,126 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-28 18:19:03,127 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-28 18:19:03,127 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-11-28 18:19:03,127 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-11-28 18:19:03,127 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-11-28 18:19:03,128 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-11-28 18:19:03,128 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2019-11-28 18:19:03,128 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 -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux 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 -> a68dfdc5231f91ed72bde1129b01e1dc58aa71eb [2019-11-28 18:19:03,431 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-28 18:19:03,447 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-28 18:19:03,452 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-28 18:19:03,453 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-28 18:19:03,454 INFO L275 PluginConnector]: CDTParser initialized [2019-11-28 18:19:03,455 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/pthread-wmm/mix052_tso.opt.i [2019-11-28 18:19:03,527 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e57124fae/907ab0eccc7b4fb587174784bf3f7109/FLAG991a58411 [2019-11-28 18:19:04,065 INFO L306 CDTParser]: Found 1 translation units. [2019-11-28 18:19:04,067 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/pthread-wmm/mix052_tso.opt.i [2019-11-28 18:19:04,080 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e57124fae/907ab0eccc7b4fb587174784bf3f7109/FLAG991a58411 [2019-11-28 18:19:04,377 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e57124fae/907ab0eccc7b4fb587174784bf3f7109 [2019-11-28 18:19:04,380 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-28 18:19:04,382 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-11-28 18:19:04,383 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-28 18:19:04,384 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-28 18:19:04,387 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-28 18:19:04,388 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 06:19:04" (1/1) ... [2019-11-28 18:19:04,391 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1f677360 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 06:19:04, skipping insertion in model container [2019-11-28 18:19:04,392 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 06:19:04" (1/1) ... [2019-11-28 18:19:04,400 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-11-28 18:19:04,469 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-11-28 18:19:05,018 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-28 18:19:05,031 INFO L203 MainTranslator]: Completed pre-run [2019-11-28 18:19:05,090 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-28 18:19:05,173 INFO L208 MainTranslator]: Completed translation [2019-11-28 18:19:05,173 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 06:19:05 WrapperNode [2019-11-28 18:19:05,174 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-28 18:19:05,175 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-11-28 18:19:05,175 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-11-28 18:19:05,175 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-11-28 18:19:05,184 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 06:19:05" (1/1) ... [2019-11-28 18:19:05,228 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 06:19:05" (1/1) ... [2019-11-28 18:19:05,277 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-11-28 18:19:05,278 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-28 18:19:05,278 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-28 18:19:05,278 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-28 18:19:05,289 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 06:19:05" (1/1) ... [2019-11-28 18:19:05,289 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 06:19:05" (1/1) ... [2019-11-28 18:19:05,305 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 06:19:05" (1/1) ... [2019-11-28 18:19:05,311 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 06:19:05" (1/1) ... [2019-11-28 18:19:05,327 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 06:19:05" (1/1) ... [2019-11-28 18:19:05,336 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 06:19:05" (1/1) ... [2019-11-28 18:19:05,342 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 06:19:05" (1/1) ... [2019-11-28 18:19:05,353 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-28 18:19:05,354 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-28 18:19:05,356 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-28 18:19:05,356 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-28 18:19:05,358 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 06:19:05" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/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-11-28 18:19:05,428 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-11-28 18:19:05,429 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2019-11-28 18:19:05,429 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-11-28 18:19:05,429 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-11-28 18:19:05,429 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2019-11-28 18:19:05,430 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2019-11-28 18:19:05,430 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2019-11-28 18:19:05,430 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2019-11-28 18:19:05,430 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2019-11-28 18:19:05,431 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2019-11-28 18:19:05,431 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2019-11-28 18:19:05,431 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-28 18:19:05,431 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-28 18:19:05,434 WARN L205 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2019-11-28 18:19:06,107 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-28 18:19:06,107 INFO L287 CfgBuilder]: Removed 8 assume(true) statements. [2019-11-28 18:19:06,109 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 06:19:06 BoogieIcfgContainer [2019-11-28 18:19:06,109 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-28 18:19:06,110 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-28 18:19:06,110 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-28 18:19:06,114 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-28 18:19:06,114 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 28.11 06:19:04" (1/3) ... [2019-11-28 18:19:06,115 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6db8d522 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.11 06:19:06, skipping insertion in model container [2019-11-28 18:19:06,115 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 06:19:05" (2/3) ... [2019-11-28 18:19:06,115 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6db8d522 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.11 06:19:06, skipping insertion in model container [2019-11-28 18:19:06,116 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 06:19:06" (3/3) ... [2019-11-28 18:19:06,117 INFO L109 eAbstractionObserver]: Analyzing ICFG mix052_tso.opt.i [2019-11-28 18:19:06,128 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-11-28 18:19:06,128 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-28 18:19:06,136 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2019-11-28 18:19:06,137 INFO L339 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2019-11-28 18:19:06,176 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:19:06,177 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:19:06,177 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:19:06,177 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:19:06,178 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:19:06,178 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:19:06,180 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:19:06,180 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:19:06,180 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:19:06,181 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:19:06,181 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:19:06,181 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:19:06,182 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:19:06,182 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:19:06,182 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:19:06,183 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:19:06,183 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:19:06,183 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:19:06,184 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:19:06,184 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:19:06,184 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:19:06,185 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:19:06,185 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:19:06,186 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:19:06,186 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:19:06,186 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:19:06,187 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:19:06,187 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:19:06,187 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:19:06,188 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:19:06,188 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:19:06,189 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:19:06,189 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:19:06,189 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:19:06,190 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:19:06,191 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:19:06,191 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:19:06,192 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:19:06,193 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:19:06,194 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:19:06,195 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:19:06,195 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:19:06,195 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:19:06,197 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:19:06,198 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:19:06,198 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:19:06,198 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:19:06,199 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:19:06,199 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:19:06,199 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:19:06,200 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:19:06,200 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:19:06,200 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:19:06,201 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:19:06,201 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:19:06,201 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:19:06,201 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:19:06,202 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:19:06,202 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:19:06,202 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:19:06,203 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:19:06,203 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:19:06,206 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:19:06,207 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:19:06,208 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:19:06,208 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:19:06,209 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:19:06,209 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:19:06,209 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:19:06,210 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:19:06,210 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:19:06,210 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:19:06,210 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:19:06,211 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:19:06,211 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:19:06,211 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:19:06,212 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:19:06,212 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:19:06,212 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:19:06,213 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:19:06,214 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:19:06,214 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:19:06,214 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:19:06,215 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:19:06,215 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:19:06,216 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:19:06,216 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:19:06,217 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:19:06,217 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:19:06,217 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:19:06,218 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:19:06,218 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:19:06,218 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:19:06,219 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:19:06,222 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:19:06,223 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:19:06,223 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:19:06,223 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:19:06,224 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:19:06,224 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:19:06,227 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:19:06,227 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:19:06,227 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:19:06,228 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:19:06,228 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:19:06,228 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:19:06,229 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:19:06,229 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:19:06,230 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:19:06,230 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:19:06,230 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:19:06,230 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:19:06,231 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:19:06,231 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:19:06,231 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:19:06,232 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:19:06,232 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:19:06,232 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:19:06,233 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:19:06,233 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:19:06,233 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:19:06,234 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:19:06,234 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:19:06,234 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:19:06,235 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:19:06,235 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:19:06,235 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:19:06,235 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:19:06,236 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:19:06,236 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:19:06,236 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:19:06,237 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:19:06,237 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:19:06,237 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:19:06,258 INFO L249 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2019-11-28 18:19:06,278 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-28 18:19:06,278 INFO L374 AbstractCegarLoop]: Hoare is true [2019-11-28 18:19:06,278 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-28 18:19:06,279 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-28 18:19:06,279 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-28 18:19:06,279 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-28 18:19:06,279 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-28 18:19:06,279 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-28 18:19:06,296 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 151 places, 176 transitions [2019-11-28 18:19:06,299 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 151 places, 176 transitions [2019-11-28 18:19:06,386 INFO L134 PetriNetUnfolder]: 35/173 cut-off events. [2019-11-28 18:19:06,386 INFO L135 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-11-28 18:19:06,406 INFO L76 FinitePrefix]: Finished finitePrefix Result has 183 conditions, 173 events. 35/173 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 12. Compared 561 event pairs. 9/145 useless extension candidates. Maximal degree in co-relation 143. Up to 2 conditions per place. [2019-11-28 18:19:06,430 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 151 places, 176 transitions [2019-11-28 18:19:06,509 INFO L134 PetriNetUnfolder]: 35/173 cut-off events. [2019-11-28 18:19:06,509 INFO L135 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-11-28 18:19:06,517 INFO L76 FinitePrefix]: Finished finitePrefix Result has 183 conditions, 173 events. 35/173 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 12. Compared 561 event pairs. 9/145 useless extension candidates. Maximal degree in co-relation 143. Up to 2 conditions per place. [2019-11-28 18:19:06,534 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 11400 [2019-11-28 18:19:06,535 INFO L170 etLargeBlockEncoding]: Semantic Check. [2019-11-28 18:19:11,414 WARN L192 SmtUtils]: Spent 264.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 87 [2019-11-28 18:19:11,583 WARN L192 SmtUtils]: Spent 163.00 ms on a formula simplification that was a NOOP. DAG size: 85 [2019-11-28 18:19:11,653 INFO L206 etLargeBlockEncoding]: Checked pairs total: 39870 [2019-11-28 18:19:11,654 INFO L214 etLargeBlockEncoding]: Total number of compositions: 110 [2019-11-28 18:19:11,658 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 72 places, 80 transitions [2019-11-28 18:19:12,621 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 12726 states. [2019-11-28 18:19:12,623 INFO L276 IsEmpty]: Start isEmpty. Operand 12726 states. [2019-11-28 18:19:12,629 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-11-28 18:19:12,630 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 18:19:12,631 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2019-11-28 18:19:12,631 INFO L410 AbstractCegarLoop]: === Iteration 1 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 18:19:12,636 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 18:19:12,636 INFO L82 PathProgramCache]: Analyzing trace with hash -534032227, now seen corresponding path program 1 times [2019-11-28 18:19:12,643 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 18:19:12,644 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1582075074] [2019-11-28 18:19:12,644 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 18:19:12,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 18:19:12,884 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 18:19:12,885 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1582075074] [2019-11-28 18:19:12,886 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 18:19:12,886 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-11-28 18:19:12,887 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [144355853] [2019-11-28 18:19:12,892 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-28 18:19:12,893 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 18:19:12,908 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-28 18:19:12,909 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 18:19:12,911 INFO L87 Difference]: Start difference. First operand 12726 states. Second operand 3 states. [2019-11-28 18:19:13,283 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 18:19:13,283 INFO L93 Difference]: Finished difference Result 12374 states and 47232 transitions. [2019-11-28 18:19:13,284 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-28 18:19:13,285 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 7 [2019-11-28 18:19:13,286 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 18:19:13,422 INFO L225 Difference]: With dead ends: 12374 [2019-11-28 18:19:13,422 INFO L226 Difference]: Without dead ends: 11654 [2019-11-28 18:19:13,424 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-11-28 18:19:13,583 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11654 states. [2019-11-28 18:19:14,180 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11654 to 11654. [2019-11-28 18:19:14,182 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11654 states. [2019-11-28 18:19:14,261 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11654 states to 11654 states and 44412 transitions. [2019-11-28 18:19:14,263 INFO L78 Accepts]: Start accepts. Automaton has 11654 states and 44412 transitions. Word has length 7 [2019-11-28 18:19:14,265 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 18:19:14,265 INFO L462 AbstractCegarLoop]: Abstraction has 11654 states and 44412 transitions. [2019-11-28 18:19:14,265 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-28 18:19:14,265 INFO L276 IsEmpty]: Start isEmpty. Operand 11654 states and 44412 transitions. [2019-11-28 18:19:14,275 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-11-28 18:19:14,275 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 18:19:14,276 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 18:19:14,276 INFO L410 AbstractCegarLoop]: === Iteration 2 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 18:19:14,277 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 18:19:14,277 INFO L82 PathProgramCache]: Analyzing trace with hash 633204052, now seen corresponding path program 1 times [2019-11-28 18:19:14,277 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 18:19:14,277 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1965126030] [2019-11-28 18:19:14,278 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 18:19:14,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 18:19:14,462 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 18:19:14,463 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1965126030] [2019-11-28 18:19:14,463 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 18:19:14,463 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-28 18:19:14,463 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [537285812] [2019-11-28 18:19:14,466 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-28 18:19:14,466 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 18:19:14,467 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-28 18:19:14,467 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-28 18:19:14,467 INFO L87 Difference]: Start difference. First operand 11654 states and 44412 transitions. Second operand 4 states. [2019-11-28 18:19:14,859 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 18:19:14,860 INFO L93 Difference]: Finished difference Result 17566 states and 64596 transitions. [2019-11-28 18:19:14,861 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-28 18:19:14,865 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 13 [2019-11-28 18:19:14,865 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 18:19:14,972 INFO L225 Difference]: With dead ends: 17566 [2019-11-28 18:19:14,972 INFO L226 Difference]: Without dead ends: 17538 [2019-11-28 18:19:14,973 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-11-28 18:19:15,120 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17538 states. [2019-11-28 18:19:15,566 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17538 to 15872. [2019-11-28 18:19:15,567 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15872 states. [2019-11-28 18:19:15,637 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15872 states to 15872 states and 59183 transitions. [2019-11-28 18:19:15,638 INFO L78 Accepts]: Start accepts. Automaton has 15872 states and 59183 transitions. Word has length 13 [2019-11-28 18:19:15,638 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 18:19:15,638 INFO L462 AbstractCegarLoop]: Abstraction has 15872 states and 59183 transitions. [2019-11-28 18:19:15,638 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-28 18:19:15,639 INFO L276 IsEmpty]: Start isEmpty. Operand 15872 states and 59183 transitions. [2019-11-28 18:19:15,643 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-11-28 18:19:15,644 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 18:19:15,644 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 18:19:15,644 INFO L410 AbstractCegarLoop]: === Iteration 3 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 18:19:15,645 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 18:19:15,645 INFO L82 PathProgramCache]: Analyzing trace with hash 1912379884, now seen corresponding path program 1 times [2019-11-28 18:19:15,645 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 18:19:15,645 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1199855000] [2019-11-28 18:19:15,646 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 18:19:15,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 18:19:15,710 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 18:19:15,711 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1199855000] [2019-11-28 18:19:15,711 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 18:19:15,711 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-28 18:19:15,712 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [650708283] [2019-11-28 18:19:15,712 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-28 18:19:15,712 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 18:19:15,713 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-28 18:19:15,713 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-28 18:19:15,713 INFO L87 Difference]: Start difference. First operand 15872 states and 59183 transitions. Second operand 4 states. [2019-11-28 18:19:15,986 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 18:19:15,987 INFO L93 Difference]: Finished difference Result 20884 states and 77167 transitions. [2019-11-28 18:19:15,987 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-28 18:19:15,987 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 16 [2019-11-28 18:19:15,988 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 18:19:16,311 INFO L225 Difference]: With dead ends: 20884 [2019-11-28 18:19:16,312 INFO L226 Difference]: Without dead ends: 20858 [2019-11-28 18:19:16,312 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-11-28 18:19:16,469 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20858 states. [2019-11-28 18:19:16,864 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20858 to 18074. [2019-11-28 18:19:16,864 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18074 states. [2019-11-28 18:19:16,918 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18074 states to 18074 states and 67346 transitions. [2019-11-28 18:19:16,919 INFO L78 Accepts]: Start accepts. Automaton has 18074 states and 67346 transitions. Word has length 16 [2019-11-28 18:19:16,919 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 18:19:16,919 INFO L462 AbstractCegarLoop]: Abstraction has 18074 states and 67346 transitions. [2019-11-28 18:19:16,919 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-28 18:19:16,919 INFO L276 IsEmpty]: Start isEmpty. Operand 18074 states and 67346 transitions. [2019-11-28 18:19:16,924 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-11-28 18:19:16,924 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 18:19:16,924 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 18:19:16,924 INFO L410 AbstractCegarLoop]: === Iteration 4 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 18:19:16,928 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 18:19:16,928 INFO L82 PathProgramCache]: Analyzing trace with hash 1912467552, now seen corresponding path program 1 times [2019-11-28 18:19:16,928 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 18:19:16,929 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1983959485] [2019-11-28 18:19:16,929 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 18:19:16,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 18:19:17,011 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 18:19:17,011 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1983959485] [2019-11-28 18:19:17,011 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 18:19:17,011 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-28 18:19:17,012 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1710204454] [2019-11-28 18:19:17,012 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-28 18:19:17,012 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 18:19:17,012 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-28 18:19:17,013 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-28 18:19:17,013 INFO L87 Difference]: Start difference. First operand 18074 states and 67346 transitions. Second operand 4 states. [2019-11-28 18:19:17,254 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 18:19:17,254 INFO L93 Difference]: Finished difference Result 22456 states and 83013 transitions. [2019-11-28 18:19:17,255 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-28 18:19:17,255 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 16 [2019-11-28 18:19:17,255 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 18:19:17,313 INFO L225 Difference]: With dead ends: 22456 [2019-11-28 18:19:17,313 INFO L226 Difference]: Without dead ends: 22430 [2019-11-28 18:19:17,314 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-28 18:19:17,467 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22430 states. [2019-11-28 18:19:17,925 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22430 to 17846. [2019-11-28 18:19:17,926 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17846 states. [2019-11-28 18:19:18,552 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17846 states to 17846 states and 66430 transitions. [2019-11-28 18:19:18,553 INFO L78 Accepts]: Start accepts. Automaton has 17846 states and 66430 transitions. Word has length 16 [2019-11-28 18:19:18,553 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 18:19:18,553 INFO L462 AbstractCegarLoop]: Abstraction has 17846 states and 66430 transitions. [2019-11-28 18:19:18,553 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-28 18:19:18,553 INFO L276 IsEmpty]: Start isEmpty. Operand 17846 states and 66430 transitions. [2019-11-28 18:19:18,561 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-11-28 18:19:18,561 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 18:19:18,561 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 18:19:18,561 INFO L410 AbstractCegarLoop]: === Iteration 5 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 18:19:18,562 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 18:19:18,562 INFO L82 PathProgramCache]: Analyzing trace with hash -478811358, now seen corresponding path program 1 times [2019-11-28 18:19:18,562 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 18:19:18,562 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1231973794] [2019-11-28 18:19:18,563 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 18:19:18,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 18:19:18,631 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 18:19:18,631 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1231973794] [2019-11-28 18:19:18,631 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 18:19:18,631 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-28 18:19:18,632 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [994664365] [2019-11-28 18:19:18,632 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-28 18:19:18,632 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 18:19:18,632 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-28 18:19:18,633 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 18:19:18,633 INFO L87 Difference]: Start difference. First operand 17846 states and 66430 transitions. Second operand 3 states. [2019-11-28 18:19:18,741 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 18:19:18,741 INFO L93 Difference]: Finished difference Result 16910 states and 62086 transitions. [2019-11-28 18:19:18,744 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-28 18:19:18,744 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 18 [2019-11-28 18:19:18,744 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 18:19:18,782 INFO L225 Difference]: With dead ends: 16910 [2019-11-28 18:19:18,782 INFO L226 Difference]: Without dead ends: 16910 [2019-11-28 18:19:18,783 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-11-28 18:19:18,891 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16910 states. [2019-11-28 18:19:19,220 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16910 to 16670. [2019-11-28 18:19:19,220 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16670 states. [2019-11-28 18:19:19,260 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16670 states to 16670 states and 61270 transitions. [2019-11-28 18:19:19,261 INFO L78 Accepts]: Start accepts. Automaton has 16670 states and 61270 transitions. Word has length 18 [2019-11-28 18:19:19,261 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 18:19:19,261 INFO L462 AbstractCegarLoop]: Abstraction has 16670 states and 61270 transitions. [2019-11-28 18:19:19,261 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-28 18:19:19,262 INFO L276 IsEmpty]: Start isEmpty. Operand 16670 states and 61270 transitions. [2019-11-28 18:19:19,267 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-11-28 18:19:19,267 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 18:19:19,267 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 18:19:19,267 INFO L410 AbstractCegarLoop]: === Iteration 6 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 18:19:19,267 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 18:19:19,268 INFO L82 PathProgramCache]: Analyzing trace with hash -890198145, now seen corresponding path program 1 times [2019-11-28 18:19:19,268 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 18:19:19,268 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1382560374] [2019-11-28 18:19:19,268 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 18:19:19,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 18:19:19,353 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 18:19:19,353 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1382560374] [2019-11-28 18:19:19,353 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 18:19:19,354 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-11-28 18:19:19,354 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [786712195] [2019-11-28 18:19:19,354 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-28 18:19:19,354 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 18:19:19,355 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-28 18:19:19,355 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 18:19:19,355 INFO L87 Difference]: Start difference. First operand 16670 states and 61270 transitions. Second operand 3 states. [2019-11-28 18:19:19,482 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 18:19:19,483 INFO L93 Difference]: Finished difference Result 24996 states and 87011 transitions. [2019-11-28 18:19:19,483 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-28 18:19:19,483 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 18 [2019-11-28 18:19:19,483 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 18:19:19,534 INFO L225 Difference]: With dead ends: 24996 [2019-11-28 18:19:19,535 INFO L226 Difference]: Without dead ends: 24412 [2019-11-28 18:19:19,535 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-11-28 18:19:19,644 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24412 states. [2019-11-28 18:19:20,498 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24412 to 23641. [2019-11-28 18:19:20,498 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23641 states. [2019-11-28 18:19:20,559 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23641 states to 23641 states and 83002 transitions. [2019-11-28 18:19:20,559 INFO L78 Accepts]: Start accepts. Automaton has 23641 states and 83002 transitions. Word has length 18 [2019-11-28 18:19:20,559 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 18:19:20,559 INFO L462 AbstractCegarLoop]: Abstraction has 23641 states and 83002 transitions. [2019-11-28 18:19:20,559 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-28 18:19:20,560 INFO L276 IsEmpty]: Start isEmpty. Operand 23641 states and 83002 transitions. [2019-11-28 18:19:20,567 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-11-28 18:19:20,567 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 18:19:20,567 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 18:19:20,567 INFO L410 AbstractCegarLoop]: === Iteration 7 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 18:19:20,568 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 18:19:20,568 INFO L82 PathProgramCache]: Analyzing trace with hash -1530730374, now seen corresponding path program 1 times [2019-11-28 18:19:20,568 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 18:19:20,568 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1402516658] [2019-11-28 18:19:20,568 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 18:19:20,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 18:19:20,622 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 18:19:20,623 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1402516658] [2019-11-28 18:19:20,623 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 18:19:20,623 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-28 18:19:20,624 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1600438176] [2019-11-28 18:19:20,624 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-28 18:19:20,624 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 18:19:20,624 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-28 18:19:20,624 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 18:19:20,625 INFO L87 Difference]: Start difference. First operand 23641 states and 83002 transitions. Second operand 3 states. [2019-11-28 18:19:20,707 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 18:19:20,708 INFO L93 Difference]: Finished difference Result 15262 states and 48880 transitions. [2019-11-28 18:19:20,708 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-28 18:19:20,708 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 19 [2019-11-28 18:19:20,709 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 18:19:20,744 INFO L225 Difference]: With dead ends: 15262 [2019-11-28 18:19:20,744 INFO L226 Difference]: Without dead ends: 15262 [2019-11-28 18:19:20,745 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 18:19:20,805 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15262 states. [2019-11-28 18:19:20,976 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15262 to 15262. [2019-11-28 18:19:20,977 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15262 states. [2019-11-28 18:19:21,010 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15262 states to 15262 states and 48880 transitions. [2019-11-28 18:19:21,011 INFO L78 Accepts]: Start accepts. Automaton has 15262 states and 48880 transitions. Word has length 19 [2019-11-28 18:19:21,011 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 18:19:21,012 INFO L462 AbstractCegarLoop]: Abstraction has 15262 states and 48880 transitions. [2019-11-28 18:19:21,012 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-28 18:19:21,012 INFO L276 IsEmpty]: Start isEmpty. Operand 15262 states and 48880 transitions. [2019-11-28 18:19:21,018 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-11-28 18:19:21,019 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 18:19:21,019 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-11-28 18:19:21,019 INFO L410 AbstractCegarLoop]: === Iteration 8 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 18:19:21,019 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 18:19:21,019 INFO L82 PathProgramCache]: Analyzing trace with hash 152549995, now seen corresponding path program 1 times [2019-11-28 18:19:21,020 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 18:19:21,020 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1552378599] [2019-11-28 18:19:21,020 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 18:19:21,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 18:19:21,078 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 18:19:21,079 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1552378599] [2019-11-28 18:19:21,079 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 18:19:21,079 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-28 18:19:21,079 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [658732110] [2019-11-28 18:19:21,081 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-28 18:19:21,081 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 18:19:21,081 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-28 18:19:21,081 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-28 18:19:21,081 INFO L87 Difference]: Start difference. First operand 15262 states and 48880 transitions. Second operand 4 states. [2019-11-28 18:19:21,113 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 18:19:21,113 INFO L93 Difference]: Finished difference Result 2802 states and 7085 transitions. [2019-11-28 18:19:21,113 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-28 18:19:21,113 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 20 [2019-11-28 18:19:21,114 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 18:19:21,118 INFO L225 Difference]: With dead ends: 2802 [2019-11-28 18:19:21,118 INFO L226 Difference]: Without dead ends: 2802 [2019-11-28 18:19:21,118 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-11-28 18:19:21,125 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2802 states. [2019-11-28 18:19:21,157 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2802 to 2716. [2019-11-28 18:19:21,157 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2716 states. [2019-11-28 18:19:21,164 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2716 states to 2716 states and 6888 transitions. [2019-11-28 18:19:21,164 INFO L78 Accepts]: Start accepts. Automaton has 2716 states and 6888 transitions. Word has length 20 [2019-11-28 18:19:21,164 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 18:19:21,164 INFO L462 AbstractCegarLoop]: Abstraction has 2716 states and 6888 transitions. [2019-11-28 18:19:21,165 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-28 18:19:21,165 INFO L276 IsEmpty]: Start isEmpty. Operand 2716 states and 6888 transitions. [2019-11-28 18:19:21,169 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2019-11-28 18:19:21,169 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 18:19:21,169 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] [2019-11-28 18:19:21,170 INFO L410 AbstractCegarLoop]: === Iteration 9 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 18:19:21,170 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 18:19:21,170 INFO L82 PathProgramCache]: Analyzing trace with hash 1752215634, now seen corresponding path program 1 times [2019-11-28 18:19:21,170 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 18:19:21,170 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [430024006] [2019-11-28 18:19:21,171 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 18:19:21,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 18:19:21,210 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 18:19:21,211 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [430024006] [2019-11-28 18:19:21,211 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 18:19:21,211 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-28 18:19:21,211 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1586595667] [2019-11-28 18:19:21,212 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-28 18:19:21,212 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 18:19:21,212 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-28 18:19:21,212 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 18:19:21,212 INFO L87 Difference]: Start difference. First operand 2716 states and 6888 transitions. Second operand 3 states. [2019-11-28 18:19:21,254 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 18:19:21,254 INFO L93 Difference]: Finished difference Result 3702 states and 9166 transitions. [2019-11-28 18:19:21,254 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-28 18:19:21,255 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 29 [2019-11-28 18:19:21,255 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 18:19:21,260 INFO L225 Difference]: With dead ends: 3702 [2019-11-28 18:19:21,261 INFO L226 Difference]: Without dead ends: 3702 [2019-11-28 18:19:21,261 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 18:19:21,269 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3702 states. [2019-11-28 18:19:21,303 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3702 to 2817. [2019-11-28 18:19:21,303 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2817 states. [2019-11-28 18:19:21,309 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2817 states to 2817 states and 7127 transitions. [2019-11-28 18:19:21,309 INFO L78 Accepts]: Start accepts. Automaton has 2817 states and 7127 transitions. Word has length 29 [2019-11-28 18:19:21,310 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 18:19:21,310 INFO L462 AbstractCegarLoop]: Abstraction has 2817 states and 7127 transitions. [2019-11-28 18:19:21,310 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-28 18:19:21,310 INFO L276 IsEmpty]: Start isEmpty. Operand 2817 states and 7127 transitions. [2019-11-28 18:19:21,314 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2019-11-28 18:19:21,314 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 18:19:21,314 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] [2019-11-28 18:19:21,315 INFO L410 AbstractCegarLoop]: === Iteration 10 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 18:19:21,315 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 18:19:21,315 INFO L82 PathProgramCache]: Analyzing trace with hash 1147773388, now seen corresponding path program 1 times [2019-11-28 18:19:21,315 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 18:19:21,315 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [934847403] [2019-11-28 18:19:21,316 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 18:19:21,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 18:19:21,374 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 18:19:21,374 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [934847403] [2019-11-28 18:19:21,374 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 18:19:21,374 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-28 18:19:21,375 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2053098899] [2019-11-28 18:19:21,375 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-28 18:19:21,375 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 18:19:21,375 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-28 18:19:21,376 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-28 18:19:21,376 INFO L87 Difference]: Start difference. First operand 2817 states and 7127 transitions. Second operand 5 states. [2019-11-28 18:19:21,574 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 18:19:21,574 INFO L93 Difference]: Finished difference Result 3761 states and 9255 transitions. [2019-11-28 18:19:21,575 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-11-28 18:19:21,575 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 29 [2019-11-28 18:19:21,575 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 18:19:21,581 INFO L225 Difference]: With dead ends: 3761 [2019-11-28 18:19:21,581 INFO L226 Difference]: Without dead ends: 3759 [2019-11-28 18:19:21,581 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-11-28 18:19:21,587 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3759 states. [2019-11-28 18:19:21,614 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3759 to 3035. [2019-11-28 18:19:21,614 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3035 states. [2019-11-28 18:19:21,619 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3035 states to 3035 states and 7662 transitions. [2019-11-28 18:19:21,619 INFO L78 Accepts]: Start accepts. Automaton has 3035 states and 7662 transitions. Word has length 29 [2019-11-28 18:19:21,619 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 18:19:21,619 INFO L462 AbstractCegarLoop]: Abstraction has 3035 states and 7662 transitions. [2019-11-28 18:19:21,619 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-28 18:19:21,620 INFO L276 IsEmpty]: Start isEmpty. Operand 3035 states and 7662 transitions. [2019-11-28 18:19:21,623 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2019-11-28 18:19:21,623 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 18:19:21,624 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] [2019-11-28 18:19:21,624 INFO L410 AbstractCegarLoop]: === Iteration 11 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 18:19:21,624 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 18:19:21,624 INFO L82 PathProgramCache]: Analyzing trace with hash -1335383201, now seen corresponding path program 1 times [2019-11-28 18:19:21,624 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 18:19:21,625 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1539039076] [2019-11-28 18:19:21,625 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 18:19:21,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 18:19:21,672 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 18:19:21,673 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1539039076] [2019-11-28 18:19:21,673 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 18:19:21,673 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-28 18:19:21,673 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2030240599] [2019-11-28 18:19:21,673 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-28 18:19:21,673 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 18:19:21,674 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-28 18:19:21,674 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 18:19:21,674 INFO L87 Difference]: Start difference. First operand 3035 states and 7662 transitions. Second operand 3 states. [2019-11-28 18:19:21,721 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 18:19:21,721 INFO L93 Difference]: Finished difference Result 3627 states and 8773 transitions. [2019-11-28 18:19:21,721 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-28 18:19:21,722 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 29 [2019-11-28 18:19:21,722 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 18:19:21,727 INFO L225 Difference]: With dead ends: 3627 [2019-11-28 18:19:21,727 INFO L226 Difference]: Without dead ends: 3627 [2019-11-28 18:19:21,728 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 18:19:21,736 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3627 states. [2019-11-28 18:19:21,775 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3627 to 3165. [2019-11-28 18:19:21,775 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3165 states. [2019-11-28 18:19:21,782 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3165 states to 3165 states and 7688 transitions. [2019-11-28 18:19:21,783 INFO L78 Accepts]: Start accepts. Automaton has 3165 states and 7688 transitions. Word has length 29 [2019-11-28 18:19:21,783 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 18:19:21,783 INFO L462 AbstractCegarLoop]: Abstraction has 3165 states and 7688 transitions. [2019-11-28 18:19:21,783 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-28 18:19:21,783 INFO L276 IsEmpty]: Start isEmpty. Operand 3165 states and 7688 transitions. [2019-11-28 18:19:21,788 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2019-11-28 18:19:21,788 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 18:19:21,788 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] [2019-11-28 18:19:21,788 INFO L410 AbstractCegarLoop]: === Iteration 12 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 18:19:21,789 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 18:19:21,789 INFO L82 PathProgramCache]: Analyzing trace with hash -1100690548, now seen corresponding path program 1 times [2019-11-28 18:19:21,789 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 18:19:21,789 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1056058598] [2019-11-28 18:19:21,789 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 18:19:21,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 18:19:21,842 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 18:19:21,842 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1056058598] [2019-11-28 18:19:21,843 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 18:19:21,843 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-28 18:19:21,843 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [760331530] [2019-11-28 18:19:21,843 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-28 18:19:21,844 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 18:19:21,844 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-28 18:19:21,844 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-11-28 18:19:21,844 INFO L87 Difference]: Start difference. First operand 3165 states and 7688 transitions. Second operand 5 states. [2019-11-28 18:19:21,876 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 18:19:21,877 INFO L93 Difference]: Finished difference Result 1729 states and 4320 transitions. [2019-11-28 18:19:21,877 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-28 18:19:21,877 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 30 [2019-11-28 18:19:21,877 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 18:19:21,880 INFO L225 Difference]: With dead ends: 1729 [2019-11-28 18:19:21,880 INFO L226 Difference]: Without dead ends: 1681 [2019-11-28 18:19:21,880 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-11-28 18:19:21,884 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1681 states. [2019-11-28 18:19:21,899 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1681 to 1184. [2019-11-28 18:19:21,900 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1184 states. [2019-11-28 18:19:21,902 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1184 states to 1184 states and 3076 transitions. [2019-11-28 18:19:21,903 INFO L78 Accepts]: Start accepts. Automaton has 1184 states and 3076 transitions. Word has length 30 [2019-11-28 18:19:21,903 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 18:19:21,903 INFO L462 AbstractCegarLoop]: Abstraction has 1184 states and 3076 transitions. [2019-11-28 18:19:21,903 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-28 18:19:21,903 INFO L276 IsEmpty]: Start isEmpty. Operand 1184 states and 3076 transitions. [2019-11-28 18:19:21,906 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2019-11-28 18:19:21,906 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 18:19:21,906 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 18:19:21,906 INFO L410 AbstractCegarLoop]: === Iteration 13 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 18:19:21,906 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 18:19:21,907 INFO L82 PathProgramCache]: Analyzing trace with hash 1886282581, now seen corresponding path program 1 times [2019-11-28 18:19:21,907 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 18:19:21,907 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [51751081] [2019-11-28 18:19:21,907 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 18:19:21,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 18:19:22,242 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 18:19:22,243 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [51751081] [2019-11-28 18:19:22,243 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 18:19:22,244 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2019-11-28 18:19:22,244 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1500137876] [2019-11-28 18:19:22,244 INFO L442 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-11-28 18:19:22,245 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 18:19:22,245 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-11-28 18:19:22,245 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=130, Unknown=0, NotChecked=0, Total=156 [2019-11-28 18:19:22,246 INFO L87 Difference]: Start difference. First operand 1184 states and 3076 transitions. Second operand 13 states. [2019-11-28 18:19:26,213 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 18:19:26,213 INFO L93 Difference]: Finished difference Result 4029 states and 9800 transitions. [2019-11-28 18:19:26,214 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 49 states. [2019-11-28 18:19:26,214 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 45 [2019-11-28 18:19:26,214 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 18:19:26,219 INFO L225 Difference]: With dead ends: 4029 [2019-11-28 18:19:26,219 INFO L226 Difference]: Without dead ends: 3809 [2019-11-28 18:19:26,220 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 49 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 703 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=465, Invalid=2085, Unknown=0, NotChecked=0, Total=2550 [2019-11-28 18:19:26,225 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3809 states. [2019-11-28 18:19:26,240 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3809 to 1266. [2019-11-28 18:19:26,240 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1266 states. [2019-11-28 18:19:26,242 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1266 states to 1266 states and 3303 transitions. [2019-11-28 18:19:26,242 INFO L78 Accepts]: Start accepts. Automaton has 1266 states and 3303 transitions. Word has length 45 [2019-11-28 18:19:26,242 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 18:19:26,242 INFO L462 AbstractCegarLoop]: Abstraction has 1266 states and 3303 transitions. [2019-11-28 18:19:26,242 INFO L463 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-11-28 18:19:26,242 INFO L276 IsEmpty]: Start isEmpty. Operand 1266 states and 3303 transitions. [2019-11-28 18:19:26,244 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2019-11-28 18:19:26,244 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 18:19:26,244 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 18:19:26,245 INFO L410 AbstractCegarLoop]: === Iteration 14 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 18:19:26,245 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 18:19:26,245 INFO L82 PathProgramCache]: Analyzing trace with hash -1524755247, now seen corresponding path program 2 times [2019-11-28 18:19:26,245 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 18:19:26,245 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1403593178] [2019-11-28 18:19:26,246 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 18:19:26,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 18:19:26,318 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 18:19:26,318 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1403593178] [2019-11-28 18:19:26,318 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 18:19:26,319 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-28 18:19:26,319 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [366793015] [2019-11-28 18:19:26,319 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-28 18:19:26,319 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 18:19:26,320 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-28 18:19:26,320 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-28 18:19:26,320 INFO L87 Difference]: Start difference. First operand 1266 states and 3303 transitions. Second operand 4 states. [2019-11-28 18:19:26,340 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 18:19:26,340 INFO L93 Difference]: Finished difference Result 1906 states and 4691 transitions. [2019-11-28 18:19:26,341 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-28 18:19:26,341 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 45 [2019-11-28 18:19:26,341 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 18:19:26,342 INFO L225 Difference]: With dead ends: 1906 [2019-11-28 18:19:26,342 INFO L226 Difference]: Without dead ends: 696 [2019-11-28 18:19:26,343 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-11-28 18:19:26,344 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 696 states. [2019-11-28 18:19:26,350 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 696 to 696. [2019-11-28 18:19:26,350 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 696 states. [2019-11-28 18:19:26,351 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 696 states to 696 states and 1493 transitions. [2019-11-28 18:19:26,351 INFO L78 Accepts]: Start accepts. Automaton has 696 states and 1493 transitions. Word has length 45 [2019-11-28 18:19:26,352 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 18:19:26,352 INFO L462 AbstractCegarLoop]: Abstraction has 696 states and 1493 transitions. [2019-11-28 18:19:26,352 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-28 18:19:26,352 INFO L276 IsEmpty]: Start isEmpty. Operand 696 states and 1493 transitions. [2019-11-28 18:19:26,353 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2019-11-28 18:19:26,353 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 18:19:26,353 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 18:19:26,354 INFO L410 AbstractCegarLoop]: === Iteration 15 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 18:19:26,354 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 18:19:26,354 INFO L82 PathProgramCache]: Analyzing trace with hash 673695767, now seen corresponding path program 3 times [2019-11-28 18:19:26,354 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 18:19:26,354 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1629861243] [2019-11-28 18:19:26,355 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 18:19:26,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 18:19:26,439 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 18:19:26,440 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1629861243] [2019-11-28 18:19:26,440 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 18:19:26,440 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-28 18:19:26,440 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1303357532] [2019-11-28 18:19:26,440 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-28 18:19:26,441 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 18:19:26,441 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-28 18:19:26,441 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-11-28 18:19:26,441 INFO L87 Difference]: Start difference. First operand 696 states and 1493 transitions. Second operand 6 states. [2019-11-28 18:19:26,690 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 18:19:26,691 INFO L93 Difference]: Finished difference Result 1775 states and 3746 transitions. [2019-11-28 18:19:26,691 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-11-28 18:19:26,691 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 45 [2019-11-28 18:19:26,692 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 18:19:26,694 INFO L225 Difference]: With dead ends: 1775 [2019-11-28 18:19:26,694 INFO L226 Difference]: Without dead ends: 1219 [2019-11-28 18:19:26,695 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=40, Invalid=92, Unknown=0, NotChecked=0, Total=132 [2019-11-28 18:19:26,697 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1219 states. [2019-11-28 18:19:26,709 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1219 to 777. [2019-11-28 18:19:26,709 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 777 states. [2019-11-28 18:19:26,711 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 777 states to 777 states and 1664 transitions. [2019-11-28 18:19:26,712 INFO L78 Accepts]: Start accepts. Automaton has 777 states and 1664 transitions. Word has length 45 [2019-11-28 18:19:26,712 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 18:19:26,712 INFO L462 AbstractCegarLoop]: Abstraction has 777 states and 1664 transitions. [2019-11-28 18:19:26,712 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-28 18:19:26,712 INFO L276 IsEmpty]: Start isEmpty. Operand 777 states and 1664 transitions. [2019-11-28 18:19:26,716 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2019-11-28 18:19:26,716 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 18:19:26,716 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 18:19:26,716 INFO L410 AbstractCegarLoop]: === Iteration 16 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 18:19:26,717 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 18:19:26,717 INFO L82 PathProgramCache]: Analyzing trace with hash 1361037591, now seen corresponding path program 4 times [2019-11-28 18:19:26,717 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 18:19:26,717 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1893206238] [2019-11-28 18:19:26,718 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 18:19:26,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 18:19:26,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 18:19:26,892 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-28 18:19:26,894 INFO L475 BasicCegarLoop]: Counterexample might be feasible [2019-11-28 18:19:26,898 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [723] [723] ULTIMATE.startENTRY-->L810: Formula: (let ((.cse0 (store |v_#valid_64| 0 0))) (and (= 0 v_~y$read_delayed_var~0.base_6) (= v_~y$w_buff1_used~0_392 0) (= v_~x~0_45 0) (= 0 |v_ULTIMATE.start_main_~#t1406~0.offset_23|) (= v_~y$mem_tmp~0_16 0) (= |v_#length_21| (store |v_#length_22| |v_ULTIMATE.start_main_~#t1406~0.base_31| 4)) (= 0 v_~y$r_buff1_thd1~0_88) (= v_~weak$$choice2~0_148 0) (= v_~y$r_buff0_thd1~0_34 0) (= 0 (select .cse0 |v_ULTIMATE.start_main_~#t1406~0.base_31|)) (= v_~y$w_buff0_used~0_595 0) (= v_~y$r_buff1_thd0~0_147 0) (= 0 v_~y$flush_delayed~0_39) (< 0 |v_#StackHeapBarrier_16|) (= (store |v_#memory_int_18| |v_ULTIMATE.start_main_~#t1406~0.base_31| (store (select |v_#memory_int_18| |v_ULTIMATE.start_main_~#t1406~0.base_31|) |v_ULTIMATE.start_main_~#t1406~0.offset_23| 0)) |v_#memory_int_17|) (= 0 v_~y$r_buff0_thd3~0_173) (= v_~y$r_buff0_thd0~0_94 0) (= 0 v_~__unbuffered_p2_EAX~0_109) (= 0 v_~y$r_buff0_thd2~0_289) (= v_~y$w_buff1~0_216 0) (= v_~z~0_45 0) (= 0 v_~y$w_buff0~0_304) (= 0 |v_#NULL.base_4|) (= 0 v_~__unbuffered_p1_EAX~0_57) (= v_~y~0_127 0) (= v_~main$tmp_guard0~0_20 0) (= v_~y$read_delayed~0_5 0) (= v_~main$tmp_guard1~0_32 0) (= |v_#NULL.offset_4| 0) (= (store .cse0 |v_ULTIMATE.start_main_~#t1406~0.base_31| 1) |v_#valid_62|) (< |v_#StackHeapBarrier_16| |v_ULTIMATE.start_main_~#t1406~0.base_31|) (= 0 v_~y$r_buff1_thd2~0_268) (= 0 v_~y$read_delayed_var~0.offset_6) (= 0 v_~y$r_buff1_thd3~0_150) (= 0 v_~__unbuffered_cnt~0_97) (= 0 v_~weak$$choice0~0_12))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_16|, #valid=|v_#valid_64|, #memory_int=|v_#memory_int_18|, #length=|v_#length_22|} OutVars{ULTIMATE.start_main_~#t1406~0.base=|v_ULTIMATE.start_main_~#t1406~0.base_31|, ULTIMATE.start_main_#t~nondet32=|v_ULTIMATE.start_main_#t~nondet32_10|, ULTIMATE.start_main_#t~nondet34=|v_ULTIMATE.start_main_#t~nondet34_19|, #NULL.offset=|v_#NULL.offset_4|, ~y$read_delayed~0=v_~y$read_delayed~0_5, ~y$mem_tmp~0=v_~y$mem_tmp~0_16, ~y$r_buff1_thd3~0=v_~y$r_buff1_thd3~0_150, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_57, ~y$r_buff0_thd1~0=v_~y$r_buff0_thd1~0_34, ~y$flush_delayed~0=v_~y$flush_delayed~0_39, ULTIMATE.start_main_~#t1408~0.offset=|v_ULTIMATE.start_main_~#t1408~0.offset_15|, #length=|v_#length_21|, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_109, ULTIMATE.start_main_#t~ite39=|v_ULTIMATE.start_main_#t~ite39_31|, ULTIMATE.start_main_#t~ite35=|v_ULTIMATE.start_main_#t~ite35_35|, ULTIMATE.start_main_#t~ite37=|v_ULTIMATE.start_main_#t~ite37_33|, ~weak$$choice0~0=v_~weak$$choice0~0_12, #StackHeapBarrier=|v_#StackHeapBarrier_16|, ULTIMATE.start_main_#t~ite40=|v_ULTIMATE.start_main_#t~ite40_65|, ~y$w_buff1~0=v_~y$w_buff1~0_216, ~y$read_delayed_var~0.base=v_~y$read_delayed_var~0.base_6, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_289, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_97, ULTIMATE.start_main_~#t1406~0.offset=|v_ULTIMATE.start_main_~#t1406~0.offset_23|, ULTIMATE.start_main_~#t1407~0.base=|v_ULTIMATE.start_main_~#t1407~0.base_29|, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_147, ~x~0=v_~x~0_45, ~y$read_delayed_var~0.offset=v_~y$read_delayed_var~0.offset_6, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_595, ULTIMATE.start_main_#t~nondet33=|v_ULTIMATE.start_main_#t~nondet33_10|, ULTIMATE.start_main_~#t1407~0.offset=|v_ULTIMATE.start_main_~#t1407~0.offset_22|, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_32, ~y$r_buff1_thd1~0=v_~y$r_buff1_thd1~0_88, ULTIMATE.start_main_~#t1408~0.base=|v_ULTIMATE.start_main_~#t1408~0.base_23|, ~y$w_buff0~0=v_~y$w_buff0~0_304, ~y$r_buff0_thd3~0=v_~y$r_buff0_thd3~0_173, ~y~0=v_~y~0_127, ULTIMATE.start_main_#t~ite36=|v_ULTIMATE.start_main_#t~ite36_29|, ULTIMATE.start_main_#t~ite38=|v_ULTIMATE.start_main_#t~ite38_33|, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_20, #NULL.base=|v_#NULL.base_4|, ~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_268, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_21|, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_94, #valid=|v_#valid_62|, #memory_int=|v_#memory_int_17|, ~z~0=v_~z~0_45, ~weak$$choice2~0=v_~weak$$choice2~0_148, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_392} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t1406~0.base, ULTIMATE.start_main_#t~nondet32, ~y$read_delayed_var~0.offset, ULTIMATE.start_main_#t~nondet34, ~y$w_buff0_used~0, ULTIMATE.start_main_#t~nondet33, #NULL.offset, ULTIMATE.start_main_~#t1407~0.offset, ~main$tmp_guard1~0, ~y$read_delayed~0, ~y$r_buff1_thd1~0, ~y$mem_tmp~0, ~y$r_buff1_thd3~0, ~__unbuffered_p1_EAX~0, ULTIMATE.start_main_~#t1408~0.base, ~y$w_buff0~0, ~y$r_buff0_thd3~0, ~y$r_buff0_thd1~0, ~y$flush_delayed~0, ULTIMATE.start_main_~#t1408~0.offset, #length, ~__unbuffered_p2_EAX~0, ~y~0, ULTIMATE.start_main_#t~ite39, ULTIMATE.start_main_#t~ite35, ULTIMATE.start_main_#t~ite36, ULTIMATE.start_main_#t~ite38, ULTIMATE.start_main_#t~ite37, ~main$tmp_guard0~0, #NULL.base, ~y$r_buff1_thd2~0, ~weak$$choice0~0, ULTIMATE.start_main_#t~ite40, ~y$w_buff1~0, ~y$read_delayed_var~0.base, ULTIMATE.start_main_#res, ~y$r_buff0_thd0~0, ~y$r_buff0_thd2~0, #valid, #memory_int, ~__unbuffered_cnt~0, ~z~0, ULTIMATE.start_main_~#t1406~0.offset, ULTIMATE.start_main_~#t1407~0.base, ~weak$$choice2~0, ~y$r_buff1_thd0~0, ~x~0, ~y$w_buff1_used~0] because there is no mapped edge [2019-11-28 18:19:26,899 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [683] [683] L810-1-->L812: Formula: (and (= |v_#length_13| (store |v_#length_14| |v_ULTIMATE.start_main_~#t1407~0.base_9| 4)) (= |v_#valid_31| (store |v_#valid_32| |v_ULTIMATE.start_main_~#t1407~0.base_9| 1)) (< |v_#StackHeapBarrier_9| |v_ULTIMATE.start_main_~#t1407~0.base_9|) (= 0 (select |v_#valid_32| |v_ULTIMATE.start_main_~#t1407~0.base_9|)) (= 0 |v_ULTIMATE.start_main_~#t1407~0.offset_9|) (not (= 0 |v_ULTIMATE.start_main_~#t1407~0.base_9|)) (= (store |v_#memory_int_10| |v_ULTIMATE.start_main_~#t1407~0.base_9| (store (select |v_#memory_int_10| |v_ULTIMATE.start_main_~#t1407~0.base_9|) |v_ULTIMATE.start_main_~#t1407~0.offset_9| 1)) |v_#memory_int_9|)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_9|, #valid=|v_#valid_32|, #memory_int=|v_#memory_int_10|, #length=|v_#length_14|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_9|, ULTIMATE.start_main_#t~nondet32=|v_ULTIMATE.start_main_#t~nondet32_5|, #valid=|v_#valid_31|, #memory_int=|v_#memory_int_9|, ULTIMATE.start_main_~#t1407~0.offset=|v_ULTIMATE.start_main_~#t1407~0.offset_9|, #length=|v_#length_13|, ULTIMATE.start_main_~#t1407~0.base=|v_ULTIMATE.start_main_~#t1407~0.base_9|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet32, #valid, #memory_int, ULTIMATE.start_main_~#t1407~0.offset, #length, ULTIMATE.start_main_~#t1407~0.base] because there is no mapped edge [2019-11-28 18:19:26,899 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [685] [685] L812-1-->L814: Formula: (and (= |v_#length_15| (store |v_#length_16| |v_ULTIMATE.start_main_~#t1408~0.base_10| 4)) (= |v_#valid_35| (store |v_#valid_36| |v_ULTIMATE.start_main_~#t1408~0.base_10| 1)) (< |v_#StackHeapBarrier_11| |v_ULTIMATE.start_main_~#t1408~0.base_10|) (= (select |v_#valid_36| |v_ULTIMATE.start_main_~#t1408~0.base_10|) 0) (= 0 |v_ULTIMATE.start_main_~#t1408~0.offset_9|) (= (store |v_#memory_int_12| |v_ULTIMATE.start_main_~#t1408~0.base_10| (store (select |v_#memory_int_12| |v_ULTIMATE.start_main_~#t1408~0.base_10|) |v_ULTIMATE.start_main_~#t1408~0.offset_9| 2)) |v_#memory_int_11|) (not (= 0 |v_ULTIMATE.start_main_~#t1408~0.base_10|))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_11|, #valid=|v_#valid_36|, #memory_int=|v_#memory_int_12|, #length=|v_#length_16|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_11|, ULTIMATE.start_main_#t~nondet33=|v_ULTIMATE.start_main_#t~nondet33_5|, ULTIMATE.start_main_~#t1408~0.base=|v_ULTIMATE.start_main_~#t1408~0.base_10|, #valid=|v_#valid_35|, #memory_int=|v_#memory_int_11|, ULTIMATE.start_main_~#t1408~0.offset=|v_ULTIMATE.start_main_~#t1408~0.offset_9|, #length=|v_#length_15|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet33, ULTIMATE.start_main_~#t1408~0.base, #valid, #memory_int, ULTIMATE.start_main_~#t1408~0.offset, #length] because there is no mapped edge [2019-11-28 18:19:26,901 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [610] [610] L4-->L787: Formula: (and (= v_~y$r_buff0_thd2~0_62 v_~y$r_buff1_thd2~0_26) (= v_~__unbuffered_p2_EAX~0_4 v_~z~0_4) (= v_~y$r_buff0_thd3~0_25 1) (not (= 0 v_P2Thread1of1ForFork2___VERIFIER_assert_~expression_18)) (= v_~y$r_buff1_thd1~0_3 v_~y$r_buff0_thd1~0_4) (= v_~y$r_buff0_thd0~0_15 v_~y$r_buff1_thd0~0_10) (= v_~y$r_buff0_thd3~0_26 v_~y$r_buff1_thd3~0_26)) InVars {~y$r_buff0_thd3~0=v_~y$r_buff0_thd3~0_26, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_15, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_62, ~y$r_buff0_thd1~0=v_~y$r_buff0_thd1~0_4, P2Thread1of1ForFork2___VERIFIER_assert_~expression=v_P2Thread1of1ForFork2___VERIFIER_assert_~expression_18, ~z~0=v_~z~0_4} OutVars{~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_26, ~y$r_buff1_thd1~0=v_~y$r_buff1_thd1~0_3, ~y$r_buff1_thd3~0=v_~y$r_buff1_thd3~0_26, ~y$r_buff0_thd3~0=v_~y$r_buff0_thd3~0_25, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_15, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_62, ~y$r_buff0_thd1~0=v_~y$r_buff0_thd1~0_4, P2Thread1of1ForFork2___VERIFIER_assert_~expression=v_P2Thread1of1ForFork2___VERIFIER_assert_~expression_18, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_4, ~z~0=v_~z~0_4, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_10} AuxVars[] AssignedVars[~y$r_buff1_thd2~0, ~y$r_buff1_thd1~0, ~y$r_buff1_thd3~0, ~y$r_buff0_thd3~0, ~__unbuffered_p2_EAX~0, ~y$r_buff1_thd0~0] because there is no mapped edge [2019-11-28 18:19:26,902 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [687] [687] P0ENTRY-->P0EXIT: Formula: (and (= v_P0Thread1of1ForFork0_~arg.base_8 |v_P0Thread1of1ForFork0_#in~arg.base_10|) (= v_~z~0_32 1) (= |v_P0Thread1of1ForFork0_#res.offset_3| 0) (= v_P0Thread1of1ForFork0_~arg.offset_8 |v_P0Thread1of1ForFork0_#in~arg.offset_10|) (= 0 |v_P0Thread1of1ForFork0_#res.base_3|) (= (+ v_~__unbuffered_cnt~0_64 1) v_~__unbuffered_cnt~0_63) (= v_~x~0_16 1)) InVars {P0Thread1of1ForFork0_#in~arg.offset=|v_P0Thread1of1ForFork0_#in~arg.offset_10|, P0Thread1of1ForFork0_#in~arg.base=|v_P0Thread1of1ForFork0_#in~arg.base_10|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_64} OutVars{P0Thread1of1ForFork0_#in~arg.offset=|v_P0Thread1of1ForFork0_#in~arg.offset_10|, P0Thread1of1ForFork0_#res.offset=|v_P0Thread1of1ForFork0_#res.offset_3|, P0Thread1of1ForFork0_#in~arg.base=|v_P0Thread1of1ForFork0_#in~arg.base_10|, P0Thread1of1ForFork0_#res.base=|v_P0Thread1of1ForFork0_#res.base_3|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_63, ~z~0=v_~z~0_32, P0Thread1of1ForFork0_~arg.base=v_P0Thread1of1ForFork0_~arg.base_8, ~x~0=v_~x~0_16, P0Thread1of1ForFork0_~arg.offset=v_P0Thread1of1ForFork0_~arg.offset_8} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#res.offset, P0Thread1of1ForFork0_#res.base, ~__unbuffered_cnt~0, ~z~0, P0Thread1of1ForFork0_~arg.base, ~x~0, P0Thread1of1ForFork0_~arg.offset] because there is no mapped edge [2019-11-28 18:19:26,904 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [703] [703] L752-->L752-8: Formula: (let ((.cse0 (= (mod ~weak$$choice2~0_In-527558954 256) 0))) (or (and (not .cse0) (= |P1Thread1of1ForFork1_#t~ite9_Out-527558954| ~y$w_buff0~0_In-527558954) (= |P1Thread1of1ForFork1_#t~ite8_In-527558954| |P1Thread1of1ForFork1_#t~ite8_Out-527558954|)) (and (= |P1Thread1of1ForFork1_#t~ite9_Out-527558954| |P1Thread1of1ForFork1_#t~ite8_Out-527558954|) (= ~y$w_buff0~0_In-527558954 |P1Thread1of1ForFork1_#t~ite8_Out-527558954|) .cse0 (let ((.cse1 (= 0 (mod ~y$r_buff0_thd2~0_In-527558954 256)))) (or (and (= (mod ~y$w_buff1_used~0_In-527558954 256) 0) .cse1) (= (mod ~y$w_buff0_used~0_In-527558954 256) 0) (and (= 0 (mod ~y$r_buff1_thd2~0_In-527558954 256)) .cse1)))))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-527558954, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-527558954, ~y$w_buff0~0=~y$w_buff0~0_In-527558954, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-527558954, P1Thread1of1ForFork1_#t~ite8=|P1Thread1of1ForFork1_#t~ite8_In-527558954|, ~weak$$choice2~0=~weak$$choice2~0_In-527558954, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-527558954} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-527558954, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-527558954, P1Thread1of1ForFork1_#t~ite9=|P1Thread1of1ForFork1_#t~ite9_Out-527558954|, ~y$w_buff0~0=~y$w_buff0~0_In-527558954, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-527558954, P1Thread1of1ForFork1_#t~ite8=|P1Thread1of1ForFork1_#t~ite8_Out-527558954|, ~weak$$choice2~0=~weak$$choice2~0_In-527558954, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-527558954} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite9, P1Thread1of1ForFork1_#t~ite8] because there is no mapped edge [2019-11-28 18:19:26,905 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [702] [702] L753-->L753-8: Formula: (let ((.cse1 (= (mod ~weak$$choice2~0_In164025500 256) 0))) (or (and (= |P1Thread1of1ForFork1_#t~ite11_Out164025500| ~y$w_buff1~0_In164025500) (let ((.cse0 (= (mod ~y$r_buff0_thd2~0_In164025500 256) 0))) (or (= (mod ~y$w_buff0_used~0_In164025500 256) 0) (and .cse0 (= 0 (mod ~y$r_buff1_thd2~0_In164025500 256))) (and (= 0 (mod ~y$w_buff1_used~0_In164025500 256)) .cse0))) (= |P1Thread1of1ForFork1_#t~ite12_Out164025500| |P1Thread1of1ForFork1_#t~ite11_Out164025500|) .cse1) (and (= |P1Thread1of1ForFork1_#t~ite12_Out164025500| ~y$w_buff1~0_In164025500) (not .cse1) (= |P1Thread1of1ForFork1_#t~ite11_In164025500| |P1Thread1of1ForFork1_#t~ite11_Out164025500|)))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In164025500, ~y$w_buff1~0=~y$w_buff1~0_In164025500, ~y$w_buff0_used~0=~y$w_buff0_used~0_In164025500, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In164025500, P1Thread1of1ForFork1_#t~ite11=|P1Thread1of1ForFork1_#t~ite11_In164025500|, ~weak$$choice2~0=~weak$$choice2~0_In164025500, ~y$w_buff1_used~0=~y$w_buff1_used~0_In164025500} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In164025500, ~y$w_buff1~0=~y$w_buff1~0_In164025500, ~y$w_buff0_used~0=~y$w_buff0_used~0_In164025500, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In164025500, P1Thread1of1ForFork1_#t~ite11=|P1Thread1of1ForFork1_#t~ite11_Out164025500|, P1Thread1of1ForFork1_#t~ite12=|P1Thread1of1ForFork1_#t~ite12_Out164025500|, ~weak$$choice2~0=~weak$$choice2~0_In164025500, ~y$w_buff1_used~0=~y$w_buff1_used~0_In164025500} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite11, P1Thread1of1ForFork1_#t~ite12] because there is no mapped edge [2019-11-28 18:19:26,908 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [653] [653] L756-->L757: Formula: (and (= v_~y$r_buff0_thd2~0_124 v_~y$r_buff0_thd2~0_123) (not (= (mod v_~weak$$choice2~0_36 256) 0))) InVars {~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_124, ~weak$$choice2~0=v_~weak$$choice2~0_36} OutVars{P1Thread1of1ForFork1_#t~ite19=|v_P1Thread1of1ForFork1_#t~ite19_13|, P1Thread1of1ForFork1_#t~ite20=|v_P1Thread1of1ForFork1_#t~ite20_10|, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_123, P1Thread1of1ForFork1_#t~ite21=|v_P1Thread1of1ForFork1_#t~ite21_6|, ~weak$$choice2~0=v_~weak$$choice2~0_36} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite19, P1Thread1of1ForFork1_#t~ite20, ~y$r_buff0_thd2~0, P1Thread1of1ForFork1_#t~ite21] because there is no mapped edge [2019-11-28 18:19:26,909 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [643] [643] L759-->L767: Formula: (and (= v_~__unbuffered_cnt~0_24 (+ v_~__unbuffered_cnt~0_25 1)) (not (= 0 (mod v_~y$flush_delayed~0_12 256))) (= 0 v_~y$flush_delayed~0_11) (= v_~y~0_33 v_~y$mem_tmp~0_5)) InVars {~y$mem_tmp~0=v_~y$mem_tmp~0_5, ~y$flush_delayed~0=v_~y$flush_delayed~0_12, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_25} OutVars{~y$mem_tmp~0=v_~y$mem_tmp~0_5, ~y$flush_delayed~0=v_~y$flush_delayed~0_11, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_24, ~y~0=v_~y~0_33, P1Thread1of1ForFork1_#t~ite25=|v_P1Thread1of1ForFork1_#t~ite25_13|} AuxVars[] AssignedVars[~y$flush_delayed~0, ~__unbuffered_cnt~0, ~y~0, P1Thread1of1ForFork1_#t~ite25] because there is no mapped edge [2019-11-28 18:19:26,910 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [667] [667] L788-->L788-2: Formula: (let ((.cse0 (= 0 (mod ~y$w_buff0_used~0_In39746591 256))) (.cse1 (= 0 (mod ~y$r_buff0_thd3~0_In39746591 256)))) (or (and (not .cse0) (= |P2Thread1of1ForFork2_#t~ite28_Out39746591| 0) (not .cse1)) (and (or .cse0 .cse1) (= ~y$w_buff0_used~0_In39746591 |P2Thread1of1ForFork2_#t~ite28_Out39746591|)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In39746591, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In39746591} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In39746591, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In39746591, P2Thread1of1ForFork2_#t~ite28=|P2Thread1of1ForFork2_#t~ite28_Out39746591|} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite28] because there is no mapped edge [2019-11-28 18:19:26,911 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [669] [669] L789-->L789-2: Formula: (let ((.cse1 (= 0 (mod ~y$w_buff0_used~0_In1531213498 256))) (.cse0 (= 0 (mod ~y$r_buff0_thd3~0_In1531213498 256))) (.cse3 (= (mod ~y$r_buff1_thd3~0_In1531213498 256) 0)) (.cse2 (= (mod ~y$w_buff1_used~0_In1531213498 256) 0))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= 0 |P2Thread1of1ForFork2_#t~ite29_Out1531213498|)) (and (or .cse1 .cse0) (or .cse3 .cse2) (= |P2Thread1of1ForFork2_#t~ite29_Out1531213498| ~y$w_buff1_used~0_In1531213498)))) InVars {~y$r_buff1_thd3~0=~y$r_buff1_thd3~0_In1531213498, ~y$w_buff0_used~0=~y$w_buff0_used~0_In1531213498, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In1531213498, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1531213498} OutVars{~y$r_buff1_thd3~0=~y$r_buff1_thd3~0_In1531213498, ~y$w_buff0_used~0=~y$w_buff0_used~0_In1531213498, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In1531213498, P2Thread1of1ForFork2_#t~ite29=|P2Thread1of1ForFork2_#t~ite29_Out1531213498|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1531213498} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite29] because there is no mapped edge [2019-11-28 18:19:26,911 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [654] [654] L790-->L791: Formula: (let ((.cse1 (= 0 (mod ~y$w_buff0_used~0_In-104376830 256))) (.cse0 (= 0 (mod ~y$r_buff0_thd3~0_In-104376830 256))) (.cse2 (= ~y$r_buff0_thd3~0_In-104376830 ~y$r_buff0_thd3~0_Out-104376830))) (or (and (not .cse0) (not .cse1) (= 0 ~y$r_buff0_thd3~0_Out-104376830)) (and .cse1 .cse2) (and .cse0 .cse2))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-104376830, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In-104376830} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-104376830, P2Thread1of1ForFork2_#t~ite30=|P2Thread1of1ForFork2_#t~ite30_Out-104376830|, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_Out-104376830} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite30, ~y$r_buff0_thd3~0] because there is no mapped edge [2019-11-28 18:19:26,912 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [660] [660] L791-->L791-2: Formula: (let ((.cse3 (= (mod ~y$r_buff1_thd3~0_In-465800156 256) 0)) (.cse2 (= (mod ~y$w_buff1_used~0_In-465800156 256) 0)) (.cse1 (= 0 (mod ~y$r_buff0_thd3~0_In-465800156 256))) (.cse0 (= 0 (mod ~y$w_buff0_used~0_In-465800156 256)))) (or (and (= |P2Thread1of1ForFork2_#t~ite31_Out-465800156| ~y$r_buff1_thd3~0_In-465800156) (or .cse0 .cse1) (or .cse2 .cse3)) (and (or (and (not .cse3) (not .cse2)) (and (not .cse1) (not .cse0))) (= |P2Thread1of1ForFork2_#t~ite31_Out-465800156| 0)))) InVars {~y$r_buff1_thd3~0=~y$r_buff1_thd3~0_In-465800156, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-465800156, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In-465800156, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-465800156} OutVars{~y$r_buff1_thd3~0=~y$r_buff1_thd3~0_In-465800156, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-465800156, P2Thread1of1ForFork2_#t~ite31=|P2Thread1of1ForFork2_#t~ite31_Out-465800156|, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In-465800156, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-465800156} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite31] because there is no mapped edge [2019-11-28 18:19:26,912 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [674] [674] L791-2-->P2EXIT: Formula: (and (= 0 |v_P2Thread1of1ForFork2_#res.base_3|) (= |v_P2Thread1of1ForFork2_#res.offset_3| 0) (= |v_P2Thread1of1ForFork2_#t~ite31_26| v_~y$r_buff1_thd3~0_57) (= (+ v_~__unbuffered_cnt~0_45 1) v_~__unbuffered_cnt~0_44)) InVars {P2Thread1of1ForFork2_#t~ite31=|v_P2Thread1of1ForFork2_#t~ite31_26|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_45} OutVars{~y$r_buff1_thd3~0=v_~y$r_buff1_thd3~0_57, P2Thread1of1ForFork2_#t~ite31=|v_P2Thread1of1ForFork2_#t~ite31_25|, P2Thread1of1ForFork2_#res.base=|v_P2Thread1of1ForFork2_#res.base_3|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_44, P2Thread1of1ForFork2_#res.offset=|v_P2Thread1of1ForFork2_#res.offset_3|} AuxVars[] AssignedVars[~y$r_buff1_thd3~0, P2Thread1of1ForFork2_#t~ite31, P2Thread1of1ForFork2_#res.base, ~__unbuffered_cnt~0, P2Thread1of1ForFork2_#res.offset] because there is no mapped edge [2019-11-28 18:19:26,912 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [618] [618] L814-1-->L820: Formula: (and (not (= (mod v_~main$tmp_guard0~0_8 256) 0)) (= v_~main$tmp_guard0~0_8 (ite (= (ite (= 3 v_~__unbuffered_cnt~0_23) 1 0) 0) 0 1))) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_23} OutVars{ULTIMATE.start_main_#t~nondet34=|v_ULTIMATE.start_main_#t~nondet34_8|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_23, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_8} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet34, ~main$tmp_guard0~0] because there is no mapped edge [2019-11-28 18:19:26,913 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [668] [668] L820-2-->L820-4: Formula: (let ((.cse0 (= (mod ~y$r_buff1_thd0~0_In1161940770 256) 0)) (.cse1 (= 0 (mod ~y$w_buff1_used~0_In1161940770 256)))) (or (and (not .cse0) (= |ULTIMATE.start_main_#t~ite35_Out1161940770| ~y$w_buff1~0_In1161940770) (not .cse1)) (and (or .cse0 .cse1) (= |ULTIMATE.start_main_#t~ite35_Out1161940770| ~y~0_In1161940770)))) InVars {~y$w_buff1~0=~y$w_buff1~0_In1161940770, ~y~0=~y~0_In1161940770, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In1161940770, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1161940770} OutVars{~y$w_buff1~0=~y$w_buff1~0_In1161940770, ULTIMATE.start_main_#t~ite35=|ULTIMATE.start_main_#t~ite35_Out1161940770|, ~y~0=~y~0_In1161940770, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In1161940770, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1161940770} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite35] because there is no mapped edge [2019-11-28 18:19:26,913 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [629] [629] L820-4-->L821: Formula: (= v_~y~0_26 |v_ULTIMATE.start_main_#t~ite35_14|) InVars {ULTIMATE.start_main_#t~ite35=|v_ULTIMATE.start_main_#t~ite35_14|} OutVars{ULTIMATE.start_main_#t~ite35=|v_ULTIMATE.start_main_#t~ite35_13|, ULTIMATE.start_main_#t~ite36=|v_ULTIMATE.start_main_#t~ite36_13|, ~y~0=v_~y~0_26} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite35, ULTIMATE.start_main_#t~ite36, ~y~0] because there is no mapped edge [2019-11-28 18:19:26,913 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [663] [663] L821-->L821-2: Formula: (let ((.cse1 (= (mod ~y$w_buff0_used~0_In2040403554 256) 0)) (.cse0 (= 0 (mod ~y$r_buff0_thd0~0_In2040403554 256)))) (or (and (not .cse0) (not .cse1) (= |ULTIMATE.start_main_#t~ite37_Out2040403554| 0)) (and (or .cse1 .cse0) (= ~y$w_buff0_used~0_In2040403554 |ULTIMATE.start_main_#t~ite37_Out2040403554|)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In2040403554, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In2040403554} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In2040403554, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In2040403554, ULTIMATE.start_main_#t~ite37=|ULTIMATE.start_main_#t~ite37_Out2040403554|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite37] because there is no mapped edge [2019-11-28 18:19:26,914 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [670] [670] L822-->L822-2: Formula: (let ((.cse2 (= (mod ~y$w_buff1_used~0_In423785213 256) 0)) (.cse3 (= 0 (mod ~y$r_buff1_thd0~0_In423785213 256))) (.cse0 (= 0 (mod ~y$w_buff0_used~0_In423785213 256))) (.cse1 (= (mod ~y$r_buff0_thd0~0_In423785213 256) 0))) (or (and (or .cse0 .cse1) (= |ULTIMATE.start_main_#t~ite38_Out423785213| ~y$w_buff1_used~0_In423785213) (or .cse2 .cse3)) (and (= |ULTIMATE.start_main_#t~ite38_Out423785213| 0) (or (and (not .cse2) (not .cse3)) (and (not .cse0) (not .cse1)))))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In423785213, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In423785213, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In423785213, ~y$w_buff1_used~0=~y$w_buff1_used~0_In423785213} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In423785213, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In423785213, ULTIMATE.start_main_#t~ite38=|ULTIMATE.start_main_#t~ite38_Out423785213|, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In423785213, ~y$w_buff1_used~0=~y$w_buff1_used~0_In423785213} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite38] because there is no mapped edge [2019-11-28 18:19:26,915 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [662] [662] L823-->L823-2: Formula: (let ((.cse0 (= 0 (mod ~y$w_buff0_used~0_In-27908725 256))) (.cse1 (= 0 (mod ~y$r_buff0_thd0~0_In-27908725 256)))) (or (and (or .cse0 .cse1) (= ~y$r_buff0_thd0~0_In-27908725 |ULTIMATE.start_main_#t~ite39_Out-27908725|)) (and (= 0 |ULTIMATE.start_main_#t~ite39_Out-27908725|) (not .cse0) (not .cse1)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-27908725, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-27908725} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-27908725, ULTIMATE.start_main_#t~ite39=|ULTIMATE.start_main_#t~ite39_Out-27908725|, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-27908725} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite39] because there is no mapped edge [2019-11-28 18:19:26,915 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [659] [659] L824-->L824-2: Formula: (let ((.cse2 (= (mod ~y$r_buff0_thd0~0_In2139367558 256) 0)) (.cse3 (= (mod ~y$w_buff0_used~0_In2139367558 256) 0)) (.cse1 (= 0 (mod ~y$w_buff1_used~0_In2139367558 256))) (.cse0 (= 0 (mod ~y$r_buff1_thd0~0_In2139367558 256)))) (or (and (= 0 |ULTIMATE.start_main_#t~ite40_Out2139367558|) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (= |ULTIMATE.start_main_#t~ite40_Out2139367558| ~y$r_buff1_thd0~0_In2139367558) (or .cse2 .cse3) (or .cse1 .cse0)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In2139367558, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In2139367558, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In2139367558, ~y$w_buff1_used~0=~y$w_buff1_used~0_In2139367558} OutVars{ULTIMATE.start_main_#t~ite40=|ULTIMATE.start_main_#t~ite40_Out2139367558|, ~y$w_buff0_used~0=~y$w_buff0_used~0_In2139367558, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In2139367558, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In2139367558, ~y$w_buff1_used~0=~y$w_buff1_used~0_In2139367558} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite40] because there is no mapped edge [2019-11-28 18:19:26,916 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [715] [715] L824-2-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= v_ULTIMATE.start___VERIFIER_assert_~expression_17 |v_ULTIMATE.start___VERIFIER_assert_#in~expression_13|) (= v_~y$r_buff1_thd0~0_136 |v_ULTIMATE.start_main_#t~ite40_46|) (= (ite (= (ite (not (and (= 0 v_~__unbuffered_p1_EAX~0_43) (= v_~x~0_34 2) (= 0 v_~__unbuffered_p2_EAX~0_98))) 1 0) 0) 0 1) v_~main$tmp_guard1~0_21) (= v_ULTIMATE.start___VERIFIER_assert_~expression_17 0) (= |v_ULTIMATE.start___VERIFIER_assert_#in~expression_13| (mod v_~main$tmp_guard1~0_21 256))) InVars {ULTIMATE.start_main_#t~ite40=|v_ULTIMATE.start_main_#t~ite40_46|, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_43, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_98, ~x~0=v_~x~0_34} OutVars{ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_17, ULTIMATE.start_main_#t~ite40=|v_ULTIMATE.start_main_#t~ite40_45|, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_43, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_21, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_98, ~x~0=v_~x~0_34, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_136, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_13|} AuxVars[] AssignedVars[ULTIMATE.start___VERIFIER_assert_~expression, ULTIMATE.start_main_#t~ite40, ~main$tmp_guard1~0, ~y$r_buff1_thd0~0, ULTIMATE.start___VERIFIER_assert_#in~expression] because there is no mapped edge [2019-11-28 18:19:27,028 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 28.11 06:19:27 BasicIcfg [2019-11-28 18:19:27,028 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-11-28 18:19:27,029 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-11-28 18:19:27,029 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-11-28 18:19:27,029 INFO L275 PluginConnector]: Witness Printer initialized [2019-11-28 18:19:27,029 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 06:19:06" (3/4) ... [2019-11-28 18:19:27,032 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2019-11-28 18:19:27,032 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [723] [723] ULTIMATE.startENTRY-->L810: Formula: (let ((.cse0 (store |v_#valid_64| 0 0))) (and (= 0 v_~y$read_delayed_var~0.base_6) (= v_~y$w_buff1_used~0_392 0) (= v_~x~0_45 0) (= 0 |v_ULTIMATE.start_main_~#t1406~0.offset_23|) (= v_~y$mem_tmp~0_16 0) (= |v_#length_21| (store |v_#length_22| |v_ULTIMATE.start_main_~#t1406~0.base_31| 4)) (= 0 v_~y$r_buff1_thd1~0_88) (= v_~weak$$choice2~0_148 0) (= v_~y$r_buff0_thd1~0_34 0) (= 0 (select .cse0 |v_ULTIMATE.start_main_~#t1406~0.base_31|)) (= v_~y$w_buff0_used~0_595 0) (= v_~y$r_buff1_thd0~0_147 0) (= 0 v_~y$flush_delayed~0_39) (< 0 |v_#StackHeapBarrier_16|) (= (store |v_#memory_int_18| |v_ULTIMATE.start_main_~#t1406~0.base_31| (store (select |v_#memory_int_18| |v_ULTIMATE.start_main_~#t1406~0.base_31|) |v_ULTIMATE.start_main_~#t1406~0.offset_23| 0)) |v_#memory_int_17|) (= 0 v_~y$r_buff0_thd3~0_173) (= v_~y$r_buff0_thd0~0_94 0) (= 0 v_~__unbuffered_p2_EAX~0_109) (= 0 v_~y$r_buff0_thd2~0_289) (= v_~y$w_buff1~0_216 0) (= v_~z~0_45 0) (= 0 v_~y$w_buff0~0_304) (= 0 |v_#NULL.base_4|) (= 0 v_~__unbuffered_p1_EAX~0_57) (= v_~y~0_127 0) (= v_~main$tmp_guard0~0_20 0) (= v_~y$read_delayed~0_5 0) (= v_~main$tmp_guard1~0_32 0) (= |v_#NULL.offset_4| 0) (= (store .cse0 |v_ULTIMATE.start_main_~#t1406~0.base_31| 1) |v_#valid_62|) (< |v_#StackHeapBarrier_16| |v_ULTIMATE.start_main_~#t1406~0.base_31|) (= 0 v_~y$r_buff1_thd2~0_268) (= 0 v_~y$read_delayed_var~0.offset_6) (= 0 v_~y$r_buff1_thd3~0_150) (= 0 v_~__unbuffered_cnt~0_97) (= 0 v_~weak$$choice0~0_12))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_16|, #valid=|v_#valid_64|, #memory_int=|v_#memory_int_18|, #length=|v_#length_22|} OutVars{ULTIMATE.start_main_~#t1406~0.base=|v_ULTIMATE.start_main_~#t1406~0.base_31|, ULTIMATE.start_main_#t~nondet32=|v_ULTIMATE.start_main_#t~nondet32_10|, ULTIMATE.start_main_#t~nondet34=|v_ULTIMATE.start_main_#t~nondet34_19|, #NULL.offset=|v_#NULL.offset_4|, ~y$read_delayed~0=v_~y$read_delayed~0_5, ~y$mem_tmp~0=v_~y$mem_tmp~0_16, ~y$r_buff1_thd3~0=v_~y$r_buff1_thd3~0_150, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_57, ~y$r_buff0_thd1~0=v_~y$r_buff0_thd1~0_34, ~y$flush_delayed~0=v_~y$flush_delayed~0_39, ULTIMATE.start_main_~#t1408~0.offset=|v_ULTIMATE.start_main_~#t1408~0.offset_15|, #length=|v_#length_21|, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_109, ULTIMATE.start_main_#t~ite39=|v_ULTIMATE.start_main_#t~ite39_31|, ULTIMATE.start_main_#t~ite35=|v_ULTIMATE.start_main_#t~ite35_35|, ULTIMATE.start_main_#t~ite37=|v_ULTIMATE.start_main_#t~ite37_33|, ~weak$$choice0~0=v_~weak$$choice0~0_12, #StackHeapBarrier=|v_#StackHeapBarrier_16|, ULTIMATE.start_main_#t~ite40=|v_ULTIMATE.start_main_#t~ite40_65|, ~y$w_buff1~0=v_~y$w_buff1~0_216, ~y$read_delayed_var~0.base=v_~y$read_delayed_var~0.base_6, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_289, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_97, ULTIMATE.start_main_~#t1406~0.offset=|v_ULTIMATE.start_main_~#t1406~0.offset_23|, ULTIMATE.start_main_~#t1407~0.base=|v_ULTIMATE.start_main_~#t1407~0.base_29|, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_147, ~x~0=v_~x~0_45, ~y$read_delayed_var~0.offset=v_~y$read_delayed_var~0.offset_6, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_595, ULTIMATE.start_main_#t~nondet33=|v_ULTIMATE.start_main_#t~nondet33_10|, ULTIMATE.start_main_~#t1407~0.offset=|v_ULTIMATE.start_main_~#t1407~0.offset_22|, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_32, ~y$r_buff1_thd1~0=v_~y$r_buff1_thd1~0_88, ULTIMATE.start_main_~#t1408~0.base=|v_ULTIMATE.start_main_~#t1408~0.base_23|, ~y$w_buff0~0=v_~y$w_buff0~0_304, ~y$r_buff0_thd3~0=v_~y$r_buff0_thd3~0_173, ~y~0=v_~y~0_127, ULTIMATE.start_main_#t~ite36=|v_ULTIMATE.start_main_#t~ite36_29|, ULTIMATE.start_main_#t~ite38=|v_ULTIMATE.start_main_#t~ite38_33|, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_20, #NULL.base=|v_#NULL.base_4|, ~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_268, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_21|, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_94, #valid=|v_#valid_62|, #memory_int=|v_#memory_int_17|, ~z~0=v_~z~0_45, ~weak$$choice2~0=v_~weak$$choice2~0_148, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_392} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t1406~0.base, ULTIMATE.start_main_#t~nondet32, ~y$read_delayed_var~0.offset, ULTIMATE.start_main_#t~nondet34, ~y$w_buff0_used~0, ULTIMATE.start_main_#t~nondet33, #NULL.offset, ULTIMATE.start_main_~#t1407~0.offset, ~main$tmp_guard1~0, ~y$read_delayed~0, ~y$r_buff1_thd1~0, ~y$mem_tmp~0, ~y$r_buff1_thd3~0, ~__unbuffered_p1_EAX~0, ULTIMATE.start_main_~#t1408~0.base, ~y$w_buff0~0, ~y$r_buff0_thd3~0, ~y$r_buff0_thd1~0, ~y$flush_delayed~0, ULTIMATE.start_main_~#t1408~0.offset, #length, ~__unbuffered_p2_EAX~0, ~y~0, ULTIMATE.start_main_#t~ite39, ULTIMATE.start_main_#t~ite35, ULTIMATE.start_main_#t~ite36, ULTIMATE.start_main_#t~ite38, ULTIMATE.start_main_#t~ite37, ~main$tmp_guard0~0, #NULL.base, ~y$r_buff1_thd2~0, ~weak$$choice0~0, ULTIMATE.start_main_#t~ite40, ~y$w_buff1~0, ~y$read_delayed_var~0.base, ULTIMATE.start_main_#res, ~y$r_buff0_thd0~0, ~y$r_buff0_thd2~0, #valid, #memory_int, ~__unbuffered_cnt~0, ~z~0, ULTIMATE.start_main_~#t1406~0.offset, ULTIMATE.start_main_~#t1407~0.base, ~weak$$choice2~0, ~y$r_buff1_thd0~0, ~x~0, ~y$w_buff1_used~0] because there is no mapped edge [2019-11-28 18:19:27,033 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [683] [683] L810-1-->L812: Formula: (and (= |v_#length_13| (store |v_#length_14| |v_ULTIMATE.start_main_~#t1407~0.base_9| 4)) (= |v_#valid_31| (store |v_#valid_32| |v_ULTIMATE.start_main_~#t1407~0.base_9| 1)) (< |v_#StackHeapBarrier_9| |v_ULTIMATE.start_main_~#t1407~0.base_9|) (= 0 (select |v_#valid_32| |v_ULTIMATE.start_main_~#t1407~0.base_9|)) (= 0 |v_ULTIMATE.start_main_~#t1407~0.offset_9|) (not (= 0 |v_ULTIMATE.start_main_~#t1407~0.base_9|)) (= (store |v_#memory_int_10| |v_ULTIMATE.start_main_~#t1407~0.base_9| (store (select |v_#memory_int_10| |v_ULTIMATE.start_main_~#t1407~0.base_9|) |v_ULTIMATE.start_main_~#t1407~0.offset_9| 1)) |v_#memory_int_9|)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_9|, #valid=|v_#valid_32|, #memory_int=|v_#memory_int_10|, #length=|v_#length_14|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_9|, ULTIMATE.start_main_#t~nondet32=|v_ULTIMATE.start_main_#t~nondet32_5|, #valid=|v_#valid_31|, #memory_int=|v_#memory_int_9|, ULTIMATE.start_main_~#t1407~0.offset=|v_ULTIMATE.start_main_~#t1407~0.offset_9|, #length=|v_#length_13|, ULTIMATE.start_main_~#t1407~0.base=|v_ULTIMATE.start_main_~#t1407~0.base_9|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet32, #valid, #memory_int, ULTIMATE.start_main_~#t1407~0.offset, #length, ULTIMATE.start_main_~#t1407~0.base] because there is no mapped edge [2019-11-28 18:19:27,033 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [685] [685] L812-1-->L814: Formula: (and (= |v_#length_15| (store |v_#length_16| |v_ULTIMATE.start_main_~#t1408~0.base_10| 4)) (= |v_#valid_35| (store |v_#valid_36| |v_ULTIMATE.start_main_~#t1408~0.base_10| 1)) (< |v_#StackHeapBarrier_11| |v_ULTIMATE.start_main_~#t1408~0.base_10|) (= (select |v_#valid_36| |v_ULTIMATE.start_main_~#t1408~0.base_10|) 0) (= 0 |v_ULTIMATE.start_main_~#t1408~0.offset_9|) (= (store |v_#memory_int_12| |v_ULTIMATE.start_main_~#t1408~0.base_10| (store (select |v_#memory_int_12| |v_ULTIMATE.start_main_~#t1408~0.base_10|) |v_ULTIMATE.start_main_~#t1408~0.offset_9| 2)) |v_#memory_int_11|) (not (= 0 |v_ULTIMATE.start_main_~#t1408~0.base_10|))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_11|, #valid=|v_#valid_36|, #memory_int=|v_#memory_int_12|, #length=|v_#length_16|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_11|, ULTIMATE.start_main_#t~nondet33=|v_ULTIMATE.start_main_#t~nondet33_5|, ULTIMATE.start_main_~#t1408~0.base=|v_ULTIMATE.start_main_~#t1408~0.base_10|, #valid=|v_#valid_35|, #memory_int=|v_#memory_int_11|, ULTIMATE.start_main_~#t1408~0.offset=|v_ULTIMATE.start_main_~#t1408~0.offset_9|, #length=|v_#length_15|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet33, ULTIMATE.start_main_~#t1408~0.base, #valid, #memory_int, ULTIMATE.start_main_~#t1408~0.offset, #length] because there is no mapped edge [2019-11-28 18:19:27,034 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [610] [610] L4-->L787: Formula: (and (= v_~y$r_buff0_thd2~0_62 v_~y$r_buff1_thd2~0_26) (= v_~__unbuffered_p2_EAX~0_4 v_~z~0_4) (= v_~y$r_buff0_thd3~0_25 1) (not (= 0 v_P2Thread1of1ForFork2___VERIFIER_assert_~expression_18)) (= v_~y$r_buff1_thd1~0_3 v_~y$r_buff0_thd1~0_4) (= v_~y$r_buff0_thd0~0_15 v_~y$r_buff1_thd0~0_10) (= v_~y$r_buff0_thd3~0_26 v_~y$r_buff1_thd3~0_26)) InVars {~y$r_buff0_thd3~0=v_~y$r_buff0_thd3~0_26, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_15, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_62, ~y$r_buff0_thd1~0=v_~y$r_buff0_thd1~0_4, P2Thread1of1ForFork2___VERIFIER_assert_~expression=v_P2Thread1of1ForFork2___VERIFIER_assert_~expression_18, ~z~0=v_~z~0_4} OutVars{~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_26, ~y$r_buff1_thd1~0=v_~y$r_buff1_thd1~0_3, ~y$r_buff1_thd3~0=v_~y$r_buff1_thd3~0_26, ~y$r_buff0_thd3~0=v_~y$r_buff0_thd3~0_25, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_15, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_62, ~y$r_buff0_thd1~0=v_~y$r_buff0_thd1~0_4, P2Thread1of1ForFork2___VERIFIER_assert_~expression=v_P2Thread1of1ForFork2___VERIFIER_assert_~expression_18, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_4, ~z~0=v_~z~0_4, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_10} AuxVars[] AssignedVars[~y$r_buff1_thd2~0, ~y$r_buff1_thd1~0, ~y$r_buff1_thd3~0, ~y$r_buff0_thd3~0, ~__unbuffered_p2_EAX~0, ~y$r_buff1_thd0~0] because there is no mapped edge [2019-11-28 18:19:27,035 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [687] [687] P0ENTRY-->P0EXIT: Formula: (and (= v_P0Thread1of1ForFork0_~arg.base_8 |v_P0Thread1of1ForFork0_#in~arg.base_10|) (= v_~z~0_32 1) (= |v_P0Thread1of1ForFork0_#res.offset_3| 0) (= v_P0Thread1of1ForFork0_~arg.offset_8 |v_P0Thread1of1ForFork0_#in~arg.offset_10|) (= 0 |v_P0Thread1of1ForFork0_#res.base_3|) (= (+ v_~__unbuffered_cnt~0_64 1) v_~__unbuffered_cnt~0_63) (= v_~x~0_16 1)) InVars {P0Thread1of1ForFork0_#in~arg.offset=|v_P0Thread1of1ForFork0_#in~arg.offset_10|, P0Thread1of1ForFork0_#in~arg.base=|v_P0Thread1of1ForFork0_#in~arg.base_10|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_64} OutVars{P0Thread1of1ForFork0_#in~arg.offset=|v_P0Thread1of1ForFork0_#in~arg.offset_10|, P0Thread1of1ForFork0_#res.offset=|v_P0Thread1of1ForFork0_#res.offset_3|, P0Thread1of1ForFork0_#in~arg.base=|v_P0Thread1of1ForFork0_#in~arg.base_10|, P0Thread1of1ForFork0_#res.base=|v_P0Thread1of1ForFork0_#res.base_3|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_63, ~z~0=v_~z~0_32, P0Thread1of1ForFork0_~arg.base=v_P0Thread1of1ForFork0_~arg.base_8, ~x~0=v_~x~0_16, P0Thread1of1ForFork0_~arg.offset=v_P0Thread1of1ForFork0_~arg.offset_8} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#res.offset, P0Thread1of1ForFork0_#res.base, ~__unbuffered_cnt~0, ~z~0, P0Thread1of1ForFork0_~arg.base, ~x~0, P0Thread1of1ForFork0_~arg.offset] because there is no mapped edge [2019-11-28 18:19:27,036 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [703] [703] L752-->L752-8: Formula: (let ((.cse0 (= (mod ~weak$$choice2~0_In-527558954 256) 0))) (or (and (not .cse0) (= |P1Thread1of1ForFork1_#t~ite9_Out-527558954| ~y$w_buff0~0_In-527558954) (= |P1Thread1of1ForFork1_#t~ite8_In-527558954| |P1Thread1of1ForFork1_#t~ite8_Out-527558954|)) (and (= |P1Thread1of1ForFork1_#t~ite9_Out-527558954| |P1Thread1of1ForFork1_#t~ite8_Out-527558954|) (= ~y$w_buff0~0_In-527558954 |P1Thread1of1ForFork1_#t~ite8_Out-527558954|) .cse0 (let ((.cse1 (= 0 (mod ~y$r_buff0_thd2~0_In-527558954 256)))) (or (and (= (mod ~y$w_buff1_used~0_In-527558954 256) 0) .cse1) (= (mod ~y$w_buff0_used~0_In-527558954 256) 0) (and (= 0 (mod ~y$r_buff1_thd2~0_In-527558954 256)) .cse1)))))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-527558954, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-527558954, ~y$w_buff0~0=~y$w_buff0~0_In-527558954, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-527558954, P1Thread1of1ForFork1_#t~ite8=|P1Thread1of1ForFork1_#t~ite8_In-527558954|, ~weak$$choice2~0=~weak$$choice2~0_In-527558954, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-527558954} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-527558954, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-527558954, P1Thread1of1ForFork1_#t~ite9=|P1Thread1of1ForFork1_#t~ite9_Out-527558954|, ~y$w_buff0~0=~y$w_buff0~0_In-527558954, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-527558954, P1Thread1of1ForFork1_#t~ite8=|P1Thread1of1ForFork1_#t~ite8_Out-527558954|, ~weak$$choice2~0=~weak$$choice2~0_In-527558954, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-527558954} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite9, P1Thread1of1ForFork1_#t~ite8] because there is no mapped edge [2019-11-28 18:19:27,037 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [702] [702] L753-->L753-8: Formula: (let ((.cse1 (= (mod ~weak$$choice2~0_In164025500 256) 0))) (or (and (= |P1Thread1of1ForFork1_#t~ite11_Out164025500| ~y$w_buff1~0_In164025500) (let ((.cse0 (= (mod ~y$r_buff0_thd2~0_In164025500 256) 0))) (or (= (mod ~y$w_buff0_used~0_In164025500 256) 0) (and .cse0 (= 0 (mod ~y$r_buff1_thd2~0_In164025500 256))) (and (= 0 (mod ~y$w_buff1_used~0_In164025500 256)) .cse0))) (= |P1Thread1of1ForFork1_#t~ite12_Out164025500| |P1Thread1of1ForFork1_#t~ite11_Out164025500|) .cse1) (and (= |P1Thread1of1ForFork1_#t~ite12_Out164025500| ~y$w_buff1~0_In164025500) (not .cse1) (= |P1Thread1of1ForFork1_#t~ite11_In164025500| |P1Thread1of1ForFork1_#t~ite11_Out164025500|)))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In164025500, ~y$w_buff1~0=~y$w_buff1~0_In164025500, ~y$w_buff0_used~0=~y$w_buff0_used~0_In164025500, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In164025500, P1Thread1of1ForFork1_#t~ite11=|P1Thread1of1ForFork1_#t~ite11_In164025500|, ~weak$$choice2~0=~weak$$choice2~0_In164025500, ~y$w_buff1_used~0=~y$w_buff1_used~0_In164025500} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In164025500, ~y$w_buff1~0=~y$w_buff1~0_In164025500, ~y$w_buff0_used~0=~y$w_buff0_used~0_In164025500, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In164025500, P1Thread1of1ForFork1_#t~ite11=|P1Thread1of1ForFork1_#t~ite11_Out164025500|, P1Thread1of1ForFork1_#t~ite12=|P1Thread1of1ForFork1_#t~ite12_Out164025500|, ~weak$$choice2~0=~weak$$choice2~0_In164025500, ~y$w_buff1_used~0=~y$w_buff1_used~0_In164025500} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite11, P1Thread1of1ForFork1_#t~ite12] because there is no mapped edge [2019-11-28 18:19:27,039 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [653] [653] L756-->L757: Formula: (and (= v_~y$r_buff0_thd2~0_124 v_~y$r_buff0_thd2~0_123) (not (= (mod v_~weak$$choice2~0_36 256) 0))) InVars {~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_124, ~weak$$choice2~0=v_~weak$$choice2~0_36} OutVars{P1Thread1of1ForFork1_#t~ite19=|v_P1Thread1of1ForFork1_#t~ite19_13|, P1Thread1of1ForFork1_#t~ite20=|v_P1Thread1of1ForFork1_#t~ite20_10|, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_123, P1Thread1of1ForFork1_#t~ite21=|v_P1Thread1of1ForFork1_#t~ite21_6|, ~weak$$choice2~0=v_~weak$$choice2~0_36} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite19, P1Thread1of1ForFork1_#t~ite20, ~y$r_buff0_thd2~0, P1Thread1of1ForFork1_#t~ite21] because there is no mapped edge [2019-11-28 18:19:27,041 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [643] [643] L759-->L767: Formula: (and (= v_~__unbuffered_cnt~0_24 (+ v_~__unbuffered_cnt~0_25 1)) (not (= 0 (mod v_~y$flush_delayed~0_12 256))) (= 0 v_~y$flush_delayed~0_11) (= v_~y~0_33 v_~y$mem_tmp~0_5)) InVars {~y$mem_tmp~0=v_~y$mem_tmp~0_5, ~y$flush_delayed~0=v_~y$flush_delayed~0_12, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_25} OutVars{~y$mem_tmp~0=v_~y$mem_tmp~0_5, ~y$flush_delayed~0=v_~y$flush_delayed~0_11, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_24, ~y~0=v_~y~0_33, P1Thread1of1ForFork1_#t~ite25=|v_P1Thread1of1ForFork1_#t~ite25_13|} AuxVars[] AssignedVars[~y$flush_delayed~0, ~__unbuffered_cnt~0, ~y~0, P1Thread1of1ForFork1_#t~ite25] because there is no mapped edge [2019-11-28 18:19:27,041 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [667] [667] L788-->L788-2: Formula: (let ((.cse0 (= 0 (mod ~y$w_buff0_used~0_In39746591 256))) (.cse1 (= 0 (mod ~y$r_buff0_thd3~0_In39746591 256)))) (or (and (not .cse0) (= |P2Thread1of1ForFork2_#t~ite28_Out39746591| 0) (not .cse1)) (and (or .cse0 .cse1) (= ~y$w_buff0_used~0_In39746591 |P2Thread1of1ForFork2_#t~ite28_Out39746591|)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In39746591, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In39746591} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In39746591, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In39746591, P2Thread1of1ForFork2_#t~ite28=|P2Thread1of1ForFork2_#t~ite28_Out39746591|} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite28] because there is no mapped edge [2019-11-28 18:19:27,042 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [669] [669] L789-->L789-2: Formula: (let ((.cse1 (= 0 (mod ~y$w_buff0_used~0_In1531213498 256))) (.cse0 (= 0 (mod ~y$r_buff0_thd3~0_In1531213498 256))) (.cse3 (= (mod ~y$r_buff1_thd3~0_In1531213498 256) 0)) (.cse2 (= (mod ~y$w_buff1_used~0_In1531213498 256) 0))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= 0 |P2Thread1of1ForFork2_#t~ite29_Out1531213498|)) (and (or .cse1 .cse0) (or .cse3 .cse2) (= |P2Thread1of1ForFork2_#t~ite29_Out1531213498| ~y$w_buff1_used~0_In1531213498)))) InVars {~y$r_buff1_thd3~0=~y$r_buff1_thd3~0_In1531213498, ~y$w_buff0_used~0=~y$w_buff0_used~0_In1531213498, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In1531213498, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1531213498} OutVars{~y$r_buff1_thd3~0=~y$r_buff1_thd3~0_In1531213498, ~y$w_buff0_used~0=~y$w_buff0_used~0_In1531213498, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In1531213498, P2Thread1of1ForFork2_#t~ite29=|P2Thread1of1ForFork2_#t~ite29_Out1531213498|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1531213498} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite29] because there is no mapped edge [2019-11-28 18:19:27,042 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [654] [654] L790-->L791: Formula: (let ((.cse1 (= 0 (mod ~y$w_buff0_used~0_In-104376830 256))) (.cse0 (= 0 (mod ~y$r_buff0_thd3~0_In-104376830 256))) (.cse2 (= ~y$r_buff0_thd3~0_In-104376830 ~y$r_buff0_thd3~0_Out-104376830))) (or (and (not .cse0) (not .cse1) (= 0 ~y$r_buff0_thd3~0_Out-104376830)) (and .cse1 .cse2) (and .cse0 .cse2))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-104376830, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In-104376830} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-104376830, P2Thread1of1ForFork2_#t~ite30=|P2Thread1of1ForFork2_#t~ite30_Out-104376830|, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_Out-104376830} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite30, ~y$r_buff0_thd3~0] because there is no mapped edge [2019-11-28 18:19:27,043 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [660] [660] L791-->L791-2: Formula: (let ((.cse3 (= (mod ~y$r_buff1_thd3~0_In-465800156 256) 0)) (.cse2 (= (mod ~y$w_buff1_used~0_In-465800156 256) 0)) (.cse1 (= 0 (mod ~y$r_buff0_thd3~0_In-465800156 256))) (.cse0 (= 0 (mod ~y$w_buff0_used~0_In-465800156 256)))) (or (and (= |P2Thread1of1ForFork2_#t~ite31_Out-465800156| ~y$r_buff1_thd3~0_In-465800156) (or .cse0 .cse1) (or .cse2 .cse3)) (and (or (and (not .cse3) (not .cse2)) (and (not .cse1) (not .cse0))) (= |P2Thread1of1ForFork2_#t~ite31_Out-465800156| 0)))) InVars {~y$r_buff1_thd3~0=~y$r_buff1_thd3~0_In-465800156, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-465800156, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In-465800156, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-465800156} OutVars{~y$r_buff1_thd3~0=~y$r_buff1_thd3~0_In-465800156, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-465800156, P2Thread1of1ForFork2_#t~ite31=|P2Thread1of1ForFork2_#t~ite31_Out-465800156|, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In-465800156, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-465800156} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite31] because there is no mapped edge [2019-11-28 18:19:27,043 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [674] [674] L791-2-->P2EXIT: Formula: (and (= 0 |v_P2Thread1of1ForFork2_#res.base_3|) (= |v_P2Thread1of1ForFork2_#res.offset_3| 0) (= |v_P2Thread1of1ForFork2_#t~ite31_26| v_~y$r_buff1_thd3~0_57) (= (+ v_~__unbuffered_cnt~0_45 1) v_~__unbuffered_cnt~0_44)) InVars {P2Thread1of1ForFork2_#t~ite31=|v_P2Thread1of1ForFork2_#t~ite31_26|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_45} OutVars{~y$r_buff1_thd3~0=v_~y$r_buff1_thd3~0_57, P2Thread1of1ForFork2_#t~ite31=|v_P2Thread1of1ForFork2_#t~ite31_25|, P2Thread1of1ForFork2_#res.base=|v_P2Thread1of1ForFork2_#res.base_3|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_44, P2Thread1of1ForFork2_#res.offset=|v_P2Thread1of1ForFork2_#res.offset_3|} AuxVars[] AssignedVars[~y$r_buff1_thd3~0, P2Thread1of1ForFork2_#t~ite31, P2Thread1of1ForFork2_#res.base, ~__unbuffered_cnt~0, P2Thread1of1ForFork2_#res.offset] because there is no mapped edge [2019-11-28 18:19:27,043 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [618] [618] L814-1-->L820: Formula: (and (not (= (mod v_~main$tmp_guard0~0_8 256) 0)) (= v_~main$tmp_guard0~0_8 (ite (= (ite (= 3 v_~__unbuffered_cnt~0_23) 1 0) 0) 0 1))) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_23} OutVars{ULTIMATE.start_main_#t~nondet34=|v_ULTIMATE.start_main_#t~nondet34_8|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_23, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_8} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet34, ~main$tmp_guard0~0] because there is no mapped edge [2019-11-28 18:19:27,043 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [668] [668] L820-2-->L820-4: Formula: (let ((.cse0 (= (mod ~y$r_buff1_thd0~0_In1161940770 256) 0)) (.cse1 (= 0 (mod ~y$w_buff1_used~0_In1161940770 256)))) (or (and (not .cse0) (= |ULTIMATE.start_main_#t~ite35_Out1161940770| ~y$w_buff1~0_In1161940770) (not .cse1)) (and (or .cse0 .cse1) (= |ULTIMATE.start_main_#t~ite35_Out1161940770| ~y~0_In1161940770)))) InVars {~y$w_buff1~0=~y$w_buff1~0_In1161940770, ~y~0=~y~0_In1161940770, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In1161940770, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1161940770} OutVars{~y$w_buff1~0=~y$w_buff1~0_In1161940770, ULTIMATE.start_main_#t~ite35=|ULTIMATE.start_main_#t~ite35_Out1161940770|, ~y~0=~y~0_In1161940770, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In1161940770, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1161940770} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite35] because there is no mapped edge [2019-11-28 18:19:27,044 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [629] [629] L820-4-->L821: Formula: (= v_~y~0_26 |v_ULTIMATE.start_main_#t~ite35_14|) InVars {ULTIMATE.start_main_#t~ite35=|v_ULTIMATE.start_main_#t~ite35_14|} OutVars{ULTIMATE.start_main_#t~ite35=|v_ULTIMATE.start_main_#t~ite35_13|, ULTIMATE.start_main_#t~ite36=|v_ULTIMATE.start_main_#t~ite36_13|, ~y~0=v_~y~0_26} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite35, ULTIMATE.start_main_#t~ite36, ~y~0] because there is no mapped edge [2019-11-28 18:19:27,044 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [663] [663] L821-->L821-2: Formula: (let ((.cse1 (= (mod ~y$w_buff0_used~0_In2040403554 256) 0)) (.cse0 (= 0 (mod ~y$r_buff0_thd0~0_In2040403554 256)))) (or (and (not .cse0) (not .cse1) (= |ULTIMATE.start_main_#t~ite37_Out2040403554| 0)) (and (or .cse1 .cse0) (= ~y$w_buff0_used~0_In2040403554 |ULTIMATE.start_main_#t~ite37_Out2040403554|)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In2040403554, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In2040403554} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In2040403554, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In2040403554, ULTIMATE.start_main_#t~ite37=|ULTIMATE.start_main_#t~ite37_Out2040403554|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite37] because there is no mapped edge [2019-11-28 18:19:27,044 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [670] [670] L822-->L822-2: Formula: (let ((.cse2 (= (mod ~y$w_buff1_used~0_In423785213 256) 0)) (.cse3 (= 0 (mod ~y$r_buff1_thd0~0_In423785213 256))) (.cse0 (= 0 (mod ~y$w_buff0_used~0_In423785213 256))) (.cse1 (= (mod ~y$r_buff0_thd0~0_In423785213 256) 0))) (or (and (or .cse0 .cse1) (= |ULTIMATE.start_main_#t~ite38_Out423785213| ~y$w_buff1_used~0_In423785213) (or .cse2 .cse3)) (and (= |ULTIMATE.start_main_#t~ite38_Out423785213| 0) (or (and (not .cse2) (not .cse3)) (and (not .cse0) (not .cse1)))))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In423785213, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In423785213, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In423785213, ~y$w_buff1_used~0=~y$w_buff1_used~0_In423785213} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In423785213, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In423785213, ULTIMATE.start_main_#t~ite38=|ULTIMATE.start_main_#t~ite38_Out423785213|, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In423785213, ~y$w_buff1_used~0=~y$w_buff1_used~0_In423785213} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite38] because there is no mapped edge [2019-11-28 18:19:27,045 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [662] [662] L823-->L823-2: Formula: (let ((.cse0 (= 0 (mod ~y$w_buff0_used~0_In-27908725 256))) (.cse1 (= 0 (mod ~y$r_buff0_thd0~0_In-27908725 256)))) (or (and (or .cse0 .cse1) (= ~y$r_buff0_thd0~0_In-27908725 |ULTIMATE.start_main_#t~ite39_Out-27908725|)) (and (= 0 |ULTIMATE.start_main_#t~ite39_Out-27908725|) (not .cse0) (not .cse1)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-27908725, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-27908725} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-27908725, ULTIMATE.start_main_#t~ite39=|ULTIMATE.start_main_#t~ite39_Out-27908725|, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-27908725} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite39] because there is no mapped edge [2019-11-28 18:19:27,046 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [659] [659] L824-->L824-2: Formula: (let ((.cse2 (= (mod ~y$r_buff0_thd0~0_In2139367558 256) 0)) (.cse3 (= (mod ~y$w_buff0_used~0_In2139367558 256) 0)) (.cse1 (= 0 (mod ~y$w_buff1_used~0_In2139367558 256))) (.cse0 (= 0 (mod ~y$r_buff1_thd0~0_In2139367558 256)))) (or (and (= 0 |ULTIMATE.start_main_#t~ite40_Out2139367558|) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (= |ULTIMATE.start_main_#t~ite40_Out2139367558| ~y$r_buff1_thd0~0_In2139367558) (or .cse2 .cse3) (or .cse1 .cse0)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In2139367558, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In2139367558, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In2139367558, ~y$w_buff1_used~0=~y$w_buff1_used~0_In2139367558} OutVars{ULTIMATE.start_main_#t~ite40=|ULTIMATE.start_main_#t~ite40_Out2139367558|, ~y$w_buff0_used~0=~y$w_buff0_used~0_In2139367558, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In2139367558, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In2139367558, ~y$w_buff1_used~0=~y$w_buff1_used~0_In2139367558} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite40] because there is no mapped edge [2019-11-28 18:19:27,046 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [715] [715] L824-2-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= v_ULTIMATE.start___VERIFIER_assert_~expression_17 |v_ULTIMATE.start___VERIFIER_assert_#in~expression_13|) (= v_~y$r_buff1_thd0~0_136 |v_ULTIMATE.start_main_#t~ite40_46|) (= (ite (= (ite (not (and (= 0 v_~__unbuffered_p1_EAX~0_43) (= v_~x~0_34 2) (= 0 v_~__unbuffered_p2_EAX~0_98))) 1 0) 0) 0 1) v_~main$tmp_guard1~0_21) (= v_ULTIMATE.start___VERIFIER_assert_~expression_17 0) (= |v_ULTIMATE.start___VERIFIER_assert_#in~expression_13| (mod v_~main$tmp_guard1~0_21 256))) InVars {ULTIMATE.start_main_#t~ite40=|v_ULTIMATE.start_main_#t~ite40_46|, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_43, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_98, ~x~0=v_~x~0_34} OutVars{ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_17, ULTIMATE.start_main_#t~ite40=|v_ULTIMATE.start_main_#t~ite40_45|, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_43, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_21, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_98, ~x~0=v_~x~0_34, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_136, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_13|} AuxVars[] AssignedVars[ULTIMATE.start___VERIFIER_assert_~expression, ULTIMATE.start_main_#t~ite40, ~main$tmp_guard1~0, ~y$r_buff1_thd0~0, ULTIMATE.start___VERIFIER_assert_#in~expression] because there is no mapped edge [2019-11-28 18:19:27,145 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2019-11-28 18:19:27,145 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-11-28 18:19:27,149 INFO L168 Benchmark]: Toolchain (without parser) took 22765.08 ms. Allocated memory was 1.0 GB in the beginning and 2.1 GB in the end (delta: 1.1 GB). Free memory was 951.0 MB in the beginning and 1.4 GB in the end (delta: -450.5 MB). Peak memory consumption was 644.2 MB. Max. memory is 11.5 GB. [2019-11-28 18:19:27,152 INFO L168 Benchmark]: CDTParser took 0.81 ms. Allocated memory is still 1.0 GB. Free memory is still 981.8 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-28 18:19:27,153 INFO L168 Benchmark]: CACSL2BoogieTranslator took 790.98 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 146.3 MB). Free memory was 951.0 MB in the beginning and 1.1 GB in the end (delta: -163.8 MB). Peak memory consumption was 20.8 MB. Max. memory is 11.5 GB. [2019-11-28 18:19:27,155 INFO L168 Benchmark]: Boogie Procedure Inliner took 102.90 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: 6.6 MB). Peak memory consumption was 6.6 MB. Max. memory is 11.5 GB. [2019-11-28 18:19:27,155 INFO L168 Benchmark]: Boogie Preprocessor took 76.04 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-11-28 18:19:27,156 INFO L168 Benchmark]: RCFGBuilder took 754.88 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: 43.9 MB). Peak memory consumption was 43.9 MB. Max. memory is 11.5 GB. [2019-11-28 18:19:27,156 INFO L168 Benchmark]: TraceAbstraction took 20918.28 ms. Allocated memory was 1.2 GB in the beginning and 2.1 GB in the end (delta: 948.4 MB). Free memory was 1.1 GB in the beginning and 1.4 GB in the end (delta: -357.5 MB). Peak memory consumption was 590.9 MB. Max. memory is 11.5 GB. [2019-11-28 18:19:27,157 INFO L168 Benchmark]: Witness Printer took 116.49 ms. Allocated memory is still 2.1 GB. Free memory was 1.4 GB in the beginning and 1.4 GB in the end (delta: 20.3 MB). Peak memory consumption was 20.3 MB. Max. memory is 11.5 GB. [2019-11-28 18:19:27,161 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.81 ms. Allocated memory is still 1.0 GB. Free memory is still 981.8 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 790.98 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 146.3 MB). Free memory was 951.0 MB in the beginning and 1.1 GB in the end (delta: -163.8 MB). Peak memory consumption was 20.8 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 102.90 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: 6.6 MB). Peak memory consumption was 6.6 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 76.04 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 754.88 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: 43.9 MB). Peak memory consumption was 43.9 MB. Max. memory is 11.5 GB. * TraceAbstraction took 20918.28 ms. Allocated memory was 1.2 GB in the beginning and 2.1 GB in the end (delta: 948.4 MB). Free memory was 1.1 GB in the beginning and 1.4 GB in the end (delta: -357.5 MB). Peak memory consumption was 590.9 MB. Max. memory is 11.5 GB. * Witness Printer took 116.49 ms. Allocated memory is still 2.1 GB. Free memory was 1.4 GB in the beginning and 1.4 GB in the end (delta: 20.3 MB). Peak memory consumption was 20.3 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks LbeTime: 5.3s, 151 ProgramPointsBefore, 72 ProgramPointsAfterwards, 176 TransitionsBefore, 80 TransitionsAfterwards, 11400 CoEnabledTransitionPairs, 7 FixpointIterations, 32 TrivialSequentialCompositions, 44 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 34 ConcurrentYvCompositions, 21 ChoiceCompositions, 5098 VarBasedMoverChecksPositive, 188 VarBasedMoverChecksNegative, 63 SemBasedMoverChecksPositive, 154 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 1.3s, 0 MoverChecksTotal, 39870 CheckedPairsTotal, 110 TotalNumberOfCompositions - CounterExampleResult [Line: 4]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L810] FCALL, FORK 0 pthread_create(&t1406, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L812] FCALL, FORK 0 pthread_create(&t1407, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L814] FCALL, FORK 0 pthread_create(&t1408, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L772] 3 y$w_buff1 = y$w_buff0 [L773] 3 y$w_buff0 = 1 [L774] 3 y$w_buff1_used = y$w_buff0_used [L775] 3 y$w_buff0_used = (_Bool)1 [L787] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=0] [L744] 2 x = 2 [L747] 2 weak$$choice0 = __VERIFIER_nondet_bool() [L748] 2 weak$$choice2 = __VERIFIER_nondet_bool() [L749] 2 y$flush_delayed = weak$$choice2 [L750] 2 y$mem_tmp = y VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=2, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L751] EXPR 2 !y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff1) VAL [!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff1)=0, \result={0:0}, __unbuffered_cnt=1, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=2, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L751] 2 y = !y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff1) [L752] 2 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff0)) [L753] 2 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff1 : y$w_buff1)) [L754] EXPR 2 weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used)) VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used))=1, x=2, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L754] 2 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used)) [L755] EXPR 2 weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0))=0, x=2, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L755] 2 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L757] EXPR 2 weak$$choice2 ? y$r_buff1_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff1_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, weak$$choice2 ? y$r_buff1_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff1_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0))=0, x=2, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L757] 2 y$r_buff1_thd2 = weak$$choice2 ? y$r_buff1_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff1_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L758] 2 __unbuffered_p1_EAX = y VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=2, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L787] 3 y = y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y) [L788] 3 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used [L789] 3 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$w_buff1_used [L820] 0 y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) VAL [\result={0:0}, __unbuffered_cnt=3, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=2, y=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L821] 0 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L822] 0 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$w_buff1_used [L823] 0 y$r_buff0_thd0 = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 142 locations, 2 error locations. Result: UNSAFE, OverallTime: 20.6s, OverallIterations: 16, TraceHistogramMax: 1, AutomataDifference: 7.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 1734 SDtfs, 1842 SDslu, 3373 SDs, 0 SdLazy, 2010 SolverSat, 148 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 2.6s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 106 GetRequests, 17 SyntacticMatches, 3 SemanticMatches, 86 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 715 ImplicationChecksByTransitivity, 2.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=23641occurred in iteration=6, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 5.3s AutomataMinimizationTime, 15 MinimizatonAttempts, 15684 StatesRemovedByMinimization, 12 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 1.0s InterpolantComputationTime, 424 NumberOfCodeBlocks, 424 NumberOfCodeBlocksAsserted, 16 NumberOfCheckSat, 364 ConstructedInterpolants, 0 QuantifiedInterpolants, 61560 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 15 InterpolantComputations, 15 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...