./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/pthread-wmm/mix033_rmo.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/mix033_rmo.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 c117418973a225620f492f5db41566211ea7ca92 ................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................ 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:12:11,163 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-28 18:12:11,165 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-28 18:12:11,177 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-28 18:12:11,178 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-28 18:12:11,179 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-28 18:12:11,180 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-28 18:12:11,182 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-28 18:12:11,185 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-28 18:12:11,186 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-28 18:12:11,187 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-28 18:12:11,188 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-28 18:12:11,189 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-28 18:12:11,190 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-28 18:12:11,191 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-28 18:12:11,192 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-28 18:12:11,193 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-28 18:12:11,194 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-28 18:12:11,196 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-28 18:12:11,199 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-28 18:12:11,201 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-28 18:12:11,202 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-28 18:12:11,203 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-28 18:12:11,204 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-28 18:12:11,208 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-28 18:12:11,208 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-28 18:12:11,209 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-28 18:12:11,210 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-28 18:12:11,210 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-28 18:12:11,212 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-28 18:12:11,212 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-28 18:12:11,213 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-28 18:12:11,214 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-28 18:12:11,215 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-28 18:12:11,216 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-28 18:12:11,217 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-28 18:12:11,218 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-28 18:12:11,218 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-28 18:12:11,219 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-28 18:12:11,220 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-28 18:12:11,221 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-28 18:12:11,222 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:12:11,250 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-28 18:12:11,250 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-28 18:12:11,253 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-28 18:12:11,254 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-28 18:12:11,254 INFO L138 SettingsManager]: * Use SBE=true [2019-11-28 18:12:11,254 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-28 18:12:11,255 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-28 18:12:11,255 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-28 18:12:11,255 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-28 18:12:11,255 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-28 18:12:11,255 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-11-28 18:12:11,257 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-28 18:12:11,257 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-11-28 18:12:11,258 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-28 18:12:11,258 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-28 18:12:11,258 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-28 18:12:11,259 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-11-28 18:12:11,259 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-28 18:12:11,259 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-28 18:12:11,260 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-28 18:12:11,260 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-28 18:12:11,261 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-28 18:12:11,261 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-28 18:12:11,262 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-28 18:12:11,262 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-11-28 18:12:11,262 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-11-28 18:12:11,263 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-11-28 18:12:11,263 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-11-28 18:12:11,263 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2019-11-28 18:12:11,264 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 -> c117418973a225620f492f5db41566211ea7ca92 [2019-11-28 18:12:11,608 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-28 18:12:11,632 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-28 18:12:11,636 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-28 18:12:11,638 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-28 18:12:11,638 INFO L275 PluginConnector]: CDTParser initialized [2019-11-28 18:12:11,639 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/pthread-wmm/mix033_rmo.opt.i [2019-11-28 18:12:11,723 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/462786f1f/769acdb7edf0469e8e96a883c12f62a7/FLAGf33aafff6 [2019-11-28 18:12:12,333 INFO L306 CDTParser]: Found 1 translation units. [2019-11-28 18:12:12,334 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/pthread-wmm/mix033_rmo.opt.i [2019-11-28 18:12:12,366 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/462786f1f/769acdb7edf0469e8e96a883c12f62a7/FLAGf33aafff6 [2019-11-28 18:12:12,581 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/462786f1f/769acdb7edf0469e8e96a883c12f62a7 [2019-11-28 18:12:12,585 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-28 18:12:12,587 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-11-28 18:12:12,588 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-28 18:12:12,589 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-28 18:12:12,592 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-28 18:12:12,594 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 06:12:12" (1/1) ... [2019-11-28 18:12:12,597 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2f8bbb41 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 06:12:12, skipping insertion in model container [2019-11-28 18:12:12,597 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 06:12:12" (1/1) ... [2019-11-28 18:12:12,605 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-11-28 18:12:12,665 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-11-28 18:12:13,172 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-28 18:12:13,192 INFO L203 MainTranslator]: Completed pre-run [2019-11-28 18:12:13,293 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-28 18:12:13,394 INFO L208 MainTranslator]: Completed translation [2019-11-28 18:12:13,395 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 06:12:13 WrapperNode [2019-11-28 18:12:13,395 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-28 18:12:13,396 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-11-28 18:12:13,396 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-11-28 18:12:13,397 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-11-28 18:12:13,406 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:12:13" (1/1) ... [2019-11-28 18:12:13,430 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:12:13" (1/1) ... [2019-11-28 18:12:13,471 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-11-28 18:12:13,471 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-28 18:12:13,472 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-28 18:12:13,472 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-28 18:12:13,483 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 06:12:13" (1/1) ... [2019-11-28 18:12:13,484 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 06:12:13" (1/1) ... [2019-11-28 18:12:13,489 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 06:12:13" (1/1) ... [2019-11-28 18:12:13,489 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 06:12:13" (1/1) ... [2019-11-28 18:12:13,513 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 06:12:13" (1/1) ... [2019-11-28 18:12:13,518 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 06:12:13" (1/1) ... [2019-11-28 18:12:13,530 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 06:12:13" (1/1) ... [2019-11-28 18:12:13,539 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-28 18:12:13,541 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-28 18:12:13,544 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-28 18:12:13,544 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-28 18:12:13,545 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 06:12:13" (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:12:13,610 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-11-28 18:12:13,611 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2019-11-28 18:12:13,611 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-11-28 18:12:13,612 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-11-28 18:12:13,613 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2019-11-28 18:12:13,613 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2019-11-28 18:12:13,613 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2019-11-28 18:12:13,613 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2019-11-28 18:12:13,614 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2019-11-28 18:12:13,614 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2019-11-28 18:12:13,615 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2019-11-28 18:12:13,615 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-28 18:12:13,615 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-28 18:12:13,617 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:12:14,295 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-28 18:12:14,295 INFO L287 CfgBuilder]: Removed 8 assume(true) statements. [2019-11-28 18:12:14,297 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 06:12:14 BoogieIcfgContainer [2019-11-28 18:12:14,297 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-28 18:12:14,299 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-28 18:12:14,299 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-28 18:12:14,303 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-28 18:12:14,304 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 28.11 06:12:12" (1/3) ... [2019-11-28 18:12:14,305 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@584d4801 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.11 06:12:14, skipping insertion in model container [2019-11-28 18:12:14,305 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 06:12:13" (2/3) ... [2019-11-28 18:12:14,306 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@584d4801 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.11 06:12:14, skipping insertion in model container [2019-11-28 18:12:14,307 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 06:12:14" (3/3) ... [2019-11-28 18:12:14,309 INFO L109 eAbstractionObserver]: Analyzing ICFG mix033_rmo.opt.i [2019-11-28 18:12:14,321 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-11-28 18:12:14,321 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-28 18:12:14,331 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2019-11-28 18:12:14,332 INFO L339 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2019-11-28 18:12:14,374 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:12:14,375 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:12:14,375 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:12:14,375 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:12:14,376 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:12:14,376 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:12:14,377 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:12:14,377 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:12:14,378 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:12:14,378 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:12:14,378 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:12:14,378 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:12:14,379 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:12:14,379 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:12:14,379 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:12:14,380 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:12:14,380 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:12:14,380 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:12:14,381 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:12:14,381 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:12:14,381 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:12:14,382 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:12:14,382 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:12:14,382 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:12:14,383 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:12:14,383 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:12:14,383 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:12:14,384 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:12:14,384 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:12:14,384 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:12:14,385 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:12:14,385 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:12:14,385 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:12:14,386 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:12:14,386 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:12:14,386 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:12:14,387 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:12:14,387 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:12:14,387 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:12:14,388 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:12:14,388 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:12:14,388 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:12:14,389 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:12:14,389 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:12:14,389 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:12:14,390 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:12:14,390 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:12:14,390 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:12:14,391 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:12:14,391 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:12:14,391 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:12:14,392 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:12:14,392 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:12:14,392 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:12:14,393 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:12:14,393 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:12:14,393 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:12:14,394 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:12:14,394 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:12:14,394 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:12:14,394 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:12:14,395 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:12:14,395 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:12:14,396 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:12:14,396 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:12:14,396 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:12:14,397 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:12:14,397 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:12:14,397 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:12:14,398 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:12:14,398 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:12:14,398 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:12:14,399 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:12:14,399 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:12:14,399 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:12:14,400 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:12:14,400 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:12:14,400 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:12:14,401 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:12:14,401 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:12:14,401 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:12:14,402 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:12:14,402 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:12:14,402 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:12:14,402 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:12:14,403 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:12:14,403 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:12:14,403 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:12:14,404 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:12:14,404 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:12:14,404 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:12:14,405 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:12:14,405 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:12:14,405 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:12:14,406 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:12:14,406 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:12:14,406 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:12:14,407 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:12:14,407 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:12:14,407 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:12:14,408 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:12:14,409 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:12:14,409 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:12:14,409 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:12:14,409 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:12:14,410 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:12:14,410 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:12:14,410 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:12:14,411 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:12:14,411 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:12:14,412 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:12:14,412 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:12:14,412 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:12:14,413 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:12:14,413 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:12:14,413 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:12:14,414 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:12:14,414 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:12:14,414 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:12:14,414 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:12:14,415 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:12:14,415 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:12:14,415 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:12:14,416 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:12:14,416 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:12:14,416 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:12:14,417 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:12:14,417 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:12:14,417 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:12:14,418 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:12:14,418 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:12:14,418 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:12:14,418 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:12:14,419 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:12:14,440 INFO L249 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2019-11-28 18:12:14,463 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-28 18:12:14,463 INFO L374 AbstractCegarLoop]: Hoare is true [2019-11-28 18:12:14,464 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-28 18:12:14,464 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-28 18:12:14,464 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-28 18:12:14,464 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-28 18:12:14,465 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-28 18:12:14,465 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-28 18:12:14,484 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 155 places, 180 transitions [2019-11-28 18:12:14,486 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 155 places, 180 transitions [2019-11-28 18:12:14,577 INFO L134 PetriNetUnfolder]: 35/177 cut-off events. [2019-11-28 18:12:14,577 INFO L135 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-11-28 18:12:14,594 INFO L76 FinitePrefix]: Finished finitePrefix Result has 187 conditions, 177 events. 35/177 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 560 event pairs. 9/149 useless extension candidates. Maximal degree in co-relation 143. Up to 2 conditions per place. [2019-11-28 18:12:14,619 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 155 places, 180 transitions [2019-11-28 18:12:14,666 INFO L134 PetriNetUnfolder]: 35/177 cut-off events. [2019-11-28 18:12:14,667 INFO L135 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-11-28 18:12:14,675 INFO L76 FinitePrefix]: Finished finitePrefix Result has 187 conditions, 177 events. 35/177 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 560 event pairs. 9/149 useless extension candidates. Maximal degree in co-relation 143. Up to 2 conditions per place. [2019-11-28 18:12:14,695 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 11400 [2019-11-28 18:12:14,696 INFO L170 etLargeBlockEncoding]: Semantic Check. [2019-11-28 18:12:19,533 WARN L192 SmtUtils]: Spent 319.00 ms on a formula simplification. DAG size of input: 97 DAG size of output: 95 [2019-11-28 18:12:19,662 WARN L192 SmtUtils]: Spent 126.00 ms on a formula simplification that was a NOOP. DAG size: 93 [2019-11-28 18:12:19,779 INFO L206 etLargeBlockEncoding]: Checked pairs total: 39797 [2019-11-28 18:12:19,780 INFO L214 etLargeBlockEncoding]: Total number of compositions: 112 [2019-11-28 18:12:19,784 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 70 places, 78 transitions [2019-11-28 18:12:20,856 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 11878 states. [2019-11-28 18:12:20,859 INFO L276 IsEmpty]: Start isEmpty. Operand 11878 states. [2019-11-28 18:12:20,868 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-11-28 18:12:20,868 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 18:12:20,869 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2019-11-28 18:12:20,870 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:20,877 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 18:12:20,878 INFO L82 PathProgramCache]: Analyzing trace with hash -884972408, now seen corresponding path program 1 times [2019-11-28 18:12:20,889 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 18:12:20,890 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1657233811] [2019-11-28 18:12:20,890 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 18:12:21,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 18:12:21,232 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,232 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1657233811] [2019-11-28 18:12:21,233 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 18:12:21,233 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-11-28 18:12:21,234 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1746356167] [2019-11-28 18:12:21,238 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-28 18:12:21,239 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 18:12:21,254 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-28 18:12:21,255 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 18:12:21,257 INFO L87 Difference]: Start difference. First operand 11878 states. Second operand 3 states. [2019-11-28 18:12:21,518 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 18:12:21,518 INFO L93 Difference]: Finished difference Result 11574 states and 44420 transitions. [2019-11-28 18:12:21,519 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-28 18:12:21,520 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 7 [2019-11-28 18:12:21,521 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 18:12:21,672 INFO L225 Difference]: With dead ends: 11574 [2019-11-28 18:12:21,672 INFO L226 Difference]: Without dead ends: 10902 [2019-11-28 18:12:21,674 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:21,812 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10902 states. [2019-11-28 18:12:22,412 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10902 to 10902. [2019-11-28 18:12:22,414 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10902 states. [2019-11-28 18:12:22,483 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10902 states to 10902 states and 41772 transitions. [2019-11-28 18:12:22,485 INFO L78 Accepts]: Start accepts. Automaton has 10902 states and 41772 transitions. Word has length 7 [2019-11-28 18:12:22,487 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 18:12:22,487 INFO L462 AbstractCegarLoop]: Abstraction has 10902 states and 41772 transitions. [2019-11-28 18:12:22,488 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-28 18:12:22,488 INFO L276 IsEmpty]: Start isEmpty. Operand 10902 states and 41772 transitions. [2019-11-28 18:12:22,500 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-11-28 18:12:22,500 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 18:12:22,500 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 18:12:22,501 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:22,502 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 18:12:22,502 INFO L82 PathProgramCache]: Analyzing trace with hash -1826046565, now seen corresponding path program 1 times [2019-11-28 18:12:22,502 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 18:12:22,503 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1570249347] [2019-11-28 18:12:22,503 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 18:12:22,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 18:12:22,620 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:22,621 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1570249347] [2019-11-28 18:12:22,621 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 18:12:22,621 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-28 18:12:22,622 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1722074678] [2019-11-28 18:12:22,623 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-28 18:12:22,624 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 18:12:22,624 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-28 18:12:22,624 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 18:12:22,625 INFO L87 Difference]: Start difference. First operand 10902 states and 41772 transitions. Second operand 3 states. [2019-11-28 18:12:22,714 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 18:12:22,714 INFO L93 Difference]: Finished difference Result 6581 states and 22068 transitions. [2019-11-28 18:12:22,715 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-28 18:12:22,715 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 13 [2019-11-28 18:12:22,715 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 18:12:22,766 INFO L225 Difference]: With dead ends: 6581 [2019-11-28 18:12:22,768 INFO L226 Difference]: Without dead ends: 6581 [2019-11-28 18:12:22,769 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:22,823 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6581 states. [2019-11-28 18:12:22,959 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6581 to 6581. [2019-11-28 18:12:22,960 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6581 states. [2019-11-28 18:12:22,986 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6581 states to 6581 states and 22068 transitions. [2019-11-28 18:12:22,987 INFO L78 Accepts]: Start accepts. Automaton has 6581 states and 22068 transitions. Word has length 13 [2019-11-28 18:12:22,987 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 18:12:22,987 INFO L462 AbstractCegarLoop]: Abstraction has 6581 states and 22068 transitions. [2019-11-28 18:12:22,987 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-28 18:12:22,988 INFO L276 IsEmpty]: Start isEmpty. Operand 6581 states and 22068 transitions. [2019-11-28 18:12:22,994 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-11-28 18:12:22,996 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 18:12:22,996 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 18:12:22,997 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:22,998 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 18:12:22,998 INFO L82 PathProgramCache]: Analyzing trace with hash 2047638315, now seen corresponding path program 1 times [2019-11-28 18:12:22,998 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 18:12:22,999 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1026098728] [2019-11-28 18:12:22,999 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 18:12:23,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 18:12:23,094 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:23,094 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1026098728] [2019-11-28 18:12:23,094 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 18:12:23,095 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-28 18:12:23,096 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [327056539] [2019-11-28 18:12:23,096 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-28 18:12:23,096 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 18:12:23,096 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-28 18:12:23,097 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-28 18:12:23,097 INFO L87 Difference]: Start difference. First operand 6581 states and 22068 transitions. Second operand 4 states. [2019-11-28 18:12:23,148 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 18:12:23,149 INFO L93 Difference]: Finished difference Result 1580 states and 4255 transitions. [2019-11-28 18:12:23,149 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-28 18:12:23,149 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 14 [2019-11-28 18:12:23,149 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 18:12:23,154 INFO L225 Difference]: With dead ends: 1580 [2019-11-28 18:12:23,154 INFO L226 Difference]: Without dead ends: 1580 [2019-11-28 18:12:23,155 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:23,161 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1580 states. [2019-11-28 18:12:23,192 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1580 to 1580. [2019-11-28 18:12:23,192 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1580 states. [2019-11-28 18:12:23,198 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1580 states to 1580 states and 4255 transitions. [2019-11-28 18:12:23,198 INFO L78 Accepts]: Start accepts. Automaton has 1580 states and 4255 transitions. Word has length 14 [2019-11-28 18:12:23,198 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 18:12:23,199 INFO L462 AbstractCegarLoop]: Abstraction has 1580 states and 4255 transitions. [2019-11-28 18:12:23,199 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-28 18:12:23,199 INFO L276 IsEmpty]: Start isEmpty. Operand 1580 states and 4255 transitions. [2019-11-28 18:12:23,200 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-11-28 18:12:23,201 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 18:12:23,201 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:23,201 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:23,202 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 18:12:23,202 INFO L82 PathProgramCache]: Analyzing trace with hash 564133875, now seen corresponding path program 1 times [2019-11-28 18:12:23,202 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 18:12:23,203 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2022033382] [2019-11-28 18:12:23,203 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 18:12:23,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 18:12:23,281 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:23,281 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2022033382] [2019-11-28 18:12:23,281 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 18:12:23,281 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-28 18:12:23,286 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [135579032] [2019-11-28 18:12:23,286 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-28 18:12:23,286 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 18:12:23,286 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-28 18:12:23,287 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 18:12:23,287 INFO L87 Difference]: Start difference. First operand 1580 states and 4255 transitions. Second operand 3 states. [2019-11-28 18:12:23,355 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 18:12:23,355 INFO L93 Difference]: Finished difference Result 2392 states and 6401 transitions. [2019-11-28 18:12:23,356 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-28 18:12:23,356 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 16 [2019-11-28 18:12:23,356 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 18:12:23,364 INFO L225 Difference]: With dead ends: 2392 [2019-11-28 18:12:23,364 INFO L226 Difference]: Without dead ends: 2392 [2019-11-28 18:12:23,365 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:23,372 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2392 states. [2019-11-28 18:12:23,417 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2392 to 1844. [2019-11-28 18:12:23,418 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1844 states. [2019-11-28 18:12:23,424 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1844 states to 1844 states and 5001 transitions. [2019-11-28 18:12:23,425 INFO L78 Accepts]: Start accepts. Automaton has 1844 states and 5001 transitions. Word has length 16 [2019-11-28 18:12:23,425 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 18:12:23,425 INFO L462 AbstractCegarLoop]: Abstraction has 1844 states and 5001 transitions. [2019-11-28 18:12:23,425 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-28 18:12:23,426 INFO L276 IsEmpty]: Start isEmpty. Operand 1844 states and 5001 transitions. [2019-11-28 18:12:23,427 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-11-28 18:12:23,428 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 18:12:23,428 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:23,428 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:23,428 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 18:12:23,429 INFO L82 PathProgramCache]: Analyzing trace with hash 659196956, now seen corresponding path program 1 times [2019-11-28 18:12:23,429 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 18:12:23,429 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [835723945] [2019-11-28 18:12:23,430 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 18:12:23,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 18:12:23,512 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:23,512 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [835723945] [2019-11-28 18:12:23,512 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 18:12:23,513 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-28 18:12:23,513 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [113741749] [2019-11-28 18:12:23,513 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-28 18:12:23,513 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 18:12:23,514 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-28 18:12:23,514 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-11-28 18:12:23,514 INFO L87 Difference]: Start difference. First operand 1844 states and 5001 transitions. Second operand 5 states. [2019-11-28 18:12:23,846 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 18:12:23,846 INFO L93 Difference]: Finished difference Result 2843 states and 7459 transitions. [2019-11-28 18:12:23,847 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-11-28 18:12:23,847 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 16 [2019-11-28 18:12:23,847 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 18:12:23,855 INFO L225 Difference]: With dead ends: 2843 [2019-11-28 18:12:23,855 INFO L226 Difference]: Without dead ends: 2843 [2019-11-28 18:12:23,855 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-11-28 18:12:23,863 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2843 states. [2019-11-28 18:12:23,908 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2843 to 2353. [2019-11-28 18:12:23,909 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2353 states. [2019-11-28 18:12:23,916 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2353 states to 2353 states and 6293 transitions. [2019-11-28 18:12:23,916 INFO L78 Accepts]: Start accepts. Automaton has 2353 states and 6293 transitions. Word has length 16 [2019-11-28 18:12:23,917 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 18:12:23,917 INFO L462 AbstractCegarLoop]: Abstraction has 2353 states and 6293 transitions. [2019-11-28 18:12:23,917 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-28 18:12:23,917 INFO L276 IsEmpty]: Start isEmpty. Operand 2353 states and 6293 transitions. [2019-11-28 18:12:23,922 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2019-11-28 18:12:23,922 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 18:12:23,922 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:23,923 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:23,924 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 18:12:23,924 INFO L82 PathProgramCache]: Analyzing trace with hash 1695035107, now seen corresponding path program 1 times [2019-11-28 18:12:23,925 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 18:12:23,925 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1381400842] [2019-11-28 18:12:23,925 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 18:12:23,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 18:12:24,009 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:24,009 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1381400842] [2019-11-28 18:12:24,009 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 18:12:24,010 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-28 18:12:24,010 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1011551845] [2019-11-28 18:12:24,010 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-28 18:12:24,010 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 18:12:24,011 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-28 18:12:24,011 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-11-28 18:12:24,011 INFO L87 Difference]: Start difference. First operand 2353 states and 6293 transitions. Second operand 5 states. [2019-11-28 18:12:24,050 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 18:12:24,051 INFO L93 Difference]: Finished difference Result 1432 states and 3933 transitions. [2019-11-28 18:12:24,051 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-28 18:12:24,051 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 29 [2019-11-28 18:12:24,051 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 18:12:24,055 INFO L225 Difference]: With dead ends: 1432 [2019-11-28 18:12:24,055 INFO L226 Difference]: Without dead ends: 1432 [2019-11-28 18:12:24,056 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:24,060 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1432 states. [2019-11-28 18:12:24,081 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1432 to 1360. [2019-11-28 18:12:24,082 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1360 states. [2019-11-28 18:12:24,086 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1360 states to 1360 states and 3745 transitions. [2019-11-28 18:12:24,086 INFO L78 Accepts]: Start accepts. Automaton has 1360 states and 3745 transitions. Word has length 29 [2019-11-28 18:12:24,087 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 18:12:24,087 INFO L462 AbstractCegarLoop]: Abstraction has 1360 states and 3745 transitions. [2019-11-28 18:12:24,087 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-28 18:12:24,087 INFO L276 IsEmpty]: Start isEmpty. Operand 1360 states and 3745 transitions. [2019-11-28 18:12:24,093 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2019-11-28 18:12:24,094 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 18:12:24,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, 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:24,094 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:24,094 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 18:12:24,095 INFO L82 PathProgramCache]: Analyzing trace with hash -17339731, now seen corresponding path program 1 times [2019-11-28 18:12:24,095 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 18:12:24,095 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [729613686] [2019-11-28 18:12:24,095 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 18:12:24,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 18:12:24,255 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:24,256 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [729613686] [2019-11-28 18:12:24,256 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 18:12:24,256 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-28 18:12:24,256 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [779352773] [2019-11-28 18:12:24,257 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-28 18:12:24,257 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 18:12:24,257 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-28 18:12:24,257 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-28 18:12:24,258 INFO L87 Difference]: Start difference. First operand 1360 states and 3745 transitions. Second operand 5 states. [2019-11-28 18:12:24,562 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 18:12:24,562 INFO L93 Difference]: Finished difference Result 2062 states and 5572 transitions. [2019-11-28 18:12:24,563 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-28 18:12:24,563 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 44 [2019-11-28 18:12:24,563 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 18:12:24,569 INFO L225 Difference]: With dead ends: 2062 [2019-11-28 18:12:24,569 INFO L226 Difference]: Without dead ends: 2062 [2019-11-28 18:12:24,570 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-11-28 18:12:24,575 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2062 states. [2019-11-28 18:12:24,608 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2062 to 1780. [2019-11-28 18:12:24,609 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1780 states. [2019-11-28 18:12:24,614 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1780 states to 1780 states and 4869 transitions. [2019-11-28 18:12:24,615 INFO L78 Accepts]: Start accepts. Automaton has 1780 states and 4869 transitions. Word has length 44 [2019-11-28 18:12:24,615 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 18:12:24,616 INFO L462 AbstractCegarLoop]: Abstraction has 1780 states and 4869 transitions. [2019-11-28 18:12:24,616 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-28 18:12:24,616 INFO L276 IsEmpty]: Start isEmpty. Operand 1780 states and 4869 transitions. [2019-11-28 18:12:24,621 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2019-11-28 18:12:24,622 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 18:12:24,622 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] [2019-11-28 18:12:24,622 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:24,622 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 18:12:24,623 INFO L82 PathProgramCache]: Analyzing trace with hash -2037325251, now seen corresponding path program 2 times [2019-11-28 18:12:24,623 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 18:12:24,623 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [258652791] [2019-11-28 18:12:24,624 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 18:12:24,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 18:12:24,723 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:24,724 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [258652791] [2019-11-28 18:12:24,724 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 18:12:24,724 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-28 18:12:24,725 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [106735440] [2019-11-28 18:12:24,725 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-28 18:12:24,725 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 18:12:24,726 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-28 18:12:24,726 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 18:12:24,726 INFO L87 Difference]: Start difference. First operand 1780 states and 4869 transitions. Second operand 3 states. [2019-11-28 18:12:24,748 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 18:12:24,749 INFO L93 Difference]: Finished difference Result 1778 states and 4864 transitions. [2019-11-28 18:12:24,749 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-28 18:12:24,749 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 44 [2019-11-28 18:12:24,749 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 18:12:24,756 INFO L225 Difference]: With dead ends: 1778 [2019-11-28 18:12:24,756 INFO L226 Difference]: Without dead ends: 1778 [2019-11-28 18:12:24,757 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:24,762 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1778 states. [2019-11-28 18:12:24,791 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1778 to 1596. [2019-11-28 18:12:24,791 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1596 states. [2019-11-28 18:12:24,796 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1596 states to 1596 states and 4411 transitions. [2019-11-28 18:12:24,796 INFO L78 Accepts]: Start accepts. Automaton has 1596 states and 4411 transitions. Word has length 44 [2019-11-28 18:12:24,797 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 18:12:24,798 INFO L462 AbstractCegarLoop]: Abstraction has 1596 states and 4411 transitions. [2019-11-28 18:12:24,798 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-28 18:12:24,798 INFO L276 IsEmpty]: Start isEmpty. Operand 1596 states and 4411 transitions. [2019-11-28 18:12:24,802 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2019-11-28 18:12:24,802 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 18:12:24,802 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:24,803 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:24,803 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 18:12:24,803 INFO L82 PathProgramCache]: Analyzing trace with hash 91748315, now seen corresponding path program 1 times [2019-11-28 18:12:24,803 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 18:12:24,804 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [741736525] [2019-11-28 18:12:24,804 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 18:12:24,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 18:12:25,302 WARN L192 SmtUtils]: Spent 135.00 ms on a formula simplification. DAG size of input: 41 DAG size of output: 22 [2019-11-28 18:12:25,333 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:25,333 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [741736525] [2019-11-28 18:12:25,334 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 18:12:25,334 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-11-28 18:12:25,334 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [863266037] [2019-11-28 18:12:25,335 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-11-28 18:12:25,335 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 18:12:25,335 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-11-28 18:12:25,335 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2019-11-28 18:12:25,336 INFO L87 Difference]: Start difference. First operand 1596 states and 4411 transitions. Second operand 9 states. [2019-11-28 18:12:26,579 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 18:12:26,579 INFO L93 Difference]: Finished difference Result 3790 states and 9283 transitions. [2019-11-28 18:12:26,580 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-11-28 18:12:26,580 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 45 [2019-11-28 18:12:26,580 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 18:12:26,590 INFO L225 Difference]: With dead ends: 3790 [2019-11-28 18:12:26,590 INFO L226 Difference]: Without dead ends: 3063 [2019-11-28 18:12:26,591 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 46 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=109, Invalid=271, Unknown=0, NotChecked=0, Total=380 [2019-11-28 18:12:26,598 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3063 states. [2019-11-28 18:12:26,636 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3063 to 1959. [2019-11-28 18:12:26,636 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1959 states. [2019-11-28 18:12:26,641 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1959 states to 1959 states and 5162 transitions. [2019-11-28 18:12:26,641 INFO L78 Accepts]: Start accepts. Automaton has 1959 states and 5162 transitions. Word has length 45 [2019-11-28 18:12:26,642 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 18:12:26,642 INFO L462 AbstractCegarLoop]: Abstraction has 1959 states and 5162 transitions. [2019-11-28 18:12:26,642 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-11-28 18:12:26,642 INFO L276 IsEmpty]: Start isEmpty. Operand 1959 states and 5162 transitions. [2019-11-28 18:12:26,647 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2019-11-28 18:12:26,647 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 18:12:26,648 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:26,648 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:26,648 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 18:12:26,648 INFO L82 PathProgramCache]: Analyzing trace with hash 1896706635, now seen corresponding path program 2 times [2019-11-28 18:12:26,648 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 18:12:26,649 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1010119110] [2019-11-28 18:12:26,649 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 18:12:26,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 18:12:26,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:26,762 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1010119110] [2019-11-28 18:12:26,762 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 18:12:26,762 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-11-28 18:12:26,762 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [687638514] [2019-11-28 18:12:26,763 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-11-28 18:12:26,763 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 18:12:26,764 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-11-28 18:12:26,764 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-11-28 18:12:26,764 INFO L87 Difference]: Start difference. First operand 1959 states and 5162 transitions. Second operand 7 states. [2019-11-28 18:12:27,017 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 18:12:27,017 INFO L93 Difference]: Finished difference Result 4675 states and 12068 transitions. [2019-11-28 18:12:27,018 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-11-28 18:12:27,018 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 45 [2019-11-28 18:12:27,018 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 18:12:27,030 INFO L225 Difference]: With dead ends: 4675 [2019-11-28 18:12:27,030 INFO L226 Difference]: Without dead ends: 3197 [2019-11-28 18:12:27,031 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=53, Invalid=157, Unknown=0, NotChecked=0, Total=210 [2019-11-28 18:12:27,041 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3197 states. [2019-11-28 18:12:27,083 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3197 to 2081. [2019-11-28 18:12:27,084 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2081 states. [2019-11-28 18:12:27,090 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2081 states to 2081 states and 5487 transitions. [2019-11-28 18:12:27,091 INFO L78 Accepts]: Start accepts. Automaton has 2081 states and 5487 transitions. Word has length 45 [2019-11-28 18:12:27,091 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 18:12:27,091 INFO L462 AbstractCegarLoop]: Abstraction has 2081 states and 5487 transitions. [2019-11-28 18:12:27,091 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-11-28 18:12:27,091 INFO L276 IsEmpty]: Start isEmpty. Operand 2081 states and 5487 transitions. [2019-11-28 18:12:27,099 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2019-11-28 18:12:27,099 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 18:12:27,099 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:27,099 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:27,100 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 18:12:27,100 INFO L82 PathProgramCache]: Analyzing trace with hash 291811001, now seen corresponding path program 3 times [2019-11-28 18:12:27,101 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 18:12:27,101 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1683952084] [2019-11-28 18:12:27,101 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 18:12:27,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 18:12:27,226 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 18:12:27,227 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1683952084] [2019-11-28 18:12:27,227 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 18:12:27,227 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-28 18:12:27,228 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1647257798] [2019-11-28 18:12:27,228 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-28 18:12:27,228 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 18:12:27,229 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-28 18:12:27,229 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-28 18:12:27,229 INFO L87 Difference]: Start difference. First operand 2081 states and 5487 transitions. Second operand 4 states. [2019-11-28 18:12:27,256 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 18:12:27,257 INFO L93 Difference]: Finished difference Result 2229 states and 5775 transitions. [2019-11-28 18:12:27,257 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-28 18:12:27,257 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 45 [2019-11-28 18:12:27,258 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 18:12:27,265 INFO L225 Difference]: With dead ends: 2229 [2019-11-28 18:12:27,265 INFO L226 Difference]: Without dead ends: 1493 [2019-11-28 18:12:27,266 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:27,271 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1493 states. [2019-11-28 18:12:27,297 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1493 to 1493. [2019-11-28 18:12:27,297 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1493 states. [2019-11-28 18:12:27,302 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1493 states to 1493 states and 4017 transitions. [2019-11-28 18:12:27,303 INFO L78 Accepts]: Start accepts. Automaton has 1493 states and 4017 transitions. Word has length 45 [2019-11-28 18:12:27,303 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 18:12:27,303 INFO L462 AbstractCegarLoop]: Abstraction has 1493 states and 4017 transitions. [2019-11-28 18:12:27,303 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-28 18:12:27,303 INFO L276 IsEmpty]: Start isEmpty. Operand 1493 states and 4017 transitions. [2019-11-28 18:12:27,307 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2019-11-28 18:12:27,307 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 18:12:27,308 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:27,308 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:27,308 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 18:12:27,308 INFO L82 PathProgramCache]: Analyzing trace with hash 1010142777, now seen corresponding path program 4 times [2019-11-28 18:12:27,308 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 18:12:27,309 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [198762948] [2019-11-28 18:12:27,309 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 18:12:27,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 18:12:27,454 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:27,455 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [198762948] [2019-11-28 18:12:27,455 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 18:12:27,455 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-28 18:12:27,455 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [228464742] [2019-11-28 18:12:27,456 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-28 18:12:27,456 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 18:12:27,456 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-28 18:12:27,456 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-28 18:12:27,457 INFO L87 Difference]: Start difference. First operand 1493 states and 4017 transitions. Second operand 4 states. [2019-11-28 18:12:27,477 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 18:12:27,478 INFO L93 Difference]: Finished difference Result 2091 states and 5374 transitions. [2019-11-28 18:12:27,478 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-28 18:12:27,478 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 45 [2019-11-28 18:12:27,478 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 18:12:27,481 INFO L225 Difference]: With dead ends: 2091 [2019-11-28 18:12:27,481 INFO L226 Difference]: Without dead ends: 648 [2019-11-28 18:12:27,481 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:27,483 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 648 states. [2019-11-28 18:12:27,492 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 648 to 648. [2019-11-28 18:12:27,492 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 648 states. [2019-11-28 18:12:27,494 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 648 states to 648 states and 1446 transitions. [2019-11-28 18:12:27,494 INFO L78 Accepts]: Start accepts. Automaton has 648 states and 1446 transitions. Word has length 45 [2019-11-28 18:12:27,494 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 18:12:27,494 INFO L462 AbstractCegarLoop]: Abstraction has 648 states and 1446 transitions. [2019-11-28 18:12:27,494 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-28 18:12:27,494 INFO L276 IsEmpty]: Start isEmpty. Operand 648 states and 1446 transitions. [2019-11-28 18:12:27,496 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2019-11-28 18:12:27,496 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 18:12:27,497 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:27,497 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:27,497 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 18:12:27,497 INFO L82 PathProgramCache]: Analyzing trace with hash -926318759, now seen corresponding path program 5 times [2019-11-28 18:12:27,498 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 18:12:27,498 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1324519007] [2019-11-28 18:12:27,498 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 18:12:27,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 18:12:27,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 18:12:27,674 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-28 18:12:27,675 INFO L475 BasicCegarLoop]: Counterexample might be feasible [2019-11-28 18:12:27,679 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [732] [732] ULTIMATE.startENTRY-->L830: Formula: (let ((.cse0 (store |v_#valid_67| 0 0))) (and (= |v_#length_25| (store |v_#length_26| |v_ULTIMATE.start_main_~#t888~0.base_26| 4)) (= 0 v_~weak$$choice0~0_10) (= v_~weak$$choice2~0_155 0) (= 0 v_~z$r_buff1_thd1~0_69) (= 0 v_~__unbuffered_cnt~0_89) (= v_~z$w_buff1~0_237 0) (= 0 v_~z$r_buff1_thd3~0_123) (= |v_ULTIMATE.start_main_~#t888~0.offset_19| 0) (= 0 v_~__unbuffered_p2_EAX~0_85) (= |v_#NULL.offset_7| 0) (= v_~main$tmp_guard0~0_18 0) (= v_~z~0_127 0) (= v_~z$mem_tmp~0_16 0) (= v_~z$r_buff0_thd2~0_289 0) (= v_~z$read_delayed_var~0.base_4 0) (= (store |v_#memory_int_22| |v_ULTIMATE.start_main_~#t888~0.base_26| (store (select |v_#memory_int_22| |v_ULTIMATE.start_main_~#t888~0.base_26|) |v_ULTIMATE.start_main_~#t888~0.offset_19| 0)) |v_#memory_int_21|) (< 0 |v_#StackHeapBarrier_19|) (= v_~z$w_buff0~0_373 0) (= v_~__unbuffered_p2_EBX~0_85 0) (= v_~z$read_delayed~0_5 0) (= v_~z$read_delayed_var~0.offset_4 0) (= v_~a~0_68 0) (= v_~z$r_buff0_thd1~0_24 0) (= v_~y~0_12 0) (= 0 v_~__unbuffered_p1_EAX~0_29) (< |v_#StackHeapBarrier_19| |v_ULTIMATE.start_main_~#t888~0.base_26|) (= v_~z$r_buff1_thd0~0_127 0) (= |v_#valid_65| (store .cse0 |v_ULTIMATE.start_main_~#t888~0.base_26| 1)) (= v_~z$r_buff0_thd0~0_88 0) (= v_~z$w_buff1_used~0_415 0) (= (select .cse0 |v_ULTIMATE.start_main_~#t888~0.base_26|) 0) (= 0 |v_#NULL.base_7|) (= 0 v_~z$flush_delayed~0_41) (= v_~b~0_31 0) (= v_~z$w_buff0_used~0_644 0) (= 0 v_~z$r_buff0_thd3~0_138) (= v_~__unbuffered_p1_EBX~0_47 0) (= v_~z$r_buff1_thd2~0_233 0) (= v_~x~0_36 0) (= v_~main$tmp_guard1~0_25 0))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_19|, #valid=|v_#valid_67|, #memory_int=|v_#memory_int_22|, #length=|v_#length_26|} OutVars{ULTIMATE.start_main_#t~nondet32=|v_ULTIMATE.start_main_#t~nondet32_9|, ULTIMATE.start_main_#t~nondet34=|v_ULTIMATE.start_main_#t~nondet34_19|, ~z$r_buff1_thd2~0=v_~z$r_buff1_thd2~0_233, #NULL.offset=|v_#NULL.offset_7|, ~a~0=v_~a~0_68, ~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_88, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_29, #length=|v_#length_25|, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_85, ULTIMATE.start_main_~#t888~0.offset=|v_ULTIMATE.start_main_~#t888~0.offset_19|, ULTIMATE.start_main_~#t890~0.offset=|v_ULTIMATE.start_main_~#t890~0.offset_16|, ~z$mem_tmp~0=v_~z$mem_tmp~0_16, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_85, ULTIMATE.start_main_#t~ite39=|v_ULTIMATE.start_main_#t~ite39_31|, ULTIMATE.start_main_#t~ite35=|v_ULTIMATE.start_main_#t~ite35_79|, ULTIMATE.start_main_~#t889~0.base=|v_ULTIMATE.start_main_~#t889~0.base_19|, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_415, ULTIMATE.start_main_#t~ite37=|v_ULTIMATE.start_main_#t~ite37_37|, ~z$flush_delayed~0=v_~z$flush_delayed~0_41, ~weak$$choice0~0=v_~weak$$choice0~0_10, #StackHeapBarrier=|v_#StackHeapBarrier_19|, ULTIMATE.start_main_#t~ite40=|v_ULTIMATE.start_main_#t~ite40_53|, ULTIMATE.start_main_~#t888~0.base=|v_ULTIMATE.start_main_~#t888~0.base_26|, ~z$r_buff1_thd1~0=v_~z$r_buff1_thd1~0_69, ~z$read_delayed_var~0.base=v_~z$read_delayed_var~0.base_4, ~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_138, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_89, ~x~0=v_~x~0_36, ULTIMATE.start_main_#t~nondet33=|v_ULTIMATE.start_main_#t~nondet33_9|, ULTIMATE.start_main_~#t890~0.base=|v_ULTIMATE.start_main_~#t890~0.base_19|, ~z$read_delayed~0=v_~z$read_delayed~0_5, ~z$w_buff1~0=v_~z$w_buff1~0_237, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_25, ~z$read_delayed_var~0.offset=v_~z$read_delayed_var~0.offset_4, ~z$r_buff1_thd0~0=v_~z$r_buff1_thd0~0_127, ~y~0=v_~y~0_12, ~z$r_buff0_thd2~0=v_~z$r_buff0_thd2~0_289, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_47, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_644, ~z$w_buff0~0=v_~z$w_buff0~0_373, ~z$r_buff1_thd3~0=v_~z$r_buff1_thd3~0_123, ULTIMATE.start_main_#t~ite36=|v_ULTIMATE.start_main_#t~ite36_71|, ULTIMATE.start_main_#t~ite38=|v_ULTIMATE.start_main_#t~ite38_77|, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_18, ULTIMATE.start_main_~#t889~0.offset=|v_ULTIMATE.start_main_~#t889~0.offset_16|, #NULL.base=|v_#NULL.base_7|, ~b~0=v_~b~0_31, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_18|, #valid=|v_#valid_65|, #memory_int=|v_#memory_int_21|, ~z~0=v_~z~0_127, ~weak$$choice2~0=v_~weak$$choice2~0_155, ~z$r_buff0_thd1~0=v_~z$r_buff0_thd1~0_24} 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_p1_EAX~0, #length, ~__unbuffered_p2_EAX~0, ULTIMATE.start_main_~#t888~0.offset, ULTIMATE.start_main_~#t890~0.offset, ~z$mem_tmp~0, ~__unbuffered_p2_EBX~0, ULTIMATE.start_main_#t~ite39, ULTIMATE.start_main_#t~ite35, ULTIMATE.start_main_~#t889~0.base, ~z$w_buff1_used~0, ULTIMATE.start_main_#t~ite37, ~z$flush_delayed~0, ~weak$$choice0~0, ULTIMATE.start_main_#t~ite40, ULTIMATE.start_main_~#t888~0.base, ~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_~#t890~0.base, ~z$read_delayed~0, ~z$w_buff1~0, ~main$tmp_guard1~0, ~z$read_delayed_var~0.offset, ~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, ULTIMATE.start_main_~#t889~0.offset, #NULL.base, ~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:27,680 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [707] [707] L830-1-->L832: Formula: (and (= 0 (select |v_#valid_40| |v_ULTIMATE.start_main_~#t889~0.base_11|)) (= (store |v_#valid_40| |v_ULTIMATE.start_main_~#t889~0.base_11| 1) |v_#valid_39|) (< |v_#StackHeapBarrier_11| |v_ULTIMATE.start_main_~#t889~0.base_11|) (= (store |v_#length_16| |v_ULTIMATE.start_main_~#t889~0.base_11| 4) |v_#length_15|) (= (store |v_#memory_int_12| |v_ULTIMATE.start_main_~#t889~0.base_11| (store (select |v_#memory_int_12| |v_ULTIMATE.start_main_~#t889~0.base_11|) |v_ULTIMATE.start_main_~#t889~0.offset_10| 1)) |v_#memory_int_11|) (= |v_ULTIMATE.start_main_~#t889~0.offset_10| 0) (not (= |v_ULTIMATE.start_main_~#t889~0.base_11| 0))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_11|, #valid=|v_#valid_40|, #memory_int=|v_#memory_int_12|, #length=|v_#length_16|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_11|, ULTIMATE.start_main_#t~nondet32=|v_ULTIMATE.start_main_#t~nondet32_5|, #valid=|v_#valid_39|, #memory_int=|v_#memory_int_11|, ULTIMATE.start_main_~#t889~0.base=|v_ULTIMATE.start_main_~#t889~0.base_11|, #length=|v_#length_15|, ULTIMATE.start_main_~#t889~0.offset=|v_ULTIMATE.start_main_~#t889~0.offset_10|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet32, #valid, #memory_int, ULTIMATE.start_main_~#t889~0.base, #length, ULTIMATE.start_main_~#t889~0.offset] because there is no mapped edge [2019-11-28 18:12:27,681 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [711] [711] L832-1-->L834: Formula: (and (= (store |v_#memory_int_14| |v_ULTIMATE.start_main_~#t890~0.base_13| (store (select |v_#memory_int_14| |v_ULTIMATE.start_main_~#t890~0.base_13|) |v_ULTIMATE.start_main_~#t890~0.offset_11| 2)) |v_#memory_int_13|) (= |v_#length_17| (store |v_#length_18| |v_ULTIMATE.start_main_~#t890~0.base_13| 4)) (not (= |v_ULTIMATE.start_main_~#t890~0.base_13| 0)) (= 0 (select |v_#valid_42| |v_ULTIMATE.start_main_~#t890~0.base_13|)) (= (store |v_#valid_42| |v_ULTIMATE.start_main_~#t890~0.base_13| 1) |v_#valid_41|) (= 0 |v_ULTIMATE.start_main_~#t890~0.offset_11|) (< |v_#StackHeapBarrier_12| |v_ULTIMATE.start_main_~#t890~0.base_13|)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_12|, #valid=|v_#valid_42|, #memory_int=|v_#memory_int_14|, #length=|v_#length_18|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_12|, ULTIMATE.start_main_~#t890~0.base=|v_ULTIMATE.start_main_~#t890~0.base_13|, ULTIMATE.start_main_#t~nondet33=|v_ULTIMATE.start_main_#t~nondet33_5|, #valid=|v_#valid_41|, #memory_int=|v_#memory_int_13|, #length=|v_#length_17|, ULTIMATE.start_main_~#t890~0.offset=|v_ULTIMATE.start_main_~#t890~0.offset_11|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t890~0.base, ULTIMATE.start_main_#t~nondet33, #valid, #memory_int, #length, ULTIMATE.start_main_~#t890~0.offset] because there is no mapped edge [2019-11-28 18:12:27,683 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [631] [631] L4-->L807: Formula: (and (= v_~z$r_buff0_thd3~0_39 1) (= v_~__unbuffered_p2_EBX~0_7 v_~b~0_7) (= v_~z$r_buff0_thd2~0_71 v_~z$r_buff1_thd2~0_39) (= v_~z$r_buff1_thd1~0_6 v_~z$r_buff0_thd1~0_7) (= v_~z$r_buff0_thd0~0_20 v_~z$r_buff1_thd0~0_19) (= v_~z$r_buff0_thd3~0_40 v_~z$r_buff1_thd3~0_26) (not (= 0 v_P2Thread1of1ForFork2___VERIFIER_assert_~expression_22)) (= 1 v_~a~0_6) (= v_~__unbuffered_p2_EAX~0_7 v_~a~0_6)) InVars {~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_20, ~b~0=v_~b~0_7, ~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_40, P2Thread1of1ForFork2___VERIFIER_assert_~expression=v_P2Thread1of1ForFork2___VERIFIER_assert_~expression_22, ~z$r_buff0_thd1~0=v_~z$r_buff0_thd1~0_7, ~z$r_buff0_thd2~0=v_~z$r_buff0_thd2~0_71} OutVars{~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_7, ~z$r_buff1_thd3~0=v_~z$r_buff1_thd3~0_26, ~z$r_buff1_thd2~0=v_~z$r_buff1_thd2~0_39, P2Thread1of1ForFork2___VERIFIER_assert_~expression=v_P2Thread1of1ForFork2___VERIFIER_assert_~expression_22, ~a~0=v_~a~0_6, ~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_20, ~b~0=v_~b~0_7, ~z$r_buff1_thd0~0=v_~z$r_buff1_thd0~0_19, ~z$r_buff1_thd1~0=v_~z$r_buff1_thd1~0_6, ~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_39, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_7, ~z$r_buff0_thd1~0=v_~z$r_buff0_thd1~0_7, ~z$r_buff0_thd2~0=v_~z$r_buff0_thd2~0_71} AuxVars[] AssignedVars[~a~0, ~__unbuffered_p2_EBX~0, ~z$r_buff1_thd3~0, ~z$r_buff1_thd0~0, ~z$r_buff1_thd2~0, ~z$r_buff1_thd1~0, ~z$r_buff0_thd3~0, ~__unbuffered_p2_EAX~0] because there is no mapped edge [2019-11-28 18:12:27,683 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [706] [706] P0ENTRY-->P0EXIT: Formula: (and (= v_~b~0_22 1) (= (+ v_~__unbuffered_cnt~0_59 1) v_~__unbuffered_cnt~0_58) (= |v_P0Thread1of1ForFork0_#res.offset_3| 0) (= v_P0Thread1of1ForFork0_~arg.offset_6 |v_P0Thread1of1ForFork0_#in~arg.offset_8|) (= 0 |v_P0Thread1of1ForFork0_#res.base_3|) (= v_~x~0_18 1) (= v_P0Thread1of1ForFork0_~arg.base_6 |v_P0Thread1of1ForFork0_#in~arg.base_8|)) InVars {P0Thread1of1ForFork0_#in~arg.offset=|v_P0Thread1of1ForFork0_#in~arg.offset_8|, P0Thread1of1ForFork0_#in~arg.base=|v_P0Thread1of1ForFork0_#in~arg.base_8|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_59} OutVars{P0Thread1of1ForFork0_#in~arg.offset=|v_P0Thread1of1ForFork0_#in~arg.offset_8|, P0Thread1of1ForFork0_#res.offset=|v_P0Thread1of1ForFork0_#res.offset_3|, ~b~0=v_~b~0_22, P0Thread1of1ForFork0_#in~arg.base=|v_P0Thread1of1ForFork0_#in~arg.base_8|, P0Thread1of1ForFork0_#res.base=|v_P0Thread1of1ForFork0_#res.base_3|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_58, P0Thread1of1ForFork0_~arg.base=v_P0Thread1of1ForFork0_~arg.base_6, ~x~0=v_~x~0_18, P0Thread1of1ForFork0_~arg.offset=v_P0Thread1of1ForFork0_~arg.offset_6} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#res.offset, ~b~0, P0Thread1of1ForFork0_#res.base, ~__unbuffered_cnt~0, P0Thread1of1ForFork0_~arg.base, ~x~0, P0Thread1of1ForFork0_~arg.offset] because there is no mapped edge [2019-11-28 18:12:27,688 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [715] [715] L768-->L768-8: Formula: (let ((.cse1 (= (mod ~weak$$choice2~0_In785945644 256) 0))) (or (and (= |P1Thread1of1ForFork1_#t~ite15_Out785945644| |P1Thread1of1ForFork1_#t~ite14_Out785945644|) (= ~z$w_buff0_used~0_In785945644 |P1Thread1of1ForFork1_#t~ite14_Out785945644|) (let ((.cse0 (= (mod ~z$r_buff0_thd2~0_In785945644 256) 0))) (or (= (mod ~z$w_buff0_used~0_In785945644 256) 0) (and .cse0 (= (mod ~z$w_buff1_used~0_In785945644 256) 0)) (and (= (mod ~z$r_buff1_thd2~0_In785945644 256) 0) .cse0))) .cse1) (and (= |P1Thread1of1ForFork1_#t~ite15_Out785945644| ~z$w_buff0_used~0_In785945644) (not .cse1) (= |P1Thread1of1ForFork1_#t~ite14_In785945644| |P1Thread1of1ForFork1_#t~ite14_Out785945644|)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In785945644, ~z$r_buff1_thd2~0=~z$r_buff1_thd2~0_In785945644, ~z$w_buff1_used~0=~z$w_buff1_used~0_In785945644, ~weak$$choice2~0=~weak$$choice2~0_In785945644, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In785945644, P1Thread1of1ForFork1_#t~ite14=|P1Thread1of1ForFork1_#t~ite14_In785945644|} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In785945644, ~z$r_buff1_thd2~0=~z$r_buff1_thd2~0_In785945644, ~z$w_buff1_used~0=~z$w_buff1_used~0_In785945644, P1Thread1of1ForFork1_#t~ite15=|P1Thread1of1ForFork1_#t~ite15_Out785945644|, ~weak$$choice2~0=~weak$$choice2~0_In785945644, P1Thread1of1ForFork1_#t~ite14=|P1Thread1of1ForFork1_#t~ite14_Out785945644|, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In785945644} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite15, P1Thread1of1ForFork1_#t~ite14] because there is no mapped edge [2019-11-28 18:12:27,690 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [666] [666] L770-->L771: Formula: (and (= v_~z$r_buff0_thd2~0_113 v_~z$r_buff0_thd2~0_112) (not (= (mod v_~weak$$choice2~0_37 256) 0))) InVars {~weak$$choice2~0=v_~weak$$choice2~0_37, ~z$r_buff0_thd2~0=v_~z$r_buff0_thd2~0_113} OutVars{P1Thread1of1ForFork1_#t~ite19=|v_P1Thread1of1ForFork1_#t~ite19_13|, P1Thread1of1ForFork1_#t~ite20=|v_P1Thread1of1ForFork1_#t~ite20_8|, P1Thread1of1ForFork1_#t~ite21=|v_P1Thread1of1ForFork1_#t~ite21_5|, ~weak$$choice2~0=v_~weak$$choice2~0_37, ~z$r_buff0_thd2~0=v_~z$r_buff0_thd2~0_112} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite19, P1Thread1of1ForFork1_#t~ite20, P1Thread1of1ForFork1_#t~ite21, ~z$r_buff0_thd2~0] because there is no mapped edge [2019-11-28 18:12:27,691 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [659] [659] L773-->L781: Formula: (and (not (= (mod v_~z$flush_delayed~0_13 256) 0)) (= 0 v_~z$flush_delayed~0_12) (= v_~z~0_41 v_~z$mem_tmp~0_6) (= (+ v_~__unbuffered_cnt~0_26 1) v_~__unbuffered_cnt~0_25)) InVars {~z$mem_tmp~0=v_~z$mem_tmp~0_6, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_26, ~z$flush_delayed~0=v_~z$flush_delayed~0_13} OutVars{~z$mem_tmp~0=v_~z$mem_tmp~0_6, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_25, ~z$flush_delayed~0=v_~z$flush_delayed~0_12, ~z~0=v_~z~0_41, P1Thread1of1ForFork1_#t~ite25=|v_P1Thread1of1ForFork1_#t~ite25_13|} AuxVars[] AssignedVars[~__unbuffered_cnt~0, ~z$flush_delayed~0, ~z~0, P1Thread1of1ForFork1_#t~ite25] because there is no mapped edge [2019-11-28 18:12:27,692 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [679] [679] L808-->L808-2: Formula: (let ((.cse1 (= (mod ~z$w_buff0_used~0_In-554757221 256) 0)) (.cse0 (= (mod ~z$r_buff0_thd3~0_In-554757221 256) 0))) (or (and (not .cse0) (= 0 |P2Thread1of1ForFork2_#t~ite28_Out-554757221|) (not .cse1)) (and (= ~z$w_buff0_used~0_In-554757221 |P2Thread1of1ForFork2_#t~ite28_Out-554757221|) (or .cse1 .cse0)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-554757221, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-554757221} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In-554757221, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-554757221, P2Thread1of1ForFork2_#t~ite28=|P2Thread1of1ForFork2_#t~ite28_Out-554757221|} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite28] because there is no mapped edge [2019-11-28 18:12:27,693 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [680] [680] L809-->L809-2: Formula: (let ((.cse0 (= (mod ~z$r_buff1_thd3~0_In-755894144 256) 0)) (.cse1 (= (mod ~z$w_buff1_used~0_In-755894144 256) 0)) (.cse3 (= (mod ~z$w_buff0_used~0_In-755894144 256) 0)) (.cse2 (= 0 (mod ~z$r_buff0_thd3~0_In-755894144 256)))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= 0 |P2Thread1of1ForFork2_#t~ite29_Out-755894144|)) (and (or .cse0 .cse1) (or .cse3 .cse2) (= ~z$w_buff1_used~0_In-755894144 |P2Thread1of1ForFork2_#t~ite29_Out-755894144|)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-755894144, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In-755894144, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-755894144, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-755894144} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In-755894144, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In-755894144, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-755894144, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-755894144, P2Thread1of1ForFork2_#t~ite29=|P2Thread1of1ForFork2_#t~ite29_Out-755894144|} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite29] because there is no mapped edge [2019-11-28 18:12:27,694 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [673] [673] L810-->L811: Formula: (let ((.cse1 (= ~z$r_buff0_thd3~0_Out1342880734 ~z$r_buff0_thd3~0_In1342880734)) (.cse0 (= 0 (mod ~z$r_buff0_thd3~0_In1342880734 256))) (.cse2 (= 0 (mod ~z$w_buff0_used~0_In1342880734 256)))) (or (and .cse0 .cse1) (and .cse2 .cse1) (and (not .cse0) (not .cse2) (= ~z$r_buff0_thd3~0_Out1342880734 0)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In1342880734, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In1342880734} OutVars{P2Thread1of1ForFork2_#t~ite30=|P2Thread1of1ForFork2_#t~ite30_Out1342880734|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1342880734, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_Out1342880734} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite30, ~z$r_buff0_thd3~0] because there is no mapped edge [2019-11-28 18:12:27,694 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [681] [681] L811-->L811-2: Formula: (let ((.cse2 (= (mod ~z$r_buff1_thd3~0_In-72132857 256) 0)) (.cse3 (= 0 (mod ~z$w_buff1_used~0_In-72132857 256))) (.cse1 (= 0 (mod ~z$r_buff0_thd3~0_In-72132857 256))) (.cse0 (= 0 (mod ~z$w_buff0_used~0_In-72132857 256)))) (or (and (= 0 |P2Thread1of1ForFork2_#t~ite31_Out-72132857|) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (= ~z$r_buff1_thd3~0_In-72132857 |P2Thread1of1ForFork2_#t~ite31_Out-72132857|) (or .cse2 .cse3) (or .cse1 .cse0)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-72132857, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In-72132857, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-72132857, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-72132857} OutVars{P2Thread1of1ForFork2_#t~ite31=|P2Thread1of1ForFork2_#t~ite31_Out-72132857|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-72132857, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In-72132857, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-72132857, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-72132857} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite31] because there is no mapped edge [2019-11-28 18:12:27,695 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [695] [695] L811-2-->P2EXIT: Formula: (and (= (+ v_~__unbuffered_cnt~0_46 1) v_~__unbuffered_cnt~0_45) (= 0 |v_P2Thread1of1ForFork2_#res.base_3|) (= |v_P2Thread1of1ForFork2_#res.offset_3| 0) (= |v_P2Thread1of1ForFork2_#t~ite31_28| v_~z$r_buff1_thd3~0_49)) InVars {P2Thread1of1ForFork2_#t~ite31=|v_P2Thread1of1ForFork2_#t~ite31_28|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_46} OutVars{P2Thread1of1ForFork2_#t~ite31=|v_P2Thread1of1ForFork2_#t~ite31_27|, ~z$r_buff1_thd3~0=v_~z$r_buff1_thd3~0_49, P2Thread1of1ForFork2_#res.base=|v_P2Thread1of1ForFork2_#res.base_3|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_45, P2Thread1of1ForFork2_#res.offset=|v_P2Thread1of1ForFork2_#res.offset_3|} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite31, ~z$r_buff1_thd3~0, P2Thread1of1ForFork2_#res.base, ~__unbuffered_cnt~0, P2Thread1of1ForFork2_#res.offset] because there is no mapped edge [2019-11-28 18:12:27,695 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [604] [604] L834-1-->L840: Formula: (and (not (= 0 (mod v_~main$tmp_guard0~0_6 256))) (= v_~main$tmp_guard0~0_6 (ite (= 0 (ite (= 3 v_~__unbuffered_cnt~0_13) 1 0)) 0 1))) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_13} OutVars{ULTIMATE.start_main_#t~nondet34=|v_ULTIMATE.start_main_#t~nondet34_5|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_13, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_6} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet34, ~main$tmp_guard0~0] because there is no mapped edge [2019-11-28 18:12:27,696 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [686] [686] L840-2-->L840-4: Formula: (let ((.cse1 (= 0 (mod ~z$w_buff1_used~0_In-1293383138 256))) (.cse0 (= 0 (mod ~z$r_buff1_thd0~0_In-1293383138 256)))) (or (and (not .cse0) (= ~z$w_buff1~0_In-1293383138 |ULTIMATE.start_main_#t~ite35_Out-1293383138|) (not .cse1)) (and (or .cse1 .cse0) (= ~z~0_In-1293383138 |ULTIMATE.start_main_#t~ite35_Out-1293383138|)))) InVars {~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In-1293383138, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1293383138, ~z$w_buff1~0=~z$w_buff1~0_In-1293383138, ~z~0=~z~0_In-1293383138} OutVars{~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In-1293383138, ULTIMATE.start_main_#t~ite35=|ULTIMATE.start_main_#t~ite35_Out-1293383138|, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1293383138, ~z$w_buff1~0=~z$w_buff1~0_In-1293383138, ~z~0=~z~0_In-1293383138} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite35] because there is no mapped edge [2019-11-28 18:12:27,696 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [649] [649] L840-4-->L841: Formula: (= v_~z~0_31 |v_ULTIMATE.start_main_#t~ite35_22|) InVars {ULTIMATE.start_main_#t~ite35=|v_ULTIMATE.start_main_#t~ite35_22|} OutVars{ULTIMATE.start_main_#t~ite35=|v_ULTIMATE.start_main_#t~ite35_21|, ULTIMATE.start_main_#t~ite36=|v_ULTIMATE.start_main_#t~ite36_19|, ~z~0=v_~z~0_31} 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:27,696 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [676] [676] L841-->L841-2: Formula: (let ((.cse0 (= 0 (mod ~z$w_buff0_used~0_In-379188262 256))) (.cse1 (= 0 (mod ~z$r_buff0_thd0~0_In-379188262 256)))) (or (and (or .cse0 .cse1) (= |ULTIMATE.start_main_#t~ite37_Out-379188262| ~z$w_buff0_used~0_In-379188262)) (and (not .cse0) (= |ULTIMATE.start_main_#t~ite37_Out-379188262| 0) (not .cse1)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-379188262, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-379188262} OutVars{~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-379188262, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-379188262, ULTIMATE.start_main_#t~ite37=|ULTIMATE.start_main_#t~ite37_Out-379188262|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite37] because there is no mapped edge [2019-11-28 18:12:27,697 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [671] [671] L842-->L842-2: Formula: (let ((.cse0 (= (mod ~z$w_buff0_used~0_In-203445881 256) 0)) (.cse1 (= (mod ~z$r_buff0_thd0~0_In-203445881 256) 0)) (.cse3 (= 0 (mod ~z$w_buff1_used~0_In-203445881 256))) (.cse2 (= (mod ~z$r_buff1_thd0~0_In-203445881 256) 0))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= |ULTIMATE.start_main_#t~ite38_Out-203445881| 0)) (and (or .cse0 .cse1) (or .cse3 .cse2) (= |ULTIMATE.start_main_#t~ite38_Out-203445881| ~z$w_buff1_used~0_In-203445881)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-203445881, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-203445881, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In-203445881, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-203445881} OutVars{~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-203445881, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-203445881, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In-203445881, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-203445881, ULTIMATE.start_main_#t~ite38=|ULTIMATE.start_main_#t~ite38_Out-203445881|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite38] because there is no mapped edge [2019-11-28 18:12:27,697 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [687] [687] L843-->L843-2: Formula: (let ((.cse0 (= 0 (mod ~z$r_buff0_thd0~0_In-1536042643 256))) (.cse1 (= 0 (mod ~z$w_buff0_used~0_In-1536042643 256)))) (or (and (not .cse0) (not .cse1) (= |ULTIMATE.start_main_#t~ite39_Out-1536042643| 0)) (and (= |ULTIMATE.start_main_#t~ite39_Out-1536042643| ~z$r_buff0_thd0~0_In-1536042643) (or .cse0 .cse1)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-1536042643, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1536042643} OutVars{~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-1536042643, ULTIMATE.start_main_#t~ite39=|ULTIMATE.start_main_#t~ite39_Out-1536042643|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1536042643} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite39] because there is no mapped edge [2019-11-28 18:12:27,698 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [682] [682] L844-->L844-2: Formula: (let ((.cse2 (= 0 (mod ~z$r_buff1_thd0~0_In1991638695 256))) (.cse3 (= 0 (mod ~z$w_buff1_used~0_In1991638695 256))) (.cse1 (= 0 (mod ~z$r_buff0_thd0~0_In1991638695 256))) (.cse0 (= 0 (mod ~z$w_buff0_used~0_In1991638695 256)))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= |ULTIMATE.start_main_#t~ite40_Out1991638695| 0)) (and (or .cse2 .cse3) (= |ULTIMATE.start_main_#t~ite40_Out1991638695| ~z$r_buff1_thd0~0_In1991638695) (or .cse1 .cse0)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In1991638695, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1991638695, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In1991638695, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1991638695} OutVars{~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In1991638695, ULTIMATE.start_main_#t~ite40=|ULTIMATE.start_main_#t~ite40_Out1991638695|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1991638695, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In1991638695, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1991638695} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite40] because there is no mapped edge [2019-11-28 18:12:27,698 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [723] [723] L844-2-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= |v_ULTIMATE.start___VERIFIER_assert_#in~expression_12| (mod v_~main$tmp_guard1~0_20 256)) (= v_ULTIMATE.start___VERIFIER_assert_~expression_15 |v_ULTIMATE.start___VERIFIER_assert_#in~expression_12|) (= (ite (= 0 (ite (not (and (= 1 v_~__unbuffered_p2_EAX~0_80) (= 1 v_~__unbuffered_p1_EAX~0_24) (= v_~__unbuffered_p2_EBX~0_80 0) (= v_~x~0_31 2) (= v_~__unbuffered_p1_EBX~0_41 0))) 1 0)) 0 1) v_~main$tmp_guard1~0_20) (= v_ULTIMATE.start___VERIFIER_assert_~expression_15 0) (= v_~z$r_buff1_thd0~0_122 |v_ULTIMATE.start_main_#t~ite40_46|)) InVars {~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_41, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_80, ULTIMATE.start_main_#t~ite40=|v_ULTIMATE.start_main_#t~ite40_46|, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_24, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_80, ~x~0=v_~x~0_31} OutVars{ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_15, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_41, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_80, ULTIMATE.start_main_#t~ite40=|v_ULTIMATE.start_main_#t~ite40_45|, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_24, ~z$r_buff1_thd0~0=v_~z$r_buff1_thd0~0_122, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_20, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_80, ~x~0=v_~x~0_31, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_12|} 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:27,818 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 28.11 06:12:27 BasicIcfg [2019-11-28 18:12:27,818 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-11-28 18:12:27,819 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-11-28 18:12:27,819 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-11-28 18:12:27,820 INFO L275 PluginConnector]: Witness Printer initialized [2019-11-28 18:12:27,820 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 06:12:14" (3/4) ... [2019-11-28 18:12:27,827 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2019-11-28 18:12:27,827 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [732] [732] ULTIMATE.startENTRY-->L830: Formula: (let ((.cse0 (store |v_#valid_67| 0 0))) (and (= |v_#length_25| (store |v_#length_26| |v_ULTIMATE.start_main_~#t888~0.base_26| 4)) (= 0 v_~weak$$choice0~0_10) (= v_~weak$$choice2~0_155 0) (= 0 v_~z$r_buff1_thd1~0_69) (= 0 v_~__unbuffered_cnt~0_89) (= v_~z$w_buff1~0_237 0) (= 0 v_~z$r_buff1_thd3~0_123) (= |v_ULTIMATE.start_main_~#t888~0.offset_19| 0) (= 0 v_~__unbuffered_p2_EAX~0_85) (= |v_#NULL.offset_7| 0) (= v_~main$tmp_guard0~0_18 0) (= v_~z~0_127 0) (= v_~z$mem_tmp~0_16 0) (= v_~z$r_buff0_thd2~0_289 0) (= v_~z$read_delayed_var~0.base_4 0) (= (store |v_#memory_int_22| |v_ULTIMATE.start_main_~#t888~0.base_26| (store (select |v_#memory_int_22| |v_ULTIMATE.start_main_~#t888~0.base_26|) |v_ULTIMATE.start_main_~#t888~0.offset_19| 0)) |v_#memory_int_21|) (< 0 |v_#StackHeapBarrier_19|) (= v_~z$w_buff0~0_373 0) (= v_~__unbuffered_p2_EBX~0_85 0) (= v_~z$read_delayed~0_5 0) (= v_~z$read_delayed_var~0.offset_4 0) (= v_~a~0_68 0) (= v_~z$r_buff0_thd1~0_24 0) (= v_~y~0_12 0) (= 0 v_~__unbuffered_p1_EAX~0_29) (< |v_#StackHeapBarrier_19| |v_ULTIMATE.start_main_~#t888~0.base_26|) (= v_~z$r_buff1_thd0~0_127 0) (= |v_#valid_65| (store .cse0 |v_ULTIMATE.start_main_~#t888~0.base_26| 1)) (= v_~z$r_buff0_thd0~0_88 0) (= v_~z$w_buff1_used~0_415 0) (= (select .cse0 |v_ULTIMATE.start_main_~#t888~0.base_26|) 0) (= 0 |v_#NULL.base_7|) (= 0 v_~z$flush_delayed~0_41) (= v_~b~0_31 0) (= v_~z$w_buff0_used~0_644 0) (= 0 v_~z$r_buff0_thd3~0_138) (= v_~__unbuffered_p1_EBX~0_47 0) (= v_~z$r_buff1_thd2~0_233 0) (= v_~x~0_36 0) (= v_~main$tmp_guard1~0_25 0))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_19|, #valid=|v_#valid_67|, #memory_int=|v_#memory_int_22|, #length=|v_#length_26|} OutVars{ULTIMATE.start_main_#t~nondet32=|v_ULTIMATE.start_main_#t~nondet32_9|, ULTIMATE.start_main_#t~nondet34=|v_ULTIMATE.start_main_#t~nondet34_19|, ~z$r_buff1_thd2~0=v_~z$r_buff1_thd2~0_233, #NULL.offset=|v_#NULL.offset_7|, ~a~0=v_~a~0_68, ~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_88, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_29, #length=|v_#length_25|, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_85, ULTIMATE.start_main_~#t888~0.offset=|v_ULTIMATE.start_main_~#t888~0.offset_19|, ULTIMATE.start_main_~#t890~0.offset=|v_ULTIMATE.start_main_~#t890~0.offset_16|, ~z$mem_tmp~0=v_~z$mem_tmp~0_16, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_85, ULTIMATE.start_main_#t~ite39=|v_ULTIMATE.start_main_#t~ite39_31|, ULTIMATE.start_main_#t~ite35=|v_ULTIMATE.start_main_#t~ite35_79|, ULTIMATE.start_main_~#t889~0.base=|v_ULTIMATE.start_main_~#t889~0.base_19|, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_415, ULTIMATE.start_main_#t~ite37=|v_ULTIMATE.start_main_#t~ite37_37|, ~z$flush_delayed~0=v_~z$flush_delayed~0_41, ~weak$$choice0~0=v_~weak$$choice0~0_10, #StackHeapBarrier=|v_#StackHeapBarrier_19|, ULTIMATE.start_main_#t~ite40=|v_ULTIMATE.start_main_#t~ite40_53|, ULTIMATE.start_main_~#t888~0.base=|v_ULTIMATE.start_main_~#t888~0.base_26|, ~z$r_buff1_thd1~0=v_~z$r_buff1_thd1~0_69, ~z$read_delayed_var~0.base=v_~z$read_delayed_var~0.base_4, ~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_138, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_89, ~x~0=v_~x~0_36, ULTIMATE.start_main_#t~nondet33=|v_ULTIMATE.start_main_#t~nondet33_9|, ULTIMATE.start_main_~#t890~0.base=|v_ULTIMATE.start_main_~#t890~0.base_19|, ~z$read_delayed~0=v_~z$read_delayed~0_5, ~z$w_buff1~0=v_~z$w_buff1~0_237, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_25, ~z$read_delayed_var~0.offset=v_~z$read_delayed_var~0.offset_4, ~z$r_buff1_thd0~0=v_~z$r_buff1_thd0~0_127, ~y~0=v_~y~0_12, ~z$r_buff0_thd2~0=v_~z$r_buff0_thd2~0_289, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_47, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_644, ~z$w_buff0~0=v_~z$w_buff0~0_373, ~z$r_buff1_thd3~0=v_~z$r_buff1_thd3~0_123, ULTIMATE.start_main_#t~ite36=|v_ULTIMATE.start_main_#t~ite36_71|, ULTIMATE.start_main_#t~ite38=|v_ULTIMATE.start_main_#t~ite38_77|, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_18, ULTIMATE.start_main_~#t889~0.offset=|v_ULTIMATE.start_main_~#t889~0.offset_16|, #NULL.base=|v_#NULL.base_7|, ~b~0=v_~b~0_31, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_18|, #valid=|v_#valid_65|, #memory_int=|v_#memory_int_21|, ~z~0=v_~z~0_127, ~weak$$choice2~0=v_~weak$$choice2~0_155, ~z$r_buff0_thd1~0=v_~z$r_buff0_thd1~0_24} 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_p1_EAX~0, #length, ~__unbuffered_p2_EAX~0, ULTIMATE.start_main_~#t888~0.offset, ULTIMATE.start_main_~#t890~0.offset, ~z$mem_tmp~0, ~__unbuffered_p2_EBX~0, ULTIMATE.start_main_#t~ite39, ULTIMATE.start_main_#t~ite35, ULTIMATE.start_main_~#t889~0.base, ~z$w_buff1_used~0, ULTIMATE.start_main_#t~ite37, ~z$flush_delayed~0, ~weak$$choice0~0, ULTIMATE.start_main_#t~ite40, ULTIMATE.start_main_~#t888~0.base, ~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_~#t890~0.base, ~z$read_delayed~0, ~z$w_buff1~0, ~main$tmp_guard1~0, ~z$read_delayed_var~0.offset, ~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, ULTIMATE.start_main_~#t889~0.offset, #NULL.base, ~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:27,828 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [707] [707] L830-1-->L832: Formula: (and (= 0 (select |v_#valid_40| |v_ULTIMATE.start_main_~#t889~0.base_11|)) (= (store |v_#valid_40| |v_ULTIMATE.start_main_~#t889~0.base_11| 1) |v_#valid_39|) (< |v_#StackHeapBarrier_11| |v_ULTIMATE.start_main_~#t889~0.base_11|) (= (store |v_#length_16| |v_ULTIMATE.start_main_~#t889~0.base_11| 4) |v_#length_15|) (= (store |v_#memory_int_12| |v_ULTIMATE.start_main_~#t889~0.base_11| (store (select |v_#memory_int_12| |v_ULTIMATE.start_main_~#t889~0.base_11|) |v_ULTIMATE.start_main_~#t889~0.offset_10| 1)) |v_#memory_int_11|) (= |v_ULTIMATE.start_main_~#t889~0.offset_10| 0) (not (= |v_ULTIMATE.start_main_~#t889~0.base_11| 0))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_11|, #valid=|v_#valid_40|, #memory_int=|v_#memory_int_12|, #length=|v_#length_16|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_11|, ULTIMATE.start_main_#t~nondet32=|v_ULTIMATE.start_main_#t~nondet32_5|, #valid=|v_#valid_39|, #memory_int=|v_#memory_int_11|, ULTIMATE.start_main_~#t889~0.base=|v_ULTIMATE.start_main_~#t889~0.base_11|, #length=|v_#length_15|, ULTIMATE.start_main_~#t889~0.offset=|v_ULTIMATE.start_main_~#t889~0.offset_10|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet32, #valid, #memory_int, ULTIMATE.start_main_~#t889~0.base, #length, ULTIMATE.start_main_~#t889~0.offset] because there is no mapped edge [2019-11-28 18:12:27,828 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [711] [711] L832-1-->L834: Formula: (and (= (store |v_#memory_int_14| |v_ULTIMATE.start_main_~#t890~0.base_13| (store (select |v_#memory_int_14| |v_ULTIMATE.start_main_~#t890~0.base_13|) |v_ULTIMATE.start_main_~#t890~0.offset_11| 2)) |v_#memory_int_13|) (= |v_#length_17| (store |v_#length_18| |v_ULTIMATE.start_main_~#t890~0.base_13| 4)) (not (= |v_ULTIMATE.start_main_~#t890~0.base_13| 0)) (= 0 (select |v_#valid_42| |v_ULTIMATE.start_main_~#t890~0.base_13|)) (= (store |v_#valid_42| |v_ULTIMATE.start_main_~#t890~0.base_13| 1) |v_#valid_41|) (= 0 |v_ULTIMATE.start_main_~#t890~0.offset_11|) (< |v_#StackHeapBarrier_12| |v_ULTIMATE.start_main_~#t890~0.base_13|)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_12|, #valid=|v_#valid_42|, #memory_int=|v_#memory_int_14|, #length=|v_#length_18|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_12|, ULTIMATE.start_main_~#t890~0.base=|v_ULTIMATE.start_main_~#t890~0.base_13|, ULTIMATE.start_main_#t~nondet33=|v_ULTIMATE.start_main_#t~nondet33_5|, #valid=|v_#valid_41|, #memory_int=|v_#memory_int_13|, #length=|v_#length_17|, ULTIMATE.start_main_~#t890~0.offset=|v_ULTIMATE.start_main_~#t890~0.offset_11|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t890~0.base, ULTIMATE.start_main_#t~nondet33, #valid, #memory_int, #length, ULTIMATE.start_main_~#t890~0.offset] because there is no mapped edge [2019-11-28 18:12:27,829 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [631] [631] L4-->L807: Formula: (and (= v_~z$r_buff0_thd3~0_39 1) (= v_~__unbuffered_p2_EBX~0_7 v_~b~0_7) (= v_~z$r_buff0_thd2~0_71 v_~z$r_buff1_thd2~0_39) (= v_~z$r_buff1_thd1~0_6 v_~z$r_buff0_thd1~0_7) (= v_~z$r_buff0_thd0~0_20 v_~z$r_buff1_thd0~0_19) (= v_~z$r_buff0_thd3~0_40 v_~z$r_buff1_thd3~0_26) (not (= 0 v_P2Thread1of1ForFork2___VERIFIER_assert_~expression_22)) (= 1 v_~a~0_6) (= v_~__unbuffered_p2_EAX~0_7 v_~a~0_6)) InVars {~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_20, ~b~0=v_~b~0_7, ~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_40, P2Thread1of1ForFork2___VERIFIER_assert_~expression=v_P2Thread1of1ForFork2___VERIFIER_assert_~expression_22, ~z$r_buff0_thd1~0=v_~z$r_buff0_thd1~0_7, ~z$r_buff0_thd2~0=v_~z$r_buff0_thd2~0_71} OutVars{~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_7, ~z$r_buff1_thd3~0=v_~z$r_buff1_thd3~0_26, ~z$r_buff1_thd2~0=v_~z$r_buff1_thd2~0_39, P2Thread1of1ForFork2___VERIFIER_assert_~expression=v_P2Thread1of1ForFork2___VERIFIER_assert_~expression_22, ~a~0=v_~a~0_6, ~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_20, ~b~0=v_~b~0_7, ~z$r_buff1_thd0~0=v_~z$r_buff1_thd0~0_19, ~z$r_buff1_thd1~0=v_~z$r_buff1_thd1~0_6, ~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_39, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_7, ~z$r_buff0_thd1~0=v_~z$r_buff0_thd1~0_7, ~z$r_buff0_thd2~0=v_~z$r_buff0_thd2~0_71} AuxVars[] AssignedVars[~a~0, ~__unbuffered_p2_EBX~0, ~z$r_buff1_thd3~0, ~z$r_buff1_thd0~0, ~z$r_buff1_thd2~0, ~z$r_buff1_thd1~0, ~z$r_buff0_thd3~0, ~__unbuffered_p2_EAX~0] because there is no mapped edge [2019-11-28 18:12:27,830 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [706] [706] P0ENTRY-->P0EXIT: Formula: (and (= v_~b~0_22 1) (= (+ v_~__unbuffered_cnt~0_59 1) v_~__unbuffered_cnt~0_58) (= |v_P0Thread1of1ForFork0_#res.offset_3| 0) (= v_P0Thread1of1ForFork0_~arg.offset_6 |v_P0Thread1of1ForFork0_#in~arg.offset_8|) (= 0 |v_P0Thread1of1ForFork0_#res.base_3|) (= v_~x~0_18 1) (= v_P0Thread1of1ForFork0_~arg.base_6 |v_P0Thread1of1ForFork0_#in~arg.base_8|)) InVars {P0Thread1of1ForFork0_#in~arg.offset=|v_P0Thread1of1ForFork0_#in~arg.offset_8|, P0Thread1of1ForFork0_#in~arg.base=|v_P0Thread1of1ForFork0_#in~arg.base_8|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_59} OutVars{P0Thread1of1ForFork0_#in~arg.offset=|v_P0Thread1of1ForFork0_#in~arg.offset_8|, P0Thread1of1ForFork0_#res.offset=|v_P0Thread1of1ForFork0_#res.offset_3|, ~b~0=v_~b~0_22, P0Thread1of1ForFork0_#in~arg.base=|v_P0Thread1of1ForFork0_#in~arg.base_8|, P0Thread1of1ForFork0_#res.base=|v_P0Thread1of1ForFork0_#res.base_3|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_58, P0Thread1of1ForFork0_~arg.base=v_P0Thread1of1ForFork0_~arg.base_6, ~x~0=v_~x~0_18, P0Thread1of1ForFork0_~arg.offset=v_P0Thread1of1ForFork0_~arg.offset_6} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#res.offset, ~b~0, P0Thread1of1ForFork0_#res.base, ~__unbuffered_cnt~0, P0Thread1of1ForFork0_~arg.base, ~x~0, P0Thread1of1ForFork0_~arg.offset] because there is no mapped edge [2019-11-28 18:12:27,833 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [715] [715] L768-->L768-8: Formula: (let ((.cse1 (= (mod ~weak$$choice2~0_In785945644 256) 0))) (or (and (= |P1Thread1of1ForFork1_#t~ite15_Out785945644| |P1Thread1of1ForFork1_#t~ite14_Out785945644|) (= ~z$w_buff0_used~0_In785945644 |P1Thread1of1ForFork1_#t~ite14_Out785945644|) (let ((.cse0 (= (mod ~z$r_buff0_thd2~0_In785945644 256) 0))) (or (= (mod ~z$w_buff0_used~0_In785945644 256) 0) (and .cse0 (= (mod ~z$w_buff1_used~0_In785945644 256) 0)) (and (= (mod ~z$r_buff1_thd2~0_In785945644 256) 0) .cse0))) .cse1) (and (= |P1Thread1of1ForFork1_#t~ite15_Out785945644| ~z$w_buff0_used~0_In785945644) (not .cse1) (= |P1Thread1of1ForFork1_#t~ite14_In785945644| |P1Thread1of1ForFork1_#t~ite14_Out785945644|)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In785945644, ~z$r_buff1_thd2~0=~z$r_buff1_thd2~0_In785945644, ~z$w_buff1_used~0=~z$w_buff1_used~0_In785945644, ~weak$$choice2~0=~weak$$choice2~0_In785945644, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In785945644, P1Thread1of1ForFork1_#t~ite14=|P1Thread1of1ForFork1_#t~ite14_In785945644|} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In785945644, ~z$r_buff1_thd2~0=~z$r_buff1_thd2~0_In785945644, ~z$w_buff1_used~0=~z$w_buff1_used~0_In785945644, P1Thread1of1ForFork1_#t~ite15=|P1Thread1of1ForFork1_#t~ite15_Out785945644|, ~weak$$choice2~0=~weak$$choice2~0_In785945644, P1Thread1of1ForFork1_#t~ite14=|P1Thread1of1ForFork1_#t~ite14_Out785945644|, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In785945644} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite15, P1Thread1of1ForFork1_#t~ite14] because there is no mapped edge [2019-11-28 18:12:27,835 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [666] [666] L770-->L771: Formula: (and (= v_~z$r_buff0_thd2~0_113 v_~z$r_buff0_thd2~0_112) (not (= (mod v_~weak$$choice2~0_37 256) 0))) InVars {~weak$$choice2~0=v_~weak$$choice2~0_37, ~z$r_buff0_thd2~0=v_~z$r_buff0_thd2~0_113} OutVars{P1Thread1of1ForFork1_#t~ite19=|v_P1Thread1of1ForFork1_#t~ite19_13|, P1Thread1of1ForFork1_#t~ite20=|v_P1Thread1of1ForFork1_#t~ite20_8|, P1Thread1of1ForFork1_#t~ite21=|v_P1Thread1of1ForFork1_#t~ite21_5|, ~weak$$choice2~0=v_~weak$$choice2~0_37, ~z$r_buff0_thd2~0=v_~z$r_buff0_thd2~0_112} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite19, P1Thread1of1ForFork1_#t~ite20, P1Thread1of1ForFork1_#t~ite21, ~z$r_buff0_thd2~0] because there is no mapped edge [2019-11-28 18:12:27,836 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [659] [659] L773-->L781: Formula: (and (not (= (mod v_~z$flush_delayed~0_13 256) 0)) (= 0 v_~z$flush_delayed~0_12) (= v_~z~0_41 v_~z$mem_tmp~0_6) (= (+ v_~__unbuffered_cnt~0_26 1) v_~__unbuffered_cnt~0_25)) InVars {~z$mem_tmp~0=v_~z$mem_tmp~0_6, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_26, ~z$flush_delayed~0=v_~z$flush_delayed~0_13} OutVars{~z$mem_tmp~0=v_~z$mem_tmp~0_6, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_25, ~z$flush_delayed~0=v_~z$flush_delayed~0_12, ~z~0=v_~z~0_41, P1Thread1of1ForFork1_#t~ite25=|v_P1Thread1of1ForFork1_#t~ite25_13|} AuxVars[] AssignedVars[~__unbuffered_cnt~0, ~z$flush_delayed~0, ~z~0, P1Thread1of1ForFork1_#t~ite25] because there is no mapped edge [2019-11-28 18:12:27,837 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [679] [679] L808-->L808-2: Formula: (let ((.cse1 (= (mod ~z$w_buff0_used~0_In-554757221 256) 0)) (.cse0 (= (mod ~z$r_buff0_thd3~0_In-554757221 256) 0))) (or (and (not .cse0) (= 0 |P2Thread1of1ForFork2_#t~ite28_Out-554757221|) (not .cse1)) (and (= ~z$w_buff0_used~0_In-554757221 |P2Thread1of1ForFork2_#t~ite28_Out-554757221|) (or .cse1 .cse0)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-554757221, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-554757221} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In-554757221, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-554757221, P2Thread1of1ForFork2_#t~ite28=|P2Thread1of1ForFork2_#t~ite28_Out-554757221|} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite28] because there is no mapped edge [2019-11-28 18:12:27,838 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [680] [680] L809-->L809-2: Formula: (let ((.cse0 (= (mod ~z$r_buff1_thd3~0_In-755894144 256) 0)) (.cse1 (= (mod ~z$w_buff1_used~0_In-755894144 256) 0)) (.cse3 (= (mod ~z$w_buff0_used~0_In-755894144 256) 0)) (.cse2 (= 0 (mod ~z$r_buff0_thd3~0_In-755894144 256)))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= 0 |P2Thread1of1ForFork2_#t~ite29_Out-755894144|)) (and (or .cse0 .cse1) (or .cse3 .cse2) (= ~z$w_buff1_used~0_In-755894144 |P2Thread1of1ForFork2_#t~ite29_Out-755894144|)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-755894144, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In-755894144, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-755894144, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-755894144} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In-755894144, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In-755894144, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-755894144, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-755894144, P2Thread1of1ForFork2_#t~ite29=|P2Thread1of1ForFork2_#t~ite29_Out-755894144|} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite29] because there is no mapped edge [2019-11-28 18:12:27,839 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [673] [673] L810-->L811: Formula: (let ((.cse1 (= ~z$r_buff0_thd3~0_Out1342880734 ~z$r_buff0_thd3~0_In1342880734)) (.cse0 (= 0 (mod ~z$r_buff0_thd3~0_In1342880734 256))) (.cse2 (= 0 (mod ~z$w_buff0_used~0_In1342880734 256)))) (or (and .cse0 .cse1) (and .cse2 .cse1) (and (not .cse0) (not .cse2) (= ~z$r_buff0_thd3~0_Out1342880734 0)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In1342880734, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In1342880734} OutVars{P2Thread1of1ForFork2_#t~ite30=|P2Thread1of1ForFork2_#t~ite30_Out1342880734|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1342880734, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_Out1342880734} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite30, ~z$r_buff0_thd3~0] because there is no mapped edge [2019-11-28 18:12:27,839 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [681] [681] L811-->L811-2: Formula: (let ((.cse2 (= (mod ~z$r_buff1_thd3~0_In-72132857 256) 0)) (.cse3 (= 0 (mod ~z$w_buff1_used~0_In-72132857 256))) (.cse1 (= 0 (mod ~z$r_buff0_thd3~0_In-72132857 256))) (.cse0 (= 0 (mod ~z$w_buff0_used~0_In-72132857 256)))) (or (and (= 0 |P2Thread1of1ForFork2_#t~ite31_Out-72132857|) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (= ~z$r_buff1_thd3~0_In-72132857 |P2Thread1of1ForFork2_#t~ite31_Out-72132857|) (or .cse2 .cse3) (or .cse1 .cse0)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-72132857, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In-72132857, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-72132857, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-72132857} OutVars{P2Thread1of1ForFork2_#t~ite31=|P2Thread1of1ForFork2_#t~ite31_Out-72132857|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-72132857, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In-72132857, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-72132857, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-72132857} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite31] because there is no mapped edge [2019-11-28 18:12:27,839 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [695] [695] L811-2-->P2EXIT: Formula: (and (= (+ v_~__unbuffered_cnt~0_46 1) v_~__unbuffered_cnt~0_45) (= 0 |v_P2Thread1of1ForFork2_#res.base_3|) (= |v_P2Thread1of1ForFork2_#res.offset_3| 0) (= |v_P2Thread1of1ForFork2_#t~ite31_28| v_~z$r_buff1_thd3~0_49)) InVars {P2Thread1of1ForFork2_#t~ite31=|v_P2Thread1of1ForFork2_#t~ite31_28|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_46} OutVars{P2Thread1of1ForFork2_#t~ite31=|v_P2Thread1of1ForFork2_#t~ite31_27|, ~z$r_buff1_thd3~0=v_~z$r_buff1_thd3~0_49, P2Thread1of1ForFork2_#res.base=|v_P2Thread1of1ForFork2_#res.base_3|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_45, P2Thread1of1ForFork2_#res.offset=|v_P2Thread1of1ForFork2_#res.offset_3|} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite31, ~z$r_buff1_thd3~0, P2Thread1of1ForFork2_#res.base, ~__unbuffered_cnt~0, P2Thread1of1ForFork2_#res.offset] because there is no mapped edge [2019-11-28 18:12:27,839 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [604] [604] L834-1-->L840: Formula: (and (not (= 0 (mod v_~main$tmp_guard0~0_6 256))) (= v_~main$tmp_guard0~0_6 (ite (= 0 (ite (= 3 v_~__unbuffered_cnt~0_13) 1 0)) 0 1))) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_13} OutVars{ULTIMATE.start_main_#t~nondet34=|v_ULTIMATE.start_main_#t~nondet34_5|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_13, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_6} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet34, ~main$tmp_guard0~0] because there is no mapped edge [2019-11-28 18:12:27,840 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [686] [686] L840-2-->L840-4: Formula: (let ((.cse1 (= 0 (mod ~z$w_buff1_used~0_In-1293383138 256))) (.cse0 (= 0 (mod ~z$r_buff1_thd0~0_In-1293383138 256)))) (or (and (not .cse0) (= ~z$w_buff1~0_In-1293383138 |ULTIMATE.start_main_#t~ite35_Out-1293383138|) (not .cse1)) (and (or .cse1 .cse0) (= ~z~0_In-1293383138 |ULTIMATE.start_main_#t~ite35_Out-1293383138|)))) InVars {~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In-1293383138, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1293383138, ~z$w_buff1~0=~z$w_buff1~0_In-1293383138, ~z~0=~z~0_In-1293383138} OutVars{~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In-1293383138, ULTIMATE.start_main_#t~ite35=|ULTIMATE.start_main_#t~ite35_Out-1293383138|, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1293383138, ~z$w_buff1~0=~z$w_buff1~0_In-1293383138, ~z~0=~z~0_In-1293383138} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite35] because there is no mapped edge [2019-11-28 18:12:27,840 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [649] [649] L840-4-->L841: Formula: (= v_~z~0_31 |v_ULTIMATE.start_main_#t~ite35_22|) InVars {ULTIMATE.start_main_#t~ite35=|v_ULTIMATE.start_main_#t~ite35_22|} OutVars{ULTIMATE.start_main_#t~ite35=|v_ULTIMATE.start_main_#t~ite35_21|, ULTIMATE.start_main_#t~ite36=|v_ULTIMATE.start_main_#t~ite36_19|, ~z~0=v_~z~0_31} 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:27,840 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [676] [676] L841-->L841-2: Formula: (let ((.cse0 (= 0 (mod ~z$w_buff0_used~0_In-379188262 256))) (.cse1 (= 0 (mod ~z$r_buff0_thd0~0_In-379188262 256)))) (or (and (or .cse0 .cse1) (= |ULTIMATE.start_main_#t~ite37_Out-379188262| ~z$w_buff0_used~0_In-379188262)) (and (not .cse0) (= |ULTIMATE.start_main_#t~ite37_Out-379188262| 0) (not .cse1)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-379188262, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-379188262} OutVars{~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-379188262, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-379188262, ULTIMATE.start_main_#t~ite37=|ULTIMATE.start_main_#t~ite37_Out-379188262|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite37] because there is no mapped edge [2019-11-28 18:12:27,841 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [671] [671] L842-->L842-2: Formula: (let ((.cse0 (= (mod ~z$w_buff0_used~0_In-203445881 256) 0)) (.cse1 (= (mod ~z$r_buff0_thd0~0_In-203445881 256) 0)) (.cse3 (= 0 (mod ~z$w_buff1_used~0_In-203445881 256))) (.cse2 (= (mod ~z$r_buff1_thd0~0_In-203445881 256) 0))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= |ULTIMATE.start_main_#t~ite38_Out-203445881| 0)) (and (or .cse0 .cse1) (or .cse3 .cse2) (= |ULTIMATE.start_main_#t~ite38_Out-203445881| ~z$w_buff1_used~0_In-203445881)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-203445881, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-203445881, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In-203445881, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-203445881} OutVars{~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-203445881, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-203445881, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In-203445881, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-203445881, ULTIMATE.start_main_#t~ite38=|ULTIMATE.start_main_#t~ite38_Out-203445881|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite38] because there is no mapped edge [2019-11-28 18:12:27,841 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [687] [687] L843-->L843-2: Formula: (let ((.cse0 (= 0 (mod ~z$r_buff0_thd0~0_In-1536042643 256))) (.cse1 (= 0 (mod ~z$w_buff0_used~0_In-1536042643 256)))) (or (and (not .cse0) (not .cse1) (= |ULTIMATE.start_main_#t~ite39_Out-1536042643| 0)) (and (= |ULTIMATE.start_main_#t~ite39_Out-1536042643| ~z$r_buff0_thd0~0_In-1536042643) (or .cse0 .cse1)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-1536042643, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1536042643} OutVars{~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-1536042643, ULTIMATE.start_main_#t~ite39=|ULTIMATE.start_main_#t~ite39_Out-1536042643|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1536042643} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite39] because there is no mapped edge [2019-11-28 18:12:27,842 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [682] [682] L844-->L844-2: Formula: (let ((.cse2 (= 0 (mod ~z$r_buff1_thd0~0_In1991638695 256))) (.cse3 (= 0 (mod ~z$w_buff1_used~0_In1991638695 256))) (.cse1 (= 0 (mod ~z$r_buff0_thd0~0_In1991638695 256))) (.cse0 (= 0 (mod ~z$w_buff0_used~0_In1991638695 256)))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= |ULTIMATE.start_main_#t~ite40_Out1991638695| 0)) (and (or .cse2 .cse3) (= |ULTIMATE.start_main_#t~ite40_Out1991638695| ~z$r_buff1_thd0~0_In1991638695) (or .cse1 .cse0)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In1991638695, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1991638695, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In1991638695, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1991638695} OutVars{~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In1991638695, ULTIMATE.start_main_#t~ite40=|ULTIMATE.start_main_#t~ite40_Out1991638695|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1991638695, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In1991638695, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1991638695} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite40] because there is no mapped edge [2019-11-28 18:12:27,842 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [723] [723] L844-2-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= |v_ULTIMATE.start___VERIFIER_assert_#in~expression_12| (mod v_~main$tmp_guard1~0_20 256)) (= v_ULTIMATE.start___VERIFIER_assert_~expression_15 |v_ULTIMATE.start___VERIFIER_assert_#in~expression_12|) (= (ite (= 0 (ite (not (and (= 1 v_~__unbuffered_p2_EAX~0_80) (= 1 v_~__unbuffered_p1_EAX~0_24) (= v_~__unbuffered_p2_EBX~0_80 0) (= v_~x~0_31 2) (= v_~__unbuffered_p1_EBX~0_41 0))) 1 0)) 0 1) v_~main$tmp_guard1~0_20) (= v_ULTIMATE.start___VERIFIER_assert_~expression_15 0) (= v_~z$r_buff1_thd0~0_122 |v_ULTIMATE.start_main_#t~ite40_46|)) InVars {~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_41, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_80, ULTIMATE.start_main_#t~ite40=|v_ULTIMATE.start_main_#t~ite40_46|, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_24, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_80, ~x~0=v_~x~0_31} OutVars{ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_15, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_41, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_80, ULTIMATE.start_main_#t~ite40=|v_ULTIMATE.start_main_#t~ite40_45|, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_24, ~z$r_buff1_thd0~0=v_~z$r_buff1_thd0~0_122, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_20, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_80, ~x~0=v_~x~0_31, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_12|} 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:27,964 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2019-11-28 18:12:27,964 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-11-28 18:12:27,966 INFO L168 Benchmark]: Toolchain (without parser) took 15379.36 ms. Allocated memory was 1.0 GB in the beginning and 1.6 GB in the end (delta: 533.7 MB). Free memory was 956.3 MB in the beginning and 1.0 GB in the end (delta: -68.0 MB). Peak memory consumption was 465.7 MB. Max. memory is 11.5 GB. [2019-11-28 18:12:27,971 INFO L168 Benchmark]: CDTParser took 0.89 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:27,974 INFO L168 Benchmark]: CACSL2BoogieTranslator took 807.31 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 126.9 MB). Free memory was 956.3 MB in the beginning and 1.1 GB in the end (delta: -131.8 MB). Peak memory consumption was 20.7 MB. Max. memory is 11.5 GB. [2019-11-28 18:12:27,975 INFO L168 Benchmark]: Boogie Procedure Inliner took 75.14 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.7 MB). Peak memory consumption was 6.7 MB. Max. memory is 11.5 GB. [2019-11-28 18:12:27,975 INFO L168 Benchmark]: Boogie Preprocessor took 69.16 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:27,975 INFO L168 Benchmark]: RCFGBuilder took 756.18 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 45.3 MB). Peak memory consumption was 45.3 MB. Max. memory is 11.5 GB. [2019-11-28 18:12:27,976 INFO L168 Benchmark]: TraceAbstraction took 13519.57 ms. Allocated memory was 1.2 GB in the beginning and 1.6 GB in the end (delta: 406.8 MB). Free memory was 1.0 GB in the beginning and 1.0 GB in the end (delta: -1.4 MB). Peak memory consumption was 405.4 MB. Max. memory is 11.5 GB. [2019-11-28 18:12:27,978 INFO L168 Benchmark]: Witness Printer took 145.02 ms. Allocated memory is still 1.6 GB. Free memory was 1.0 GB in the beginning and 1.0 GB in the end (delta: 13.2 MB). Peak memory consumption was 13.2 MB. Max. memory is 11.5 GB. [2019-11-28 18:12:27,980 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.89 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 807.31 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 126.9 MB). Free memory was 956.3 MB in the beginning and 1.1 GB in the end (delta: -131.8 MB). Peak memory consumption was 20.7 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 75.14 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.7 MB). Peak memory consumption was 6.7 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 69.16 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 756.18 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 45.3 MB). Peak memory consumption was 45.3 MB. Max. memory is 11.5 GB. * TraceAbstraction took 13519.57 ms. Allocated memory was 1.2 GB in the beginning and 1.6 GB in the end (delta: 406.8 MB). Free memory was 1.0 GB in the beginning and 1.0 GB in the end (delta: -1.4 MB). Peak memory consumption was 405.4 MB. Max. memory is 11.5 GB. * Witness Printer took 145.02 ms. Allocated memory is still 1.6 GB. Free memory was 1.0 GB in the beginning and 1.0 GB in the end (delta: 13.2 MB). Peak memory consumption was 13.2 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks LbeTime: 5.2s, 155 ProgramPointsBefore, 70 ProgramPointsAfterwards, 180 TransitionsBefore, 78 TransitionsAfterwards, 11400 CoEnabledTransitionPairs, 7 FixpointIterations, 36 TrivialSequentialCompositions, 45 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 31 ConcurrentYvCompositions, 21 ChoiceCompositions, 4873 VarBasedMoverChecksPositive, 192 VarBasedMoverChecksNegative, 55 SemBasedMoverChecksPositive, 173 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 1.3s, 0 MoverChecksTotal, 39797 CheckedPairsTotal, 112 TotalNumberOfCompositions - CounterExampleResult [Line: 4]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L830] FCALL, FORK 0 pthread_create(&t888, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=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] [L832] FCALL, FORK 0 pthread_create(&t889, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=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] [L834] FCALL, FORK 0 pthread_create(&t890, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=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] [L786] 3 z$w_buff1 = z$w_buff0 [L787] 3 z$w_buff0 = 1 [L788] 3 z$w_buff1_used = z$w_buff0_used [L789] 3 z$w_buff0_used = (_Bool)1 [L752] 2 x = 2 [L755] 2 y = 1 [L758] 2 __unbuffered_p1_EAX = y [L761] 2 weak$$choice0 = __VERIFIER_nondet_bool() [L762] 2 weak$$choice2 = __VERIFIER_nondet_bool() [L763] 2 z$flush_delayed = weak$$choice2 [L764] 2 z$mem_tmp = z VAL [\result={0:0}, __unbuffered_cnt=1, __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=2, 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] [L765] 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_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=2, 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] [L765] 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) [L766] 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=1, __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=2, 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] [L766] 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)) [L767] 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=1, __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=2, 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] 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)) [L768] 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)) [L769] 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=1, __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=2, 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] [L769] 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)) [L771] 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=1, __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=2, 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] [L771] 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)) [L772] 2 __unbuffered_p1_EBX = z VAL [\result={0:0}, __unbuffered_cnt=1, __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=2, 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] [L807] 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 [\result={0:0}, __unbuffered_cnt=2, __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=2, 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=1, z$w_buff1=0, z$w_buff1_used=0] [L807] 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) [L808] 3 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used [L809] 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 [L840] 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_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=2, y=1, z=1, 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] [L841] 0 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used [L842] 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 [L843] 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, 146 locations, 2 error locations. Result: UNSAFE, OverallTime: 13.2s, OverallIterations: 13, TraceHistogramMax: 1, AutomataDifference: 3.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 1393 SDtfs, 1594 SDslu, 2873 SDs, 0 SdLazy, 1383 SolverSat, 86 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 1.5s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 80 GetRequests, 21 SyntacticMatches, 5 SemanticMatches, 54 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 71 ImplicationChecksByTransitivity, 0.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=11878occurred in iteration=0, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 1.4s AutomataMinimizationTime, 12 MinimizatonAttempts, 3794 StatesRemovedByMinimization, 7 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 1.2s InterpolantComputationTime, 408 NumberOfCodeBlocks, 408 NumberOfCodeBlocksAsserted, 13 NumberOfCheckSat, 351 ConstructedInterpolants, 0 QuantifiedInterpolants, 77001 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 12 InterpolantComputations, 12 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...