./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/pthread-wmm/mix032_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/mix032_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 a47df225588f341f6d9be0fcd0f34a00d190332d .......................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... 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:11:54,108 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-28 18:11:54,111 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-28 18:11:54,130 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-28 18:11:54,130 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-28 18:11:54,133 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-28 18:11:54,135 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-28 18:11:54,144 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-28 18:11:54,148 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-28 18:11:54,152 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-28 18:11:54,153 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-28 18:11:54,155 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-28 18:11:54,155 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-28 18:11:54,158 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-28 18:11:54,160 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-28 18:11:54,162 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-28 18:11:54,164 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-28 18:11:54,165 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-28 18:11:54,167 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-28 18:11:54,172 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-28 18:11:54,176 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-28 18:11:54,181 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-28 18:11:54,182 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-28 18:11:54,184 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-28 18:11:54,187 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-28 18:11:54,187 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-28 18:11:54,187 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-28 18:11:54,189 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-28 18:11:54,190 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-28 18:11:54,191 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-28 18:11:54,191 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-28 18:11:54,192 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-28 18:11:54,192 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-28 18:11:54,193 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-28 18:11:54,194 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-28 18:11:54,194 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-28 18:11:54,195 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-28 18:11:54,195 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-28 18:11:54,196 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-28 18:11:54,196 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-28 18:11:54,197 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-28 18:11:54,198 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:11:54,213 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-28 18:11:54,213 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-28 18:11:54,214 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-28 18:11:54,215 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-28 18:11:54,215 INFO L138 SettingsManager]: * Use SBE=true [2019-11-28 18:11:54,215 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-28 18:11:54,216 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-28 18:11:54,216 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-28 18:11:54,216 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-28 18:11:54,216 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-28 18:11:54,216 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-11-28 18:11:54,217 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-28 18:11:54,217 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-11-28 18:11:54,217 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-28 18:11:54,217 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-28 18:11:54,218 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-28 18:11:54,218 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-11-28 18:11:54,218 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-28 18:11:54,218 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-28 18:11:54,219 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-28 18:11:54,219 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-28 18:11:54,219 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-28 18:11:54,219 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-28 18:11:54,220 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-28 18:11:54,220 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-11-28 18:11:54,220 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-11-28 18:11:54,220 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-11-28 18:11:54,220 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-11-28 18:11:54,221 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2019-11-28 18:11:54,221 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 -> a47df225588f341f6d9be0fcd0f34a00d190332d [2019-11-28 18:11:54,533 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-28 18:11:54,547 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-28 18:11:54,551 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-28 18:11:54,552 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-28 18:11:54,553 INFO L275 PluginConnector]: CDTParser initialized [2019-11-28 18:11:54,554 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/pthread-wmm/mix032_tso.opt.i [2019-11-28 18:11:54,619 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/be7466f73/5b476df379684619ba9abc7d2b12975f/FLAGc48a2d1e9 [2019-11-28 18:11:55,228 INFO L306 CDTParser]: Found 1 translation units. [2019-11-28 18:11:55,229 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/pthread-wmm/mix032_tso.opt.i [2019-11-28 18:11:55,262 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/be7466f73/5b476df379684619ba9abc7d2b12975f/FLAGc48a2d1e9 [2019-11-28 18:11:55,504 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/be7466f73/5b476df379684619ba9abc7d2b12975f [2019-11-28 18:11:55,508 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-28 18:11:55,509 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-11-28 18:11:55,510 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-28 18:11:55,511 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-28 18:11:55,516 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-28 18:11:55,517 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 06:11:55" (1/1) ... [2019-11-28 18:11:55,520 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6822e6d4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 06:11:55, skipping insertion in model container [2019-11-28 18:11:55,520 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 06:11:55" (1/1) ... [2019-11-28 18:11:55,527 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-11-28 18:11:55,588 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-11-28 18:11:56,144 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-28 18:11:56,163 INFO L203 MainTranslator]: Completed pre-run [2019-11-28 18:11:56,251 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-28 18:11:56,326 INFO L208 MainTranslator]: Completed translation [2019-11-28 18:11:56,326 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 06:11:56 WrapperNode [2019-11-28 18:11:56,327 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-28 18:11:56,328 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-11-28 18:11:56,328 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-11-28 18:11:56,328 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-11-28 18:11:56,337 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:11:56" (1/1) ... [2019-11-28 18:11:56,362 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:11:56" (1/1) ... [2019-11-28 18:11:56,397 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-11-28 18:11:56,398 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-28 18:11:56,398 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-28 18:11:56,398 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-28 18:11:56,408 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 06:11:56" (1/1) ... [2019-11-28 18:11:56,408 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 06:11:56" (1/1) ... [2019-11-28 18:11:56,414 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 06:11:56" (1/1) ... [2019-11-28 18:11:56,414 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 06:11:56" (1/1) ... [2019-11-28 18:11:56,424 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 06:11:56" (1/1) ... [2019-11-28 18:11:56,428 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 06:11:56" (1/1) ... [2019-11-28 18:11:56,432 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 06:11:56" (1/1) ... [2019-11-28 18:11:56,437 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-28 18:11:56,438 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-28 18:11:56,438 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-28 18:11:56,438 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-28 18:11:56,439 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 06:11:56" (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:11:56,518 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-11-28 18:11:56,519 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2019-11-28 18:11:56,519 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-11-28 18:11:56,519 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-11-28 18:11:56,520 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2019-11-28 18:11:56,520 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2019-11-28 18:11:56,520 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2019-11-28 18:11:56,520 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2019-11-28 18:11:56,521 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2019-11-28 18:11:56,521 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2019-11-28 18:11:56,521 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2019-11-28 18:11:56,521 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-28 18:11:56,522 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-28 18:11:56,524 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:11:57,181 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-28 18:11:57,181 INFO L287 CfgBuilder]: Removed 8 assume(true) statements. [2019-11-28 18:11:57,183 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 06:11:57 BoogieIcfgContainer [2019-11-28 18:11:57,183 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-28 18:11:57,184 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-28 18:11:57,184 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-28 18:11:57,188 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-28 18:11:57,188 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 28.11 06:11:55" (1/3) ... [2019-11-28 18:11:57,189 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7b89ee97 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.11 06:11:57, skipping insertion in model container [2019-11-28 18:11:57,190 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 06:11:56" (2/3) ... [2019-11-28 18:11:57,190 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7b89ee97 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.11 06:11:57, skipping insertion in model container [2019-11-28 18:11:57,190 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 06:11:57" (3/3) ... [2019-11-28 18:11:57,192 INFO L109 eAbstractionObserver]: Analyzing ICFG mix032_tso.opt.i [2019-11-28 18:11:57,203 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-11-28 18:11:57,203 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-28 18:11:57,213 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2019-11-28 18:11:57,215 INFO L339 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2019-11-28 18:11:57,254 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:11:57,254 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:11:57,255 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:11:57,255 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:11:57,255 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:11:57,256 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:11:57,259 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:11:57,259 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:11:57,259 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:11:57,259 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:11:57,260 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:11:57,260 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:11:57,260 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:11:57,260 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:11:57,261 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:11:57,261 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:11:57,261 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:11:57,261 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:11:57,262 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:11:57,262 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:11:57,262 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:11:57,263 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:11:57,263 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:11:57,263 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:11:57,263 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:11:57,264 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:11:57,264 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:11:57,264 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:11:57,264 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:11:57,265 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:11:57,265 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:11:57,265 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:11:57,265 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:11:57,266 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:11:57,266 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:11:57,266 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:11:57,266 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:11:57,267 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:11:57,267 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:11:57,267 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:11:57,267 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:11:57,268 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:11:57,268 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:11:57,268 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:11:57,269 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:11:57,269 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:11:57,269 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:11:57,269 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:11:57,270 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:11:57,270 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:11:57,270 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:11:57,270 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:11:57,271 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:11:57,271 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:11:57,271 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:11:57,271 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:11:57,272 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:11:57,272 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:11:57,272 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:11:57,272 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:11:57,272 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:11:57,273 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:11:57,273 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:11:57,273 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:11:57,274 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:11:57,274 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:11:57,274 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:11:57,274 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:11:57,275 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:11:57,275 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:11:57,275 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:11:57,275 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:11:57,276 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:11:57,276 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:11:57,276 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:11:57,276 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:11:57,277 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:11:57,277 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:11:57,277 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:11:57,277 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:11:57,278 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:11:57,278 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:11:57,278 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:11:57,278 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:11:57,278 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:11:57,279 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:11:57,279 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:11:57,279 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:11:57,280 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:11:57,280 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:11:57,280 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:11:57,280 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:11:57,280 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:11:57,281 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:11:57,281 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:11:57,281 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:11:57,282 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:11:57,282 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:11:57,282 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:11:57,282 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:11:57,283 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:11:57,283 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:11:57,284 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:11:57,284 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:11:57,284 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:11:57,284 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:11:57,285 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:11:57,285 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:11:57,285 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:11:57,286 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:11:57,286 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:11:57,286 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:11:57,286 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:11:57,287 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:11:57,287 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:11:57,287 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:11:57,287 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:11:57,287 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:11:57,288 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:11:57,288 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:11:57,288 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:11:57,288 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:11:57,289 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:11:57,289 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:11:57,289 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:11:57,289 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:11:57,290 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:11:57,290 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:11:57,290 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:11:57,290 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:11:57,291 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:11:57,291 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:11:57,291 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:11:57,291 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:11:57,312 INFO L249 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2019-11-28 18:11:57,336 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-28 18:11:57,336 INFO L374 AbstractCegarLoop]: Hoare is true [2019-11-28 18:11:57,336 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-28 18:11:57,337 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-28 18:11:57,337 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-28 18:11:57,337 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-28 18:11:57,337 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-28 18:11:57,337 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-28 18:11:57,355 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 156 places, 181 transitions [2019-11-28 18:11:57,357 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 156 places, 181 transitions [2019-11-28 18:11:57,452 INFO L134 PetriNetUnfolder]: 35/178 cut-off events. [2019-11-28 18:11:57,453 INFO L135 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-11-28 18:11:57,474 INFO L76 FinitePrefix]: Finished finitePrefix Result has 188 conditions, 178 events. 35/178 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 12. Compared 557 event pairs. 9/150 useless extension candidates. Maximal degree in co-relation 143. Up to 2 conditions per place. [2019-11-28 18:11:57,498 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 156 places, 181 transitions [2019-11-28 18:11:57,587 INFO L134 PetriNetUnfolder]: 35/178 cut-off events. [2019-11-28 18:11:57,588 INFO L135 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-11-28 18:11:57,600 INFO L76 FinitePrefix]: Finished finitePrefix Result has 188 conditions, 178 events. 35/178 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 12. Compared 557 event pairs. 9/150 useless extension candidates. Maximal degree in co-relation 143. Up to 2 conditions per place. [2019-11-28 18:11:57,623 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 11400 [2019-11-28 18:11:57,624 INFO L170 etLargeBlockEncoding]: Semantic Check. [2019-11-28 18:12:01,707 WARN L192 SmtUtils]: Spent 263.00 ms on a formula simplification. DAG size of input: 51 DAG size of output: 47 [2019-11-28 18:12:02,008 WARN L192 SmtUtils]: Spent 128.00 ms on a formula simplification that was a NOOP. DAG size: 87 [2019-11-28 18:12:02,145 WARN L192 SmtUtils]: Spent 135.00 ms on a formula simplification that was a NOOP. DAG size: 87 [2019-11-28 18:12:02,514 WARN L192 SmtUtils]: Spent 342.00 ms on a formula simplification. DAG size of input: 99 DAG size of output: 97 [2019-11-28 18:12:02,663 WARN L192 SmtUtils]: Spent 146.00 ms on a formula simplification that was a NOOP. DAG size: 95 [2019-11-28 18:12:02,686 INFO L206 etLargeBlockEncoding]: Checked pairs total: 50265 [2019-11-28 18:12:02,686 INFO L214 etLargeBlockEncoding]: Total number of compositions: 112 [2019-11-28 18:12:02,690 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 75 places, 85 transitions [2019-11-28 18:12:03,760 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 14534 states. [2019-11-28 18:12:03,762 INFO L276 IsEmpty]: Start isEmpty. Operand 14534 states. [2019-11-28 18:12:03,769 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-11-28 18:12:03,769 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 18:12:03,770 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2019-11-28 18:12:03,771 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:12:03,777 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 18:12:03,778 INFO L82 PathProgramCache]: Analyzing trace with hash 104230949, now seen corresponding path program 1 times [2019-11-28 18:12:03,786 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 18:12:03,786 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1775667214] [2019-11-28 18:12:03,786 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 18:12:03,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 18:12:04,046 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:12:04,047 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1775667214] [2019-11-28 18:12:04,048 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 18:12:04,048 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-11-28 18:12:04,051 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [430601195] [2019-11-28 18:12:04,056 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-28 18:12:04,056 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 18:12:04,067 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-28 18:12:04,067 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 18:12:04,069 INFO L87 Difference]: Start difference. First operand 14534 states. Second operand 3 states. [2019-11-28 18:12:04,477 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 18:12:04,477 INFO L93 Difference]: Finished difference Result 14182 states and 55174 transitions. [2019-11-28 18:12:04,479 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-28 18:12:04,481 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 7 [2019-11-28 18:12:04,482 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 18:12:04,745 INFO L225 Difference]: With dead ends: 14182 [2019-11-28 18:12:04,746 INFO L226 Difference]: Without dead ends: 13350 [2019-11-28 18:12:04,748 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:12:04,941 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13350 states. [2019-11-28 18:12:05,486 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13350 to 13350. [2019-11-28 18:12:05,487 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13350 states. [2019-11-28 18:12:05,573 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13350 states to 13350 states and 51860 transitions. [2019-11-28 18:12:05,575 INFO L78 Accepts]: Start accepts. Automaton has 13350 states and 51860 transitions. Word has length 7 [2019-11-28 18:12:05,577 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 18:12:05,577 INFO L462 AbstractCegarLoop]: Abstraction has 13350 states and 51860 transitions. [2019-11-28 18:12:05,577 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-28 18:12:05,577 INFO L276 IsEmpty]: Start isEmpty. Operand 13350 states and 51860 transitions. [2019-11-28 18:12:05,589 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-11-28 18:12:05,589 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 18:12:05,589 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 18:12:05,590 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:12:05,590 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 18:12:05,590 INFO L82 PathProgramCache]: Analyzing trace with hash 27609139, now seen corresponding path program 1 times [2019-11-28 18:12:05,591 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 18:12:05,591 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [732265013] [2019-11-28 18:12:05,591 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 18:12:05,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 18:12:05,761 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:12:05,762 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [732265013] [2019-11-28 18:12:05,762 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 18:12:05,763 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-28 18:12:05,763 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [797046535] [2019-11-28 18:12:05,765 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-28 18:12:05,766 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 18:12:05,766 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-28 18:12:05,766 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-28 18:12:05,766 INFO L87 Difference]: Start difference. First operand 13350 states and 51860 transitions. Second operand 4 states. [2019-11-28 18:12:06,218 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 18:12:06,218 INFO L93 Difference]: Finished difference Result 20194 states and 75632 transitions. [2019-11-28 18:12:06,219 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-28 18:12:06,219 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 13 [2019-11-28 18:12:06,219 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 18:12:06,313 INFO L225 Difference]: With dead ends: 20194 [2019-11-28 18:12:06,313 INFO L226 Difference]: Without dead ends: 20164 [2019-11-28 18:12:06,314 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-28 18:12:06,485 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20164 states. [2019-11-28 18:12:07,293 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20164 to 18344. [2019-11-28 18:12:07,293 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18344 states. [2019-11-28 18:12:07,387 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18344 states to 18344 states and 69695 transitions. [2019-11-28 18:12:07,388 INFO L78 Accepts]: Start accepts. Automaton has 18344 states and 69695 transitions. Word has length 13 [2019-11-28 18:12:07,397 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 18:12:07,397 INFO L462 AbstractCegarLoop]: Abstraction has 18344 states and 69695 transitions. [2019-11-28 18:12:07,397 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-28 18:12:07,397 INFO L276 IsEmpty]: Start isEmpty. Operand 18344 states and 69695 transitions. [2019-11-28 18:12:07,407 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-11-28 18:12:07,408 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 18:12:07,408 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:12:07,408 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:12:07,408 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 18:12:07,409 INFO L82 PathProgramCache]: Analyzing trace with hash 1189360442, now seen corresponding path program 1 times [2019-11-28 18:12:07,409 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 18:12:07,409 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1433529754] [2019-11-28 18:12:07,410 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 18:12:07,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 18:12:07,487 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:12:07,488 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1433529754] [2019-11-28 18:12:07,488 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 18:12:07,488 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-28 18:12:07,489 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [175915272] [2019-11-28 18:12:07,489 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-28 18:12:07,490 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 18:12:07,490 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-28 18:12:07,490 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 18:12:07,490 INFO L87 Difference]: Start difference. First operand 18344 states and 69695 transitions. Second operand 3 states. [2019-11-28 18:12:07,660 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 18:12:07,660 INFO L93 Difference]: Finished difference Result 23466 states and 87296 transitions. [2019-11-28 18:12:07,660 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-28 18:12:07,660 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 16 [2019-11-28 18:12:07,661 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 18:12:07,795 INFO L225 Difference]: With dead ends: 23466 [2019-11-28 18:12:07,795 INFO L226 Difference]: Without dead ends: 23466 [2019-11-28 18:12:07,796 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:12:07,972 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23466 states. [2019-11-28 18:12:08,500 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23466 to 20060. [2019-11-28 18:12:08,500 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20060 states. [2019-11-28 18:12:08,617 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20060 states to 20060 states and 75793 transitions. [2019-11-28 18:12:08,618 INFO L78 Accepts]: Start accepts. Automaton has 20060 states and 75793 transitions. Word has length 16 [2019-11-28 18:12:08,618 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 18:12:08,618 INFO L462 AbstractCegarLoop]: Abstraction has 20060 states and 75793 transitions. [2019-11-28 18:12:08,619 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-28 18:12:08,619 INFO L276 IsEmpty]: Start isEmpty. Operand 20060 states and 75793 transitions. [2019-11-28 18:12:08,627 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-11-28 18:12:08,627 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 18:12:08,627 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:12:08,628 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:12:08,628 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 18:12:08,629 INFO L82 PathProgramCache]: Analyzing trace with hash 1189225003, now seen corresponding path program 1 times [2019-11-28 18:12:08,629 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 18:12:08,630 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1425159728] [2019-11-28 18:12:08,630 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 18:12:08,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 18:12:08,687 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:12:08,687 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1425159728] [2019-11-28 18:12:08,688 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 18:12:08,688 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-28 18:12:08,688 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [722736560] [2019-11-28 18:12:08,689 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-28 18:12:08,689 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 18:12:08,689 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-28 18:12:08,690 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-28 18:12:08,690 INFO L87 Difference]: Start difference. First operand 20060 states and 75793 transitions. Second operand 4 states. [2019-11-28 18:12:09,038 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 18:12:09,039 INFO L93 Difference]: Finished difference Result 24056 states and 89213 transitions. [2019-11-28 18:12:09,040 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-28 18:12:09,040 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 16 [2019-11-28 18:12:09,040 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 18:12:09,169 INFO L225 Difference]: With dead ends: 24056 [2019-11-28 18:12:09,170 INFO L226 Difference]: Without dead ends: 24036 [2019-11-28 18:12:09,170 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:12:09,798 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24036 states. [2019-11-28 18:12:10,280 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24036 to 21018. [2019-11-28 18:12:10,281 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21018 states. [2019-11-28 18:12:10,367 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21018 states to 21018 states and 79114 transitions. [2019-11-28 18:12:10,368 INFO L78 Accepts]: Start accepts. Automaton has 21018 states and 79114 transitions. Word has length 16 [2019-11-28 18:12:10,368 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 18:12:10,368 INFO L462 AbstractCegarLoop]: Abstraction has 21018 states and 79114 transitions. [2019-11-28 18:12:10,368 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-28 18:12:10,368 INFO L276 IsEmpty]: Start isEmpty. Operand 21018 states and 79114 transitions. [2019-11-28 18:12:10,374 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-11-28 18:12:10,374 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 18:12:10,375 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:12:10,375 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:12:10,375 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 18:12:10,376 INFO L82 PathProgramCache]: Analyzing trace with hash -1055623133, now seen corresponding path program 1 times [2019-11-28 18:12:10,376 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 18:12:10,376 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [472188287] [2019-11-28 18:12:10,377 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 18:12:10,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 18:12:10,429 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:12:10,430 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [472188287] [2019-11-28 18:12:10,430 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 18:12:10,430 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-28 18:12:10,430 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [596030903] [2019-11-28 18:12:10,431 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-28 18:12:10,431 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 18:12:10,432 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-28 18:12:10,432 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-28 18:12:10,432 INFO L87 Difference]: Start difference. First operand 21018 states and 79114 transitions. Second operand 4 states. [2019-11-28 18:12:10,759 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 18:12:10,760 INFO L93 Difference]: Finished difference Result 26444 states and 98339 transitions. [2019-11-28 18:12:10,760 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-28 18:12:10,760 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 16 [2019-11-28 18:12:10,761 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 18:12:10,887 INFO L225 Difference]: With dead ends: 26444 [2019-11-28 18:12:10,887 INFO L226 Difference]: Without dead ends: 26414 [2019-11-28 18:12:10,888 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:12:11,072 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26414 states. [2019-11-28 18:12:11,991 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26414 to 21928. [2019-11-28 18:12:11,992 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21928 states. [2019-11-28 18:12:12,061 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21928 states to 21928 states and 82711 transitions. [2019-11-28 18:12:12,061 INFO L78 Accepts]: Start accepts. Automaton has 21928 states and 82711 transitions. Word has length 16 [2019-11-28 18:12:12,062 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 18:12:12,062 INFO L462 AbstractCegarLoop]: Abstraction has 21928 states and 82711 transitions. [2019-11-28 18:12:12,062 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-28 18:12:12,062 INFO L276 IsEmpty]: Start isEmpty. Operand 21928 states and 82711 transitions. [2019-11-28 18:12:12,069 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-11-28 18:12:12,070 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 18:12:12,070 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:12:12,070 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:12:12,071 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 18:12:12,071 INFO L82 PathProgramCache]: Analyzing trace with hash 2076093569, now seen corresponding path program 1 times [2019-11-28 18:12:12,071 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 18:12:12,072 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1699512675] [2019-11-28 18:12:12,072 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 18:12:12,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 18:12:12,138 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:12:12,138 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1699512675] [2019-11-28 18:12:12,139 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 18:12:12,139 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-28 18:12:12,139 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1877658216] [2019-11-28 18:12:12,140 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-28 18:12:12,140 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 18:12:12,140 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-28 18:12:12,140 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 18:12:12,140 INFO L87 Difference]: Start difference. First operand 21928 states and 82711 transitions. Second operand 3 states. [2019-11-28 18:12:12,275 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 18:12:12,275 INFO L93 Difference]: Finished difference Result 20766 states and 77222 transitions. [2019-11-28 18:12:12,276 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-28 18:12:12,276 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 18 [2019-11-28 18:12:12,276 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 18:12:12,332 INFO L225 Difference]: With dead ends: 20766 [2019-11-28 18:12:12,333 INFO L226 Difference]: Without dead ends: 20766 [2019-11-28 18:12:12,333 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:12:12,495 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20766 states. [2019-11-28 18:12:12,804 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20766 to 20282. [2019-11-28 18:12:12,804 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20282 states. [2019-11-28 18:12:12,860 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20282 states to 20282 states and 75572 transitions. [2019-11-28 18:12:12,860 INFO L78 Accepts]: Start accepts. Automaton has 20282 states and 75572 transitions. Word has length 18 [2019-11-28 18:12:12,860 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 18:12:12,860 INFO L462 AbstractCegarLoop]: Abstraction has 20282 states and 75572 transitions. [2019-11-28 18:12:12,860 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-28 18:12:12,861 INFO L276 IsEmpty]: Start isEmpty. Operand 20282 states and 75572 transitions. [2019-11-28 18:12:12,869 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-11-28 18:12:12,869 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 18:12:12,870 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:12:12,870 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:12:12,870 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 18:12:12,871 INFO L82 PathProgramCache]: Analyzing trace with hash 1546230613, now seen corresponding path program 1 times [2019-11-28 18:12:12,871 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 18:12:12,871 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [828928169] [2019-11-28 18:12:12,871 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 18:12:12,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 18:12:13,005 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:12:13,006 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [828928169] [2019-11-28 18:12:13,006 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 18:12:13,006 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-11-28 18:12:13,007 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2083017765] [2019-11-28 18:12:13,007 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-28 18:12:13,007 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 18:12:13,007 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-28 18:12:13,008 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 18:12:13,008 INFO L87 Difference]: Start difference. First operand 20282 states and 75572 transitions. Second operand 3 states. [2019-11-28 18:12:13,119 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 18:12:13,120 INFO L93 Difference]: Finished difference Result 20378 states and 75774 transitions. [2019-11-28 18:12:13,120 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-28 18:12:13,120 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 18 [2019-11-28 18:12:13,120 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 18:12:13,171 INFO L225 Difference]: With dead ends: 20378 [2019-11-28 18:12:13,171 INFO L226 Difference]: Without dead ends: 20378 [2019-11-28 18:12:13,172 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:12:13,284 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20378 states. [2019-11-28 18:12:13,573 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20378 to 20279. [2019-11-28 18:12:13,573 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20279 states. [2019-11-28 18:12:13,642 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20279 states to 20279 states and 75560 transitions. [2019-11-28 18:12:13,643 INFO L78 Accepts]: Start accepts. Automaton has 20279 states and 75560 transitions. Word has length 18 [2019-11-28 18:12:13,643 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 18:12:13,643 INFO L462 AbstractCegarLoop]: Abstraction has 20279 states and 75560 transitions. [2019-11-28 18:12:13,643 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-28 18:12:13,643 INFO L276 IsEmpty]: Start isEmpty. Operand 20279 states and 75560 transitions. [2019-11-28 18:12:13,652 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-11-28 18:12:13,653 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 18:12:13,653 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:12:13,653 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:12:13,653 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 18:12:13,654 INFO L82 PathProgramCache]: Analyzing trace with hash 876364753, now seen corresponding path program 1 times [2019-11-28 18:12:13,654 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 18:12:13,654 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1450517359] [2019-11-28 18:12:13,654 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 18:12:13,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 18:12:13,783 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:12:13,784 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1450517359] [2019-11-28 18:12:13,784 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 18:12:13,784 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-28 18:12:13,784 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [622158019] [2019-11-28 18:12:13,785 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-28 18:12:13,786 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 18:12:13,786 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-28 18:12:13,787 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-28 18:12:13,787 INFO L87 Difference]: Start difference. First operand 20279 states and 75560 transitions. Second operand 4 states. [2019-11-28 18:12:13,925 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 18:12:13,925 INFO L93 Difference]: Finished difference Result 19992 states and 74483 transitions. [2019-11-28 18:12:13,925 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-28 18:12:13,925 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 19 [2019-11-28 18:12:13,926 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 18:12:13,976 INFO L225 Difference]: With dead ends: 19992 [2019-11-28 18:12:13,976 INFO L226 Difference]: Without dead ends: 19992 [2019-11-28 18:12:13,976 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-28 18:12:14,761 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19992 states. [2019-11-28 18:12:14,994 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19992 to 19992. [2019-11-28 18:12:14,995 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19992 states. [2019-11-28 18:12:15,052 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19992 states to 19992 states and 74483 transitions. [2019-11-28 18:12:15,053 INFO L78 Accepts]: Start accepts. Automaton has 19992 states and 74483 transitions. Word has length 19 [2019-11-28 18:12:15,053 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 18:12:15,053 INFO L462 AbstractCegarLoop]: Abstraction has 19992 states and 74483 transitions. [2019-11-28 18:12:15,054 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-28 18:12:15,054 INFO L276 IsEmpty]: Start isEmpty. Operand 19992 states and 74483 transitions. [2019-11-28 18:12:15,064 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-11-28 18:12:15,065 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 18:12:15,065 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:12:15,065 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:12:15,066 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 18:12:15,066 INFO L82 PathProgramCache]: Analyzing trace with hash -1090694034, now seen corresponding path program 1 times [2019-11-28 18:12:15,066 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 18:12:15,067 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [136007030] [2019-11-28 18:12:15,067 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 18:12:15,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 18:12:15,261 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:12:15,262 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [136007030] [2019-11-28 18:12:15,262 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 18:12:15,262 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-28 18:12:15,262 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [224272147] [2019-11-28 18:12:15,263 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-28 18:12:15,263 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 18:12:15,266 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-28 18:12:15,266 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2019-11-28 18:12:15,266 INFO L87 Difference]: Start difference. First operand 19992 states and 74483 transitions. Second operand 6 states. [2019-11-28 18:12:15,624 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 18:12:15,624 INFO L93 Difference]: Finished difference Result 20286 states and 75390 transitions. [2019-11-28 18:12:15,625 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-11-28 18:12:15,625 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 20 [2019-11-28 18:12:15,625 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 18:12:15,673 INFO L225 Difference]: With dead ends: 20286 [2019-11-28 18:12:15,673 INFO L226 Difference]: Without dead ends: 20286 [2019-11-28 18:12:15,674 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 2 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=25, Invalid=31, Unknown=0, NotChecked=0, Total=56 [2019-11-28 18:12:15,772 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20286 states. [2019-11-28 18:12:16,028 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20286 to 19944. [2019-11-28 18:12:16,028 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19944 states. [2019-11-28 18:12:16,082 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19944 states to 19944 states and 74317 transitions. [2019-11-28 18:12:16,083 INFO L78 Accepts]: Start accepts. Automaton has 19944 states and 74317 transitions. Word has length 20 [2019-11-28 18:12:16,083 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 18:12:16,083 INFO L462 AbstractCegarLoop]: Abstraction has 19944 states and 74317 transitions. [2019-11-28 18:12:16,083 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-28 18:12:16,084 INFO L276 IsEmpty]: Start isEmpty. Operand 19944 states and 74317 transitions. [2019-11-28 18:12:16,093 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-11-28 18:12:16,094 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 18:12:16,094 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 18:12:16,094 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:12:16,094 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 18:12:16,094 INFO L82 PathProgramCache]: Analyzing trace with hash 460041717, now seen corresponding path program 1 times [2019-11-28 18:12:16,095 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 18:12:16,095 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [590560586] [2019-11-28 18:12:16,095 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 18:12:16,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 18:12:16,169 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:12:16,170 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [590560586] [2019-11-28 18:12:16,170 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 18:12:16,170 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-28 18:12:16,170 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1092354109] [2019-11-28 18:12:16,171 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-28 18:12:16,171 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 18:12:16,171 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-28 18:12:16,171 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 18:12:16,171 INFO L87 Difference]: Start difference. First operand 19944 states and 74317 transitions. Second operand 3 states. [2019-11-28 18:12:16,233 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 18:12:16,234 INFO L93 Difference]: Finished difference Result 11502 states and 37369 transitions. [2019-11-28 18:12:16,234 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-28 18:12:16,234 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 21 [2019-11-28 18:12:16,235 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 18:12:16,254 INFO L225 Difference]: With dead ends: 11502 [2019-11-28 18:12:16,255 INFO L226 Difference]: Without dead ends: 11502 [2019-11-28 18:12:16,255 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:12:16,305 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11502 states. [2019-11-28 18:12:16,448 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11502 to 11502. [2019-11-28 18:12:16,448 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11502 states. [2019-11-28 18:12:16,472 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11502 states to 11502 states and 37369 transitions. [2019-11-28 18:12:16,472 INFO L78 Accepts]: Start accepts. Automaton has 11502 states and 37369 transitions. Word has length 21 [2019-11-28 18:12:16,472 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 18:12:16,472 INFO L462 AbstractCegarLoop]: Abstraction has 11502 states and 37369 transitions. [2019-11-28 18:12:16,473 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-28 18:12:16,473 INFO L276 IsEmpty]: Start isEmpty. Operand 11502 states and 37369 transitions. [2019-11-28 18:12:16,477 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-11-28 18:12:16,477 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 18:12:16,478 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 18:12:16,478 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:12:16,478 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 18:12:16,478 INFO L82 PathProgramCache]: Analyzing trace with hash -1095736327, now seen corresponding path program 1 times [2019-11-28 18:12:16,478 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 18:12:16,478 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1655435406] [2019-11-28 18:12:16,479 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 18:12:16,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 18:12:16,561 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:12:16,562 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1655435406] [2019-11-28 18:12:16,562 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 18:12:16,562 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-28 18:12:16,562 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [587487527] [2019-11-28 18:12:16,563 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-28 18:12:16,563 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 18:12:16,563 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-28 18:12:16,563 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-11-28 18:12:16,563 INFO L87 Difference]: Start difference. First operand 11502 states and 37369 transitions. Second operand 5 states. [2019-11-28 18:12:16,700 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 18:12:16,700 INFO L93 Difference]: Finished difference Result 17709 states and 57631 transitions. [2019-11-28 18:12:16,701 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-28 18:12:16,701 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 22 [2019-11-28 18:12:16,701 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 18:12:16,721 INFO L225 Difference]: With dead ends: 17709 [2019-11-28 18:12:16,722 INFO L226 Difference]: Without dead ends: 9001 [2019-11-28 18:12:16,722 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-11-28 18:12:16,770 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9001 states. [2019-11-28 18:12:16,859 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9001 to 8952. [2019-11-28 18:12:16,859 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8952 states. [2019-11-28 18:12:17,467 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8952 states to 8952 states and 28931 transitions. [2019-11-28 18:12:17,468 INFO L78 Accepts]: Start accepts. Automaton has 8952 states and 28931 transitions. Word has length 22 [2019-11-28 18:12:17,468 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 18:12:17,468 INFO L462 AbstractCegarLoop]: Abstraction has 8952 states and 28931 transitions. [2019-11-28 18:12:17,468 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-28 18:12:17,468 INFO L276 IsEmpty]: Start isEmpty. Operand 8952 states and 28931 transitions. [2019-11-28 18:12:17,472 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-11-28 18:12:17,472 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 18:12:17,472 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 18:12:17,474 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:12:17,474 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 18:12:17,474 INFO L82 PathProgramCache]: Analyzing trace with hash -38213151, now seen corresponding path program 2 times [2019-11-28 18:12:17,474 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 18:12:17,475 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [778730717] [2019-11-28 18:12:17,475 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 18:12:17,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 18:12:17,523 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:12:17,523 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [778730717] [2019-11-28 18:12:17,523 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 18:12:17,523 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-28 18:12:17,524 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [221961496] [2019-11-28 18:12:17,524 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-28 18:12:17,524 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 18:12:17,524 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-28 18:12:17,525 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-28 18:12:17,525 INFO L87 Difference]: Start difference. First operand 8952 states and 28931 transitions. Second operand 4 states. [2019-11-28 18:12:17,551 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 18:12:17,552 INFO L93 Difference]: Finished difference Result 2139 states and 5647 transitions. [2019-11-28 18:12:17,552 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-28 18:12:17,552 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 22 [2019-11-28 18:12:17,552 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 18:12:17,556 INFO L225 Difference]: With dead ends: 2139 [2019-11-28 18:12:17,556 INFO L226 Difference]: Without dead ends: 2139 [2019-11-28 18:12:17,557 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:12:17,562 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2139 states. [2019-11-28 18:12:17,584 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2139 to 2139. [2019-11-28 18:12:17,584 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2139 states. [2019-11-28 18:12:17,589 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2139 states to 2139 states and 5647 transitions. [2019-11-28 18:12:17,590 INFO L78 Accepts]: Start accepts. Automaton has 2139 states and 5647 transitions. Word has length 22 [2019-11-28 18:12:17,590 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 18:12:17,590 INFO L462 AbstractCegarLoop]: Abstraction has 2139 states and 5647 transitions. [2019-11-28 18:12:17,590 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-28 18:12:17,590 INFO L276 IsEmpty]: Start isEmpty. Operand 2139 states and 5647 transitions. [2019-11-28 18:12:17,593 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2019-11-28 18:12:17,594 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 18:12:17,594 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:12:17,594 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:12:17,594 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 18:12:17,595 INFO L82 PathProgramCache]: Analyzing trace with hash 85752327, now seen corresponding path program 1 times [2019-11-28 18:12:17,595 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 18:12:17,595 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [68758258] [2019-11-28 18:12:17,595 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 18:12:17,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 18:12:17,664 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 18:12:17,666 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [68758258] [2019-11-28 18:12:17,666 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 18:12:17,666 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-28 18:12:17,666 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [531793420] [2019-11-28 18:12:17,667 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-28 18:12:17,667 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 18:12:17,667 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-28 18:12:17,667 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-28 18:12:17,667 INFO L87 Difference]: Start difference. First operand 2139 states and 5647 transitions. Second operand 5 states. [2019-11-28 18:12:17,869 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 18:12:17,870 INFO L93 Difference]: Finished difference Result 2884 states and 7387 transitions. [2019-11-28 18:12:17,870 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-11-28 18:12:17,871 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 29 [2019-11-28 18:12:17,871 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 18:12:17,876 INFO L225 Difference]: With dead ends: 2884 [2019-11-28 18:12:17,877 INFO L226 Difference]: Without dead ends: 2818 [2019-11-28 18:12:17,878 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:12:17,885 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2818 states. [2019-11-28 18:12:17,916 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2818 to 2193. [2019-11-28 18:12:17,916 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2193 states. [2019-11-28 18:12:17,921 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2193 states to 2193 states and 5754 transitions. [2019-11-28 18:12:17,922 INFO L78 Accepts]: Start accepts. Automaton has 2193 states and 5754 transitions. Word has length 29 [2019-11-28 18:12:17,922 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 18:12:17,922 INFO L462 AbstractCegarLoop]: Abstraction has 2193 states and 5754 transitions. [2019-11-28 18:12:17,922 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-28 18:12:17,922 INFO L276 IsEmpty]: Start isEmpty. Operand 2193 states and 5754 transitions. [2019-11-28 18:12:17,926 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2019-11-28 18:12:17,926 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 18:12:17,926 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:12:17,927 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:12:17,927 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 18:12:17,927 INFO L82 PathProgramCache]: Analyzing trace with hash 1377421728, now seen corresponding path program 1 times [2019-11-28 18:12:17,927 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 18:12:17,928 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [911301583] [2019-11-28 18:12:17,928 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 18:12:17,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 18:12:17,990 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:12:17,990 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [911301583] [2019-11-28 18:12:17,990 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 18:12:17,990 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-28 18:12:17,991 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2001191018] [2019-11-28 18:12:17,991 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-28 18:12:17,991 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 18:12:17,991 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-28 18:12:17,991 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 18:12:17,992 INFO L87 Difference]: Start difference. First operand 2193 states and 5754 transitions. Second operand 3 states. [2019-11-28 18:12:18,037 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 18:12:18,038 INFO L93 Difference]: Finished difference Result 2593 states and 6438 transitions. [2019-11-28 18:12:18,038 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-28 18:12:18,038 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 29 [2019-11-28 18:12:18,039 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 18:12:18,043 INFO L225 Difference]: With dead ends: 2593 [2019-11-28 18:12:18,044 INFO L226 Difference]: Without dead ends: 2593 [2019-11-28 18:12:18,045 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:12:18,052 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2593 states. [2019-11-28 18:12:18,077 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2593 to 2157. [2019-11-28 18:12:18,077 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2157 states. [2019-11-28 18:12:18,082 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2157 states to 2157 states and 5350 transitions. [2019-11-28 18:12:18,082 INFO L78 Accepts]: Start accepts. Automaton has 2157 states and 5350 transitions. Word has length 29 [2019-11-28 18:12:18,082 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 18:12:18,082 INFO L462 AbstractCegarLoop]: Abstraction has 2157 states and 5350 transitions. [2019-11-28 18:12:18,083 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-28 18:12:18,083 INFO L276 IsEmpty]: Start isEmpty. Operand 2157 states and 5350 transitions. [2019-11-28 18:12:18,085 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2019-11-28 18:12:18,085 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 18:12:18,086 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:12:18,086 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:12:18,087 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 18:12:18,087 INFO L82 PathProgramCache]: Analyzing trace with hash -834134890, now seen corresponding path program 1 times [2019-11-28 18:12:18,087 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 18:12:18,087 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1385183248] [2019-11-28 18:12:18,087 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 18:12:18,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 18:12:18,193 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:12:18,193 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1385183248] [2019-11-28 18:12:18,194 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 18:12:18,194 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-28 18:12:18,194 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [917537033] [2019-11-28 18:12:18,194 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-28 18:12:18,194 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 18:12:18,194 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-28 18:12:18,195 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-28 18:12:18,195 INFO L87 Difference]: Start difference. First operand 2157 states and 5350 transitions. Second operand 5 states. [2019-11-28 18:12:18,379 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 18:12:18,379 INFO L93 Difference]: Finished difference Result 2648 states and 6508 transitions. [2019-11-28 18:12:18,379 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-11-28 18:12:18,380 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 30 [2019-11-28 18:12:18,380 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 18:12:18,384 INFO L225 Difference]: With dead ends: 2648 [2019-11-28 18:12:18,384 INFO L226 Difference]: Without dead ends: 2565 [2019-11-28 18:12:18,384 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:12:18,390 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2565 states. [2019-11-28 18:12:18,406 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2565 to 2031. [2019-11-28 18:12:18,406 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2031 states. [2019-11-28 18:12:18,409 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2031 states to 2031 states and 5056 transitions. [2019-11-28 18:12:18,409 INFO L78 Accepts]: Start accepts. Automaton has 2031 states and 5056 transitions. Word has length 30 [2019-11-28 18:12:18,409 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 18:12:18,409 INFO L462 AbstractCegarLoop]: Abstraction has 2031 states and 5056 transitions. [2019-11-28 18:12:18,410 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-28 18:12:18,410 INFO L276 IsEmpty]: Start isEmpty. Operand 2031 states and 5056 transitions. [2019-11-28 18:12:18,412 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2019-11-28 18:12:18,412 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 18:12:18,412 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] [2019-11-28 18:12:18,412 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:12:18,412 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 18:12:18,412 INFO L82 PathProgramCache]: Analyzing trace with hash -1660300154, now seen corresponding path program 1 times [2019-11-28 18:12:18,413 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 18:12:18,413 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [246185370] [2019-11-28 18:12:18,413 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 18:12:18,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 18:12:18,472 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:12:18,473 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [246185370] [2019-11-28 18:12:18,473 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 18:12:18,473 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-28 18:12:18,473 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1234393839] [2019-11-28 18:12:18,474 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-28 18:12:18,474 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 18:12:18,474 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-28 18:12:18,474 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-11-28 18:12:18,474 INFO L87 Difference]: Start difference. First operand 2031 states and 5056 transitions. Second operand 5 states. [2019-11-28 18:12:18,512 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 18:12:18,512 INFO L93 Difference]: Finished difference Result 1223 states and 3152 transitions. [2019-11-28 18:12:18,513 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-28 18:12:18,513 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 31 [2019-11-28 18:12:18,513 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 18:12:18,515 INFO L225 Difference]: With dead ends: 1223 [2019-11-28 18:12:18,515 INFO L226 Difference]: Without dead ends: 1223 [2019-11-28 18:12:18,516 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:12:18,518 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1223 states. [2019-11-28 18:12:18,527 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1223 to 1223. [2019-11-28 18:12:18,527 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1223 states. [2019-11-28 18:12:18,529 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1223 states to 1223 states and 3152 transitions. [2019-11-28 18:12:18,530 INFO L78 Accepts]: Start accepts. Automaton has 1223 states and 3152 transitions. Word has length 31 [2019-11-28 18:12:18,530 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 18:12:18,530 INFO L462 AbstractCegarLoop]: Abstraction has 1223 states and 3152 transitions. [2019-11-28 18:12:18,530 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-28 18:12:18,530 INFO L276 IsEmpty]: Start isEmpty. Operand 1223 states and 3152 transitions. [2019-11-28 18:12:18,532 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2019-11-28 18:12:18,532 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 18:12:18,532 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:12:18,532 INFO L410 AbstractCegarLoop]: === Iteration 17 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 18:12:18,533 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 18:12:18,533 INFO L82 PathProgramCache]: Analyzing trace with hash 204691235, now seen corresponding path program 1 times [2019-11-28 18:12:18,533 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 18:12:18,533 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [587516200] [2019-11-28 18:12:18,533 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 18:12:18,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 18:12:18,666 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 18:12:18,666 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [587516200] [2019-11-28 18:12:18,667 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 18:12:18,667 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-11-28 18:12:18,667 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [673951689] [2019-11-28 18:12:18,668 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-11-28 18:12:18,668 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 18:12:18,668 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-11-28 18:12:18,669 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-11-28 18:12:18,669 INFO L87 Difference]: Start difference. First operand 1223 states and 3152 transitions. Second operand 7 states. [2019-11-28 18:12:18,974 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 18:12:18,974 INFO L93 Difference]: Finished difference Result 3339 states and 8535 transitions. [2019-11-28 18:12:18,974 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-11-28 18:12:18,975 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 45 [2019-11-28 18:12:18,975 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 18:12:18,979 INFO L225 Difference]: With dead ends: 3339 [2019-11-28 18:12:18,979 INFO L226 Difference]: Without dead ends: 2759 [2019-11-28 18:12:18,979 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=41, Invalid=115, Unknown=0, NotChecked=0, Total=156 [2019-11-28 18:12:18,984 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2759 states. [2019-11-28 18:12:19,001 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2759 to 1655. [2019-11-28 18:12:19,001 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1655 states. [2019-11-28 18:12:19,003 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1655 states to 1655 states and 4144 transitions. [2019-11-28 18:12:19,003 INFO L78 Accepts]: Start accepts. Automaton has 1655 states and 4144 transitions. Word has length 45 [2019-11-28 18:12:19,004 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 18:12:19,004 INFO L462 AbstractCegarLoop]: Abstraction has 1655 states and 4144 transitions. [2019-11-28 18:12:19,004 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-11-28 18:12:19,004 INFO L276 IsEmpty]: Start isEmpty. Operand 1655 states and 4144 transitions. [2019-11-28 18:12:19,006 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2019-11-28 18:12:19,006 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 18:12:19,006 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:12:19,006 INFO L410 AbstractCegarLoop]: === Iteration 18 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 18:12:19,007 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 18:12:19,007 INFO L82 PathProgramCache]: Analyzing trace with hash -162970969, now seen corresponding path program 2 times [2019-11-28 18:12:19,007 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 18:12:19,007 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [115677436] [2019-11-28 18:12:19,007 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 18:12:19,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 18:12:19,330 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:12:19,332 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [115677436] [2019-11-28 18:12:19,332 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 18:12:19,332 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2019-11-28 18:12:19,333 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [434194342] [2019-11-28 18:12:19,334 INFO L442 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-11-28 18:12:19,334 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 18:12:19,334 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-11-28 18:12:19,336 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=126, Unknown=0, NotChecked=0, Total=156 [2019-11-28 18:12:19,336 INFO L87 Difference]: Start difference. First operand 1655 states and 4144 transitions. Second operand 13 states. [2019-11-28 18:12:21,571 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 18:12:21,571 INFO L93 Difference]: Finished difference Result 3650 states and 8591 transitions. [2019-11-28 18:12:21,577 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2019-11-28 18:12:21,577 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 45 [2019-11-28 18:12:21,577 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 18:12:21,581 INFO L225 Difference]: With dead ends: 3650 [2019-11-28 18:12:21,582 INFO L226 Difference]: Without dead ends: 2583 [2019-11-28 18:12:21,583 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 1 SyntacticMatches, 2 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 227 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=249, Invalid=941, Unknown=0, NotChecked=0, Total=1190 [2019-11-28 18:12:21,588 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2583 states. [2019-11-28 18:12:21,610 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2583 to 1607. [2019-11-28 18:12:21,611 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1607 states. [2019-11-28 18:12:21,614 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1607 states to 1607 states and 4024 transitions. [2019-11-28 18:12:21,615 INFO L78 Accepts]: Start accepts. Automaton has 1607 states and 4024 transitions. Word has length 45 [2019-11-28 18:12:21,615 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 18:12:21,615 INFO L462 AbstractCegarLoop]: Abstraction has 1607 states and 4024 transitions. [2019-11-28 18:12:21,615 INFO L463 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-11-28 18:12:21,615 INFO L276 IsEmpty]: Start isEmpty. Operand 1607 states and 4024 transitions. [2019-11-28 18:12:21,619 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2019-11-28 18:12:21,619 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 18:12:21,619 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:12:21,620 INFO L410 AbstractCegarLoop]: === Iteration 19 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 18:12:21,621 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 18:12:21,621 INFO L82 PathProgramCache]: Analyzing trace with hash 664400937, now seen corresponding path program 3 times [2019-11-28 18:12:21,622 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 18:12:21,622 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1300854412] [2019-11-28 18:12:21,622 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 18:12:21,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 18:12:21,705 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:12:21,705 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1300854412] [2019-11-28 18:12:21,706 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 18:12:21,706 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-28 18:12:21,706 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1013916895] [2019-11-28 18:12:21,706 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-28 18:12:21,706 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 18:12:21,707 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-28 18:12:21,707 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-28 18:12:21,707 INFO L87 Difference]: Start difference. First operand 1607 states and 4024 transitions. Second operand 4 states. [2019-11-28 18:12:21,753 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 18:12:21,754 INFO L93 Difference]: Finished difference Result 2091 states and 5053 transitions. [2019-11-28 18:12:21,754 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-28 18:12:21,754 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 45 [2019-11-28 18:12:21,754 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 18:12:21,757 INFO L225 Difference]: With dead ends: 2091 [2019-11-28 18:12:21,758 INFO L226 Difference]: Without dead ends: 1703 [2019-11-28 18:12:21,758 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 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:12:21,761 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1703 states. [2019-11-28 18:12:21,777 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1703 to 1279. [2019-11-28 18:12:21,777 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1279 states. [2019-11-28 18:12:21,780 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1279 states to 1279 states and 3207 transitions. [2019-11-28 18:12:21,780 INFO L78 Accepts]: Start accepts. Automaton has 1279 states and 3207 transitions. Word has length 45 [2019-11-28 18:12:21,780 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 18:12:21,780 INFO L462 AbstractCegarLoop]: Abstraction has 1279 states and 3207 transitions. [2019-11-28 18:12:21,780 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-28 18:12:21,781 INFO L276 IsEmpty]: Start isEmpty. Operand 1279 states and 3207 transitions. [2019-11-28 18:12:21,783 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2019-11-28 18:12:21,783 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 18:12:21,783 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:12:21,783 INFO L410 AbstractCegarLoop]: === Iteration 20 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 18:12:21,784 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 18:12:21,784 INFO L82 PathProgramCache]: Analyzing trace with hash 1547697441, now seen corresponding path program 4 times [2019-11-28 18:12:21,784 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 18:12:21,784 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1576599983] [2019-11-28 18:12:21,784 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 18:12:21,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 18:12:21,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 18:12:21,912 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-28 18:12:21,913 INFO L475 BasicCegarLoop]: Counterexample might be feasible [2019-11-28 18:12:21,918 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [733] [733] ULTIMATE.startENTRY-->L832: Formula: (let ((.cse0 (store |v_#valid_74| 0 0))) (and (= (select .cse0 |v_ULTIMATE.start_main_~#t870~0.base_36|) 0) (= v_~z$mem_tmp~0_20 0) (= v_~z$w_buff0_used~0_485 0) (= 0 v_~__unbuffered_p1_EAX~0_42) (= v_~z$r_buff0_thd3~0_99 0) (= |v_#length_25| (store |v_#length_26| |v_ULTIMATE.start_main_~#t870~0.base_36| 4)) (= 0 v_~z$r_buff1_thd3~0_76) (= 0 v_~__unbuffered_p0_EAX~0_49) (= |v_#NULL.offset_3| 0) (= v_~z~0_140 0) (= v_~z$read_delayed~0_8 0) (= v_~z$r_buff1_thd2~0_143 0) (= v_~z$r_buff0_thd2~0_213 0) (< |v_#StackHeapBarrier_17| |v_ULTIMATE.start_main_~#t870~0.base_36|) (= v_~__unbuffered_cnt~0_109 0) (= v_~z$read_delayed_var~0.base_8 0) (< 0 |v_#StackHeapBarrier_17|) (= |v_#valid_72| (store .cse0 |v_ULTIMATE.start_main_~#t870~0.base_36| 1)) (= v_~b~0_40 0) (= v_~main$tmp_guard0~0_23 0) (= 0 v_~z$r_buff1_thd1~0_25) (= v_~__unbuffered_p1_EBX~0_70 0) (= v_~__unbuffered_p2_EBX~0_52 0) (= v_~y~0_15 0) (= v_~z$r_buff0_thd1~0_25 0) (= v_~z$w_buff1~0_118 0) (= v_~x~0_31 0) (= v_~main$tmp_guard1~0_38 0) (= 0 |v_ULTIMATE.start_main_~#t870~0.offset_25|) (= v_~a~0_24 0) (= 0 v_~z$flush_delayed~0_46) (= 0 |v_#NULL.base_3|) (= |v_#memory_int_17| (store |v_#memory_int_18| |v_ULTIMATE.start_main_~#t870~0.base_36| (store (select |v_#memory_int_18| |v_ULTIMATE.start_main_~#t870~0.base_36|) |v_ULTIMATE.start_main_~#t870~0.offset_25| 0))) (= 0 v_~weak$$choice2~0_95) (= 0 v_~weak$$choice0~0_13) (= v_~z$r_buff0_thd0~0_82 0) (= v_~z$read_delayed_var~0.offset_8 0) (= v_~z$w_buff0~0_173 0) (= 0 v_~__unbuffered_p2_EAX~0_52) (= v_~z$w_buff1_used~0_228 0) (= 0 v_~z$r_buff1_thd0~0_88))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_17|, #valid=|v_#valid_74|, #memory_int=|v_#memory_int_18|, #length=|v_#length_26|} OutVars{ULTIMATE.start_main_#t~nondet32=|v_ULTIMATE.start_main_#t~nondet32_10|, ULTIMATE.start_main_#t~nondet34=|v_ULTIMATE.start_main_#t~nondet34_21|, ~z$r_buff1_thd2~0=v_~z$r_buff1_thd2~0_143, #NULL.offset=|v_#NULL.offset_3|, ~a~0=v_~a~0_24, ~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_82, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_49, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_42, ULTIMATE.start_main_~#t870~0.offset=|v_ULTIMATE.start_main_~#t870~0.offset_25|, #length=|v_#length_25|, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_52, ULTIMATE.start_main_~#t870~0.base=|v_ULTIMATE.start_main_~#t870~0.base_36|, ULTIMATE.start_main_~#t871~0.base=|v_ULTIMATE.start_main_~#t871~0.base_31|, ~z$mem_tmp~0=v_~z$mem_tmp~0_20, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_52, ULTIMATE.start_main_#t~ite39=|v_ULTIMATE.start_main_#t~ite39_27|, ULTIMATE.start_main_#t~ite35=|v_ULTIMATE.start_main_#t~ite35_35|, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_228, ULTIMATE.start_main_#t~ite37=|v_ULTIMATE.start_main_#t~ite37_245|, ~z$flush_delayed~0=v_~z$flush_delayed~0_46, ~weak$$choice0~0=v_~weak$$choice0~0_13, #StackHeapBarrier=|v_#StackHeapBarrier_17|, ULTIMATE.start_main_#t~ite40=|v_ULTIMATE.start_main_#t~ite40_71|, ~z$r_buff1_thd1~0=v_~z$r_buff1_thd1~0_25, ~z$read_delayed_var~0.base=v_~z$read_delayed_var~0.base_8, ~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_99, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_109, ~x~0=v_~x~0_31, ULTIMATE.start_main_#t~nondet33=|v_ULTIMATE.start_main_#t~nondet33_10|, ULTIMATE.start_main_~#t871~0.offset=|v_ULTIMATE.start_main_~#t871~0.offset_19|, ~z$read_delayed~0=v_~z$read_delayed~0_8, ~z$w_buff1~0=v_~z$w_buff1~0_118, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_38, ~z$read_delayed_var~0.offset=v_~z$read_delayed_var~0.offset_8, ULTIMATE.start_main_~#t872~0.base=|v_ULTIMATE.start_main_~#t872~0.base_25|, ~z$r_buff1_thd0~0=v_~z$r_buff1_thd0~0_88, ~y~0=v_~y~0_15, ~z$r_buff0_thd2~0=v_~z$r_buff0_thd2~0_213, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_70, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_485, ~z$w_buff0~0=v_~z$w_buff0~0_173, ~z$r_buff1_thd3~0=v_~z$r_buff1_thd3~0_76, ULTIMATE.start_main_#t~ite36=|v_ULTIMATE.start_main_#t~ite36_29|, ULTIMATE.start_main_#t~ite38=|v_ULTIMATE.start_main_#t~ite38_37|, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_23, #NULL.base=|v_#NULL.base_3|, ULTIMATE.start_main_~#t872~0.offset=|v_ULTIMATE.start_main_~#t872~0.offset_19|, ~b~0=v_~b~0_40, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_24|, #valid=|v_#valid_72|, #memory_int=|v_#memory_int_17|, ~z~0=v_~z~0_140, ~weak$$choice2~0=v_~weak$$choice2~0_95, ~z$r_buff0_thd1~0=v_~z$r_buff0_thd1~0_25} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet32, ULTIMATE.start_main_#t~nondet34, ~z$r_buff1_thd2~0, #NULL.offset, ~a~0, ~z$r_buff0_thd0~0, ~__unbuffered_p0_EAX~0, ~__unbuffered_p1_EAX~0, ULTIMATE.start_main_~#t870~0.offset, #length, ~__unbuffered_p2_EAX~0, ULTIMATE.start_main_~#t870~0.base, ULTIMATE.start_main_~#t871~0.base, ~z$mem_tmp~0, ~__unbuffered_p2_EBX~0, ULTIMATE.start_main_#t~ite39, ULTIMATE.start_main_#t~ite35, ~z$w_buff1_used~0, ULTIMATE.start_main_#t~ite37, ~z$flush_delayed~0, ~weak$$choice0~0, ULTIMATE.start_main_#t~ite40, ~z$r_buff1_thd1~0, ~z$read_delayed_var~0.base, ~z$r_buff0_thd3~0, ~__unbuffered_cnt~0, ~x~0, ULTIMATE.start_main_#t~nondet33, ULTIMATE.start_main_~#t871~0.offset, ~z$read_delayed~0, ~z$w_buff1~0, ~main$tmp_guard1~0, ~z$read_delayed_var~0.offset, ULTIMATE.start_main_~#t872~0.base, ~z$r_buff1_thd0~0, ~y~0, ~z$r_buff0_thd2~0, ~__unbuffered_p1_EBX~0, ~z$w_buff0_used~0, ~z$w_buff0~0, ~z$r_buff1_thd3~0, ULTIMATE.start_main_#t~ite36, ULTIMATE.start_main_#t~ite38, ~main$tmp_guard0~0, #NULL.base, ULTIMATE.start_main_~#t872~0.offset, ~b~0, ULTIMATE.start_main_#res, #valid, #memory_int, ~z~0, ~weak$$choice2~0, ~z$r_buff0_thd1~0] because there is no mapped edge [2019-11-28 18:12:21,920 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [693] [693] L832-1-->L834: Formula: (and (= |v_ULTIMATE.start_main_~#t871~0.offset_9| 0) (< |v_#StackHeapBarrier_10| |v_ULTIMATE.start_main_~#t871~0.base_10|) (= |v_#length_13| (store |v_#length_14| |v_ULTIMATE.start_main_~#t871~0.base_10| 4)) (not (= 0 |v_ULTIMATE.start_main_~#t871~0.base_10|)) (= |v_#memory_int_7| (store |v_#memory_int_8| |v_ULTIMATE.start_main_~#t871~0.base_10| (store (select |v_#memory_int_8| |v_ULTIMATE.start_main_~#t871~0.base_10|) |v_ULTIMATE.start_main_~#t871~0.offset_9| 1))) (= 0 (select |v_#valid_30| |v_ULTIMATE.start_main_~#t871~0.base_10|)) (= |v_#valid_29| (store |v_#valid_30| |v_ULTIMATE.start_main_~#t871~0.base_10| 1))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_10|, #valid=|v_#valid_30|, #memory_int=|v_#memory_int_8|, #length=|v_#length_14|} OutVars{ULTIMATE.start_main_~#t871~0.base=|v_ULTIMATE.start_main_~#t871~0.base_10|, #StackHeapBarrier=|v_#StackHeapBarrier_10|, ULTIMATE.start_main_#t~nondet32=|v_ULTIMATE.start_main_#t~nondet32_5|, ULTIMATE.start_main_~#t871~0.offset=|v_ULTIMATE.start_main_~#t871~0.offset_9|, #valid=|v_#valid_29|, #memory_int=|v_#memory_int_7|, #length=|v_#length_13|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t871~0.base, ULTIMATE.start_main_#t~nondet32, ULTIMATE.start_main_~#t871~0.offset, #valid, #memory_int, #length] because there is no mapped edge [2019-11-28 18:12:21,922 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [704] [704] L834-1-->L836: Formula: (and (< |v_#StackHeapBarrier_12| |v_ULTIMATE.start_main_~#t872~0.base_13|) (= |v_#valid_35| (store |v_#valid_36| |v_ULTIMATE.start_main_~#t872~0.base_13| 1)) (= |v_#length_17| (store |v_#length_18| |v_ULTIMATE.start_main_~#t872~0.base_13| 4)) (= (store |v_#memory_int_10| |v_ULTIMATE.start_main_~#t872~0.base_13| (store (select |v_#memory_int_10| |v_ULTIMATE.start_main_~#t872~0.base_13|) |v_ULTIMATE.start_main_~#t872~0.offset_11| 2)) |v_#memory_int_9|) (not (= |v_ULTIMATE.start_main_~#t872~0.base_13| 0)) (= 0 |v_ULTIMATE.start_main_~#t872~0.offset_11|) (= 0 (select |v_#valid_36| |v_ULTIMATE.start_main_~#t872~0.base_13|))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_12|, #valid=|v_#valid_36|, #memory_int=|v_#memory_int_10|, #length=|v_#length_18|} OutVars{ULTIMATE.start_main_~#t872~0.offset=|v_ULTIMATE.start_main_~#t872~0.offset_11|, #StackHeapBarrier=|v_#StackHeapBarrier_12|, ULTIMATE.start_main_#t~nondet33=|v_ULTIMATE.start_main_#t~nondet33_6|, #valid=|v_#valid_35|, #memory_int=|v_#memory_int_9|, #length=|v_#length_17|, ULTIMATE.start_main_~#t872~0.base=|v_ULTIMATE.start_main_~#t872~0.base_13|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t872~0.offset, ULTIMATE.start_main_#t~nondet33, #valid, #memory_int, #length, ULTIMATE.start_main_~#t872~0.base] because there is no mapped edge [2019-11-28 18:12:21,925 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [711] [711] P2ENTRY-->L4-3: Formula: (and (not (= P2Thread1of1ForFork0___VERIFIER_assert_~expression_Out-949797929 0)) (= ~z$w_buff1_used~0_Out-949797929 ~z$w_buff0_used~0_In-949797929) (= P2Thread1of1ForFork0_~arg.base_Out-949797929 |P2Thread1of1ForFork0_#in~arg.base_In-949797929|) (= (ite (not (and (not (= 0 (mod ~z$w_buff0_used~0_Out-949797929 256))) (not (= (mod ~z$w_buff1_used~0_Out-949797929 256) 0)))) 1 0) |P2Thread1of1ForFork0___VERIFIER_assert_#in~expression_Out-949797929|) (= 1 ~z$w_buff0_used~0_Out-949797929) (= 1 ~z$w_buff0~0_Out-949797929) (= P2Thread1of1ForFork0___VERIFIER_assert_~expression_Out-949797929 |P2Thread1of1ForFork0___VERIFIER_assert_#in~expression_Out-949797929|) (= ~z$w_buff1~0_Out-949797929 ~z$w_buff0~0_In-949797929) (= |P2Thread1of1ForFork0_#in~arg.offset_In-949797929| P2Thread1of1ForFork0_~arg.offset_Out-949797929)) InVars {P2Thread1of1ForFork0_#in~arg.offset=|P2Thread1of1ForFork0_#in~arg.offset_In-949797929|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-949797929, ~z$w_buff0~0=~z$w_buff0~0_In-949797929, P2Thread1of1ForFork0_#in~arg.base=|P2Thread1of1ForFork0_#in~arg.base_In-949797929|} OutVars{P2Thread1of1ForFork0_~arg.base=P2Thread1of1ForFork0_~arg.base_Out-949797929, P2Thread1of1ForFork0___VERIFIER_assert_#in~expression=|P2Thread1of1ForFork0___VERIFIER_assert_#in~expression_Out-949797929|, P2Thread1of1ForFork0_#in~arg.offset=|P2Thread1of1ForFork0_#in~arg.offset_In-949797929|, ~z$w_buff0_used~0=~z$w_buff0_used~0_Out-949797929, ~z$w_buff0~0=~z$w_buff0~0_Out-949797929, P2Thread1of1ForFork0_~arg.offset=P2Thread1of1ForFork0_~arg.offset_Out-949797929, ~z$w_buff1_used~0=~z$w_buff1_used~0_Out-949797929, ~z$w_buff1~0=~z$w_buff1~0_Out-949797929, P2Thread1of1ForFork0_#in~arg.base=|P2Thread1of1ForFork0_#in~arg.base_In-949797929|, P2Thread1of1ForFork0___VERIFIER_assert_~expression=P2Thread1of1ForFork0___VERIFIER_assert_~expression_Out-949797929} AuxVars[] AssignedVars[P2Thread1of1ForFork0_~arg.base, P2Thread1of1ForFork0___VERIFIER_assert_#in~expression, ~z$w_buff0_used~0, ~z$w_buff0~0, P2Thread1of1ForFork0_~arg.offset, ~z$w_buff1_used~0, ~z$w_buff1~0, P2Thread1of1ForFork0___VERIFIER_assert_~expression] because there is no mapped edge [2019-11-28 18:12:21,926 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [692] [692] P0ENTRY-->P0EXIT: Formula: (and (= |v_P0Thread1of1ForFork1_#in~arg.base_13| v_P0Thread1of1ForFork1_~arg.base_11) (= v_~x~0_16 v_~__unbuffered_p0_EAX~0_17) (= 0 |v_P0Thread1of1ForFork1_#res.offset_7|) (= v_~__unbuffered_cnt~0_54 (+ v_~__unbuffered_cnt~0_55 1)) (= v_~b~0_23 1) (= 0 |v_P0Thread1of1ForFork1_#res.base_7|) (= v_P0Thread1of1ForFork1_~arg.offset_11 |v_P0Thread1of1ForFork1_#in~arg.offset_13|)) InVars {P0Thread1of1ForFork1_#in~arg.offset=|v_P0Thread1of1ForFork1_#in~arg.offset_13|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_55, P0Thread1of1ForFork1_#in~arg.base=|v_P0Thread1of1ForFork1_#in~arg.base_13|, ~x~0=v_~x~0_16} OutVars{~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_17, P0Thread1of1ForFork1_#res.offset=|v_P0Thread1of1ForFork1_#res.offset_7|, P0Thread1of1ForFork1_#in~arg.offset=|v_P0Thread1of1ForFork1_#in~arg.offset_13|, ~b~0=v_~b~0_23, P0Thread1of1ForFork1_#res.base=|v_P0Thread1of1ForFork1_#res.base_7|, P0Thread1of1ForFork1_~arg.offset=v_P0Thread1of1ForFork1_~arg.offset_11, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_54, P0Thread1of1ForFork1_#in~arg.base=|v_P0Thread1of1ForFork1_#in~arg.base_13|, ~x~0=v_~x~0_16, P0Thread1of1ForFork1_~arg.base=v_P0Thread1of1ForFork1_~arg.base_11} AuxVars[] AssignedVars[~__unbuffered_p0_EAX~0, P0Thread1of1ForFork1_#res.offset, ~b~0, P0Thread1of1ForFork1_#res.base, P0Thread1of1ForFork1_~arg.offset, ~__unbuffered_cnt~0, P0Thread1of1ForFork1_~arg.base] because there is no mapped edge [2019-11-28 18:12:21,931 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [675] [675] L810-->L810-2: Formula: (let ((.cse1 (= (mod ~z$w_buff0_used~0_In709708081 256) 0)) (.cse0 (= (mod ~z$r_buff0_thd3~0_In709708081 256) 0))) (or (and (not .cse0) (= |P2Thread1of1ForFork0_#t~ite28_Out709708081| 0) (not .cse1)) (and (or .cse1 .cse0) (= ~z$w_buff0_used~0_In709708081 |P2Thread1of1ForFork0_#t~ite28_Out709708081|)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In709708081, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In709708081} OutVars{P2Thread1of1ForFork0_#t~ite28=|P2Thread1of1ForFork0_#t~ite28_Out709708081|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In709708081, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In709708081} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite28] because there is no mapped edge [2019-11-28 18:12:21,932 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [682] [682] L811-->L811-2: Formula: (let ((.cse0 (= (mod ~z$w_buff0_used~0_In-1782346150 256) 0)) (.cse1 (= (mod ~z$r_buff0_thd3~0_In-1782346150 256) 0)) (.cse3 (= 0 (mod ~z$r_buff1_thd3~0_In-1782346150 256))) (.cse2 (= 0 (mod ~z$w_buff1_used~0_In-1782346150 256)))) (or (and (or .cse0 .cse1) (or .cse2 .cse3) (= ~z$w_buff1_used~0_In-1782346150 |P2Thread1of1ForFork0_#t~ite29_Out-1782346150|)) (and (= |P2Thread1of1ForFork0_#t~ite29_Out-1782346150| 0) (or (and (not .cse0) (not .cse1)) (and (not .cse3) (not .cse2)))))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-1782346150, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In-1782346150, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1782346150, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-1782346150} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In-1782346150, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In-1782346150, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1782346150, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-1782346150, P2Thread1of1ForFork0_#t~ite29=|P2Thread1of1ForFork0_#t~ite29_Out-1782346150|} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite29] because there is no mapped edge [2019-11-28 18:12:21,934 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [674] [674] L812-->L813: Formula: (let ((.cse0 (= (mod ~z$r_buff0_thd3~0_In1269752360 256) 0)) (.cse2 (= (mod ~z$w_buff0_used~0_In1269752360 256) 0)) (.cse1 (= ~z$r_buff0_thd3~0_In1269752360 ~z$r_buff0_thd3~0_Out1269752360))) (or (and .cse0 .cse1) (and (not .cse0) (not .cse2) (= 0 ~z$r_buff0_thd3~0_Out1269752360)) (and .cse2 .cse1))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In1269752360, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In1269752360} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In1269752360, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_Out1269752360, P2Thread1of1ForFork0_#t~ite30=|P2Thread1of1ForFork0_#t~ite30_Out1269752360|} AuxVars[] AssignedVars[~z$r_buff0_thd3~0, P2Thread1of1ForFork0_#t~ite30] because there is no mapped edge [2019-11-28 18:12:21,935 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [680] [680] L813-->L813-2: Formula: (let ((.cse2 (= (mod ~z$w_buff1_used~0_In1236746125 256) 0)) (.cse3 (= 0 (mod ~z$r_buff1_thd3~0_In1236746125 256))) (.cse1 (= 0 (mod ~z$w_buff0_used~0_In1236746125 256))) (.cse0 (= (mod ~z$r_buff0_thd3~0_In1236746125 256) 0))) (or (and (= |P2Thread1of1ForFork0_#t~ite31_Out1236746125| 0) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse2 .cse3) (or .cse1 .cse0) (= |P2Thread1of1ForFork0_#t~ite31_Out1236746125| ~z$r_buff1_thd3~0_In1236746125)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In1236746125, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In1236746125, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1236746125, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In1236746125} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In1236746125, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In1236746125, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1236746125, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In1236746125, P2Thread1of1ForFork0_#t~ite31=|P2Thread1of1ForFork0_#t~ite31_Out1236746125|} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite31] because there is no mapped edge [2019-11-28 18:12:21,935 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [707] [707] L813-2-->P2EXIT: Formula: (and (= v_~__unbuffered_cnt~0_102 (+ v_~__unbuffered_cnt~0_103 1)) (= |v_P2Thread1of1ForFork0_#res.base_3| 0) (= v_~z$r_buff1_thd3~0_63 |v_P2Thread1of1ForFork0_#t~ite31_50|) (= |v_P2Thread1of1ForFork0_#res.offset_3| 0)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_103, P2Thread1of1ForFork0_#t~ite31=|v_P2Thread1of1ForFork0_#t~ite31_50|} OutVars{P2Thread1of1ForFork0_#res.base=|v_P2Thread1of1ForFork0_#res.base_3|, ~z$r_buff1_thd3~0=v_~z$r_buff1_thd3~0_63, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_102, P2Thread1of1ForFork0_#t~ite31=|v_P2Thread1of1ForFork0_#t~ite31_49|, P2Thread1of1ForFork0_#res.offset=|v_P2Thread1of1ForFork0_#res.offset_3|} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#res.base, ~z$r_buff1_thd3~0, ~__unbuffered_cnt~0, P2Thread1of1ForFork0_#t~ite31, P2Thread1of1ForFork0_#res.offset] because there is no mapped edge [2019-11-28 18:12:21,941 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [668] [668] L772-->L773: Formula: (and (not (= (mod v_~weak$$choice2~0_40 256) 0)) (= v_~z$r_buff0_thd2~0_102 v_~z$r_buff0_thd2~0_101)) InVars {~weak$$choice2~0=v_~weak$$choice2~0_40, ~z$r_buff0_thd2~0=v_~z$r_buff0_thd2~0_102} OutVars{P1Thread1of1ForFork2_#t~ite19=|v_P1Thread1of1ForFork2_#t~ite19_16|, P1Thread1of1ForFork2_#t~ite20=|v_P1Thread1of1ForFork2_#t~ite20_10|, P1Thread1of1ForFork2_#t~ite21=|v_P1Thread1of1ForFork2_#t~ite21_7|, ~weak$$choice2~0=v_~weak$$choice2~0_40, ~z$r_buff0_thd2~0=v_~z$r_buff0_thd2~0_101} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#t~ite19, P1Thread1of1ForFork2_#t~ite20, P1Thread1of1ForFork2_#t~ite21, ~z$r_buff0_thd2~0] because there is no mapped edge [2019-11-28 18:12:21,943 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [618] [618] L775-->L783: Formula: (and (= v_~__unbuffered_cnt~0_14 (+ v_~__unbuffered_cnt~0_15 1)) (= 0 v_~z$flush_delayed~0_10) (not (= (mod v_~z$flush_delayed~0_11 256) 0)) (= v_~z~0_23 v_~z$mem_tmp~0_4)) InVars {~z$mem_tmp~0=v_~z$mem_tmp~0_4, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_15, ~z$flush_delayed~0=v_~z$flush_delayed~0_11} OutVars{~z$mem_tmp~0=v_~z$mem_tmp~0_4, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_14, ~z$flush_delayed~0=v_~z$flush_delayed~0_10, ~z~0=v_~z~0_23, P1Thread1of1ForFork2_#t~ite25=|v_P1Thread1of1ForFork2_#t~ite25_11|} AuxVars[] AssignedVars[~__unbuffered_cnt~0, ~z$flush_delayed~0, ~z~0, P1Thread1of1ForFork2_#t~ite25] because there is no mapped edge [2019-11-28 18:12:21,943 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [648] [648] L836-1-->L842: Formula: (and (= v_~main$tmp_guard0~0_7 (ite (= 0 (ite (= 3 v_~__unbuffered_cnt~0_32) 1 0)) 0 1)) (not (= (mod v_~main$tmp_guard0~0_7 256) 0))) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_32} OutVars{ULTIMATE.start_main_#t~nondet34=|v_ULTIMATE.start_main_#t~nondet34_6|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_32, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_7} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet34, ~main$tmp_guard0~0] because there is no mapped edge [2019-11-28 18:12:21,944 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [683] [683] L842-2-->L842-4: Formula: (let ((.cse1 (= 0 (mod ~z$w_buff1_used~0_In209426420 256))) (.cse0 (= 0 (mod ~z$r_buff1_thd0~0_In209426420 256)))) (or (and (not .cse0) (not .cse1) (= ~z$w_buff1~0_In209426420 |ULTIMATE.start_main_#t~ite35_Out209426420|)) (and (= ~z~0_In209426420 |ULTIMATE.start_main_#t~ite35_Out209426420|) (or .cse1 .cse0)))) InVars {~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In209426420, ~z$w_buff1_used~0=~z$w_buff1_used~0_In209426420, ~z$w_buff1~0=~z$w_buff1~0_In209426420, ~z~0=~z~0_In209426420} OutVars{~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In209426420, ULTIMATE.start_main_#t~ite35=|ULTIMATE.start_main_#t~ite35_Out209426420|, ~z$w_buff1_used~0=~z$w_buff1_used~0_In209426420, ~z$w_buff1~0=~z$w_buff1~0_In209426420, ~z~0=~z~0_In209426420} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite35] because there is no mapped edge [2019-11-28 18:12:21,944 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [604] [604] L842-4-->L843: Formula: (= v_~z~0_12 |v_ULTIMATE.start_main_#t~ite35_7|) InVars {ULTIMATE.start_main_#t~ite35=|v_ULTIMATE.start_main_#t~ite35_7|} OutVars{ULTIMATE.start_main_#t~ite35=|v_ULTIMATE.start_main_#t~ite35_6|, ULTIMATE.start_main_#t~ite36=|v_ULTIMATE.start_main_#t~ite36_6|, ~z~0=v_~z~0_12} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite35, ULTIMATE.start_main_#t~ite36, ~z~0] because there is no mapped edge [2019-11-28 18:12:21,944 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [671] [671] L843-->L843-2: Formula: (let ((.cse1 (= (mod ~z$r_buff0_thd0~0_In-807490732 256) 0)) (.cse0 (= 0 (mod ~z$w_buff0_used~0_In-807490732 256)))) (or (and (or .cse0 .cse1) (= ~z$w_buff0_used~0_In-807490732 |ULTIMATE.start_main_#t~ite37_Out-807490732|)) (and (not .cse1) (not .cse0) (= 0 |ULTIMATE.start_main_#t~ite37_Out-807490732|)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-807490732, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-807490732} OutVars{~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-807490732, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-807490732, ULTIMATE.start_main_#t~ite37=|ULTIMATE.start_main_#t~ite37_Out-807490732|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite37] because there is no mapped edge [2019-11-28 18:12:21,945 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [676] [676] L844-->L844-2: Formula: (let ((.cse3 (= 0 (mod ~z$r_buff0_thd0~0_In-562099989 256))) (.cse2 (= 0 (mod ~z$w_buff0_used~0_In-562099989 256))) (.cse0 (= 0 (mod ~z$w_buff1_used~0_In-562099989 256))) (.cse1 (= 0 (mod ~z$r_buff1_thd0~0_In-562099989 256)))) (or (and (= 0 |ULTIMATE.start_main_#t~ite38_Out-562099989|) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse3 .cse2) (= ~z$w_buff1_used~0_In-562099989 |ULTIMATE.start_main_#t~ite38_Out-562099989|) (or .cse0 .cse1)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-562099989, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-562099989, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In-562099989, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-562099989} OutVars{~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-562099989, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-562099989, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In-562099989, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-562099989, ULTIMATE.start_main_#t~ite38=|ULTIMATE.start_main_#t~ite38_Out-562099989|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite38] because there is no mapped edge [2019-11-28 18:12:21,946 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [685] [685] L845-->L845-2: Formula: (let ((.cse1 (= 0 (mod ~z$r_buff0_thd0~0_In-1629912439 256))) (.cse0 (= 0 (mod ~z$w_buff0_used~0_In-1629912439 256)))) (or (and (= |ULTIMATE.start_main_#t~ite39_Out-1629912439| 0) (not .cse0) (not .cse1)) (and (or .cse1 .cse0) (= |ULTIMATE.start_main_#t~ite39_Out-1629912439| ~z$r_buff0_thd0~0_In-1629912439)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-1629912439, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1629912439} OutVars{~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-1629912439, ULTIMATE.start_main_#t~ite39=|ULTIMATE.start_main_#t~ite39_Out-1629912439|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1629912439} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite39] because there is no mapped edge [2019-11-28 18:12:21,947 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [677] [677] L846-->L846-2: Formula: (let ((.cse0 (= (mod ~z$w_buff1_used~0_In1503786847 256) 0)) (.cse1 (= 0 (mod ~z$r_buff1_thd0~0_In1503786847 256))) (.cse3 (= 0 (mod ~z$r_buff0_thd0~0_In1503786847 256))) (.cse2 (= 0 (mod ~z$w_buff0_used~0_In1503786847 256)))) (or (and (= 0 |ULTIMATE.start_main_#t~ite40_Out1503786847|) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse0 .cse1) (= |ULTIMATE.start_main_#t~ite40_Out1503786847| ~z$r_buff1_thd0~0_In1503786847) (or .cse3 .cse2)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In1503786847, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1503786847, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In1503786847, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1503786847} OutVars{~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In1503786847, ULTIMATE.start_main_#t~ite40=|ULTIMATE.start_main_#t~ite40_Out1503786847|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1503786847, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In1503786847, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1503786847} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite40] because there is no mapped edge [2019-11-28 18:12:21,947 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [723] [723] L846-2-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= v_ULTIMATE.start___VERIFIER_assert_~expression_21 |v_ULTIMATE.start___VERIFIER_assert_#in~expression_15|) (= v_ULTIMATE.start___VERIFIER_assert_~expression_21 0) (= |v_ULTIMATE.start_main_#t~ite40_42| v_~z$r_buff1_thd0~0_71) (= v_~main$tmp_guard1~0_21 (ite (= 0 (ite (not (and (= v_~__unbuffered_p2_EBX~0_35 0) (= v_~__unbuffered_p1_EBX~0_48 0) (= 1 v_~__unbuffered_p1_EAX~0_25) (= 0 v_~__unbuffered_p0_EAX~0_35) (= 1 v_~__unbuffered_p2_EAX~0_35))) 1 0)) 0 1)) (= |v_ULTIMATE.start___VERIFIER_assert_#in~expression_15| (mod v_~main$tmp_guard1~0_21 256))) InVars {~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_35, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_48, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_35, ULTIMATE.start_main_#t~ite40=|v_ULTIMATE.start_main_#t~ite40_42|, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_25, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_35} OutVars{~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_35, ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_21, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_48, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_35, ULTIMATE.start_main_#t~ite40=|v_ULTIMATE.start_main_#t~ite40_41|, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_25, ~z$r_buff1_thd0~0=v_~z$r_buff1_thd0~0_71, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_21, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_35, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_15|} AuxVars[] AssignedVars[ULTIMATE.start___VERIFIER_assert_~expression, ULTIMATE.start_main_#t~ite40, ~z$r_buff1_thd0~0, ~main$tmp_guard1~0, ULTIMATE.start___VERIFIER_assert_#in~expression] because there is no mapped edge [2019-11-28 18:12:22,105 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 28.11 06:12:22 BasicIcfg [2019-11-28 18:12:22,107 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-11-28 18:12:22,108 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-11-28 18:12:22,109 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-11-28 18:12:22,109 INFO L275 PluginConnector]: Witness Printer initialized [2019-11-28 18:12:22,110 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 06:11:57" (3/4) ... [2019-11-28 18:12:22,113 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2019-11-28 18:12:22,118 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [733] [733] ULTIMATE.startENTRY-->L832: Formula: (let ((.cse0 (store |v_#valid_74| 0 0))) (and (= (select .cse0 |v_ULTIMATE.start_main_~#t870~0.base_36|) 0) (= v_~z$mem_tmp~0_20 0) (= v_~z$w_buff0_used~0_485 0) (= 0 v_~__unbuffered_p1_EAX~0_42) (= v_~z$r_buff0_thd3~0_99 0) (= |v_#length_25| (store |v_#length_26| |v_ULTIMATE.start_main_~#t870~0.base_36| 4)) (= 0 v_~z$r_buff1_thd3~0_76) (= 0 v_~__unbuffered_p0_EAX~0_49) (= |v_#NULL.offset_3| 0) (= v_~z~0_140 0) (= v_~z$read_delayed~0_8 0) (= v_~z$r_buff1_thd2~0_143 0) (= v_~z$r_buff0_thd2~0_213 0) (< |v_#StackHeapBarrier_17| |v_ULTIMATE.start_main_~#t870~0.base_36|) (= v_~__unbuffered_cnt~0_109 0) (= v_~z$read_delayed_var~0.base_8 0) (< 0 |v_#StackHeapBarrier_17|) (= |v_#valid_72| (store .cse0 |v_ULTIMATE.start_main_~#t870~0.base_36| 1)) (= v_~b~0_40 0) (= v_~main$tmp_guard0~0_23 0) (= 0 v_~z$r_buff1_thd1~0_25) (= v_~__unbuffered_p1_EBX~0_70 0) (= v_~__unbuffered_p2_EBX~0_52 0) (= v_~y~0_15 0) (= v_~z$r_buff0_thd1~0_25 0) (= v_~z$w_buff1~0_118 0) (= v_~x~0_31 0) (= v_~main$tmp_guard1~0_38 0) (= 0 |v_ULTIMATE.start_main_~#t870~0.offset_25|) (= v_~a~0_24 0) (= 0 v_~z$flush_delayed~0_46) (= 0 |v_#NULL.base_3|) (= |v_#memory_int_17| (store |v_#memory_int_18| |v_ULTIMATE.start_main_~#t870~0.base_36| (store (select |v_#memory_int_18| |v_ULTIMATE.start_main_~#t870~0.base_36|) |v_ULTIMATE.start_main_~#t870~0.offset_25| 0))) (= 0 v_~weak$$choice2~0_95) (= 0 v_~weak$$choice0~0_13) (= v_~z$r_buff0_thd0~0_82 0) (= v_~z$read_delayed_var~0.offset_8 0) (= v_~z$w_buff0~0_173 0) (= 0 v_~__unbuffered_p2_EAX~0_52) (= v_~z$w_buff1_used~0_228 0) (= 0 v_~z$r_buff1_thd0~0_88))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_17|, #valid=|v_#valid_74|, #memory_int=|v_#memory_int_18|, #length=|v_#length_26|} OutVars{ULTIMATE.start_main_#t~nondet32=|v_ULTIMATE.start_main_#t~nondet32_10|, ULTIMATE.start_main_#t~nondet34=|v_ULTIMATE.start_main_#t~nondet34_21|, ~z$r_buff1_thd2~0=v_~z$r_buff1_thd2~0_143, #NULL.offset=|v_#NULL.offset_3|, ~a~0=v_~a~0_24, ~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_82, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_49, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_42, ULTIMATE.start_main_~#t870~0.offset=|v_ULTIMATE.start_main_~#t870~0.offset_25|, #length=|v_#length_25|, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_52, ULTIMATE.start_main_~#t870~0.base=|v_ULTIMATE.start_main_~#t870~0.base_36|, ULTIMATE.start_main_~#t871~0.base=|v_ULTIMATE.start_main_~#t871~0.base_31|, ~z$mem_tmp~0=v_~z$mem_tmp~0_20, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_52, ULTIMATE.start_main_#t~ite39=|v_ULTIMATE.start_main_#t~ite39_27|, ULTIMATE.start_main_#t~ite35=|v_ULTIMATE.start_main_#t~ite35_35|, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_228, ULTIMATE.start_main_#t~ite37=|v_ULTIMATE.start_main_#t~ite37_245|, ~z$flush_delayed~0=v_~z$flush_delayed~0_46, ~weak$$choice0~0=v_~weak$$choice0~0_13, #StackHeapBarrier=|v_#StackHeapBarrier_17|, ULTIMATE.start_main_#t~ite40=|v_ULTIMATE.start_main_#t~ite40_71|, ~z$r_buff1_thd1~0=v_~z$r_buff1_thd1~0_25, ~z$read_delayed_var~0.base=v_~z$read_delayed_var~0.base_8, ~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_99, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_109, ~x~0=v_~x~0_31, ULTIMATE.start_main_#t~nondet33=|v_ULTIMATE.start_main_#t~nondet33_10|, ULTIMATE.start_main_~#t871~0.offset=|v_ULTIMATE.start_main_~#t871~0.offset_19|, ~z$read_delayed~0=v_~z$read_delayed~0_8, ~z$w_buff1~0=v_~z$w_buff1~0_118, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_38, ~z$read_delayed_var~0.offset=v_~z$read_delayed_var~0.offset_8, ULTIMATE.start_main_~#t872~0.base=|v_ULTIMATE.start_main_~#t872~0.base_25|, ~z$r_buff1_thd0~0=v_~z$r_buff1_thd0~0_88, ~y~0=v_~y~0_15, ~z$r_buff0_thd2~0=v_~z$r_buff0_thd2~0_213, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_70, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_485, ~z$w_buff0~0=v_~z$w_buff0~0_173, ~z$r_buff1_thd3~0=v_~z$r_buff1_thd3~0_76, ULTIMATE.start_main_#t~ite36=|v_ULTIMATE.start_main_#t~ite36_29|, ULTIMATE.start_main_#t~ite38=|v_ULTIMATE.start_main_#t~ite38_37|, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_23, #NULL.base=|v_#NULL.base_3|, ULTIMATE.start_main_~#t872~0.offset=|v_ULTIMATE.start_main_~#t872~0.offset_19|, ~b~0=v_~b~0_40, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_24|, #valid=|v_#valid_72|, #memory_int=|v_#memory_int_17|, ~z~0=v_~z~0_140, ~weak$$choice2~0=v_~weak$$choice2~0_95, ~z$r_buff0_thd1~0=v_~z$r_buff0_thd1~0_25} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet32, ULTIMATE.start_main_#t~nondet34, ~z$r_buff1_thd2~0, #NULL.offset, ~a~0, ~z$r_buff0_thd0~0, ~__unbuffered_p0_EAX~0, ~__unbuffered_p1_EAX~0, ULTIMATE.start_main_~#t870~0.offset, #length, ~__unbuffered_p2_EAX~0, ULTIMATE.start_main_~#t870~0.base, ULTIMATE.start_main_~#t871~0.base, ~z$mem_tmp~0, ~__unbuffered_p2_EBX~0, ULTIMATE.start_main_#t~ite39, ULTIMATE.start_main_#t~ite35, ~z$w_buff1_used~0, ULTIMATE.start_main_#t~ite37, ~z$flush_delayed~0, ~weak$$choice0~0, ULTIMATE.start_main_#t~ite40, ~z$r_buff1_thd1~0, ~z$read_delayed_var~0.base, ~z$r_buff0_thd3~0, ~__unbuffered_cnt~0, ~x~0, ULTIMATE.start_main_#t~nondet33, ULTIMATE.start_main_~#t871~0.offset, ~z$read_delayed~0, ~z$w_buff1~0, ~main$tmp_guard1~0, ~z$read_delayed_var~0.offset, ULTIMATE.start_main_~#t872~0.base, ~z$r_buff1_thd0~0, ~y~0, ~z$r_buff0_thd2~0, ~__unbuffered_p1_EBX~0, ~z$w_buff0_used~0, ~z$w_buff0~0, ~z$r_buff1_thd3~0, ULTIMATE.start_main_#t~ite36, ULTIMATE.start_main_#t~ite38, ~main$tmp_guard0~0, #NULL.base, ULTIMATE.start_main_~#t872~0.offset, ~b~0, ULTIMATE.start_main_#res, #valid, #memory_int, ~z~0, ~weak$$choice2~0, ~z$r_buff0_thd1~0] because there is no mapped edge [2019-11-28 18:12:22,119 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [693] [693] L832-1-->L834: Formula: (and (= |v_ULTIMATE.start_main_~#t871~0.offset_9| 0) (< |v_#StackHeapBarrier_10| |v_ULTIMATE.start_main_~#t871~0.base_10|) (= |v_#length_13| (store |v_#length_14| |v_ULTIMATE.start_main_~#t871~0.base_10| 4)) (not (= 0 |v_ULTIMATE.start_main_~#t871~0.base_10|)) (= |v_#memory_int_7| (store |v_#memory_int_8| |v_ULTIMATE.start_main_~#t871~0.base_10| (store (select |v_#memory_int_8| |v_ULTIMATE.start_main_~#t871~0.base_10|) |v_ULTIMATE.start_main_~#t871~0.offset_9| 1))) (= 0 (select |v_#valid_30| |v_ULTIMATE.start_main_~#t871~0.base_10|)) (= |v_#valid_29| (store |v_#valid_30| |v_ULTIMATE.start_main_~#t871~0.base_10| 1))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_10|, #valid=|v_#valid_30|, #memory_int=|v_#memory_int_8|, #length=|v_#length_14|} OutVars{ULTIMATE.start_main_~#t871~0.base=|v_ULTIMATE.start_main_~#t871~0.base_10|, #StackHeapBarrier=|v_#StackHeapBarrier_10|, ULTIMATE.start_main_#t~nondet32=|v_ULTIMATE.start_main_#t~nondet32_5|, ULTIMATE.start_main_~#t871~0.offset=|v_ULTIMATE.start_main_~#t871~0.offset_9|, #valid=|v_#valid_29|, #memory_int=|v_#memory_int_7|, #length=|v_#length_13|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t871~0.base, ULTIMATE.start_main_#t~nondet32, ULTIMATE.start_main_~#t871~0.offset, #valid, #memory_int, #length] because there is no mapped edge [2019-11-28 18:12:22,119 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [704] [704] L834-1-->L836: Formula: (and (< |v_#StackHeapBarrier_12| |v_ULTIMATE.start_main_~#t872~0.base_13|) (= |v_#valid_35| (store |v_#valid_36| |v_ULTIMATE.start_main_~#t872~0.base_13| 1)) (= |v_#length_17| (store |v_#length_18| |v_ULTIMATE.start_main_~#t872~0.base_13| 4)) (= (store |v_#memory_int_10| |v_ULTIMATE.start_main_~#t872~0.base_13| (store (select |v_#memory_int_10| |v_ULTIMATE.start_main_~#t872~0.base_13|) |v_ULTIMATE.start_main_~#t872~0.offset_11| 2)) |v_#memory_int_9|) (not (= |v_ULTIMATE.start_main_~#t872~0.base_13| 0)) (= 0 |v_ULTIMATE.start_main_~#t872~0.offset_11|) (= 0 (select |v_#valid_36| |v_ULTIMATE.start_main_~#t872~0.base_13|))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_12|, #valid=|v_#valid_36|, #memory_int=|v_#memory_int_10|, #length=|v_#length_18|} OutVars{ULTIMATE.start_main_~#t872~0.offset=|v_ULTIMATE.start_main_~#t872~0.offset_11|, #StackHeapBarrier=|v_#StackHeapBarrier_12|, ULTIMATE.start_main_#t~nondet33=|v_ULTIMATE.start_main_#t~nondet33_6|, #valid=|v_#valid_35|, #memory_int=|v_#memory_int_9|, #length=|v_#length_17|, ULTIMATE.start_main_~#t872~0.base=|v_ULTIMATE.start_main_~#t872~0.base_13|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t872~0.offset, ULTIMATE.start_main_#t~nondet33, #valid, #memory_int, #length, ULTIMATE.start_main_~#t872~0.base] because there is no mapped edge [2019-11-28 18:12:22,120 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [711] [711] P2ENTRY-->L4-3: Formula: (and (not (= P2Thread1of1ForFork0___VERIFIER_assert_~expression_Out-949797929 0)) (= ~z$w_buff1_used~0_Out-949797929 ~z$w_buff0_used~0_In-949797929) (= P2Thread1of1ForFork0_~arg.base_Out-949797929 |P2Thread1of1ForFork0_#in~arg.base_In-949797929|) (= (ite (not (and (not (= 0 (mod ~z$w_buff0_used~0_Out-949797929 256))) (not (= (mod ~z$w_buff1_used~0_Out-949797929 256) 0)))) 1 0) |P2Thread1of1ForFork0___VERIFIER_assert_#in~expression_Out-949797929|) (= 1 ~z$w_buff0_used~0_Out-949797929) (= 1 ~z$w_buff0~0_Out-949797929) (= P2Thread1of1ForFork0___VERIFIER_assert_~expression_Out-949797929 |P2Thread1of1ForFork0___VERIFIER_assert_#in~expression_Out-949797929|) (= ~z$w_buff1~0_Out-949797929 ~z$w_buff0~0_In-949797929) (= |P2Thread1of1ForFork0_#in~arg.offset_In-949797929| P2Thread1of1ForFork0_~arg.offset_Out-949797929)) InVars {P2Thread1of1ForFork0_#in~arg.offset=|P2Thread1of1ForFork0_#in~arg.offset_In-949797929|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-949797929, ~z$w_buff0~0=~z$w_buff0~0_In-949797929, P2Thread1of1ForFork0_#in~arg.base=|P2Thread1of1ForFork0_#in~arg.base_In-949797929|} OutVars{P2Thread1of1ForFork0_~arg.base=P2Thread1of1ForFork0_~arg.base_Out-949797929, P2Thread1of1ForFork0___VERIFIER_assert_#in~expression=|P2Thread1of1ForFork0___VERIFIER_assert_#in~expression_Out-949797929|, P2Thread1of1ForFork0_#in~arg.offset=|P2Thread1of1ForFork0_#in~arg.offset_In-949797929|, ~z$w_buff0_used~0=~z$w_buff0_used~0_Out-949797929, ~z$w_buff0~0=~z$w_buff0~0_Out-949797929, P2Thread1of1ForFork0_~arg.offset=P2Thread1of1ForFork0_~arg.offset_Out-949797929, ~z$w_buff1_used~0=~z$w_buff1_used~0_Out-949797929, ~z$w_buff1~0=~z$w_buff1~0_Out-949797929, P2Thread1of1ForFork0_#in~arg.base=|P2Thread1of1ForFork0_#in~arg.base_In-949797929|, P2Thread1of1ForFork0___VERIFIER_assert_~expression=P2Thread1of1ForFork0___VERIFIER_assert_~expression_Out-949797929} AuxVars[] AssignedVars[P2Thread1of1ForFork0_~arg.base, P2Thread1of1ForFork0___VERIFIER_assert_#in~expression, ~z$w_buff0_used~0, ~z$w_buff0~0, P2Thread1of1ForFork0_~arg.offset, ~z$w_buff1_used~0, ~z$w_buff1~0, P2Thread1of1ForFork0___VERIFIER_assert_~expression] because there is no mapped edge [2019-11-28 18:12:22,121 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [692] [692] P0ENTRY-->P0EXIT: Formula: (and (= |v_P0Thread1of1ForFork1_#in~arg.base_13| v_P0Thread1of1ForFork1_~arg.base_11) (= v_~x~0_16 v_~__unbuffered_p0_EAX~0_17) (= 0 |v_P0Thread1of1ForFork1_#res.offset_7|) (= v_~__unbuffered_cnt~0_54 (+ v_~__unbuffered_cnt~0_55 1)) (= v_~b~0_23 1) (= 0 |v_P0Thread1of1ForFork1_#res.base_7|) (= v_P0Thread1of1ForFork1_~arg.offset_11 |v_P0Thread1of1ForFork1_#in~arg.offset_13|)) InVars {P0Thread1of1ForFork1_#in~arg.offset=|v_P0Thread1of1ForFork1_#in~arg.offset_13|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_55, P0Thread1of1ForFork1_#in~arg.base=|v_P0Thread1of1ForFork1_#in~arg.base_13|, ~x~0=v_~x~0_16} OutVars{~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_17, P0Thread1of1ForFork1_#res.offset=|v_P0Thread1of1ForFork1_#res.offset_7|, P0Thread1of1ForFork1_#in~arg.offset=|v_P0Thread1of1ForFork1_#in~arg.offset_13|, ~b~0=v_~b~0_23, P0Thread1of1ForFork1_#res.base=|v_P0Thread1of1ForFork1_#res.base_7|, P0Thread1of1ForFork1_~arg.offset=v_P0Thread1of1ForFork1_~arg.offset_11, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_54, P0Thread1of1ForFork1_#in~arg.base=|v_P0Thread1of1ForFork1_#in~arg.base_13|, ~x~0=v_~x~0_16, P0Thread1of1ForFork1_~arg.base=v_P0Thread1of1ForFork1_~arg.base_11} AuxVars[] AssignedVars[~__unbuffered_p0_EAX~0, P0Thread1of1ForFork1_#res.offset, ~b~0, P0Thread1of1ForFork1_#res.base, P0Thread1of1ForFork1_~arg.offset, ~__unbuffered_cnt~0, P0Thread1of1ForFork1_~arg.base] because there is no mapped edge [2019-11-28 18:12:22,123 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [675] [675] L810-->L810-2: Formula: (let ((.cse1 (= (mod ~z$w_buff0_used~0_In709708081 256) 0)) (.cse0 (= (mod ~z$r_buff0_thd3~0_In709708081 256) 0))) (or (and (not .cse0) (= |P2Thread1of1ForFork0_#t~ite28_Out709708081| 0) (not .cse1)) (and (or .cse1 .cse0) (= ~z$w_buff0_used~0_In709708081 |P2Thread1of1ForFork0_#t~ite28_Out709708081|)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In709708081, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In709708081} OutVars{P2Thread1of1ForFork0_#t~ite28=|P2Thread1of1ForFork0_#t~ite28_Out709708081|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In709708081, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In709708081} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite28] because there is no mapped edge [2019-11-28 18:12:22,124 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [682] [682] L811-->L811-2: Formula: (let ((.cse0 (= (mod ~z$w_buff0_used~0_In-1782346150 256) 0)) (.cse1 (= (mod ~z$r_buff0_thd3~0_In-1782346150 256) 0)) (.cse3 (= 0 (mod ~z$r_buff1_thd3~0_In-1782346150 256))) (.cse2 (= 0 (mod ~z$w_buff1_used~0_In-1782346150 256)))) (or (and (or .cse0 .cse1) (or .cse2 .cse3) (= ~z$w_buff1_used~0_In-1782346150 |P2Thread1of1ForFork0_#t~ite29_Out-1782346150|)) (and (= |P2Thread1of1ForFork0_#t~ite29_Out-1782346150| 0) (or (and (not .cse0) (not .cse1)) (and (not .cse3) (not .cse2)))))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-1782346150, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In-1782346150, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1782346150, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-1782346150} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In-1782346150, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In-1782346150, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1782346150, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-1782346150, P2Thread1of1ForFork0_#t~ite29=|P2Thread1of1ForFork0_#t~ite29_Out-1782346150|} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite29] because there is no mapped edge [2019-11-28 18:12:22,125 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [674] [674] L812-->L813: Formula: (let ((.cse0 (= (mod ~z$r_buff0_thd3~0_In1269752360 256) 0)) (.cse2 (= (mod ~z$w_buff0_used~0_In1269752360 256) 0)) (.cse1 (= ~z$r_buff0_thd3~0_In1269752360 ~z$r_buff0_thd3~0_Out1269752360))) (or (and .cse0 .cse1) (and (not .cse0) (not .cse2) (= 0 ~z$r_buff0_thd3~0_Out1269752360)) (and .cse2 .cse1))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In1269752360, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In1269752360} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In1269752360, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_Out1269752360, P2Thread1of1ForFork0_#t~ite30=|P2Thread1of1ForFork0_#t~ite30_Out1269752360|} AuxVars[] AssignedVars[~z$r_buff0_thd3~0, P2Thread1of1ForFork0_#t~ite30] because there is no mapped edge [2019-11-28 18:12:22,125 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [680] [680] L813-->L813-2: Formula: (let ((.cse2 (= (mod ~z$w_buff1_used~0_In1236746125 256) 0)) (.cse3 (= 0 (mod ~z$r_buff1_thd3~0_In1236746125 256))) (.cse1 (= 0 (mod ~z$w_buff0_used~0_In1236746125 256))) (.cse0 (= (mod ~z$r_buff0_thd3~0_In1236746125 256) 0))) (or (and (= |P2Thread1of1ForFork0_#t~ite31_Out1236746125| 0) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse2 .cse3) (or .cse1 .cse0) (= |P2Thread1of1ForFork0_#t~ite31_Out1236746125| ~z$r_buff1_thd3~0_In1236746125)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In1236746125, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In1236746125, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1236746125, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In1236746125} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In1236746125, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In1236746125, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1236746125, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In1236746125, P2Thread1of1ForFork0_#t~ite31=|P2Thread1of1ForFork0_#t~ite31_Out1236746125|} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite31] because there is no mapped edge [2019-11-28 18:12:22,125 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [707] [707] L813-2-->P2EXIT: Formula: (and (= v_~__unbuffered_cnt~0_102 (+ v_~__unbuffered_cnt~0_103 1)) (= |v_P2Thread1of1ForFork0_#res.base_3| 0) (= v_~z$r_buff1_thd3~0_63 |v_P2Thread1of1ForFork0_#t~ite31_50|) (= |v_P2Thread1of1ForFork0_#res.offset_3| 0)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_103, P2Thread1of1ForFork0_#t~ite31=|v_P2Thread1of1ForFork0_#t~ite31_50|} OutVars{P2Thread1of1ForFork0_#res.base=|v_P2Thread1of1ForFork0_#res.base_3|, ~z$r_buff1_thd3~0=v_~z$r_buff1_thd3~0_63, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_102, P2Thread1of1ForFork0_#t~ite31=|v_P2Thread1of1ForFork0_#t~ite31_49|, P2Thread1of1ForFork0_#res.offset=|v_P2Thread1of1ForFork0_#res.offset_3|} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#res.base, ~z$r_buff1_thd3~0, ~__unbuffered_cnt~0, P2Thread1of1ForFork0_#t~ite31, P2Thread1of1ForFork0_#res.offset] because there is no mapped edge [2019-11-28 18:12:22,130 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [668] [668] L772-->L773: Formula: (and (not (= (mod v_~weak$$choice2~0_40 256) 0)) (= v_~z$r_buff0_thd2~0_102 v_~z$r_buff0_thd2~0_101)) InVars {~weak$$choice2~0=v_~weak$$choice2~0_40, ~z$r_buff0_thd2~0=v_~z$r_buff0_thd2~0_102} OutVars{P1Thread1of1ForFork2_#t~ite19=|v_P1Thread1of1ForFork2_#t~ite19_16|, P1Thread1of1ForFork2_#t~ite20=|v_P1Thread1of1ForFork2_#t~ite20_10|, P1Thread1of1ForFork2_#t~ite21=|v_P1Thread1of1ForFork2_#t~ite21_7|, ~weak$$choice2~0=v_~weak$$choice2~0_40, ~z$r_buff0_thd2~0=v_~z$r_buff0_thd2~0_101} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#t~ite19, P1Thread1of1ForFork2_#t~ite20, P1Thread1of1ForFork2_#t~ite21, ~z$r_buff0_thd2~0] because there is no mapped edge [2019-11-28 18:12:22,131 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [618] [618] L775-->L783: Formula: (and (= v_~__unbuffered_cnt~0_14 (+ v_~__unbuffered_cnt~0_15 1)) (= 0 v_~z$flush_delayed~0_10) (not (= (mod v_~z$flush_delayed~0_11 256) 0)) (= v_~z~0_23 v_~z$mem_tmp~0_4)) InVars {~z$mem_tmp~0=v_~z$mem_tmp~0_4, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_15, ~z$flush_delayed~0=v_~z$flush_delayed~0_11} OutVars{~z$mem_tmp~0=v_~z$mem_tmp~0_4, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_14, ~z$flush_delayed~0=v_~z$flush_delayed~0_10, ~z~0=v_~z~0_23, P1Thread1of1ForFork2_#t~ite25=|v_P1Thread1of1ForFork2_#t~ite25_11|} AuxVars[] AssignedVars[~__unbuffered_cnt~0, ~z$flush_delayed~0, ~z~0, P1Thread1of1ForFork2_#t~ite25] because there is no mapped edge [2019-11-28 18:12:22,132 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [648] [648] L836-1-->L842: Formula: (and (= v_~main$tmp_guard0~0_7 (ite (= 0 (ite (= 3 v_~__unbuffered_cnt~0_32) 1 0)) 0 1)) (not (= (mod v_~main$tmp_guard0~0_7 256) 0))) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_32} OutVars{ULTIMATE.start_main_#t~nondet34=|v_ULTIMATE.start_main_#t~nondet34_6|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_32, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_7} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet34, ~main$tmp_guard0~0] because there is no mapped edge [2019-11-28 18:12:22,134 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [683] [683] L842-2-->L842-4: Formula: (let ((.cse1 (= 0 (mod ~z$w_buff1_used~0_In209426420 256))) (.cse0 (= 0 (mod ~z$r_buff1_thd0~0_In209426420 256)))) (or (and (not .cse0) (not .cse1) (= ~z$w_buff1~0_In209426420 |ULTIMATE.start_main_#t~ite35_Out209426420|)) (and (= ~z~0_In209426420 |ULTIMATE.start_main_#t~ite35_Out209426420|) (or .cse1 .cse0)))) InVars {~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In209426420, ~z$w_buff1_used~0=~z$w_buff1_used~0_In209426420, ~z$w_buff1~0=~z$w_buff1~0_In209426420, ~z~0=~z~0_In209426420} OutVars{~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In209426420, ULTIMATE.start_main_#t~ite35=|ULTIMATE.start_main_#t~ite35_Out209426420|, ~z$w_buff1_used~0=~z$w_buff1_used~0_In209426420, ~z$w_buff1~0=~z$w_buff1~0_In209426420, ~z~0=~z~0_In209426420} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite35] because there is no mapped edge [2019-11-28 18:12:22,134 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [604] [604] L842-4-->L843: Formula: (= v_~z~0_12 |v_ULTIMATE.start_main_#t~ite35_7|) InVars {ULTIMATE.start_main_#t~ite35=|v_ULTIMATE.start_main_#t~ite35_7|} OutVars{ULTIMATE.start_main_#t~ite35=|v_ULTIMATE.start_main_#t~ite35_6|, ULTIMATE.start_main_#t~ite36=|v_ULTIMATE.start_main_#t~ite36_6|, ~z~0=v_~z~0_12} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite35, ULTIMATE.start_main_#t~ite36, ~z~0] because there is no mapped edge [2019-11-28 18:12:22,134 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [671] [671] L843-->L843-2: Formula: (let ((.cse1 (= (mod ~z$r_buff0_thd0~0_In-807490732 256) 0)) (.cse0 (= 0 (mod ~z$w_buff0_used~0_In-807490732 256)))) (or (and (or .cse0 .cse1) (= ~z$w_buff0_used~0_In-807490732 |ULTIMATE.start_main_#t~ite37_Out-807490732|)) (and (not .cse1) (not .cse0) (= 0 |ULTIMATE.start_main_#t~ite37_Out-807490732|)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-807490732, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-807490732} OutVars{~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-807490732, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-807490732, ULTIMATE.start_main_#t~ite37=|ULTIMATE.start_main_#t~ite37_Out-807490732|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite37] because there is no mapped edge [2019-11-28 18:12:22,135 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [676] [676] L844-->L844-2: Formula: (let ((.cse3 (= 0 (mod ~z$r_buff0_thd0~0_In-562099989 256))) (.cse2 (= 0 (mod ~z$w_buff0_used~0_In-562099989 256))) (.cse0 (= 0 (mod ~z$w_buff1_used~0_In-562099989 256))) (.cse1 (= 0 (mod ~z$r_buff1_thd0~0_In-562099989 256)))) (or (and (= 0 |ULTIMATE.start_main_#t~ite38_Out-562099989|) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse3 .cse2) (= ~z$w_buff1_used~0_In-562099989 |ULTIMATE.start_main_#t~ite38_Out-562099989|) (or .cse0 .cse1)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-562099989, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-562099989, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In-562099989, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-562099989} OutVars{~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-562099989, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-562099989, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In-562099989, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-562099989, ULTIMATE.start_main_#t~ite38=|ULTIMATE.start_main_#t~ite38_Out-562099989|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite38] because there is no mapped edge [2019-11-28 18:12:22,136 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [685] [685] L845-->L845-2: Formula: (let ((.cse1 (= 0 (mod ~z$r_buff0_thd0~0_In-1629912439 256))) (.cse0 (= 0 (mod ~z$w_buff0_used~0_In-1629912439 256)))) (or (and (= |ULTIMATE.start_main_#t~ite39_Out-1629912439| 0) (not .cse0) (not .cse1)) (and (or .cse1 .cse0) (= |ULTIMATE.start_main_#t~ite39_Out-1629912439| ~z$r_buff0_thd0~0_In-1629912439)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-1629912439, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1629912439} OutVars{~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-1629912439, ULTIMATE.start_main_#t~ite39=|ULTIMATE.start_main_#t~ite39_Out-1629912439|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1629912439} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite39] because there is no mapped edge [2019-11-28 18:12:22,137 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [677] [677] L846-->L846-2: Formula: (let ((.cse0 (= (mod ~z$w_buff1_used~0_In1503786847 256) 0)) (.cse1 (= 0 (mod ~z$r_buff1_thd0~0_In1503786847 256))) (.cse3 (= 0 (mod ~z$r_buff0_thd0~0_In1503786847 256))) (.cse2 (= 0 (mod ~z$w_buff0_used~0_In1503786847 256)))) (or (and (= 0 |ULTIMATE.start_main_#t~ite40_Out1503786847|) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse0 .cse1) (= |ULTIMATE.start_main_#t~ite40_Out1503786847| ~z$r_buff1_thd0~0_In1503786847) (or .cse3 .cse2)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In1503786847, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1503786847, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In1503786847, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1503786847} OutVars{~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In1503786847, ULTIMATE.start_main_#t~ite40=|ULTIMATE.start_main_#t~ite40_Out1503786847|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1503786847, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In1503786847, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1503786847} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite40] because there is no mapped edge [2019-11-28 18:12:22,137 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [723] [723] L846-2-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= v_ULTIMATE.start___VERIFIER_assert_~expression_21 |v_ULTIMATE.start___VERIFIER_assert_#in~expression_15|) (= v_ULTIMATE.start___VERIFIER_assert_~expression_21 0) (= |v_ULTIMATE.start_main_#t~ite40_42| v_~z$r_buff1_thd0~0_71) (= v_~main$tmp_guard1~0_21 (ite (= 0 (ite (not (and (= v_~__unbuffered_p2_EBX~0_35 0) (= v_~__unbuffered_p1_EBX~0_48 0) (= 1 v_~__unbuffered_p1_EAX~0_25) (= 0 v_~__unbuffered_p0_EAX~0_35) (= 1 v_~__unbuffered_p2_EAX~0_35))) 1 0)) 0 1)) (= |v_ULTIMATE.start___VERIFIER_assert_#in~expression_15| (mod v_~main$tmp_guard1~0_21 256))) InVars {~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_35, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_48, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_35, ULTIMATE.start_main_#t~ite40=|v_ULTIMATE.start_main_#t~ite40_42|, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_25, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_35} OutVars{~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_35, ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_21, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_48, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_35, ULTIMATE.start_main_#t~ite40=|v_ULTIMATE.start_main_#t~ite40_41|, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_25, ~z$r_buff1_thd0~0=v_~z$r_buff1_thd0~0_71, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_21, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_35, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_15|} AuxVars[] AssignedVars[ULTIMATE.start___VERIFIER_assert_~expression, ULTIMATE.start_main_#t~ite40, ~z$r_buff1_thd0~0, ~main$tmp_guard1~0, ULTIMATE.start___VERIFIER_assert_#in~expression] because there is no mapped edge [2019-11-28 18:12:22,256 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2019-11-28 18:12:22,261 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-11-28 18:12:22,263 INFO L168 Benchmark]: Toolchain (without parser) took 26754.26 ms. Allocated memory was 1.0 GB in the beginning and 2.6 GB in the end (delta: 1.6 GB). Free memory was 952.3 MB in the beginning and 1.1 GB in the end (delta: -179.5 MB). Peak memory consumption was 1.4 GB. Max. memory is 11.5 GB. [2019-11-28 18:12:22,264 INFO L168 Benchmark]: CDTParser took 0.38 ms. Allocated memory is still 1.0 GB. Free memory is still 987.2 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-28 18:12:22,264 INFO L168 Benchmark]: CACSL2BoogieTranslator took 817.15 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 138.9 MB). Free memory was 952.3 MB in the beginning and 1.1 GB in the end (delta: -149.8 MB). Peak memory consumption was 25.9 MB. Max. memory is 11.5 GB. [2019-11-28 18:12:22,266 INFO L168 Benchmark]: Boogie Procedure Inliner took 69.83 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:12:22,267 INFO L168 Benchmark]: Boogie Preprocessor took 39.77 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:12:22,267 INFO L168 Benchmark]: RCFGBuilder took 745.34 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: 44.3 MB). Peak memory consumption was 44.3 MB. Max. memory is 11.5 GB. [2019-11-28 18:12:22,268 INFO L168 Benchmark]: TraceAbstraction took 24923.86 ms. Allocated memory was 1.2 GB in the beginning and 2.6 GB in the end (delta: 1.5 GB). Free memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: -109.5 MB). Peak memory consumption was 1.4 GB. Max. memory is 11.5 GB. [2019-11-28 18:12:22,268 INFO L168 Benchmark]: Witness Printer took 152.88 ms. Allocated memory is still 2.6 GB. Free memory was 1.2 GB in the beginning and 1.1 GB in the end (delta: 28.9 MB). Peak memory consumption was 28.9 MB. Max. memory is 11.5 GB. [2019-11-28 18:12:22,271 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.38 ms. Allocated memory is still 1.0 GB. Free memory is still 987.2 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 817.15 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 138.9 MB). Free memory was 952.3 MB in the beginning and 1.1 GB in the end (delta: -149.8 MB). Peak memory consumption was 25.9 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 69.83 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 39.77 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 745.34 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: 44.3 MB). Peak memory consumption was 44.3 MB. Max. memory is 11.5 GB. * TraceAbstraction took 24923.86 ms. Allocated memory was 1.2 GB in the beginning and 2.6 GB in the end (delta: 1.5 GB). Free memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: -109.5 MB). Peak memory consumption was 1.4 GB. Max. memory is 11.5 GB. * Witness Printer took 152.88 ms. Allocated memory is still 2.6 GB. Free memory was 1.2 GB in the beginning and 1.1 GB in the end (delta: 28.9 MB). Peak memory consumption was 28.9 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks LbeTime: 5.3s, 156 ProgramPointsBefore, 75 ProgramPointsAfterwards, 181 TransitionsBefore, 85 TransitionsAfterwards, 11400 CoEnabledTransitionPairs, 8 FixpointIterations, 37 TrivialSequentialCompositions, 45 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 30 ConcurrentYvCompositions, 19 ChoiceCompositions, 4667 VarBasedMoverChecksPositive, 145 VarBasedMoverChecksNegative, 20 SemBasedMoverChecksPositive, 167 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 1.0s, 0 MoverChecksTotal, 50265 CheckedPairsTotal, 112 TotalNumberOfCompositions - CounterExampleResult [Line: 4]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L832] FCALL, FORK 0 pthread_create(&t870, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L834] FCALL, FORK 0 pthread_create(&t871, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L836] FCALL, FORK 0 pthread_create(&t872, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L793] 3 z$r_buff1_thd0 = z$r_buff0_thd0 [L794] 3 z$r_buff1_thd1 = z$r_buff0_thd1 [L795] 3 z$r_buff1_thd2 = z$r_buff0_thd2 [L796] 3 z$r_buff1_thd3 = z$r_buff0_thd3 [L797] 3 z$r_buff0_thd3 = (_Bool)1 [L800] 3 a = 1 [L803] 3 __unbuffered_p2_EAX = a [L806] 3 __unbuffered_p2_EBX = b VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L809] EXPR 3 z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd3 ? z$w_buff1 : z) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L754] 2 x = 1 [L757] 2 y = 1 [L760] 2 __unbuffered_p1_EAX = y [L763] 2 weak$$choice0 = __VERIFIER_nondet_bool() [L764] 2 weak$$choice2 = __VERIFIER_nondet_bool() [L765] 2 z$flush_delayed = weak$$choice2 [L766] 2 z$mem_tmp = z VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=1, y=1, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L767] EXPR 2 !z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z : (z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : z$w_buff1) VAL [!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z : (z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : z$w_buff1)=0, \result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=1, y=1, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L809] 3 z = z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd3 ? z$w_buff1 : z) [L810] 3 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used [L767] 2 z = !z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z : (z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : z$w_buff1) [L811] 3 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd3 || z$w_buff1_used && z$r_buff1_thd3 ? (_Bool)0 : z$w_buff1_used [L768] EXPR 2 weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : z$w_buff0)) VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : z$w_buff0))=1, x=1, y=1, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L768] 2 z$w_buff0 = weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : z$w_buff0)) [L769] EXPR 2 weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff1 : z$w_buff1)) VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff1 : z$w_buff1))=0, x=1, y=1, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L769] 2 z$w_buff1 = weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff1 : z$w_buff1)) [L770] EXPR 2 weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$w_buff0_used)) VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$w_buff0_used))=0, x=1, y=1, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L770] 2 z$w_buff0_used = weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$w_buff0_used)) [L771] EXPR 2 weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : (_Bool)0))=0, x=1, y=1, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L771] 2 z$w_buff1_used = weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L773] EXPR 2 weak$$choice2 ? z$r_buff1_thd2 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$r_buff1_thd2 : (z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, weak$$choice2 ? z$r_buff1_thd2 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$r_buff1_thd2 : (z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : (_Bool)0))=0, x=1, y=1, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L773] 2 z$r_buff1_thd2 = weak$$choice2 ? z$r_buff1_thd2 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$r_buff1_thd2 : (z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L774] 2 __unbuffered_p1_EBX = z VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=1, y=1, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L842] 0 z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z) VAL [\result={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=1, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L843] 0 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used [L844] 0 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$w_buff1_used [L845] 0 z$r_buff0_thd0 = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0 - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 147 locations, 2 error locations. Result: UNSAFE, OverallTime: 24.5s, OverallIterations: 20, TraceHistogramMax: 1, AutomataDifference: 6.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 2543 SDtfs, 2343 SDslu, 5303 SDs, 0 SdLazy, 3051 SolverSat, 109 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 2.9s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 118 GetRequests, 22 SyntacticMatches, 6 SemanticMatches, 90 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 251 ImplicationChecksByTransitivity, 1.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=21928occurred in iteration=5, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 8.7s AutomataMinimizationTime, 19 MinimizatonAttempts, 17803 StatesRemovedByMinimization, 14 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 1.5s InterpolantComputationTime, 507 NumberOfCodeBlocks, 507 NumberOfCodeBlocksAsserted, 20 NumberOfCheckSat, 443 ConstructedInterpolants, 0 QuantifiedInterpolants, 90253 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 19 InterpolantComputations, 19 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! Received shutdown request...