/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -s ../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA-SemanticLbe.epf -i ../../../trunk/examples/svcomp/pthread-wmm/mix038_tso.oepc.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-4336eb1 [2019-12-27 02:25:43,141 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-27 02:25:43,144 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-27 02:25:43,161 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-27 02:25:43,161 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-27 02:25:43,163 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-27 02:25:43,164 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-27 02:25:43,166 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-27 02:25:43,167 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-27 02:25:43,168 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-27 02:25:43,169 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-27 02:25:43,170 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-27 02:25:43,171 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-27 02:25:43,172 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-27 02:25:43,173 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-27 02:25:43,174 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-27 02:25:43,174 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-27 02:25:43,175 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-27 02:25:43,177 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-27 02:25:43,179 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-27 02:25:43,180 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-27 02:25:43,184 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-27 02:25:43,185 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-27 02:25:43,189 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-27 02:25:43,194 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-27 02:25:43,194 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-27 02:25:43,194 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-27 02:25:43,195 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-27 02:25:43,197 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-27 02:25:43,199 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-27 02:25:43,200 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-27 02:25:43,201 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-27 02:25:43,202 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-27 02:25:43,204 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-27 02:25:43,205 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-27 02:25:43,205 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-27 02:25:43,209 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-27 02:25:43,209 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-27 02:25:43,209 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-27 02:25:43,213 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-27 02:25:43,214 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-27 02:25:43,214 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA-SemanticLbe.epf [2019-12-27 02:25:43,236 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-27 02:25:43,237 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-27 02:25:43,239 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-27 02:25:43,239 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-27 02:25:43,239 INFO L138 SettingsManager]: * Use SBE=true [2019-12-27 02:25:43,239 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-27 02:25:43,239 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-27 02:25:43,240 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-27 02:25:43,240 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-27 02:25:43,240 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-27 02:25:43,241 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-27 02:25:43,242 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-27 02:25:43,242 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-27 02:25:43,242 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-27 02:25:43,243 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-27 02:25:43,243 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-27 02:25:43,243 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-27 02:25:43,243 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-27 02:25:43,243 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-12-27 02:25:43,244 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-27 02:25:43,244 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-27 02:25:43,244 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-27 02:25:43,245 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-27 02:25:43,245 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-27 02:25:43,245 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-27 02:25:43,245 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-12-27 02:25:43,245 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-27 02:25:43,246 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-27 02:25:43,246 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-12-27 02:25:43,539 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-27 02:25:43,552 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-27 02:25:43,555 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-27 02:25:43,557 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-27 02:25:43,557 INFO L275 PluginConnector]: CDTParser initialized [2019-12-27 02:25:43,558 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix038_tso.oepc.i [2019-12-27 02:25:43,633 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/cf3a1a9ba/bc531f2147e24bfba434695d26c6f399/FLAGf551c510f [2019-12-27 02:25:44,189 INFO L306 CDTParser]: Found 1 translation units. [2019-12-27 02:25:44,190 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix038_tso.oepc.i [2019-12-27 02:25:44,210 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/cf3a1a9ba/bc531f2147e24bfba434695d26c6f399/FLAGf551c510f [2019-12-27 02:25:44,482 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/cf3a1a9ba/bc531f2147e24bfba434695d26c6f399 [2019-12-27 02:25:44,492 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-27 02:25:44,494 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-12-27 02:25:44,495 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-27 02:25:44,495 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-27 02:25:44,499 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-27 02:25:44,500 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.12 02:25:44" (1/1) ... [2019-12-27 02:25:44,503 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@ede1650 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 02:25:44, skipping insertion in model container [2019-12-27 02:25:44,503 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.12 02:25:44" (1/1) ... [2019-12-27 02:25:44,511 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-27 02:25:44,575 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-27 02:25:45,154 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-27 02:25:45,168 INFO L203 MainTranslator]: Completed pre-run [2019-12-27 02:25:45,241 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-27 02:25:45,347 INFO L208 MainTranslator]: Completed translation [2019-12-27 02:25:45,348 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 02:25:45 WrapperNode [2019-12-27 02:25:45,348 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-27 02:25:45,349 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-27 02:25:45,349 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-27 02:25:45,349 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-27 02:25:45,357 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 02:25:45" (1/1) ... [2019-12-27 02:25:45,377 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 02:25:45" (1/1) ... [2019-12-27 02:25:45,411 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-27 02:25:45,411 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-27 02:25:45,412 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-27 02:25:45,412 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-27 02:25:45,421 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 02:25:45" (1/1) ... [2019-12-27 02:25:45,421 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 02:25:45" (1/1) ... [2019-12-27 02:25:45,426 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 02:25:45" (1/1) ... [2019-12-27 02:25:45,427 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 02:25:45" (1/1) ... [2019-12-27 02:25:45,438 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 02:25:45" (1/1) ... [2019-12-27 02:25:45,442 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 02:25:45" (1/1) ... [2019-12-27 02:25:45,446 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 02:25:45" (1/1) ... [2019-12-27 02:25:45,451 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-27 02:25:45,452 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-27 02:25:45,452 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-27 02:25:45,452 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-27 02:25:45,453 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 02:25:45" (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-12-27 02:25:45,519 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-12-27 02:25:45,519 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2019-12-27 02:25:45,520 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-12-27 02:25:45,520 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-12-27 02:25:45,520 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2019-12-27 02:25:45,520 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2019-12-27 02:25:45,521 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2019-12-27 02:25:45,521 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2019-12-27 02:25:45,521 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2019-12-27 02:25:45,522 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2019-12-27 02:25:45,522 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2019-12-27 02:25:45,522 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-27 02:25:45,522 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-27 02:25:45,524 WARN L205 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2019-12-27 02:25:46,331 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-27 02:25:46,332 INFO L287 CfgBuilder]: Removed 8 assume(true) statements. [2019-12-27 02:25:46,333 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.12 02:25:46 BoogieIcfgContainer [2019-12-27 02:25:46,333 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-27 02:25:46,335 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-27 02:25:46,335 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-27 02:25:46,339 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-27 02:25:46,339 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 27.12 02:25:44" (1/3) ... [2019-12-27 02:25:46,340 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7096bc5f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.12 02:25:46, skipping insertion in model container [2019-12-27 02:25:46,340 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 02:25:45" (2/3) ... [2019-12-27 02:25:46,341 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7096bc5f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.12 02:25:46, skipping insertion in model container [2019-12-27 02:25:46,341 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.12 02:25:46" (3/3) ... [2019-12-27 02:25:46,343 INFO L109 eAbstractionObserver]: Analyzing ICFG mix038_tso.oepc.i [2019-12-27 02:25:46,353 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-12-27 02:25:46,353 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-27 02:25:46,362 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2019-12-27 02:25:46,363 INFO L340 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2019-12-27 02:25:46,398 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:25:46,398 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:25:46,399 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:25:46,399 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:25:46,399 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:25:46,400 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:25:46,400 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:25:46,400 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:25:46,400 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:25:46,401 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:25:46,401 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:25:46,401 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:25:46,402 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:25:46,402 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:25:46,402 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:25:46,402 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:25:46,403 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:25:46,403 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:25:46,403 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:25:46,403 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:25:46,404 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:25:46,404 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:25:46,404 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:25:46,404 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:25:46,405 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:25:46,405 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:25:46,405 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:25:46,406 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:25:46,406 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:25:46,406 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:25:46,407 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:25:46,407 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:25:46,408 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:25:46,408 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:25:46,408 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:25:46,408 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:25:46,409 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:25:46,409 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:25:46,409 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:25:46,410 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:25:46,410 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:25:46,410 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:25:46,410 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:25:46,411 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:25:46,411 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:25:46,411 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:25:46,412 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:25:46,412 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:25:46,412 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:25:46,412 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:25:46,412 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:25:46,413 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:25:46,413 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:25:46,413 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:25:46,414 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:25:46,414 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:25:46,414 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:25:46,414 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:25:46,415 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:25:46,415 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:25:46,415 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:25:46,415 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:25:46,416 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:25:46,416 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:25:46,416 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:25:46,417 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:25:46,417 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:25:46,417 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:25:46,417 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:25:46,418 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:25:46,418 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:25:46,418 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:25:46,418 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:25:46,435 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:25:46,435 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:25:46,437 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:25:46,437 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:25:46,438 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:25:46,438 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:25:46,438 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:25:46,438 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:25:46,439 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:25:46,439 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:25:46,439 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:25:46,439 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:25:46,439 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:25:46,440 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:25:46,440 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:25:46,440 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:25:46,440 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:25:46,441 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:25:46,441 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:25:46,441 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:25:46,441 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:25:46,445 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:25:46,445 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:25:46,445 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:25:46,445 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:25:46,446 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:25:46,446 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:25:46,446 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:25:46,446 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:25:46,446 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:25:46,447 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:25:46,449 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:25:46,450 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:25:46,450 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:25:46,450 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:25:46,450 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:25:46,451 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:25:46,451 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:25:46,451 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:25:46,451 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:25:46,451 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:25:46,452 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:25:46,452 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:25:46,454 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:25:46,454 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:25:46,455 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:25:46,455 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:25:46,455 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:25:46,455 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:25:46,456 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:25:46,456 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:25:46,456 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:25:46,456 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:25:46,471 INFO L249 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2019-12-27 02:25:46,492 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-27 02:25:46,492 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-27 02:25:46,492 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-27 02:25:46,492 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-12-27 02:25:46,492 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-27 02:25:46,492 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-27 02:25:46,493 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-27 02:25:46,493 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-27 02:25:46,509 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 177 places, 214 transitions [2019-12-27 02:25:46,511 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 177 places, 214 transitions [2019-12-27 02:25:46,614 INFO L132 PetriNetUnfolder]: 47/211 cut-off events. [2019-12-27 02:25:46,615 INFO L133 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-27 02:25:46,631 INFO L76 FinitePrefix]: Finished finitePrefix Result has 221 conditions, 211 events. 47/211 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 336 event pairs. 0/162 useless extension candidates. Maximal degree in co-relation 179. Up to 2 conditions per place. [2019-12-27 02:25:46,655 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 177 places, 214 transitions [2019-12-27 02:25:46,754 INFO L132 PetriNetUnfolder]: 47/211 cut-off events. [2019-12-27 02:25:46,755 INFO L133 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-27 02:25:46,763 INFO L76 FinitePrefix]: Finished finitePrefix Result has 221 conditions, 211 events. 47/211 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 336 event pairs. 0/162 useless extension candidates. Maximal degree in co-relation 179. Up to 2 conditions per place. [2019-12-27 02:25:46,782 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 17074 [2019-12-27 02:25:46,783 INFO L170 etLargeBlockEncoding]: Semantic Check. [2019-12-27 02:25:51,528 WARN L192 SmtUtils]: Spent 277.00 ms on a formula simplification. DAG size of input: 93 DAG size of output: 91 [2019-12-27 02:25:51,653 WARN L192 SmtUtils]: Spent 122.00 ms on a formula simplification that was a NOOP. DAG size: 89 [2019-12-27 02:25:51,684 INFO L206 etLargeBlockEncoding]: Checked pairs total: 83692 [2019-12-27 02:25:51,685 INFO L214 etLargeBlockEncoding]: Total number of compositions: 112 [2019-12-27 02:25:51,688 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 98 places, 109 transitions [2019-12-27 02:26:12,949 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 129810 states. [2019-12-27 02:26:12,950 INFO L276 IsEmpty]: Start isEmpty. Operand 129810 states. [2019-12-27 02:26:12,957 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-12-27 02:26:12,957 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 02:26:12,958 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-12-27 02:26:12,959 INFO L410 AbstractCegarLoop]: === Iteration 1 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 02:26:12,965 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 02:26:12,965 INFO L82 PathProgramCache]: Analyzing trace with hash 817279571, now seen corresponding path program 1 times [2019-12-27 02:26:12,976 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 02:26:12,976 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1161238643] [2019-12-27 02:26:12,977 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 02:26:13,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 02:26:13,227 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 02:26:13,228 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1161238643] [2019-12-27 02:26:13,229 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 02:26:13,229 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-27 02:26:13,230 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1454462359] [2019-12-27 02:26:13,234 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 02:26:13,235 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 02:26:13,249 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 02:26:13,250 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 02:26:13,253 INFO L87 Difference]: Start difference. First operand 129810 states. Second operand 3 states. [2019-12-27 02:26:17,849 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 02:26:17,851 INFO L93 Difference]: Finished difference Result 129322 states and 554746 transitions. [2019-12-27 02:26:17,852 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 02:26:17,853 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 5 [2019-12-27 02:26:17,853 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 02:26:18,844 INFO L225 Difference]: With dead ends: 129322 [2019-12-27 02:26:18,845 INFO L226 Difference]: Without dead ends: 126774 [2019-12-27 02:26:18,846 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 02:26:24,157 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 126774 states. [2019-12-27 02:26:26,662 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 126774 to 126774. [2019-12-27 02:26:26,663 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 126774 states. [2019-12-27 02:26:27,388 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 126774 states to 126774 states and 544358 transitions. [2019-12-27 02:26:27,389 INFO L78 Accepts]: Start accepts. Automaton has 126774 states and 544358 transitions. Word has length 5 [2019-12-27 02:26:27,390 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 02:26:27,390 INFO L462 AbstractCegarLoop]: Abstraction has 126774 states and 544358 transitions. [2019-12-27 02:26:27,390 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 02:26:27,390 INFO L276 IsEmpty]: Start isEmpty. Operand 126774 states and 544358 transitions. [2019-12-27 02:26:27,393 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-12-27 02:26:27,393 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 02:26:27,393 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 02:26:27,394 INFO L410 AbstractCegarLoop]: === Iteration 2 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 02:26:27,394 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 02:26:27,394 INFO L82 PathProgramCache]: Analyzing trace with hash 1829592591, now seen corresponding path program 1 times [2019-12-27 02:26:27,394 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 02:26:27,395 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1263282179] [2019-12-27 02:26:27,395 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 02:26:31,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 02:26:31,468 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 02:26:31,468 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1263282179] [2019-12-27 02:26:31,468 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 02:26:31,469 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 02:26:31,469 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [875214537] [2019-12-27 02:26:31,470 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 02:26:31,471 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 02:26:31,471 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 02:26:31,471 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-27 02:26:31,471 INFO L87 Difference]: Start difference. First operand 126774 states and 544358 transitions. Second operand 4 states. [2019-12-27 02:26:32,832 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 02:26:32,833 INFO L93 Difference]: Finished difference Result 198214 states and 818020 transitions. [2019-12-27 02:26:32,833 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 02:26:32,833 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 11 [2019-12-27 02:26:32,833 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 02:26:33,466 INFO L225 Difference]: With dead ends: 198214 [2019-12-27 02:26:33,466 INFO L226 Difference]: Without dead ends: 198165 [2019-12-27 02:26:33,467 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-27 02:26:45,263 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 198165 states. [2019-12-27 02:26:49,824 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 198165 to 183268. [2019-12-27 02:26:49,824 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 183268 states. [2019-12-27 02:26:50,420 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 183268 states to 183268 states and 763968 transitions. [2019-12-27 02:26:50,421 INFO L78 Accepts]: Start accepts. Automaton has 183268 states and 763968 transitions. Word has length 11 [2019-12-27 02:26:50,421 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 02:26:50,421 INFO L462 AbstractCegarLoop]: Abstraction has 183268 states and 763968 transitions. [2019-12-27 02:26:50,422 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 02:26:50,422 INFO L276 IsEmpty]: Start isEmpty. Operand 183268 states and 763968 transitions. [2019-12-27 02:26:50,430 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-12-27 02:26:50,430 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 02:26:50,430 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 02:26:50,431 INFO L410 AbstractCegarLoop]: === Iteration 3 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 02:26:50,431 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 02:26:50,431 INFO L82 PathProgramCache]: Analyzing trace with hash -1837025859, now seen corresponding path program 1 times [2019-12-27 02:26:50,431 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 02:26:50,432 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1340278602] [2019-12-27 02:26:50,432 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 02:26:50,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 02:26:50,536 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 02:26:50,537 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1340278602] [2019-12-27 02:26:50,537 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 02:26:50,537 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 02:26:50,537 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1743638201] [2019-12-27 02:26:50,538 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 02:26:50,538 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 02:26:50,538 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 02:26:50,538 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-27 02:26:50,539 INFO L87 Difference]: Start difference. First operand 183268 states and 763968 transitions. Second operand 4 states. [2019-12-27 02:26:59,586 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 02:26:59,587 INFO L93 Difference]: Finished difference Result 261626 states and 1065461 transitions. [2019-12-27 02:26:59,587 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 02:26:59,587 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 13 [2019-12-27 02:26:59,587 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 02:27:00,386 INFO L225 Difference]: With dead ends: 261626 [2019-12-27 02:27:00,386 INFO L226 Difference]: Without dead ends: 261563 [2019-12-27 02:27:00,387 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-27 02:27:08,996 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 261563 states. [2019-12-27 02:27:13,519 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 261563 to 223048. [2019-12-27 02:27:13,520 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 223048 states. [2019-12-27 02:27:24,212 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 223048 states to 223048 states and 922460 transitions. [2019-12-27 02:27:24,213 INFO L78 Accepts]: Start accepts. Automaton has 223048 states and 922460 transitions. Word has length 13 [2019-12-27 02:27:24,214 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 02:27:24,214 INFO L462 AbstractCegarLoop]: Abstraction has 223048 states and 922460 transitions. [2019-12-27 02:27:24,214 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 02:27:24,214 INFO L276 IsEmpty]: Start isEmpty. Operand 223048 states and 922460 transitions. [2019-12-27 02:27:24,217 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-12-27 02:27:24,218 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 02:27:24,218 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 02:27:24,218 INFO L410 AbstractCegarLoop]: === Iteration 4 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 02:27:24,218 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 02:27:24,218 INFO L82 PathProgramCache]: Analyzing trace with hash 2085785430, now seen corresponding path program 1 times [2019-12-27 02:27:24,219 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 02:27:24,219 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [918344621] [2019-12-27 02:27:24,219 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 02:27:24,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 02:27:24,324 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 02:27:24,324 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [918344621] [2019-12-27 02:27:24,324 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 02:27:24,325 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 02:27:24,325 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1527731499] [2019-12-27 02:27:24,325 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 02:27:24,325 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 02:27:24,326 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 02:27:24,326 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-27 02:27:24,326 INFO L87 Difference]: Start difference. First operand 223048 states and 922460 transitions. Second operand 4 states. [2019-12-27 02:27:24,515 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 02:27:24,516 INFO L93 Difference]: Finished difference Result 48374 states and 159119 transitions. [2019-12-27 02:27:24,516 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-27 02:27:24,516 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 13 [2019-12-27 02:27:24,516 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 02:27:24,588 INFO L225 Difference]: With dead ends: 48374 [2019-12-27 02:27:24,589 INFO L226 Difference]: Without dead ends: 43292 [2019-12-27 02:27:24,589 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-27 02:27:24,838 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43292 states. [2019-12-27 02:27:25,269 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43292 to 43292. [2019-12-27 02:27:25,269 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43292 states. [2019-12-27 02:27:25,357 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43292 states to 43292 states and 140285 transitions. [2019-12-27 02:27:25,357 INFO L78 Accepts]: Start accepts. Automaton has 43292 states and 140285 transitions. Word has length 13 [2019-12-27 02:27:25,358 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 02:27:25,358 INFO L462 AbstractCegarLoop]: Abstraction has 43292 states and 140285 transitions. [2019-12-27 02:27:25,358 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 02:27:25,358 INFO L276 IsEmpty]: Start isEmpty. Operand 43292 states and 140285 transitions. [2019-12-27 02:27:25,363 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-12-27 02:27:25,363 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 02:27:25,363 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 02:27:25,364 INFO L410 AbstractCegarLoop]: === Iteration 5 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 02:27:25,364 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 02:27:25,364 INFO L82 PathProgramCache]: Analyzing trace with hash -1321310855, now seen corresponding path program 1 times [2019-12-27 02:27:25,364 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 02:27:25,365 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [421916563] [2019-12-27 02:27:25,365 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 02:27:25,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 02:27:25,491 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 02:27:25,491 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [421916563] [2019-12-27 02:27:25,491 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 02:27:25,492 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 02:27:25,492 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [248809076] [2019-12-27 02:27:25,492 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 02:27:25,492 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 02:27:25,493 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 02:27:25,493 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-27 02:27:25,493 INFO L87 Difference]: Start difference. First operand 43292 states and 140285 transitions. Second operand 5 states. [2019-12-27 02:27:27,810 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 02:27:27,811 INFO L93 Difference]: Finished difference Result 57766 states and 183516 transitions. [2019-12-27 02:27:27,811 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-12-27 02:27:27,811 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 19 [2019-12-27 02:27:27,811 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 02:27:27,905 INFO L225 Difference]: With dead ends: 57766 [2019-12-27 02:27:27,906 INFO L226 Difference]: Without dead ends: 57585 [2019-12-27 02:27:27,906 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2019-12-27 02:27:28,190 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57585 states. [2019-12-27 02:27:28,674 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57585 to 43565. [2019-12-27 02:27:28,674 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43565 states. [2019-12-27 02:27:28,762 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43565 states to 43565 states and 141059 transitions. [2019-12-27 02:27:28,762 INFO L78 Accepts]: Start accepts. Automaton has 43565 states and 141059 transitions. Word has length 19 [2019-12-27 02:27:28,762 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 02:27:28,762 INFO L462 AbstractCegarLoop]: Abstraction has 43565 states and 141059 transitions. [2019-12-27 02:27:28,762 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 02:27:28,763 INFO L276 IsEmpty]: Start isEmpty. Operand 43565 states and 141059 transitions. [2019-12-27 02:27:28,776 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-12-27 02:27:28,776 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 02:27:28,777 INFO L411 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] [2019-12-27 02:27:28,777 INFO L410 AbstractCegarLoop]: === Iteration 6 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 02:27:28,777 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 02:27:28,777 INFO L82 PathProgramCache]: Analyzing trace with hash 19935376, now seen corresponding path program 1 times [2019-12-27 02:27:28,777 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 02:27:28,778 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [314930670] [2019-12-27 02:27:28,778 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 02:27:28,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 02:27:28,877 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 02:27:28,877 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [314930670] [2019-12-27 02:27:28,878 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 02:27:28,878 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-27 02:27:28,878 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [825411829] [2019-12-27 02:27:28,878 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 02:27:28,879 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 02:27:28,879 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 02:27:28,879 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-27 02:27:28,879 INFO L87 Difference]: Start difference. First operand 43565 states and 141059 transitions. Second operand 5 states. [2019-12-27 02:27:28,957 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 02:27:28,960 INFO L93 Difference]: Finished difference Result 9157 states and 25258 transitions. [2019-12-27 02:27:28,961 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 02:27:28,961 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 25 [2019-12-27 02:27:28,961 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 02:27:28,978 INFO L225 Difference]: With dead ends: 9157 [2019-12-27 02:27:28,979 INFO L226 Difference]: Without dead ends: 8050 [2019-12-27 02:27:28,979 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-12-27 02:27:29,010 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8050 states. [2019-12-27 02:27:29,074 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8050 to 7910. [2019-12-27 02:27:29,074 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7910 states. [2019-12-27 02:27:29,086 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7910 states to 7910 states and 21622 transitions. [2019-12-27 02:27:29,086 INFO L78 Accepts]: Start accepts. Automaton has 7910 states and 21622 transitions. Word has length 25 [2019-12-27 02:27:29,087 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 02:27:29,087 INFO L462 AbstractCegarLoop]: Abstraction has 7910 states and 21622 transitions. [2019-12-27 02:27:29,087 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 02:27:29,087 INFO L276 IsEmpty]: Start isEmpty. Operand 7910 states and 21622 transitions. [2019-12-27 02:27:29,098 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2019-12-27 02:27:29,099 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 02:27:29,099 INFO L411 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] [2019-12-27 02:27:29,099 INFO L410 AbstractCegarLoop]: === Iteration 7 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 02:27:29,099 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 02:27:29,099 INFO L82 PathProgramCache]: Analyzing trace with hash 1153167478, now seen corresponding path program 1 times [2019-12-27 02:27:29,100 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 02:27:29,100 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [222303527] [2019-12-27 02:27:29,100 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 02:27:29,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 02:27:29,260 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 02:27:29,261 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [222303527] [2019-12-27 02:27:29,261 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 02:27:29,261 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-27 02:27:29,262 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [970235907] [2019-12-27 02:27:29,262 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-27 02:27:29,262 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 02:27:29,262 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-27 02:27:29,263 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2019-12-27 02:27:29,263 INFO L87 Difference]: Start difference. First operand 7910 states and 21622 transitions. Second operand 6 states. [2019-12-27 02:27:29,340 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 02:27:29,340 INFO L93 Difference]: Finished difference Result 5799 states and 16611 transitions. [2019-12-27 02:27:29,341 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-27 02:27:29,341 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 37 [2019-12-27 02:27:29,341 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 02:27:29,352 INFO L225 Difference]: With dead ends: 5799 [2019-12-27 02:27:29,352 INFO L226 Difference]: Without dead ends: 5716 [2019-12-27 02:27:29,352 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2019-12-27 02:27:29,393 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5716 states. [2019-12-27 02:27:29,467 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5716 to 5303. [2019-12-27 02:27:29,468 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5303 states. [2019-12-27 02:27:29,479 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5303 states to 5303 states and 15329 transitions. [2019-12-27 02:27:29,480 INFO L78 Accepts]: Start accepts. Automaton has 5303 states and 15329 transitions. Word has length 37 [2019-12-27 02:27:29,480 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 02:27:29,480 INFO L462 AbstractCegarLoop]: Abstraction has 5303 states and 15329 transitions. [2019-12-27 02:27:29,480 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-27 02:27:29,480 INFO L276 IsEmpty]: Start isEmpty. Operand 5303 states and 15329 transitions. [2019-12-27 02:27:29,490 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-27 02:27:29,491 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 02:27:29,491 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 02:27:29,491 INFO L410 AbstractCegarLoop]: === Iteration 8 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 02:27:29,491 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 02:27:29,491 INFO L82 PathProgramCache]: Analyzing trace with hash -2000598711, now seen corresponding path program 1 times [2019-12-27 02:27:29,492 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 02:27:29,492 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1899237539] [2019-12-27 02:27:29,492 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 02:27:29,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 02:27:29,578 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 02:27:29,578 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1899237539] [2019-12-27 02:27:29,578 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 02:27:29,579 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 02:27:29,579 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1357092048] [2019-12-27 02:27:29,580 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 02:27:29,580 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 02:27:29,580 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 02:27:29,580 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 02:27:29,581 INFO L87 Difference]: Start difference. First operand 5303 states and 15329 transitions. Second operand 3 states. [2019-12-27 02:27:30,839 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 02:27:30,840 INFO L93 Difference]: Finished difference Result 5313 states and 15339 transitions. [2019-12-27 02:27:30,840 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 02:27:30,840 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 65 [2019-12-27 02:27:30,841 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 02:27:30,853 INFO L225 Difference]: With dead ends: 5313 [2019-12-27 02:27:30,853 INFO L226 Difference]: Without dead ends: 5313 [2019-12-27 02:27:30,854 INFO L631 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-12-27 02:27:30,880 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5313 states. [2019-12-27 02:27:30,918 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5313 to 5308. [2019-12-27 02:27:30,918 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5308 states. [2019-12-27 02:27:30,926 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5308 states to 5308 states and 15334 transitions. [2019-12-27 02:27:30,926 INFO L78 Accepts]: Start accepts. Automaton has 5308 states and 15334 transitions. Word has length 65 [2019-12-27 02:27:30,927 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 02:27:30,927 INFO L462 AbstractCegarLoop]: Abstraction has 5308 states and 15334 transitions. [2019-12-27 02:27:30,927 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 02:27:30,927 INFO L276 IsEmpty]: Start isEmpty. Operand 5308 states and 15334 transitions. [2019-12-27 02:27:30,934 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-27 02:27:30,934 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 02:27:30,934 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 02:27:30,934 INFO L410 AbstractCegarLoop]: === Iteration 9 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 02:27:30,935 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 02:27:30,935 INFO L82 PathProgramCache]: Analyzing trace with hash -1332314804, now seen corresponding path program 1 times [2019-12-27 02:27:30,935 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 02:27:30,935 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [707148966] [2019-12-27 02:27:30,935 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 02:27:30,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 02:27:31,051 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 02:27:31,052 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [707148966] [2019-12-27 02:27:31,052 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 02:27:31,052 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 02:27:31,053 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [895010567] [2019-12-27 02:27:31,053 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 02:27:31,053 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 02:27:31,053 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 02:27:31,054 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 02:27:31,054 INFO L87 Difference]: Start difference. First operand 5308 states and 15334 transitions. Second operand 3 states. [2019-12-27 02:27:31,083 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 02:27:31,083 INFO L93 Difference]: Finished difference Result 5022 states and 14301 transitions. [2019-12-27 02:27:31,084 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 02:27:31,084 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 65 [2019-12-27 02:27:31,084 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 02:27:31,091 INFO L225 Difference]: With dead ends: 5022 [2019-12-27 02:27:31,092 INFO L226 Difference]: Without dead ends: 5022 [2019-12-27 02:27:31,092 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 02:27:31,128 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5022 states. [2019-12-27 02:27:31,191 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5022 to 5022. [2019-12-27 02:27:31,191 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5022 states. [2019-12-27 02:27:31,205 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5022 states to 5022 states and 14301 transitions. [2019-12-27 02:27:31,205 INFO L78 Accepts]: Start accepts. Automaton has 5022 states and 14301 transitions. Word has length 65 [2019-12-27 02:27:31,206 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 02:27:31,206 INFO L462 AbstractCegarLoop]: Abstraction has 5022 states and 14301 transitions. [2019-12-27 02:27:31,206 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 02:27:31,206 INFO L276 IsEmpty]: Start isEmpty. Operand 5022 states and 14301 transitions. [2019-12-27 02:27:31,216 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-12-27 02:27:31,216 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 02:27:31,217 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 02:27:31,217 INFO L410 AbstractCegarLoop]: === Iteration 10 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 02:27:31,217 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 02:27:31,217 INFO L82 PathProgramCache]: Analyzing trace with hash 657704751, now seen corresponding path program 1 times [2019-12-27 02:27:31,218 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 02:27:31,218 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [64246783] [2019-12-27 02:27:31,218 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 02:27:31,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 02:27:31,399 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 02:27:31,400 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [64246783] [2019-12-27 02:27:31,400 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 02:27:31,400 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-27 02:27:31,400 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [892762618] [2019-12-27 02:27:31,402 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-27 02:27:31,402 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 02:27:31,403 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-27 02:27:31,403 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2019-12-27 02:27:31,403 INFO L87 Difference]: Start difference. First operand 5022 states and 14301 transitions. Second operand 7 states. [2019-12-27 02:27:31,552 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 02:27:31,553 INFO L93 Difference]: Finished difference Result 10045 states and 28803 transitions. [2019-12-27 02:27:31,553 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-12-27 02:27:31,553 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 66 [2019-12-27 02:27:31,554 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 02:27:31,562 INFO L225 Difference]: With dead ends: 10045 [2019-12-27 02:27:31,562 INFO L226 Difference]: Without dead ends: 5198 [2019-12-27 02:27:31,563 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2019-12-27 02:27:31,598 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5198 states. [2019-12-27 02:27:31,649 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5198 to 4143. [2019-12-27 02:27:31,649 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4143 states. [2019-12-27 02:27:31,658 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4143 states to 4143 states and 11709 transitions. [2019-12-27 02:27:31,658 INFO L78 Accepts]: Start accepts. Automaton has 4143 states and 11709 transitions. Word has length 66 [2019-12-27 02:27:31,659 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 02:27:31,659 INFO L462 AbstractCegarLoop]: Abstraction has 4143 states and 11709 transitions. [2019-12-27 02:27:31,659 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-27 02:27:31,659 INFO L276 IsEmpty]: Start isEmpty. Operand 4143 states and 11709 transitions. [2019-12-27 02:27:31,667 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-12-27 02:27:31,668 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 02:27:31,668 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 02:27:31,668 INFO L410 AbstractCegarLoop]: === Iteration 11 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 02:27:31,668 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 02:27:31,669 INFO L82 PathProgramCache]: Analyzing trace with hash 115282201, now seen corresponding path program 2 times [2019-12-27 02:27:31,669 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 02:27:31,670 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1788080047] [2019-12-27 02:27:31,670 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 02:27:31,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 02:27:31,777 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 02:27:31,777 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1788080047] [2019-12-27 02:27:31,778 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 02:27:31,778 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 02:27:31,778 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [741200783] [2019-12-27 02:27:31,779 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 02:27:31,779 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 02:27:31,780 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 02:27:31,780 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 02:27:31,780 INFO L87 Difference]: Start difference. First operand 4143 states and 11709 transitions. Second operand 3 states. [2019-12-27 02:27:31,839 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 02:27:31,839 INFO L93 Difference]: Finished difference Result 4142 states and 11707 transitions. [2019-12-27 02:27:31,840 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 02:27:31,840 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 66 [2019-12-27 02:27:31,840 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 02:27:31,846 INFO L225 Difference]: With dead ends: 4142 [2019-12-27 02:27:31,847 INFO L226 Difference]: Without dead ends: 4142 [2019-12-27 02:27:31,847 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 02:27:31,879 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4142 states. [2019-12-27 02:27:31,916 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4142 to 2956. [2019-12-27 02:27:31,917 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2956 states. [2019-12-27 02:27:31,923 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2956 states to 2956 states and 8474 transitions. [2019-12-27 02:27:31,924 INFO L78 Accepts]: Start accepts. Automaton has 2956 states and 8474 transitions. Word has length 66 [2019-12-27 02:27:31,924 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 02:27:31,924 INFO L462 AbstractCegarLoop]: Abstraction has 2956 states and 8474 transitions. [2019-12-27 02:27:31,924 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 02:27:31,924 INFO L276 IsEmpty]: Start isEmpty. Operand 2956 states and 8474 transitions. [2019-12-27 02:27:31,929 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-12-27 02:27:31,929 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 02:27:31,930 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 02:27:31,932 INFO L410 AbstractCegarLoop]: === Iteration 12 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 02:27:31,933 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 02:27:31,933 INFO L82 PathProgramCache]: Analyzing trace with hash 810593463, now seen corresponding path program 1 times [2019-12-27 02:27:31,933 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 02:27:31,933 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [418108144] [2019-12-27 02:27:31,933 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 02:27:31,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 02:27:32,025 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 02:27:32,026 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [418108144] [2019-12-27 02:27:32,026 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 02:27:32,026 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 02:27:32,026 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1770202059] [2019-12-27 02:27:32,027 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 02:27:32,027 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 02:27:32,027 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 02:27:32,027 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 02:27:32,027 INFO L87 Difference]: Start difference. First operand 2956 states and 8474 transitions. Second operand 3 states. [2019-12-27 02:27:32,046 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 02:27:32,046 INFO L93 Difference]: Finished difference Result 2784 states and 7803 transitions. [2019-12-27 02:27:32,046 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 02:27:32,047 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 67 [2019-12-27 02:27:32,047 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 02:27:32,051 INFO L225 Difference]: With dead ends: 2784 [2019-12-27 02:27:32,051 INFO L226 Difference]: Without dead ends: 2784 [2019-12-27 02:27:32,051 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 02:27:32,078 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2784 states. [2019-12-27 02:27:32,106 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2784 to 2608. [2019-12-27 02:27:32,106 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2608 states. [2019-12-27 02:27:32,112 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2608 states to 2608 states and 7313 transitions. [2019-12-27 02:27:32,113 INFO L78 Accepts]: Start accepts. Automaton has 2608 states and 7313 transitions. Word has length 67 [2019-12-27 02:27:32,114 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 02:27:32,114 INFO L462 AbstractCegarLoop]: Abstraction has 2608 states and 7313 transitions. [2019-12-27 02:27:32,114 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 02:27:32,114 INFO L276 IsEmpty]: Start isEmpty. Operand 2608 states and 7313 transitions. [2019-12-27 02:27:32,119 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2019-12-27 02:27:32,119 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 02:27:32,119 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 02:27:32,119 INFO L410 AbstractCegarLoop]: === Iteration 13 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 02:27:32,120 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 02:27:32,120 INFO L82 PathProgramCache]: Analyzing trace with hash 839287492, now seen corresponding path program 1 times [2019-12-27 02:27:32,120 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 02:27:32,120 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1973762284] [2019-12-27 02:27:32,120 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 02:27:32,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 02:27:32,612 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 02:27:32,612 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1973762284] [2019-12-27 02:27:32,613 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 02:27:32,613 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2019-12-27 02:27:32,613 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [586103810] [2019-12-27 02:27:32,613 INFO L442 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-12-27 02:27:32,614 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 02:27:32,614 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-12-27 02:27:32,615 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=225, Unknown=0, NotChecked=0, Total=272 [2019-12-27 02:27:32,615 INFO L87 Difference]: Start difference. First operand 2608 states and 7313 transitions. Second operand 17 states. [2019-12-27 02:27:34,053 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 02:27:34,054 INFO L93 Difference]: Finished difference Result 5267 states and 14603 transitions. [2019-12-27 02:27:34,054 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2019-12-27 02:27:34,054 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 68 [2019-12-27 02:27:34,055 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 02:27:34,062 INFO L225 Difference]: With dead ends: 5267 [2019-12-27 02:27:34,062 INFO L226 Difference]: Without dead ends: 5234 [2019-12-27 02:27:34,063 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 0 SyntacticMatches, 1 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 385 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=400, Invalid=1492, Unknown=0, NotChecked=0, Total=1892 [2019-12-27 02:27:34,087 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5234 states. [2019-12-27 02:27:34,125 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5234 to 3850. [2019-12-27 02:27:34,125 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3850 states. [2019-12-27 02:27:34,130 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3850 states to 3850 states and 10704 transitions. [2019-12-27 02:27:34,131 INFO L78 Accepts]: Start accepts. Automaton has 3850 states and 10704 transitions. Word has length 68 [2019-12-27 02:27:34,131 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 02:27:34,131 INFO L462 AbstractCegarLoop]: Abstraction has 3850 states and 10704 transitions. [2019-12-27 02:27:34,131 INFO L463 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-12-27 02:27:34,131 INFO L276 IsEmpty]: Start isEmpty. Operand 3850 states and 10704 transitions. [2019-12-27 02:27:34,136 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2019-12-27 02:27:34,136 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 02:27:34,136 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 02:27:34,136 INFO L410 AbstractCegarLoop]: === Iteration 14 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 02:27:34,136 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 02:27:34,137 INFO L82 PathProgramCache]: Analyzing trace with hash -1443280012, now seen corresponding path program 2 times [2019-12-27 02:27:34,137 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 02:27:34,137 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [872136529] [2019-12-27 02:27:34,137 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 02:27:34,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 02:27:34,440 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 02:27:34,441 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [872136529] [2019-12-27 02:27:34,441 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 02:27:34,441 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2019-12-27 02:27:34,441 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1040688215] [2019-12-27 02:27:34,442 INFO L442 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-12-27 02:27:34,442 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 02:27:34,442 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-12-27 02:27:34,443 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=172, Unknown=0, NotChecked=0, Total=210 [2019-12-27 02:27:34,443 INFO L87 Difference]: Start difference. First operand 3850 states and 10704 transitions. Second operand 15 states. [2019-12-27 02:27:35,387 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 02:27:35,387 INFO L93 Difference]: Finished difference Result 6305 states and 17453 transitions. [2019-12-27 02:27:35,388 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2019-12-27 02:27:35,388 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 68 [2019-12-27 02:27:35,388 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 02:27:35,396 INFO L225 Difference]: With dead ends: 6305 [2019-12-27 02:27:35,397 INFO L226 Difference]: Without dead ends: 6272 [2019-12-27 02:27:35,397 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 198 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=242, Invalid=880, Unknown=0, NotChecked=0, Total=1122 [2019-12-27 02:27:35,423 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6272 states. [2019-12-27 02:27:35,461 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6272 to 3992. [2019-12-27 02:27:35,462 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3992 states. [2019-12-27 02:27:35,467 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3992 states to 3992 states and 11115 transitions. [2019-12-27 02:27:35,467 INFO L78 Accepts]: Start accepts. Automaton has 3992 states and 11115 transitions. Word has length 68 [2019-12-27 02:27:35,468 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 02:27:35,468 INFO L462 AbstractCegarLoop]: Abstraction has 3992 states and 11115 transitions. [2019-12-27 02:27:35,468 INFO L463 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-12-27 02:27:35,468 INFO L276 IsEmpty]: Start isEmpty. Operand 3992 states and 11115 transitions. [2019-12-27 02:27:35,473 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2019-12-27 02:27:35,473 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 02:27:35,473 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 02:27:35,473 INFO L410 AbstractCegarLoop]: === Iteration 15 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 02:27:35,473 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 02:27:35,474 INFO L82 PathProgramCache]: Analyzing trace with hash 1107452774, now seen corresponding path program 3 times [2019-12-27 02:27:35,474 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 02:27:35,474 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [610090644] [2019-12-27 02:27:35,474 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 02:27:35,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 02:27:35,691 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 02:27:35,691 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [610090644] [2019-12-27 02:27:35,691 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 02:27:35,692 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2019-12-27 02:27:35,692 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [721213257] [2019-12-27 02:27:35,692 INFO L442 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-12-27 02:27:35,692 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 02:27:35,693 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-12-27 02:27:35,693 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=147, Unknown=0, NotChecked=0, Total=182 [2019-12-27 02:27:35,693 INFO L87 Difference]: Start difference. First operand 3992 states and 11115 transitions. Second operand 14 states. [2019-12-27 02:27:36,413 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 02:27:36,413 INFO L93 Difference]: Finished difference Result 5167 states and 14262 transitions. [2019-12-27 02:27:36,413 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2019-12-27 02:27:36,414 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 68 [2019-12-27 02:27:36,414 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 02:27:36,421 INFO L225 Difference]: With dead ends: 5167 [2019-12-27 02:27:36,421 INFO L226 Difference]: Without dead ends: 5136 [2019-12-27 02:27:36,422 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 193 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=215, Invalid=777, Unknown=0, NotChecked=0, Total=992 [2019-12-27 02:27:36,445 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5136 states. [2019-12-27 02:27:36,479 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5136 to 3844. [2019-12-27 02:27:36,479 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3844 states. [2019-12-27 02:27:36,485 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3844 states to 3844 states and 10653 transitions. [2019-12-27 02:27:36,485 INFO L78 Accepts]: Start accepts. Automaton has 3844 states and 10653 transitions. Word has length 68 [2019-12-27 02:27:36,485 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 02:27:36,485 INFO L462 AbstractCegarLoop]: Abstraction has 3844 states and 10653 transitions. [2019-12-27 02:27:36,485 INFO L463 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-12-27 02:27:36,485 INFO L276 IsEmpty]: Start isEmpty. Operand 3844 states and 10653 transitions. [2019-12-27 02:27:36,490 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2019-12-27 02:27:36,490 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 02:27:36,490 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 02:27:36,491 INFO L410 AbstractCegarLoop]: === Iteration 16 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 02:27:36,491 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 02:27:36,491 INFO L82 PathProgramCache]: Analyzing trace with hash 1214731398, now seen corresponding path program 4 times [2019-12-27 02:27:36,491 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 02:27:36,491 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [357530988] [2019-12-27 02:27:36,491 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 02:27:36,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-27 02:27:36,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-27 02:27:36,680 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-27 02:27:36,682 INFO L476 BasicCegarLoop]: Counterexample might be feasible [2019-12-27 02:27:36,687 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [831] [831] ULTIMATE.startENTRY-->L817: Formula: (let ((.cse0 (store |v_#valid_66| 0 0))) (and (= 0 v_~x~0_167) (= v_~x$r_buff0_thd1~0_194 0) (= v_~x$r_buff1_thd0~0_280 0) (= (select .cse0 |v_ULTIMATE.start_main_~#t1019~0.base_25|) 0) (= |v_#NULL.offset_6| 0) (= v_~x$r_buff0_thd0~0_376 0) (= |v_#length_25| (store |v_#length_26| |v_ULTIMATE.start_main_~#t1019~0.base_25| 4)) (= v_~a~0_13 0) (= v_~main$tmp_guard0~0_27 0) (< 0 |v_#StackHeapBarrier_19|) (= (store |v_#memory_int_16| |v_ULTIMATE.start_main_~#t1019~0.base_25| (store (select |v_#memory_int_16| |v_ULTIMATE.start_main_~#t1019~0.base_25|) |v_ULTIMATE.start_main_~#t1019~0.offset_19| 0)) |v_#memory_int_15|) (= |v_#valid_64| (store .cse0 |v_ULTIMATE.start_main_~#t1019~0.base_25| 1)) (= 0 v_~x$read_delayed_var~0.base_7) (< |v_#StackHeapBarrier_19| |v_ULTIMATE.start_main_~#t1019~0.base_25|) (= 0 v_~x$r_buff0_thd2~0_295) (= 0 v_~x$w_buff0_used~0_668) (= 0 v_~x$r_buff1_thd2~0_179) (= 0 |v_#NULL.base_6|) (= 0 v_~x$read_delayed~0_7) (= 0 v_~x$w_buff1~0_150) (= 0 v_~x$w_buff0~0_169) (= v_~y~0_123 0) (= v_~main$tmp_guard1~0_23 0) (= 0 v_~x$r_buff0_thd3~0_178) (= v_~__unbuffered_cnt~0_130 0) (= 0 |v_ULTIMATE.start_main_~#t1019~0.offset_19|) (= 0 v_~z~0_9) (= v_~x$r_buff1_thd1~0_197 0) (= 0 v_~x$read_delayed_var~0.offset_7) (= v_~weak$$choice2~0_115 0) (= v_~x$mem_tmp~0_37 0) (= v_~__unbuffered_p2_EBX~0_19 0) (= v_~__unbuffered_p1_EAX~0_129 0) (= v_~x$flush_delayed~0_54 0) (= 0 v_~weak$$choice0~0_34) (= 0 v_~__unbuffered_p2_EAX~0_19) (= 0 v_~x$r_buff1_thd3~0_174) (= 0 v_~x$w_buff1_used~0_384))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_19|, #valid=|v_#valid_66|, #memory_int=|v_#memory_int_16|, #length=|v_#length_26|} OutVars{ULTIMATE.start_main_#t~nondet30=|v_ULTIMATE.start_main_#t~nondet30_61|, ~x$w_buff0~0=v_~x$w_buff0~0_169, ULTIMATE.start_main_~#t1020~0.base=|v_ULTIMATE.start_main_~#t1020~0.base_27|, ULTIMATE.start_main_#t~ite28=|v_ULTIMATE.start_main_#t~ite28_37|, ~x$flush_delayed~0=v_~x$flush_delayed~0_54, ULTIMATE.start_main_#t~ite24=|v_ULTIMATE.start_main_#t~ite24_37|, ULTIMATE.start_main_#t~ite47=|v_ULTIMATE.start_main_#t~ite47_33|, #NULL.offset=|v_#NULL.offset_6|, ULTIMATE.start_main_#t~ite26=|v_ULTIMATE.start_main_#t~ite26_141|, ULTIMATE.start_main_#t~ite49=|v_ULTIMATE.start_main_#t~ite49_35|, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_197, ~x$r_buff0_thd3~0=v_~x$r_buff0_thd3~0_178, ULTIMATE.start_main_#t~ite43=|v_ULTIMATE.start_main_#t~ite43_36|, ULTIMATE.start_main_~#t1020~0.offset=|v_ULTIMATE.start_main_~#t1020~0.offset_20|, ULTIMATE.start_main_#t~ite45=|v_ULTIMATE.start_main_#t~ite45_28|, ULTIMATE.start_main_#t~ite50=|v_ULTIMATE.start_main_#t~ite50_33|, ~a~0=v_~a~0_13, ULTIMATE.start_main_#t~ite52=|v_ULTIMATE.start_main_#t~ite52_32|, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_129, #length=|v_#length_25|, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_19, ~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_376, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_19, ULTIMATE.start_main_#t~nondet22=|v_ULTIMATE.start_main_#t~nondet22_10|, ULTIMATE.start_main_#t~ite39=|v_ULTIMATE.start_main_#t~ite39_59|, ~x$w_buff1~0=v_~x$w_buff1~0_150, ULTIMATE.start_main_#t~ite35=|v_ULTIMATE.start_main_#t~ite35_56|, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_384, ~x$r_buff1_thd2~0=v_~x$r_buff1_thd2~0_179, ULTIMATE.start_main_~#t1021~0.base=|v_ULTIMATE.start_main_~#t1021~0.base_23|, ULTIMATE.start_main_#t~ite37=|v_ULTIMATE.start_main_#t~ite37_64|, ULTIMATE.start_main_#t~ite33=|v_ULTIMATE.start_main_#t~ite33_27|, ~x$read_delayed_var~0.base=v_~x$read_delayed_var~0.base_7, ~weak$$choice0~0=v_~weak$$choice0~0_34, #StackHeapBarrier=|v_#StackHeapBarrier_19|, ULTIMATE.start_main_#t~ite40=|v_ULTIMATE.start_main_#t~ite40_28|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_130, ~x~0=v_~x~0_167, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_194, ULTIMATE.start_main_#t~nondet31=|v_ULTIMATE.start_main_#t~nondet31_61|, ULTIMATE.start_main_#t~ite29=|v_ULTIMATE.start_main_#t~ite29_75|, ULTIMATE.start_main_#t~ite25=|v_ULTIMATE.start_main_#t~ite25_30|, ULTIMATE.start_main_#t~ite46=|v_ULTIMATE.start_main_#t~ite46_27|, ~x$r_buff1_thd3~0=v_~x$r_buff1_thd3~0_174, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_23, ULTIMATE.start_main_#t~ite27=|v_ULTIMATE.start_main_#t~ite27_163|, ULTIMATE.start_main_#t~ite48=|v_ULTIMATE.start_main_#t~ite48_19|, ~x$mem_tmp~0=v_~x$mem_tmp~0_37, ULTIMATE.start_main_#t~ite42=|v_ULTIMATE.start_main_#t~ite42_25|, ULTIMATE.start_main_#t~ite44=|v_ULTIMATE.start_main_#t~ite44_40|, ULTIMATE.start_main_#t~ite51=|v_ULTIMATE.start_main_#t~ite51_37|, ~y~0=v_~y~0_123, ULTIMATE.start_main_#t~nondet21=|v_ULTIMATE.start_main_#t~nondet21_9|, ULTIMATE.start_main_#t~nondet23=|v_ULTIMATE.start_main_#t~nondet23_16|, ULTIMATE.start_main_#t~ite36=|v_ULTIMATE.start_main_#t~ite36_43|, ULTIMATE.start_main_~#t1019~0.base=|v_ULTIMATE.start_main_~#t1019~0.base_25|, ULTIMATE.start_main_#t~ite38=|v_ULTIMATE.start_main_#t~ite38_64|, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_27, ~x$r_buff1_thd0~0=v_~x$r_buff1_thd0~0_280, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_295, ULTIMATE.start_main_#t~ite32=|v_ULTIMATE.start_main_#t~ite32_27|, #NULL.base=|v_#NULL.base_6|, ULTIMATE.start_main_#t~ite34=|v_ULTIMATE.start_main_#t~ite34_56|, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_668, ULTIMATE.start_main_~#t1021~0.offset=|v_ULTIMATE.start_main_~#t1021~0.offset_16|, ULTIMATE.start_main_#t~ite41=|v_ULTIMATE.start_main_#t~ite41_32|, ~x$read_delayed_var~0.offset=v_~x$read_delayed_var~0.offset_7, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_19|, #valid=|v_#valid_64|, #memory_int=|v_#memory_int_15|, ~z~0=v_~z~0_9, ~weak$$choice2~0=v_~weak$$choice2~0_115, ULTIMATE.start_main_~#t1019~0.offset=|v_ULTIMATE.start_main_~#t1019~0.offset_19|, ~x$read_delayed~0=v_~x$read_delayed~0_7} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet30, ~x$w_buff0~0, ULTIMATE.start_main_~#t1020~0.base, ULTIMATE.start_main_#t~ite28, ~x$flush_delayed~0, ULTIMATE.start_main_#t~ite24, ULTIMATE.start_main_#t~ite47, #NULL.offset, ULTIMATE.start_main_#t~ite26, ULTIMATE.start_main_#t~ite49, ~x$r_buff1_thd1~0, ~x$r_buff0_thd3~0, ULTIMATE.start_main_#t~ite43, ULTIMATE.start_main_~#t1020~0.offset, ULTIMATE.start_main_#t~ite45, ULTIMATE.start_main_#t~ite50, ~a~0, ULTIMATE.start_main_#t~ite52, ~__unbuffered_p1_EAX~0, #length, ~__unbuffered_p2_EAX~0, ~x$r_buff0_thd0~0, ~__unbuffered_p2_EBX~0, ULTIMATE.start_main_#t~nondet22, ULTIMATE.start_main_#t~ite39, ~x$w_buff1~0, ULTIMATE.start_main_#t~ite35, ~x$w_buff1_used~0, ~x$r_buff1_thd2~0, ULTIMATE.start_main_~#t1021~0.base, ULTIMATE.start_main_#t~ite37, ULTIMATE.start_main_#t~ite33, ~x$read_delayed_var~0.base, ~weak$$choice0~0, ULTIMATE.start_main_#t~ite40, ~__unbuffered_cnt~0, ~x~0, ~x$r_buff0_thd1~0, ULTIMATE.start_main_#t~nondet31, ULTIMATE.start_main_#t~ite29, ULTIMATE.start_main_#t~ite25, ULTIMATE.start_main_#t~ite46, ~x$r_buff1_thd3~0, ~main$tmp_guard1~0, ULTIMATE.start_main_#t~ite27, ULTIMATE.start_main_#t~ite48, ~x$mem_tmp~0, ULTIMATE.start_main_#t~ite42, ULTIMATE.start_main_#t~ite44, ULTIMATE.start_main_#t~ite51, ~y~0, ULTIMATE.start_main_#t~nondet21, ULTIMATE.start_main_#t~nondet23, ULTIMATE.start_main_#t~ite36, ULTIMATE.start_main_~#t1019~0.base, ULTIMATE.start_main_#t~ite38, ~main$tmp_guard0~0, ~x$r_buff1_thd0~0, ~x$r_buff0_thd2~0, ULTIMATE.start_main_#t~ite32, #NULL.base, ULTIMATE.start_main_#t~ite34, ~x$w_buff0_used~0, ULTIMATE.start_main_~#t1021~0.offset, ULTIMATE.start_main_#t~ite41, ~x$read_delayed_var~0.offset, ULTIMATE.start_main_#res, #valid, #memory_int, ~z~0, ~weak$$choice2~0, ULTIMATE.start_main_~#t1019~0.offset, ~x$read_delayed~0] because there is no mapped edge [2019-12-27 02:27:36,688 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [807] [807] L817-1-->L819: Formula: (and (not (= |v_ULTIMATE.start_main_~#t1020~0.base_13| 0)) (= (store |v_#memory_int_12| |v_ULTIMATE.start_main_~#t1020~0.base_13| (store (select |v_#memory_int_12| |v_ULTIMATE.start_main_~#t1020~0.base_13|) |v_ULTIMATE.start_main_~#t1020~0.offset_11| 1)) |v_#memory_int_11|) (= |v_#length_17| (store |v_#length_18| |v_ULTIMATE.start_main_~#t1020~0.base_13| 4)) (= (store |v_#valid_39| |v_ULTIMATE.start_main_~#t1020~0.base_13| 1) |v_#valid_38|) (= 0 (select |v_#valid_39| |v_ULTIMATE.start_main_~#t1020~0.base_13|)) (= |v_ULTIMATE.start_main_~#t1020~0.offset_11| 0) (< |v_#StackHeapBarrier_12| |v_ULTIMATE.start_main_~#t1020~0.base_13|)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_12|, #valid=|v_#valid_39|, #memory_int=|v_#memory_int_12|, #length=|v_#length_18|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_12|, ULTIMATE.start_main_#t~nondet21=|v_ULTIMATE.start_main_#t~nondet21_5|, ULTIMATE.start_main_~#t1020~0.base=|v_ULTIMATE.start_main_~#t1020~0.base_13|, #valid=|v_#valid_38|, #memory_int=|v_#memory_int_11|, #length=|v_#length_17|, ULTIMATE.start_main_~#t1020~0.offset=|v_ULTIMATE.start_main_~#t1020~0.offset_11|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet21, ULTIMATE.start_main_~#t1020~0.base, #valid, #memory_int, #length, ULTIMATE.start_main_~#t1020~0.offset] because there is no mapped edge [2019-12-27 02:27:36,689 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [812] [812] L4-->L768: Formula: (and (= ~x$r_buff1_thd0~0_Out-1659170764 ~x$r_buff0_thd0~0_In-1659170764) (= ~x$r_buff1_thd2~0_Out-1659170764 ~x$r_buff0_thd2~0_In-1659170764) (= ~x$r_buff0_thd3~0_In-1659170764 ~x$r_buff1_thd3~0_Out-1659170764) (= ~y~0_In-1659170764 ~__unbuffered_p1_EAX~0_Out-1659170764) (= 1 ~x$r_buff0_thd2~0_Out-1659170764) (not (= P1Thread1of1ForFork1___VERIFIER_assert_~expression_In-1659170764 0)) (= ~x$r_buff1_thd1~0_Out-1659170764 ~x$r_buff0_thd1~0_In-1659170764)) InVars {P1Thread1of1ForFork1___VERIFIER_assert_~expression=P1Thread1of1ForFork1___VERIFIER_assert_~expression_In-1659170764, ~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In-1659170764, ~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In-1659170764, ~x$r_buff0_thd3~0=~x$r_buff0_thd3~0_In-1659170764, ~y~0=~y~0_In-1659170764, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In-1659170764} OutVars{P1Thread1of1ForFork1___VERIFIER_assert_~expression=P1Thread1of1ForFork1___VERIFIER_assert_~expression_In-1659170764, ~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In-1659170764, ~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In-1659170764, ~__unbuffered_p1_EAX~0=~__unbuffered_p1_EAX~0_Out-1659170764, ~x$r_buff1_thd3~0=~x$r_buff1_thd3~0_Out-1659170764, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_Out-1659170764, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_Out-1659170764, ~x$r_buff0_thd3~0=~x$r_buff0_thd3~0_In-1659170764, ~y~0=~y~0_In-1659170764, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_Out-1659170764, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_Out-1659170764} AuxVars[] AssignedVars[~__unbuffered_p1_EAX~0, ~x$r_buff1_thd3~0, ~x$r_buff1_thd2~0, ~x$r_buff1_thd1~0, ~x$r_buff0_thd2~0, ~x$r_buff1_thd0~0] because there is no mapped edge [2019-12-27 02:27:36,691 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [762] [762] L769-->L769-2: Formula: (let ((.cse1 (= 0 (mod ~x$w_buff0_used~0_In-131535967 256))) (.cse0 (= (mod ~x$r_buff0_thd2~0_In-131535967 256) 0))) (or (and (= ~x$w_buff0_used~0_In-131535967 |P1Thread1of1ForFork1_#t~ite11_Out-131535967|) (or .cse0 .cse1)) (and (not .cse1) (not .cse0) (= 0 |P1Thread1of1ForFork1_#t~ite11_Out-131535967|)))) InVars {~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In-131535967, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-131535967} OutVars{P1Thread1of1ForFork1_#t~ite11=|P1Thread1of1ForFork1_#t~ite11_Out-131535967|, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In-131535967, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-131535967} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite11] because there is no mapped edge [2019-12-27 02:27:36,692 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [760] [760] L770-->L770-2: Formula: (let ((.cse0 (= (mod ~x$r_buff1_thd2~0_In1478479464 256) 0)) (.cse1 (= 0 (mod ~x$w_buff1_used~0_In1478479464 256))) (.cse3 (= 0 (mod ~x$w_buff0_used~0_In1478479464 256))) (.cse2 (= 0 (mod ~x$r_buff0_thd2~0_In1478479464 256)))) (or (and (or .cse0 .cse1) (= ~x$w_buff1_used~0_In1478479464 |P1Thread1of1ForFork1_#t~ite12_Out1478479464|) (or .cse2 .cse3)) (and (or (and (not .cse0) (not .cse1)) (and (not .cse3) (not .cse2))) (= 0 |P1Thread1of1ForFork1_#t~ite12_Out1478479464|)))) InVars {~x$w_buff1_used~0=~x$w_buff1_used~0_In1478479464, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In1478479464, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In1478479464, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1478479464} OutVars{~x$w_buff1_used~0=~x$w_buff1_used~0_In1478479464, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In1478479464, P1Thread1of1ForFork1_#t~ite12=|P1Thread1of1ForFork1_#t~ite12_Out1478479464|, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In1478479464, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1478479464} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite12] because there is no mapped edge [2019-12-27 02:27:36,693 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [778] [778] L771-->L772: Formula: (let ((.cse1 (= 0 (mod ~x$r_buff0_thd2~0_In-1783080544 256))) (.cse0 (= (mod ~x$w_buff0_used~0_In-1783080544 256) 0))) (or (and (= ~x$r_buff0_thd2~0_Out-1783080544 ~x$r_buff0_thd2~0_In-1783080544) (or .cse0 .cse1)) (and (= ~x$r_buff0_thd2~0_Out-1783080544 0) (not .cse1) (not .cse0)))) InVars {~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In-1783080544, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1783080544} OutVars{P1Thread1of1ForFork1_#t~ite13=|P1Thread1of1ForFork1_#t~ite13_Out-1783080544|, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_Out-1783080544, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1783080544} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite13, ~x$r_buff0_thd2~0] because there is no mapped edge [2019-12-27 02:27:36,693 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [764] [764] L772-->L772-2: Formula: (let ((.cse2 (= (mod ~x$r_buff1_thd2~0_In-1266442095 256) 0)) (.cse3 (= (mod ~x$w_buff1_used~0_In-1266442095 256) 0)) (.cse1 (= 0 (mod ~x$w_buff0_used~0_In-1266442095 256))) (.cse0 (= 0 (mod ~x$r_buff0_thd2~0_In-1266442095 256)))) (or (and (= |P1Thread1of1ForFork1_#t~ite14_Out-1266442095| 0) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse2 .cse3) (or .cse1 .cse0) (= ~x$r_buff1_thd2~0_In-1266442095 |P1Thread1of1ForFork1_#t~ite14_Out-1266442095|)))) InVars {~x$w_buff1_used~0=~x$w_buff1_used~0_In-1266442095, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In-1266442095, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In-1266442095, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1266442095} OutVars{~x$w_buff1_used~0=~x$w_buff1_used~0_In-1266442095, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In-1266442095, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In-1266442095, P1Thread1of1ForFork1_#t~ite14=|P1Thread1of1ForFork1_#t~ite14_Out-1266442095|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1266442095} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite14] because there is no mapped edge [2019-12-27 02:27:36,694 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [801] [801] L772-2-->P1EXIT: Formula: (and (= v_~x$r_buff1_thd2~0_127 |v_P1Thread1of1ForFork1_#t~ite14_40|) (= 0 |v_P1Thread1of1ForFork1_#res.base_5|) (= v_~__unbuffered_cnt~0_61 (+ v_~__unbuffered_cnt~0_62 1)) (= |v_P1Thread1of1ForFork1_#res.offset_5| 0)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_62, P1Thread1of1ForFork1_#t~ite14=|v_P1Thread1of1ForFork1_#t~ite14_40|} OutVars{P1Thread1of1ForFork1_#res.offset=|v_P1Thread1of1ForFork1_#res.offset_5|, ~x$r_buff1_thd2~0=v_~x$r_buff1_thd2~0_127, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_61, P1Thread1of1ForFork1_#t~ite14=|v_P1Thread1of1ForFork1_#t~ite14_39|, P1Thread1of1ForFork1_#res.base=|v_P1Thread1of1ForFork1_#res.base_5|} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#res.offset, ~x$r_buff1_thd2~0, ~__unbuffered_cnt~0, P1Thread1of1ForFork1_#t~ite14, P1Thread1of1ForFork1_#res.base] because there is no mapped edge [2019-12-27 02:27:36,694 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [799] [799] L819-1-->L821: Formula: (and (= |v_#valid_33| (store |v_#valid_34| |v_ULTIMATE.start_main_~#t1021~0.base_12| 1)) (= 0 (select |v_#valid_34| |v_ULTIMATE.start_main_~#t1021~0.base_12|)) (= |v_#memory_int_9| (store |v_#memory_int_10| |v_ULTIMATE.start_main_~#t1021~0.base_12| (store (select |v_#memory_int_10| |v_ULTIMATE.start_main_~#t1021~0.base_12|) |v_ULTIMATE.start_main_~#t1021~0.offset_11| 2))) (not (= |v_ULTIMATE.start_main_~#t1021~0.base_12| 0)) (= |v_#length_15| (store |v_#length_16| |v_ULTIMATE.start_main_~#t1021~0.base_12| 4)) (< |v_#StackHeapBarrier_11| |v_ULTIMATE.start_main_~#t1021~0.base_12|) (= |v_ULTIMATE.start_main_~#t1021~0.offset_11| 0)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_11|, #valid=|v_#valid_34|, #memory_int=|v_#memory_int_10|, #length=|v_#length_16|} OutVars{ULTIMATE.start_main_~#t1021~0.offset=|v_ULTIMATE.start_main_~#t1021~0.offset_11|, #StackHeapBarrier=|v_#StackHeapBarrier_11|, ULTIMATE.start_main_#t~nondet22=|v_ULTIMATE.start_main_#t~nondet22_6|, #valid=|v_#valid_33|, #memory_int=|v_#memory_int_9|, ULTIMATE.start_main_~#t1021~0.base=|v_ULTIMATE.start_main_~#t1021~0.base_12|, #length=|v_#length_15|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t1021~0.offset, ULTIMATE.start_main_#t~nondet22, #valid, #memory_int, ULTIMATE.start_main_~#t1021~0.base, #length] because there is no mapped edge [2019-12-27 02:27:36,696 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [763] [763] L794-2-->L794-4: Formula: (let ((.cse1 (= 0 (mod ~x$w_buff1_used~0_In-1858504995 256))) (.cse0 (= 0 (mod ~x$r_buff1_thd3~0_In-1858504995 256)))) (or (and (not .cse0) (not .cse1) (= |P2Thread1of1ForFork2_#t~ite15_Out-1858504995| ~x$w_buff1~0_In-1858504995)) (and (or .cse1 .cse0) (= |P2Thread1of1ForFork2_#t~ite15_Out-1858504995| ~x~0_In-1858504995)))) InVars {~x$w_buff1~0=~x$w_buff1~0_In-1858504995, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-1858504995, ~x$r_buff1_thd3~0=~x$r_buff1_thd3~0_In-1858504995, ~x~0=~x~0_In-1858504995} OutVars{P2Thread1of1ForFork2_#t~ite15=|P2Thread1of1ForFork2_#t~ite15_Out-1858504995|, ~x$w_buff1~0=~x$w_buff1~0_In-1858504995, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-1858504995, ~x$r_buff1_thd3~0=~x$r_buff1_thd3~0_In-1858504995, ~x~0=~x~0_In-1858504995} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite15] because there is no mapped edge [2019-12-27 02:27:36,697 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [699] [699] L794-4-->L795: Formula: (= v_~x~0_23 |v_P2Thread1of1ForFork2_#t~ite15_12|) InVars {P2Thread1of1ForFork2_#t~ite15=|v_P2Thread1of1ForFork2_#t~ite15_12|} OutVars{P2Thread1of1ForFork2_#t~ite15=|v_P2Thread1of1ForFork2_#t~ite15_11|, P2Thread1of1ForFork2_#t~ite16=|v_P2Thread1of1ForFork2_#t~ite16_9|, ~x~0=v_~x~0_23} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite15, P2Thread1of1ForFork2_#t~ite16, ~x~0] because there is no mapped edge [2019-12-27 02:27:36,697 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [781] [781] L739-2-->L739-4: Formula: (let ((.cse0 (= 0 (mod ~x$w_buff1_used~0_In-950790747 256))) (.cse1 (= (mod ~x$r_buff1_thd1~0_In-950790747 256) 0))) (or (and (not .cse0) (not .cse1) (= |P0Thread1of1ForFork0_#t~ite3_Out-950790747| ~x$w_buff1~0_In-950790747)) (and (= |P0Thread1of1ForFork0_#t~ite3_Out-950790747| ~x~0_In-950790747) (or .cse0 .cse1)))) InVars {~x$w_buff1~0=~x$w_buff1~0_In-950790747, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-950790747, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In-950790747, ~x~0=~x~0_In-950790747} OutVars{P0Thread1of1ForFork0_#t~ite3=|P0Thread1of1ForFork0_#t~ite3_Out-950790747|, ~x$w_buff1~0=~x$w_buff1~0_In-950790747, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-950790747, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In-950790747, ~x~0=~x~0_In-950790747} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite3] because there is no mapped edge [2019-12-27 02:27:36,697 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [708] [708] L739-4-->L740: Formula: (= v_~x~0_30 |v_P0Thread1of1ForFork0_#t~ite3_10|) InVars {P0Thread1of1ForFork0_#t~ite3=|v_P0Thread1of1ForFork0_#t~ite3_10|} OutVars{P0Thread1of1ForFork0_#t~ite3=|v_P0Thread1of1ForFork0_#t~ite3_9|, P0Thread1of1ForFork0_#t~ite4=|v_P0Thread1of1ForFork0_#t~ite4_13|, ~x~0=v_~x~0_30} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite3, P0Thread1of1ForFork0_#t~ite4, ~x~0] because there is no mapped edge [2019-12-27 02:27:36,698 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [766] [766] L795-->L795-2: Formula: (let ((.cse0 (= 0 (mod ~x$r_buff0_thd3~0_In1355693617 256))) (.cse1 (= 0 (mod ~x$w_buff0_used~0_In1355693617 256)))) (or (and (or .cse0 .cse1) (= ~x$w_buff0_used~0_In1355693617 |P2Thread1of1ForFork2_#t~ite17_Out1355693617|)) (and (= 0 |P2Thread1of1ForFork2_#t~ite17_Out1355693617|) (not .cse0) (not .cse1)))) InVars {~x$r_buff0_thd3~0=~x$r_buff0_thd3~0_In1355693617, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1355693617} OutVars{~x$r_buff0_thd3~0=~x$r_buff0_thd3~0_In1355693617, P2Thread1of1ForFork2_#t~ite17=|P2Thread1of1ForFork2_#t~ite17_Out1355693617|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1355693617} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite17] because there is no mapped edge [2019-12-27 02:27:36,698 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [758] [758] L796-->L796-2: Formula: (let ((.cse1 (= 0 (mod ~x$w_buff1_used~0_In649176392 256))) (.cse0 (= (mod ~x$r_buff1_thd3~0_In649176392 256) 0)) (.cse3 (= 0 (mod ~x$r_buff0_thd3~0_In649176392 256))) (.cse2 (= 0 (mod ~x$w_buff0_used~0_In649176392 256)))) (or (and (or .cse0 .cse1) (or .cse2 .cse3) (= ~x$w_buff1_used~0_In649176392 |P2Thread1of1ForFork2_#t~ite18_Out649176392|)) (and (= 0 |P2Thread1of1ForFork2_#t~ite18_Out649176392|) (or (and (not .cse1) (not .cse0)) (and (not .cse3) (not .cse2)))))) InVars {~x$w_buff1_used~0=~x$w_buff1_used~0_In649176392, ~x$r_buff1_thd3~0=~x$r_buff1_thd3~0_In649176392, ~x$r_buff0_thd3~0=~x$r_buff0_thd3~0_In649176392, ~x$w_buff0_used~0=~x$w_buff0_used~0_In649176392} OutVars{~x$w_buff1_used~0=~x$w_buff1_used~0_In649176392, ~x$r_buff1_thd3~0=~x$r_buff1_thd3~0_In649176392, ~x$r_buff0_thd3~0=~x$r_buff0_thd3~0_In649176392, P2Thread1of1ForFork2_#t~ite18=|P2Thread1of1ForFork2_#t~ite18_Out649176392|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In649176392} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite18] because there is no mapped edge [2019-12-27 02:27:36,699 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [759] [759] L797-->L797-2: Formula: (let ((.cse1 (= (mod ~x$r_buff0_thd3~0_In1747135901 256) 0)) (.cse0 (= 0 (mod ~x$w_buff0_used~0_In1747135901 256)))) (or (and (or .cse0 .cse1) (= |P2Thread1of1ForFork2_#t~ite19_Out1747135901| ~x$r_buff0_thd3~0_In1747135901)) (and (not .cse1) (= 0 |P2Thread1of1ForFork2_#t~ite19_Out1747135901|) (not .cse0)))) InVars {~x$r_buff0_thd3~0=~x$r_buff0_thd3~0_In1747135901, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1747135901} OutVars{~x$r_buff0_thd3~0=~x$r_buff0_thd3~0_In1747135901, P2Thread1of1ForFork2_#t~ite19=|P2Thread1of1ForFork2_#t~ite19_Out1747135901|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1747135901} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite19] because there is no mapped edge [2019-12-27 02:27:36,700 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [777] [777] L798-->L798-2: Formula: (let ((.cse0 (= (mod ~x$r_buff0_thd3~0_In2049178260 256) 0)) (.cse1 (= 0 (mod ~x$w_buff0_used~0_In2049178260 256))) (.cse2 (= (mod ~x$w_buff1_used~0_In2049178260 256) 0)) (.cse3 (= (mod ~x$r_buff1_thd3~0_In2049178260 256) 0))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= 0 |P2Thread1of1ForFork2_#t~ite20_Out2049178260|)) (and (= ~x$r_buff1_thd3~0_In2049178260 |P2Thread1of1ForFork2_#t~ite20_Out2049178260|) (or .cse0 .cse1) (or .cse2 .cse3)))) InVars {~x$w_buff1_used~0=~x$w_buff1_used~0_In2049178260, ~x$r_buff1_thd3~0=~x$r_buff1_thd3~0_In2049178260, ~x$r_buff0_thd3~0=~x$r_buff0_thd3~0_In2049178260, ~x$w_buff0_used~0=~x$w_buff0_used~0_In2049178260} OutVars{P2Thread1of1ForFork2_#t~ite20=|P2Thread1of1ForFork2_#t~ite20_Out2049178260|, ~x$w_buff1_used~0=~x$w_buff1_used~0_In2049178260, ~x$r_buff1_thd3~0=~x$r_buff1_thd3~0_In2049178260, ~x$r_buff0_thd3~0=~x$r_buff0_thd3~0_In2049178260, ~x$w_buff0_used~0=~x$w_buff0_used~0_In2049178260} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite20] because there is no mapped edge [2019-12-27 02:27:36,700 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [803] [803] L798-2-->P2EXIT: Formula: (and (= 0 |v_P2Thread1of1ForFork2_#res.base_5|) (= v_~__unbuffered_cnt~0_73 (+ v_~__unbuffered_cnt~0_74 1)) (= |v_P2Thread1of1ForFork2_#res.offset_5| 0) (= |v_P2Thread1of1ForFork2_#t~ite20_38| v_~x$r_buff1_thd3~0_122)) InVars {P2Thread1of1ForFork2_#t~ite20=|v_P2Thread1of1ForFork2_#t~ite20_38|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_74} OutVars{P2Thread1of1ForFork2_#t~ite20=|v_P2Thread1of1ForFork2_#t~ite20_37|, ~x$r_buff1_thd3~0=v_~x$r_buff1_thd3~0_122, P2Thread1of1ForFork2_#res.base=|v_P2Thread1of1ForFork2_#res.base_5|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_73, P2Thread1of1ForFork2_#res.offset=|v_P2Thread1of1ForFork2_#res.offset_5|} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite20, ~x$r_buff1_thd3~0, P2Thread1of1ForFork2_#res.base, ~__unbuffered_cnt~0, P2Thread1of1ForFork2_#res.offset] because there is no mapped edge [2019-12-27 02:27:36,700 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [782] [782] L740-->L740-2: Formula: (let ((.cse0 (= (mod ~x$r_buff0_thd1~0_In1438172386 256) 0)) (.cse1 (= (mod ~x$w_buff0_used~0_In1438172386 256) 0))) (or (and (or .cse0 .cse1) (= ~x$w_buff0_used~0_In1438172386 |P0Thread1of1ForFork0_#t~ite5_Out1438172386|)) (and (not .cse0) (not .cse1) (= 0 |P0Thread1of1ForFork0_#t~ite5_Out1438172386|)))) InVars {~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In1438172386, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1438172386} OutVars{P0Thread1of1ForFork0_#t~ite5=|P0Thread1of1ForFork0_#t~ite5_Out1438172386|, ~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In1438172386, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1438172386} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite5] because there is no mapped edge [2019-12-27 02:27:36,701 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [769] [769] L741-->L741-2: Formula: (let ((.cse1 (= (mod ~x$r_buff1_thd1~0_In-811689424 256) 0)) (.cse0 (= 0 (mod ~x$w_buff1_used~0_In-811689424 256))) (.cse3 (= 0 (mod ~x$r_buff0_thd1~0_In-811689424 256))) (.cse2 (= (mod ~x$w_buff0_used~0_In-811689424 256) 0))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= |P0Thread1of1ForFork0_#t~ite6_Out-811689424| 0)) (and (= |P0Thread1of1ForFork0_#t~ite6_Out-811689424| ~x$w_buff1_used~0_In-811689424) (or .cse1 .cse0) (or .cse3 .cse2)))) InVars {~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In-811689424, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-811689424, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In-811689424, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-811689424} OutVars{P0Thread1of1ForFork0_#t~ite6=|P0Thread1of1ForFork0_#t~ite6_Out-811689424|, ~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In-811689424, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-811689424, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In-811689424, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-811689424} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite6] because there is no mapped edge [2019-12-27 02:27:36,702 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [761] [761] L742-->L742-2: Formula: (let ((.cse0 (= 0 (mod ~x$r_buff0_thd1~0_In-283792021 256))) (.cse1 (= 0 (mod ~x$w_buff0_used~0_In-283792021 256)))) (or (and (not .cse0) (= |P0Thread1of1ForFork0_#t~ite7_Out-283792021| 0) (not .cse1)) (and (= ~x$r_buff0_thd1~0_In-283792021 |P0Thread1of1ForFork0_#t~ite7_Out-283792021|) (or .cse0 .cse1)))) InVars {~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In-283792021, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-283792021} OutVars{~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In-283792021, P0Thread1of1ForFork0_#t~ite7=|P0Thread1of1ForFork0_#t~ite7_Out-283792021|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-283792021} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite7] because there is no mapped edge [2019-12-27 02:27:36,703 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [774] [774] L743-->L743-2: Formula: (let ((.cse2 (= (mod ~x$w_buff1_used~0_In2130871080 256) 0)) (.cse3 (= (mod ~x$r_buff1_thd1~0_In2130871080 256) 0)) (.cse0 (= (mod ~x$r_buff0_thd1~0_In2130871080 256) 0)) (.cse1 (= (mod ~x$w_buff0_used~0_In2130871080 256) 0))) (or (and (= |P0Thread1of1ForFork0_#t~ite8_Out2130871080| ~x$r_buff1_thd1~0_In2130871080) (or .cse0 .cse1) (or .cse2 .cse3)) (and (= |P0Thread1of1ForFork0_#t~ite8_Out2130871080| 0) (or (and (not .cse2) (not .cse3)) (and (not .cse0) (not .cse1)))))) InVars {~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In2130871080, ~x$w_buff1_used~0=~x$w_buff1_used~0_In2130871080, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In2130871080, ~x$w_buff0_used~0=~x$w_buff0_used~0_In2130871080} OutVars{~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In2130871080, P0Thread1of1ForFork0_#t~ite8=|P0Thread1of1ForFork0_#t~ite8_Out2130871080|, ~x$w_buff1_used~0=~x$w_buff1_used~0_In2130871080, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In2130871080, ~x$w_buff0_used~0=~x$w_buff0_used~0_In2130871080} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite8] because there is no mapped edge [2019-12-27 02:27:36,703 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [787] [787] L743-2-->P0EXIT: Formula: (and (= (+ v_~__unbuffered_cnt~0_44 1) v_~__unbuffered_cnt~0_43) (= 0 |v_P0Thread1of1ForFork0_#res.base_5|) (= v_~x$r_buff1_thd1~0_83 |v_P0Thread1of1ForFork0_#t~ite8_28|) (= |v_P0Thread1of1ForFork0_#res.offset_5| 0)) InVars {P0Thread1of1ForFork0_#t~ite8=|v_P0Thread1of1ForFork0_#t~ite8_28|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_44} OutVars{P0Thread1of1ForFork0_#res.offset=|v_P0Thread1of1ForFork0_#res.offset_5|, P0Thread1of1ForFork0_#t~ite8=|v_P0Thread1of1ForFork0_#t~ite8_27|, P0Thread1of1ForFork0_#res.base=|v_P0Thread1of1ForFork0_#res.base_5|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_43, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_83} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#res.offset, P0Thread1of1ForFork0_#t~ite8, P0Thread1of1ForFork0_#res.base, ~__unbuffered_cnt~0, ~x$r_buff1_thd1~0] because there is no mapped edge [2019-12-27 02:27:36,704 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [702] [702] L825-->L827-2: Formula: (and (or (= (mod v_~x$w_buff0_used~0_107 256) 0) (= (mod v_~x$r_buff0_thd0~0_52 256) 0)) (not (= 0 (mod v_~main$tmp_guard0~0_5 256)))) InVars {~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_52, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_5, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_107} OutVars{~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_52, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_5, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_107} AuxVars[] AssignedVars[] because there is no mapped edge [2019-12-27 02:27:36,704 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [770] [770] L827-2-->L827-4: Formula: (let ((.cse1 (= 0 (mod ~x$w_buff1_used~0_In200899408 256))) (.cse0 (= 0 (mod ~x$r_buff1_thd0~0_In200899408 256)))) (or (and (= |ULTIMATE.start_main_#t~ite24_Out200899408| ~x$w_buff1~0_In200899408) (not .cse0) (not .cse1)) (and (or .cse1 .cse0) (= ~x~0_In200899408 |ULTIMATE.start_main_#t~ite24_Out200899408|)))) InVars {~x$w_buff1~0=~x$w_buff1~0_In200899408, ~x$w_buff1_used~0=~x$w_buff1_used~0_In200899408, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In200899408, ~x~0=~x~0_In200899408} OutVars{~x$w_buff1~0=~x$w_buff1~0_In200899408, ULTIMATE.start_main_#t~ite24=|ULTIMATE.start_main_#t~ite24_Out200899408|, ~x$w_buff1_used~0=~x$w_buff1_used~0_In200899408, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In200899408, ~x~0=~x~0_In200899408} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite24] because there is no mapped edge [2019-12-27 02:27:36,704 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [745] [745] L827-4-->L828: Formula: (= v_~x~0_53 |v_ULTIMATE.start_main_#t~ite24_8|) InVars {ULTIMATE.start_main_#t~ite24=|v_ULTIMATE.start_main_#t~ite24_8|} OutVars{ULTIMATE.start_main_#t~ite24=|v_ULTIMATE.start_main_#t~ite24_7|, ULTIMATE.start_main_#t~ite25=|v_ULTIMATE.start_main_#t~ite25_8|, ~x~0=v_~x~0_53} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite24, ULTIMATE.start_main_#t~ite25, ~x~0] because there is no mapped edge [2019-12-27 02:27:36,704 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [773] [773] L828-->L828-2: Formula: (let ((.cse1 (= (mod ~x$w_buff0_used~0_In-1670484116 256) 0)) (.cse0 (= (mod ~x$r_buff0_thd0~0_In-1670484116 256) 0))) (or (and (or .cse0 .cse1) (= ~x$w_buff0_used~0_In-1670484116 |ULTIMATE.start_main_#t~ite26_Out-1670484116|)) (and (= |ULTIMATE.start_main_#t~ite26_Out-1670484116| 0) (not .cse1) (not .cse0)))) InVars {~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In-1670484116, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1670484116} OutVars{~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In-1670484116, ULTIMATE.start_main_#t~ite26=|ULTIMATE.start_main_#t~ite26_Out-1670484116|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1670484116} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite26] because there is no mapped edge [2019-12-27 02:27:36,705 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [775] [775] L829-->L829-2: Formula: (let ((.cse3 (= 0 (mod ~x$w_buff0_used~0_In359590778 256))) (.cse2 (= 0 (mod ~x$r_buff0_thd0~0_In359590778 256))) (.cse0 (= (mod ~x$r_buff1_thd0~0_In359590778 256) 0)) (.cse1 (= 0 (mod ~x$w_buff1_used~0_In359590778 256)))) (or (and (= |ULTIMATE.start_main_#t~ite27_Out359590778| ~x$w_buff1_used~0_In359590778) (or .cse0 .cse1) (or .cse2 .cse3)) (and (= 0 |ULTIMATE.start_main_#t~ite27_Out359590778|) (or (and (not .cse3) (not .cse2)) (and (not .cse0) (not .cse1)))))) InVars {~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In359590778, ~x$w_buff1_used~0=~x$w_buff1_used~0_In359590778, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In359590778, ~x$w_buff0_used~0=~x$w_buff0_used~0_In359590778} OutVars{~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In359590778, ~x$w_buff1_used~0=~x$w_buff1_used~0_In359590778, ULTIMATE.start_main_#t~ite27=|ULTIMATE.start_main_#t~ite27_Out359590778|, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In359590778, ~x$w_buff0_used~0=~x$w_buff0_used~0_In359590778} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite27] because there is no mapped edge [2019-12-27 02:27:36,706 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [768] [768] L830-->L830-2: Formula: (let ((.cse1 (= 0 (mod ~x$r_buff0_thd0~0_In1636023723 256))) (.cse0 (= (mod ~x$w_buff0_used~0_In1636023723 256) 0))) (or (and (not .cse0) (= |ULTIMATE.start_main_#t~ite28_Out1636023723| 0) (not .cse1)) (and (or .cse1 .cse0) (= |ULTIMATE.start_main_#t~ite28_Out1636023723| ~x$r_buff0_thd0~0_In1636023723)))) InVars {~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In1636023723, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1636023723} OutVars{~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In1636023723, ULTIMATE.start_main_#t~ite28=|ULTIMATE.start_main_#t~ite28_Out1636023723|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1636023723} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite28] because there is no mapped edge [2019-12-27 02:27:36,707 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [780] [780] L831-->L831-2: Formula: (let ((.cse0 (= (mod ~x$r_buff1_thd0~0_In576040039 256) 0)) (.cse1 (= 0 (mod ~x$w_buff1_used~0_In576040039 256))) (.cse3 (= 0 (mod ~x$w_buff0_used~0_In576040039 256))) (.cse2 (= 0 (mod ~x$r_buff0_thd0~0_In576040039 256)))) (or (and (or .cse0 .cse1) (or .cse2 .cse3) (= ~x$r_buff1_thd0~0_In576040039 |ULTIMATE.start_main_#t~ite29_Out576040039|)) (and (= 0 |ULTIMATE.start_main_#t~ite29_Out576040039|) (or (and (not .cse0) (not .cse1)) (and (not .cse3) (not .cse2)))))) InVars {~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In576040039, ~x$w_buff1_used~0=~x$w_buff1_used~0_In576040039, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In576040039, ~x$w_buff0_used~0=~x$w_buff0_used~0_In576040039} OutVars{~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In576040039, ULTIMATE.start_main_#t~ite29=|ULTIMATE.start_main_#t~ite29_Out576040039|, ~x$w_buff1_used~0=~x$w_buff1_used~0_In576040039, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In576040039, ~x$w_buff0_used~0=~x$w_buff0_used~0_In576040039} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite29] because there is no mapped edge [2019-12-27 02:27:36,713 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [720] [720] L843-->L844: Formula: (and (= v_~x$r_buff0_thd0~0_95 v_~x$r_buff0_thd0~0_94) (not (= 0 (mod v_~weak$$choice2~0_30 256)))) InVars {~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_95, ~weak$$choice2~0=v_~weak$$choice2~0_30} OutVars{~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_94, ULTIMATE.start_main_#t~ite47=|v_ULTIMATE.start_main_#t~ite47_11|, ULTIMATE.start_main_#t~ite46=|v_ULTIMATE.start_main_#t~ite46_14|, ULTIMATE.start_main_#t~ite48=|v_ULTIMATE.start_main_#t~ite48_9|, ~weak$$choice2~0=v_~weak$$choice2~0_30} AuxVars[] AssignedVars[~x$r_buff0_thd0~0, ULTIMATE.start_main_#t~ite47, ULTIMATE.start_main_#t~ite46, ULTIMATE.start_main_#t~ite48] because there is no mapped edge [2019-12-27 02:27:36,714 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [811] [811] L844-->L844-8: Formula: (let ((.cse0 (= 0 (mod ~weak$$choice2~0_In-890814757 256)))) (or (and (not .cse0) (= |ULTIMATE.start_main_#t~ite50_In-890814757| |ULTIMATE.start_main_#t~ite50_Out-890814757|) (= ~x$r_buff1_thd0~0_In-890814757 |ULTIMATE.start_main_#t~ite51_Out-890814757|)) (and (= |ULTIMATE.start_main_#t~ite50_Out-890814757| |ULTIMATE.start_main_#t~ite51_Out-890814757|) (= ~x$r_buff1_thd0~0_In-890814757 |ULTIMATE.start_main_#t~ite50_Out-890814757|) (let ((.cse1 (= 0 (mod ~x$r_buff0_thd0~0_In-890814757 256)))) (or (and (= 0 (mod ~x$w_buff1_used~0_In-890814757 256)) .cse1) (= 0 (mod ~x$w_buff0_used~0_In-890814757 256)) (and .cse1 (= (mod ~x$r_buff1_thd0~0_In-890814757 256) 0)))) .cse0))) InVars {ULTIMATE.start_main_#t~ite50=|ULTIMATE.start_main_#t~ite50_In-890814757|, ~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In-890814757, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-890814757, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In-890814757, ~weak$$choice2~0=~weak$$choice2~0_In-890814757, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-890814757} OutVars{ULTIMATE.start_main_#t~ite50=|ULTIMATE.start_main_#t~ite50_Out-890814757|, ~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In-890814757, ULTIMATE.start_main_#t~ite51=|ULTIMATE.start_main_#t~ite51_Out-890814757|, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-890814757, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In-890814757, ~weak$$choice2~0=~weak$$choice2~0_In-890814757, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-890814757} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite50, ULTIMATE.start_main_#t~ite51] because there is no mapped edge [2019-12-27 02:27:36,715 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [808] [808] L846-->L4: Formula: (and (= |v_ULTIMATE.start___VERIFIER_assert_#in~expression_5| (mod v_~main$tmp_guard1~0_11 256)) (= v_~x$mem_tmp~0_32 v_~x~0_141) (not (= 0 (mod v_~x$flush_delayed~0_43 256))) (= v_~x$flush_delayed~0_42 0)) InVars {~x$flush_delayed~0=v_~x$flush_delayed~0_43, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_11, ~x$mem_tmp~0=v_~x$mem_tmp~0_32} OutVars{ULTIMATE.start_main_#t~ite52=|v_ULTIMATE.start_main_#t~ite52_18|, ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_11, ~x$flush_delayed~0=v_~x$flush_delayed~0_42, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_11, ~x$mem_tmp~0=v_~x$mem_tmp~0_32, ~x~0=v_~x~0_141, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_5|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite52, ULTIMATE.start___VERIFIER_assert_~expression, ~x$flush_delayed~0, ~x~0, ULTIMATE.start___VERIFIER_assert_#in~expression] because there is no mapped edge [2019-12-27 02:27:36,715 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [793] [793] L4-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= v_ULTIMATE.start___VERIFIER_assert_~expression_10 |v_ULTIMATE.start___VERIFIER_assert_#in~expression_4|) (= v_ULTIMATE.start___VERIFIER_assert_~expression_10 0)) InVars {ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_4|} OutVars{ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_10, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_4|} AuxVars[] AssignedVars[ULTIMATE.start___VERIFIER_assert_~expression] because there is no mapped edge [2019-12-27 02:27:36,818 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 27.12 02:27:36 BasicIcfg [2019-12-27 02:27:36,818 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-27 02:27:36,820 INFO L168 Benchmark]: Toolchain (without parser) took 112326.34 ms. Allocated memory was 143.1 MB in the beginning and 2.9 GB in the end (delta: 2.8 GB). Free memory was 99.2 MB in the beginning and 2.2 GB in the end (delta: -2.1 GB). Peak memory consumption was 689.1 MB. Max. memory is 7.1 GB. [2019-12-27 02:27:36,821 INFO L168 Benchmark]: CDTParser took 0.24 ms. Allocated memory is still 143.1 MB. Free memory was 119.4 MB in the beginning and 119.2 MB in the end (delta: 210.1 kB). Peak memory consumption was 210.1 kB. Max. memory is 7.1 GB. [2019-12-27 02:27:36,821 INFO L168 Benchmark]: CACSL2BoogieTranslator took 853.10 ms. Allocated memory was 143.1 MB in the beginning and 200.3 MB in the end (delta: 57.1 MB). Free memory was 98.8 MB in the beginning and 151.5 MB in the end (delta: -52.7 MB). Peak memory consumption was 20.6 MB. Max. memory is 7.1 GB. [2019-12-27 02:27:36,822 INFO L168 Benchmark]: Boogie Procedure Inliner took 62.66 ms. Allocated memory is still 200.3 MB. Free memory was 151.5 MB in the beginning and 148.7 MB in the end (delta: 2.8 MB). Peak memory consumption was 2.8 MB. Max. memory is 7.1 GB. [2019-12-27 02:27:36,823 INFO L168 Benchmark]: Boogie Preprocessor took 40.28 ms. Allocated memory is still 200.3 MB. Free memory was 148.7 MB in the beginning and 145.9 MB in the end (delta: 2.8 MB). Peak memory consumption was 2.8 MB. Max. memory is 7.1 GB. [2019-12-27 02:27:36,823 INFO L168 Benchmark]: RCFGBuilder took 881.65 ms. Allocated memory is still 200.3 MB. Free memory was 145.9 MB in the beginning and 95.3 MB in the end (delta: 50.6 MB). Peak memory consumption was 50.6 MB. Max. memory is 7.1 GB. [2019-12-27 02:27:36,824 INFO L168 Benchmark]: TraceAbstraction took 110483.10 ms. Allocated memory was 200.3 MB in the beginning and 2.9 GB in the end (delta: 2.7 GB). Free memory was 94.6 MB in the beginning and 2.2 GB in the end (delta: -2.1 GB). Peak memory consumption was 627.4 MB. Max. memory is 7.1 GB. [2019-12-27 02:27:36,828 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.24 ms. Allocated memory is still 143.1 MB. Free memory was 119.4 MB in the beginning and 119.2 MB in the end (delta: 210.1 kB). Peak memory consumption was 210.1 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 853.10 ms. Allocated memory was 143.1 MB in the beginning and 200.3 MB in the end (delta: 57.1 MB). Free memory was 98.8 MB in the beginning and 151.5 MB in the end (delta: -52.7 MB). Peak memory consumption was 20.6 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 62.66 ms. Allocated memory is still 200.3 MB. Free memory was 151.5 MB in the beginning and 148.7 MB in the end (delta: 2.8 MB). Peak memory consumption was 2.8 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 40.28 ms. Allocated memory is still 200.3 MB. Free memory was 148.7 MB in the beginning and 145.9 MB in the end (delta: 2.8 MB). Peak memory consumption was 2.8 MB. Max. memory is 7.1 GB. * RCFGBuilder took 881.65 ms. Allocated memory is still 200.3 MB. Free memory was 145.9 MB in the beginning and 95.3 MB in the end (delta: 50.6 MB). Peak memory consumption was 50.6 MB. Max. memory is 7.1 GB. * TraceAbstraction took 110483.10 ms. Allocated memory was 200.3 MB in the beginning and 2.9 GB in the end (delta: 2.7 GB). Free memory was 94.6 MB in the beginning and 2.2 GB in the end (delta: -2.1 GB). Peak memory consumption was 627.4 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks LbeTime: 5.1s, 177 ProgramPointsBefore, 98 ProgramPointsAfterwards, 214 TransitionsBefore, 109 TransitionsAfterwards, 17074 CoEnabledTransitionPairs, 7 FixpointIterations, 34 TrivialSequentialCompositions, 42 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 36 ConcurrentYvCompositions, 30 ChoiceCompositions, 5956 VarBasedMoverChecksPositive, 212 VarBasedMoverChecksNegative, 43 SemBasedMoverChecksPositive, 249 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 1.5s, 0 MoverChecksTotal, 83692 CheckedPairsTotal, 112 TotalNumberOfCompositions - CounterExampleResult [Line: 4]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L817] FCALL, FORK 0 pthread_create(&t1019, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0] [L819] FCALL, FORK 0 pthread_create(&t1020, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0] [L753] 2 x$w_buff1 = x$w_buff0 [L754] 2 x$w_buff0 = 2 [L755] 2 x$w_buff1_used = x$w_buff0_used [L756] 2 x$w_buff0_used = (_Bool)1 [L768] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0] [L768] 2 x = x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) [L769] 2 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used [L770] 2 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$w_buff1_used [L821] FCALL, FORK 0 pthread_create(&t1021, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=1, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0] [L782] 3 y = 1 [L785] 3 z = 1 [L788] 3 __unbuffered_p2_EAX = z [L791] 3 __unbuffered_p2_EBX = a VAL [__unbuffered_cnt=1, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L794] 3 x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x) VAL [__unbuffered_cnt=1, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L733] 1 a = 1 [L736] 1 x = 1 VAL [__unbuffered_cnt=1, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x=2, y=1, z=1] [L739] 1 x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd1 ? x$w_buff1 : x) VAL [__unbuffered_cnt=1, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x=2, y=1, z=1] [L795] 3 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$w_buff0_used [L796] 3 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$w_buff1_used [L797] 3 x$r_buff0_thd3 = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$r_buff0_thd3 [L740] 1 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used [L741] 1 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$w_buff1_used [L742] 1 x$r_buff0_thd1 = x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1 [L823] 0 main$tmp_guard0 = __unbuffered_cnt == 3 VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L828] 0 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used [L829] 0 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$w_buff1_used [L830] 0 x$r_buff0_thd0 = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0 [L831] 0 x$r_buff1_thd0 = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$r_buff1_thd0 [L834] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L835] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L836] 0 x$flush_delayed = weak$$choice2 [L837] 0 x$mem_tmp = x VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=2, x$flush_delayed=1, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L838] EXPR 0 !x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff1) VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=2, x$flush_delayed=1, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L838] 0 x = !x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff1) [L839] EXPR 0 weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff0)) VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=2, x$flush_delayed=1, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L839] 0 x$w_buff0 = weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff0)) [L840] EXPR 0 weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff1 : x$w_buff1)) VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=2, x$flush_delayed=1, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L840] 0 x$w_buff1 = weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff1 : x$w_buff1)) [L841] EXPR 0 weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used)) VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=2, x$flush_delayed=1, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L841] 0 x$w_buff0_used = weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used)) [L842] EXPR 0 weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=2, x$flush_delayed=1, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L842] 0 x$w_buff1_used = weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L844] 0 x$r_buff1_thd0 = weak$$choice2 ? x$r_buff1_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff1_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L845] 0 main$tmp_guard1 = !(x == 2 && __unbuffered_p1_EAX == 0 && __unbuffered_p2_EAX == 1 && __unbuffered_p2_EBX == 0) VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=2, x$flush_delayed=1, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 168 locations, 2 error locations. Result: UNSAFE, OverallTime: 110.1s, OverallIterations: 16, TraceHistogramMax: 1, AutomataDifference: 25.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 2339 SDtfs, 3202 SDslu, 6409 SDs, 0 SdLazy, 2732 SolverSat, 259 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 4.1s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 166 GetRequests, 15 SyntacticMatches, 5 SemanticMatches, 146 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 789 ImplicationChecksByTransitivity, 2.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=223048occurred in iteration=3, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 51.7s AutomataMinimizationTime, 15 MinimizatonAttempts, 75363 StatesRemovedByMinimization, 12 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 1.8s InterpolantComputationTime, 724 NumberOfCodeBlocks, 724 NumberOfCodeBlocksAsserted, 16 NumberOfCheckSat, 641 ConstructedInterpolants, 0 QuantifiedInterpolants, 220107 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 15 InterpolantComputations, 15 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! Received shutdown request...